We consider a wait-free linearizable implementation of shared objects on a distributed message-passing system. We assume that the system provides each process with a local clock that runs at the same speed as global time and that all message delays are in the range [d-u,d] where d and u (0< u d) are constants known to every process. We present four wait-free linearizable implementations of read/write registers on reliable and unreliable broadcast models. We also present two wait-free linearizable implementations of general objects on a reliable broadcast model. The efficiency of an implementation is measured by the worst-case response time for each operation of the implemented object. Response times of our wait-free implementations of read/write registers on a reliable broadcast model is better than a previously known implementation in which wait-freedom is not taken into account.

Learning process is essential for good performance when a neural network is applied to a practical application. The backpropagation algorithm is a well-known learning method widely used in most neural networks. However, since the backpropagation algorithm is time-consuming, much research have been done to speed up the process. The block backpropagation algorithm, which seems to be more efficient than the backpropagation, is recently proposed by Coetzee in [2]. In this paper, we propose an efficient parallel algorithm for the block backpropagation method and its performance model in mesh-connected parallel computer systems. The proposed algorithm adopts master-slave model for weight broadcasting and data parallelism for computation of weights. In order to validate our performance model, a neural network is implemented for printed character recognition application in the TiME which is a prototype parallel machine consisting of 32 transputers connected in mesh topology. It is shown that speedup by our performance model is very close to that by experiments.

The use of intelligent agents is on the rise, fueled by the unprecedented growth in the Internet and web based applications. Consequently, agent-oriented software is becoming large and complex. To support a systematic development of such software, an agent-oriented software development methodology is necessary. This paper focuses on the modeling phase of agent-oriented software life cycle and, presents an approach for agent modeling consisting of Agent Elicitation, Intra, and Inter Agent modeling methods. Agent Elicitation deals with identifying and extracting agents from "classes" in the real world. Intra Agent Modeling involves expressing agent characteristics - Goal, Belief, Plan and Capability - whereas, Inter Agent modeling incorporates agent mobility and communication in a multi-agent system.

This work presents two novel algorithms to prevent rollback propagation for independent checkpointing: an efficient adaptive independent checkpointing algorithm and an optimized adaptive independent checkpointing algorithm. The last opportunity strategy that yields a better performance than the conservation strategy is also employed to prevent useless checkpoints for both causal rewinding paths and non-causal rewinding paths. The two methods proposed herein are domino effect-free and require only a limited amount of control information. They also take less unnecessary adaptive checkpoints than other algorithms. Furthermore, experimental results indicate that the checkpoint overhead of our techniques is lower than that of the coordinated checkpointing and domino effect-free algorithms for service-providing applications.

This paper presents a pseudo glottal excitation model for the type of linear prediction vocoders with speech being coded at 1.6 kbps. While unvoiced speech and silence intervals are processed with a stochastic codebook of 512 entries, a glottal codebook with 32 entries for voiced excitation is used to describe the glottal phase characteristics. Steps of formulating the pseudo glottal excitation for one pitch period consist of 1) applying a polynomial model to simulate the low-frequency constituent of the residual, 2) inserting a magnitude-adjustable pulse sequence to characterize the main excitation, and 3) introducing turbulent noise in series with the resulting excitation. Procedures are described for codebook construction in addition to analysis and synthesis of the pseudo glottal excitation. Results in a mean opinion score (MOS) test show that the quality produced by the proposed coder is almost as good as that by 4.8 kbps CELP coder for male utterances, but the quality for female utterances is yet somewhat inferior.

The contribution of the paper is two-fold: Firstly, a review of the point set registration literature is given, and secondly, a novel covariance weighted least squares formulation of the multiple view point set registration problem is presented. Point data for surface registration is commonly obtained by non-contact, 3D surface sensors such as scanning laser range finders or structured light systems. Our formulation allows the specification of anisotropic and heteroscedastic (point dependent) 3D noise distributions for each measured point. In contrast, previous algorithms have generally assumed an isotropic sensor noise model, which cannot accurately describe the sensor noise characteristics. For cases where the point measurements are heteroscedastically and anisotropically distributed, registration results obtained with the proposed method show improved accuracy over those produced by an unweighted least squares formulation. Results are presented for both synthetic and real data sets to demonstrate the accuracy and effectiveness of the proposed technique.

