ppxscal/embedding_network huggingface dataset:
Cost-based partitioning for distributed simulation of hierarchical modular devs models
Authors: Sunwoo Park
Venue:  (2003)

The main objective of this research is to design and implement a class of generic partitioning algorithms for hierarchical, modular Discrete Event Specification System (DEVS) models for distributed simulation. To attain the goal of this dissertation, a set of partitioning algorithms is designed using the cost analysis methodology. For more than a decade, abundant research has been conducted to develop partitioning algorithms that can find optimal, or reasonably acceptable, solutions for various partitioning problems. These employ methods such as simulated annealing, random partitioning, heuristic partitioning, and hierarchical clustering. In this dissertation, a new Generic Model Partitioning (GMP) algorithm for hierarchical modular DEVS models is proposed for distributed simulation. The GMP algorithm decomposes a given hierarchical model into a set of partition blocks and provides reasonable solutions for distinct partitioning problems based on a cost analysis methodology. It also minimizes model decomposition during the partitioning process and guarantees incremental quality of partitioning (QoP) improvements until a best partitioning is attained. A series of cost measures for cost generation, cost evaluation, and cost aggregation are introduced. Since a cost measure is a parametric method, subject to certain axioms, the proposed algorithm is generic and applicable any family of models provided there is a way to manipulate the appropriate cost information. A class of advanced algorithms derived from the GMP algorithm is also presented to tackle sophisticated issues associated with various distributed system configurations.
Simulation of manufacturing systems
Authors: John W. Fowler, Alexander K. Schömig
Venue: Applied system simulation: methodologies and applications (2003)

Today's manufacturing systems are highly complex and many are very costly to build and maintain. Discrete Event Simulation (DES) has an important role to play in managing these systems. The process of simulating manufacturing systems and some key application areas are discussed. Finally, some things that have limited the proliferation of DES in manufacturing systems are discussed.
Creating a collaborative learning environment for children
Authors: Matt Southern, Jim Turner
Venue: Proceedings of the 2003 conference on Interaction design and children (2003)

This paper reports on a project to create a networked 3D play environment that aids collaborative learning. The specific user group the project is aimed at is secondary school children. The project explores the educational possibilities offered within the dynamics of massively multi-player online games (MMOG) and other commercial computer game genres.
Desire and distance in Kaija Saariaho's Lonh
Authors: Anne Sivuoja-Gunaratnam
Venue: Organised Sound (2003)

This article explores the relationship of desire and distance in Kaija Saariaho's Lonh (1996) for soprano and electronics. The subject matter of Lonh is desire and romantic pleasures, anchored to feminine subjectivity, represented on stage by a soprano singer. Electronics provide the environmental sounds and amplify the singer's voice. Through Lonh looms a medieval song in the Occitan language, &lsquo;Lanquan li jorn son lonc en mai&rsquo; by Jaufr&eacute; Rudel, a famous troubadour in twelfth-century Provence. Saariaho reverses the narrative convention of love stories by presenting the most intimate encounter at the very beginning. In their succeeding encounters, the lovers move further away from each other. Similarly, in the course of Lonh the distance to Jaufr&eacute;'s song also increases. Luce Irigaray's concepts of love are used for an analysis of the relationship of the loving pair. By the end of Lonh the borderlines of speaking, singing, electronics, language and music collapse in Barthesian jouissance (bliss). The electronic technology in Lonh enables the re-investiture of cultural values, and the construction of flexible identities, crossing boundaries between the self and the other.
Session summary: integration versus orthogonality (RTSJ scheduling policies versus Ada's)
Authors: Andy Wellings, Joyce L. Tokar
Venue: ACM SIGAda Ada Letters (2003)

The purpose of this session was to review the Real-Time Specification for Java (RTSJ) and look at the scheduling that Java offers. The discussion focused on the assertion that Java offers a higher-level of abstraction for scheduling than Ada.
Intermolecular interactions of (H2O)2
Authors: A. Haskopoulos, G. Maroulis
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We report optimal structures, interaction energies and interaction induced dipole moments and polarizabilities for the van der Waals complex (H2O)2 He. Relying on Møller-Plesset perturbation theory with large, carefully optimized basis sets we have located the most stable configuration while the corresponding interaction energies were computed using coupled-cluster techniques. The potential energy surface (PES) of the complex has been determined using the MP2 method. The dependence of the calculated interaction properties on the basis set is also studied.
Providing process for projects in capstone courses
Authors: Annegret Goold
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

Our capstone course has undergone a number of evolutionary changes over the past few years. It was restructured to provide more realistic experiential learning with the introduction of larger software development projects involving 'real clients (sponsors)' and larger student teams with a mix of students across disciplines. We have introduced a project management focus into the course that allows for a more structured process of product development. This restructure was possible because the curriculum prior to the project course emphasized teamwork and project management.This paper provides some background about our capstone course and the significance of the contribution made by two other courses taken earlier in the programme.
A theory of computer-based educational simulation design based on observed design errors
Authors: Roger Schank
Venue:  (2003)

This dissertation addresses two problems. First, ten years of work developing computer-based educational simulations (e-Sims) at The Institute for the Learning Sciences and Cognitive Arts have gone largely undocumented and uncodified. Second, we need a well-articulated framework for discussing the design of e-Sims in terms of the mistakes designers make. This latter need is underscored by the fact that novice e-Sim designers who are trying to create effective learn by doing environments often make many mistakes, despite their substantial efforts to study current research on how people learn. The in-depth study of e-Sim designs presented here reveals roughly 50 of the most common design errors and uses those errors to develop a vocabulary for discussing critical issues in e-Sim design. A few examples of design errors include: relying heavily on extrinsic rather than intrinsic motivation; lecturing rather than allowing students to learn by doing; intervening so quickly when students make mistakes that they never get to see the real consequences of their mistakes; and breaking students' tasks down into such tiny pieces that they are unable see how the tiny tasks they are doing relate to a larger and more worthwhile end goal. The errors in this study are evaluated in terms of their effects on what students learn, how they learn it, and why they learn it. This evaluation reveals specific student needs and goals violated by different e-Sim design errors, including, for example, students' desire to be in control in the learning process, and their need to experience failures and expectation failures in order to learn. With a specific vocabulary for thinking and talking about e-Sim design in terms of design errors, as well as a record of the most common e-Sim design errors, it is hoped that this research will be useful in educating novice designers, in supporting all designers in communicating about the task of e-Sim design, and in developing performance support tools to assist in future e-Sim design work.
Turbo codes and zigzag codes: performance analysis and simulation
Authors: Nam Phamdo
Venue:  (2000)

Turbo codes were introduced in 1993 and are now considered among the most important developments in coding theory. A Turbo encoder is formed by two parallel concatenated recursive convolutional encoders connected by an interleaver. The interleaver performs permutation of the input sequence. The decoder consists of two iterative maximum a posterior (MAP) decoders connected by an interleaver and a deinterleaver. Turbo codes have excellent bit error rate (BER) performance at low signal-to-noise ratios (SNRs). Performance near Shannon capacity limit can be obtained with large interleavers, and comparatively good performance is possible for any interleaver size. In this thesis, we deal with four important issues of Turbo codes. The first issue is the sensitivity of Turbo decoders to noise distribution mismatch. We investigate the sensitivity of Turbo decoders to noise distribution mismatch and propose a simple method for on-line estimation of the noise distribution. The simulation results show that the proposed procedure leads to relatively good performance for the class of memoryless generalized Gaussian noise and the class of multimodal Gaussian noise. The second issue is the &ldquo;error floor&rdquo; of Turbo codes, which is the flattening of the performance curve for moderate to high SNR. Since simulation is impractical in this range, we analyze the performance of Turbo codes through union bounds. To do this, we propose a simple recursive method to generate the input redundancy weight enumerating function (IRWEF) of time-invariant recursive systematic convolutional encoders. This method is used to determine the union bound of Turbo codes with different puncturing patterns and termination conditions. We find that the Turbo code performance at high SNR can be significantly improved by trellis termination. For a given rate, different puncturing patterns result in different code performance. The third issue is the decoding complexity. Standard Turbo decoding is highly complex. To reduce decoding complexity, we introduce a class of error-correcting codes called zigzag codes. A zigzag code is highly structured and can be viewed as a two-state convolutional code. A concatenated zigzag encoder has several encoders connected by several interleavers. The performance is comparable to (though slightly worse than) standard Turbo codes at low SNR. At high SNR, both analysis and simulation results show that parallel concatenated zigzag codes have lower error floor than standard Turbo codes. The fourth issue is about the interleaver design for concatenated zigzag codes. Three simple interleavers are proposed and simulations show that the proposed interleavers can significantly lower the error floor of concatenated zigzag codes.
Techniques for protecting data from piracy, illegal inference, and malicious intrusions
Authors: Yingjiu Li
Venue:  (2003)

This thesis reports a systematic study of data protection in three different, yet related, scenarios. The first scenario is to guard relational data against unauthorized redistribution or data piracy. In this scenario, the data is released to users who have full control over the use of data but are restricted from any redistribution. A novel technique is presented for embedding fingerprints in database relations so that the original recipient of the data can be identified. In our scheme, one secret key (with or without primary key attributes in database relations) is used to decide the way how a fingerprint is embedded. Rigorous analysis shows that, with high probability, a detected fingerprint is indeed the fingerprint originally embedded, and embedded fingerprints cannot be modified or erased by a variety of attacks, including bits flipping, tuple addition and deletion; secret key guessing, and collusion among multiple recipients of the same relation. In addition, as a special case of fingerprinting, a robust watermarking scheme is also presented for relational databases. The second scenario is to protect the privacy of individual data value against interval-based inference from aggregation queries. Different from the first scenario in which the data is released to users, this scenario is about data that are controlled by its owner. Users are allowed to access the data through aggregation queries. An individual data value is said to be compromised if an accurate enough interval, called inference interval, is obtained from aggregation results such that the actual data value must fall into the interval. Our study shows that it is intractable to audit interval-based inference for bounded integer values; while for bounded real values, the auditing problem has a polynomial time complexity involving mathematical programming with a large number of constraints and/or variables. The last scenario is to detect anomaly from usage log data. Different from the first scenario in which the data are released to users as well as the second scenario in which the data are allowed to be queried by users, this scenario is about using log data to build profiles for user normal behaviors and detect suspicious anomalies that deviate from the profiles. Experiments show that our proposed method is more flexible and precise than previous methods that do not use time information or simply use fixed partition of time intervals in profiling. (Abstract shortened by UMI.)
CGE: automatic generation of controllers in the CATHEDRAL-II silicon compiler
Authors: J. Zegers, P. Six, J. Rabaey, H. De Man
Venue: Proceedings of the conference on European design automation (1990)

This paper describes the efforts done within the framework of the CATHEDRAL-II silicon compiler towards automatic controller generation. The program CGE (Controller Generation Environment) maps a microcode description generated by Atomics, an RT scheduler, onto a target controller architecture. The program produces logic, structure and layout descriptions of the constituent blocks. The controller architecture has been chosen to suit most of the audio, speech, telecom and back-end image processing real time algorithms (throughputs up to 1 MHs).
Available Bandwidth-Based Real-Time Multicast Routing Distributed Algorithm
Authors: Jiaqing Huang, Xu Du, Zongkai Yang, Wenqing Cheng
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

In this paper, available bandwidth instead of cost is adopted as the prime metric of the real-time multicast routing algorithms in that available bandwidth is the better representative of the real network than cost. At the same time, two significant bounds of end-to-end delayand inter-destination delay variation are taken into consideration. Based on these three metrics, a novel distributed real-time multicast routing algorithm with widest available bandwidth paths under the constraints of delay and delay variation is proposed. This algorithm can increase efficiency of algorithms concerned with delay variation by analyzing and attaining the relationship between per path delay and the two constraints. In addition, the problem of false termination is eliminated by a make-and-break procedure. Simulation results and analysis prove the effectiveness of the algorithm as well as its polynomial time complexity.
Analysis of the electromechanical vibrations in induction motor drives due to the imperfections of the mechanical transmission system
Authors: Hadi Youssef Kanaan, Kamal Al-Haddad, Gilles Roy
Venue: Mathematics and Computers in Simulation (2003)

Mechanical vibrations become a serious concern in drive applications when they adversely affect the dynamic performances of these applications and may end with physical deterioration of their structures. In many process applications, such perturbations must be detected and assessed in order to take the appropriate action to preserve the reliability of the operation. This paper presents a method of detection of one of the major causes of mechanical vibrations in asynchronous motor drive applications. The study, which involves linearized dynamic modeling of the asynchronous motor associated with its multi-mass load, shows the dependence of the vibrations frequencies on both the electrical and mechanical system parameters. Numerical simulations using Matlab/Simulink are performed using the set of parameters of a prototype drive system. The simulation results confirm the validity of the proposed method of detection.
Force guided assembly under bias
Authors: William Whittaker
Venue:  (2003)

Humans are able to pump gas into a car with little or no difficulty. This task is characterized by two sources of force: that from the nozzle contacting the car and that from the hose attached to the pump. The task succeeds due to the appreciable skill of a human and a forgiveness in the connection. The robotic mating of connectors burdened by forces from sources like the gas hose is beyond the current state of art. The research presented in this dissertation develops technology for robots to mate connectors that concurrently experience appreciable forces from encumbrances, like those from hoses, cables and oscillating masses, in addition to forces from contact. Effective force guided assembly under the influence of these bias forces, requires the differentiation of contact forces from bias forces, a task that is impossible using traditional sensing configurations. Emulating the contribution of bias during contact allows the estimation of bias forces and, subsequently, contact forces. By measuring and modeling bias prior to contact, when the only forces on the connector are from bias, a model of the bias source can be made. This model can be used to emulate bias during contact, enabling the differentiation of contact forces and allowing gentle force guided assembly. This thesis asserts that identification of and compensation for biasing forces will enable the robotic assembly of complex and fragile connectors that would otherwise be impossible.
Multilevel block ILU preconditioner for sparse nonsymmetric M-matrices
Authors: N. Guessous, O. Souhar
Venue: Journal of Computational and Applied Mathematics (2004)

We develop in this paper a multilevel block ILU preconditioner for solving sparse nonsymmetric M-matrices, arising from convection-diffusion equations, discretized by finite difference scheme. This preconditioner is based on recursive block ILU factorization, where the Schur complement matrices are successively approached by some sparse matrices satisfying some hypothesis. We study the preconditioned GMRES iterative method and multigrid method for solving linear systems arising from this scheme.
A Security Policy Based upon Hardware Encryption
Authors: Scott Harper, Peter Athanas
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

This paper presents an overview of a mobile communications device that implements a keymanagement policy and hardware encryption for data-centric security. Examples ofapplications for this device include portable medical record systems, inventory tracking systems, communication devices, and portable gaming systems. Security for these devices typically takes one of three forms: 1) a password or code, 2) a key or token lock, 3) a biometric user authentication system. These security measures are intended to protect the device against unauthorized access, but do not generally protect the device against threats to its intellectual property. Even if a password is required to use a device, it is still possible to duplicate the device, leaving out the authorization control. This paper presents a secure user interface that not only controls device access, but also allows for user-based device hardwarecustomization while protecting against reverse engineering.
Tied Favourite Edges for Simple Random Walk
Authors: B. Tóth, W. Werner
Venue: Combinatorics, Probability and Computing (1997)

We show that there are almost surely only finitely many times at which there are at least four &lsquo;tied&rsquo; favourite edges for a simple random walk. This (partially) answers a question of Erd&ouml;s and R&eacute;v&eacute;sz.
Technology-use mediation: making sense of electronic communication in an organizational context
Authors: Jørgen P. Bansler, Erling Havn
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

This study analyzes how a group of 'mediators' in a large, multinational company adapted a computer-mediated communication technology (a 'virtual workspace') to the local organizational context (and vice versa) by modifying features of the technology, providing ongoing support for users, and promoting appropriate conventions of use. Our findings corroborate earlier research on technology-use mediation, which suggests that such mediators can exert considerable influence on how a particular technology will be established and used in an organization. However, this study also indicates that the process of technology-use mediation is more complex and indeterminate than earlier literature suggests. In particular, we want to draw attention to the fact that advanced computer-mediated communication technologies are equivocal and that technology-use mediation consequently requires ongoing sensemaking.
S-ARP: a Secure Address Resolution Protocol
Authors: D. Bruschi, A. Ornaghi, E. Rosti
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Tapping into the communication between two hosts on aLAN has become quite simple thanks to tools that can bedownloaded from the Internet. Such tools use the AddressResolution Protocol (ARP) poisoning technique, which relies on hosts caching reply messages even though the corresponding requests were never sent. Since no message authentication is provided, any host of the LAN can forge amessage containing malicious information.This paper presents a secure version of ARP that provides protection against ARP poisoning. Each host has apublic/private key pair certified by a local trusted party onthe LAN, which acts as a Certification Authority. Messagesare digitally signed by the sender, thus preventing the injection of spurious and/or spoofed information. As a proofof concept, the proposed solution was implemented on aLinux box. Performance measurements show that PKI basedstrong authentication is feasible to secure even low levelprotocols, as long as the overhead for key validity verification is kept small.
Real-time computer control of a multilevel converter using the mathematical theory of resultants
Authors: John Chiasson, Leon Tolbert, Keith McKenzie, Zhong Du
Venue: Mathematics and Computers in Simulation (2003)

The mathematical theory of resultants is used to compute the switching angles in a multilevel converter so that it produces the required fundamental voltage while at the same time cancels out unwanted order harmonics. Experimental results are given for the three dc source case. It is shown that for a range of the modulation index the switching angles can be chosen to produce the desired fundamental while at the same time the fifth and seventh harmonics are identically zero.
From algorithmic jukeboxes to zero-time synthesis: a potential A-Z of music in tomorrow's world (a conference provocation)
Authors: Leigh Landy
Venue: Organised Sound (2001)

This conference talk is about change. It does not pretend to be an academic paper as such; it was offered at the &lsquo;Music without Walls? Music without Instruments?&rsquo; conference as a provocative &lsquo;performance&rsquo;. The following pages investigate twenty-six developments associated with music that one might discover in the not-too-distant future.