نتایج جستجو برای: generating space

تعداد نتایج: 591714  

Journal: :Interface focus 2012
Philip K Maini Thomas E Woolley Ruth E Baker Eamonn A Gaffney S Seirin Lee

One of the fundamental questions in developmental biology is how the vast range of pattern and structure we observe in nature emerges from an almost uniformly homogeneous fertilized egg. In particular, the mechanisms by which biological systems maintain robustness, despite being subject to numerous sources of noise, are shrouded in mystery. Postulating plausible theoretical models of biological...

2009
Marie-Laure Mugnier

This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual graph rules and on the semantically equivalent knowledge constructs in logic and databases, namely rules with existential variables and tuple-generating dependencies. The aim of this presentation is to synthesize main ...

1994
Scott H. Murray Cheryl E. Praeger

A base and strong generating set provides an effective computer representation for a permutation group. This representation helps us to calculate the group order, list the group elements, generate random elements, test for group membership and store group elements efficiently. Knowledge of a base and strong generating set essentially reduces these tasks to the calculation of certain orbits. Giv...

1997
Laurence A. Kramer

We present a long range planning (LRP) system, the Spike Plan Window Scheduler, which has been in use for observations on the Hubble Space Telescope (HST) for the past four years and which is being adapted for the Space Infrared Telescope Facility (SIRTF) and Next Generation Space Telescope (NGST) orbiting astronomical observatories. Due to the relatively underconstrained nature of this domain,...

2017
KONSTANTINOS KOUMATOS

We prove a characterization result in the spirit of the Kinderlehrer–Pedregal Theorem for Young measures generated by gradients of Sobolev maps satisfying the orientation-preserving constraint, that is the pointwise Jacobian is positive almost everywhere. The argument to construct the appropriate generating sequences from such Young measures is based on a variant of convex integration in conjun...

2014
Julija Tastu Pierre Pinson Henrik Madsen

Emphasis is placed on generating space-time trajectories of wind power generation, consisting of paths sampled from high-dimensional joint predictive densities, describing wind power generation at a number of contiguous locations and successive lead times. A modelling approach taking advantage of the sparsity of precision matrices is introduced for the description of the underlying space-time d...

Journal: :European Journal of Operational Research 2013
Gert van Valkenhoef Tommi Tervonen Douwe Postmus

In our previous work published in this journal, we showed how the Hit-And-Run (HAR) procedure enables efficient sampling of criteria weights from a space formed by restricting a simplex with arbitrary linear inequality constraints. In this short communication, we note that the method for generating a basis of the sampling space can be generalized to also handle arbitrary linear equality constra...

1999
Toyoaki Nishida

Understanding flow in the three-dimensional phase space is challenging both to human experts and current computer science technology. To break through the barrier, we are building a program called PSX3 that can autonomously explore the flow in a three-dimensional phase space, by integrating AI and numerical techniques. In this paper, I point out that quasi-symbolic representation called flow ma...

2003
Stephen T Polyak

This paper describes a design space analysis approach towards a complete planning solution A complete solution is de ned as one containing the resultant plan the context in which it applies and the argument structure that justi es it The focus in this paper is on de ning and communicating the argument struc ture component A perspective of a plan as a spe cialised type of design and planning as ...

Journal: :Eur. J. Comb. 2007
Anna Felikson Pavel Tumarkin

Let P be a convex polytope in the spherical space S, in the Euclidean space E, or in the hyperbolic space H. Consider the group GP generated by reflections in the facets of P . We call GP a reflection group generated by P . The problem we consider in this paper is to list polytopes generating discrete reflection groups. The answer is known only for some combinatorial types of polytopes. Already...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید