Using digital but physical surrogates to mediate awareness, communication and privacy in media spaces

Digital but physical surrogates are tangible representations of remote people (typically members of small intimate teams), positioned within an office and under digital control. Surrogates selectively collect and present awareness information about the people they represent. They also react to people's explicit and implicit physical actions: a person's explicit acts include grasping and moving them, while their implicit acts include how they move towards or away from the surrogate. By responding appropriately to these physical actions of people, surrogates can control the communication capabilities of a media space in a natural way. Surrogates also balance awareness and privacy by limiting and abstracting how activities are portrayed, and by offering different levels of salience to its users. The combination of all these attributes means that surrogates can make it easy for intimate collaborators to move smoothly from awareness of each other to casual interaction while mitigating privacy and distraction concerns.Exploring different surrogate designs and how they work together can be straightforward if a good infrastructure is in place. We use anawareness server based on a distributed model-view-controller architecture, which automatically captures, stores and distributes events. We also package surrogates as physical widgets orphidgets with a well-defined interface; this makes it easy for a programmer to plug a surrogate into the awareness server as a controller (to generate awareness events), or view (to display events that others have produced), or both. Because surrogate design, implementation and use is still a new discipline, we also present several issues and next steps.     

Event-triggered control for discrete-time multi-agent average consensus

We consider the average consensus problem for the multi-agent system in the discrete-time domain. Three triggering based control protocols are developed, which dictate the broadcast and control update instants of individual agents to alleviate communication and computational burden. Lyapunov-based design methods prescribe when agents should communicate and update their control so that the network converges to the average of agents' initial states. We start with a static version of the distributed event-triggering law and then generalize it so that it involves an internal auxiliary variable to regulate the threshold dynamically for each agent. The third protocol uses a self-triggering algorithm to avoid continuous listening wherein each agent estimates its next triggering time and broadcasts it to its neighbors at the current triggering time. Numerical simulations are shown to validate the efficacy of the proposed algorithms.     

control with limited communication and message losses

We propose an H^∞ approach to a remote control problem where the communication is constrained due to the use of a shared channel. The controller employs a periodic time sequencing scheme for message transmissions from multiple sensors and to multiple actuators of the system. It further takes into account the information on the random message losses that occur in the channel. An exact characterization for controller synthesis is obtained and is stated in terms of linear matrix inequalities. Furthermore, an analysis on the loss probabilities of the messages to accomplish stabilization is carried out. The results are illustrated through a numerical example.     

Partial redundancy elimination for access expressions by speculative code motion

We present a new memory access optimization for Java to perform aggressive code motion for speculatively optimizing memory accesses by applying partial redundancy elimination (PRE) techniques. First, to reduce as many barriers as possible and to enhance code motion, we perform alias analysis to identify all the regions in which each object reference is not aliased. Secondly, we find all the possible barriers. Finally, we perform code motions in three steps. For the first step, we apply a non‐speculative PRE algorithm to move load instructions and their following instructions in the backwards direction of the control flow graph. For the second step, we apply a speculative PRE algorithm to move some of them aggressively before the conditional branches. For the third step, we apply our modified version of a non‐speculative PRE algorithm to move store instructions in the forward direction of the control flow graph and to even move some of them after the merge points. We implemented our new algorithm in our production‐level Java just‐in‐time compiler. Our experimental results show that our speculative algorithm improves the average (maximum) performance by 13.1% (90.7%) for jBYTEmark and 1.4% (4.4%) for SPECjvm98 over the fastest algorithm previously described, while it increases the average (maximum) compilation time by 0.9% (2.9%) for both benchmark suites. Copyright © 2004 John Wiley & Sons, Ltd.     

A high‐performance sorting algorithm for multicore single‐instruction multiple‐data processors

Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both single‐instruction multiple‐data (SIMD) instructions and thread‐level parallelism. In this paper, we propose a new high‐performance sorting algorithm, called aligned‐access sort (AA‐sort), that exploits both the SIMD instructions and thread‐level parallelism available on today's multicore processors. Our algorithm consists of two phases, an in‐core sorting phase and an out‐of‐core merging phase. The in‐core sorting phase uses our new sorting algorithm that extends combsort to exploit SIMD instructions. The out‐of‐core algorithm is based on mergesort with our novel vectorized merging algorithm. Both phases can take advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions in both phases. We implemented and evaluated the AA‐sort on PowerPC 970MP and Cell Broadband Engine platforms. In summary, a sequential version of the AA‐sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and bitonic mergesort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 million random 32‐bit integers. Also, a parallel version of AA‐sort demonstrated better scalability with increasing numbers of cores than a parallel version of bitonic mergesort on both platforms. Copyright © 2011 John Wiley & Sons, Ltd.     

