Assessment of discovered patterns is an important issue in the field of knowledge discovery. This paper presents an evaluation method that utilizes citation (reference) information to assess the quality of discovered document relations. With the concept of transitivity as direct/indirect citations, a series of evaluation criteria is introduced to define the validity of discovered relations. Two kinds of validity, called soft validity and hard validity, are proposed to express the quality of the discovered relations. For the purpose of impartial comparison, the expected validity is statistically estimated based on the generative probability of each relation pattern. The proposed evaluation is investigated using more than 10,000 documents obtained from a research publication database. With frequent itemset mining as a process to discover document relations, the proposed method was shown to be a powerful way to evaluate the relations in four aspects: soft/hard scoring, direct/indirect citation, relative quality over the expected value, and comparison to human judgment.

In this work particle swarm optimization (PSO) aided with radial basis functions (RBF) has been suggested to carry out multiuser detection (MUD) for synchronous direct sequence code division multiple access (DS-CDMA) systems. The performance of the proposed algorithm is compared to that of other standard suboptimal detectors and genetic algorithm (GA) assisted MUD. It is shown to offer better performance than the others especially if there are many users.

The traffic with asymmetry between uplink and downlink has recently been getting remarkable on mobile communication systems providing multimedia communication services. In the future mobile communications, the accommodation of asymmetric traffic is essential to realize efficient multimedia mobile communication systems. This paper discusses asymmetric traffic accommodation in CDMA/FDD cellular packet communication systems and proposes its efficient scheme using an adaptive cell sizing technique. In the proposed scheme, each base station autonomously controls its coverage area so that almost the same communication quality can be achieved across the service area under the asymmetric traffic conditions. We present some numerical examples to demonstrate the effectiveness of the proposed scheme by using computer simulation. The simulation results show that, under asymmetric traffic conditions, the proposed scheme can provide fair communication quality across the service area in both links and can improve total transmission capacity in the uplink.

The transmit power of Ultra Wideband (UWB) is limited in short range communications to avoid the interference with existing narrow-band communication systems. Since this limits UWB communication range, this paper proposes a novel relay scheme that uses shared frequency repeaters for impulse UWB signal relay to improve system range. After considering possible problems with the repeater, in particular the coupling interference between the input and output and relay-delay, a switching control method is proposed that offers short relay-delay and suppresses the coupling interference at the repeaters. With respect to the proposed relay scheme, Pulse-Position-Modulation (PPM) UWB-based signal relay is evaluated by analyzing its BER performance using the point-to-point transmission link model.

We propose a method of crosstalk analysis for two bent transmission lines with vias at both ends on a PCB using a circuit-concept approach in the quasi-static condition. In this condition, the electromagnetic fields can be approximately estimated by the quasi-static terms of the accurate Green's function in an inhomogeneous medium. Thus we obtain a circuit model in an ABCD matrix by taking account of the fields generated by a longitudinal line and a vertical via on a PCB. To verify the proposed approach, we conducted some experiments and compared our approach's results with measured results and a commercial electromagnetic solver's results.

The crosstalks between a single-ended line and a differential pair in parallel are analyzed using telegrapher's equations for multi-conductor lines. The crosstalk from the single-ended trace to the differential pair is estimated at shunt-arm resistors in T or Π termination networks. The analysis is conducted by incorporating the termination conditions with the solution of the telegrapher's equations. The time-domain characteristics of the crosstalk are obtained by using the fast inverse Laplace transform. The measurements are conducted easily by using a single-ended digital oscilloscope since the crosstalk is evaluated on the shunt-arm resistors. Both the calculated and measured results are presented, and the characteristics of the crosstalk are also investigated qualitatively.

A new radio-frequency (RF) radiated immunity/susceptibility test method using four-septum TEM cell is proposed. A rotating-EM field can be generated inside the cell by feeding four-different RF DSB-SC signals to four septa arranged in the cell. Since a polarization plane of the rotating-EM field rotates in a low speed, the immunity/susceptibility test for the EM field with various polarizations can be conducted more easily. In this paper, a technique for generating the rotating-EM field in the cell is investigated. The basic characteristics of the cell and the rotating-EM field by using the technique are clarified. To verify the validity of this test method, a RF radiated susceptibility of a printed circuit board is measured. The measured results are verified by comparing with the theoretical results based on modified telegrapher's equations.

This paper presents an automated design of linear and non-linear differential analog circuits accelerated by reuse of genetic operations. The system first synthesizes circuits using pairs of simplified MOSFET model. During the evolutionary process, genetic operations that improve circuit characteristics are stored in a database and reused to effectively obtain a better circuit. Simplified elements in a generated circuit are replaced by MOSFETs and optimization of the transistor size is performed using an optimizer available in market if necessary. The capability of this method is demonstrated through experiments of synthesis of a differential voltage amplifier, a circuit having cube-law characteristic in differential mode and square-law characteristic in common-mode, and a dB-linear VGA (Variable Gain Amplifier). The results show the reuse of genetic operations accelerates the synthesis and success rate becomes 100%.

In this letter we investigated the packet transmission control in downlink CDMA cellular systems. The downlink packet transmission control scheme based on the soft handoff status was proposed to enhance the system performance. The proposed scheme controls the downlink packet transmissions by employing a transmission window which is individually resolved to each mobile station according to its propagation condition and soft handoff status. Computer simulation shows that compared with the conventional scheme the proposed scheme improved the delay performance and fairness of service in packet reception.

In peer-to-peer (P2P) networks, reputation is used to estimate the trustworthiness of servents and to help prevent untrustworthy resources from spreading by malicious servents. However, in dynamic scenarios with arrivals and departures of servents and resources, servent reputation is not enough to reduce the impacts of malicious behaviors such as lying, whitewashing, etc. In this paper, we propose a new reputation management model using both servent and resource reputation and demonstrate detail protocols to implement our model in structured P2P networks. Simulation results show that our model can reduce the rate of downloading untrustworthy resources more rapidly than the previous models even in dynamic scenarios where servents can rejoin with new identities, introduce new untrustworthy resources, and send wrong feedbacks. Also, we show that the proposed model and protocol can effectively share the load between servents.

This paper proposes a new identifier scheme for Internet Indirection Infrastructure (i3). i3 is an overlay network on top of IP, and realizes rendezvous-based communications. It provides a general solution to deal with communication primitives such as host mobility, multicast and anycast. Although i3 provides flexible communication mechanisms, it is not optimized for mobile and wireless communications. Thus, three key problems still remain to be addressed: header overhead, multiple trigger updates and detection of a close i3 server after handover. The proposed identifier scheme, called local ID, significantly reduces the overhead without sacrificing the flexibility of i3. In a typical case, the local ID makes the total header size nearly half that of the original protocol. This paper also discusses how to adapt the local ID to various types of i3 primitives, so that a mobile host can receive all the benefits of i3 communications.

Two versions of Krylov subspace order reduction techniques for VLSI interconnect reductions, including structure preserving reductions approach and adjoint networks approach, will be comparatively investigated. Also, we will propose a modified structure preserving reduction algorithm to speed up the projection construction in a linear order. The numerical experiment shows the high accuracy and low computational consumption of the modified method. In addition, it will be shown that the projection subspace generated from the structure-preserving approach and those from the adjoint networks approach are equivalent. Therefore, transfer functions of both reduced networks are identical.

The crosstalk phenomenon, wich occurs between transmission lines, is caused by electromagnetic fields of currents flowing through the lines. Crosstalk between two bent lines is studied by using a set of solutions of modified telegrapher's equations. By expressing electromagnetic fields in terms of voltages and currents in the line ends, the resultant network function in the form of an ABCD matrix is obtained. Electromagnetic fields caused by currents flowing in risers at transmission line ends are taken into account in addition to those fields in line sections. The validity of the proposed approach was confirmed by comparing experimental results with computed results and those simulated by a commercial electromagnetic solver for some bent-line models.

