نتایج جستجو برای: transformable
تعداد نتایج: 660 فیلتر نتایج به سال:
The initial condition problem for fractional linear system initialisation is studied in this paper. It is based on the generalised initial value theorem. The new approach involves functions belonging to the space of Laplace transformable distributions verifying the Watson–Doetsch lemma. The fractional derivatives of these functions are independent of the derivative de,nition. This class include...
Motivated by applications to transition semigroups, we introduce the notion of a norming dual pair and study a Pettis-type integral on such pairs. In particular, we establish a sufficient condition for integrability. We also introduce and study a class of semigroups on such dual pairs which are an abstract version of transition semigroups. Using our results, we prove conditions ensuring that a ...
| This article describes a topological routing path search algorithm embedded in our autorouter for printed circuit boards. The algorithm searches for a topological path that is guaranteed to be transformable into a physical wire satisfying design rules. We propose a method for incrementally verifying design rules during topological path search in a graph based on constrained Delaunay triangula...
Recent developments in the area of smart structures indicate that variable geometry / stiffness truss network is of fundamental importance in designing smart transformable structures and systems for space applications. This paper presents the conceptual design and dynamic modeling of a cooperative re-configurabel dual-arm robotic structure called Dual-Arm Cam-Lock Manipulator. The Manipulator i...
Natural genetic transformation of Streptococcus pneumoniae, an important human pathogen, mediates horizontal gene transfer for the development of drug resistance, modulation of carriage and virulence traits, and evasion of host immunity. Transformation frequency differs greatly among pneumococcal clinical isolates, but the molecular basis and biological importance of this interstrain variabilit...
We prove a complexity dichotomy theorem for Holant problems over an arbitrary set of complex-valued symmetric constraint functions F on Boolean variables. This extends and unifies all previous dichotomies for Holant problems on symmetric constraint functions (taking values without a finite modulus). We define and characterize all symmetric vanishing signatures. They turned out to be essential t...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید