The k-edge-connectivity augmentation problem with bipartition constraints (kECABP, for short) is defined by “Given an undirected graph G=(V, E) and a bipartition π = {VB, VW} of V with VB ∩ VW = ∅, find an edge set Ef of minimum cardinality, consisting of edges that connect VB and VW, such that G'=(V, E ∪ Ef) is k-edge-connected.” The problem has applications for security of statistical data stored in a cross tabulated table, and so on. In this paper we propose a fast algorithm for finding an optimal solution to (σ + 1)ECABP in O(|V||E| + |V2|log |V|) time when G is σ-edge-connected (σ > 0), and show that the problem can be solved in linear time if σ ∈ {1, 2}.

Skyline queries on sensor networks have attracted much attention from the database research community due to their wide applications related to multi-criteria decision making. The existing methods use filters that are based on the data locality of sensor nodes and routing paths. However, they have two serious problems: i) unnecessary data transmission is still to frequent. ii) the processing cost of a continuous skyline query on high-dimensional data is very high. In this paper, we propose a new method that uses competitive mechanisms for processing continuous skyline queries. The proposed method dramatically reduces the data transmissions of sensors and quickly processes a continuous skyline query on high-dimensional data. An extensive performance study verifies the merits of our new method.

Link prediction in social networks, such as friendship networks and coauthorship networks, has recently attracted a great deal of attention. There have been numerous attempts to address the problem of link prediction through diverse approaches. In the present paper, we focus on the temporal behavior of the link strength, particularly the relationship between the time stamps of interactions or links and the temporal behavior of link strength and how link strength affects future link evolution. Most previous studies have not sufficiently discussed either the impact of time stamps of the interactions or time stamps of the links on link evolution. The gap between the current time and the time stamps of the interactions or links is also important to link evolution. In the present paper, we introduce a new time-aware feature, referred to as time score, that captures the important aspects of time stamps of interactions and the temporality of the link strengths. We also analyze the effectiveness of time score with different parameter settings for different network data sets. The results of the analysis revealed that the time score was sensitive to different networks and different time measures. We applied time score to two social network data sets, namely, Facebook friendship network data set and a coauthorship network data set. The results revealed a significant improvement in predicting future links.

We propose a motion detection model, which is suitable for higher speed operation than the video rate, inspired by the neuronal propagation in the hippocampus in the brain. The model detects motion of edges, which are extracted from monocular image sequences, on specified 2D maps without image matching. We introduce gating units into a CA3-CA1 model, where CA3 and CA1 are the names of hippocampal regions. We use the function of gating units to reduce mismatching for applying our model in complicated situations. We also propose a map-division method to achieve accurate detection. We have evaluated the performance of the proposed model by using artificial and real image sequences. The results show that the proposed model can run up to 1.0 ms/frame if using a resolution of 6460 units division of 320240 pixels image. The detection rate of moving edges is achieved about 99% under a complicated situation. We have also verified that the proposed model can achieve accurate detection of approaching objects at high frame rate (>100 fps), which is better than conventional models, provided we can obtain accurate positions of image features and filter out the origins of false positive results in the post-processing.

This paper presents a low distortion 3rd-order continuous-time delta-sigma modulator for a worldwide digital TV-receiver whose peak SNDR is 69.8 dB and SNR is 70.2 dB under 1 V power supply. To enhance SNDR performance, the mechanisms to occur harmonic distortions at feedback current-steering DAC and flash ADC have been analyzed. A low power tuning system using RC-relaxation oscillator has been developed in order to achieve high yield against PVT variations. A 3rd-order modulator with modified single opamp resonator contributes to cost reduction by realizing a very compact circuit. Reduction schemes of the distortions enabled the modulator to achieve FOM of 0.18 pJ/conv-step.

Delay Tolerant Network (DTN) has been emerged to support the network connectivity of the disruptive networks. A variety of routing methods have been proposed to reduce the latency for message delivery. PROPHET was proposed as a probabilistic routing that utilizes history of encounters and transitivity of nodes, which is computed as contact probability. While PROPHET improves the performance of DTN due to contact probability, contact probability is just one parameter reflecting the mobility pattern of nodes, and further study on utilizing contacting information of mobility pattern is still an important problem. Hence, in this paper, we try to improve routing for DTN by using a novel metric other than contact probability as mobility information. We propose the routing protocol to use mean residual contact time that describes the contact period for a given pair of nodes. The simulation results show that using the mean residual contact time can improve the performance of routing protocols for DTN. In addition, we also show in what situations the proposed method provides more efficient data delivery service. We characterize these situations using a parameter called Variation Metric.

