ppxscal/embedding_network huggingface dataset:
Fast Reconfigurable Hardware for the M-ary Modular Exponentiation
Authors: Luiza de Macedo Mourelle, Nadia Nedjah
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Modular exponentiation is a cornerstone operation to several public-key cryptosystems. It is performed using successive modular multiplications. This operation is time consuming for large operands, which is always the case in cryptography. For software or hardware fast cryptosystems, one needs thus to reduce the total number of modular multiplication required. Existing methods attempt to reduce this number by partitioning the exponent in constant or variable size windows. In this paper, we propose a fast and compact reconfigurable hardware for computing modular exponentiation using the m-ary method. The cryptographic hardware is low-cost and concise and therefore can be embedded in almost all electronic devices that use encrypted data.
Eternal gaze
Venue: ACM SIGGRAPH 2003 video review on Electronic theater program on Electronic theater program - Volume 144 (2003)

A poignant story of an artist, his art, and reciprocated love. Inspired by the life of one of the greatest artists of the twentieth century, the film follows Alberto Giacometti through the last 9 years of his remarkable life, and journeys into the depths of his famously tortured psyche. Along the way, we experience the human condition of despair, love, and hope that is as much a part of Ciacometti's art as it is about the artist himself. Copyright held by creator.
An Efficient Web Services Based Approach to Computing Grid
Authors: Weimin Zheng, Meizhi Hu, Guangwen Yang, Yongwei Wu, Ming Chen, Ruojie Ma, Shucheng Liu, Baoyin Zhang
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

The main focus of Grid is the resource sharing at substrate level. With present existing tool kits, however, great efforts still need to be made to implement resource sharing at higher level, such as publishing grid services on grid substrates. In this paper, we present Construction Platform for Specific Computing Grid (CPSCG), a system that renders the ease and speediness for users to construct a computing grid. Shared computational resources are wrapped to web services and exported as grid services with little human labor in CPSCG. Web user interface, which is automatically built by system based on web services, is supplied to end users for them to invoke grid services.
Boolean Minimizer FC-Min: Coverage Finding Process
Authors: Petr Fiser, Hana Kubatova
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a reverse way than common minimizers do. First, the cover of the on-set is found, and after that the appropriate implicants are being constructed to satisfy this cover. Thus, only the necessary group implicants are being generated, which makes FC-Min an extremely fast and efficient minimizer for functions with many output variables. An essential phase of the algorithm is the Find Coverage procedure. This phase determines the number of terms in the final solution, which has to be reduced to minimum. It solves an NP-hard problem, thus some heuristic has to be applied. We propose our heuristic method to solve this problem and study the influence of parameters on the final solution quality and runtime.
Expanding Polynomials and Connectedness of Self-Affine Tiles
Authors: Ibrahim Kirat, Ka-Sing Lau, Hui Rao
Venue: Discrete Computational Geometry (2004)

Little is known about the connectedness of self-affine tiles in ${\Bbb R}^n$. In this note we consider this property on the self-affine tiles that are generated by consecutive collinear digit sets. By using an algebraic criterion, we call it the {\it height reducing property}, on expanding polynomials (i.e., all the roots have moduli $ > 1$), we show that all such tiles in ${\Bbb R}^n, n \leq 3$, are connected. The problem is still unsolved for higher dimensions. For this we make another investigation on this algebraic criterion. We improve a result of Garsia concerning the heights of expanding polynomials. The new result has its own interest from an algebraic point of view and also gives further insight to the connectedness problem.
CHQ: A Multi-Agent Reinforcement Learning Scheme CHQ: A Multi-Agent Reinforcement Learning Scheme
Authors: Hiroshi Osada, Satoshi Fujita
Venue: Proceedings of the Intelligent Agent Technology, IEEE/WIC/ACM International Conference (2004)

In this paper, we propose a new reinforcement learning scheme called CHQ that could efficiently acquire appropriate policies under partially observable Markov decision processes (POMDP) involving probabilistic state transitions, that frequently occurs in multi-agent systems in which each agent independently takes a probabilistic action based on a partial observation of the underlying environment. A key idea of CHQ is to extend the HQ-learning proposed by Wiering et al. in such a way that it could learn the activation order of the MDP subtasks as well as an appropriate policy under each MDP subtask. The quality of the proposed scheme is experimentally evaluated. The result of experiments implies that it can acquire a deterministic policy with sufficiently high success rate, even if the given task is POMDP with probabilistic state transisions.
Coordination modes in the multisegmental dynamics of hula hooping
Authors: Ramesh Balasubramaniam, M. T. Turvey
Venue: Biological Cybernetics (2004)

