ppxscal/embedding_network huggingface dataset:
A Modeling Methodology and Pre-Run-Time Scheduling for Embedded Real-Time Software
Authors: Raimundo Barreto, Paulo Maciel, Sérgio Cavalcante
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

One of the most intricate problem in the synthesis of realtime systems is the scheduling. This paper presents a formal modeling methodology based on time Petri nets (TPN) and a framework for application-specific scheduler synthesis. Finding a feasible scheduling is not an easy task because this problem, in its general form, is NP-hard. The method proposed in this paper finds a scheduling, whether one exists, using state space exploration. The problem withthis approach is the space size, which can be very large for medium to large systems. This paper shows how to minimize this problem using behavior restrictions at system modeling, and a partial-order reduction method. Additionally, the algorithm proposed for .nding a feasible schedule uses a depth-first search based method. Therefore, states are only generated if strictly necessary. It is verified through real-world experimental results that a schedule is found examining a reduced number of states .
A Language Technology Toolset for Development of a Large Group Augmented Facilitation System
Authors: Mark Adkins, John Kruse, Robert Younger
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 1 - Volume 1 (2004)

Facilitating large groups of people distributed around the globe is challenging from a technological, social psychological, and communication perspective. From a technological standpoint information systems are required to connect individuals though firewalls, time zones, cultures, languages, etc. Then the systems must allow sense to be made from huge numbers of interactions in a timely manner so that large groups can make effective decisions. Ideally the large group decisions will be based on valid information that leads to free and informed choices so the group has an internal commitment to the decision. This paper explains a conceptual framework on how technology and the facilitation processes can be melded to support effective interaction in large, distributed groups of 50 to 5000 individuals. We provide an approach for the development of a complete system to augment the human facilitator. This system would first scan inputs for inconsistencies with the rules then engage the participant in an activity to modify the input to be consistent with the TSF ground rules. Then the inputs are clustered with similar inputs and automatically summarized for the group and the facilitator. At this point group members can continue to contribute to the clusters, which are continuously re-summarized and distributed to the group. Meanwhile, the facilitator is developing a dynamic document of the groups' interactions, behavior, progress and potential conclusions. As the meeting progresses the facilitator will modify processes to focus the group toward reaching conclusions on the cluster summaries. As with small, face-to-face meetings, the goal is to enable the group to reach a decision with appropriate or required levels of commitment from the group members. The functional elements of technology are currently available and have been integrated into robust systems for other applications. Adapting these functional components to a different domain such as group facilitation is feasible with a limited investment.
Retrospective data collection and analytical techniques for patient safety studies
Authors: Matthew B. Weinger, Jason Slagle, Sonia Jain, Nelda Ordonez
Venue: Journal of Biomedical Informatics (2003)

To enhance patient safety, data about actual clinical events must be collected and scrutinized. This paper has two purposes. First, it provides an overview of some of the methods available to collect and analyze retrospective data about medical errors, near misses, and other relevant patient safety events. Second, it introduces a methodological approach that focuses on non-routine events (NRE), defined as all events that deviate from optimal clinical care. In intermittent in-person surveys of anesthesia providers, 75 of 277 (27%) recently completed anesthetic cases contained a non-routine event (98 total NRE). Forty-six of the cases (17%) had patient impact while only 20 (7%) led to patient injury. In contrast, in the same hospitals over a two-year period, we collected event data on 135 cases identified with traditional quality improvement processes (event incidence of 0.7-2.7%). In these quality improvement cases, 120 (89%) had patient impact and 74 (55%) led to patient injury. Preliminary analyses not only illustrate some of the analytical methods applicable to safety data but also provide insight into the potential value of the non-routine event approach for the early detection of risks to patient safety before serious patient harm occurs.
Optimal polyform domain decomposition
Authors: Winston Chuen-Shih Yang
Venue:  (2003)

Efficiently utilizing parallel processors requires both load-balancing (giving each processor the same number of jobs) and minimizing the interprocessor communication (sharing data between jobs in different processors can slow down the system). This thesis considers mainly domain decomposition via polyforms, in which each job has to communicate with at most 3, 4, or 6 neighboring jobs, these are the triangle, square, and hexagon cases, respectively. The triangle case arises in finite element problems, the square case arises in relational databases and finite difference schemes for solving partial differential equations, and the hexagon case arises in hydrocarbons in chemistry. To model this job assignment problem, this thesis adopts a geometric viewpoint in which a job corresponds to a shape (triangle, square, or hexagon), the set of jobs is a domain comprised of these shapes, the set of jobs assigned to a processor is a subdomain (polyform), and interprocessor communication is modeled by the total subdomain perimeter, which corresponds to the total number of neighboring jobs assigned to different processors. The combinatorial and integer programming techniques in this thesis apply to all of the triangle, square, and hexagon cases. These techniques are based on a geometric viewpoint and yield theoretical results that provide optimal (minimum-perimeter) polyforms and corresponding lower bounds on the amount of interprocessor communication, as well as tiling-based algorithms that have an asymptotic optimality property: the ratio of the total subdomain perimeter to the lower bound (which corresponds to the limiting case in which all subdomains have minimum perimeter) tends to 1 for problems of increasing size whose parameters have a fixed ratio.
High-order collocation and quadrature methods for some logarithmic kernel integral equations on open arcs
Authors: Víctor Domínguez
Venue: Journal of Computational and Applied Mathematics (2003)