This paper proposes a novel sub-architecture to optimize the data flow of REMUS-II (REconfigurable MUltimedia System 2), a dynamically coarse grain reconfigurable architecture. REMUS-II consists of a µPU (Micro-Processor Unit) and two RPUs (Reconfigurable Processor Unit), which are used to speeds up control-intensive tasks and data-intensive tasks respectively. The parallel computing capability and flexibility of REMUS-II makes itself an excellent candidate to process multimedia applications, which require a large amount of memory accesses. In this paper, we specifically optimize the data flow to deal with those performance-hazard and energy-hungry memory accessing in order to meet the bandwidth requirement of parallel computing. The RPU internal memory could work in multiple modes, like 2D-access mode and transformation mode, according to different multimedia access patterns. This novel design can improve the performance up to 26% compared to traditional on-chip memory. Meanwhile, the block buffer is implemented to optimize the off-chip data flow through reducing off-chip memory accesses, which reducing up to 43% compared to direct DDR access. Based on RTL simulation, REMUS-II can achieve 1080p@30 fps of H.264 High Profile@ Level 4 and High Level MPEG2 at 200 MHz clock frequency. The REMUS-II is implemented into 23.7 mm2 silicon on TSMC 65 nm logic process with a 400 MHz maximum working frequency.

This paper considers the discrete model of the cart-pendulum system modeled by discrete mechanics, which is known as a good discretizing method for mechanical systems and has not been really applied to control theory. We first sum up basic concepts on discrete mechanics and discuss the explicitness of the linear approximation of the discrete Euler-Lagrange Equations. Next, the discrete cart-pendulum system is derived and analyzed from the viewpoint of solvability of implicit nonlinear control systems. We then show a control algorithm to stabilize the discrete cart-pendulum based on the discrete-time optimal regulator theory. Finally, some simulations are shown to demonstrate the effectiveness of the proposed algorithm.

This letter considers a multiple-channel cognitive radio network (CRN) which can simultaneously sense multiple narrowband channels at a time. Taking the maximization of the CRN's overall throughput as the design objective, the optimization problem of jointly designing sensing time, sensing thresholds and transmission power allocation is formulated under the total power constraint of the CRN and the average interference constraint of the primary network. An iterative algorithm is proposed to obtain the locally optimal values for these parameters. Finally, numerical results show that significant overall throughput gain is achieved through the joint design.

In this paper, we consider a stabilization problem for the cart-pendulum system based on discrete mechanics, which is known as a good discretizing method for mechanical systems and has not been really applied to control theory. First, the continuous and discrete cart-pendulum systems are explained. We next propose a transformation method that converts a discrete-time input derived from the discrete-time optimal regulator theory into a continuous-time zero-order hold input, and carry out some simulations on stabilization of the cart-pendulum system by the transformation method. Then, we apply not only our proposed method but also existing methods to an experimental laboratory of the cart-pendulum system and perform some experiments in order to verify the availability of the proposed method.

A Mur type analytical absorbing boundary condition (A-ABC), which is based on the one-dimensional one-way wave equation, is proposed for multidimensional wave analysis by introducing the directional splitting technique. This new absorbing boundary condition is expansion of the first-order Mur. The absorbing ability, required memory, and calculation speed of the Mur type A-ABC are evaluated by comparison with those of conventional ABCs. The result indicated that absorbing ability of the proposed ABC is higher than the first-order Mur and lower than the second-order Mur at large incident angle. While, our proposed ABC has advantage in both required memory and calculation speed by comparison with the second-order Mur. Thus, effectivity of the proposed Mur type A-ABC is shown.

The range-dependence of clutter spectrum for forward-looking airborne radar strongly affects the accuracy of the estimation of clutter covariance matrix at the range under test, which results in poor clutter suppression performance if the conventional space-time adaptive processing (STAP) algorithms were applied, especially in the short range cells. Therefore, a new STAP algorithm with clutter spectrum compensation by utilizing knowledge-aided subspace projection is proposed to suppress clutter for forward-looking airborne radar in this paper. In the proposed method, the clutter covariance matrix of the range under test is firstly constructed based on the prior knowledge of antenna array configuration, and then by decomposing the corresponding space-time covariance matrix to calculate the clutter subspace projection matrix which is applied to transform the secondary range samples so that the compensation of clutter spectrum for forward-looking airborne radar is accomplished. After that the conventional STAP algorithm can be applied to suppress clutter in the range under test. The proposed method is compared with the sample matrix inversion (SMI) and the Doppler Warping (DW) methods. The simulation results show that the proposed STAP method can effectively compensate the clutter spectrum and mitigate the range-dependence significantly.

In this study, a low-cost, power-saving and reliable Multiple Server Backup System (MSBS) was configured and tested. The MSBS is based on a Dynamic Backup Server System (DBSS) and is able to recover many different server functions. To configure the DBSS, the mode segmentation method is introduced to simplify system control design and improve applicability to other systems. Experiments based on a mail server showed that the DBSS has sufficient ability to deal with various types of issues, including software and hardware failures. Furthermore, it is important to evaluate the virtual server performance in recovering target server functions. The well-known clock time inaccuracy problem of the virtual server is solved using the network access method regardless of the failure.

