ppxscal/embedding_network huggingface dataset:
Distributed Neural Network Routing Algorithm Based on Global Information of Wireless Sensor Network
Authors: Wenhui Zhao, Daxin Liu, Yu Jiang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

A new energy-efficient wireless sensor network routing algorithm is proposed. The algorithm obtains optimization routing paths using global information of wireless sensor network. And the optimizing process can be reproduced in distribution by constructing a neural network for each node. Simulation results show the algorithm can accomplish routing process correctly and rapidly, and increase network lifetime evidently.
Investigation of the global dynamics of cellular automata using Boolean derivatives
Authors: Pabitra Pal Choudhury, Sudhakar Sahoo, Mithun Chakraborty, Subir Kumar Bhandari, Amita Pal
Venue: Computers Mathematics with Applications (2009)

Global dynamics of a non-linear Cellular Automaton (CA), is, in general irregular, asymmetric and unpredictable as opposed to that of a linear CA, which is highly systematic and tractable. In this paper, efforts have been made to systematize non-linear CA evolutions in the light of Boolean derivatives and Jacobian matrices. A few new theorems on Hamming Distance between Boolean functions as well as on Jacobian matrices of cellular automata are proposed and proved. Moreover, a classification of Boolean functions based on the nature of deviation from linearity has been suggested with a view to grouping them together to classes/subclasses such that the members of a class/subclass satisfy certain similar properties. Next, an error vector, which cannot be captured by the Jacobian matrix, is identified and systematically classified. This leads us to the concept of modified Jacobian matrix whereby a quasi-affine representation of a non-linear cellular automaton is introduced.
BLAST Distributed Execution on Partitioned Databases with Primary Fragments
Authors: Daniel Xavier Sousa, Sergio Lifschitz, Patrick Valduriez
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

BLAST is one of the most popular computational biology tools. The execution cost of BLAST is highly dependent on database sizes, which have considerably increased following all recent advances in sequencing methods. The evaluation of BLAST in distributed and parallel environments like PC clusters and Grids has been largely investigated in order to obtain better performances. This work evaluates a replicated allocation of the (sequences) database, where each copy is also physically fragmented. We investigate two dynamic workload balancing methods that focus on our database allocation strategy. Preliminary practical results show that we achieve both a balanced workload and very good performances. We briefly discuss ideas that would make our approach feasible for Grid computational environments.
On the Parametrization of Clapping
Authors: Herwin Welbergen, Zsófia Ruttkay
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

For a Reactive Virtual Trainer(RVT), subtle timing and lifelikeness of motion is of primary importance. To allow for reactivity, movement adaptation, like a change of tempo, is necessary. In this paper we investigate the relation between movement tempo, its synchronization to verbal counting, time distribution, amplitude, and left-right symmetry of a clapping movement. We analyze motion capture data of two subjects performing a clapping exercise, both freely and timed by a metronome.Our findings are compared to results from existing gesture research and existing biomechanical models. We found that, for our subjects, verbal counting adheres to the phonological synchrony rule. A linear relationship between the movement path length and the tempo was found. The symmetry between the left and the right hand can be described by the biomechanical model of two coupled oscillators.
Learning element similarity matrix for semi-structured document analysis
Authors: Jianwu Yang, William K. Cheung, Xiaoou Chen
Venue: Knowledge and Information Systems (2009)

Capturing latent structural and semantic properties in semi-structured documents (e.g., XML documents) is crucial for improving the performance of related document analysis tasks. Structured Link Vector Mode (SLVM) is a representation recently proposed for modeling semi-structured documents. It uses an element similarity matrix to capture the latent relationships between XML elements&#x2014;the constructing components of an XML document. In this paper, instead of applying heuristics to define the element similarity matrix, we propose to compute the matrix using the machine learning approach. In addition, we incorporate term semantics into SLVM using latent semantic indexing to enhance the model accuracy, with the element similarity learnability property preserved. For performance evaluation, we applied the similarity learning to k-nearest neighbors search and similarity-based clustering, and tested the performance using two different XML document collections. The SLVM obtained via learning was found to outperform significantly the conventional Vector Space Model and the edit-distance-based methods. Also, the similarity matrix, obtained as a by-product, can provide higher-level knowledge on the semantic relationships between the XML elements.
Dynamic Architectures For Soa-Based Applications
Authors: W. T. Tsai, Raymond A. Paul, Chun Fan, Xiao Wei
Venue: Journal of Integrated Design Process Science (2007)

