An Algorithm to Decide Feasibility of Linear Integer Constraints Occurrng in Decision Tables

Abstract-To detect errors in decision tables one needs to decide whether a given set of constraints is feasible or not. This paper describes an algorithm to do so when the constraints are linear in variables that take only integer values. Decision tables with such constraints occur frequently in business data processing and in nonnumeric applications. The aim of the algorithm is to exploit. the abundance of very simple constraints that occur in typical decision table contexts. Essentially, the algorithm is a backtrack procedure where the the solution space is pruned by using the set of simple constrains. After some simplications, the simple constraints are captured in an acyclic directed graph with weighted edges. Further, only those partial vectors are considered from extension which can be extended to assignments that will at least satisfy the simple constraints. This is how pruning of the solution space is achieved. For every partial assignment considered, the graph representation of the simple constraints provides a lower bound for each variable which is not yet assigned a value. These lower bounds play a vital role in the algorithm and they are obtained in an efficient manner by updating older lower bounds. Our present algorithm also incorporates an idea by which it can be checked whether or not an (m - 2)-ary vector can be extended to a solution vector of m components, thereby backtracking is reduced by one component.

An analytical approach to the study of cooperation in wireless ad hoc networks

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper, we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal share of service that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.

Border basis detection is NP-complete

Border basis detection (BBD) is described as follows: given a set of generators of an ideal, decide whether that set of generators is a border basis of the ideal with respect to some order ideal. The motivation for this problem comes from a similar problem related to Grobner bases termed as Grobner basis detection (GBD) which was proposed by Gritzmann and Sturmfels (1993). GBD was shown to be NP-hard by Sturmfels and Wiegelmann (1996). In this paper, we investigate the computational complexity of BBD and show that it is NP-complete.

Rainbow connectivity: hardness and tractability

A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected. In this paper we study the rainbow connectivity problem and the strong rainbow connectivity problem from a computational point of view. Our main results can be summarised as below: 1) For every fixed k >= 3, it is NP-Complete to decide whether src(G) <= k even when the graph G is bipartite. 2) For every fixed odd k >= 3, it is NP-Complete to decide whether rc(G) <= k. This resolves one of the open problems posed by Chakraborty et al. (J. Comb. Opt., 2011) where they prove the hardness for the even case. 3) The following problem is fixed parameter tractable: Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors. 4) For a directed graph G, it is NP-Complete to decide whether rc(G) <= 2.

Competing views on cancer

