An analysis of a class of algorithms for S-box construction

We analyze a very general class of algorithms for constructingm-bit invertible S-boxes called bit-by-bit methods. The method builds an S-box one entry at a time, and has been proposed by Adams and Tavares [2] and Forre [11] to construct S-boxes that satisfy certain cryptographic properties such as nonlinearity and the strict avalanche criterion. We prove, both theoretically and empirically, that the bit-by-bit method is infeasible form>6. The author is currently employed by the Distributed System Technology Center (DSTC), Brisbane, Australia. Correspondence should be sent to ISRC, QUT Gardens Point, 2 George Street, GPO Box 2434, Brisbane, Queensland 4001, Australia.     

Correlation of vibrational intensity with fluorescence lifetimes in π conjugated polymers

A series of novel pi (π) conjugated polymers, originating from the archetypical Polyphenylene vinylene, in which the phenyl units are successively replaced by the larger naphthyl and anthryl acene units, were previously found to have a well-defined relationship between their relative fluorescence yields and their vibrational characteristics, as determined by Raman spectroscopy. In this study the Strickler-Berg equation is used to probe the influence of continual substitution of higher order acene units into the conjugated backbone in terms of the variation of the radiative and non-radiative rates. The deconvolution of the radiative and non-radiative rates enables the correlation of the reduction of the Raman intensity and concomitant increase in the fluorescence yield with the reduction of the non-radiative rate. This confirms that the reduction of the non-radiative rate is the dominant process introduced by the vibrational confinement originating from systematic substitution of higher order acene units into the polymer backbone.     

Amulti-channel model for initial and handoff accesses in a mobile computing environment

The communication infrastructure of a mobile computing environment can be based on the structure of a cellular/microcellular telephone system or a PCS network. In such a system, the occurrence of handoffs cannot be avoided and when handoffs occur, wireless links held by mobile computers crossing cell boundaries may be forced to terminate. The probability that a handoff access request will result in forced termination has a significant effect on the performance of a mobile computing environment, as does the probability that an initial access request will be blocked. Although some research has been done on initial and handoff accesses in cellular/microcellular telephone systems and PCS networks, the analytical models used in this research are not appropriate for mobile computing, since unlike a telephone, a mobile computer may use several channels at once. In this paper, we develop an analytical model to study initial and handoff accesses in a mobile computing environment. The model is based on a multi-dimensional continuous time Markov chain. The accuracy of the model is verified by comparison with simulation results. We then use the model to find a practical approach to balancing the initial access blocking probability and avarage forced termination probability of a connection in a mobile computing network.This research was supported by the National Science Council, ROC, under grant NSC 85-2213-E-009-063.     

TreeNetViz: revealing patterns of networks over tree structures

Network data often contain important attributes from various dimensions such as social affiliations and areas of expertise in a social network. If such attributes exhibit a tree structure, visualizing a compound graph consisting of tree and network structures becomes complicated. How to visually reveal patterns of a network over a tree has not been fully studied. In this paper, we propose a compound graph model, TreeNet, to support visualization and analysis of a network at multiple levels of aggregation over a tree. We also present a visualization design, TreeNetViz, to offer the multiscale and cross-scale exploration and interaction of a TreeNet graph. TreeNetViz uses a Radial, Space-Filling (RSF) visualization to represent the tree structure, a circle layout with novel optimization to show aggregated networks derived from TreeNet, and an edge bundling technique to reduce visual complexity. Our circular layout algorithm reduces both total edge-crossings and edge length and also considers hierarchical structure constraints and edge weight in a TreeNet graph. These experiments illustrate that the algorithm can reduce visual cluttering in TreeNet graphs. Our case study also shows that TreeNetViz has the potential to support the analysis of a compound graph by revealing multiscale and cross-scale network patterns.     

Indoor robot gardening: design and implementation

This paper describes the architecture and implementation of a distributed autonomous gardening system with applications in urban/indoor precision agriculture. The garden is a mesh network of robots and plants. The gardening robots are mobile manipulators with an eye-in-hand camera. They are capable of locating plants in the garden, watering them, and locating and grasping fruit. The plants are potted cherry tomatoes enhanced with sensors and computation to monitor their well-being (e.g. soil humidity, state of fruits) and with networking to communicate servicing requests to the robots. By embedding sensing, computation, and communication into the pots, task allocation in the system is de-centrally coordinated, which makes the system scalable and robust against the failure of a centralized agent. We describe the architecture of this system and present experimental results for navigation, object recognition, and manipulation as well as challenges that lie ahead toward autonomous precision agriculture with multi-robot teams.     

Computer-aided development of a real-time program

The refinement calculus is a well-established theory for formal development of imperative program code and is supported by a number of automated tools. Via a detailed case study, this article shows how refinement theory and tool support can be extended for a program with real-time constraints. The approach adapts a timed variant of the refinement calculus and makes corresponding enhancements to a theorem-prover based refinement tool.