We present a graph model and an ILP model for TAM design for transparency-based SoC testing. The proposed method is an extension of a previous work proposed by Chakrabarty with respect to the following three points: (1) constraint relaxation by considering test data flow for each core separately, (2) optimization of the cost for transparency as well as the cost for additional interconnect area simultaneously and (3) consideration of additional bypass paths. Therefore, the proposed ILP model can represent various problems including the same problem as the previous work and produce better results. Experimental results show the effectiveness and flexibility of the proposed method compared to the previous work.

To deal with the increasing number of mobile devices accessing the Internet and the increasing demands of mobility management, IETF has proposed Mobile IPv6 and its fast handover protocol FMIPv6. In FMIPv6, the possibility of Care-of Address (CoA) collision and the time for Return Routability (RR) procedure result in long handover delay, which makes it unsuitable for real-time applications. In this paper, we propose an improved handover scheme for FMIPv6, which reduces the handover delay by using proactive CoA acquisition, configuration and test method. In our proposal, collision-free CoA is proactively prepared, and the time for RR procedure does not contribute to the handover delay. Furthermore, we analyze our proposal's benefits and overhead tradeoff. The numerical results demonstrate that it outperforms the current schemes, such as FMIPv6 and enhanced FMIPv6, on the aspect of handover delay and packet transmission delay.

Adaptable workflow participant assignment (WPA) is crucial to the efficiency and quality of workflow execution. This paper proposes an ontology-based approach to adaptable WPA (OWPA). OWPA introduces domain ontology to organize the enterprise data and uses a well-defined OWPA rule to express an authorization constraint. OWPA can represent more complex authorization constraints by flexibly using the enterprise data, the workflow data, the user-input data, and the built-in functions. By a high-usability interactive interface, OWPA allows users to define and modify the OWPA rules easily without any programming work. Moreover, OWPA is bound to the workflow modeling tool and the workflow monitor respectively to adapt to dynamic workflow modification in workflow definitions and workflow instances. OWPA has been applied in three enterprises in China.

Designing ship controllers is a challenging problem because of nonlinear dynamics, uncertainty in parameters and external disturbances. Furthermore, the interaction between yaw and roll angles increase the complexity of this issue when autopilot and roll stabilizer are considered together. In this research, a MIMO sliding mode controller is designed to control yaw and roll angles simultaneously. The major contribution of the paper is designing an integrated controller based on a nonlinear model of ship as well as considering analytic bounds of uncertainties. Then, in order to reduce the chattering phenomenon and to improve the tracking ability of the system, the control scheme has been modified using an integral switching variable. Simulation results show the success of the proposed method to overcome nonlinearity and disturbances, as well as high performance in rough wave conditions. Also, comparison between the proposed controller and two SISO control schemes demonstrates advantages of the integrated control method.

We exhibit a simple procedure to find how classical signals should be processed in cluster-state quantum computation. Using stabilizers characterizing a cluster state, we can easily find a precise classical signal-flow that is required in performing cluster-state computation.

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.

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.

An implantable WBAN path-loss model for a capsule endoscopy which is used for examining digestive organs, is developed by conducting simulations and experiments. First, we performed FDTD simulations on implant WBAN propagation by using a numerical human model. Second, we performed FDTD simulations on a vessel that represents the human body. Third, we performed experiments using a vessel of the same dimensions as that used in the simulations. On the basis of the results of these simulations and experiments, we proposed the gradient and intercept parameters of the simple path-loss in-body propagation model.

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.

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.

We consider a single-link multi-source network with FAST TCP sources. We adopt a continuous-time dynamic model for FAST TCP sources, and propose a static model to adequately describe the queuing delay dynamics at the link. The proposed model turns out to have a structure that reveals the time-varying network feedback delay, which allows us to analyze FAST TCP with due consideration of the time-varying network feedback delay. Based on the proposed model, we establish sufficient conditions for the boundedness of congestion window of each source and for the global asymptotic stability. The asymptotic stability condition shows that the stability property of each source is affected by all other sources sharing the link. Simulation results illustrate the validity of the sufficient condition for the global asymptotic stability.

Proposed in this paper is a low power BIST architecture using the pattern mapping method based on the transition freezing method. The transition freezing method generates frozen patterns dynamically according to the transition tendency of an LFSR. This leads to an average power reduction of 60%. However, the patterns have limitations of 100% fault coverage due to random resistant faults. Therefore, in this paper, those faults are detected by mapping useless patterns among frozen patterns to the patterns generated by an ATPG. Throughout the scheme, 100% fault coverage is achieved. Moreover, we have reduced the amount of applied patterns, the test time, and the power dissipation.

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.

Recently some attempts have been made in the literature to give simple proofs of Jury test for real polynomials. This letter presents a similar result for complex polynomials. A simple proof of Jury test for complex polynomials is provided based on the Rouche's Theorem and a single-parameter characterization of Schur stability property for complex polynomials.

Critical path selection is very important in delay testing. Critical paths found by conventional static timing analysis (STA) tools are inadequate to represent the real timing of the circuit, since neither the testability of paths nor the statistical variation of cell delays caused by process variation is considered. This paper proposed a novel path selection method considering process variation. The circuit is firstly simplified by eliminating non-critical edges under statistical timing model, and then divided into sub-circuits, while each sub-circuit has only one prime input (PI) and one prime output (PO). Critical paths are selected only in critical sub-circuits. The concept of partially critical edges (PCEs) and completely critical edges (CCEs) are introduced to speed up the path selection procedure. Two path selection strategies are also presented to search for a testable critical path set to cover all the critical edges. The experimental results showed that the proposed circuit division approach is efficient in path number reduction, and PCEs and CCEs play an important role as a guideline during path selection.

In this paper, we present an efficient low power scan test technique which simultaneously reduces both average and peak power consumption. The selective scan chain activation scheme removes unnecessary scan chain utilization during the scan shift and capture operations. Statistical scan cell reordering enables efficient scan chain removal. The experimental results demonstrated that the proposed method constantly reduces the average and peak power consumption during scan testing.

Despite the growing research effort in formal verification, industrial verification often relies on the constrained random simulation methodology, which is supported by constraint solvers as the stimulus generator integrated within simulator, especially for the large design with complex constraints nowadays. These stimulus generators need to be fast and well-distributed to maintain simulation performance. In this paper, we propose a dynamic method to guide stimulus generation by SAT solvers. An adjusting strategy named Tabu Search with Memory (TSwM) is integrated in the stimulus generator for the search and prune processes along with the constraint solver. Experimental results show that the method proposed in this paper could generate well-distributed stimuli with good performance.

Traditional algorithms for dynamic OFDMA resource allocation have relatively deterministic system capacity and user fairness. Thus, in this letter, an efficient scheme is proposed to flexibly adjust quality-of-service for users, which is achieved by appropriately setting minimum data-rate of each user.

This paper proposes a method for handling out-of-vocabulary (OOV) words that cannot be translated using conventional phrase-based statistical machine translation (SMT) systems. For a given OOV word, lexical approximation techniques are utilized to identify spelling and inflectional word variants that occur in the training data. All OOV words in the source sentence are then replaced with appropriate word variants found in the training corpus, thus reducing the number of OOV words in the input. Moreover, in order to increase the coverage of such word translations, the SMT translation model is extended by adding new phrase translations for all source language words that do not have a single-word entry in the original phrase-table but only appear in the context of larger phrases. The effectiveness of the proposed methods is investigated for the translation of Hindi to English, Chinese, and Japanese.