We have developed an odor-emitting apparatus for application of odor to information technology. This apparatus consists of a chemical capsule cartridge including chemical capsules of odor ingredients and valves to control odor emission using an artificial metal muscle. In this method, multiple valves can be opened using the current for a single artificial muscle because the expansion and contraction time constant for the artificial muscles is large. We have developed a new multi-valve sequence mode that uses multiple odor capsules to increase odor strength, and we have been able to increase the strength produced by a factor of two. In addition, we evaluated the change in odor strength using a mock-up of the back seat of an automobile, and all of the ten test subjects reported sensing a stronger odor.

Superconducting Quantum Interference Devices (SQUIDs) are known to be the most sensitive magnetometers, used in a wide range of applications like biomagnetism, geomagnetism, Non Destructive Evaluation (NDE), metrology or fundamental science. For all these applications, the SQUID sensor is used in analog mode and associated with a carefully designed room-temperature control and/or feedback electronics. Nevertheless, the use of SQUID sensors in digital mode is of high interest for several applications due to their quantum accuracy associated to high linearity, and their potentially very high slew rate and dynamic range. The concept and performances of a low-Tc digital magnetometer based on Single-Flux-Quantum (SFQ) logic, fabricated at the FLUXONICS Foundry located at IPHT Jena, Germany, are given after a presentation of the context of development of superconductive digital magnetometers. The sensitivity, limited to one magnetic single flux quantum, and a dynamic range of 76 dB, that corresponds to an upper limit of the magnetic field amplitude higher than 5 µT, have been measured along with overnight stability. The dynamic range of about 2800 magnetic flux quanta Φ0 has been experimentally observed with an external magnetic field. First signatures of magnetic fields have been observed simultaneously with the ones of analog SQUIDs in the low noise environment of the Laboratoire Souterrain a Bas Bruit (LSBB) located in Rustrel, Provence, France.

A novel routing protocol, named candidate-based routing, for mobile ad hoc networks is presented. Instead of flooding over the whole network, it improves and rebuilds routing paths among a limited number of candidate nodes, which are dynamically elected without incurring or exchanging any additional information. Experimental results show that the proposed protocol performs well in terms of overhead and improvement in route efficiency, especially in the high mobility speed environments.

