New data collection priority: focusing on genome-based bioinformation

This editorial suggests a new genome theory to explain the new facts. By briefly comparing cytogenetics and gene sequencing research, the importance and key principles of chromosomal coded bioinformation is highlighted in the context of evolutionary studies and disease researc

Error-Correcting Codes Associated With Generalized Hadamard Matrices Over Groups

Classical Hadamard matrices are orthogonal matrices whose elements are ±1. It is well-known that error correcting codes having large minimum distance between codewords can be associated with these Hadamard matrices. Indeed, the success of early Mars deep-space probes was strongly dependent upon this communication technology. The concept of Hadamard matrices with elements drawn from an Abelian group is a natural generalization of the concept. For the case in which the dimension of the matrix is q and the group consists of the p-th roots of unity, these generalized Hadamard matrices are called “Butson Hadamard Matrices BH(p, q)”, first discovered by A. T. Butson [6]. In this dissertation it is shown that an error correcting code whose codewords consist of real numbers in finite Galois field Gf( p) can be associated in a simple way with each Butson Hadamard matrix BH(p, q), where p \u3e 0 is a prime number. Distance properties of such codes are studied, as well as conditions for the existence of linear codes, for which standard decoding techniques are available. In the search for cyclic linear generalized Hadamard codes, the concept of an M-invariant infinite sequence whose elements are integers in a finite field is introduced. Such sequences are periodic of least period, T, and have the interesting property, that arbitrary identical rearrangements of the elements in each period yields a periodic sequence with the same least period. A theorem characterizing such M-invariant sequences leads to discovery of a simple and efficient polynomial method for constructing generalized Hadamard matrices whose core is a linear cyclic matrix and whose row vectors constitute a linear cyclic error correcting code. In addition, the problem is considered of determining parameter sequences {tn} for which the corresponding potential generalized Hadamard matrices BH(p, ptn) do not exist. By analyzing quadratic Diophantine equations, new methods for constructing such parameter sequences are obtained. These results show the rich number theoretic complexity of the existence question for generalized Hadamard matrices

Understanding Electronic Commerce from a Historical Perspective

The aim of this paper is to use historical insights from modern commerce as entry points to examine the macro-level phenomena associated with electronic commerce (EC). Commerce in its modern form first appeared in early 13th century Italy where conducive political conditions existed. Trade facilitated the exchange of goods, thereby enhancing the efficiency of processes between production and consumption. Even more important was its role in raising the level of human capital, promoting the spread of ideas and information, changing people\u27s attitudes and behaviour. Some modern business practices and institutions which evolved with modern commerce are bookkeeping, modern banking, commodities market, putting out systems (or outsourcing as we know it now), insurance, stock exchange, and venture capital. The current historical context favorable to EC is globalization. The emergence of network organizations helped to establish some of the practices supporting business-to-business electronic commerce. EC holds the potential to reduce time and transaction costs. However, the historical perspective suggests that the most profound implications of EC are likely to be at the macro-level or socio-institutional level. Some implications can already be seen while others are still developing. We are witnessing the impacts of EC on older business practices, and business models while there are likely implications for business cycles Such a perspective can provide pointers for future research. Lessons from history suggest a need to pay due attention to intervention at the socio-institutional level to reap the benefits of this form of commerce

Sizes of Minimum Connected Dominating Sets of a Class of Wireless Sensor Networks

We consider an important performance measure of wireless sensor networks, namely, the least number of nodes, N, required to facilitate routing between any pair of nodes, allowing other nodes to remain in sleep mode in order to conserve energy. We derive the expected value and the distribution of N for single dimensional dense networks