Results 81 to 90 of about 3,263,133 (311)

Transferrin receptor 1‐mediated iron uptake supports thermogenic activation in human cervical‐derived adipocytes

open access: yesFEBS Letters, EarlyView.
In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai   +9 more
wiley   +1 more source

The Interpreting Ability on Science Kinematics Graphs of Senior High School Students in South Sulawesi, Indonesia

open access: yesJurnal Pendidikan IPA Indonesia, 2020
This research was a descriptive case study. The purpose of this research was to describe the student’s ability to interpret the kinematics graph. The subjects of the study were 347 students of class XI science in the even semester of 2018/2019 in Luwu ...
B. D. Amin   +5 more
doaj   +1 more source

On Almost Well-Covered Graphs of Girth at Least 6

open access: yes, 2018
We consider a relaxation of the concept of well-covered graphs, which are graphs with all maximal independent sets of the same size. The extent to which a graph fails to be well-covered can be measured by its independence gap, defined as the difference ...
Ekim, Tınaz   +3 more
core   +1 more source

Tau acetylation at K331 has limited impact on tau pathology in vivo

open access: yesFEBS Letters, EarlyView.
We mapped tau post‐translational modifications in humanized MAPT knock‐in mice and in amyloid‐bearing double knock‐in mice. Acetylation within the repeat domain, particularly around K331, showed modest increases under amyloid pathology. To test functional relevance, we generated MAPTK331Q knock‐in mice.
Shoko Hashimoto   +3 more
wiley   +1 more source

Geometric Biplane Graphs I: Maximal Graphs [PDF]

open access: yesGraphs and Combinatorics, 2015
We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the sense that no edge can be added while staying biplane---may differ in the number of edges, and we provide an ...
Garcia Olaverri, Alfredo Martin   +7 more
openaire   +5 more sources

Aggressive prostate cancer is associated with pericyte dysfunction

open access: yesMolecular Oncology, EarlyView.
Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero   +11 more
wiley   +1 more source

La enseñanza de los gráficos estadísticos: reseña de un libro de texto interactivo para tercer año de la educación costarricense (The teaching of statistical graphs: review of an interactive textbook for third grade in Costa Rican education)

open access: yesRevista Digital Matemática, Educación e Internet
Este artículo presenta un libro interactivo de estadística destinado al tercer año de primaria, dirigido a niños y niñas de entre 8 y 9 años aproximadamente.
Carlos Monge Madriz   +3 more
doaj   +1 more source

Solving the Large-Scale TSP Problem in 1 h: Santa Claus Challenge 2020

open access: yesFrontiers in Robotics and AI, 2021
The scalability of traveling salesperson problem (TSP) algorithms for handling large-scale problem instances has been an open problem for a long time. We arranged a so-called Santa Claus challenge and invited people to submit their algorithms to solve a ...
Radu Mariescu-Istodor, Pasi Fränti
doaj   +1 more source

Graphs whose line graphs are ring graphs [PDF]

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Given a graph H, a path of length at least two is called an H-path if meets H exactly in its ends. A graph G is a ring graph if each block of G which is not a bridge or a vertex can be constructed inductively by starting from a single cycle and then in each step adding an H-path that meets graph H in the previous step in two adjacent vertices.
openaire   +2 more sources

Geometric Biplane Graphs II: Graph Augmentation [PDF]

open access: yesGraphs and Combinatorics, 2015
We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-connected biplane graph and that there are arbitrarily large point sets that do not admit ...
Hurtado Díaz, Fernando Alfredo   +7 more
openaire   +5 more sources

Home - About - Disclaimer - Privacy