In hula hooping, organized motions of the body keep the hoop in stable oscillatory motion parallel to the ground. We examined the hypothesis that the multiple degrees of freedom (DF) of the lower limbs in producing the oscillations are resolved into a few control DF. The Karhunen-Lo&#x00e8;ve decomposition was applied to the kinematics of the lower limbs in three experiments in which oscillation amplitude and frequency were manipulated. Kinematic variance was accommodated by two modes whose relative contributions varied with task parameters. Complementary analyses of interjoint Hilbert relative phase suggested a lower-limb organization into a vertical suspension mode and an oscillatory fore-aft mode. These modes might stabilize the hoop&#x2019;s angular momentum by controlling, respectively, its vertical and horizontal components.
Mining Constrained Gradients in Large Databases
Authors: Guozhu Dong, Jiawei Han, Joyce M. W. Lam Jian Pei
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Many data analysis tasks can be viewed as search or mining in a multidimensional space (MDS). In such MDSs, dimensions capture potentially important factors for given applications, and cells represent combinations of values for the factors. To systematically analyze data in MDS, an interesting notion, called "cubegrade¿ was recently introduced by Imielinski et al. [CHECK END OF SENTENCE], which focuses on the notable changes in measures in MDS by comparing a cell (which we refer to as probe cell) with its gradient cells, namely, its ancestors, descendants, and siblings. We call such queries gradient analysis queries (GQs). Since an MDS can contain billions of cells, it is important to answer GQs efficiently. In this study, we focus on developing efficient methods for mining GQs constrained by certain (weakly) antimonotone constraints. Instead of conducting an independent gradient-cell search once per probe cell, which is inefficient due to much repeated work, we propose an efficient algorithm, LiveSet-Driven. This algorithm finds all good gradient-probe cell pairs in one search pass. It utilizes measure-value analysis and dimension-match analysis in a set-oriented manner, to achieve bidirectional pruning between the sets of hopeful probe cells and of hopeful gradient cells. Moreover, it adopts a hypertree structure and an H-cubing method to compress data and to maximize sharing of computation. Our performance study shows that this algorithm is efficient and scalable. In addition to data cubes, we extend our study to another important scenario: mining constrained gradients in transactional databases where each item is associated with some measures such as price. Such transactional databases can be viewed as sparse MDSs where items represent dimensions, although they have significantly different characteristics than data cubes. We outline efficient mining methods for this problem in this paper.
Towards New Real-Time Processor: The Multioperand MSB-First Real-Time Adder
Authors: Kuspriyanto, Yusrila Y. Kerlooza
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Arithmetic operation's execution time in real-time system is bounded by deadlines. The method commonly used to meet these deadlines is by employing any suitable process-scheduling algorithm, which may contain a potential weakness. If time needed to operate is longer than its deadline, then the resultýs quality will be poor. This is mainly caused by the algorithms of the arithmetic operations commonly used nowadays do not choose the most significant data to be processed first. This research tries to design new algorithm and its processing unit that works based on real-time principles, which starts its computation process from the highest valued digit and provides its intermediate-results that can be accessed anytime during the process. Designing tool used in this research is MAX+plus II Baseline 10.2 software. This research accomplishes in showing the performance of the new algorithm and its processing unit, which is better than the performance of the conventional algorithm.
Development of a debugger for a concurrent language
Authors: F. Baiardi, N. De Francesco, E. Matteoli, S. Stefanini, G. Vaglini
Venue: Proceedings of the symposium on High-level debugging (1983)

This work discusses some issues in the debugging of concurrent programs. A set of desirable characteristics of a debugger for concurrent languages is deduced from an examination of the differences between the debugging of concurrent programs and that of sequential ones. A debugger for a concurrent language, derived from CSP, is then presented. It is based upon a semantic model of the supported language. The debugger enables to compare a description of the program behaviour to the actual behaviour as well as to valuate assertions on the process state. The description of the behaviuor is given by a formalism whose semantics is also specified. The formalism can specify program behaviuors at various abstraction levels. Lastly some guidelines for the implementation of the debugger are shown and a detailed example of program description is analyzed.
Technology infrastructure supporting a medical & bioinformatics masters degree
Authors: Guenter Tusch, Paul Leidig, Greg Wolffe, David Elrod, Carl Strebel
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Grand Valley State University has recently created a new Masters program in Medical & Bioinformatics. The M.S. degree, along with related degrees in Biostatistics and Biotechnology, are components of the "Professional Science Masters" development and implementation initiative supported by the Sloan Foundation. Key features of the new curriculum include an interdisciplinary framework with common core courses, the promotion and development of "soft skills" through teamwork and project management experiences, and an applied research focus highlighted by a mandatory business/industry internship. Instrumental to achieving these goals is a strong lab component to the curriculum that incorporates familiarity with industry-standard software packages. The laboratory infrastructure will be utilized by multiple courses, thus interconnecting different foci of the program and providing a complete experience for students.
Abelian Permutation Group Problems and Logspace Counting Classes
Authors: V. Arvind, T. C. Vijayaraghavan
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

