In the papers [1, 2, 4–6, 8] the similarities and differences between systems of sequents and systems of natural deduction for some fragments of intuitionistic logic were presented. The main goal of almost all of these papers was to study the connection between cut-free derivations and normal derivations. It is a well-known property that the natural deduction image of a cut-free derivation is a...

As an alternative to communication via messages or files, shared memory has the potential to be simpler, faster, and less wasteful of space. Unfortunately, the mechanisms available for sharing in Unix are not very easy to use. As a result, shared memory tends to appear primarily in self-contained parallel applications, where library or compiler support can take care of the messy details. We hav...

This paper describes the development and the implementation of a line segments based token tracker. Given a sequence of time-varying images, the goal is to track line segments corresponding to the edges extracted from the image being analyzed. We will present a tracking approach that combines a prediction and a matching steps. The prediction step is a Kalman filtering based approach that is use...

Different consumers have varying desires and interests: witness the extensive array of products on supermarket shelves. This variety stems from diverse buying practices and basic variations of customers' needs and the benefits they seek from products. It is almost impossible to satisfy all customers in a market with a single product or service. Companies have responded by offering a proliferati...

Figure 2: Near rectangular dissections in applications. Note that in the applications the areas of the rectangles of a dissection are relevant, actually in most cases these areas are prescribed. A rectangular dissection is area-universal if for any assignment of positive weights to the rectangles there is an equivalent dissection such that the areas of rectangles are equal to the given weights....

The disjointness graph G = G(S) of a set of segments S in R, d ≥ 2, is a graph whose vertex set is S and two vertices are connected by an edge if and only if the corresponding segments are disjoint. We prove that the chromatic number of G satisfies χ(G) ≤ (ω(G))4 + (ω(G))3, where ω(G) denotes the clique number of G. It follows, that S has Ω(n1/5) pairwise intersecting or pairwise disjoint eleme...

This paper presents analysis and comparative study of a novel high-torque three-phase switched reluctance motor (SRM) with magnetically isolated stator segments. In the proposed SRM, each segment has a concentric winding located on the center body of it and two diametrically opposite windings which form the motor phase. There are four salient poles in the stator segment. Two of them share their...

Early adopters of unfamiliar, but nutritious foods can do so because of a combination of taste-motivations and health-motivations. Yet because taste can provide an enduring motivation for dietary change, profiling the taste-motivated segment of a particular food might prove useful in identifying and stimulating adoption among similar predisposed segments. This manuscript describes a basic quali...