We consider the minimum cost edge installation problem (MCEI) in a graph G=(V,E) with edge weight w(e)≥ 0, e∈ E. We are given a vertex s∈ V designated as a sink, an edge capacity λ>0, and a source set S⊆ V with demand q(v)∈ [0,λ], v∈ S. For each edge e∈ E, we are allowed to install an integer number h(e) of copies of e. MCEI asks to send demand q(v) from each source v∈ S along a single path Pv to the sink s without splitting the demand of any source v∈ S. For each edge e∈ E, a set of such paths can pass through a single copy of e in G as long as the total demand along the paths does not exceed the edge capacity λ. The objective is to find a set P={Pv| v∈ S∈ of paths of G that minimizes the installing cost ∑e∈ E h(e)w(e). In this paper, we propose a (15/8+ρST)-approximation algorithm to MCEI, where ρST is any approximation ratio achievable for the Steiner tree problem.

In large-scale industrial plants, the process control system has multiple system servers to provide seamless services to plant operators irrespective of any system server's failure. In this paper, we present an autonomic connection scheme between the system server and the Human-Machine Interface application (HMI) without additional configuration. The proposed scheme is based on the concept of autonomic computing, supporting the fault-tolerant and/or load-balancing features. Finally, the mathematical analysis shows that the proposed scheme can provide high availability of services to users.

In order to explore the feasibility of large-scale subthreshold logic circuits and to clarify the lower limit of supply voltage (VDD) for logic circuits, the dependence of the minimum operating voltage (VDD min ) of CMOS logic gates on the number of stages, gate types and gate width is systematically measured with 90 nm CMOS ring oscillators (RO's). The measured average VDD min of inverter RO's increased from 90 mV to 343 mV when the number of RO stages increased from 11 to 1 Mega, which indicates the difficulty of VDD scaling in large-scale subthreshold logic circuits. The dependence of VDD min on the number of stages is calculated using the subthreshold current model with random threshold voltage (VTH) variations and compared with the measured results, and the tendency of the measurement is confirmed. The effect of adaptive body bias control to compensate purely random VTH variation is also investigated. Such compensation would require impractical inverter-by-inverter adaptive body bias control.

In this paper, we propose an anonymous routing protocol, LOPP, to protect the originator's location privacy in Delay/Disruption Tolerant Network (DTN). The goals of our study are to minimize the originator's probability of being localized (Pl) and maximize the destination's probability of receiving the message (Pr). The idea of LOPP is to divide a sensitive message into k segments and send each of them to n different neighbors. Although message fragmentation could reduce the destination's probability to receive a complete message, LOPP can decrease the originator's Pl. We validate LOPP on a real-world human mobility dataset. The simulation results show that LOPP can decrease the originator's Pl by over 54% with only 5.7% decrease in destination's Pr. We address the physical localization issue of DTN, which was not studied in the literature.

The minimum operating voltage, Vmin, of nanoscale CMOS LSIs is investigated to breach the 1-V wall that we are facing in the 65-nm device generation, and open the door to the below 0.5-V era. A new method using speed variation is proposed to evaluate Vmin. It shows that Vmin is very sensitive to the lowest necessary threshold voltage, Vt0, of MOSFETs and to threshold-voltage variations, Δ Vt, which become more significant with device scaling. There is thus a need for low-Vt0 circuits and ΔVt-immune MOSFETs to reduce Vmin. For memory-rich LSIs, the SRAM block is particularly problematic because it has the highest Vmin. Various techniques are thus proposed to reduce the Vmin: using RAM repair, shortening the data line, up-sizing, and using more relaxed MOSFET scaling. To effectively reduce Vmin of other circuit blocks, dual-Vt0 and dual-VDD circuits using gate-source reverse biasing, temporary activation, and series connection of another small low-Vt0 MOSFET are proposed. They are dynamic logic circuits enabling the power-delay product of the conventional static CMOS inverter to be reduced to 0.09 at a 0.2-V supply, and a DRAM dynamic sense amplifier and power switches operable at below 0.5 V. In addition, a fully-depleted structure (FD-SOI) and fin-type structure (FinFET) for ΔVt-immune MOSFETs are discussed in terms of their low-voltage potential and challenges. As a result, the height up-scalable FinFETs turns out to be quite effective to reduce Vmin to less than 0.5 V, if combined with the low-Vt0 circuits. For mixed-signal LSIs, investigation of low-voltage potential of analog circuits, especially for comparators and operational amplifiers, reveals that simple inverter op-amps, in which the low gain and nonlinearity are compensated for by digitally assisted analog designs, are crucial to 0.5-V operations. Finally, it is emphasized that the development of relevant devices and fabrication processes is the key to the achievement of 0.5-V nanoscale LSIs.

This paper investigates the autonomous decision-making process of the selection of alternative countermeasures against threats in electronic warfare settings. We introduce a threat model, which represents a specific threat pattern, and a methodology that decides the best countermeasure against real-time threats using the decision theory. To determine the optimal countermeasure, we model the probabilities of the effects of countermeasures, if executed, and combine the probabilities with their utilities. This methodology based upon the inductive threat model calculates the expected utilities of countermeasures which are applicable given a situation, and provide an intelligent command and control agent with the best countermeasure to threats. We present empirical results that demonstrate the agent's capabilities of choosing countermeasures to threats in simulated electronic warfare settings.

Due to the distributed nature, mobile ad-hoc networks (MANETs) are vulnerable to various attacks, resulting in distrusted communications. To achieve trusted communications, it is important to build trusted routes in routing algorithms in a self-organizing and decentralized fashion. This paper proposes a trusted routing to locate and to preserve trusted routes in MANETs. Instead of using a hard security mechanism, we employ a new dynamic trust mechanism based on multiple constraints and collaborative filtering. The dynamic trust mechanism can effectively evaluate the trust and obtain the precise trust value among nodes, and can also be integrated into existing routing protocols for MANETs, such as ad hoc on-demand distance vector routing (AODV) and dynamic source routing (DSR). As an example, we present a trusted routing protocol, based on dynamic trust mechanism, by extending DSR, in which a node makes a routing decision based on the trust values on its neighboring nodes, and finally, establish a trusted route through the trust values of the nodes along the route in MANETs. The effectiveness of our approach is validated through extensive simulations.

This paper suggests utterance verification system using state-level log-likelihood ratio with frame and state selection. We use hidden Markov models for speech recognition and utterance verification as acoustic models and anti-phone models. The hidden Markov models have three states and each state represents different characteristics of a phone. Thus we propose an algorithm to compute state-level log-likelihood ratio and give weights on states for obtaining more reliable confidence measure of recognized phones. Additionally, we propose a frame selection algorithm to compute confidence measure on frames including proper speech in the input speech. In general, phone segmentation information obtained from speaker-independent speech recognition system is not accurate because triphone-based acoustic models are difficult to effectively train for covering diverse pronunciation and coarticulation effect. So, it is more difficult to find the right matched states when obtaining state segmentation information. A state selection algorithm is suggested for finding valid states. The proposed method using state-level log-likelihood ratio with frame and state selection shows that the relative reduction in equal error rate is 18.1% compared to the baseline system using simple phone-level log-likelihood ratios.

This paper investigates whether the self-heating effect in short intra-block wires will become apparent with technology scaling. These wires seem to have good thermal radiation characteristics, but we validate that the self-heating effect in local signal wires will be greater than that in optimal repeater-inserted global wires. Our numerical experiment shows that the maximum temperature increase from the silicon junction temperature will reach 40.4 in a steady state at a 14-nm process. Our attribution analysis also demonstrates that miniaturizing the area of wire cross-section exacerbates self-heating as well as using low-κ material and increased power dissipation in advanced technologies below 28 nm. It is revealed that the impact of self-heating on performance in local wires is limited, while underestimating the temperature may cause an unexpected reliability failure.

This position paper outlines the author's view on architectural directions and key technology enablers for the future mobile Internet. It is pointed out that mobile and wireless services will dominate Internet usage in the near future, and it is therefore important to design next-generation network protocols with features suitable for efficiently serving emerging wireless scenarios and applications. Several key requirements for mobile/wireless scenarios are identified - these include new capabilities such as dynamic spectrum coordination, cross-layer support, disconnection tolerant routing, content addressing, and location awareness. Specific examples of enabling technologies which address some of these requirements are given from ongoing research projects at WINLAB. Topics covered briefly include wireless network virtualization, the cache-and-forward (CNF) protocol, geographic (GEO) protocol stack, cognitive radio protocols, and open networking testbeds.

Multiple hop based routing in homogeneous sensor networks with a single sink suffers performance degradation and severe security threats with the increase of the size of sensor networks. Large-scale sensor networks need to be deployed with multiple powerful nodes as sinks and they should be scheduled to move to different places during the lifetime of the networks. Existing routing mechanisms lack of such supports for large-scale sensor networks. In this paper, we propose a heterogeneous network model where multiple mesh nodes are deployed in a sensor network, and sensed data are collected through two tiers: firstly from a source sensor node to the closest mesh node in a multiple-hop fashion (called sensor routing), and then from the mesh node to the base station through long-distance mesh routing (called mesh routing). Based on this network model, we propose an energy-efficient and secure protocol for the sensor routing that can work well in large-scale sensor networks and resist most of attacks. Experiments demonstrate that our routing protocol significantly reduces average hops for data transmission. Our lightweight security mechanism enables the routing protocol to defend most attacks against sensor networks.

This paper presents a selective scan slice grouping technique for test data compression. In conventional selective encoding methods, the existence of a conflict bit contributes to large encoding data. However, many conflict bits are efficiently removed using the scan slice grouping technique, which leads to a dramatic improvement of encoding efficiency. Experiments performed with large ITC'99 benchmark circuits presents the effectiveness of the proposed technique and the test data volume is reduced up to 92% compared to random-filled test patterns.

This paper presents a proposal of an expected-credibility-based job scheduling method for volunteer computing (VC) systems with malicious participants who return erroneous results. Credibility-based voting is a promising approach to guaranteeing the computational correctness of VC systems. However, it relies on a simple round-robin job scheduling method that does not consider the jobs' order of execution, thereby resulting in numerous unnecessary job allocations and performance degradation of VC systems. To improve the performance of VC systems, the proposed job scheduling method selects a job to be executed prior to others dynamically based on two novel metrics: expected credibility and the expected number of results for each job. Simulation of VCs shows that the proposed method can improve the VC system performance up to 11%; It always outperforms the original round-robin method irrespective of the value of unknown parameters such as population and behavior of saboteurs.

Digital fingerprinting is used to trace back illegal users, where unique ID known as digital fingerprints is embedded into a content before distribution. On the generation of such fingerprints, one of the important properties is collusion-resistance. Binary codes for fingerprinting with a code length of theoretically minimum order were proposed by Tardos, and the related works mainly focused on the reduction of the code length were presented. In this paper, we present a concrete and systematic construction of the Tardos's fingerprinting code using a chaotic map. Using a statistical model for correlation scores, the actual number of true-positive and false-positive detection is measured. The collusion-resistance of the generated fingerprinting codes is evaluated by a computer simulation.

In this paper, we study lower bounds on the query complexity of testing algorithms for various problems. Given an oracle that returns information of an input object, a testing algorithm distinguishes the case that the object has a given property P from the case that it has a large distance to having P with probability at least . The query complexity of an algorithm is measured by the number of accesses to the oracle. We introduce two reductions that preserve the query complexity. One is derived from the gap-preserving local reduction and the other is from the L-reduction. By using the former reduction, we show linear lower bounds on the query complexity for testing basic NP-complete properties, i.e., 3-edge-colorability, directed Hamiltonian path/cycle, undirected Hamiltonian path/cycle, 3-dimensional matching and NP-complete generalized satisfiability problems. Also, using the second reduction, we show a linear lower bound on the query complexity of approximating the size of the maximum 3-dimensional matching.

In photonic label routing networks, recognition of optical labels is one of the key functions. We have proposed passive waveguide-type devices for recognition of optical labels coded in quadri-phase-shift-keying (QPSK) form. In this paper, we consider wavelength dependence of the devices. The basic module of the proposed device consists of a 3-dB directional coupler, two Y-junctions, and an asymmetric X-junction. The Y-junction and an asymmetric X-junction have basically no wavelength dependence. Although the 3-dB directional coupler has weak wavelength dependence, the device for two-symbol label recognition is found to work in wavelength 1.5-1.6 µm. The performance of the device is confirmed by simulation using beam propagation method (BPM).

Wireless sensor networks are subject to node and link failures for a variety of reasons. This paper proposes a k-disjoint-path routing algorithm that varies the number of disjoint paths (k) in order to meet a target-delivery ratio of critical events and to reduce energy consumption. The proposed algorithm sends packets to the base station through a single path without the occurrence of critical events, however, it sends packets to the base station through k disjoint paths (k>1) under the occurrence of critical events, where k is computed from a well-defined fault model. The proposed algorithm detects the occurrence of critical events by monitoring collected data patterns. The simulation results reveal that the proposed algorithm is more resilient to random node failure and patterned failure than other routing algorithms, and it also decreases energy consumption much more than the multi-path and path-repair algorithms.