In this article, an efficient vector quantization (VQ) scheme called side-match finite-state vector quantization with adaptive block classification is presented for image compression. It makes use of edge information contained in image in additional to the average values of blocks forming the image. In order to achieve low bit rate coding while preserving good quality images, neighboring blocks are utilized to predict the class of current block. Image blocks are mainly classified as edge blocks and non-edge blocks in this coding scheme. To improve the coding efficiency, edge blocks and non-edge blocks are further reclassified into different classes, respectively. Moreover, the number of bits for encoding an image is greatly reduced by foretelling the class of input block and applying small state codebook in corresponding class. The improvement of the proposed coding scheme is attractive as compared with other VQ techniques.

Patterns exist in many contexts and can be considered the useful information for decision making. However, many patterns are not directly visible without careful presentation. Here, we describe an interactive visualization approach for browsing patterns in a history of interacting with a computer system. While a user is carrying out his/her business using computers, activities with respect to time and location are captured to determine the situational interactions. We first integrate the timeline and geographical map to create a structure to visualize spatiotemporal events in the interaction history. The spiral-based interactive visualization technique, presented in this paper, is then used to derive patterns according to the user-specified different spatial viewpoints on the map. In this study, we demonstrate how patterns can be used as visual statements for the analysis of a spatiotemporal data set in the information visualization.

The aim of this study was to quantify the effects of inhomogeneities on magnetocardiography (MCG) forward solutions. It can serve to guide the selection of inhomogeneities to include in any geometric model used to compute magnetocardiographics fields. A numerical model of a human torso was used which construction included geometry for major anatomical structures such as subcutaneous fat, skeletal muscle, lungs, major arteries and veins, and the bones. Simulations were done with a single current dipole placed at different sites of heart. The boundary element method (BEM) was utilized for numerical treatment of magnetic field calculations. Comparisons of the effects of different conductivity on MCG forward solution followed one of two basic schemes: 1) consider the difference between the magnetic fields of the homogeneous torso model and the same model with one inhomogeneity of a single organ or tissue added; 2) consider the difference between the magnetic fields of the full inhomogeneous model and the same model with one inhomogeneity of individual organ or tissue removed. When single inhomogeneities were added to an otherwise homogeneous model, the skeletal muscle, the right lung, the both lungs and the left lung had larger average effects (15.9, 15.1, 14.9, 14.4% relative error (RE), respectively) than the other inhomogeneities tested. When single inhomogeneities were removed from an otherwise full inhomogeneneous model, the both lungs, the left lung, and the skeletal muscle and the right lung had larger effects (17.3, 14.9, 14.3, 14.2% relative error (RE) respectively) than other inhomogeneities tested. The results of this study suggested that accurate representation of tissue inhomogeneity has a significant effect on the accuracy of the MCG forward solution. Our results showed that the inclusion of the boundaries also had effects on the topology of the magnetic fields and on the MCG inverse solution accuracy.

This letter empirically evaluates the way how to calculate the complexity of methods, that is used in the definition of WMC(Weighted Method per Class), one of the Chidamber and Kemerer's metrics. With respect to the results of our experiment, Halstead's Software Science metric is the most appropriate one to evaluate the complexity of the methods.

We gave in [1] the software and hardware algorithms for reconfiguring 1 1/2-track switch 2-D mesh arrays with faults of processing elements, avoiding them. This paper shows an implementation of the hardware algorithm using an FPGA device, and by the logical simulation confirms the correctness of the behavior and evaluates reconfiguration time. From the result it is found that a self-repairable system is realizable and the system is useful for the run-time as well as fabrication-time reconfiguration because it requires no host computer to execute the reconfiguration algorithm and the reconfiguration time is very short.