We propose a general technique related to the polytopal Sperner lemma for proving old and new multilabeled versions of Sperner’s lemma. A notable application of this technique yields a cake-cutting theorem where the number of players and the number of pieces can be independently chosen. We also prove multilabeled versions of Fan’s lemma, a combinatorial analogue of the Borsuk-Ulam theorem, and ...

Thi spaperdi scussesstochasti cextensi onsofasi mpl eprocessal gebrai nacausal i ty-based setti ng. Atomi c acti ons are supposed to happen after a del ay that i s deter-mi ned bya stochasti c vari abl e wi th acertai n di stri buti on. Asi mpl e stochasti c type of event structures i s di scussed, restri cti ng the di stri buti on functi ons to be expo-nenti al. Acorrespondi ngoperati onalsema...

Let {Xi},i = l, • • • , be a sequence of independent and identically distributed random variables with density function f(x). We shall assume throughout that EXi=p>0. Let {Sn}, n = l, • • • , be the sequence of cumulative sums Sn= 23"-1 -^«'Let H(x) = 23»= i P(Sn ^x) and h(x)=H'(x). Since H(x) is nondecreasing, h(x) is defined for almost all x. Let A be any Borel set of positive real numbers an...

We wish to navigate across complicated three-dimensional structures. We describe a robot that can propel itself on a web of surfaces oriented around arbitrary directions in three-space. This robot is an inchworm-like robot with a simple, modular, and exi-ble design. We present control algorithms for the task-level skills that allow the robot to walk vertically, horizontally , and inverted, and ...

We investigate the characteristics of constant-amplitude input shapers for robust time-optimal maneuvers of exi-ble structures. Trends in the timing of the shaper impulses are shown as a function of the system damping constant and move distance. The insensitivity to modeling errors, time-optimality, amount of vibration caused during maneuvers, and high frequency excitation of these shapers are ...

From the viewpoint of multilingual generation, the common underlying knowledge base should be kept clear of language-speciic concepts. This goal presupposes that lexical items of various languages cannot map one-to-one onto concepts all the time. We propose a more exi-ble way of attaching lexical items to conngurations of concepts and roles, and a lexical option nder that determines the set of ...

Different from many previous energy-efficient scheduling studies, this paper explores energy-efficient multiprocessor scheduling of periodic real-time tasks with different power consumption functions. When the goal is on the minimization of energy consumption, we propose a 1.412approximation algorithm in the derivation of a feasible schedule. A series of simulation experiments was done for the ...

sohrabi and nalchigar (2010) proposed a new data envelopment analysis (dea) model to identify the most efficient decision-making unit (dmu) in presence of imprecise data. in this paper, it is shown that the proposed model is not able to determine the most efficient dmu and is randomly introduced an efficient dmu. in addition, it is shown that this model determines the most efficient dmu in the ...

Most research on run-time efficiency in information extraction is of empirical nature. This paper analyzes the efficiency of information extraction pipelines from a theoretical point of view in order to explain empirical findings. We argue that information extraction can, at its heart, be viewed as a relevance filtering task whose efficiency traces back to the run-times and selectivities of the...