Intelligent transportation system (ITS) makes use of vehicle position to decrease the heavy traffic and improve service reliability of public transportation system. Many existing systems, such as global positioning system (GPS) and cellular communication systems, can be used to estimate vehicle location. The objective of wireless location is to determine the mobile station (MS) location in a wireless cellular communications system. The non-line-of-sight (NLOS) problem is the most crucial factor that it causes large measured error. In this paper, we present a novel positioning algorithm based on genetic algorithm (GA) to locate MS when three BSs are available for location purpose. Recently, GA are widely used as many various optimization problems. The proposed algorithm utilizes the intersections of three time of arrival (TOA) circles based on GA to estimate the MS location. The simulation results show that the proposed algorithms can really improve the location accuracy, even under severe NLOS conditions.

This paper presents the design and performance evaluation of a delay attack-resilient clock synchronization scheme (abbreviated to DARCS) for wireless sensor networks. In order to provide both synchronization accuracy and robustness, we propose a novel three-way handshake-based protocol, which completely excludes non-deterministic factors such as random backoff durations and unexpected hardware interrupts in a software manner and, in this way, the node can accurately estimate the relative clock offset and the end-to-end delay between a pair of nodes. Consequently, DARCS makes it possible to correct time synchronization errors as well as to detect delay attacks precisely. The simulation results show that DARCS achieves a higher synchronization accuracy and is more resilient to delay attacks than the other popular time synchronization schemes.

In this letter we perform an evaluation procedure of the Multi-Cluster Gaussian Scatterer Distribution Channel model. We present analytical expressions that allow to calculate the Angle of Arrival and Time of Arrival statistics directly and derive an expression to calculate the Angle Spread. The use of these expressions allows channel evaluation without the need for multiple ray simulation, thus reducing computational burden.

Coscheduling has been gained a resurgence of interest as an effective technique to enhance the performance of parallel applications in multi-programmed clusters. However, existing coscheduling schemes do not adequately handle priority boost conflicts, leading to significantly degraded performance. To address this problem, in our previous study, we devised a novel algorithm that reorders the scheduling sequence of conflicting processes based on the rescheduling latency of their correspondents in remote nodes. In this paper, we exhaustively explore the design issues and implementation details of our contention-aware coscheduling scheme over Myrinet-based cluster system. We also practically analyze the impact of various system parameters and job characteristics on the performance of all considered schemes on a heterogeneous Linux cluster using a generic coscheduling framework. The results show that our approach outperforms existing schemes (by up to 36.6% in avg. job response time), reducing both boost conflict ratio and overall message delay.

Inter-satellite link (ISL) is an important part of the next generation global navigation satellite system (GNSS). In this paper, key technologies of GNSS ISL ranging and time synchronization are researched. Considering that Ka frequency band is used for ISL, a fixed topology is designed and a new time division duplex (TDD) mode is proposed after analyzing the characteristics of GNSS constellations. A novel method called Non-coherent Dual One-way Measuring (NC-DOWM) is applied to this TDD mode. In addition, relevant mathematical formulas, error models and error compensation are discussed in detail. It is found that the proposed NC-DOWM method for GNSS ISL ranging and time synchronization outperforms the current method for GPS in terms of channel utilization efficiency and measuring precision. Furthermore, the presented method has excellent anti-interference capability and engineering feasibility, which can provide a strong technical support for the ISL of the next generation GNSS.

The Workflow Management Coalition, WfMC for short, has given a protocol for interorganizational workflows, interworkflows for short. In the protocol, an interworkflow is constructed by connecting two or more existing workflows; and there are three models to connect those workflows: chained, nested, and parallelsynchronized. Business continuity requires the interworkflow to preserve the behavior of the existing workflows. This requirement is called behavioral inheritance, which has three variations: protocol inheritance, projection inheritance, and life-cycle inheritance. Van der Aalst et al. have proposed workflow nets, WF-nets for short, and have shown that the behavioral inheritance problem is decidable but intractable. In this paper, we first show that all WF-nets of the chained model satisfy life-cycle inheritance, and all WF-nets of the nested model satisfy projection inheritance. Next we show that soundness is a necessary condition of projection inheritance for an acyclic extended free choice WF-net of the parallelsynchronized model. Then we prove that the necessary condition can be verified in polynomial time. Finally we show that the necessary condition is a sufficient condition if the WF-net is obtained by connecting state machine WF-nets.

In this paper, we propose a two-step TDC with phase-interpolator and time amplifier to satisfy high resolution at 2.4 GHz input frequency by implementing delay time less than that of an inverter delay. The accuracy of phase-interpolator is improved for process variation using the resistor automatic-tuning circuit. The gain of time amplifier is improved using the delay time difference between two delay cells. It is implemented in a 0.13 µm CMOS process with a die area of 0.68 mm2. And the power consumption is 14.4 mW at a 1.2 V supply voltage. The resolution and input frequency of the TDC are 0.357 ps and 2.4 GHz, respectively.