Results 111 to 120 of about 3,844 (297)

3D‐Printing Aided Rapid Prototyping of Pretensioned Tensegrity Structures for Robotic Applications

open access: yesAdvanced Robotics Research, EarlyView.
Printing, injection molding, and assembly (PMA) is a method for rapid prototyping mesoscale, topologically complex, and tensioned tensegrity structures. In combination with PMA method, two mold design strategies: modular mold and compact channel layout, enable efficiency and scalability for tensegrity fabrication.
Yi Sun   +3 more
wiley   +1 more source

Uniform Partitions of 3-space, their Relatives and Embedding

open access: yes, 2000
We review 28 uniform partitions of 3-space in order to find out which of them have graphs (skeletons) embeddable isometrically (or with scale 2) into some cubic latticeZn.
Shtogrin, Mikhail   +3 more
core   +1 more source

Multi-Level Refinement Algorithm of Weighted Hypergraph Partitioning Problem

open access: yesJournal of Intelligent Systems, 2017
The formal description of weighted hypergraph partitioning problem is presented. We describe the solution of the weighted hypergraph partitioning problem based on the multi-level method.
Leng Ming, Sun Ling-yu, Guo Kai-qiang
doaj   +1 more source

Cell Cycle Control of Nuclear Metabolism Couples Phosphatidylinositol Signaling to Histone Methylation

open access: yesAdvanced Science, EarlyView.
Nuclear metabolism oscillates during cell cycle progression. Quantitative chromatome proteomics and imaging reveal phase‐specific dynamics of PIP5K1A and nuclear PIP2, linking phosphatidylinositol metabolism to histone methylation. This work identifies nuclear lipid metabolism as a previously unrecognized regulatory axis coordinating chromatin ...
Antoni Gañez‐Zapater   +13 more
wiley   +1 more source

Characterizing block graphs in terms of their vertex-induced partitions

open access: yes, 2016
Block graphs are a generalization of trees that arise in areas such as metric graph theory, molecular graphs, and phylogenetics. Given a finite connected simple graph $G=(V,E)$ with vertex set $V$ and edge set $E\subseteq \binom{V}{2}$, we will show that
Moulton, Vincent   +4 more
core  

Polychromatic colorings of arbitrary rectangular partitions

open access: yes, 2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex 4-colorings of general partitions where every subrectangle is required to have all four colors appear on
Keszegh, Balázs   +11 more
core   +1 more source

Vertex-ordering and arc-partitioning problems

open access: yesCoRR
We study vertex-ordering problems in loop-free digraphs subject to constraints on the left-going arcs, focusing on existence conditions and computational complexity. As an intriguing special case, we explore vertex-specific lower and upper bounds on the left-outdegrees and right-indegrees. We show, for example, that deciding whether the left-going arcs
Nóra A. Borsik, Péter Madarasi
openaire   +2 more sources

PET Imaging of Cardiac Inflammation in Viral Myocarditis Using a DPP4‐Targeted Probe

open access: yesAdvanced Science, EarlyView.
This study describes a DPP4‐targeted PET probe for imaging myocardial inflammation by selectively targeting activated immune cells. Derived from the clinically approved small‐molecule inhibitor linagliptin, the probe demonstrates favorable biodistribution with specific cardiac uptake in myocarditis.
Wanhao Gao   +14 more
wiley   +1 more source

Ecological Adaptation Mechanisms Underlying Successful Plant Reproduction

open access: yesAdvanced Science, EarlyView.
During floral induction, various environmental and endogenous signals converge to regulate the florigen protein, which is transported from leaves to the SAM to initiate flowering. Within the SAM, a complex network of receptor kinases and small peptides orchestrates floral development with high spatiotemporal precision.
Hang Zhao   +8 more
wiley   +1 more source

The 0-1 inverse maximum stable set problem [PDF]

open access: yes
Given an instance of a weighted combinatorial optimization problem and its feasible solution, the usual inverse problem is to modify as little as possible (with respect to a fixed norm) the given weight system to make the giiven feasible solution optimal.
Yerim Chung, Marc Demange
core  

Home - About - Disclaimer - Privacy