ppxscal/embedding_network huggingface dataset:
Generalized synchronization model and description language for multimedia systems
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: An indeterministic synchronization model based on 10 interval operators is sufficient for specifying interactive multimedia systems (IMSs). This paper focuses on using a description language to design IMSs. We first propose a generalized synchronization model (GSM). It has fewer, more powerful interval operators, which are still intuitive to multimedia authors and users. Then, we present a new Multimedia Synchronization Description Language (MSDL), which is based on the GSM. Additionally, we demonstrate how MSDL can be used to describe a large number of present and future IMSs.
Signed and weighted trust credentials in fraglets
Authors: Fabio Martinelli, Marinella Petrocchi
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

We continue our line of research by extending the Fraglets computation model with digital signature and security credentials dealing with a quantitative notion of trust. We also give a modeling example where trust credentials are managed at fraglets level.
Genetic Vector Quantizer Design on Reconfigurable Hardware
Authors: Ting-Kuan Lin, Hui-Ya Li, Wen-Jyi Hwang, Chien-Min Ou, Sheng-Kai Weng
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper presents a novel hardware architecture for genetic vector quantizer (VQ) design. The architecture is based on steady-state genetic algorithm (GA). It adopts a novel architecture based on shift registers for accelerating mutation and crossover operations while reducing area cost. It also uses a pipeline architecture for fitness evaluation. The proposed architecture has been embedded in a softcore CPU for physical performance measurement. Experimental results show that the proposed architecture is an effective alternative for VQ optimization attaining both high performance and low computational time.
Multirate Runge-Kutta schemes for advection equations
Authors: Martin Schlegel, Oswald Knoth, Martin Arnold, Ralf Wolke
Venue: Journal of Computational and Applied Mathematics (2009)

Explicit time integration methods can be employed to simulate a broad spectrum of physical phenomena. The wide range of scales encountered lead to the problem that the fastest cell of the simulation dictates the global time step. Multirate time integration methods can be employed to alter the time step locally so that slower components take longer and fewer time steps, resulting in a moderate to substantial reduction of the computational cost, depending on the scenario to simulate [S. Osher, R. Sanders, Numerical approximations to nonlinear conservation laws with locally varying time and space grids, Math. Comput. 41 (1983) 321-336; H. Tang, G. Warnecke, A class of high resolution schemes for hyperbolic conservation laws and convection-diffusion equations with varying time and pace grids, SIAM J. Sci. Comput. 26 (4) (2005) 1415-1431; E. Constantinescu, A. Sandu, Multirate timestepping methods for hyperbolic conservation laws, SIAM J. Sci. Comput. 33 (3) (2007) 239-278]. In air pollution modeling the advection part is usually integrated explicitly in time, where the time step is constrained by a locally varying Courant-Friedrichs-Lewy (CFL) number. Multirate schemes are a useful tool to decouple different physical regions so that this constraint becomes a local instead of a global restriction. Therefore it is of major interest to apply multirate schemes to the advection equation. We introduce a generic recursive multirate Runge-Kutta scheme that can be easily adapted to an arbitrary number of refinement levels. It preserves the linear invariants of the system and is of third order accuracy when applied to certain explicit Runge-Kutta methods as base method.
The grid: Analysis of basic principles and ways of application
Authors: V. N. Kovalenko, D. A. Koryagin
Venue: Programming and Computing Software (2009)

During the last decade, a new direction of distributed computing--the grid--emerged, which is designed for work with sets of distributed resources. The results obtained, including the development of largescale grid infrastructures, bring us to the discussion of possibility of applying the new technologies to practice. The goal of the paper is to outline a scope of grid capabilities. The discussion relies on the formulation of basic points of the grid concept, principles of integration of spatially distributed resources, and the tasks solved by the grid middleware. Based on this, forms and methods of using grid integration technologies for work with computer, file, information, and other types of resources are described.
Don't be Typecast as a Software Developer
Authors: George V. Neville-Neil
Venue: Queue (2009)

Kode Vicious's temper obviously suffers from having to clean up after the mistakes of his peers. What would he have them learn now so that he can look forward to a graceful and mellow old age?
Architecture of Privacy
Authors: Bruce Schneier
Venue: IEEE Security and Privacy (2009)

Columnist Bruce Schneier describes the importance of building IT architectures that protect privacy from the initial design and the importance of doing so for future generations.
Simple correction of multiple reflection effects in rugged terrain
Authors: Pascal Sirguey
Venue: International Journal of Remote Sensing (2009)

