The LilyPad Arduino: Toward Wearable Engineering for Everyone

Electronic textiles, or e-textiles, are an increasingly important part of wearable computing, helping to make pervasive devices truly wearable. These soft, fabric-based computers can function as lovely embodiments of Mark Weiser's vision of ubiquitous computing: providing useful functionality while disappearing discreetly into the fabric of our clothing. E-textiles also give new, expressive materials to fashion designers, textile designers, and artists, and garments stemming from these disciplines usually employ technology in visible and dramatic style. Integrating computer science, electrical engineering, textile design, and fashion design, e-textiles cross unusual boundaries, appeal to a broad spectrum of people, and provide novel opportunities for creative experimentation both in engineering and design. Moreover, e-textiles are cutting- edge technologies that capture people's imagination in unusual ways. (What other emerging pervasive technology has Vogue magazine featured?) Our work aims to capitalize on these unique features by providing a toolkit that empowers novices to design, engineer, and build their own e-textiles.     

Sensor Selection in Arbitrary Dimensions

We address the sensor selection problem which arises in tracking and localization applications. In sensor selection, the goal is to select a small number of sensors whose measurements provide a good estimate of a target's state (such as location). We focus on the bounded uncertainty sensing model where the target is a point in the d -dimensional Euclidean space. Each sensor measurement corresponds to a convex polyhedral subset of the space. The measurements are merged by intersecting corresponding sets. We show that, on the plane, four sensors are sufficient (and sometimes necessary) to obtain an estimate whose area is at most twice the area of the best possible estimate (obtained by intersecting all measurements). We also extend this result to arbitrary dimensions and show that a constant number of sensors suffice for a constant factor approximation in arbitrary dimensions. Both constants depend on the dimensionality of the space but are independent of the total number of sensors in the network.     

Integrating trust into the CyberCraft Initiative via the Trust Vectors model [Application Notes]

This research supports the hypothesis that the Trust Vector model can be modified to fit the CyberCraft Initiative, and that there are limits to the utility of historical data. This research proposed some modifications and expansions to the Trust Model Vector, and identified areas for future research.     

Evolving artificial neural network ensembles

Using a coordinated group of simple solvers to tackle a complex problem is not an entirely new idea. Its root could be traced back hundreds of years ago when ancient Chinese suggested a team approach to problem solving. For a long time, engineers have used the divide-and-conquer strategy to decompose a complex problem into simpler sub-problems and then solve them by a group of solvers. However, knowing the best way to divide a complex problem into simpler ones relies heavily on the available domain knowledge. It is often a manual process by an experienced engineer. There have been few automatic divide-and-conquer methods reported in the literature. Fortunately, evolutionary computation provides some of the interesting avenues to automatic divide-and-conquer methods. An in-depth study of such methods reveals that there is a deep underlying connection between evolutionary computation and ANN ensembles. Ideas in one area can be usefully transferred into another in producing effective algorithms. For example, using speciation to create and maintain diversity had inspired the development of negative correlation learning for ANN ensembles, and an in-depth study of diversity in ensembles. This paper will review some of the recent work in evolutionary approaches to designing ANN ensembles.     

Reliability assessment of an automated distribution system

Automation can greatly enhance distribution-network reliability by speeding up service restoration and thus significantly reduce customer-outage time. The paper presents an approach to assess quantitatively the adequacy of a particular automated distribution scheme designated as the `low interruption system' (LIS). Owing to the use of a high-speed communication system and line sensors, this automated scheme can reduce drastically the number of interruptions, the service interruption time and also the area affected by the fault. This scheme provides a simple and cost-effective way to automate distribution systems in which the remotely controlled switches speed up isolation of faulted sections and the restoration of healthy sections through alternative routes. The step-by-step calculation procedure is presented using a typical small automated distribution system. The proposed technique is then applied to a larger distribution system to examine the effectiveness of the technique and also to examine the level of reliability improvement achieved by automation     

Learning user preferences of route choice behaviour for adaptive route guidance

As the use of navigation systems becomes more widespread, the demand for advanced functions of navigation systems also increases. In the light of user satisfaction, personalisation of route guidance by incorporating user preferences is one of the most desired features. A user model applied to personalised route guidance is presented. The user model adaptively updates route selection rules when it discovers the predicted choice differs from the actual choice of the driver. This study employs a decision tree learning algorithm, the C4.5 algorithm, which has advantages over other data mining methods in terms of its comprehensible model structure. Simulation experiments with a real-world network were conducted to analyse the applicability of the model to adaptive route guidance and the accuracy of its prediction     

Some Problems of Robust Control of a Stochastic Object

Studies are made of a problem of constructing a robust system according to an averaged performance criterion of a stochastic control system. Cases of the parametric and the structural uncertainty are considered. The relation of the notion of the stochastic robustness to the classical definition of deterministic systems is shown. A comparative analysis of the suggested method of developing a robust system and some other approaches is carried out.     

Investigation of Maximum and Minimum Satisfiability Problems Using L-Partition

Problems of the maximum and the minimum satisfiability on the basis of the integer linear programming and L-partition are studied. The L-structure of polyhedrons of the problems is investigated. Families are set up of unweighted problems of the maximum and the minimum satisfiability, the powers of L-coverings of which grow exponentially with an increase in the number of variables in a formula.     

Malyugin's Theorems: A New Concept in Logical Control, VLSI Design, and Data Structures for New Technologies

Theoretical results due to V. Malyugin on linearization of arithmetical models of logical functions are interpreted and refined from the viewpoint of modern techniques of logical design of integral circuits and nearest neighbor technologies.