We present a congestion control algorithm for the Internet and assess its stability. The algorithm has low operation complexity and exercises control over sources without keeping per-flow information. Given the lack of support for explicit-rate feedback in the Internet, we discuss an implementation where feedback is based on explicit binary indications. We assess the stability through a discrete-time model and present simulation results showing the efficacy of the algorithm. The obtained results indicate that when the algorithm is used to control sources that support explicit binary feedback, its stability is not affected and its performance is close to that obtained with sources that support explicit-rate feedback.

The establishment of inter-domain traffic engineered paths is a requisite to accomplishing an end-to-end bandwidth guarantee and end-to-end resource optimization. Though the inter-domain paths must be reliable, it is difficult to compute suitable backup inter-domain paths in advance when the traffic engineering information is not disclosed outside of each domain. This means that the inter-domain path computation must satisfy the severe requirement of path establishment delay, since all inter-domain paths traversing the links in failure need to be computed after the failure occurs. Though several inter-domain path computation schemes have been proposed, their relative characteristics remain unknown. First, this paper classifies the conventional inter-domain path computation schemes into two types, i.e. end-to-end and per-domain schemes, and compares their performances under various traffic loads. Based on results of the comparisons, this paper proposes an adaptive inter-domain path computation scheme that can satisfy the severe requirement of the path establishment delay. In this scheme, the domain sequence from the source node to the destination node is divided into multiple sub-domain sequences according to the traffic load in each domain. The end-to-end path computation scheme is applied to the sub-domain sequences under heavy traffic loads, while the per-domain path computation scheme is applied to those under normal traffic loads. The simulation results show that the proposed scheme can adaptively satisfy the requirement for the path establishment delay while it maintains the optimality of path computation, even if the traffic load applied to each domain changes.

This letter proposes a wakeup-on-demand scheme based on the idea that a device should be awakened just when it has to receive a packet from a neighboring device. To prove this scheme, this letter proposes a mathematical model based on the busy cycle of M/G/1 queuing systems to obtain a battery lifetime of one-hop cluster-topology shaped W-WSN.

In this letter, a novel technique for fast block matching using a new matching criterion is proposed. The matching speed and image quality are controlled by the one control parameter called matching region ratio. An efficient matching scheme with a gradual voting strategy is also proposed. This scheme can greatly boost the matching speed. The proposed technique is fast and applicable even in the presence of speckle noise or partial occlusion.

Finding a kernel mapping function for support vector machines (SVMs) is a key step towards construction of a high-performanced SVM-based classifier. While some recent methods exploited an evolutional approach to construct a suitable multifunction kernel, most of them searched randomly and diversely. In this paper, the concept of a family of identical-structured kernel trees is proposed to enable exploration of structure space using genetic programming whereas to pursue investigation of parameter space on a certain tree using evolution strategy. To control balance between structure and parameter search towards an optimal kernel, simulated annealing is introduced. By experiments on a number of benchmark datasets in the UCI and text classification collection, the proposed method is shown to be able to find a better optimal solution than other search methods, including grid search and gradient search.

In this letter, we develop an anycast-based emergency service for healthcare wireless sensor networks. The new service could operate with sensors to detect and activate an alarm system based on predefined conditions that are specific to the patient and the disease. The new service is implemented on 802.15.4 ZigBee which usually has large control overhead and long transmission times. To improve the service performance, our service identifies the closest emergency service provider to alleviate the control overhead and achieve immediate assistance when a patient requests for an emergency service. We also increase the reliability of packet transmission by using a Recovery Point scheme. Our simulations and experiment demonstrate that our scheme is efficient and feasible for healthcare wireless sensor networks.

