ppxscal/embedding_network huggingface dataset:
SOM: Dynamic Push-Pull Channel Allocation Framework for Mobile Data Broadcasting
Authors: Jiun-Long Huang Wen-Chih Peng, Ming-Syan Chen
Venue: IEEE Transactions on Mobile Computing (2006)

In a mobile computing environment, the combined use of broadcast and on-demand channels can utilize the bandwidth effectively for data dissemination. We explore in this paper the problem of dynamic data and channel allocation with the number of communication channels and the number of data items given. We first derive the analytical models of the average access time when the data items are requested through the broadcast and on-demand channels. Then, we transform this problem into a guided search problem. In light of the theoretical properties derived, we devise algorithm SOM to obtain the optimal allocation of data and channels. Algorithm SOM is a composite algorithm which will cooperate with 1) a search strategy and 2) a broadcast program generation algorithm. According to the analytical mode, we devise scheme BIS-Incremental on the basis of algorithm SOM, which is able to obtain solutions of high quality efficiently by employing binary interpolation search. In essence, scheme BIS-Incremental is guided to explore the search space with higher likelihood to be the optimal first, thereby leading to an efficient and effective search. It is shown by our simulation results that the solution obtained by scheme BIS-Incremental is of very high quality and is in fact very close to the optimal one. A sensitivity study on several parameters, including the number of data items and the number of communication channels, is conducted. The experimental results show that scheme BIS-Incremental is of very good scalability, which is particularly important for its practical use in a mobile computing environment.
Virtual machines on microprocessor hosts
Authors: Donald S. Higgins
Venue: ACM SIGSMALL Newsletter (1982)

One of the characteristics of a stored program computer is that given sufficient memory, any stored program computer can be programmed to simulate any other stored program computer. With the availability of 64K microprocessor systems which can execute over 1 million instructions per second, it is now feasible and practical to simulate a large mainframe computer using the native micro-processor macro assembler as a vertical microprogramming language (1). This paper describes the results of an experiment using this technique to implement an IBM 370 virtual machine on a Z80 microprocessor host using what is called pseudo microcode (PMC).
Carcara: A Multi-agent System for Web Mining Using Adjustable User Profile and Dynamic Grouping
Authors: Manuel F. Gomes Junior, Anne Magaly Canuto
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper presents Caracará, a system for searching and mining information on the World Wide Web, using adjustable user profiles and a dynamic grouping process. Suggestions for visiting URLs will be made to users, according to the user profiles. Also, the system has a dynamic strategy of suggestions (dynamic grouping), which helps the cooperation among the agents as well as the distribution of information. All the needed information to define the user profile is acquired, in a non-invasive way, through monitoring the user during its use of the system.
Neuro-fuzzy Learning Applied to Improve the Trajectory Reconstruction Problem
Authors: O. Perez, J. Garcia, J. M. Molina
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

This paper presents the application of a neuro-fuzzy learning approach to classify Air Traffic Control (ATC) trajectory segments from recorded opportunity traffic. This method learns a fuzzy system using neuralnetwork theory to determine its parameters (fuzzy sets and fuzzy rules) by processing data samples. The problem is prepared for analysing the Markovchain probabilities estimated by an Interacting Multiple Model (IMM) tracking filter operating forward and backward over available data. The performance of this data-driven classification system is compared with a more conventional approach based on transition detection on simulated and real data of representative situations. The problem's formulation for this application enabled an accurate classification of manoeuvring segments and the derivation of rules that explain the relation between input attributes and motion categories used to describe the recorded data.
Tail equivalence for some time-shared systems
Authors: Smruti Padhy, Arzad Kherani
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