This paper is devoted to the solution of the Dirichlet problem for the Laplace and Helmholtz equation in the complement of a smooth open curve in the plane. The solution is looked for as a single-layer potential, the corresponding density being therefore the solution of an integral equation on the open arc. This equation is transformed into an equivalent 1-periodic integral equation having existence and uniqueness of solution for any periodic data. Here we study the use of collocation and quadrature methods for solving this equation. We show the convergence of both methods and prove the existence of an asymptotic expansion of the error in powers of the discretization parameter. As a consequence we show that for some of them a superconvergence phenomenon occurs when computing the solution of the differential problem. Two numerical experiments are shown in order to illustrate the theoretical results introduced in this work.
Power-aware QoS Management in Web Servers
Authors: Vivek Sharma, Arun Thomas, Tarek Abdelzaher, Kevin Skadron, Zhijian Lu
Venue: Proceedings of the 24th IEEE International Real-Time Systems Symposium (2003)

Power management in data centers has become an increasinglyimportant concern. Large server installations aredesigned to handle peak load, which may be significantlylarger than in off-peak conditions. The increasing cost ofenergy consumption and cooling incurred in farms of high-performanceweb servers make low-power operation duringoff-peak hours desirable. This paper investigates adaptivealgorithms for dynamic voltage scaling in QoS-enabled webservers to minimize energy consumption subject to servicedelay constraints. We implement these algorithms inside theLinux kernel. The instrumented kernel supports multipleclient classes with per-class deadlines. Energy consumptionis minimized by using a feedback loop that regulatesfrequency and voltage levels to keep the synthetic utilization1 around the aperiodic schedulability bound derived inan earlier publication. Enforcing the bound ensures thatdeadlines are met. Our evaluation of an Apache server runningon the modified Linux kernel shows that non-trivial off-peakenergy savings are possible without sacrificing timeliness.
An experimental LISP system for the SPERRY UNIVAC 1100 Series
Authors: Roger M. Firestone
Venue: ACM SIGPLAN Notices (1980)

An experimental LISP system has been developed for use on SPERRY UNIVAC 1100 Series computers. Although the general design of the system is fairly traditional, a number of extensions have been made to the customary nucleus which significantly improve the ease of use of the language. These extensions include external environment modifications as well as new internal functions. Some concepts have also been borrowed from other programming languages, as well. Because 1100 Series LISP does not contain a compiler, considerable attention has been given to the efficient use of computing resources, and some of the extensions are designed with more efficient utilization as the primary objective. Finally, some of the extensions were compelled to exist by the inherent logical structure of the LISP language, and their introduction into other LISP systems can be recommended.
How to prioritize information systems selection decisions under time pressure
Authors: D. C. McDermid
Venue: Business strategies for information technology management (2003)

This chapter reports on an action research study that used the Strategic Choice method. This method was used to support the prioritization of information systems with respect to enhancing these systems within a public sector health department. Such decisions are notoriously complex, fuzzy, time-consuming and political for stakeholders. The results of this study indicate that the Strategic Choice method offers the potential to reduce time commitment for stakeholders in a satisfactory manner.
In-Place Differential File Compression of Non-Aligned Files With Applications to File Distribution, Backups, and String Similarity
Authors: Dana Shapira, James A. Storer
Venue: Proceedings of the Conference on Data Compression (2004)

We consider in-place differential file compression; that is, compressing a file T of sizen with respect to an existing file S of size m, where decompression is in-place by overwriting Swith T, using at most MAX(m,n)+O(1) space. In previous work we presented the IPSW algorithm (In-Place Sliding Window). IPSW is fast and the compression achieved compares well with other existing methods, including those that are not in-place. IPSW is most effective when S and T arereasonably well aligned (most large common substrings occur in approximately the same order).Here we present a preprocessing step for string alignment that can be employed when the encoder determines significant gains will be achieved.
FPV: fast protein visualization using Java 3D&trade;
Authors: Tolga Can, Yujun Wang, Yuan-Fang Wang, Jianwen Su
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