Ultra wideband (UWB) on-body communication is attracting much attention in biomedical applications. In this paper, the performance of UWB on-body communication is investigated based on a statistically extracted on-body channel model, which provides detailed characteristics of the multi-path-affected channel with an emphasis on various body postures or body movement. The possible data rate, the possible communication distance, as well as the bit error rate (BER) performance are clarified via computer simulation. It is found that the conventional correlation receiver is incompetent in the multi-path-affected on-body channel, while the RAKE receiver outperforms the conventional correlation receiver at a cost of structure complexity. Different RAKE receiver structures are compared to show the improvement of the BER performance.

Effective countermeasures against explosive increase in healthcare expenditures are urgently needed. A paradigm shift in healthcare is called for, and academics and governments worldwide are working hard on the application of information and communication technologies (ICT) as a feasible and effective measure for reducing medical cost. The more prevalent the disease and the easier disease outcome can be improved, the more efficient is medical ICT in reducing healthcare cost. Hypertension and diabetes mellitus are such examples. Chronic heart failure is another disease in which patients may benefit from ICT-based medical practice. It is conceivable that daily monitoring of hemodynamics together with appropriate treatments may obviate the expensive hospitalization. ICT potentially permit continuous monitoring with wearable or implantable medical devices. ICT may also help accelerate the development of new therapeutic devices. Traditionally effectiveness of treatments is sequentially examined by sacrificing a number of animals at a given time point. These inefficient and inaccurate methods can be replaced by applying ICT to the devices used in chronic animal experiments. These devices allow researchers to obtain biosignals and images from live animals without killing them. They include implantable telemetric devices, implantable telestimulation devices, and imaging devices. Implanted rather than wired monitoring and stimulation devices permit experiments to be conducted under even more physiological conditions, i.e., untethered, free-moving states. Wireless communication and ICT are indispensible technologies for the development of such telemetric and telestimulation devices.

The purpose of this study is to show a class of near shift-invariant and orientation-selective transform based on even-stacked cosine-modulated filter banks (ECFBs) which originally have been proposed by Lin and Vaidyanathan. It is well-known that ECFBs can be designed by the modulation of just one prototype filter and guarantee the linear phase property. We extend this class to delay-less oversampled ECFB and show two additional attractive features; high directional selectivity and near shift-invariant property. In this paper, these properties are verified by theoretical analysis and demonstrations.

A novel modal signal decoupling algorithm for multi-coupled transmission lines is developed. Since the proposed method exploits a set of basis vectors associated with the characteristic impedances of the transmission line system, these multi-coupled signals can be efficiently decoupled regardless of dielectric media and conductors. Thus, compact forms of the signal integrity verification CAD models for multi-coupled transmission lines can be readily determined. It is shown that the analytical models are in excellent agreement with those obtained with SPICE simulation and its computation time is much faster than the conventional macro model (W-model) in the order of two.

Hierarchical Identity-Based Encryption (HIBE) is a generalization of identity-based encryption that mirrors an organizational hierarchy, and allows the root Private Key Generator (PKG) to distribute the workload of key generations to lower-level PKGs. In Indocrypt'08, Ren and Gu proposed a new HIBE scheme, and claimed that their scheme is fully chosen-ciphertext secure in the standard model. However, by giving a concrete attack, we show that Ren-Gu's HIBE is even not chosen-plaintext secure.

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.

This paper introduces a coordinate calculation method for a real-time locating system. A ToA algorithm is used to obtain the target node coordinates, but a conventional DC method, which incurs heavy calculation time, is not suitable for embedded systems. This paper proposes the use of a P-control in the PID control algorithm to resolve real-time locating system issues. Performance measures of the accumulated operator number and position error are evaluated. It is shown that the PID method has less calculation and more robust performance than the DC method.

This paper presents a fault-tolerance scheme based on mobile agents for the reliable mobile computing systems. Mobility of the agent is suitable to trace the mobile hosts and the intelligence of the agent makes it efficient to support the fault tolerance services. This paper presents two approaches to implement the mobile agent based fault tolerant service and their performances are evaluated and compared with other fault-tolerant schemes.

