We consider a general concept of composition and decomposition of objects, and discuss a few natural properties one may expect from a reasonable choice thereof. It will be demonstrated how this leads to multiplication and comultiplication laws, thereby providing a generic scheme furnishing combinatorial classes with an algebraic structure. The paper is meant as a gentle introduction to the conc...

Theoretical and practical aspects of classification systems and classification learning are considered. Analysis of subject area learning sets and analysis of classification schemes raises a number of nonstandard questions, such as relations between categorization/metadata and logic-combinatorial structuring/clustering of the descriptive part of the input table. Several such questions are treat...

In this paper, we propose an efficient (n − t)-out-of-n threshold ring signature scheme which is efficient when t is small compared with n. Our scheme has a kind of dual structure of the Bresson– Stern–Szydlo threshold ring signature scheme [2], which is infeasible when t is small compared with n. In particular, we modify the trap-door one-way permutations in the ring signature scheme, and use ...

Many fundamental problems in scientific computing have more than one solution method. It is not uncommon for alternative solution methods to represent different tradeoffs between solution cost and reliability. Furthermore, the performance of a solution method often depends on the numerical properties of the problem instance and thus can vary dramatically across application domains. In such situ...

Offering Grid services in an open market determines an optimization case for finding the best suitable resource allocation for a given number of requests and existing resources. Thus, appropriate resource allocation schemes, supporting accounting, are required in addition to a pricing scheme, which supports financial fairness criteria. The newly developed Resource Allocation Model Developed for...

Solid-phase mix-and-split combinatorial synthesis is often used to produce large arrays of compounds to be tested during the various stages of the drug development process. This method can be represented by a synthesis graph in which nodes correspond to grow operations and arcs to beads transferred among the different reaction vessels. In this work, we address the problem of designing such a gr...

In this paper, we are interested in enumerative resolution methods for combinatorial optimization (COP) and constraint satisfaction problems (CSP). We introduce a new approch for the management of branching, called Dynamic Cooperative Search (DCS) inspired from the impact-based search method proposed in [7] for CSPs. This method defines in a dynamic way priority rules for variable and value sel...

The main requirement in wireless sensor networks is not only the security but also the energy efficient security due to limited resources. In large scale deployment scenarios, there is no priory knowledge of post deployment network configuration since nodes may be randomly scattered over a hostile territory. Thus, shared keys must be distributed before deployment to provide each node some keys....

Neural coding of pheromones has been intensively studied in insects with a particular focus on sex pheromones. These studies favored the view that pheromone compounds are processed within specific antennal lobe glomeruli following a specialized labeled-line system. However, pheromones play crucial roles in an insect's life beyond sexual attraction, and some species use many different pheromones...

We use combinatorial optimisation to accumulate strokes into digits. The recognition hierarchy is novel in that it is not crafted to be a “good” representation scheme, but is generated from the repeated calculation of low-order central moments.