Many of recent studies have proved the tail equivalence result for Egalitarian Processor Sharing system: [EQUATION], where B (resp. V) is service requirement (resp. sojourn time) of a customer; for PS, g = 1 - &rho;. In this paper, we consider time-shared systems in which the server capacity is shared by existing customers in proportion to (dynamic) weights assigned to customers. We consider two systems, 1) in which the weight of a customer depends on it Age (attained service), and 2) in which the weight depends on the residual processing time (RPT). We allow for a parameterized family of weight functions such that the weight associated with a customer that has received a service (or, has a RPT) of x units is &omega;(x) = x&alpha; for some -&infin; < &alpha; < &infin;. We then study the sojourn time of a customer under such scheduling discipline and provide conditions on &alpha; for tail equivalence to hold true, and also give the value of g as a function of &alpha;.
Robust Real-Time Face Pose and Facial Expression Recovery
Authors: Zhiwei Zhu, Qiang Ji
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Face motion is the sum of rigid motion related with face pose and non-rigid motion related with facial expression. Both motions are coupled in the captured image so that they can not be easily recovered from the image directly. In this paper, a novel technique is proposed to recover 3D face pose and facial expression simultaneously from a monocular video sequence in real time. First, twenty-eight salient facial features are detected and tracked robustly under various face orientations and facial expressions. Second, after modelling the coupling between face pose and facial expression in the 2D image as a nonlinear function, a normalized SVD (N-SVD) decomposition technique is proposed to recover the pose and expression parameters analytically. A nonlinear technique is subsequently utilized to refine the solution obtained from the N-SVD technique by imposing the orthonormality constraint on the pose parameters. Compared to the original SVD technique proposed in [1], which is very sensitive to the image noise and numerically unstable in practice, the proposed method can recover the face pose and facial expression robustly and accurately. Finally, the performance of the proposed technique is evaluated in the experiments using both synthetic and real image sequences.
Parallel and Distributed Computing with Java
Authors: Mark A. Baker, Matthew Grove, Aamir Shafi
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

The Java language first came to public attention in 1995. Within a year, it was being speculated that Java may be a good language for parallel and distributed computing. Its core features, including being objected oriented and platform independence, as well as having built-in network support and threads, has encouraged this view. Today, Java is being used in almost every type of computer-based system, ranging from sensor networks to high performance computing platforms, and from enterprise applications through to complex research-based simulations. In this paper the key features that make Java a good language for parallel and distributed computing are first discussed. Two Java-based middleware systems, namely MPJ Express, an MPI-like Java messaging system, and Tycho, a wide-area asynchronous messaging framework with an integrated virtual registry are then discussed. The paper concludes by highlighting the advantages of using Java as middleware to support distributed applications.
Distributed intrusion detection in clusters based on non-interference
Authors: Jacob Zimmermann, George Mohay
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

We present in this paper the investigation of a noninterference-based, policy-based intrusion detection system to detect security policy violations in clusters. The Reference Flow Control model has been proposed as a host-based approach for detecting security policy violations. We extend its design to deal with security policies applicable to cluster or grid applications.To achieve distributed intrusion detection, a host-based Reference Flow Control-based intrusion detection system is deployed on all nodes of a cluster. Messaging between the nodes is instrumented in order to enclose the actual message payloads with a small amount of meta-information used for communication between the local IDSes. Finally, we describe a proof-of-concept implementation on Linux/MPICH.
Recurrence Plot Analysis and its Application to Teleconnection Patterns
Authors: K. Ramirez-Amaro, J. Figueroa-Nazuno
Venue: Proceedings of the 15th International Conference on Computing (2006)

The Recurrence Plot analysis provides us a way to visualize and quantify the dynamical systems behavior over the time. The construction of a Recurrence Plot (RP) from a time series begins with the determination of the trajectory of the system through phase-space. Seven different measures are extracted from the RP. These measures are obtained from diagonal and vertical structures of the RP. Hence, the aim of this article is to find new characteristics underneath the dynamical behavior of Teleconnection Patterns. Those climate patterns are represented as time series. Not only does this method help us to find more characteristics of the system than classical ones, but it also could be used with other phenomena that can be represented as time series.
Connection Migration Mechanisms in a Cluster Environment
Authors: Leila Ismail
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Nowadays, grid applications and web applications introduce significant high availability and scalability challenges to cluster database servers. In this paper, we describe a connection failover mechanism toward building a highly availably infrastructure that is resistant to partial failure. While available solutions concentrate on client transparency, in our work we achieve server transparency as well. We demonstrate that our solution is transparent to clients and servers without compromising the system efficiency. Our mechanisms do involve neither kernel changes nor changes to the server software.
Contextual Analysis of Students' Learning during an Introductory ICT Course in Tanzania
Authors: Mikko Vesisenaho, Erkki Sutinen, Henrik Hautop Lund
Venue: Proceedings of the Fourth IEEE International Workshop on Technology for Education in Developing Countries (2006)

