Data mining across different companies, organizations, online shops, or the likes is necessary so as to discover valuable shared patterns, associations, trends, or dependencies in their shared data. Privacy, however, is a concern. In many situations it is required that data mining should be conducted without any privacy being violated. In response to this requirement, in this paper we propose an effective distributed privacy-preserving data mining approach called SDDM. SDDM is characterized by its ability to resist collusion. Unless the number of colluding sites in a distributed system is larger than or equal to 4, privacy cannot be violated. Results of performance study demonstrated the effectiveness of SDDM.

The multi-step prediction model based on partial least squares (PLS) is established to predict short-term load series with high embedding dimension in this paper, which refrains from cumulative error with local single-step linear model, and can cope with the multi-collinearity in the reconstructed phase space. In the model, PLS is used to model the dynamic evolution between the phase points and the corresponding future points. With research on the PLS theory, the model algorithm is put forward. Finally, the actual load series are used to test this model, and the results show that the model plays well in chaotic time series prediction, even if the embedding dimension is selected a big value.

Providing multimedia services with a quality-of-service guarantee in mobile wireless networks presents more challenges due to user's mobility and limited bandwidth resource. In order to provide seamless multimedia services in the next-generation wireless networks, efficient call admission control algorithm must be developed. A novel borrowing-based call admission control policy is proposed in this paper as a solution to support quality-of-service guarantees in the mobile multimedia wireless networks. Based on the existing network conditions, the proposed scheme makes an adaptive decision for bandwidth allocation and call admission by employing attribute-measurement mechanism, dynamic time interval reservation strategy, and service-based borrowing strategy in each base station. We use the dynamically adaptive approaches to reduce the connection-blocking probability and connection-dropping probability, and to increase the bandwidth utilization, while the quality-of-service guarantees can be maintained at a comfortable level for mobile multimedia wireless networks. Extensive simulation results show that our proposed scheme outperforms the previously proposed scheme in terms of connection-blocking probability, connection-dropping probability, and bandwidth utilization, while providing highly satisfying degree of quality-of-service in mobile communication systems.

Receiver enhancement at mobile terminals such as using receiver diversity is a way of achieving greater downlink capacity. The enhancement, however, is achieved not instantaneously by a network operator but gradually by the individual users that choose and purchase their own mobile terminals. We investigate in this letter the effect of gradually introducing enhanced receivers at mobiles in different locations. With greedy scheduling, capacity, fairness and coverage are quantified and numerically compared according to locations of enhanced mobiles. The results show that the enhancement made at mobiles nearer to the base provides the greater capacity but this capacity-driving introduction of the enhancement makes the fairness and the coverage poorer.

We describe a new characteristic of soft handoff, call failure when a mobile moves from the handoff region to the normal region, and introduce the metric of region-transition failure probability to more accurately assess the performance of CDMA systems that support real-time video streaming services. This characteristic has not been considered in previous research. Simulations show that this failure must be considered since it significantly degrades system performance.

Scheduling algorithms are playing a key role in overall system performance of broadband wireless systems (BWS). Maximal SNR (MaxSNR) and Round Robin (RR) are two conventional scheduling strategies which emphasize efficiency and fairness respectively. Proportional Fair (PF) algorithm provides tradeoff between efficiency and fairness. In this paper, we apply PF to IEEE 802.16a OFDM based BWS and name it OPF. We also propose a new algorithm for multimedia services: Normalized Multimedia Adaptive OPF (NMAOPF). Adaptive modulation and coding scheme is applied in time varying and frequency selective fading wireless channel. System performances are compared in efficiency and fairness with and without user mobility. Efficiency is in terms of throughput, mean packet delay and packet drop ratio; fairness is in terms of user satisfaction rate and average user rate. Joint PHY and MAC layer simulation results show that: within the traffic range of 55 to 70 Mbps, compared with RR and MaxSNR, the performance of OPF is in between. Our proposed NMAOPF outperforms all others without user mobility, while under mobility, it is not as good as MaxSNR but better than OPF and RR.

In this paper, the problem of Redundant Duplicated RREQ Network-wide Flooding (RDRNF), induced by multiple sensor nodes during route discovery in event-driven wireless sensor networks, is described. In order to reduce the number of signaling messages during the route discovery phase, a novel extension, named the Localized Route Discovery Extension (LRDE), to the on-demand ad hoc routing protocol, is proposed. The LRDE reduces energy consumption during route discovery. The heuristically and temporarily selected Path Set-up Coordinator (PSC) plays the role of a route request broker that alleviates redundant route request flooding. The LRDE also sets a route path be aggregation-compatible. The PSC can effectively perform data aggregation through the routing path constructed by the LRDE. The simulation results reveal that significant energy is conserved by reducing signaling overhead and performing data aggregation when LRDE is applied to on-demand routing protocols.