The goal of this paper is to classify abelian permutationgroup problems using logspace counting classes.Building on McKenzie and Cookýs [MC87] classification of permutation group problems into four NC^1 Turing-equivalent sets, we show that all these problemsare essentially captured by the generalized logspace modclassModL, where ModL is the logspace analogue ofModP (defined by Köbler and Toda [KT96]).More precisely, our results are as follows:1. For abelian permutation groups, the problems ofmembership testing, isomorphism testing and computingthe order of a group are all in ZPL^ModL, andare all hard for ModL under logspace Turing reductions.2. The problems of computing the intersection ofabelian permutation groups, and computing agenerator-relator presentation for a given abelianpermutation group are in FL^ModL /poly. Furthermore,the search version of membership testing isalso in FL^ModL /poly.
Swarm-Bot: A New Distributed Robotic Concept
Authors: Francesco Mondada, Giovanni C. Pettinaro, Andre Guignard, Ivo W. Kwee, Dario Floreano, Jean-Louis Deneubourg, Stefano Nolfi, Luca Maria Gambardella, Marco Dorigo
Venue: Autonomous Robots (2004)

The swarm intelligence paradigm has proven to have very interesting properties such as robustness, flexibility and ability to solve complex problems exploiting parallelism and self-organization. Several robotics implementations of this paradigm confirm that these properties can be exploited for the control of a population of physically independent mobile robots.The work presented here introduces a new robotic concept called swarm-bot in which the collective interaction exploited by the swarm intelligence mechanism goes beyond the control layer and is extended to the physical level. This implies the addition of new mechanical functionalities on the single robot, together with new electronics and software to manage it. These new functionalities, even if not directly related to mobility and navigation, allow to address complex mobile robotics problems, such as extreme all-terrain exploration.The work shows also how this new concept is investigated using a simulation tool (swarmbot3d) specifically developed for quickly designing and evaluating new control algorithms. Experimental work shows how the simulated detailed representation of one s-bot has been calibrated to match the behaviour of the real robot.
Using mixture models for collaborative filtering
Authors: Jon Kleinberg, Mark Sandler
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

A collaborative filtering system at an e-commerce site or similar service uses data about aggregate user behavior to make recommendations tailored to specific user interests. We develop recommendation algorithms with provable performance guarantees in a probabilistic mixture model for collaborative filtering proposed by Hoffman and Puzicha. We identify certain novel parameters of mixture models that are closely connected with the best achievable performance of a recommendation algorithm; we show that for any system in which these parameters are bounded, it is possible to give recommendations whose quality converges to optimal as the amount of data grows.All our bounds depend on a new measure of independence that can be viewed as an L1-analogue of the smallest singular value of a matrix. Using this, we introduce a technique based on generalized pseudoinverse matrices and linear programming for handling sets of high-dimensional vectors. We also show that standard approaches based on L2-spectral methods are not strong enough to yield comparable results, thereby suggesting some inherent limitations of spectral analysis.
Reinforcement Learning for Stochastic Cooperative Multi-Agent Systems
Authors: Martin Lauer, Martin Riedmiller
Venue: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3 (2004)

We present a distributed variant of Q-learning that allows to learn the optimal cost-to-go function in stochastic cooperative multi-agent domains without communication between the agents.
Fuzzy reliability estimation using Bayesian approach
Authors: Hsien-Chung Wu
Venue: Computers and Industrial Engineering (2004)

The Bayesian reliability estimation under fuzzy environments is proposed in this paper. In order to apply the Bayesian approach, the fuzzy parameters are assumed to be fuzzy random variables with fuzzy prior distributions. The (conventional) Bayesian estimation method will be used to create the fuzzy Bayes point estimator of reliability by invoking the well-known theorem called 'Resolution Identity' in fuzzy sets theory. On the other hand, we also provide the computational procedures to evaluate the membership degree of any given Bayes point estimate of reliability. In order to achieve this purpose, we transform the original problem into a nonlinear programming problem. This nonlinear programming problem is then divided into four subproblems for the purpose of simplifying computation. Finally, the subproblems can be solved by using any commercial optimizers, e.g. GAMS or LINGO.
Effectively sharing a cache among threads
Authors: Guy E. Blelloch, Phillip B. Gibbons
Venue: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures (2004)

