Assume M is a compact oriented manifold of dimension at least 8. Moreover, let M be equipped with an equivariantly formal semi-free circle action, which has finite, nonempty fixed point set. We prove M has a perfect invariant MorseSmale function. The major ingredient in the proof is a new cancellation theorem for the invariant Morse theory.

Three approaches to development of new manufacturing systems are discussed. The technology oriented approach is exemplified through Computer-IntegratedManufacturing (CIM). A human oriented approach is also described. The utmost alternative is called Human-Integrated-Manufacturing (HIM). A third, combined, approach is called Computer-Human-Integrated-Manufacturing (CHIM). Swedish manufacturers a...

In recent years, large sectors of the software development industry have moved from the procedural style of software development to an object-oriented style. Safety-critical software developers have largely resisted this trend because of concerns about verifiability of object-oriented systems. This paper outlines the benefits offered by object technology and considers the key features of the ob...

As the fuzzy data management has become one of the main research topics and directions, the question of how to obtain the useful information by means of keyword query from fuzzy XML documents is becoming a subject of an increasing needed investigation. Considering the keyword query methods on crisp XML documents, smallest lowest common ancestor (SLCA) semantics is one of the most widely accepte...

Certain subgraphs of a given graph G restrict the minimum number χ(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of such subgraphs are related to the celebrated Strong Perfect Graph Theorem, as it implies that every graph G contains a clique of size χ(G), or an odd hole or an odd anti-hole as an induced subgraph. In thi...

We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...

A graph is Berge if no induced subgraph of it is an odd cycle of length at least five or the complement of one. In joint work with Robertson, Seymour, and Thomas we recently proved the Strong Perfect Graph Theorem, which was a conjecture about the chromatic number of Berge graphs. The proof consisted of showing that every Berge graph either belongs to one of a few basic classes, or admits one o...

Using a database of 11,001 unique sponsored search keywords, we investigate the relationship between the characteristics of keywords oriented around deal-seeking and brand-seeking and consumer search behaviors and buying propensities. On the basis of the search depth versus search breadth framework, we hypothesize that deal-seeking keywords elicit a search of greater breadth, whereas brand-seek...

Database tuning is a common problem, but it requires much knowledge about the characteristics of the database system and the expected workload. Dynamically changing workload complicates the search for the perfect settings. In this contribution we present several approaches that autonomously examine the operations and adjust different parameters. Even though different tools for this task are ava...

Visual cryptography is a secret sharing technique mainly used for image sharing. In the case of extended visual cryptography we use meaningful shares to hide image. Contrast loss in decrypted image is a major problem. Here we use Additional basis matrix and perfect white pixel reconstruction to improve the contrast in color extended visual cryptography. Keywords— Visual Cryptography (VC), Halft...