PbZr0.4Ti0.6O3 (PZT) thin films with high crystallinity and high remanant polarization (Pr) have been fabricated by sol-gel deposition with pulsed excimer (XeCl) laser annealing at low process temperatures. The amorphous PZT films were prepared on Pt/Ti/SiO2/Si substrates by a sol-gel method. The deposited amorphous PZT films were annealed at 550 for 10 min. to initiate the nucleation of the PZT perovskite phase, and then annealed with an UV pulsed excimer laser (308 nm) heating at 400. X-ray diffraction (XRD) patterns show that 150-230 mJ/cm2 range multi-shot excimer laser irradiation drastically improved the crystallinity of the PZT perovskite phase. Field emission SEM (FE SEM) image show that the PZT thin film has uniform-sized crystal grains. The ferroelectric properties were found to depend on the laser energy density and shot number.

Distributed denial-of-service attacks on public servers have recently become more serious. More are SYN Flood attacks, since the malicious attackers can easily exploit the TCP specification to generate traffic making public servers unavailable. To assure that network services will not be interrupted, we need faster and more accurate defense mechanisms against malicious traffic, especially SYN Floods. One of the problems in detecting SYN Flood traffic is that server nodes or firewalls cannot distinguish the SYN packets of normal TCP connections from those of SYN Flood attack. Moreover, since the rate of normal network traffic may vary, we cannot use an explicit threshold of SYN arrival rates to detect SYN Flood traffic. In this paper we introduce a mechanism for detecting SYN Flood traffic more accurately by taking into consideration the time variation of arrival traffic. We first investigate the statistics of the arrival rates of both normal TCP SYN packets and SYN Flood attack packets. We then describe our new detection mechanism based on the statistics of SYN arrival rates. Our analytical results show that the arrival rate of normal TCP SYN packets can be modeled by a normal distribution and that our proposed mechanism can detect SYN Flood traffic quickly and accurately regardless of time variance of the traffic.

CMOS poly-Si thin-film transistors (TFTs) were fabricated through crystallization and GILD processes by a novel selected area laser assisted (SALA) system. The system enables a local area irradiation of small beams of a pulsed solid-state laser of frequency tripled Nd:YAG. The novel TFT process eliminated 3 doping mask steps of the conventional process. On-off current ratios for both types of poly-Si TFTs were improved by SALA. The field effect mobility of n- and p-channel TFTs is 84 cm2/Vs and 75 cm2/Vs, respectively.

In this letter, we propose an efficient user selection algorithm aiming to select users with less spatially correlation and meet the user number limit of zero-forcing beamforming in downlink multiuser MIMO systems. This algorithm yields a considerable complexity reduction with only a small loss in performance and it only needs partial users' CSI feedback. Coupled with the algorithm, a null space updating method in O(K2) time and a modified proportional fair scheduling algorithm are also proposed.

This letter presents a new gossip-based ad hoc service discovery protocol that uses a novel decentralized, peer-to-peer mechanism to provide mobile devices with the ability to advertise and discover services in an efficient way. Our performance study shows that the proposed protocol appropriately addresses the need of proximal service discovery over a dynamic wireless medium.

The proportional delay differentiation (PDD) model provides consistent packet delay differentiation between classes of service. Currently, the present schedulers performing the PDD model cannot achieve desired delay proportion observed in short timescales under light/moderate load. Thus, we propose a Non-Work-Conserving (NWC) scheduler, which utilizes the pseudo-waiting time for an empty queue and forces each class to compare its priority with those of all other classes. Simulation results reveal that NWC outperforms all current schedulers in achieving the PDD model. However, NWC suspends the server from transmitting packets immediately if an empty class has the maximum priority, resulting in an idle server. Therefore, we further propose two approaches, which will serve a best-effort class during this idle time. Compared with other schedulers, the proposed approaches can provide more predictable and controllable delay proportion, accompanied with satisfactory throughput and average queuing delay.

