ppxscal/embedding_network huggingface dataset:
Reducing service time at a busy fast food restaurant on campus
Authors: Sara A. Curin, Jeremy S. Vosko, Eric W. Chan, Omer Tsimhoni
Venue: Proceedings of the 37th conference on Winter simulation (2005)

As part of an undergraduate engineering class project, a Tim Hortons restaurant on the University of Michigan campus was simulated to improve its efficiency. Using the standard simulation study steps, several service scenarios were modeled and evaluated based on customer system time. A detailed analysis of the simulation revealed that, in the current setup, the utilization of the cash registers is high (88%); consequently, several scenarios that decrease the load on the cash registers were explored. To reduce customer wait times and, therefore, serve more customers per hour, it is recommended that Tim Hortons operate with five servers. A five-person setup with three cashiers, a soup server, and a sandwich server could reduce customer system time by over two minutes per customer. As an alternative, transferring all food preparation to the secondary service location and adding a dual-purpose server could reduce customer system time by over one half.
Learning through participatory simulations: network-based design for systems learning in classrooms
Authors: Uri Wilensky, Walter Stroup
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

This project brings together two lines of research&oacute;the study of complex dynamic systems and the use of participatory simulations as a powerful way into systems modeling&oacute;both of which can be enabled and advanced through emerging network technologies. The study of dynamic systems stands as a new form of literacy for all.. Participatory Simulations Activities can support new forms of classroom interaction and can serve to catalyze the engagement with dynamic systems modeling as a core feature of the education of all students. To accomplish these goals, we introduce a new architecture, HubNet. HubNet is an open client-server architecture, which enables many users at the "Nodes" (currently TI graphing calculators) to control the behavior of individual objects or agents and to view the aggregated results on a central computer known as the Hub. This network of nodes is integrated with a powerful suite of modeling, analysis and display tools that together give both the capacity to "fly" the system in intuitive mode, to reflect on the emergent result of their simulation and, also, to encode their strategies as rules which the system can then run independently. The HubNet system is being used in several middle and secondary classrooms. An illustrative example of classroom use is presented.
Analysis on Appearance Reasons of the Positive Feedback Traders
Authors: Shi An, Lei Wang, He Huang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

Positive feedback traders buy the asset when price is rising and sell it when price is falling. This type of speculation in short term will cause the violent fluctuation for a given asset price, and make great influence to the stabilization of the financial market. The price reaction model under the influence of noise traders is established by considering the influence which the investment cost and information arrival rate make to the arbitrage and asset price. We analyze the reasons and conditions why positive feedback traders are born from quantitative analysis.
Synchronization Strategies for Spatial Information Organization
Authors: D. Kukulenz, J. Kasper
Venue: Proceedings of the conference on Information Visualization (2006)

Spatial organisation of information objects on a two or three dimensional plane or space has the advantage of revealing the connections between objects easily by spatial proximity. A user may easily understand, remember and, given an adequate User Interface, change the positions and the visual relationships between information objects. If a group of users has access to the same information plane or space the problem arises that conflicts may occur regarding the positioning, the creation and deletion of objects. In this article we present solution strategies for conflicts concerning collaborative spatial information organization. We present interaction-based and automatic conflict-dissolving procedures in order to realize a version control system for efficient collaborative spatial information organization.
Where's My Holodeck? The New Frontier of Media Display
Authors: Jonathan Foote
Venue: IEEE MultiMedia (2006)

The author discusses unconventional displays of the future, such as handheld projectors the size of a matchbox, organic LEDs (OLEDs), electrophoretic ink, Guricon bichromal beads, roll-up electronic newspapers, and rewritable displays in supermarkets.
A new method to determine the tool count of a semiconductor factory using FabSim
Authors: Holger Vogt
Venue: Proceedings of the 36th conference on Winter simulation (2004)