An introductory programming course was developed to teach basics of Information and Communication Technology (ICT) at Tumaini University Iringa University College in Tanzania. The course included concretized and contextualized elements to connect the learning with previous experiences and local environment of the students. The course had 27 second year students in the B.Ed. teacher program in mathematics and computer applications. The course lasted three months and included also practical project work. Learning and application ideas of students on ICT were analyzed from the basis of the CATI (contextualize, apply, transfer, import) model. The method in analyses was content analysis. The results show that most of the learning and application ideas are in application level, only some of the students have been able to apply their skills in contextualized level.
Graph Drawing Tools for Bioinformatics Research: An Overview
Authors: Kay C. Wiese, Christina Eicher
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Much of the data in bioinformatics and data relationships can be represented by graphs. General purpose graph drawing tools are available, but not all are adequate for bioinformatics graphs as these tend to grow quite large. The specific purpose for our research was to investigate the applicability of existing graph drawing tools for visualization of very large phylogenetic trees. In this paper we describe some of the general functions and features that are required for exploring and comparing graphs in bioinformatics. We include a description of a selection of existing tools, to give an overview of the current abilities of graph drawing software and to analyze their advantages and drawbacks in the bioinformatics domain.
Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Venue: ACM International Conference Proceeding Series; Vol. 201 (2006)

Performance evaluation methodologies based on structured Markov chains have taken a more prominent role over the last two decades. During this time, due to the strong exploitation of the involved structures, the techniques used to assess the performance measures of interest have advanced significantly in terms of their efficiency, while becoming more complex at the same time. This increased complexity often acts as an opposing force to a more wide spread use of these advanced methodologies.Making these novel techniques more accessible via a set of software tools is therefore essential to further promote their integration in the system design. SMCtools is the first workshop having as objective the development of software tools for solving structured Markov chains.The proceedings contain 12 papers selected after the reviewing process, and a paper authored by the keynote speaker, Prof. Peter Buchholz from the University of Dortmund.The contributions can be roughly classified into four themes. Some of the papers may be regarded as belonging to more than one theme. A first theme focuses on deriving steady state (or transient) performance measures of finite Markov chains with a very large state space. This is realized either by exploiting the hierarchical structure of the model or by relying on the strong stochastic ordering of Markov chains to derive lower and upper bounds. The keynote contribution given by Peter Buchholz follows the first approach.A second theme contains 6 contributions that are all situated in the matrix analytic paradigm. Four of these papers are very software oriented and describe tools in Java, FORTRAN and MATLAB for analyzing QBD, M/G/1, GI/M/1 and NSF type Markov chains. A Java tool for fitting and generating random numbers from Phase-type distributions is also discussed. The remaining two papers within this theme focus on algorithms and computational issues when analyzing the transient behavior of infinite QBDs and fluid flows.The development of queueing theory has heavily benefited from the advances made in Markov chain theory. Three papers are situated in this area. Two papers address a specific type of queueing problem, that is, a new generalized Schur decomposition method to analyze the GI/GI/1 queue and a novel technique to determine the consecutive loss probabilities in two types of queueing systems, are presented. A third enhances the InterVerdiKom tool with transient analysis features based on Wiener-Hopf and polynomial factorization.A last paper is concerned with the Reversed Compound Agent Theorem (RCAT), mainly useful in Markovian process algebra. It introduces MEERCAT, which implements the RCAT to generate product form solutions.
A Parallel Algorithm by Sampling for the Knapsack Problem Based on MIMD Parallel Computers
Authors: Xiao-Ling Liu, Shou-Ping Gao, De-Liang Gong, Ken-Li Li
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The knapsack problem is a famous NP-complete problem. It is very important in the research on cryptosystem and number theory. After its proposed parallel algorithms are analyzed deeply, a new parallel algorithm by sampling is proposed based on MIMD supercomputers in the paper. Then performance analysis and comparisons are illuminated. Finally the experimental results of the knapsack instances randomly generated on IBM P690 supercomputer are given. The results show: the parallel efficiency can be over 60% when solving the larger scale knapsack instances (n \geqslant 40 ). Thus it is proved that the proposed parallel algorithm for the knapsack problem is feasible and efficient on MIMD scalable supercomputers.
Development and evaluation of a micro-macro algorithm for the simulation of polymer flow
Authors: Kathleen Feigl, Franz X. Tanner
Venue: Journal of Computational Physics (2006)