Operational correction of optical satellite sensor imagery usually models radiation reflected from surrounding terrain with a first-order reflection function. In rugged areas and snowy environments, the trapping of radiation between adjacent slopes can make such an approximation inadequate, leading to underestimation of the amount of irradiance, and overestimation of the ground reflectance. It is shown that a multiple reflection model, based on mean parameters computed from the terrain neighbourhood, converges to a simple correction factor. Comparison between first-order and multiple reflection models shows that the reflectance of snow targets, in very rugged terrain, may be overestimated by up to 30% if disregarding multiple reflections. This potentially explains saturated values obtained from topographic correction algorithms which only use a first-order terrain function, e.g. ATCOR3, and demonstrates that correction for multiple reflections should be implemented in specific environments.
Optimized union of non-disjoint distributed data sets
Authors: Itay Dar, Tova Milo, Elad Verbin
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute their union. As these sets often contain common data items, avoiding the transmission of redundant information is essential for effective union computation. In this paper we define the notion of optimal union plans for non-disjoint data sets residing on distinct peers, and present efficient algorithms for computing and executing such optimal plans. Our algorithms avoid redundant data transmission and optimally exploit the network bandwidth capabilities. A challenge in the design of optimal plans is the lack of a complete map of the distribution of the data items among peers. We analyze the information required for optimal planning and propose novel techniques to obtain compact, cheap to communicate, description of the data sources. We then exploit it for efficient union computation with reasonable accuracy. We demonstrate experimentally the superiority of our approach over the common naive union computation, showing it improves the performance by an order of magnitude.
Partially Decentralised Context Management for P2P Communities
Authors: Jani Pellikka, Timo Koskela, Mika Ylianttila
Venue: Proceedings of the 2008 The Second International Conference on Next Generation Mobile Applications, Services, and Technologies (2008)

The retrieval of context information is usually limited on a single user. Though some context subscription methods do exist, the mechanisms are not optimised for distributing context information concerning a group of users. This paper presents a context management system that utilises the presence service architecture and user communities on top of P2PSIP network. The system is based on existing IETF standardisation efforts and utilises SIP-based messaging protocols in a novel way to improve management and distribution of community context information. The testing results show that our system clearly outperforms the method of individual subscriptions to context information when the number of members in a community increases. With large communities, the network traffic gain exceeds 60%, whereas the delay decreases to one-quarter.
SHARPE at the age of twenty two
Authors: Kisho S. Trivedi, Robin Sahner
Venue: ACM SIGMETRICS Performance Evaluation Review (2009)

This paper discusses the modeling tool called SHARPE (Symbolic Hierarchical Automated Reliability and Performance Evaluator), a general hierarchical modeling tool that analyzes stochastic models of reliability, availability, performance, and performability. It allows the user to choose the number of levels of models, the type of model at each level, and which results from each model level are to act as which parameters in which higher-level models. SHARPE includes algorithms for analysis of fault trees, reliability block diagrams, acyclic series-parallel graphs, acyclic and cyclic Markov and semi-Markov models, generalized stochastic Petri nets, and closed single- and multi-chain product-form queueing networks. For many of these, the user can choose among alternative algorithms, and can decide whether to get a result in the form of a distribution function (symbolic in the time variable) or as a mean or probability. SHARPE has been useful to students, practicing engineers, and researchers. In this paper we discuss the history of SHARPE, give some examples of its use, and talk about some lessons learned.
A synchronization metric for meshed networks of pulse-coupled oscillators
Authors: Alexander Tyrrell, Gunther Auer, Christian Bettstetter
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Natural phenomena such as the synchronization of fireflies, interactions between neurons, and the formation of earthquakes are commonly described by the mathematical model of pulse-coupled oscillators. This article investigates the behavior of this model when oscillators form a meshed network, i.e. nodes are not directly coupled to all others. In order to characterize the synchronization process of populations of coupled oscillators we propose a metric that allows to characterize the level of local synchronization. We demonstrate the merits of the proposed local metric by means of two case studies that examine the effect of imperfections on the synchronization process, namely the presence of frequency drifts and propagation delays.
Knowledgeable contexts for user interaction
Authors: Bozena Henisz Thompson, Frederick B. Thompson, Tai-Ping Ho
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

