Naoki Yamamoto

ORCID: 0000-0003-1106-4491
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Logic, programming, and type systems
  • Bacterial Genetics and Biotechnology
  • Model-Driven Software Engineering Techniques
  • Parasite Biology and Host Interactions
  • Aquatic life and conservation
  • Genetic and Kidney Cyst Diseases
  • Biomedical Research and Pathophysiology
  • Gene Regulatory Network Analysis
  • Vector-borne infectious diseases
  • Salmonella and Campylobacter epidemiology
  • Evolution and Genetic Dynamics
  • Alcoholism and Thiamine Deficiency
  • Coastal wetland ecosystem dynamics
  • Identification and Quantification in Food
  • Parallel Computing and Optimization Techniques
  • Infectious Encephalopathies and Encephalitis
  • Marine and coastal plant biology
  • Cephalopods and Marine Biology
  • Antibiotic Resistance in Bacteria
  • Formal Methods in Verification
  • Software Engineering Research
  • Advanced Database Systems and Queries
  • Marine Biology and Ecology Research
  • Parathyroid Disorders and Treatments
  • Neurological and metabolic disorders

Waseda University
2018-2024

Uptake of P(i) at the cellular membrane is essential for maintenance cell viability. However, phosphate overload also stressful cells and can result in damage. In present study, we investigated effects transgenic overexpression type III transporter Pit-1 to explore role extracellular glomerular sclerosis during chronic renal disease. (TG) rats showed progressive proteinuria associated with hypoalbuminemia dyslipidemia. Ultrastructural analysis TG rat kidney by transmission electron...

10.1152/ajprenal.00334.2010 article EN AJP Renal Physiology 2011-02-10

Graphs are a generalized concept that encompasses more complex data structures than trees, such as difference lists, doubly-linked skip and leaf-linked trees. Normally, these handled with destructive assignments to heaps, which is opposed purely functional programming style makes verification difficult. We propose new language, λGT, handles graphs immutable, first-class pattern matching mechanism based on Graph Transformation developed type system, FGT, for the language. Our approach in...

10.2197/ipsjjip.31.112 article EN Journal of Information Processing 2023-01-01

The ability to handle evolving graph structures is important both for programming languages and modeling languages. Of various that adopt graphs as primary data structures, a rewriting language LMNtal provides features of (concurrent) languages, its implementation unifies ordinary program execution model checking functionalities. Unlike pointer manipulation in imperative allows us manipulate such way the well-formedness guaranteed by itself. However, since shapes can be complex diverse...

10.1109/access.2022.3217913 article EN cc-by-nc-nd IEEE Access 2022-01-01
Coming Soon ...