Time series (TS) data have consistently been in short supply but needed to train systems in prediction, modeling, classification etc. Synthesis can serve to expand the sample population, yet it is crucial to maintain the statistical characteristics between the synthesized and the original TS to ensure consistent sampling of data. In such synthesis the time domain characteristics of the data may not be preserved which motivates for our work, the objective which is to retain for a synthesized TS: fundamental statistical attributes as well as important time domain features such as its overall shape and significant transients. In a novel way, we isolate important TS features into various components leaving the residual signal to be randomized. Using accelerometer data in a clinical setting, we compare our method to others and show it has higher fidelity to the original signal features, has good diversity and performs better data classification.

In this paper, we propose an anonymous scheme for file retrieval systems, MIX-Crowds, in which it is harder for an attacker to identify the requester of the file by making use of the idea of MIX [7] and Crowds [20] to establish a path from the requester to the file holder. Result shows that predecessor attack [26] is much more difficult to succeed compared with Crowds [20]. We are able to reduce the estimated number of rounds needed for successful predecessor attack for MIX-Crowds. We also propose a file transfer strategy according to file size. With such strategy, requests for small size files can be completed faster while the downloading time of large size files only increases slightly.

In this paper, we present the design, the implementation details, and the evaluation results of an intrusion detection and defense system for distributed denial-of-service (DDoS) attack. The evaluation is conducted using an experimental testbed. The system, known as intrusion detection router (IDR), is deployed on network routers to perform online detection on any DDoS attack event, and then react with defense mechanisms to mitigate the attack. The testbed is built up by a cluster of sufficient number of Linux machines to mimic a portion of the Internet. Using the testbed, we conduct real experiments to evaluate the IDR system and demonstrate that IDR is effective in protecting the network from various DDoS attacks.

The multitier environment of mobile communication systems is an integration of different mobile systems such as cellular, cordless, and satellite systems for mobile users to communicate with anyone, anywhere, and anytime. An effective and efficient scheme is needed for mobile terminals to dynamically select the most appropriate tier of mobile system for optimizing communication cost and performance. This paper presents a model for studying the effect of level switching in a multitier environment and for the performance evaluation of level switching schemes. This model is based on the continuous-time stochastic process, which is parameterized by a set of state-transition rates and costs derived from the characteristics of the mobile systems and terminals. Several level switching schemes based on different triggering events are proposed and the performance is analyzed using the proposed model. Level switching is found to be an effective way to reduce communication costs. The performance gain increases with the frequency of the switching activities and the level switching costs are insignificant in most cases. By using the model, the most cost-effective switching scheme can be selected to match the characteristics of individual mobile users and mobile systems for optimizing overall system performance.

To provide secure communication for mobile devices, an authenticated key agreement protocol is an important primitive for establishing session keys. However, most existing authenticated key agreement protocols are not designed for wireless mobile communication for which bandwidth and device storage capacity are limited. Also, as mobile devices are more vulnerable to attack, providing forward secrecy becomes an essential element in the protocol. Based on Seo and Sweeney's simple authenticated key agreement algorithm (SAKA), we develop an improved authenticated key agreement protocol that eliminates the disadvantages of SAKA and provides identity authentication, key validation, and perfect forward secrecy. Also, our protocol can foil man-in-the-middle attacks. We also show how our proposed protocol can be included in the current 3GPP2 specifications for OTASP to improve A-key (authentication key) distribution, which is the master key in IS-95 and cdma2000 mobile networks. The proposed protocol requires significantly less bandwidth, and less computational and storage overhead, while having higher security compared to 3GPP2 specifications. The proposed protocol can also be applied to other wireless communication scenarios.

In managing the locations of mobile users in mobile communication systems, the distance-based strategy has been proven to have better performance than other dynamic strategies, but is difficult to implement. A simple approach is introduced to implement the distance-based strategy by using the cell coordinates in calculating the physical distance traveled. This approach has the advantages of being independent of the size, shape, and distribution of cells, as well as catering for the direction of movement in addition to the speed of each mobile terminal. An enhanced distance-based location management strategy is proposed to dynamically adjust the size and shape of location area for each individual mobile terminal according to the current speed and direction of movement. It can reduce the location management signaling traffic of the distance-based strategy by half when mobile terminals have predictable directions of movement. Three types of location updating schemes are discussed, namely, Circular Location Area, Optimal Location Area, and Elliptic Location Area. Paging schemes using searching techniques such as expanding distance search based on the last reported location and based on the predicted location, and expanding direction search are also explored to further reduce paging signal traffic by partitioning location areas into paging areas.

As electronic commerce becomes increasingly popular, more business data are being stored in digital form and processed by software systems, rather than being stored in paper form and handled by human beings. Consequently, loss of company secrets via the electronic media is becoming a greater threat to organizations. This paper gives a brief analysis of the risk associated with losing corporate confidential information in electronic form

The end-to-end window scheme is a popular mechanism for flow and congestion control in packet switched networks. The window scheme may be implemented in the transport layer protocol (like in TCP), or in the source-to-destination protocol(like in ARPANET), or in the network layer protocol (like X.25). In many implementations, the window size is chosen at connection set up time.

Jury's stability test for discrete systems is simplified to the Routh algorithm. Based on the elements obtained from the new formulation, a Liapunov function is synthesized; in turn, by using the second method of Liapunov, the stability criterion is proven.