Despite intense research efforts that have provided enormous insight, cancer continues to be a poorly understood disease. There has been much debate over whether the cancerous state can be said to originate in a single cell or whether it is a reflection of aberrant behaviour on the part of a `society of cells'. This article presents, in the form of a debate conducted among the authors, three views of how the problem might be addressed. We do not claim that the views exhaust all possibilities. These views are (a) the tissue organization field theory (TUFT) that is based on a breakdown of tissue organization involving many cells from different embryological layers, (b) the cancer stem cell (CSC) hypothesis that focuses on genetic and epigenetic changes that take place within single cells, and (c) the proposition that rewiring of the cell's protein interaction networks mediated by intrinsically disordered proteins (IDPs) drives the tumorigenic process. The views are based on different philosophical approaches. In detail, they differ on some points and agree on others. It is left to the reader to decide whether one approach to understanding cancer appears more promising than the other.

Relay Selection with Channel Probing in Sleep-Wake Cycling Wireless Sensor Networks

In geographical forwarding of packets in a large wireless sensor network (WSN) with sleep-wake cycling nodes, we are interested in the local decision problem faced by a node that has ``custody'' of a packet and has to choose one among a set of next-hop relay nodes to forward the packet toward the sink. Each relay is associated with a ``reward'' that summarizes the benefit of forwarding the packet through that relay. We seek a solution to this local problem, the idea being that such a solution, if adopted by every node, could provide a reasonable heuristic for the end-to-end forwarding problem. Toward this end, we propose a local relay selection problem consisting of a forwarding node and a collection of relay nodes, with the relays waking up sequentially at random times. At each relay wake-up instant, the forwarder can choose to probe a relay to learn its reward value, based on which the forwarder can then decide whether to stop (and forward its packet to the chosen relay) or to continue to wait for further relays to wake up. The forwarder's objective is to select a relay so as to minimize a combination of waiting delay, reward, and probing cost. The local decision problem can be considered as a variant of the asset selling problem studied in the operations research literature. We formulate the local problem as a Markov decision process (MDP) and characterize the solution in terms of stopping sets and probing sets. We provide results illustrating the structure of the stopping sets, namely, the (lower bound) threshold and the stage independence properties. Regarding the probing sets, we make an interesting conjecture that these sets are characterized by upper bounds. Through simulation experiments, we provide valuable insights into the performance of the optimal local forwarding and its use as an end-to-end forwarding heuristic.

Polynomial Decompositions in Polynomial Time

Fix a prime p. Given a positive integer k, a vector of positive integers Delta = (Delta(1), Delta(2), ... , Delta(k)) and a function Gamma : F-p(k) -> F-p, we say that a function P : F-p(n) -> F-p is (k, Delta, Gamma)-structured if there exist polynomials P-1, P-2, ..., P-k : F-p(n) -> F-p with each deg(P-i) <= Delta(i) such that for all x is an element of F-p(n), P(x) = Gamma(P-1(x), P-2(x), ..., P-k(x)). For instance, an n-variate polynomial over the field Fp of total degree d factors nontrivially exactly when it is (2, (d - 1, d - 1), prod)- structured where prod(a, b) = a . b. We show that if p > d, then for any fixed k, Delta, Gamma, we can decide whether a given polynomial P(x(1), x(2), ..., x(n)) of degree d is (k, Delta, Gamma)-structured and if so, find a witnessing decomposition. The algorithm takes poly(n) time. Our approach is based on higher-order Fourier analysis.

Choosing an appropriate index to construct dominance hierarchies in animal societies: a comparison of three indices

A plethora of indices have been proposed and used to construct dominance hierarchies in a variety of vertebrate and invertebrate societies, although the rationale for choosing a particular index for a particular species is seldom explained. In this study, we analysed and compared three such indices, viz Clutton-Brock et al.'s index (CBI), originally developed for red deer, Cervus elaphus, David's score (DS) originally proposed by the statistician H. A. David and the frequency-based index of dominance (FDI) developed and routinely used by our group for the primitively eusocial wasps Ropalidia marginata and Ropalidia cyathiformis. Dominance ranks attributed by all three indices were strongly and positively correlated for both natural data sets from the wasp colonies and for artificial data sets generated for the purpose. However, the indices differed in their ability to yield unique (untied) ranks in the natural data sets. This appears to be caused by the presence of noninteracting individuals and reversals in the direction of dominance in some of the pairs in the natural data sets. This was confirmed by creating additional artificial data sets with noninteracting individuals and with reversals. Based on the criterion of yielding the largest proportion of unique ranks, we found that FDI is best suited for societies such as the wasps belonging to Ropalidia, DS is best suited for societies with reversals and CBI remains a suitable index for societies such as red deer in which multiple interactions are uncommon. (C) 2009 The Association for the Study of Animal Behaviour. Published by Elsevier Ltd. All rights reserved.

Assessing Degree of Novelty of Products to Ascertain Innovative Products

Substantial increase in competition compels design firms to develop new products at an increasingly rapid pace. This situation pressurizes engineering teams to develop better products and at the same time develop products faster [1]. Continuous innovation is a key factor to enable a company to generate profit on a continued basis, through the introduction of new products in the market – a prime intention for Product Lifecycle Management. Creativity, affecting a wide spectrum of business portfolios, is regarded as the crucial factor for designing products. A central goal of product development is to create products that are sufficiently novel and useful. This research focuses on the determination of novelty of engineering products. Determination of novelty is important for ascertaining the newness of a product, to decide on the patentability of the design, to compare designers' capability of solving problems and to ascertain the potential market of a product. Few attempts at measuring novelty is available in literature [2, 3, 4], but more in-depth research is required for assessing degree of novelty of products. This research aims to determine the novelty of a product by enabling a person to determine the degree of novelty in a product. A measure of novelty has been developed by which the degree of ''novelty'' of products can be ascertained. An empirical study has been conducted to determine the validity of this method for determining the 'novelty' of the products.

Approaches to alpha-amino acids via rearrangement to electron-deficient nitrogen: Beckmann and Hofmann rearrangements of appropriate carboxyl-protected substrates

The titled approaches were effected with various 2-substituted benzoylacetic acid oximes 3 (Beckmann) and 2-substituted malonamic acids 9 (Hofmann), their carboxyl groups being masked as a 2,4,10-trioxaadamantane unit (an orthoacetate). The oxime mesylates have been rearranged with basic Al2O3 in refluxing CHCl3, and the malonamic acids with phenyliodoso acetate and KOH/MeOH. Both routes are characterized by excellent overall yields. Structure confirmation of final products was conducted with X-ray diffraction in selected cases. The final N-benzoyl and N-(methoxycarbonyl) products are alpha-amino acids with both carboxyl and amino protection; hence, they are of great interest in peptide synthesis.