Return Link Systems for Wireless Mobile Camera Using 42 GHz-Band with Frequency and Space Diversity Techniques

In this paper, return link systems for wireless mobile camera using 42 GHz-band in multipath fading environments are proposed. The return link systems for wireless mobile camera require wireless transmission with high reliability as same as the conventional wired camera systems. The proposed return link systems achieve transmission with high reliability by taking into consideration frequency and space diversity techniques. The proposed systems can be classified as 3 three types of return link systems according to diversity techniques： FD （frequency diversity） systems, SD （space diversity） systems and FD＋SD system （frequency and space diversity）. Computer simulations are carried out in order to confirm the effectiveness of the proposed return link systems. It is confirmed that the proposed three types of return link systems have an advantage about BER performances and effectively exploit frequency and space resources.     

Grain-growth-inhibiting effects of primary inclusion particles of ZrO2 and MgO in Fe-10 mass pct Ni alloy

Grain-growth inhibition in an Fe-10 mass pct Ni alloy, which was continuously cooled from a melt, was studied at 1673 K in the presence of primary deoxidation products of ZrO₂ or MgO particles. The mean grain size and grain-size distribution in a cross section were measured as a function of holding time for up to 240 minutes. The grain growth was strongly inhibited by the inclusion particles and was influenced by the dissolved Zr. In the Zr deoxidation, the number of particles per unit area (N _A) ranged from 80 to 650 mm⁻², the ZrO₂ particle size ( ) varied from 1.1 to 1.6 μm, and the dissolved Zr level was below 1800 mass ppm. In the Mg deoxidation, the particle-number density was 90 to 270 mm⁻², the MgO particle size was 1.1 to 1.7 μm, and the dissolved Mg level was below 20 mass ppm. In a logarithmic plot of the ratio of limiting mean grain diameter ( ) to the mean particle diameter ( ) against the volume fraction of particles (f _V), both the value for a given f _V value, which ranged from 0.014 to 0.074 pct, and the slope were significantly lower than that predicted from the two-dimensional relation =(4/π) · f _V ^/−1 , i.e., Zener’s limit. This discrepancy is discussed in light of the fraction of particles at the grain boundaries measured experimentally. Normal grain growth was confirmed from the grain-size distribution observed as a function of holding time, which was best described by the log-normal distribution.     

Self-assembly of three dimensional micro mechanisms using thermal shrinkage of polyimide

This paper describes three-dimensional microstructures fabricated using a simple self-assembly process involving the thermal shrinkage of polyimide. The proposed method enables hinged structures to be automatically rotated out of the wafer plane and to remain bent without the need to use any interlocking mechanisms. The hinged structures were fabricated using surface micromachining techniques involving heating in a furnace. An increase in the bending angle due to the shrinkage of polyimide was observed with increasing heating temperature, heating time, and length of the polyimide hinge. Of these three parameters, the heating time was found to be the most suitable for precise control of the bending angle. Furthermore, microcubes were fabricated by this method and the self-assembly process was successfully visualized using a CCD camera.     

Evaluating card-based protocols in terms of execution time

International Journal of Information Security - Card-based cryptography is an attractive and unconventional computation model; it provides secure computing methods using a deck of physical cards....     

Reaction control of TiB2 formation from titanium metal and amorphous boron

TiB₂ powder was synthesized by a controlled formation reaction from titanium metal and amorphous boron. Precursory TiB₂ formed by the pretreatment of the mixed powder (mole ratio: B/Ti=2.0) at 600° C for 60 min in an argon stream. Hollow TiB₂ powder with an average grain size of 15m was obtained by subsequent heat treatment above 900° C for more than 60 min in an argon stream. The formation reaction of TiB₂ powder was further controlled by pretreatment of the mixed powder at 600° C for 60 min in a hydrogen and argon stream and subsequent heat treatment at 1000° C for 360 min in an argon stream, when hollow-free TiB₂ powder was formed by a milder formation reaction between amorphous boron and the reformed titanium metal with hydrogen diffused lattice.