We compare the number of cache misses M1 for running a computation on a single processor with cache size C1 to the total number of misses Mp for the same computation when using p processors or threads and a shared cache of size Cp. We show that for any computation, and with an appropriate (greedy) parallel schedule, if Cp ≥ C1 + pd then Mp ≤ M1. The depth d of the computation is the length of the critical path of dependences. This gives the perhaps surprising result that for sufficiently parallel computations the shared cache need only be an additive size larger than the single-processor cache, and gives some theoretical justification for designing machines with shared caches.We model a computation as a DAG and the sequential execution as a depth first schedule of the DAG. The parallel schedule we study is a parallel depth-first schedule (PDF schedule) based on the sequential one. The schedule is greedy and therefore work-efficient. Our main results assume the Ideal Cache model, but we also present results for other more realistic cache models.
ADUS: Indirect Generation of User Interfaces on Wireless Devices
Authors: N. Mitrovic, J. A. Royo, E. Mena
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Nowadays, there exists a great interest in wireless and mobile devices. However, the development of graphical user interfaces (GUIs) for applications in these environments must consider new problems: 1) Different device capabilities and 2) Automatic monitoring of user interfaces. In this paper, we present an architecture that solves previous problems. We advocate the use of specifications of GUIs and the dynamic generation of the adequate visualization for a specific device without reimplementing each GUI for different devices.
Reversible Fast Permutation Transforms for Quantum Circuit Synthesis
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

Multiple-valued quantum circuit synthesis usingpermutations-based fast transforms is introduced. Sincethe reduction of power consumption is a majorrequirement for the circuit design in future technologies,such as in quantum computing, the main features ofseveral future technologies will include reversibility.Consequently, the new quantum circuits can play animportant task in the design of future circuits thatconsume minimal power.
Behaviour Based Motion Simulation for Fire Evacuation Procedures
Venue: Proceedings of the Theory and Practice of Computer Graphics 2004 (TPCG'04) (2004)

Virtual reality simulation of crowd movements inurban space and in architecture is a powerfulcomplementary verification tool to assist urbanplanning, architectural design, and safety assessment.This paper describes a behaviour based simulationsystem for modeling movements of a high densityhuman crowd in buildings under constrains of fireevacuation procedures. Based on a behavioursimulation model, a realistic simulation prototype ofhuman reactions to a fire event including both normalbehaviours regarding to the fire regulations andbehaviours against the rules such as panic, delay toevacuate, was implemented within a high qualityvisualization and real-time interactive 3D virtualenvironment.
Local discontinuous Galerkin methods for nonlinear dispersive equations
Authors: Doron Levy, Chi-Wang Shu, Jue Yan
Venue: Journal of Computational Physics (2004)

We develop local discontinuous Galerkin (DG) methods for solving nonlinear dispersive partial differential equations that have compactly supported traveling waves solutions, the so-called "compactons". The schemes we present extend the previous works of Yan and Shu on approximating solutions for linear dispersive equations and for certain KdV-type equations. We present two classes of DG methods for approximating solutions of such PDEs. First, we generate nonlinearly stable numerical schemes with a stability condition that is induced from a conservation law of the PDE. An alternative approach is based on constructing linearly stable schemes, i.e., schemes that are linearly stable to small perturbations. The numerical simulations we present verify the desired properties of the methods including their expected order of accuracy. In particular, we demonstrate the potential advantages of using DG methods over pseudospectral methods in situations where discontinuous fronts and rapid oscillations co-exist in a solution.
Sprite "Kebab"
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

A goblin in a kebab shop is brimming with innocent yet mischievous character. The facial expressions and delicate arm and finger movements bring the 'sprite' to life. The goblin was originally sculpted by hand and then made into a full latex puppet. The puppet was then laser scanned to provide 3D wireframes, Glassworks then applied high-resolution digital images of the original puppet to the wireframes to create the 3D model and give it texture. Copyright held by creator. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Real-Time Business Process Performance Management
Authors: Yushun Fan, Xinxin Bai
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Execution power is competition power. Facing dynamic market, real-time business process performance management (RTBPPM) is much important to enterprise success. This paper provides a RTBPPM framework and discusses relevant design issues. This framework allows for easy redesign of performance control formula and proactive respondence to unpredictable business situation. It is an effective method to meet the agility and intelligence requirements of contemporary enterprises.