ASK, A Simple Knowledgeable System, is a total system for the structuring, manipulation, and communication of information. The ASK user interface is a simple dialect of natural English. The system includes extensive means by which a user group and application programmer can build a knowledgeable context for user interaction. The users themselves can build, modify, and extend their knowledge base. They can add complex definitions that embody knowledge of their domain. They can ground a new tentative knowledge base on more stable ones, modifying and extending their new one without affecting the old. A truly knowledgeable system must also know how to perform complex tasks in response to terse user inputs, taking over complicated but repetitive tasks on simple cues. The ASK system includes three system-guided dialogues that can be used to build such knowledgeability into a user's context.
Knowledge-based event control for flow-shops using simulation and rules
Authors: Mark Aufenanger, Wilhelm Dangelmaier, Christoph Laroque, Nando Rüngener
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

The requirements on production systems and their planning and control systems are constantly growing. Systems have to be flexible and provide viable solutions at the same time. Different planning and control approaches, such as optimization, simulation and combination of techniques etc., that attempt to solve the scheduling problems are available. Mathematical solutions which can be found in literature didn't solve the real-world problems in an appropriate way. Current knowledge based solutions did not give any value about decision reliability as well as their decision attributes are not differentiate enough. We are developing a new rule based approach by using a combination of simulation and a knowledge generation within a dynamic production planning and -control for flow-shops. Ideas of how knowledge can be trained by simulation are presented. Furthermore which kind of rules and attributes can be used and how decisions about the rule selection can be made are shown.
Fabry Perot laser diode for pulse generation and its other application
Authors: Xiaohui Fang, Jinhua Chen, P. K. A. Wai
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

In this paper, Fabry-P&eacute;rot laser diode (FP-LD) based pulse generation and its application in optical signal processing is demonstrated. Three topics are focused which including: (i) continuously wavelength-tunable optical short pulse generation in a relatively wide range of 42 nm based on FP-LD by enlarging injection locking range, The sidemode suppression ratio achieved is 35 dB over the whole wavelength tuning range; (ii) a simple method to generate high power and 139 GHz high repetition rate pulse train based on self injection-locking in a commercially available FP-LD; (iii) a novel, simple, and low cost method for all optical clock recovery at 10 GHz based on the switching of two longitudinal modes in a dc biased multi-quantum-well (MQW) FP-LD.
Note: On explicit formulas for bandwidth and antibandwidth of hypercubes
Authors: Xiaohan Wang, Xiaolin Wu, Sorina Dumitrescu
Venue: Discrete Applied Mathematics (2009)

The Hales numbered n-dimensional hypercube exhibits interesting recursive structures in n. These structures lead to a very simple proof of the well-known bandwidth formula for hypercubes proposed by Harper, whose proof was thought to be surprisingly difficult. Harper also proposed an optimal numbering for a related problem called the antibandwidth of hypercubes. In a recent publication, Raspaud et al. approximated the hypercube antibandwidth up to the third-order term. In this paper, we find the exact value in light of the above recursive structures.
ACM SIGGRAPH ASIA 2008 computer animation festival
Venue: International Conference on Computer Graphics and Interactive Techniques (2008)

I don't even remember how I fell in love with animation, but without a doubt, it amazes me and constantly inspires me. And in early 2008, my fascination led me to a major new assignment, which I accepted with enormous passion and pleasure: chairing the first SIGGRAPH Computer Animation Festival in Asia. It has been exciting to see the SIGGRAPH Asia 2008 Computer Animation Festival take shape, and I am more than delighted to be part of this challenging process. The result is an international showcase of exceptional work that explores new horizons of animation in all its forms while maintaining the traditional Computer Animation Festival format. The Juried Programmes focus on the convergence of state-of-the-art animation and the cutting edge of technology beyond genres and techniques. The Electronic Theatre, always a popular feature for SIGGRAPH attendees, presents some of the world's most remarkable animation achievements. The Animation Theatre features more of the same, including longer pieces that can not be accommodated in the fast-paced format of the Electronic Theatre. The Invited Screenings present works selected by the curators in several categories: a School Showcase of promising student work, Studio Specials from the world's leading animation and visual effects experts, and the Best of SIGGRAPH Award Winners from previous Computer Animation Festivals. If you share our passion for animation, the SIGGRAPH Asia 2008 Computer Animation Festival is your opportunity to discover the full international spectrum of creativity and technological innovation. 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
Introduction to Interval Analysis
Authors: Ramon E. Moore, R. Baker Kearfott, Michael J. Cloud
Venue:  (2009)