Tool count optimization is mandatory for an efficiently organized semiconductor factory. This paper describes an efficient heuristic to determine the tool count using the compact fab simulator FabSim Interactive. A combination of the Simulated Annealing algorithm and the knowledge of toolset usage, which is gained by repeated simulation of the factory, results in a fast approach. There are no restrictions concerning multiple products and processes during optimization. A simple cost model (revenue per wafer out minus tool depreciation) yields the objective function to be maximized, tool count values per toolset are the decision variables, and a lot start sequence determines the fab throughput required. Depending on the factory size, optimization results may be available within a few hours of simulation time on a standard PC.
Delegate: A Proxy Based Architecture for Secure Website Access from an Untrusted Machine
Authors: Ravi Chandra Jammalamadaka, Timothy W. van der Horst, Sharad Mehrotra, Kent E. Seamons, Nalini Venkasubramanian
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Performing sensitive online transactions using computers found in cybercafés and public libraries is risky. The untrusted nature of these machines creates a target rich environment. A simple keystroke logger, a common payload of many viruses, records and transmits the secret information (e.g., passwords, credit card numbers, PIN numbers) entered into these machines. In addition, sophisticated malware can hijack a user's authenticated session to perform unauthorized transactions masquerading as the user. This paper presents Delegate, a proxy-based architecture that enables a user to access web sites without disclosing personal information to untrusted machines. Delegate enforces rules at the proxy to detect and prevent session hijacking. This architecture leverages users' trusted mobile devices, e.g., cell phones, and requires no modification to web servers or the untrusted machines. Delegate is designed to provide a balance between security and usability.
Efficient Handling of Changes in Dynamic Workflow Systems
Authors: Waleed W. Smari, Sirisha Donepudi, Seung-yun Kim, William K. McQuay
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

Workflow systems have been used in collaborative environments for many years to assist individuals and organizations to organize project executions and carry out work sequences. Two conflicting goals are argued in the literature regarding workflow systems: the need to provide efficient flexibility in terms of capabilities to handle changing situations and the need for control without creating high overhead. For this reason, current research in workflow systems concentrates primarily on making the workflows flexible to changes in processes. In this paper, we present an approach to handle changes in dynamic workflow systems. First, we introduce efficient change handling algorithms that will incorporate certain modifications that must be made in the current workflow, and based on the results, a new workflow will be generated accordingly. Then we introduce a case study to validate our algorithms. Finally, we simulate and compare the proposed algorithms with existing ones to show the level of improvement that can be achieved.
Immersive video as a rapid prototyping and evaluation tool for mobile and ambient applications
Authors: Pushpendra Singh, Hai Nam Ha, Zhiwen Kuang, Patrick Olivier, Christian Kray, Phil Blythe, Phil James
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

A key issue in mobile and ambient computing is the effort required to rapidly prototype and evaluate user interfaces and applications. Existing technologies for these tasks suffer either from low fidelity (e.g. paper prototypes, mental walkthroughs) or effectively require a near full-scale deployment. We propose an approach using immersive video with surround sound and a simulated infrastructure to create a very realistic environment in the office or the lab. It provides a low-cost and rapid means to prototype user interfaces and applications, and to evaluate them in a realistic simulation of the context, in which they are intended to be used.
Autonomic Management of Stream Processing Applications via Adaptive Bandwidth Control
Authors: Dimitrios Pendarakis, Jeremy Silber, Laura Wynter
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

We present a novel autonomic control system for high performance stream processing systems. The system uses bandwidth controls on incoming or outgoing streams to achieve a desired resource utilization balance among a set of concurrently executing stream processing tasks. We show that CPU prioritization and allocation mechanisms in schedulers and virtual machine managers are not sufficient to control such I/O-centric applications, and present an autonomic bandwidth control system that adaptively adjusts incoming and outgoing traffic rates to achieve system management goals. The system dynamically learns the bandwidth rate necessary to meet the system management goals using stochastic nonlinear optimization, and detects changes in the stream processing applications that require bandwidth adjustment. Our prototype Linux implementation is lightweight, has low overhead, and is capable of effectively managing stream processing applications.
Fast Buffer Memory with Deterministic Packet Departures
Authors: Mayank Kabra, Siddhartha Saha, Bill Lin
Venue: Proceedings of the 14th IEEE Symposium on High-Performance Interconnects (2006)

High-performance routers need to store temporarily a large number of packets in response to congestion. DRAM is typically used to implement the needed packet buffers, but DRAM devices are too slow to match the bandwidth requirements. To bridge the bandwidth gap, a number of hybrid SRAM/DRAM packet buffer architectures have been proposed [7]-[10]. These packet buffer architectures assume a very general model where the buffer consists of many logically separated FIFO queues that may be accessed in random order. For example, virtual output queues (VOQs) are used in crossbar routers, where each VOQ corresponds to a logical queue corresponding to a particular output. Depending on the scheduling algorithm used, the access pattern to these logical queues may indeed be at random. However, for a number of router architectures, this worst-case random access assumption is unnecessary since packet departure times are deterministic. One architecture is the switch-memory-switch router architecture [3], [4] that efficiently mimics an output queueing switch. Another architecture is the load-balanced router architecture [1], [2] that has interesting scalability properties. In these architectures, for best-effort routing, the departure times of packets can be deterministically calculated before inserting packets into packet buffers. In this paper, we describe a novel packet buffer architecture based on interleaved memories that takes advantage of the known packet departure times to achieve simplicity and determinism. The number of interleaved DRAM banks required to implement the proposed packet buffer architecture is independent of the number of logical queues, yet the proposed architecture can achieve the performance of an SRAM implementation.
Self-Similar Property for TCP Traffic under the Bottleneck Bandwidth Restrainment
Authors: Takuo Nakashima
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

The scale-invariant burstiness or self-similarity has been found in real network. Relation between self-similarity and network and/or system parameter is mainly discussed in the context of application layer, and this self-similarity is caused by the file size of Web servers or the duration of user sessions. In addition, self-similar burstiness has been characterized by the transport layer protocol. Traffic dynamics, however, are mainly generated by physical conditions such as the resource restrainment. In this paper, we have investigated self-similar property for TCP traffic under the bandwidth restrainment to make the network parameter vary using the network simulator. After analyzing the simulated results, following properties were extracted. Firstly, the packet loss rate at the boundary of releasing the restriction of bottleneck bandwidth suddenly drops from 10% to 1%. Secondly, estimated Hurst parameter depicts unstable fluctuation at over 4% packet loss rate, with linear slope at under 4% packet loss rate.
Adaptive Learning Objects Sequencing for Competence-Based Learning
Authors: Pythagoras Karampiperis, Demetrios Sampson
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Lifelong learning refers to the activities people perform throughout their life to improve their competence in a particular field. Although adaptive educational hypermedia systems (AEHS) bare the potential to provide personalized learning experiences based on individual's knowledge, skills, and competencies, so far they have been confined in the provision of knowledge resources that are adaptively selected based on the structure of concepts a domain model. In this paper, we address the problem of designing adaptive educational hypermedia systems for supporting lifelong competence development. To this end, we propose an alternative to the traditional subject domain specific design approach which is based on the use of competence description ontology and learner's competence records.
Continuous feedback control for scleronomous mechanical systems
Authors: I. M. Ananievski
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

A problem of designing a feedback control for a Lagrangian scleronomous mechanical system is considered. The control forces are assumed to be bounded and the system undergoes uncontrolled disturbances. The continuous feedback control is constructed which drives the system to a prescribed terminal state in a finite time. The proposed algorithm employs a linear feedback control with the gains, which are functions of the phase variables. The gains increase and tend to infinity as the phase variables tend to zero; nevertheless, the control forces are bounded and meet the imposed constraint. The approach developed is based on Lyapunov's direct method. 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
Investigating How to Group Students based on their Learning Styles
Authors: Maria Grigoriadou, Kyparisia Papanikolaou, Evangelia Gouli
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This study involved 21 students who constructed individual and group concept maps on the central concept of "Computer Storage Units". The purpose of the study was to investigate how learning styles and knowledge influence group collaboration.
A Hierarchical Memory Model for Conscious and Unconscious Mental Processes
Authors: Roseli S. Wedemann, Luis Alfredo Vidal de Carvalho, Raul Donangelo
Venue: Proceedings of the Ninth Brazilian Symposium on Neural Networks (2006)

We proposed a mechanism in [1] whereby neurotic behavior may be understood as an associative memory process in the brain, and the symbolic associative process involved in psychoanalytic working-through can be mapped onto a corresponding process of reconfiguration of the neuronal network. Memory was modeled by a Boltzmann machine represented by a complete graph, as a first approximation. However, it is known that brain neuronal topology is selectively structured and here, we further develop the memory model by including known microscopic mechanisms that control synaptic properties, showing that the network self organizes to a hierarchical, clustered structure. We propose a memory organization where two modules corresponding to sensorial and declarative memory interact, producing sensorial and symbolic activity, representing unconscious and conscious mental processes. The model is illustrated through a computer simulation, where we show some mathematical properties of the resulting complex network.
From random matrices to quasi-periodic Jacobi matrices via orthogonal polynomials
Authors: L. Pastur
Venue: Journal of Approximation Theory (2006)