The architecture of SOA-based applications is different from traditional software architecture where the architecture is mainly static. The architecture of an SOA-based application is dynamic, i.e., the application may be composed at runtime using existing services. Thus SOA has provided a new direction for software architecture study, where the architecture is determined at runtime and the architecture can be dynamically changed at runtime to meet the new software requirements. This paper proposes an architecture classification scheme for SOA-based applications. Using this classification, several wellknown SOA-based applications are reviewed including the architectures proposed and adopted by major computer companies and standard organizations. The architecture classification provides a unified way to evaluate a variety of architectures for SOA-based applications.
Finding locally optimum force-closure grasps
Authors: Máximo A. Roa, Raúl Suárez
Venue: Robotics and Computer-Integrated Manufacturing (2009)

This paper presents an iterative procedure to find locally optimum force-closure grasps on 3D objects, with or without friction and with any number of fingers. The object surface is discretized in a cloud of points, so the approach is applicable to objects with any arbitrary shape. The approach finds an initial force-closure grasp that is then iteratively improved through an oriented search procedure. The grasp quality is measured considering the largest perturbation wrench that the grasp can resist with independence of the direction of perturbation. The efficiency of the algorithm is illustrated through numerical examples.
I just don't know why it's gone: maintaining informal information use in inpatient care
Authors: Xiaomu Zhou, Mark S. Ackerman, Kai Zheng
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We conducted a field-based study examining informal nursing information. We examined the use of this information before and after the adoption of a CPOE (Computerized Provider Order Entry) system in an inpatient unit of a large teaching hospital. Before CPOE adoption, nurses used paper working documents to detail psycho-social information about patients; after the CPOE adoption, they did not use paper or digital notes as was planned. The paper describes this process and analyses how several interlocked reasons contributed to the loss of this information in written form. We found that a change in physical location, sufficient convenience, visibility of the information, and permanency of information account for some, but not all, of the outcome. As well, we found that computerization of the nursing data led to a shift in the politics of the information itself - the nurses no longer had a cohesive agreement about the kinds of data to enter into the system. The findings address the requirements of healthcare computerization to support both formal and informal work practices, respecting the nature of nursing work and the politics of information inherent in complex medical work.
Pulse propagation analysis in optical fibers by 3D FDTD method
Authors: Juan Juan Hu, Ping Shum, Chao Lu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, we investigate the pulse propagation in optical fibers using a three dimensional finite difference time domain method. The analysis agrees well with analytical method.
Letters: A biased minimax probability machine-based scheme for relevance feedback in image retrieval
Authors: Xiang Peng, Irwin King
Venue: Neurocomputing (2009)

In recent years, minimax probability machines (MPMs) have demonstrated excellent performance in a variety of pattern recognition problems. At the same time various machine learning methods have been applied on relevance feedback tasks in content-based image retrieval (CBIR). One of the problems in typical techniques for relevance feedback is that they treat the relevant feedback and irrelevant feedback equally. Since the negative instances largely outnumber the positive instances, the assumption that they are balanced is incorrect as the data are biased. In this paper we study how biased minimax probability machine (BMPM), a variation of MPM, can be applied for relevance feedback in image retrieval tasks. Different from previous methods, this model directly controls the accuracy of classification of the future data to construct biased classifiers. Hence, it provides a rigorous treatment on imbalanced dataset. Mathematical formulation and explanations are provided to demonstrate the advantages. Experiments are conducted to evaluate the performance of our proposed framework, in which encouraging and promising experimental results are obtained.
User behaviors toward mobile data services: The role of perceived fee and prior experience
Authors: Byoungsoo Kim, Minnseok Choi, Ingoo Han
Venue: Expert Systems with Applications: An International Journal (2009)

Rapid advancements in information and communication technologies (ICT) have allowed people some opportunities to access digitalized contents without restrictions in time or place. Mobile data service (MDS) is an important emerging ICT, thus many studies on information systems (IS) and marketing examine key predictors of MDS user behaviors. However, although the usage-based pricing of MDS is considered as a unique feature, most studies on MDS have paid little attention to its influences on MDS user behaviors. This study proposes a theoretical framework integrating perceived fee into Van der Heijden's model to understand the role of perceived fee in wireless pay-per-use services. To capture the moderating effect of prior experience, this study also investigates the differences in determinants for the adoption decision stages and the continued usage decision stages. The proposed model is empirically tested by using survey data collected from 149 inexperienced users and 393 experienced users. The findings indicate that, compared with traditional IS such as a corporate IS and a website, perceived fee explains a large portion of the variances in adoption intention and continued usage intention toward MDS. This study also reveals that the antecedents leading to MDS user behavior vary in terms of prior experience. Finally, theoretical and practical implications of this study are described.
Emulation in manufacturing engineering processes
Authors: Hironori Hibino, Yoshiro Fukuda
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

