The algebra of communicating shared resources (ACSR) is a timed process algebra which extends classical process algebras with the notion of a resource. In analyzing ACSR models, the existing techniques such as bisimulation checking and Hennessy-Milner Logic (HML) model checking are very important in theory of ACSR, but they are difficult to use for large complex system models in practice. In this paper, we suggest a framework to verify ACSR models against their requirements described in an expressive timed temporal logic. We demonstrate the usefulness of our approach with a real world case study.

In this letter, an interference suppression scheme by MMSE combining in OFDM-antenna array with time shifted sampling (TSS) is proposed. An array antenna at a base station has been thoroughly investigated to increase the uplink capacity. The performance of the uplink is not only limited by the correlation between the antenna elements, which strongly depends on the spatial aspects of the channel, as well as the interference from the terminals. Numerical results through computer simulation show that the proposed scheme improves bit error rate performance because of interference suppression by MMSE combining and diversity reception by TSS at the same time.

This paper proposes a closed-form formula for the jitter-induced noise spectrum at the output of continuous-time ΔΣ modulators with NRZ feedback waveform. In this approach, the clock jitter effects are modeled as an additive noise in the feedback loop of the modulator. Making use of a conceptual model and following from the linear system theory, the output spectrum is explained versus the spectrum of the additive jitter noise.

We investigate and propose the utilization of regenerative and non-regenerative relaying terminals in downlink cooperative MIMO communications, such as in base-station/router-relay-user transmission under different schemes. The source is equipped with multiple antennas, while the relays and destination are single-antenna terminals. From the source to the relays, symbols are transmitted using MIMO spatial-multiplexing technique. Depending on the type of relaying scheme, the relays either fully decode or amplify the received signal before retransmitting it to the destination using simple TDM transmission or Alamouti's space-time coding. We show that the proposed system realizes MIMO performance in single-antenna system environment, and performance-wise it is superior to existing transmission schemes, especially in low-SNR conditions. Furthermore, the proposed system is shown to give a diversity order of N-M+1, similar to that of MIMO V-BLAST system.

Recently multi-car elevator (MCE) consisting of several elevator cars in a single elevator shaft received great interest as transportation systems for high-rise buildings. Algorithms for efficiently controlling elevator cars are necessary to put MCEs to practical use. We propose an algorithm for controlling MCEs to reduce passenger-waiting time. A feature of our algorithm is the introduction of a simple function estimating efficiency of passenger transport and a procedure checking assignability of a car. We evaluate the performance of our algorithm using a simulation and show that it performs better compared with a previous algorithm.

Alamouti's orthogonal space-time block code (OSTBC) is a simple yet important technique to take advantage of transmit diversity to mitigate fading channel effects. In this paper, we analyze the effects of time-selective channels and channel estimation errors on the bit error rate (BER) performance of Alamouti's OSTBC. We develop an analytical expression of the BER performance for the linear decoding with minimum mean squared error (MMSE) channel estimates in place of the true channel. Based on the expression, we derive a BER performance limit in decision-directed mode where the channel is tracked with Kalman filtering. Numerical examples are provided to validate our analysis and to see the impact of time-selective fading and channel estimation errors on the BER performance.

In this letter, we propose a simple adaptive switching scheme to enhance the performance of space-time/frequency block coded OFDM systems (STBC/SFBC-OFDM). Since STBC-OFDM and SFBC-OFDM undergo severe performance degradation in time- and frequency-selective fading channels, respectively, performance enhancement can be achieved by switching between STBC-OFDM and SFBC-OFDM over a continuously varying channel environments. Thus, a new switching scheme based on the characteristics of the actual channel is proposed. The effectiveness of the proposed scheme is demonstrated by computer simulations.

It is known that the schedulability of a non-preemptive task set with fixed priority can be determined in pseudo-polynomial time. However, since Rate Monotonic scheduling is not optimal for non-preemptive scheduling, the applicability of existing polynomial time tests that provide sufficient schedulability conditions, such as Liu and Layland's bound, is limited. This letter proposes a new sufficient condition for non-preemptive fixed priority scheduling that can be used for any fixed priority assignment scheme. It is also shown that the proposed schedulability test has a tighter utilization bound than existing test methods.