We present an informal review of results on asymptotics of orthogonal polynomials, stressing their spectral aspects and similarity in two cases considered. They are polynomials orthonormal on a finite union of disjoint intervals with respect to the Szegö weight and polynomials orthonormal on R with respect to varying weights and having the same union of intervals as the set of oscillations of asymptotics. In both cases we construct double infinite Jacobi matrices with generically quasi-periodic coefficients and show that each of them is an isospectral deformation of another. Related results on asymptotic eigenvalue distribution of a class of random matrices of large size are also shortly discussed.
Towards Database Firewall: Mining the Damage Spreading Patterns
Authors: Kun Bai, Peng Liu
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Access control and integrity constraints are well known approaches to ensure data integrity in commercial database systems. However, due to operational mistakes, malicious intent of insiders or vulnerabilities exploited by outsiders, data stored in a database can still be compromised. When the database is under an attack, rolling back and re-executing the damaged transactions are the most used mechanisms during system recovery. This kind of mechanism either stops (or greatly restricts) the database service during repair, which causes unacceptable availability loss or denial-of- service for mission critical applications, or may cause serious damage spreading during on-the-fly recovery where many clean data items are accidentally corrupted by legitimate new transactions. To resolve this dilemma, we devise a novel mechanism, called database firewall in this paper. This firewall is designed to protect good data from being corrupted due to damage spreading. Pattern mining and Bayesian network techniques are adopted in the framework to mine frequent damage spreading patterns and to predict the data integrity in the face of attack. Our approach provides a probability based strategy to estimate the data integrity on the fly. With this feature, the database firewall is able to enforce a policy of transaction filtering to dynamically filter out the potential spreading transactions.
Diagnosis of delay faults due to resistive bridges, delay variations and defects
Authors: Lei Wang, Sandeep K. Gupta, Melvin A. Breuer
Venue: Proceedings of the 15th Asian Test Symposium (2006)

In this paper, we present the first diagnosis algorithm for combinational circuit blocks that considers all combinations of multiple gate/wire delay variations/defects and any single resistive bridge. One key component of the proposed algorithm is a new path-oriented effect-cause procedure to identify all possible suspects of above type that might have caused the timing errors observed during test. The second key component is an efficient data structure to represent the suspects. The third key component is a new algorithm to analyze passing tests to vindicate some of the suspects identified. This algorithm exploits the newly identified concept of fixed-but-unknown delays, i.e., the fact that during the period of diagnosis the values of all delay parameters for every gate and wire in the particular circuit under test remain fixed, although at values unknown to us. The final set of suspects reported by the algorithm is guaranteed to contain all possible causes of the observed timing errors. Experimental results on benchmark circuits show the effectiveness of the proposed approach.
Component-Oriented Radars with Probabilistic Timing Guarantees
Authors: Chin-Fu Kuo Ya-Shu Chen Tei-Wei Kuo, Phone Lin
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

In recent years, many modern phased-array radars are built with commercial off-the-shelf components, and the functions of many hardware components are also reimplemented by software modules. In such systems, radar tasks could be modeled as distributed real-time tasks which require end-to-end deadline guarantees and have precedence constraints. Different from most previous work on either algorithms with restrictions in resource utilization or heuristics without analytical ways for schedulability guarantees, the objective of this paper is to propose a joint real-time scheduling algorithm for both transmitter/receiver and signal processor workloads with an analytical framework for offline probabilistic analysis and online admission control. The strength of our approach is verified by analysis results and a series of experiments based on a real phased-array radar for air defense frigates [CHECK END OF SENTENCE].
Effects of watermark and music on mobile message advertisements
Authors: Pei-Luen Patrick Rau, Duye Chen
Venue: International Journal of Human-Computer Studies (2006)

The development of mobile telecommunication has made breakthrough advances in recent years. Compared to the Internet, mobile telecommunications has anywhere, anytime and always online characteristics. As growth in the Internet advertising market continues, mobile advertising has attracted attention. In this research, the effectiveness of two types of mobile message advertisements, watermarks and music are studied and compared. Two experiments were carried out to test four proposed hypotheses. The independent variable in experiment 1 was the watermark transparency (20%, 40% and 60%). The independent variable in experiment 2 was the music format with five levels: no music, vocal and instrumental version at high volume, vocal and instrumental version at low volume, instrumental version at high volume and instrumental version at low volume. The results showed that the watermarks transparency and format were effective in mobile advertising. The 60% watermark was found better than the 20% and 40% watermarks. The 40% watermark was found better than the 20% watermark for advertisement recall only. Music and vocal/instrumental music versions were effective in mobile advertisements. The vocal music version was found effective in mobile advertising. Music with both vocal and instrumental versions was more effective in advertisement recall than instrumental music for mobile device users.