In this letter, DFT-based channel estimation (CE) with a strong interference detector is proposed for OFDM systems. Computer simulations demonstrate that the proposed scheme achieves similar performance to an interference-free system and is a significant enhancement over conventional methods.

Wireless mesh networks have been extensively studied as expandable, flexible, and inexpensive access networks to the Internet. This paper focuses on one composed of multiple access points (APs) connected through multihop wireless communications mainly by the wireless distribution system (WDS). For scalability, the proper partition of APs into multiple WDS clusters is essential, because the number of APs in one cluster is limited due to the increasing radio interference and control packets. In this paper, we formulate this WDS clustering problem and prove the NP-completeness of its decision version through reduction from a known NP-complete problem. Then, we propose its heuristic algorithm, using a greedy method and a variable depth search method, to satisfy the complex constraints while optimizing the cost function. We verify the effectiveness of our algorithm through extensive simulations, where the results confirm its superiority to the existing algorithm in terms of throughput.

This paper studies the feasibility of 700 MHz band inter-vehicle communication system when it is put into practical use in urban area. To verify the system, a large-scale demonstration experiment in a quasi-street test course is performed. In the experiment, a number of vehicles which are equipped with communication devices conforming to ITS FORUM RC-006 specifications are employed. A simulation method that is applicable to large-scale communication model is also designed, and the validity of the method is verified by utilizing the results derived from the experiment. Based on this model, the quality of the inter-vehicle communication system in urban area communication environment is estimated. The results show that the system's performance satisfies the requirements of representative prevention scenes of traffic accident, and the feasibility of the 700 MHz band inter-vehicle communication system specified in RC-006 is verified in the practical use in urban communication environment.

One of the critical issue in framework-based software development is a huge introduction cost caused by technical gap between developers and users of frameworks. This paper proposes a technique for deriving framework usages to implement a given requirements specification. By using the derived usages, the users can use the frameworks without understanding the framework in detail. Requirements specifications which describe definite behavioral requirements cannot be related to frameworks in as-is since the frameworks do not have definite control structure so that the users can customize them to suit given requirements specifications. To cope with this issue, a new technique based on satisfiability problems (SAT) is employed to derive the control structures of the framework model. In the proposed technique, requirements specifications and frameworks are modeled based on Labeled Transition Systems (LTSs) with branch conditions represented by predicates. Truth assignments of the branch conditions in the framework models are not given initially for representing the customizable control structure. The derivation of truth assignments of the branch conditions is regarded as the SAT by assuming relations between termination states of the requirements specification model and ones of the framework model. This derivation technique is incorporated into a technique we have proposed previously for relating actions of requirements specifications to ones of frameworks. Furthermore, this paper discuss a case study of typical use cases in e-commerce systems.

The approximation expression about error accumulation of a long-term prediction is derived. By analyzing this formula, we find that the factors that can affect the long-term predictability include the model parameters, prediction errors and the derivates of the used basis functions. To enlarge the maximum attempting time, we present that more suitable basis functions should be those with smaller derivative functions and a fast attenuation where out of the time series range. We compare the long-term predictability of a non-polynomial based algorithm and a polynomial one to prove the success of our method.

A multiple-peak negative differential resistance (NDR) circuit made of standard Si-based metal-oxide-semiconductor field-effect-transistor (MOS) and SiGe-based heterojunction bipolar transistor (HBT) is demonstrated. We can obtain a three-peak I-V curve by connecting three cascoded MOS-HBT-NDR circuits by suitably designing the MOS parameters. This novel three-peak NDR circuit possesses the adjustable current-voltage characteristics and high peak-to-valley current ratio (PVCR). We can adjust the PVCR values to be as high as 11.5, 6.5, and 10.3 for three peaks, respectively. Because the NDR circuit is a very strong nonlinear element, we discuss the extrinsic hysteresis phenomena in this multiple-peak NDR circuit. The effect of series resistance on hysteresis phenomena is also investigated. Our design and fabrication of the NDR circuit is based on the standard 0.35 µm SiGe BiCMOS process.