Today's Internet remains faithful to its original design that dates back more than two decades. In spite of tremendous diversity in users, as well as the sheer variety of applications that it supports, it still provides a single, basic, service offering--unicast packet delivery. While this legacy architecture seemed adequate till recently, it cannot support the requirements of newer services and applications which are demanded by the growing, and increasingly sophisticated, user population. The traditional way to solve this impasse has been by using overlay networks to address individual requirements. This does not address the fundamental, underlying problem, i.e., the ossification of the Internet architecture. In this paper, we describe the design of a new Service Oriented Internet framework that enables the flexible and effective deployment of new applications and services. The framework we describe utilizes the existing IP network and presents the abstraction of a service layer that enables communication between service end-points and can better support requirements such as availability, robustness, mobility, etc., that are demanded by the newly emerging applications and services.

This letter describes two low complexity receiver structures over a multi-broadcast channel of an orthogonal frequency division multiple access (OFDMA) multi-user system. The first is a one-group occupied receiver structure, whose complexity is much lower than that of a conventional OFDMA receiver structure. The other one, a multi-group occupied receiver structure, exploits multiple groups for one user, by which users' down-link data rate can be adaptively controlled by a base station (BS). Unlike unchangeable complexity of an OFDMA receiver structure that performs full-size of a fast Fourier transform (FFT) operation although only a few subcarriers are taken, its complexity linearly increases with the number of occupied subcarrier groups. The proposed receiver structures can meet the possible high-rate demand in the down-link and will become one of the strong candidates in next generation mobile communication systems.

Several multiple-input multiple-output (MIMO) techniques have been proposed for 3GPP WCDMA/HSDPA systems and several performance evaluation for the comparison purpose are in progress. Most MIMO candidates in HSDPA have been generally designed for point-to-point communication, which means that a single-user throughput is of their major concern. However, multiple users and user scheduling need to be considered in wireless packet transmission, so as to maximize system throughput. In this paper we propose an effective user scheduling technique in both space and time domains that offers three main benefits, which are the spatial-beamforming, uplink feedback signaling, and advanced receivers. Furthermore, user scheduling is combined with modified successive interference cancellation (SIC) reception, which allocates all transmit antennas to the best user with SIC or each transmit antenna to different users with minimum mean squared-error (MMSE). Simulation results show that the proposed scheme has higher user diversity gain than other MIMO candidates in terms of achievable throughput.

A probability density distribution of the envelope of maximal-ratio combiner output in a very generally distributed fading channel is derived. The derived formula has a series expanded form consisting of positive terms of the well-known m-distribution and is practical for numerical calculation, approximation and analysis.

The EDD connection admission control scheme has been proposed for supporting real-time communication in packet-switched networks. In the scheme, when a connection establishment request occurs, the worst-case link delay in each link along the connection is calculated to determine whether the request can be accepted or not. In order to calculate the worst-case link delay, we must perform a check called the point schedulability check for each of some discrete time instants (checkpoints). Therefore when there are many checkpoints, the worst-case link delay calculation is time-consuming. We have proposed a high-speed calculation method. The method finds some checkpoints for which the point schedulability check need not be performed and removes such unnecessary checkpoints in advance before a connection establishment request occurs, and the check is performed for each of the remaining checkpoints after the request occurs. However, the method is not so effective under the situation that the maximum packet length in networks is large, because the method can find few unnecessary checkpoints under the situation. This paper proposes a new high-speed calculation method. We relax the condition which determines whether or not the point schedulability check need not be performed for each checkpoint in our previous method and derive a new condition for finding unnecessary checkpoints. Using the proposed method based on the new condition, we can increase the number of unnecessary checkpoints compared to our previous method. Numerical examples which are obtained by extensive simulation show that the proposed method can attain as much as about 50 times speedup.

For hybrid Multimedia-on-Demand (MoD) systems which support broadcast, batch and interactive services, the charging scheme employed plays an important role in the delivery of good service quality to users, while also determining the revenue generated for the service provider. In this letter a new charging scheme is proposed. This scheme provides the same quality of service to the users as previous charging schemes while providing higher revenue. Numerical results are presented to evaluate the performance of the new charging scheme in comparison with previous schemes.

Hirose and Yoshida proposed an authenticated key agreement protocol based on the intractability of the Computational Diffie-Hellman problem. Recently, Hirose and Matsuura pointed out that Hirose and Yoshida's protocol is vulnerable to Denial-of-Service (DoS) attacks. And they proposed two key agreement protocols which are resistant to the DoS attacks. Their protocols are the first authenticated key agreement protocols resistant to both the storage exhaustion attack and the CPU exhaustion attack. In this paper we show that Hirose and Matsuura's DoS-resistant key agreement protocols and Hirose and Yoshida's key agreement protocol are vulnerable to impersonation attacks. We make suggestions for improvements.