Results 81 to 90 of about 16,467 (249)
Linear and Integer Linear Programming
Abstract This first chapter recalls the main notions of linear programming, that is, the primal and dual formulations as well as necessary and sufficient optimality conditions. We also describe the primal simplex algorithm and discuss some aspects of integer linear programs.
Jacques Desrosiers +3 more
openaire +1 more source
Tailoring Symmetry Breaking in Engineered van der Waals Superlattices
Advanced Materials, EarlyView.We pioneer a scheme to tailor superpotentials in graphene based on intrinsic substrate electronic orders rather than twist angle. The resulting superpotential folds graphene's Dirac cones to either Γ$\Gamma$ or K‐points, leading to distinct symmetry behaviors.
Keda Jin +7 more
wiley +1 more source
Advanced Materials Technologies, EarlyView.Coaxial melt electrowriting is established to produce dual‐property microfibers with diameters spanning 1.6–29.2 µm. Stable coaxial laminar flow is preserved under electrohydrodynamic thinning, enabling controlled binary and gradient material switching within individual continuous fibers.
Patrick C. Hall +11 more
wiley +1 more source
Advanced Materials Technologies, EarlyView.Microstructures fabricated by two‐beam DLIP combining spatial‐period and roughness gradients are fabricated to enhance directional transport of water droplets. The coupled gradients increase transport distance by 160% and strongly suppress motion against the gradient, demonstrating an effective strategy for controlled droplet manipulation.
Tianhao Wu +3 more
wiley +1 more source
Continuum Mechanics Modeling of Flexible Spring Joints in Surgical Robots
Advanced Robotics Research, EarlyView.A new mechanical model of a tendon‐actuated helical extension spring joint in surgical robots is built using Cosserat rod theory. The model can implicitly handle the unknown contacts between adjacent coils and numerically predict spring shapes from straight to significantly bent under actuation forces.
Botian Sun +3 more
wiley +1 more source
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
Advanced Robotics Research, EarlyView.A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang +5 more
wiley +1 more source
Consensus Formation and Change are Enhanced by Neutrality
Advanced Science, EarlyView.Neutral agents are shown to enhance both the formation and overturning of consensus in collective decision‐making. A general mathematical model and experiments with locusts and humans reveal that neutrality enables robust consensus via simple interactions and accelerates consensus change by reducing effective population size.
Andrei Sontag +3 more
wiley +1 more source
Generating Texts with Integer Linear Programming
CoRR, 2018 Concept-to-text generation typically employs a pipeline architecture, which often leads to suboptimal texts. Content selection, for example, may greedily select the most important facts, which may require, however, too many words to express, and this may be undesirable when space is limited or expensive.
Gerasimos Lampouras, Ion Androutsopoulos
openaire +2 more sources
Helix Alignment, Chevrons, and Edge Dislocations in Twist‐Bend Ferroelectric Nematics
Advanced Science, EarlyView.The recently discovered twist‐bend ferroelectric nematic (NTBF) is the new member of the multiferroic family, representing a fluid with an oblique helicoidal (heliconical) periodic structure of spontaneous electric polarization. The work presents a thorough exploration of the material properties of this phase, how the periodic modulation of ...
Bijaya Basnet +8 more
wiley +1 more source
Branch and Bound Algorithm for a Discrete Multilevel Linear Fractional Programming Problem
Operations Research and Decisions, 2018 An algorithm is proposed to find an integer solution for bilevel linear fractional programming problem with discrete variables. The method develops a cut that removes the integer solutions which are not bilevel feasible.
Ritu Arora, Kavita Gupta
doaj