We have developed a protein visualization system based on Java 3D&trade;. Java 3D provides compatibility among different systems and enables applications to be run remotely through web browsers. However, using Java 3D for visualization has some performance issues with it. The primary concerns about molecular visualization tools based on Java 3D are in their being slow in terms of interaction speed and in their inability to load large molecules. This behavior is especially apparent when the number of atoms to be displayed is huge, or when several proteins are to be displayed simultaneously for comparison. In this paper we present techniques for organizing a Java 3D scene graph to tackle these problems. We demonstrate the effectiveness of these techniques by comparing the visualization component of our system with two other Java 3D based molecular visualization tools. In particular, for van der Waals display mode, with the efficient organization of the scene graph, we could achieve up to eight times improvement in rendering speed and could load molecules three times as large as the previous systems could.
Blocking behaviors of crosstalk-free optical Banyan networks on vertical stacking
Authors: Xiaohong Jiang, Hong Shen, Md. Mamun-ur-Rashid Khandker, Susumu Horiguchi
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Banyan networks are attractive for constructing directional coupler (DC)-based optical switching networks for their small depth and self-routing capability. Crosstalk between optical signals passing through the same DC is an intrinsic drawback in DC-based optical networks. Vertical stacking of multiple copies of an optical banyan network is a novel scheme for building nonblocking (crosstalk-free) optical switching networks. The resulting network, namely vertically stacked optical banyan (VSOB) network, preserves all the properties of the banyan network, but increases the hardware cost significantly. Though much work has been done for determining the minimum number of stacked copies (planes) required for a nonblocking VSOB network, little is known on analyzing the blocking probabilities of VSOB networks that do not meet the nonblocking condition (i.e., with fewer stacked copies than required by the nonblocking condition). In this paper, we analyze the blocking probabilities of VSOB networks and develop their upper and lower bounds with respect to the number of planes in the networks. These bounds depict accurately the overall blocking behaviors of VSOB networks and agree with the conditions of strictly nonblocking and rearrangeably nonblocking VSOB networks respectively. Extensive simulation on a network simulator with both random routing and packing strategy has shown that the blocking probabilities of both strategies fall nicely within our bounds, and the blocking probability of packing strategy actually matches the lower bound. The proposed bounds are significant because they reveal the inherent relationships between blocking probability and network hardware cost in terms of the number of planes, and provide network developers a quantitative guidance to trade blocking probability for hardware cost. In particular, our bounds provide network designers an effective tool to estimate the minimum and maximum blocking probabilities of VSOB networks in which different routing strategies may be applied. An interesting conclusion drawn from our work that has practical applications is that the hardware cost of a VSOB network can be reduced dramatically if a predictable and almost negligible nonzero blocking probability is allowed.
Stackelberg Scheduling Strategies
Authors: Tim Roughgarden
Venue: SIAM Journal on Computing (2004)

We study the problem of optimizing the performance of a system shared by selfish, noncooperative users. We consider the concrete setting of scheduling small jobs on a set of shared machines possessing latency functions that specify the amount of time needed to complete a job, given the machine load. We measure system performance by the total latency of the system. Assigning jobs according to the selfish interests of individual users, who wish to minimize only the latency that their own jobs experience, typically results in suboptimal system performance. However, in many systems of this type there is a mixture of "selfishly controlled" and "centrally controlled" jobs. The congestion due to centrally controlled jobs will influence the actions of selfish users, and we thus aspire to contain the degradation in system performance due to selfish behavior by scheduling the centrally controlled jobs in the best possible way.We formulate this goal as an optimization problem via Stackelberg games, games in which one player acts a leader (here, the centralized authority interested in optimizing system performance) and the rest as followers (the selfish users). The problem is then to compute a strategy for the leader (a Stackelberg strategy) that induces the followers to react in a way that (approximately) minimizes the total latency in the system.In this paper, we prove that it is NP-hard to compute an optimal Stackelberg strategy and present simple strategies with provably good performance guarantees. More precisely, we give a simple algorithm that computes a strategy inducing a job assignment with total latency no more than a constant times that of the optimal assignment of all of the jobs; in the absence of centrally controlled jobs and a Stackelberg strategy, no result of this type is possible. We also prove stronger performance guarantees in the special case where every machine latency function is linear in the machine load.
Fitness computer game with a bodily user interface
Authors: Sari Mokka, Antti Väätänen, Juhani Heinilä, Pasi Välkkynen
Venue: Proceedings of the second international conference on Entertainment computing (2003)

