This paper proposes a network design scheme for Virtual Private Network (VPN) services. Traditionally, network design to compute required amount of resource is based on static point-to-point resource demand. This scheme is effective for traditional private line services. However, since VPN services allow multi-site connectivity for customers, it may not be appropriate to design a network based on static point-to-point resource demand. In particular, this scheme is not effective when the traffic pattern changes over time. Therefore, network design for VPN services introduces a new challenge in order to comply with traffic flexibility. There are conventional studies tackling this issue. In those studies, by defining a resource demand model considering flexibility, and designing the network based on this model, amount of resource required can be computed. However, there are some deficiencies in those studies. This paper proposes a new network design scheme, consisting of two components. The first one is a new resource demand model, created by extending conventional resource demand models, that can specify resource demand more precisely. The second one is a new network design algorithm for this resource demand model. Simulations are conducted to evaluate the performance of the proposed network design scheme, and the results show significant performance improvement against conventional schemes. In addition, deployment considerations of the proposed scheme are analyzed.

This paper considers systems consisting of communicating processes which can move between specified locations. Mobile telephone systems and intelligent transport systems are examples of them. The processes can exchange data as well as channels (e.g. frequencies) to be used in further communication. It may happen that two processes (e.g. telephones or cars) in different locations could communicate directly because they share a communication channel, but they cannot as there is a physical obstacle between the locations. A possible solution is to allow one process to send a message to another one through other processes and locations. To see if this is possible, a notion of connectivity of processes has been devised in the literature. A process was defined to be connectable to another one if a message from the first one could reach the other one by using any existing communication actions, allowed locations, and process moves in the system. A process-algebraic approach for checking connectivity was proposed. In this paper, it is shown how the temporal logic of actions (TLA) can be employed for the same purpose. In both approaches, connectivity of a process with another one is basically checked as follows. The first process includes a marking message in all its sending actions. Every process that receives this message gets marked and includes it in its own sending actions. The first process is connectable to the second one if there exists such a system execution sequence that the latter gets marked in it. Since TLA is a linear-time temporal logic, it can generally not express such a property. This paper, however, shows that it can be expressed and verified for a given TLA system specification. It also shows how to specify the marking operations and provides an example of connectivity checking.

Orthogonal Frequency Division Multiple Access (OFDMA) allows multiple users to make use of the same bandwidth as the single-user OFDM for data transmission and is a promising candidate to be used for future cellular systems. A key issue at hand is the rate-adaptive resource allocation problem. In this paper, we propose two basic subcarrier allocation schemes with low complexities based on the magnitude of the channel frequency responses. The proposed algorithms ensure a fair resource allocation in terms of the number of subcarriers with affordable bit-rates. Through extensive discussions and Monte Carlo simulations, a comprehensive comparison with previously derived subcarrier allocation schemes is performed which depicts the pros and cons of our proposed algorithms.

This paper discusses the on-line frequency identification problem for a measured sinusoidal signal by using the adaptive method and filter theory. The proposed method is based on an identity between the sinusoidal signal and its second order derivative. For a set of chosen parameters, the proposed method is robust to the initial phase, the amplitude, and the frequency in a wide range. The convergence rate can be adjusted by the chosen parameters. The estimation error mainly depends on the frequency of the sinusoid, the measurement noise and a key design parameter.

Secret sharing is a method for distributing a secret among a party of participants. Each of them is allocated a share of the secret, and the secret can only be reconstructed when the shares are combined together. We have been proposing a secret sharing distributed database system (SSDDB) that uses a secret sharing scheme to improve confidentiality and robustness of distributed database systems. This paper proposes a vertical partitioning algorithm for the SSDDB, and evaluates the algorithm by computational experiments.

In this paper a new method for the design and optimization of microstrip parallel coupled-line bandpass filters is presented which allows for the specification of frequency bandwidths and arbitrary source and load impedance transformation. The even- and odd-mode theory and the relationships between impedance, transmission and scattering matrices and their properties are used to construct a positive definite error function using the insertion losses at discrete frequencies in the pass, transition and stop bands. The dispersion relations for the coupled line are also taken into account. The minimization of the error function determines the widths, gap spacings and lengths of the coupled-line filter, for the optimum design and realization of filter specifications. The proposed filter design and optimization method is coded by computer programs and the results of simulation, fabrication and testing of sample filters together with comparisons with available full-wave analysis softwares, indicate the efficacy of the proposed method. Filter design with up to 50% bandwidth and the design of shorter lengths of coupled line sections are achievable by the proposed method in part due to the incorporation of impedance matching.