In this paper, we study low complexity transceiver for double space time transmit diversity (DSTTD) and orthogonal frequency division multiplexing (OFDM) system with antenna shuffling. Firstly, we propose a novel antenna shuffling method based on the criterion of minimizing the condition number of channel correlation matrix. The condition number is an indicator about the quality of the channel. By selecting the minimum of condition number which has better channel quality, consequently, a linear detector with respect to this new channel may achieve better performance results. A low complexity variant of the condition number calculation is also proposed, and it is shown that this criterion can be reduced to the minimum mean square error (MMSE) based criterion. Furthermore, the weighted soft decision Viterbi decoding is applied to mitigate noise enhancement inherent to zero forcing (ZF) and MMSE linear receivers and improve error rate performance. Next, we propose an algorithm to reduce the amount of feedback by exploiting the fact that the channel frequency responses across OFDM subcarriers are correlated. In the proposed algorithm, subcarriers are clustered in blocks, which are allocated the same shuffling pattern with the largest number of the shuffling patterns in the cluster. This way, the signaling overhead can be reduced in comparison with each subcarrier based feedback. Extensive simulations show that the proposed techniques for DSTTD-OFDM system outperform other existing techniques under both uncorrelated and highly spatial correlated frequency selective MIMO fading channels.

We propose a scalable parallel interface that provides an ideal aggregated bandwidth link for an application. The scalable parallel interface uses time information to align packets and allows dynamic lane and/or path change, a large difference in transmission delays among lanes, and so on. The basic performance of the scalable parallel interface in 10 Gb/s 2 lanes is verified using an estimation board that is newly developed to evaluate the basic functions used in a Terabit LAN. The evaluation shows that the scalable parallel interface achieves a very low delay variation that is almost the same as that under back-to-back conditions. The difference in the delay variation between the scalable parallel interface and the back-to-back condition is approximately 10 ns when the transmission delay time varies from 10 µs to 1 s.

We newly design time-varying low-density parity-check convolutional codes (LDPC-CCs) based on parity check polynomials of the convolutional codes with a time period of 3, and show that BER (Bit Error Rate) performance in the time-varying LDPC-CCs with a time period of 3 is better than that in the conventional time-varying LDPC-CCs with a time period of 2 in the same coding rate with the nearly equal constraint length.

This letter proposes a new retransmission persistence management scheme for selective repeat automatic repeat request (SR-ARQ). By considering the overall traffic load that has to be managed by SR-ARQ, the proposed scheme arbitrates the retransmission persistence to prevent an abrupt delay increment due to excessive link-level local retransmissions. OPNET simulations show that SR-ARQ performs better with the proposed scheme than with a fixed value of retransmission persistence in terms of the throughput of transmission control protocol (TCP).

The purpose of this paper is to investigate the possible impact of cellular phones' signals on implantable cardiac pacemakers in elevators. This is achieved by carrying out precise numerical simulations based on the Finite-Difference-Time-Domain method to examine the electromagnetic fields in elevator models. In order to examine the realistic and complicated situations where humans are present in the elevator, we apply the realistic homogeneous human phantom and cellular radios operating in the frequency bands 800 MHz, 1.5 GHz and 2 GHz. These computed results of field strength inside the elevator are compared with a certain reference level determined from the experimentally obtained maximum interference distance of implantable cardiac pacemakers. This enables us to carry out a quantitative evaluation of the EMI risk to pacemakers by cellular radio transmission. The results show that for the case when up to 5 mobile radio users are present in the elevator model used, there is no likelihood of pacemaker malfunction for the frequency bands 800 MHz, 1.5 GHz and 2 GHz.

This paper presents a content-based retrieval algorithm for motion capture data, which is required to re-use a large-scale database that has many variations in the same category of motions. The most challenging problem is that logically similar motions may not be numerically similar due to the motion variations in a category. Our algorithm can effectively retrieve logically similar motions to a query, where a distance metric between our novel short-term features is defined properly as a fundamental component in our system. We extract the features based on short-term analysis of joint velocities after dividing an entire motion capture sequence into many small overlapped clips. In each clip, we select not only the magnitude but also the dynamic pattern of the joint velocities as our features, which can discard the motion variations while keeping the significant motion information in a category. Simultaneously, the amount of data is reduced, alleviating the computational cost. Using the extracted features, we define a novel distance metric between two motion clips. By dynamic time warping, a motion dissimilarity measure is calculated between two motion capture sequences. Then, given a query, we rank all the motions in our dataset according to their motion dissimilarity measures. Our experiments, which are performed on a test dataset consisting of more than 190 motions, demonstrate that our algorithm greatly improves the performance compared to two conventional methods according to a popular evaluation measure P(NR).

