Results 41 to 50 of about 6,410,351 (366)

Symmetrized separable convex programming [PDF]

open access: yesTransactions of the American Mathematical Society, 1979
The duality model for convex programming studied recently by E. L. Peterson is analyzed from the viewpoint of perturbational duality theory. Relationships with the traditional Lagrangian model for ordinary programming are explored in detail, with particular emphasis placed on the respective dual problems, Kuhn-Tucker vectors, and extremality conditions.
openaire   +2 more sources

Highly Robust Error Correction by Convex Programming [PDF]

open access: yes, 2008
This paper discusses a stylized communications problem where one wishes to transmit a real-valued signal x ∈ ℝ^n (a block of n pieces of information) to a remote receiver.
Candès, Emmanuel J., Randall, Paige A.
core   +1 more source

Domain associated with zinc fingers‐containing NF90‐NF45 complex inhibits m6A modification of primary microRNA by suppressing METTL3/14 activity

open access: yesFEBS Open Bio, EarlyView.
NF90–NF45 functions as a negative regulator of methyltransferase‐like 3/14 (METTL3/14)‐mediated N6‐methyladenosine (m6A) modification on primary microRNAs (pri‐miRNAs). NF90–NF45 binds to anti‐oncogenic pri‐miRNAs and inhibits their m6A modification, thereby suppressing the biogenesis of anti‐oncogenic miRNAs.
Takuma Higuchi   +6 more
wiley   +1 more source

Hopfield Neural Networks for Online Constrained Parameter Estimation With Time‐Varying Dynamics and Disturbances

open access: yesInternational Journal of Adaptive Control and Signal Processing, EarlyView.
This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley   +1 more source

A numerical approach for optimal control model of the convex semi-infinite programming [PDF]

open access: yesIranian Journal of Optimization, 2015
In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the
Hamid Rouhparvar
doaj   +4 more sources

A convex-programming-based guidance algorithm to capture a tumbling object on orbit using a spacecraft equipped with a robotic manipulator

open access: yesInt. J. Robotics Res., 2018
An algorithm to guide the capture of a tumbling resident space object by a spacecraft equipped with a robotic manipulator is presented. A solution to the guidance problem is found by solving a collection of convex programming problems.
Josep Virgili-Llop   +4 more
semanticscholar   +1 more source

Evaluation of the Potential of Laser Shock Peening Compared with Cold Expansion for Improving Fatigue Resistance of Riveted Lap Joints of Aerospace Grade 7175 Al Alloy

open access: yesAdvanced Engineering Materials, EarlyView.
This study investigates laser shock peening for enhancing fatigue performance of riveted aerospace aluminum joints. A comparative approach with cold expansion combines fatigue testing and synchrotron X‐ray methods. Integrating mechanical testing with residual stress and strain characterization provides insights into how different treatments affect the ...
Ogün Baris Tapar   +6 more
wiley   +1 more source

SMC: Satisfiability Modulo Convex Programming

open access: yesProceedings of the IEEE, 2018
The design of cyber–physical systems (CPSs) requires methods and tools that can efficiently reason about the interaction between discrete models, e.g., representing the behaviors of “cyber” components, and continuous models of physical processes. Boolean
Yasser Shoukry   +5 more
semanticscholar   +1 more source

Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints [PDF]

open access: yes, 2011
This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming.
Diehl, Moritz, Quoc, Tran Dinh
core  

Adaptable Tile‐Based Pneumatic Origami through Structurally Coupled Localized Actuation

open access: yesAdvanced Engineering Materials, EarlyView.
This article presents tile‐based pneumatic origami structures with rigid tiles and flexible fabric creases, achieving adaptable properties including morphing shape, selective multistability, and tunable stiffness. Independently pressurized folding bladders at each crease enable structurally coupled localized actuation of origami structures.
Tiantian Li, Jonathan Luntz, Diann Brei
wiley   +1 more source

Home - About - Disclaimer - Privacy