Optical fiber communications require multiple-access schemes to access a shared channel among multiple users. The coherent ultrashort light pulse code-division multiple-access (CDMA) system is one such scheme, and it also offers asynchronous-access communication. This system usually employs 2-level, i.e., binary, m-sequences as signature codes because of their low correlation. If the number of active users is greater than the length of the m-sequence, i.e., code length, distinct m-sequences are used. However, the distinct 2-level m-sequences do not exhibit low correlation, resulting in performance degradation. We therefore propose a coherent ultrashort light pulse CDMA communication system with distinct 4-level, i.e., quaternary, m-sequences to improve system performance when the number of users is greater than the code length. We created the 4-level m-sequences from 2-level m-sequences, and assess the correlation of the 4-level m-sequences. We also theoretically derive the bit error rate (BER) of the proposed system taking into account multiple-access interference (MAI), beat noise, amplified spontaneous emission (ASE), shot noise, and thermal noise. The numerical results show that BER for distinct 4-level m-sequences is more than an order of magnitude smaller than that for distinct 2-level m-sequences. BER is limited by MAI and beat noise when the power of the received signal is high, otherwise BER is limited by ASE, shot noise, and thermal noise.

We have developed a spread-spectrum Phase-Locked Loop (PLL) for serial Advanced Technology Attachment (ATA) applications. We investigated the relation between the output jitter of PLLs in serial ATA applications and ΣΔ modulators in PLLs. On the basis of this study, we developed a spread-spectrum PLL for serial ATA applications and achieved a combination of small jitter and large electromagnetic interference (EMI) peak power reduction. This was achieved using two key components: multi-bit ΣΔ-controlled PLL and voltage-controlled oscillation with cross-coupled load delay cells. Using a 0.15-µm complementary metal-oxide semiconductor process, we fabricated a complete serial ATA transceiver featuring a spread-spectrum clock generator (SSCG). We achieved a spread-spectrum PLL with 10-dB EMI reduction and 8.1 ps random jitter for use in serial ATA applications. All other measured results for SSCG performance were very good and showed that the spread-spectrum generator more than satisfies serial ATA specifications.

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.

Recently there are various requirements for LSI testing, such as test compaction, test compression, low power dissipation or increase of defect coverage. If test sequences contain lots of don't cares (Xs), then their flexibility can be used to meet the above requirements. In this paper, we propose methods for finding as many Xs as possible in test sequences for sequential circuits. Given a fully specified test sequence generated by a sequential ATPG, the proposed methods produce a test sequence containing Xs without losing stuck-at fault coverage of the original test sequence. The methods apply an approach based on fault simulation, and they introduce some heuristics for reducing the simulation effort. Experimental results for ISCAS'89 benchmark circuits show the effectiveness of the proposed methods.

We propose a scheme by which Broadcast Satellite/Communication Satellite- radio frequency (BS/CS-RF) converted TV signals are transmitted over optical fiber, and also propose a simultaneous Frequency Modulation (FM) converted CATV and BS/CS-RF converted TV optical transmission system as one of its applications. To confirm the proposals, we demonstrate the simultaneous transport of FM converted CATV signals and BS/CS-RF converted TV signals over a single optical fiber. In the experiments, 40 carriers of AM-VSB CATV channels, 30 carriers of 64-QAM digital TV channels, 8 carriers of FM/TC8PSK BS-TV channels, and 12 carriers of QPSK CS-TV channels are simultaneously transmitted. For optical access network application, the practical transmission length of 15 km over 1.3 µm-zero-dispersion optical fiber can be achieved by using dispersion compensation fiber (DCF).

In this paper, we propose a new projector-based display which can perform the color simulator for print industry. The proposed color simulator can change the color of print by projecting the image onto the print. A color of print can be matched to the desired color by projecting the image which is calculated to minimize the color difference between the colors of target print and current print. This current print is measured by digital camera or digital scanner. Ideally, spectral camera or scanner is expected to be used for accurate color simulation on the current print, but it costs a lot for practical application. Therefore, in this paper, we compared two methods for color matching, one is the tristimulus-based method with XYZ tristimulus values and the other is the spectral-based method with spectral values. As the result of computer simulation, the average color difference ΔE *94 was 0.27 by the spectral-based method between the reflected radiance from the color of target print and the color of current print with projector, and the average color difference ΔE *94 was 2.09 by the tristimulus-based method. The efficiency of the proposed system is verified by the subjective evaluation between the target and current print with appropriate image projection.

In this paper, we present a scheduler that incorporates round robin service within a VirtualClock discipline. Time-stamp based scheduling algorithms attain a low local delay bound and performance guarantee, but are computationally complex. On the other hand, round robin schemes are simple to implement and have computational complexity of O(1), but they are well known for their output burstiness and short-term unfairness. In order to overcome this problem, we combine round robin with VirtualClock in an algorithm we call VCRR. VCRR possesses better fairness than simple round robin, low jitter and a good scheduling delay bound. At the same time, VCRR preserves the O(1) time complexity of round robin. Simulation experiments show VCRR's efficiency in terms of delay performance, jitter and fairness.

