Rika NAKAO Yoshinobu KAJIKAWA Yasuo NOMURA
In this paper, we propose a method that uses Simulated Annealing (SA) to estimate the linear and nonlinear parameters of a closed-box loudspeaker system for implementing effective Mirror filters. The nonlinear parameters determined by W. Klippel's method are sometimes inaccurate and imaginary. In contrast, the proposed method can estimate the parameters with satisfactory accuracy due to its use of SA; the resulting impedance and displacement characteristics match those of an actual equivalent loudspeaker. A Mirror filter designed around these parameters can well compensate the nonlinear distortions of the loudspeaker system. Experiments demonstrate that the method can reduce the levels of nonlinear distortion by 5 dB to 20 dB compared to the before compensation condition.
Point Pattern Matching (PPM) is an essential problem in many image analysis and computer vision tasks. This paper presents a two-stage algorithm for PPM problem using ellipse fitting and dual Hilbert scans. In the first matching stage, transformation parameters are coarsely estimated by using four node points of ellipses which are fitted by Weighted Least Square Fitting (WLSF). Then, Hilbert scans are used in two aspects of the second matching stage: it is applied to the similarity measure and it is also used for search space reduction. The similarity measure named Hilbert Scanning Distance (HSD) can be computed fast by converting the 2-D coordinates of 2-D points into 1-D space information using Hilbert scan. On the other hand, the N-D search space can be converted to a 1-D search space sequence by N-D Hilbert Scan and an efficient search strategy is proposed on the 1-D search space sequence. In the experiments, we use both simulated point set data and real fingerprint images to evaluate the performance of our algorithm, and our algorithm gives satisfying results both in accuracy and efficiency.
Kiyoshi ISHII Yoshifumi SAITOU Kengo FURUTANI Hiroshi SAKUMA Yoshito IKEDA
Tin-doped indium oxide (ITO) thin films were prepared on a polyethylene terephthalate (PET) foil by bias sputtering. In the absence of a substrate bias, films having a high resistivity of 210-2 Ωcm were formed. On the other hand, by the application of an rf substrate bias, films having a low resistivity of 2.610-4 Ωcm were formed. The energy of ions that bombarded the substrate during bias sputtering was estimated by a simulation of the ion acceleration. The optimum ion-energy required for the reduction of resistivity was found to be approximately 50 eV.
Fanny RAHADIAN Tatsuya MASADA Ichiro FUJIEDA
We propose to integrate a single lens on top of multiple OLEDs. Angular distribution of the light emitted from the lens surface is altered by turning on the OLEDs selectively. We can use such a light source as a backlight for a liquid crystal display to switch its viewing angle range and/or to display multiple images in different directions. Pixel-level integration would allow one to construct an OLED display with a similar emission angle control.
In wireless ad hoc networks, providing an authentication service to verify that the broadcast packet is from the claimed sender without modification, is challenging due mainly to the inherently lossy wireless links. This paper presents a novel Secure and Reliable Broadcasting that reinforces the broadcast authentication with reliability and energy-efficiency capabilities by using the cooperative diversity to superimpose two distinct signals. The proposed protocol achieves significant savings of transmission power and fair assurance of reliability among receivers.
Liang CHEN Le JIN Feng HE Hanwen CHENG Lenan WU
In next generation mobile multimedia communications, different wireless access networks are expected to cooperate. However, it is a challenging task to choose an optimal transmission path in this scenario. This paper focuses on the problem of selecting the optimal access network for multicast services in the cooperative mobile and broadcasting networks. An algorithm is proposed, which considers multiple decision factors and multiple optimization objectives. An analytic hierarchy process (AHP) method is applied to schedule the service queue and an artificial neural network (ANN) is used to improve the flexibility of the algorithm. Simulation results show that by applying the AHP method, a group of weight ratios can be obtained to improve the performance of multiple objectives. And ANN method is effective to adaptively adjust weight ratios when users' new waiting threshold is generated.
In this paper we show some new look at large deviation theorems from the viewpoint of the information-spectrum (IS) methods, which has been first exploited in information theory, and also demonstrate a new basic formula for the large deviation rate function in general, which is expressed as a pair of the lower and upper IS rate functions. In particular, we are interested in establishing the general large deviation rate functions that are derivable as the Fenchel-Legendre transform of the cumulant generating function. The final goal is to show, under some mild condition, a necessary and sufficient condition for the IS rate function to be derivable as the Fenchel-Legendre transform of the cumulant generating function, i.e., to be a rate function of Gartner-Ellis type.
Suhua TANG Mehdad N. SHIRAZI Oyunchimeg SHAGDAR Ryutaro SUZUKI Sadao OBANA
In Mobile Ad hoc Networks (MANET) geographic routing is characterized by local forwarding decision. Links with a long progress are preferred under the greedy forwarding rule. However in a real system long links tend to have a high packet loss rate due to multipath fading. A sub-optimal solution may separately exploit path diversity or rate adaptation. In this paper we study channel efficiency of multi-hop forwarding and try to jointly optimize rate adaptation and forwarder selection in geographic routing by the tradeoff between progress and instantaneous rate. We define a new metric -- Bit Transfer Speed (BTS) -- as the ratio of the progress made towards the destination to the equivalent time taken to transfer a payload bit. This metric takes overhead, rate and progress into account. Then we propose a packet forwarding scheme that Opportunistically exploits both long Progress and Adaptive Rate (OPAR) by a cross-layer design of routing and MAC. In OPAR each node selects for a packet the forwarder with the highest BTS. The forwarder changes as local topology (progress), packet size (overhead ratio) or channel state (data rate) varies. Simulation results show that compared with the normalized advance (NADV) [7] scheme and contention-based forwarding (CBF) [17] scheme, OPAR has lower packet loss and can effectively reduce channel occupation time by over 30% in the scenario with moderate mobility speeds.
Alexander TIKHONRAVOV Michael TRUBETSKOV Ichiro KASAHARA
A new paradigm in the design of optical coatings connected with an outstanding computational efficiency of modern design techniques is discussed. Several other topics including pre-production error analysis, monitoring of coating production, and computational manufacturing of optical coatings are considered.
Chee Heng LEE Hiroyuki YOSHIDA Yusuke MIURA Akihiko FUJII Masanori OZAKI
The authors have demonstrated the local alignment of nematic liquid crystal with local micro-grating structure fabricated by the curing of an ultraviolet curable material via a three dimensional micro-fabrication technique known as two photon excitation direct laser writing [1]. The molecular alignment of the nematic liquid crystals on the fabricated micro-grating structures was firstly investigated by the observations of a local twisted nematic region in a liquid crystal cell made of a substrate with locally fabricated micro-grating structure and a counter substrate with rubbed polyimide. The optical polarizing microscope observation of the micro-grating structures indicated that liquid crystals molecules have aligned parallel to the grooves of the micro-grating structure and that local alignment was successfully achieved. The alignment characteristics of the liquid crystals on these micro-gratings was also investigated and discussed quantitatively in details through the measurement of anchoring energy by the conventional torque balance method and the Berreman method. The azimuthal anchoring energy for the micro-grating was found to be in the order of 10-6 J/m2 and inversely proportional to the grating period.
Thomas Edison YU Tomokazu YONEDA Krishnendu CHAKRABARTY Hideo FUJIWARA
Rapid advances in semiconductor manufacturing technology have led to higher chip power densities, which places greater emphasis on packaging and temperature control during testing. For system-on-chips, peak power-based scheduling algorithms have been used to optimize tests under specified power constraints. However, imposing power constraints does not always solve the problem of overheating due to the non-uniform distribution of power across the chip. This paper presents a TAM/Wrapper co-design methodology for system-on-chips that ensures thermal safety while still optimizing the test schedule. The method combines a simplified thermal-cost model with a traditional bin-packing algorithm to minimize test time while satisfying temperature constraints. Furthermore, for temperature checking, thermal simulation is done using cycle-accurate power profiles for more realistic results. Experiments show that even a minimal sacrifice in test time can yield a considerable decrease in test temperature as well as the possibility of further lowering temperatures beyond those achieved using traditional power-based test scheduling.
Vinh TRAN QUANG Takumi MIYOSHI
Wireless sensor network (WSN) is a promising approach for a variety of applications. Routing protocol for WSNs is very challenging because it should be simple, scalable, energy-efficient, and robust to deal with a very large number of nodes, and also self-configurable to node failures and changes of the network topology dynamically. Recently, many researchers have focused on developing hierarchical protocols for WSNs. However, most protocols in the literatures cannot scale well to large sensor networks and difficult to apply in the real applications. In this paper, we propose a novel adaptive routing protocol for WSNs called ARPEES. The main design features of the proposed method are: energy efficiency, dynamic event clustering, and multi-hop relay considering the trade-off relationship between the residual energy available of relay nodes and distance from the relay node to the base station. With a distributed and light overhead traffic approach, we spread energy consumption required for aggregating data and relaying them to different sensor nodes to prolong the lifetime of the whole network. In this method, we consider energy and distance as the parameters in the proposed function to select relay nodes and finally select the optimal path among cluster heads, relay nodes and the base station. The simulation results show that our routing protocol achieves better performance than other previous routing protocols.
M. Julius HOSSAIN M. Ali Akber DEWAN Oksam CHAE
This paper presents a new routing approach to extend the effective lifetime of mobile ad hoc networks (MANET) considering both residual battery energy of the participating nodes and routing cost. As the nodes in ad hoc networks are limited in power, a power failure occurs if a node has insufficient remaining energy to send, receive or forward a message. So, it is important to minimize the energy expenditure as well as to balance the remaining battery power among the nodes. Cost effective routing algorithms attempt to minimize the total power needed to transmit a packet which causes a large number of nodes to loose energy quickly and die. On the other hand, lifetime prediction based routing algorithms try to balance the remaining energies among the nodes in the networks and ignore the transmission cost. These approaches extend the lifetime of first few individual nodes. But as nodes spend more energy for packet transfer, power failures occurs within short interval resulting more number of total dead node earlier. This reduces the effective lifetime of the network, as at this stage successful communication is not possible due to the lack of forwarding node. The proposed method keeps the transmission power in modest range and at the same time tries to reduce the variance of the residual energy of the nodes more effectively to obtain the highest useful lifetime of the networks in the long run. Nonetheless, movement of nodes frequently creates network topology changes via link breaks and link creation and thus effects on the stability of the network. So, the pattern of the node movement is also incorporated in our route selection procedure.
Hiroshi NAKAGAWA Kazuyuki NAKAMARU Tomoyuki OHTA Yoshiaki KAKUDA
Recently, in mobile ad hoc networks, routing schemes using location information have been proposed. Most of these schemes assume that the source node already knows the location information of the destination node. However, since all nodes are always moving, it is difficult to apply this assumption to the real mobile ad hoc environment. In order to cope this difficulty, this paper presents a new routing scheme HGR (a Hybrid Greedy Routing with location and velocity information), which considers the location and velocity information of the destination node and the neighboring nodes. In HGR, when a source node creates a route to a destination node, the future location of neighboring nodes and the destination node predicted by the source node is calculated using these location and velocity information. And the source node sends data packets to the neighboring node that is the closest to the destination node based on these predicted location and velocity information. This paper shows that HGR achieves high data delivery ratio and fewer overheads for the route creation and maintenance through simulation experiments.
David GAVILAN Suguru SAITO Masayuki NAKAJIMA
Using query-by-sketch we propose an application to efficiently create collages with some user interaction. Using rough color strokes that represent the target collage, images are automatically retrieved and segmented to create a seamless collage. The database is indexed using simple geometrical and color features for each region, and histograms that represent these features for each image. The image collection is then queried by means of a simple paint tool. The individual segments retrieved are added to the collage using Poisson image editing or alpha matting. The user is able to modify the default segmentations interactively, as well as the position, scale, and blending options for each object. The resulting collage can then be used as an input query to find other relevant images from the database.
We propose a practical link protection scheme, called Single Backup-table Rerouting, (SBR) as an extension for Open Shortest Path First (OSPF). SBR protects against any single link failure as soon as the failure occurs if the topology of every area in OSPF is two-link-connected. An efficient algorithm to compute a set of backup tables is provided for networks with symmetric link costs. The foremost feature of SBR is that the backup process is fully distributed, so no message exchange is required and the modification of OSPF is minor. OSPF is extended with the following: only one extra backup routing table, a 2-bit flag at each traffic packet, and a process for handling the backup table. There are no changes to the message format of OSPF. In this paper, we present the practical link protection scheme by fitting SBR into several OSPF specific mechanisms such as OSPF areas, Equal Costs Multipath (ECMP), and virtual links with proofs of their correctness. Furthermore, together with a loop-free routing technique for link-state routing, SBR guarantees the consistency of every route against a single link failure, even during the path recomputation phase, until it converges to the new shortest paths.
The steady approach of advanced nations toward realization of ubiquitous computing societies has given birth to rapidly growing demands for new-generation distributed computing (DC) applications. Consequently, economic and reliable construction of new-generation DC applications is currently a major issue faced by the software technology research community. What is needed is a new-generation DC software engineering technology which is at least multiple times more effective in constructing new-generation DC applications than the currently practiced technologies are. In particular, this author believes that a new-generation building-block (BB), which is much more advanced than the current-generation DC object that is a small extension of the object model embedded in languages C++, Java, and C#, is needed. Such a BB should enable systematic and economic construction of DC applications that are capable of taking critical actions with 100-microsecond-level or even 10-microsecond-level timing accuracy, fault tolerance, and security enforcement while being easily expandable and taking advantage of all sorts of network connectivity. Some directions considered worth pursuing for finding such BBs are discussed.
A component framework for building and operating visual interfaces for context-aware services in ubiquitous computing environments is presented. By using a compound-document technology, it provides physical entities, places, stationary or mobile computing devices, and services with visual components as multimedia representations to enable them to be annotated and controlled them. It can automatically assemble visual components into a visual interface for monitoring and managing context-aware services according to the spatial-containment relationships between their targets in the physical world by using underlying location-sensing systems. End-users can manually deploy and customize context-aware services through user-friendly GUI-based manipulations for editing documents. This paper presents the design for this framework and describes its implementation and practical applications in user/location-aware assistant systems in two museums.
Xin XIAO Yuanchun SHI Yun TANG Nan ZHANG
During recent years, there has been a rapid growth in deployment of gossip-based protocol in many multicast applications. In a typical gossip-based protocol, each node acts as dual roles of receiver and sender, independently exchanging data with its neighbors to facilitate scalability and resilience. However, most of previous work in this literature seldom considered cheating issue of end users, which is also very important in face of the fact that the mutual cooperation inherently determines overall system performance. In this paper, we investigate the dishonest behaviors in decentralized gossip-based protocol through extensive experimental study. Our original contributions come in two-fold: In the first part of cheating study, we analytically discuss two typical cheating strategies, that is, intentionally increasing subscription requests and untruthfully calculating forwarding probability, and further evaluate their negative impacts. The results indicate that more attention should be paid to defending cheating behaviors in gossip-based protocol. In the second part of anti-cheating study, we propose a receiver-driven measurement mechanism, which evaluates individual forwarding traffic from the perspective of receivers and thus identifies cheating nodes with high incoming/outgoing ratio. Furthermore, we extend our mechanism by introducing reliable factor to further improve its accuracy. The experiments under various conditions show that it performs quite well in case of serious cheating and achieves considerable performance in other cases.
Shuichi SAKAI Masahiro GOSHIMA Hidetsugu IRIE
This paper presents the processor architecture which provides much higher level dependability than the current ones. The features of it are: (1) fault tolerance and secure processing are integrated into a modern superscalar VLSI processor; (2) light-weight effective soft-error tolerant mechanisms are proposed and evaluated; (3) timing errors on random logic and registers are prevented by low-overhead mechanisms; (4) program behavior is hidden from the outer world by proposed address translation methods; (5) information leakage can be avoided by attaching policy tags for all data and monitoring them for each instruction execution; (6) injection attacks are avoided with much higher accuracy than the current systems, by providing tag trackings; (7) the overall structure of the dependable processor is proposed with a dependability manager which controls the detection of illegal conditions and recovers to the normal mode; and (8) an FPGA-based testbed system is developed where the system clock and the voltage are intentionally varied for experiment. The paper presents the fundamental scheme for the dependability, elemental technologies for dependability and the whole architecture of the ultra dependable processor. After showing them, the paper concludes with future works.