Results 51 to 60 of about 1,321,024 (261)
We present three new approximation algorithms with improved constant ratios for selecting $n$ points in $n$ disks such that the minimum pairwise distance among the points is maximized.
Dumitrescu, Adrian, Jiang, Minghui
core +2 more sources
Program transformations using temporal logic side conditions [PDF]
This paper describes an approach to program optimisation based on transformations, where temporal logic is used to specify side conditions, and strategies are created which expand the repertoire of transformations and provide a suitable level of ...
Aho A. V.+20 more
core +2 more sources
Transportation Cost Assessment by Means of a Monte Carlo Simulation in a Transshipment Model
The task of transport management is to organize the transportof goods from a number of sources to a number of destinationswith minimum total costs.
Gordana Dukić+2 more
doaj +1 more source
Decidable Verification of Uninterpreted Programs [PDF]
We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification problem asks whether a given program satisfies a postcondition written using quantifier-free formulas with equality
arxiv +1 more source
The Saccharomyces cerevisiae amino acid transporter Lyp1 has a broad substrate spectrum
In Saccharomyces cerevisiae, Yeast Amino acid Transporter family members mediate the import of amino acids, ranging from substrate specialists to generalists. Here, we show that the specialist transporter, Lyp1, has a broader substrate spectrum than previously described, with affinity constants spanning from micromolar to millimolar.
Foteini Karapanagioti+3 more
wiley +1 more source
Performance analysis of control allocation using data‐driven integral quadratic constraints
Abstract A new method is presented for evaluating the performance of a nonlinear control allocation system within a linear control loop. To that end, a worst‐case gain analysis problem is formulated that can be readily solved by means of well‐established methods from robustness analysis using integral quadratic constraints (IQCs).
Manuel Pusch+2 more
wiley +1 more source
Ion channel function of polycystin‐2/polycystin‐1 heteromer revealed by structure‐guided mutagenesis
Mutations in polycystin‐1 (PC1) or polycystin‐2 (PC2) cause autosomal‐dominant polycystic kidney disease (ADPKD). We generated a novel gain‐of‐function PC2/PC1 heteromeric ion channel by mutating pore‐blocking residues. Moreover, we demonstrated that PC2 will preferentially assemble with PC1 to form heteromeric complexes when PC1 is co‐expressed ...
Tobias Staudner+7 more
wiley +1 more source
The study presents the mechanical and in situ sensing performance of digital light processing‐enabled 2D lattice nanocomposites under monotonic tensile and repeated cyclic loading, and provides guidelines for the design of architectures suitable for strain sensors and smart lightweight structures.
Omar Waqas Saadi+3 more
wiley +1 more source
An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer [PDF]
Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and communicate locally via wireless ...
Coore, Daniel, Nagpal, Radhika
core +2 more sources
Semi-Automated SVG Programming via Direct Manipulation
Direct manipulation interfaces provide intuitive and interactive features to a broad range of users, but they often exhibit two limitations: the built-in features cannot possibly cover all use cases, and the internal representation of the content is not ...
Cypher A.+7 more
core +1 more source