In our research, the manufacturing system emulation technology is proposed as one of the frontloading methods in the manufacturing system implementation phase. In this paper, the roles of the manufacturing system emulation technology in manufacturing engineering processes are summarized based on our analysis for the typical manufacturing engineering processes. The manufacturing system emulation environment (MSEE) to implement the manufacturing system emulation is proposed and developed. MSEE consists of our developed manufacturing cell emulator, our developed soft-wiring system, and the industrial network middleware which is one of the semi-standard middlewares. The validation of our proposed environment was carried out through a case study.
Adaptive multi-scale AMSS operator for quality detection of silks
Authors: Hui Cai, Jinhui Cai, Guangxin Zhang, Zekui Zhou
Venue: International Journal of Computer Mathematics (2009)

In order to de-noise the silk images corrupted by various noises, a new improved filter based on affine morphological scale space (AMSS) equation was proposed. In this new operator both the adaptive idea and scale space were fused into partial differential equations. Scale parameters were changed adaptively according to the presence or absence of noise in image which was detected by directional gradient operators with four templates. A new evaluating criterion was constructed to test the performance of the improved AMSS operators. Two parameters based on mean square error and minimum absolute error could be acquired to evaluate the effect of keeping edge information and the ability of smoothing noise. Experimental results illustrate that this improved operator can efficiently keep edge information, and the de-noising performance is more effective than other methods for the image with multi-noise.
Server Side "Compresslets" for Internet Multimedia Streams
Authors: Holger Bonisch, Konrad Froitzheim
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

We introduce a new concept of a server-based architecture for continuos media streams, e.g. audio and video. This server architecture provides highly flexible, scalable media streaming for Internet applications. One of it's key features is the client driven stream encoding and stream composition process. The client applies server side applets that control the encoding components for the various steps of the data compression pipeline. We therefore call these server side applets 'compresslets'. In general, a compresslet will be uploaded from the client to the server for a dedicated client-server connection and will then control the flow of media data from the server to the client. Compresslet functionality can be combined with existing compression components residing in the server. Generic or often used components are retrieved from the server component repository while compresslet-specific functionality is uploaded into the server similar to the compresslet and executed there.
Enabling the adoption of aspects - testing aspects: a risk model, fault model and patterns
Authors: Nikhil Kumar, Dinakar Sosale, Sadhana Nivedita Konuganti, Ajay Rathi
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

Aspect oriented programming (AOP) has started to achieve industry adoption for custom programs and some adoption in frameworks such as the Spring framework. Aspect oriented programming provides many benefits -- it can increase the scope of concerns that can be captured cleanly, it has explicit language support, and the separation provided by AOP provides an elegant mechanism for custom solutions. In this paper we present a model for AOP testing. This includes a model for risk assessment, an associated fault model and AOP testing patterns. We also propose further opportunities for research in the area for automated AOP risk assessment and testing. At ApTSi™ (Applied Technology Solutions, Inc.) we have been applying AOP in the creation of our SOASense™ framework, and in our consulting engagements. We are seeing adoption typically in classical AOP areas such as Logging, Error Handling, Audit events, etc. In these scenarios, having a reliable AOP implementation is critical. For example, having an Audit event not occur for a service call due to a faulty join-point definition can have severe legal implications. We need a solution that provides reliability, is repeatable and enables us to assess risk.
Matchmaker, matchmaker
Authors: David Essex
Venue: Communications of the ACM (2009)