Due to the recent increase in electronic devices mounted on automobiles, a large number of connectors, especially low-cost tin plated connectors are being used. As a result, their contact reliability has become problematic. Furthermore, for the connectors which are subjected to fretting wear caused by heat cycle and vibrations, the contact resistance increases because of wear of tin and deposition of oxides, which generates problems of poor contact. This study is intended to analyze the change in contact resistance of tin plated connectors from the start of fretting wear to the end of their lifetime from the viewpoint of practical reliability, and to observe the trace and the characteristics of fretting wear microscopically. This study found that wear and oxidation of tin plated connectors start immediately with fretting wear, and thus accumulation of abrasion powder on fretting areas causes connectors to reach to the end of their useful lifetime quickly. Especially, it was demonstrated that amplitude of fretting has a considerable influence on a connector's lifetime. It is made clear that air-tightness, so-called "gas-tight" of tin in a fretting area influences fretting wear considerably.

Research of the shortest path problem in time-dependent networks has important practical value. An improved pheromone update strategy suitable for time-dependent networks was proposed. Under this strategy, the residual pheromone of each road can accurately reflect the change of weighted value of each road. An improved selection strategy between adjacent cities was used to compute the cities' transfer probabilities, as a result, the amount of calculation is greatly reduced. To avoid the algorithm converging to the local optimal solution, the ant colony algorithm was combined with genetic algorithm. In this way, the solutions after each traversal were used as the initial species to carry out single-point crossover. An improved ant colony algorithm for the shortest path problem in time-dependent networks based on these improved strategies was presented. The simulation results show that the improved algorithm has greater probability to get the global optimal solution, and the convergence rate of algorithm is better than traditional ant colony algorithm.

This Letter deals with the problem of non-line-of-sight (NLOS) in cellular systems devoted to location purposes. In conjugation with a variable loading technique, we present an efficient technique to make covariance shaping least squares estimator has robust capabilities against the NLOS effects. Compared with other methods, the proposed improved estimator has high accuracy under white Gaussian measurement noises and NLOS effects.

Frequency-domain equalization (FDE) based on the minimum mean square error (MMSE) criterion can provide a better bit error rate (BER) performance than rake combining. However, the residual inter-chip interference (ICI) is produced after MMSE-FDE and this degrades the BER performance. Recently, we showed that frequency-domain ICI cancellation can bring the BER performance close to the theoretical lower bound. To further improve the BER performance, transmit antenna diversity technique is effective. Cyclic delay transmit diversity (CDTD) can increase the number of equivalent paths and hence achieve a large frequency diversity gain. Space-time transmit diversity (STTD) can obtain antenna diversity gain due to the space-time coding and achieve a better BER performance than CDTD. Objective of this paper is to show that the BER performance degradation of CDTD is mainly due to the residual ICI and that the introduction of ICI cancellation gives almost the same BER performance as STTD. This study provides a very important result that CDTD has a great advantage of providing a higher throughput than STTD. This is confirmed by computer simulation. The computer simulation results show that CDTD can achieve higher throughput than STTD when ICI cancellation is introduced.

The Finite-Difference Time-Domain (FDTD) technique is presented in this paper as an estimation method for radio propagation prediction in large and complex wireless local area network (WLAN) environments. Its validity is shown by comparing measurements and Ray-trace method with FDTD data. The 2 GHz (802.11b/g) and 5 GHz (802.11a) frequency bands are used in both the calculations and experiments. The electric field (E-field) strength distribution has been illustrated in the form of histograms and cumulative ratio graphs. By using the FDTD method to vary the number of human bodies in the environment, the effects on E-field distribution due to human body absorption are also observed for 5 GHz WLAN design.

In multi-hop wireless networks, since source and destination nodes usually have some candidate paths between them, communication quality depends on the selection of a path from these candidates. For network design, characterizing the best path is important. To do this, in [1], [2] we used expected transmission count (ETX) as a metric of communication quality and showed that the best path for ETX is modeled by a path that consists of links whose lengths are close to each other in static one-dimensional multi-hop networks with a condition that the ETX function of a link is a convex monotonically increasing function. By using the results of this characterization, a minimum route ETX can be approximately computed in a one-dimensional random network. However, other metrics fail to satisfy the above condition, like medium time metric (MTM). In this paper, we use MTM as a metric of communication quality and show that we cannot directly apply the results of to the characterization of the best path for MTM and the computation of minimum route MTM. In this paper, we characterize the path that minimizes route MTM in a different manner from [1] [2] and propose a new approximate method suitable for the computation of minimum route MTM.