A micro-macro algorithm for the calculation of polymer flow is developed and numerically evalutated. The system being solved consists of the momentum and mass conservation equations from continuum mechanics coupled with a microscopic-based rheological model for polymer stress. Standard finite element techniques are used to solve the conservation equations for velocity and pressure, while stochastic simulation techniques are used to compute polymer stress from the simulated polymer dynamics in the rheological model. The rheological model considered combines aspects of reptation, network and continuum models. Two types of spatial approximation are considered for the configuration fields defining the dynamics in the model: piecewise constant and piecewise linear. The micro-macro algorithm is evaluated by simulating the abrupt planar die entry flow of a polyisobutylene solution described in the literature. The computed velocity and stress fields are found to be essentially independent of mesh size and ensemble size, while there is some dependence of the results on the order of spatial approximation to the configuration fields close to the die entry. Comparison with experimental data shows that the piecewise linear approximation leads to better predictions of the centerline first normal stress difference. Finally, the computational time associated with the piecewise constant spatial approximation is found to be about 2.5 times lower than that associated with the piecewise linear approximation. This is the result of the more efficient time integration scheme that is possible with the former type of approximation due to the pointwise incompressibility guaranteed by the choice of velocity-pressure finite element.
Energy-Efficient Real-Time Task Scheduling for a DVS System with a Non-DVS Processing Element
Authors: Chia-Mei Hung, Jian-Jia Chen, Tei-Wei Kuo
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Multiple processing elements are often adopted in the current designs of embedded systems. Such configurations impose challenges on hardware/software co-designs with energy-efficient considerations. This paper targets energy-efficient real-time task scheduling of such popular configurations, in which systems are equipped with a DVS processor and a non-DVS processing element (PE). We consider task scheduling under different power consumption models of the non-DVS PE. When the power consumption of the non-DVS PE is independent on the assigned workload, a fully polynomial-time approximation scheme is developed for energy-efficient scheduling. When the energy consumption of the non-DVS PE depends on the assigned workload, a 0.5-approximation algorithm is developed to maximize the energy saving, compared to the execution of tasks on a DVS processor. Extensive simulations were performed to evaluate the capability of our proposed algorithms. The results show that our algorithms are very effective in energy-efficiency.
Error Analysis of Robust Optical Flow Estimation by Least Median of Squares Methods for the Varying Illumination Model
Authors: Yeon-Ho Kim, Avinash C. Kak
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

The apparent pixel motion in an image sequence, called optical flow, is a useful primitive for automatic scene analysis and various other applications of computer vision. In general, however, the optical flow estimation suffers from two significant problems: the problem of illumination that varies with time and the problem of motion discontinuities induced by objects moving with respect to either other objects or with respect to the background. Various integrated approaches for solving these two problems simultaneously have been proposed. Of these, those that are based on the LMedS (Least Median of Squares) appear to be the most robust. The goal of this paper is to carry out an error analysis of two different LMedS-based approaches, one based on the standard LMedS regression and the other using a modification thereof as proposed by us recently. While it is to be expected that the estimation accuracy of any approach would decrease with increasing levels of noise, for LMedS-like methods, it is not always clear as to how much of that decrease in performance can be attributed to the fact that only a small number of randomly selected samples is used for forming temporary solutions. To answer this question, our study here includes a baseline implementation in which all of the image data is used for forming motion estimates. We then compare the estimation errors of the two LMedS-based methods with the baseline implementation. Our error analysis demonstrates that, for the case of Gaussian noise, our modified LMedS approach yields better estimates at moderate levels of noise, but is outperformed by the standard LMedS method as the level of noise increases. For the case of salt-and-pepper noise, the modified LMedS method consistently performs better than the standard LMedS method.
Visual Enhancing of Tactile Perception in the Posterior Parietal Cortex
Authors: Tony Ro, Ruth Wallace, Judith Hagedorn, Alessandro Farnè, Elizabeth Pienkos
Venue: Journal of Cognitive Neuroscience (2004)

The visual modality typically dominates over our other senses. Here we show that after inducing an extreme conflict in the left hand between vision of touch (present) and the feeling of touch (absent), sensitivity to touch increases for several minutes after the conflict. Transcranial magnetic stimulation of the posterior parietal cortex after this conflict not only eliminated the enduring visual enhancement of touch, but also impaired normal tactile perception. This latter finding demonstrates a direct role of the parietal lobe in modulating tactile perception as a result of the conflict between these senses. These results provide evidence for visual-to-tactile perceptual modulation and demonstrate effects of illusory vision of touch on touch perception through a long-lasting modulatory process in the posterior parietal cortex.
Externally verifiable code execution
Authors: Arvind Seshadri, Mark Luk, Adrian Perrig, Leendert van Doorn, Pradeep Khosla
Venue: Communications of the ACM (2006)

Using hardware- and software-based techniques to realize a primitive for externally verifiable code execution.