A hard real-time system is one whose correctness depends not only on the logical result, but also when the results are produced. While many techniques have been proposed for single processor real-time systems, multiprocessor systems have not been studied so extensively. In this paper, we mainly propose two variant (DCTS) by using the Early-Release-Fair (ERfair) and Proportionate-fair (Pfair) model with integral assumptions for identical multi-processor real-time systems. ERfair is a scheduling model for real-time tasks on a multiprocessor system. On the different definitions of distance constraint, we propose two efficient scheduling algorithms designed to probe whether the distance constraints of all ER-fair tasks can be guaranteed. If the distance constraints cannot be guaranteed, then the proposed algorithms gather the unfeasible tasks and inflate them with a reweighting function. The proposed algorithms are linear-time and most suitable for dynamic systems. The experimental results reveal that the proposed algorithms increase significantly the ratio of schedulable task sets.

In this paper, an Ultra-Wideband (UWB) double-directional channel sounding measurement and spatio-temporal analysis of UWB propagation based on the clusterization approach were reported. After separating the propagation paths and diffuse components both on the transmitter (Tx) antenna and receiver (Rx) antenna positions, the propagation paths both on Tx and Rx positions were observed for clusters separately, while coupling the clusters between Tx and Rx position based on similar time of arrivals, and ray tracing by utilizing high temporal and spatial resolution, respectively. The relation between direction of departure and direction of arrival will then be investigated. For cluster properties, parameters of model characteristics are discussed and compared to other earlier works.

For mobile visual communications, the development of more robust and efficient video traffic control and transmission techniques remains one of the most important issues. Foveated video originates from visual entropy reduction by removing undetectable high visual frequencies that occur at a distance from the fixation point. In this paper, compression gain is defined and measured to quantify the enhanced performance when the visual throughput of the regions of interest (ROI) is increased over a capacity-limited channel.

In computer simulation of a large number of moving objects (MOs), how to enlarge Δt (the interval between the simulation time steps) without introducing causality errors is one of the primary keys to enhancing performance. Causality errors can be avoided by using the same Δt among related MOs when they are in the scene of detection (SoD). But in a large-scale MO simulation, MOs interact with one another in a complicated manner requiring a large calculation cost to predict the beginning time of SoD. In this paper we propose an event-aware dynamic time step synchronization method (DTSS) for distributed MO simulation, which increases Δt without introducing causality errors and speeds up the simulation. DTSS can be implemented with little calculation cost because: (1) DTSS does not calculate the beginning time of SoD exactly, but calculates the time for possible entry into SoD with a simple mechanisim, and (2) MO simulation consists of a "movement"-phase and a "detection"-phase in which the distance-calculation between MOs requires a heavy load, and DTSS utilizes the distance values to calculate Δt. In this paper, we also discuss a suitable HLA based time management mechanism to implement DTSS on a distributed computing environment. In the performance evaluation of DTSS, the calculation cost of DTSS is implemented by using the HLA suitable time management mechanism. The results show that DTSS can be executed within the ideal time plus its 1% over-cost when a basic scenario of war-game simulation is employed. Therefore if the ratio of SoD to the total simulation is small, the execution time is expected to decrease to nearly this ratio. We also introduce the criterion for determining when DTSS is superior to the conventional method by using the performance evaluation results. The results presented in this paper are effectively utilized when DTSS is applied to practical applications.

This paper reports on a study of the interference effects from 2 types of ultra wideband (UWB) sources on a QPSK transmission system by simulation. The culprit UWB sources were: multi-band orthogonal frequency-division multiple-access (MB-OFDM) and direct-sequence UWB (DS-UWB), which were modeled on the proposal specifications in the IEEE 802.15.3a to standardize high-speed wireless personal area networks. Average bit error rate (BER) degradation of the victim system was evaluated under in-band interference from the UWB signals. The proposed modified equivalent baseband system was employed in the simulation in order to reduce the simulation costs. Interference effects from the UWB sources were also examined under a Rayleigh fading channel.

It is well known that the diversity gain attained by DCA (Dynamic Channel Allocation) is generally very high over OFDM (Orthogonal Frequency Division Multiplexing)-based broadband networks. This paper introduces a numerical approach for measuring the performance gain afforded by DCA. In the mathematical analysis, the property of order statistics is adopted to derive the upper bound of the expected throughput via the use of DCA. In the simulation, it was possible to achieve a gain of 5 dB by exploiting multi-user and spectral diversities when the number of users is 16 and the total number of subcarriers is 256.

This paper presents an automated design of analog circuits starting with idealized elements. Our system first synthesizes circuits using idealized elements by a genetic algorithm (GA). GA evolves circuit topologies and transconductances of idealized elements to achieve the given specifications. The use of idealized elements effectively reduces search space and make the synthesis efficient. Second, idealized elements in a generated circuit are replaced by MOSFETs. Through the two processes, a circuit satisfying the given specifications can be obtained. The capability of this method was demonstrated through experiments of synthesis of a trans-impedance amplifier and a cubing circuit and benchmark tests. The results of the benchmark tests show the proposed CAD is more than 10 times faster than the CAD which does not use idealized elements.