The performance of parallel computing applications is highly dependent on the efficiency of the underlying communication operations. While often characterized as dynamic, these communication operations frequently exhibit spatial and temporal locality as well as regularity in structure. These characteristics can be exploited to improve communication performance if the correct prediction model is selected to a suitable communication topology. In this paper we describe an entropy based methodology for quantifying and evaluating the success of different prediction models on actual workloads drawn from representative parallel benchmarks. We evaluate two different prediction criteria and combinations thereof: (1) Messages are partitioned by source node. (2) Use of a first order context model. We also describe the threshold for predication designed to largely avoid incorrect predication overheads. Our results show for simple predication models, even on highly dynamic benchmark applications, predictability can be improved by several orders of magnitude. In fact, using simple prediction techniques, over 75% of the communication volume is accurately predictable.

We report on the design and experimental results of a fix-tuned Superconductor-Insulator-Superconductor (SIS) mixer for Atacama Large Millimeter/submillimeter Array (ALMA) band 8 (385-500 GHz) receivers. Nb-based SIS junctions of a current density of 10 kA/cm2 and one micrometer size (fabricated with a two-step lift-off process) are employed to accomplish the ALMA receiver specification, which requires wide frequency coverage as well as low noise temperature. A parallel-connected twin-junction (PCTJ) is designed to resonate at the band center to tune out the junction geometric capacitance. A waveguide-microstrip probe is optimized to have nearly frequency-independent impedance at the probe's feed point, thereby making it easy to match the low-impedance PCTJ over a wide frequency band. The RF embedding impedance is retrieved by fitting the measured pumped I-V curves to confirm good matching between PCTJ and signal source. We demonstrate here a minimum double-sideband receiver noise temperature of 3 times of quantum limits for an intermediate-frequency range of 4-8 GHz. The mixers were measured in band 8 cartridge with a sideband separation scheme. Single-sideband receiver noise below ALMA specification was achieved over the whole band.

The concept of grid computing emerged with the appearance of high-speed network. Effective grid worker (i.e., computing resource) selection mechanism is important to achieve reliable grid computing system since each worker participate in grid computing is heterogeneous. In this paper, we suggest a credible worker selection mechanism that maximizes grid computing performance by allocating appropriate tasks to each grid worker. Diverse workers can be used efficiently by grid applications through the ranking process of worker's credibility. Initially, the rank of each grid worker's credibility is decided considering static information only such as CPU speed, RAM size, storage capacity and network bandwidth. And then, the rank is refined by using dynamic information such as failure rate, turn around time provided after the task is completed, and correctness of the return value. In the experiments, we find that the proposed mechanism provides improved grid computing performance with high credibility.

The present paper introduces an improved construction of a class of binary sequences having a zero-correlation zone (hereafter binary ZCZ sequence set). The cross-correlation function and the side-lobe of the auto-correlation function of the proposed sequence set is zero for the phase shifts within the zero-correlation zone. The present paper shows that such a construction generates a binary ZCZ sequence set from an arbitrary M-sequence. The previously reported sequence construction of binary ZCZ sequence sets from an M-sequence can generate a single series of binary ZCZ sequence sets from an M-sequence. The present paper proposes an improved sequence construction that can generate more than one series of binary ZCZ sequence sets from an M-sequence.

In this letter, my proposals for a Floating node voltage-controlled Variable Resistor circuit (FVR) are based upon its advantages as linear and compact. The performance of the proposed circuit was confirmed by PSpice simulation. The simulation results are reported in this letter.

We consider a network, where a special data called certificate is issued between two users, and all certificates issued by the users in the network can be represented by a directed graph. For any two users u and v, when u needs to send a message to v securely, v's public-key is needed. The user u can obtain v's public-key using the certificates stored in u and v. We need to disperse the certificates to the users such that when a user wants to send a message to the other user securely, there are enough certificates in them to get the reliable public-key. In this paper, when a certificate graph and a set of communication requests are given, we consider the problem to disperse the certificates among the nodes in the network, such that the communication requests are satisfied and the total number of certificates stored in the nodes is minimized. We formulate this problem as MINIMUM CERTIFICATE DISPERSAL (MCD for short). We show that MCD is NP-Complete, even if its input graph is restricted to a strongly connected graph. We also present a polynomial-time 2-approximation algorithm MinPivot for strongly connected graphs, when the communication requests satisfy some restrictions. We introduce some graph classes for which MinPivot can compute optimal dispersals, such as trees, rings, and some Cartesian products of graphs.

The belief propagation (BP) algorithm is a tool with which one can calculate beliefs, marginal probabilities, of probabilistic networks without loops (e.g., Bayesian networks) in a time proportional to the number of nodes. For networks with loops, it may not converge and, even if it converges, beliefs may not be equal to exact marginal probabilities although its application is known to give remarkably good results such as in the coding theory. Tatikonda and Jordan show a theoretical result on the convergence of the algorithm for probabilistic networks with loops in terms of the theory of Markov random fields on trees and give a sufficient condition of the convergence of the algorithm. In this paper, we discuss the "impatient" update rule as well as the "lazy" update rule discussed in Tatikonda and Jordan. In the viewpoint of the theory of Markov random fields, it is shown that the rule for updating both gives essentially the same results and the impatient update rule is expected to converge faster than the lazy one. Numerical experiments are also given.

This paper describes a high-speed MT connector assembly method. This technique uses adhesive with a short hardening time, is highly reliable and does not require a polishing process, thus reducing the connector assembly time. First, we investigated an alpha-cyanoacrylate adhesive that hardens quickly and whose adhesive strength does not decrease under high humidity and high temperature conditions, thus ensuring its excellent reliability for outside use. In addition, we investigated variations in the position of the fiber endface on the ferrule endface with a view to obtaining a low insertion loss. Based on the results, we assembled an MT connector using our proposed high-speed assembly method. We confirmed that the assembly time could be reduced to less than 70% of the time required with the conventional method. MT connectors assembled using this technique have a low insertion loss and stable environmental characteristics.

At Eurocrypt '02, Cramer and Shoup [1] proposed a general paradigm to construct practical public-key encryption schemes secure against the adaptive chosen ciphertext attack as well as several concrete examples. One of these example is the scheme based on the quadratic residuosity (QR) problem. However this scheme is less efficient than the other examples. In this paper, we construct a new variant of the Cramer-Shoup encryption scheme which is related to the QR problem. Our variant is more efficient than the scheme based on the QR problem.

Image segmentation denotes a process by which an image is partitioned into non-intersecting regions and each region is homogeneous. Utilizing histogram information to aim at segmenting an image is a commonly used method for many applications. In this paper, we view the image segmentation as an optimization problem. We find a curve which gives the best fit to the given image histogram, and the parameters in the curve are determined by using the particle swarm optimization algorithm. The experimental results to confirm the proposed approach are also included.

In this paper, we propose a construction method of three-dimensional deformable models that represent tree-shaped human organs, such as bronchial tubes, based on results obtained by statistically analyzing the distributions of bifurcation points in the tree-shaped organs. The models are made to be used as standard templates of tree-shaped organs in medical image recognition, and are formed by control points that can be uniquely identified as structural elements of organs such as bifurcation tracheae in bronchial tubes. They can be transfigured based on the statistical validity of relationships between the control points. The optimal state of that transfiguration is determined within the framework of energy minimization. Experimental results from bronchial tubes are shown on actual CT images.

We develop several tools to derive quadratic equations from algebraic S-boxes and to prove their linear independence. By applying them to all known almost perfect nonlinear (APN) power functions and the inverse function, we can estimate the resistance against algebraic attacks. As a result, we can show that APN functions have different resistance against algebraic attacks, and especially S-boxes with Gold or Kasami exponents have very weak resistance.

This paper presents new algorithms for the Tate pairing on a prime field. Recently, many pairing-based cryptographic schemes have been proposed. However, computing pairings incurs a high computational cost and represents the bottleneck to using pairings in actual protocols. This paper shows that the proposed algorithms reduce the cost of multiplication and inversion on an extension field, and reduce the number of calculations of the extended finite field. This paper also discusses the optimal algorithm to be used for each pairing parameter and shows that the total computational cost is reduced by 50% if k = 6 and 57% if k = 8.

Management of applications in the new world of pervasive computing requires new mechanisms to be developed for admission control, QoS negotiation, allocation and scheduling. To solve such resource-allocation and QoS provisioning problems within pervasive and ubiquitous computational environments, distribution and decomposition of the computation are important. In this paper we present a QoS-based welfare economic resource management model that models the actual price-formation process of an economy. We compare our economy-based approach with a mathematical approach we previously proposed. We use the constructs of application benefit functions and resource demand functions to represent the system configuration and to solve the resource allocation problems. Finally empirical studies are conducted to evaluate the performance of our proposed pricing model and to compare it with other approaches such as priority-based scheme and greedy method.

Machine learning and data mining algorithms are increasingly being used in the intrusion detection systems (IDS), but their performances are laggard to some extent especially applied in network based intrusion detection: the larger load of network traffic monitoring requires more efficient algorithm in practice. In this paper, we propose and design an anomaly intrusion detection (AID) system based on the vector quantization (VQ) which is widely used for data compression and high-dimension multimedia data index. The design procedure optimizes the performance of intrusion detection by jointly accounting for accurate usage profile modeling by the VQ codebook and fast similarity measures between feature vectors to reduce the computational cost. The former is just the key of getting high detection rate and the later is the footstone of guaranteeing efficiency and real-time style of intrusion detection. Experiment comparisons to other related researches show that the performance of intrusion detection is improved greatly.

In this paper, we propose a method of detecting TCP performance degradation using only bottleneck-link utilization statistics: mean and variance. The variance of link utilization normally increases as the mean link-utilization increases. However, because link-utilization has a maximum of 100%, as the mean approaches 100%, the possible range of fluctuation becomes narrow and the variance decreases to zero. In this paper, using the M/G/R processor sharing model, we relate this phenomenon to the behavior of flows. We also show that by using this relationship, we can detect TCP performance degradation using the mean and variance of link utilization. In particular, this method enables a network operator to determine whether or not the degradation originates from the congestion of his/her own network. Because our method requires us to measure only link utilization, the cost of performance management can be greatly decreased compared with the conventional method, which requires dedicated functions for directly measuring the TCP performance.

With the increase of commercial multimedia applications using digital video, the security of video data becomes more and more important. Although several techniques have been proposed in order to protect these video data, they provide limited security or introduce significant overhead. This paper proposes a video security scheme for MPEG video compression standard, which includes two methods: DCEA (DC Coefficient Encryption Algorithm) and "Event Shuffle." DCEA is aim to encrypt group of codewords of DC coefficients. The feature of this method is the usage of data permutation to scatter the ciphertexts of additional codes in DC codewords. These additional codes are encrypted by block cipher previously. With the combination of these algorithms, the method provides enough security for important DC component of MPEG video data. "Event Shuffle" is aim to encrypt the AC coefficients. The prominent feature of this method is a shuffling of AC events generated after DCT transformation and quantization stages. Experimental results show that these methods introduce no bit overhead to MPEG bit stream while achieving low processing overhead to MPEG codec.

In this paper, we propose a method to solve the distributed optimal power flow problem and discuss the associated implementation. We have combined this method with a projected Jacobi (PJ) method and a modified parallel block scaled gradient (MPBSG) method possessing decomposition effects. With the decomposition, our method can be parallel processed and is computationally efficient. We have tested our method for distributed OPF problems on numerous power systems. As seen from the simulation results, our method achieved a dramatic speed-up ratio compared with the commercial IMSL subroutines.

An effective access control scheme in CDMA networks is proposed to provide multimedia services. The proposed scheme controls the access of multimedia traffic using the delay of data traffic and the transmission rate control of video traffic. Numerical results show that throughput and delay are improved by allowing delay of data traffic under low and medium traffic conditions, and by decreasing the transmission rate of video traffic under heavy traffic conditions.

The system under study is a convolutionally coded and orthogonally modulated DS-CDMA system over time-varying frequency-selective Rayleigh fading channels in multiuser environments. Iterative soft demodulation and decoding using the Turbo principle can be applied to such a system to increase the system capacity and performance. To combat multiple access interference (MAI), we incorporate the interference cancellation (IC) and decision-directed channel estimation (CE) in the demodulator. However, both IC and CE are subject to performance degradation due to incorrect decisions. In order to prevent error propagation from the decision feedback, soft interference cancellation and channel estimation assisted demodulation is proposed in this paper. The performance of this strategy is evaluated numerically and proved to be superior to the hard decision-directed approach with a minor increase in complexity.