The paper is presenting a new method for the management of the traffic flow on highways, based on the constant time to collision criterion. The criterion is applied at two levels, for each car implied in traffic, and for the whole highway. Each car is provided with a constant time to collision cruise controller, that is maintaining optimal distance-gaps between cars, in accordance to the techni...

In this paper we give a simple algorithm to generate all partitions of {1, 2, · · · , n} into k non-empty subsets. The number of such partitions is known as the Stirling number of the second kind. The algorithm generates each partition in constant time without repetition. By choosing k = 1, 2, · · · , n we can also generate all partitions of {1, 2, · · · , n} into subsets. The number of such pa...

This paper derives the dynamic programming equation (DPE) to a differentiable Markov Perfect equilibrium in a problem with non-constant discounting and general functional forms. Beginning with a discrete stage model and taking the limit as the length of the stage goes to 0 leads to the DPE corresponding to the continuous time problem. The note discusses the multiplicity of equilibria under non-...

A sampling-based optimization method for quadratic functions is proposed. Our method approximately solves the following n-dimensional quadratic minimization problem in constant time, which is independent of n: z∗ = minv∈Rn〈v, Av〉 + n〈v,diag(d)v〉 + n〈b,v〉, where A ∈ Rn×n is a matrix and d, b ∈ R are vectors. Our theoretical analysis specifies the number of samples k(δ, ) such that the approximat...

Determination of the rate of energy loss in a reverberation chamber is fundamental to many different measurements such as absorption cross-section, antenna efficiency, radiated power, and shielding effectiveness. Determination of the energy decay time-constant in the time-domain by linear fitting the power delay profile, rather than using the frequencydomain quality-factor, has the advantage of...

An efficient differencing algorithm can be used to compress version of files for both transmission over low bandwidth channels and compact storage. This can greatly reduce network traffic and execution time for distributed applications which include software distribution, source code control, file system replication, and data backup and restore. An algorithm for such applications needs to be bo...

It is shown that the perception of speech is inherently multimodal [16][22]. Auditory-visual speech recognition is more accurate than auditory only or visual only speech recognition [1][10]. Research shows that a synthetic talking face can help people understand the associated speech in noisy environments [16]. It also helps people react more positively in interactive services [20]. In some sit...

__________ Many intelligent systems must respond to sensory data or critical environmental conditions in fixed, predictable time. Rule-based systems, including those based on the efficient Rete matching algorithm, cannot guarantee this result. Improvement in execution-time efficiency is not all that is needed here; it is important to ensure constant, O(1) time limits for portions of the matchin...

Lipton and Zalcstein presented a constant time algorithm for testing if a group is abelian in 12. However, the reference only contains a short abstract without proof. In this paper, we give a self contained proof for an n 2 3 lower bound for the number of pairs (a, b) of elements with ab 6= ba in every non-commutative group of size n. It implies a constant time randomized algorithm that tests i...

We show that the class of perfect graphs known as split graphs can be efficiently recognized in a parallel process environment. Given an undirected graph G = (V, E) with n vertices we define a subgraph G, = (AV, AE) and we prove some properties on G, leading to a constant-time parallel split graph recognition algorithm.