Results 81 to 90 of about 99,998 (314)
A method for generating a well-distributed Pareto set in nonlinear multiobjective optimization [PDF]
A method is presented for generating a well-distributed Pareto set in nonlinear multiobjective optimization. The approach shares conceptual similarity with the Physical Programming-based method, the Normal-Boundary Intersection and the Normal ...
Utyuzhnikov, S.V.; id_orcid +7 more
core +1 more source
Inspired by the octopus and the golden wheel spider, soft robots with liquid crystal elastomer arc fibers as appendages are fabricated to transcend surface constraints through an elevated center of mass and minimal contact footprints. By leveraging curvature‐encoded deformation‐recovery cycles, these robots exhibit contractile, torsional, and flexural ...
Jong Bin Kim +5 more
wiley +1 more source
The convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $D\subseteq V$ is a dominating set of $G$ if every vertex in $V\setminus D$ has at least one neighbor in $D$. The distance $d_G(u,v)$ between two vertices $u$ and $v$ is the length of a shortest $(u,v)$-
M. Dettlaff +3 more
doaj +1 more source
Mas-Colell Bargaining Set of Large Games [PDF]
We study the equivalence between the MB-set and the core in the general context of games with a measurable space of players. In the first part of the paper, we study the problem without imposing any restriction on the class of games we consider.
Luigi Montrucchio, Massimiliano Amarante
core
Phase Diagrams Enable Solid‐State Battery Design
Batteries are non‐equilibrium devices with inherent thermodynamic driving forces to react at interfaces, regardless of kinetics or operating conditions. Chemical potential mismatches across interfaces are dissipated via interfacial reactions. In this work, it is illustrated how phase diagrams and chemical potential maps predict degradation pathways but
Nathaniel L. Skeele, Matthias T. Agne
wiley +1 more source
On the Computational Complexity of Optimization Convex Covering Problems of Graphs [PDF]
In this paper we present further studies of convex covers and convex partitions of graphs. Let $G$ be a finite simple graph. A set of vertices $S$ of $G$ is convex if all vertices lying on a shortest path between any pair of vertices of $S$ are in $S ...
Radu Buzatu
doaj
Schematic illustration of a sustainable nanofabrication process: chitosan derived from natural sources is used as a biodegradable thin film resist, patterned via Constant Pulse‐Assisted Force Lithography (CP‐AFL) to create tunable nanogrooves. These grooves template gold nanowire formation, enabling high‐resolution nanopatterning under ambient ...
Paolo Pellegrino +7 more
wiley +1 more source
This review explores advances in wearable and lab‐on‐chip technologies for breast cancer detection. Covering tactile, thermal, ultrasound, microwave, electrical impedance tomography, electrochemical, microelectromechanical, and optical systems, it highlights innovations in flexible electronics, nanomaterials, and machine learning.
Neshika Wijewardhane +4 more
wiley +1 more source
Set Containment Characterization
Characterization of the containment of a polyhedral set in a closed halfspace, a key factor in generating knowledge-based support vector machine classi ers [7], is extended to the following: (i) Containment of one polyhedral set in another.
Mangasarian, Olvi
core
The expected convex hull trimmed regions of a sample [PDF]
Given a data set in the multivariate Euclidean space, we study regions of central points built by averaging all their subsets with a fixed number of elements.
Cascos Fernández, Ignacio +1 more
core