This unique book provides an introduction to a subject whose use has steadily increased over the past 40 years. An update of Ramon Moore s previous books on the topic, it provides broad coverage of the subject as well as the historical perspective of one of the originators of modern interval analysis. The authors provide a hands-on introduction to INTLAB, a high-quality, comprehensive MATLAB toolbox for interval computations, making this the first interval analysis book that does with INTLAB what general numerical analysis texts do with MATLAB. Readers will find the following features of interest: elementary motivating examples and notes that help maximize the reader s chance of success in applying the techniques; exercises and hands-on MATLAB-based examples woven into the text; INTLAB-based examples and explanations integrated into the text, along with a comprehensive set of exercises and solutions, and an appendix with INTLAB commands; an extensive bibliography and appendices that will continue to be valuable resources once the reader is familiar with the subject; and a Web page with links to computational tools and other resources of interest. Audience: Introduction to Interval Analysis will be valuable to engineers and scientists interested in scientific computation, especially in reliability, effects of roundoff error, and automatic verification of results. The introductory material is particularly important for experts in global optimization and constraint solution algorithms. This book is suitable for introducing the subject to students in these areas. Contents: Preface; Chapter 1: Introduction; Chapter 2: The Interval Number System; Chapter 3: First Applications of Interval Arithmetic; Chapter 4: Further Properties of Interval Arithmetic; Chapter 5: Introduction to Interval Functions; Chapter 6: Interval Sequences; Chapter 7: Interval Matrices; Chapter 8: Interval Newton Methods; Chapter 9: Integration of Interval Functions; Chapter 10: Integral and Differential Equations; Chapter 11: Applications; Appendix A: Sets and Functions; Appendix B: Formulary; Appendix C: Hints for Selected Exercises; Appendix D: Internet Resources; Appendix E: INTLAB Commands and Functions; References; Index.
Design of training-based mobile receivers for multiuser time-hopping UWB communication systems
Authors: Wei-Chiang Wu, Hsien-Chin Chiu
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

Ultra wideband (UWB) impulse radio (IR) is an emerging and very promising short range communication scheme because of the desired features such as low power consumption, resistance to multipath fading, and precise ranging capability. In this paper, we show the feasibility of using small training data set to design blind (without channel state information (CSI) and users' time-hopping (TH) sequences) mobile station (MS) receivers for UWB IR communication systems. Under multipath fading channel and multiple access interference (MAI), we develop two types of constrained minimum output energy (C-MOE) based binary signal detectors. The first scheme is completely blind such that the desired user's TH code is not exploited for detection. While the second scheme first despreads the received signal in each resolvable path and combines the outputs by C-MOE based weights. Extensive simulations are conducted to evaluate and compare the performance of the proposed detectors. Employing a relatively small training data set, it is demonstrated that the proposed detectors are robust to MAI and near-far problems and approach the optimum bound.
Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
Authors: Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We present a polynomial-time algorithm for c-planarity testing of clustered graphs with fixed plane embedding and such that every cluster induces a subgraph with at most two connected components.
A new method for random vibration analysis of stochastic truss structures
Authors: Wei Gao, Nong Zhang, Jinchen Ji
Venue: Finite Elements in Analysis and Design (2009)

A new method called the random factor method (RFM) for the natural frequency, mode shape and random vibration analysis of stochastic truss structures is presented in this paper. Using the RFM, the structural physical parameters and geometry can be considered as random variables. The structural stiffness and mass matrices can then, respectively, be described by the product of two parts corresponding to the random factors and the deterministic matrix. The structural natural frequencies, mode shapes and random response can be expressed as the function of the random factors. By means of the random variable's functional moment method and the algebra synthesis method, computational expressions for the mean value, standard deviation and variation coefficient of the dynamic characteristics, mean square value of the stationary random displacement and stress response are developed. The influences of the randomness of the structural parameters on the dynamic characteristics, structural displacement and stress responses are demonstrated using a truss structure and Monte-Carlo simulations illustrate the efficiency of the proposed method.
Trace Analysis for Predicting the Effectiveness of Partial Evaluation
Authors: Germán Vidal
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

The main goal of partial evaluation [1] is program specialization. Essentially, given a program and part of its input data|the so called static data|a partial evaluator returns a new, residual program which is specialized for the given data. An appropriate residual program for executing the remaining computations|those that depend on the so called dynamic data|is thus the output of the partial evaluator. Despite the fact that the main goal of partial evaluation is improving program efficiency (i.e., producing faster programs), there are very few approaches devoted to formally analyze the effects of partial evaluation, either a priori (prediction) or a posteriori. Recent approaches (e.g., [2,3]) have considered experimental frameworks for estimating the best division (roughly speaking, a classification of program parameters into static or dynamic), so that the optimal choice is followed when specializing the source program.