Computational advertising seeks to place the best ad in the best context before the right customer.
On hierarchical traffic grooming in WDM networks
Authors: Bensong Chen, George N. Rouskas, Rudra Dutta
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any but trivial network topologies. In this work, we present an effective and efficient hierarchical traffic grooming framework for WDM networks of general topology, with the objective of minimizing the total number of electronic ports. At the first level of hierarchy, we decompose the network into clusters and designate one node in each cluster as the hub for grooming traffic. At the second level, the hubs form another cluster for grooming intercluster traffic. We view each (first-or second-level) cluster as a virtual star, and we present an efficient near-optimal algorithm for determining the logical topology of lightpaths to carry the traffic within each cluster. Routing and wavelength assignment is then performed directly on the underlying physical topology. We demonstrate the effectiveness of our approach by applying it to two networks of realistic size, a 32-node, 53-link topology and a 47-node, 96-link network. Comparisons to lower bounds indicate that hierarchical grooming is efficient in its use of the network resources of interest, namely, electronic ports and wavelengths. In addition to scaling to large network sizes, our hierarchical approach also facilitates the control and management of multigranular networks.
Color image segmentation using adaptive mean shift and statistical model-based methods
Authors: Jong Hyun Park, Guee Sang Lee, Soon Young Park
Venue: Computers Mathematics with Applications (2009)

In this paper, we propose an unsupervised segmentation algorithm for color images based on Gaussian mixture models (GMMs). The number of mixture components is determined automatically by adaptive mean shift, in which local clusters are estimated by repeatedly searching for higher density points in feature vector space. For the estimation of parameters of GMMs, the mean field annealing expectation-maximization (EM) is employed. The mean field annealing EM provides a global optimal solution to overcome the local maxima problem in a mixture model. By combining the adaptive mean shift and the mean field annealing EM, natural color images are segmented automatically without over-segmentation or isolated regions. The experiments show that the proposed algorithm can produce satisfactory segmentation without any a priori information.
Domain-driven discovery of stable abstractions for pointcut interfaces
Authors: Dimitri Van Landuyt, Steven Op de beeck, Eddy Truyen, Wouter Joosen
Venue: Proceedings of the 8th ACM international conference on Aspect-oriented software development (2009)

The benefits of defining explicit pointcut interfaces in aspect-oriented applications have been advocated by many. A pointcut interface exposes a set of crosscutting abstract behaviours (as named pointcut signatures) that multiple aspects in the application can use. In accordance with the dependency inversion and stable dependencies principles, a pointcut interface should expose only stable abstractions in order to maximally promote its reuse across a family of applications. In this paper, we propose a domain-driven architecture method for designing such stable pointcut interfaces. The method employs systematic reengineering of use case models to discover stable abstractions that are anchored in the domain model of the application. During architecture design, these stable domain abstractions are mapped to pointcut interfaces. As part of this mapping activity, the architecture is constrained to ensure that the pointcut interfaces can be implemented correctly. We have applied this method in two applications, where we validate that pointcut interfaces can be reused for implementing the composition logic of different aspects without requiring modification to their pointcut signatures. Moreover, the method consistently yields pointcut interface hierarchies.
On line wavelets transform on a Xilinx FPGA circuit to medical images compression
Authors: H. Bessalah, F. Alim, S. Seddiki, M. Issad, M. Bencherif, O. Daoud
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Knowing that, the computing process of the S. Mallat Transform algorithm is characterized by a purely sequential structure, and from the fact, the on line mode arithmetic is more suitable for the computation of this kind of operations. We propose in this paper, a new wavelet Transform algorithm and a suitable architecture implemented on a Xilinx FPGA circuit. In this study, we will show how on line arithmetic is used to implement a pipelined architecture of the S.Mallat Transform and we will demonstrate through different implementations under different medical image and different computation mode that it might be used successfully for medical image compression.
Design Issues and Performance Analysis of Location-Aided Hierarchical Cluster Routing on the MANET
Authors: Shin-Jer Yang, Hao-Cyun Chou
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

MANET (Mobile Ad-hoc Network) is a type of dynamic configuration wireless ad-hoc network that does not require the basic internet construction. Clustering of devices in MANET could reduce overhead, flooding and collision in communication and make the network topology more stable. Cluster Heads (CHs) are determined dynamically and in charge of the routing of the cluster. Frequent search of CH nodes would lower the efficiency of network. Many clustering algorithms used in searching CH nodes only consider the hop counts. However, the hop numbers do not demonstrate the exact distance between two CH nodes. Therefore, the Location Aided Hierarchical Cluster Routing (LHCR), a more suitable way for mobile ad-hoc network routing is proposed. The LHCR method arranges the nodes in the networks into hierarchical clusters by the amount and position of the data. Thereby, it avoids the nodes that are far away from each other being assigned to the same cluster, and at the same time taking the CH nodes' power amount into consideration to avoid over-transformation. Routing is taken care of by the highest level of the nodes in each cluster. Simulation results indicate that the LHCR is more efficient and effective than ZRP and AODV in larger networks.