Free-space optical communication systems can provide high-speed, improved capacity, cost effective and easy to deploy wireless networks. Experimental investigation on the next generation free-space optical (FSO) communication system utilizing seamless connection of free-space and optical fiber links is presented. A compact antenna which utilizes a miniature fine positioning mirror (FPM) for high-speed beam control and steering is described. The effect of atmospheric turbulence on the beam angle-of-arrival (AOA) fluctuations is shown. The FPM is able to mitigate the power fluctuations at the fiber coupling port caused by this beam angle-of-arrival fluctuations. Experimental results of the FSO system capable of offering stable performance in terms of measured bit-error-rate (BER) showing error free transmission at 2.5 Gbps over extended period of time and improved fiber received power are presented. Also presented are performance results showing stable operation when increasing the FSO communication system data rate from 2.5 Gbps to 10 Gbps as well as WDM experiments.

In this letter, a combined method based on the fractional linear and the fractional bilinear time-frequency representations (TFRs) is proposed. The method combines the windowed fractional short-time Fourier transform with the fractional Wigner distribution (WD) to estimate the instantaneous frequency (IF) of signals in the appropriate fractional time-frequency domain. For a multi-component signal, the method can significantly eliminate the cross terms and improve the time-frequency resolution of the auto-terms. It is applied to the detection and parameter estimation of linear frequency modulated (LFM) signals. The computer simulations clearly demonstrate that the method is effective.

Parallel programs for distributed memory machines are not easy to create and maintain, especially when they involve sparse matrix computations. In this paper, we propose a program translation system for generating parallel sparse matrix computation codes utilizing PSBLAS. The purpose of the development of the system is to offer the user a convenient way to construct parallel sparse code based on PSBLAS. The system is build up on the idea of bridging the gap between the easy-to-read program representations and highly-tuned parallel executables based on existing parallel sparse matrix computation libraries. The system accepts a MATLAB program with annotations and generates subroutines for an SPMD-style parallel program which runs on distributed-memory machines. Experimental results on parallel machines show that the prototype of our system can generate fairly efficient PSBLAS codes for simple applications such as CG and Bi-CGSTAB programs.

The relationship between the topology and collective function of a nonlinear oscillator network was investigated using nonlinear electrochemical oscillators. The constitutive experiments showed that the physiological robustness in the living system is due to their topological redundancy and asymmetry in the nonlinear network.

This paper studies the reduction among cyptographic functions. Our main result is that the prime factoring function IF does not reduce to the certified discrete logarithm function modulo a prime nor its variant with respect to some special reducibility, i.e. the range injection reducibility, under the assumption that the Heath-Brown conjecture is true and IFPF. Since there is no known direct relationship between these functions, this is the first result that could separate these functions. Our approach is based on the notion of the preimage functions.

In the past twenty years, there were only a few constructions for Boolean functions with nonlinearity exceeding the quadratic bound 2n-1-2(n-1)/2 when n is odd (we shall call them Boolean functions with very high nonlinearity). The first basic construction was by Patterson and Wiedemann in 1983, which produced unbalanced function with very high nonlinearity. But for cryptographic applications, we need balanced Boolean functions. Therefore in 1993, Seberry, Zhang and Zheng proposed a secondary construction for balanced functions with very high nonlinearity by taking the direct sum of a modified bent function with the Patterson-Wiedemann function. Later in 2000, Sarkar and Maitra constructed such functions by taking the direct sum of a bent function with a modified Patterson-Wiedemann function. In this paper, we propose a new secondary construction for balanced Boolean functions with very high nonlinearity by recursively composing balanced functions with very high nonlinearity with quadratic functions. This is the first construction for balanced function with very high nonlinearity not based on the direct sum approach. Our construction also have other desirable properties like high algebraic degree and large linear span.

In real-time multimedia processing systems a very large part of the power consumption is due to the data storage and data transfer. Moreover, the area cost is often largely dominated by the memory modules. In deriving an optimized (for area and/or power) memory architecture, memory size computation is an important step in the exploration of the possible algorithmic specifications of multimedia applications. This paper presents a novel non-scalar approach for computing exactly the memory size in real-time multimedia algorithms. This methodology uses both algebraic techniques specific to the data-flow analysis used in modern compilers and, also, more recent advances in the theory of polyhedra. In contrast with all the previous works which are only estimation methods, this approach performs exact memory computations even for applications significantly large in terms of the code size, number of scalars, and number of array references.