The experience players get from playing a computer game depends on how well the story and the action can capture players attention. Sometimes people immerse to the game environment so strongly that they forget their actual physical surroundings and feel as they are part of the game environment. In the Virku (Virtual Fitness Centre) research project we developed a fitness computer game which aims at making the exercise session more motivating and rich in experiences. The user is exercising while he is exploring new surroundings or playing a fitness game in VE. In Virku the VE is generated from map information. The bodily user interface was selected because it seems that it can add to users sense of presence and it is suitable for exercising purposes. The Virku interface is a combination of an exercise bicycle, a computer and a screen. Nine users pilot-tested the fitness game.
Cooperative Control of a 3D Dual-Flexible-Arm Robot
Authors: Mitsuhiro Yamano, Jin-Soo Kim, Atsushi Konno, Masaru Uchiyama
Venue: Journal of Intelligent and Robotic Systems (2004)

This paper discusses cooperative control of a dual-flexible-arm robot to handle a rigid object in three-dimensional space. The proposed control scheme integrates hybrid position/force control and vibration suppression control. To derive the control scheme, kinematics and dynamics of the robot when it forms a closed kinematic chain is discussed. Kinematics is described using workspace force, velocity and position vectors, and hybrid position/force control is extended from that on dual-rigid-arm robots. Dynamics is derived from constraint conditions and the lumped-mass-spring model of the flexible robots and an object. The vibration suppression control is calculated from the deflections of the flexible links and the dynamics. Experiments on cooperative control are performed. The absolute positions/orientations and internal forces/moments are controlled using the robot, each arm of which has two flexible links, seven joints and a force/torque sensor. The results illustrate that the robot handled the rigid object damping links' vibration successfully in three-dimensional space.
G2ST: a novel method to transform GML to SVG
Authors: Zhimao Guo, Shuigeng Zhou, Zhengchuan Xu, Aoying Zhou
Venue: Proceedings of the 11th ACM international symposium on Advances in geographic information systems (2003)

Geography Markup Language (GML) has been adopted as de facto standard for geo-referenced information storing and exchanging, while Scalable Vector Graphics (SVG), also a W3C-recommended XML standard, is appearing as an ideal format for rendering maps. Usually, Extensible Stylesheet Language Transformations (XSLT) is used to transform GML documents toSVG documents. Considering the complexity and variety of GML documents, however, designing XSLT rules is not a easy task; even worse, such a method cannot guarantee that the generated SVG document is valid. In this paper, we present a novel method to transform GML documents to SVG documents, while guaranteeing that the result SVG documents conform to a certain DTD or Schema pre-specified by the users. With this new method, it is convenient for the users to construct transformation rules from GML to SVG guided by the pre-specified SVG DTD or schema. We propose three algorithms to implement the new method. We also build a prototype and conduct preliminary experiments, which validate the effectiveness of the new method.
A Mechanism for Restorable QoS Routing
Authors: Hongxia Long, Subin Shen
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Fault tolerance and path restorability are recognized as other facets of QoS routing. In this article we propose a relatively integrated mechanism for restorable QoS routing by using an enhanced Hello protocol and describe its working processes in detail. In addition, we also simulate the mechanism to show its availability. We conclude that we can add some intelligence to the communication networks by utilizing this mechanism.
The portable computer in the classroom
Authors: Charles Haspel
Venue: ACM SIGCUE Outlook (1978)

A portable computer and a higher level language allow comprehensive, dynamic and easily modifiable classroom demonstrations. The IBM 5100 computer with APL is such a combination. This paper describes the use of this combination of computer and language to demonstrate aspects of queueing and formal grammars. In each case the area is briefly described and the demonstration illustrated and explained with emphasis on the human factors that go into making it effective.The cheif advantage obtained is that students' questions which fall outside prepared material can be answered and illustrated by suitably modified demonstrations.
MetaSon &num;5 Skruv Stockholm: turning schizophonic sound into audiovirtual image
Authors: Hans U. Werner
Venue: Organised Sound (2002)

Schizophonic soundscapes in Murray Schafer's critical acoustic ecology mean a split between listening and seeing, between space and place, between audience and communicator. His idea of a gap between senses is based on electronic media like radio and telephone, but it gains new actuality in modern (multimedia) times. The new technology and its users have too experimented with the creative inversion of schizophony in sound and vision. Film sound design and film music combine sound in and out of context, composition works with contrapunctual audiovisions; video art and sound art, as in the work of Robert Cahen, combine and mix genres of all kinds and senses. MetaSon &num;5 Skruv Stockholm is an audiovisual soundwalk, based on soundscape recordings in Sweden in the 1970s and 1990s, combined with associative pictures and designs, each in its own rhythms and times. It consists less of the common meaning both share, being more dependent on the fluidity and dynamic of the relationship between the elements. Sound and image create an intermedium, intermodal space neither of which could project alone. From moment to moment, schizophonic montage and idea invert into a fresh, maybe evocative look at the way we perceive, where the audio flow transforms stable pictures into liquid forms, where image follows sound and is treated like sound.