ppxscal/embedding_network huggingface dataset:
Integrating Hard/Soft Real-Time Tasks and Best-Effort Jobs on Multiprocessors
Authors: Bjorn B. Brandenburg, James H. Anderson
Venue: Proceedings of the 19th Euromicro Conference on Real-Time Systems (2007)

We present a multiprocessor scheduling framework for integrating hard and soft real-time tasks and best-effort jobs. This framework allows for full system utilization, and ensures that hard real-time deadlines are met and that deadline tardiness is bounded for soft real-time tasks. Dynamic slack reclamation is employed to reduce tardiness and to improve the response time of best-effort jobs. The approach is validated using an implementation within the Linux kernel.
Student teams and jigsaw techniques in an undergraduate CSE project course
Authors: J. Burkhardt
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The use of jigsaw techniques in a multidisciplinary, project-oriented, introductory computational science and engineering course is described. The course revolves around the study and completion of four projects, each devised and taught by a team of faculty drawn from several departments. This paper discusses the execution of a single project in the course and the use of a jigsaw team structure in its execution. Jigsaw techniques are implemented by forming project teams composed of members with designated areas of expertise. Project team members with common areas of expertise are then formed into secondary expert teams. The project team maintains responsibility for completion of the project while the expert teams are responsible for mastering their designated areas as well as developing a strategy for teaching the members of their project team what they have learned. All students are evaluated equally in each area of expertise. The effectiveness of the jigsaw technique is determined through the use of peer, group, and individual assessment.
X.500 Type Databases For Flexible and Highly Available Common and Logically Centralized User Data Storage in Telecommunication
Authors: W. Haidegger
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

This paper discusses the technical background and advantages of deploying a centralized user database as a general repository for network and management applications. Central focus will be the fact that the user data need to be highly available. The paper shows how the principles of distributed systems can be used to provide a database, which is common to all applications needing user data and whose distribution is transparent for these applications. The author then proves that databases built according to the principles described by ITU-T's Recommendations for Directory Services allow for a non proprietary implementation of the centralized user database described above.
Self-Inspection Mechanisms for the Support of Autonomic Decisions in Internet-Based Systems
Authors: Mauro Andreolini, Sara Casolari, Michele Colajanni
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Any autonomic system must implement mechanisms to automatically capture the most significant information about the internal state and also adapt the monitoring system to internal and external conditions. We refer to these activities as self-inspection and we consider them in the context of Internet-based services that are subject to workloads characterized by burst arrivals and heavy-tailed distributions. The large majority of the mechanisms driving these systems must take fast decisions on the basis of past and/or present load conditions of the system resources. In this context, self-inspection requires an adequate representation of the load behavior of the system resources that makes it possible to perform good actions under soft real-time constraints. In this paper, we show through a large set of experiments the need of basing load analyses and decisions on linear and non-linear models, such as the Exponential Moving Average and the 90-percentile models. All the considered models are applied to a multi-tier Web-based system that is instrumented with suitable self-inspection mechanisms at operating system level. However, the results can be extended to other Internet-based contexts where the systems are characterized by similar workload and resource behaviors.
Incorporating study skills in a freshman engineering course
Authors: A. Stiller, W. Venable, R. McConnell
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Freshman engineering at West Virginia University is being revised. Our long standing commitment to design projects is retained, but goals are changing to include greater use of mathematics and computers and emphasis on college survival skills. Survival skills am divided into two areas: personal study habits and group study. A poll was taken of seniors, asking how much time they had spent on freshman courses. The same survey was given to the freshmen. The results were presented to the freshmen. Students wrote a schedule of classes and amusement time and the remaining time was discussed. We tried to help students decide how to use time efficiently. We reviewed the study habits of successful people, and note taking and homework exercises were discussed. Teaching styles, the utility of "old tests", preparation for tests, and test taking skills were reviewed. The engineering reliance on team work was discussed. Students were organized into study groups, and group study sessions were planned. The group concept as reinforced by the faculty throughout the course. Math homework was assigned to be done by the groups. Quizzes were given where the grade depends upon the group score. At this point, the results are primarily anecdotal. They appear to show the value of group study. Simple instruction in study skills by itself did nor produce the same success which was accomplished by the group activities m e conclude that reaching "how to study" is not as effective as teaching group study. Thus the focus should not be on simply teaching study skill but rather in teaching group study habits and enforcing this group activity.
On the structure of 1-designs with at most two block intersection numbers
Authors: John Arhin
Venue: Designs, Codes and Cryptography (2007)

We introduce the notion of an unrefinable decomposition of a 1-design with at most two block intersection numbers, which is a certain decomposition of the 1-designs collection of blocks into other 1-designs. We discover an infinite family of 1-designs with at most two block intersection numbers that each have a unique unrefinable decomposition, and we give a polynomial-time algorithm to compute an unrefinable decomposition for each such design from the family. Combinatorial designs from this family include: finite projective planes of order n; SOMAs, and more generally, partial linear spaces of order (s, t) on (s + 1)2 points; as well as affine designs, and more generally, strongly resolvable designs with no repeated blocks.
Semantic Dependencies and Modularity of Aspect-Oriented Software
Authors: Alberto Costa Neto, Marcio de Medeiros Ribeiro, Marcos Dosea, Rodrigo Bonifacio, Paulo Borba, Sérgio Soares
Venue: Proceedings of the First International Workshop on Assessment of Contemporary Modularization Techniques (2007)

Modularization of crosscutting concerns is the main benejtprovided by Aspect-Oriented constructs. In order to rigorously assess the overall impact of this kind of modularization, we use Design Structure Matrixes (DSMs) to analyze different versions (00 and AO) of a system. This is supported by the concept of semantic dependencies between classes and aspects, leading to a more faithful notion of coupling for A0 systems. We also show how design rules can make those dependencies explicit and, consequently, yield a more modular design.
Token-mediated certification and electronic commerce
Authors: Daniel E. Geer,  Jr., Donald T. Davis
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

Public key technology presumes the availability of certificates and certifying authorities (CAs) living within a shallow hierarchy rooted at a few (n ≪ 100) public CAs. We propose an alternative that lessens the day-today dependence on centralized CAs while deepening the certificate tree. We do this by suggesting that smartcards provide CA functions, thus re-framing some payment problems as simpler authorization problems.
Dynamic memory management with garbage collection for embedded applications
Authors: Roberto Brega, Gabrio Rivera
Venue: Proceedings of the 1st conference on Industrial Experiences with Systems Software - Volume 1 (2000)

A software system can be called a safe-system with respect to memory, when it supports only strong-typing and it does not allow for the manual disposal of dynamic memory [2]. The first aspect guarantees that untyped, potentially dangerous operations are caught by the compiler or by run-time checks. The second issue is solved by the utilisation of an automatic memory reclamation scheme, i.e. a garbage collector. In this paper we argue that the careful choice of the programming language, along with an automatic memory reclamation scheme can optimise memory usage, while ensuring that many of the logical errors related to memory can be avoided.
Understanding data lifetime via whole system simulation
Authors: Jim Chow, Ben Pfaff, Tal Garfinkel, Kevin Christopher, Mendel Rosenblum
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

Strictly limiting the lifetime (i.e. propagation and duration of exposure) of sensitive data (e.g. passwords) is an important and well accepted practice in secure software development. Unfortunately, there are no current methods available for easily analyzing data lifetime, and very little information available on the quality of today's software with respect to data lifetime. We describe a system we have developed for analyzing sensitive data lifetime through whole system simulation called TaintBochs. TaintBochs tracks sensitive data by "tainting" it at the hardware level. Tainting information is then propagated across operating system, language, and application boundaries, permitting analysis of sensitive data handling at a whole system level. We have used TaintBochs to analyze sensitive data handling in several large, real world applications. Among these were Mozilla, Apache, and Perl, which are used to process millions of passwords, credit card numbers, etc. on a daily basis. Our investigation reveals that these applications and the components they rely upon take virtually no measures to limit the lifetime of sensitive data they handle, leaving passwords and other sensitive data scattered throughout user and kernel memory. We show how a few simple and practical changes can greatly reduce sensitive data lifetime in these applications.
Systems model for learning
Authors: P. Buriak, B. McNurlen, J. Harper
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Develops a model of learning that differs greatly from traditional or intuitive models. This hard system is specifically designed for the context of problem-solving/higher-order thinking, rather than automatic learning. Research in educational psychology and cognitive science provides the basis for the model. Learning is the integration of new knowledge/behaviors into a framework, and subsequently recalling what is relevant in the appropriate situation. To understand learning, we must consider how new information is received and the stages through which new information is processed as it progresses from immediate sensory experience to long-term storage. It is also important to understand how novices and experts organize, analyze or encode, and then retrieve necessary information. In this particular case, engineering students are the novices and engineering educators are the experts. Teaching consists of organizing, planning, delivering and evaluating the content of the subject area. Teaching problem-solving in science requires a deep understanding of the subject matter, as well as an appreciation of the characteristics of the students, of presentation skills, and of evaluation techniques. This study presents a soft systems model for the craft of teaching, and develops a hard systems model for the science of learning.
Enhancements to MatlabMPI: Easier Compilation, Collective Communication, and Profiling
Authors: Judy Gardiner, John Nehrbass, Juan Carlos Chaves, Brian Guilfoos, Stanley Ahalt, Ashok Krishnamurthy, Jose Unpingco, Alan Chalker, Siddharth Samsi
Venue: Proceedings of the HPCMP Users Group Conference (2006)

This paper provides a brief overview of several enhancements made to the MatlabMPI suite. MatlabMPI is a pure MATLAB code implementation of the core parts of the MPI specifications. The enhancements provide a more attractive option for HPCMP users to design parallel MATLAB code. Intelligent compiler configuration tools have also been delivered to further isolate MatlabMPI users from the complexities of the UNIX environments on the various HPCMP systems. Users are now able to install and use MatlabMPI with less difficulty, greater flexibility, and increased portability. Collective communication functions were added to MatlabMPI to expand functionality beyond the core implementation. Profiling capabilities, producing TAU (Tuning and Analysis Utility) trace files, are now offered to support parallel code optimization. All of these enhancements have been tested and documented on a variety of HPCMP systems. All material, including commented example code to demonstrate the usefulness of MatlabMPI, is available by contacting the authors.
A Note on Euclidean Ramsey Theory
Authors: James H. Schmerl
Venue: Discrete Computational Geometry (2007)

Suppose n &#x2265; 2 and $X,Y \subseteq {\Bbb R}^n$ are such that X is infinite and Y is the set of vertices of an n-simplex. Then there is blue/red coloring of ${\Bbb R}^n$ such that no set similar to X is monochromatically blue and no set similar to Y is monochromatically red.
PVS#: Streamlined Tacticals for PVS
Authors: Florent Kirchner, César Muòoz
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

The semantics of a proof language relies on the representation of the state of a proof after a logical rule has been applied. This information, which is usually meaningless from a logical point of view, is fundamental to describe the control mechanism of the proof search provided by the language. In this paper, we present a monadic datatype to represent the state information of a proof and we illustrate its use in the PVS theorem prover. We show how this representation can be used to design a new set of powerful tacticals for PVS, called PVS#, that have a simpler and clearer semantics compared to the semantics of standard PVS tacticals.
Multimedia-Aware Congestion Control for Video Streaming over the Internet
Authors: Thomas K. Yan, H. Peter Dommel
Venue: Proceedings of the Second International Conference on Digital Telecommunications (2007)

This paper presents congestion control protocols designed for use in video applications over the Internet. Such protocols should take video traffic characteristics into account while behaving in a friendly manner with respect to competing flows in the Internet. Building on the TEAR protocol, additional video traffic characteristics are taken into account by considering flows with variable packet sizes, a characteristic of video traffic due to the packetization and error-control schemes of video coding systems. Our experiments show our proposed protocols take more video traffic characteristics into account than TEAR while maintaining TEAR's TCP-friendliness.
Creating high performance web applications using Tcl, display templates, XML, and database content
Authors: Alex Shah, Tony Darugar
Venue: Proceedings of the 6th conference on Annual Tcl/Tk Workshop, 1998 - Volume 6 (1998)

We describe an online system that provides a framework for the rapid creation of high performance, database driven web sites based on content from XML files. The software that "glues" the content to the presentation is written in Tcl. The proposed architecture uses a pool of persistent Tcl engines to substantially improve performance and robustness as compared to traditional server-side programming techniques.
Worms vs. perimeters: the case for hard-LANs
Authors: N. Weaver, D. Ellis, S. Staniford, V. Paxson
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

Network worms - self-propagating network programs - represent a substantial threat to our network infrastructure. Due to the propagation speed of worms, reactive defenses need to be automatic. It is important to understand where and how these defenses need to fit in the network so that they cannot be easily evaded. As there are several mechanisms malcode authors can use to bypass existing perimeter-centric defenses, this position paper argues that substantial defenses need to be embedded in the local area network, thus creating "hard-LANs" designed to detect and respond to worm infections. When compared with conventional network intrusion detection systems (NIDSs), we believe that hard-LAN devices need to have two orders of magnitude better cost/performance, and at least two orders of magnitude better accuracy, resulting in substantial design challenges.
Inequalities and bounds for elliptic integrals
Authors: Haseeb Kazi, Edward Neuman
Venue: Journal of Approximation Theory (2007)

Computable lower and upper bounds for the symmetric elliptic integrals and for Legendre's incomplete integral of the first kind are obtained. New bounds are sharper than those known earlier. Several inequalities involving integrals under discussion are derived.
Extending the standard template library for parallelism in coir(futures)
Authors: Neelakantan Sundaresan
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

The Standard Template Library (STL) is a C++ implementation of the generic programming paradigm. Unlike in typical container class libraries, algorithms in this paradigm do not work directly on collection container objects. They work on iterators (access and traversal objects) exported by containers. Given N data types, M containers, and K algorithms as components of a software system, STL provides a mechanism - using C++ templates and the generic programming paradigm - to reduce the possibly N*M*K implementations to N+M+K implementations. Over the last decade significant research has been done in the area of object-oriented parallelism and a number of models, libraries, and language extensions have been proposed and implemented. C++ has been an important language for writing parallel libraries and for extending for parallelism. In this paper we discuss how the generic programming paradigm in STL can be used and extended to support parallel programming in a manner that allows good expressibility, code reuse, and extensibility of the library. We look at control and data-parallel abstractions. We also discuss how different strategies for work distribution in parallel algorithms can be supported in the spirit of generic programming. We describe the relevant abstractions in Coir〈Futures〉, our STL-based parallel C++ library for shared memory parallelism.
A model-driven design approach for mechatronic systems
Authors: Jinfeng Huang, Jeroen Voeten, Marcel Groothuis, Jan Broenink, Henk Corporaal
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

The software design is one of the most challenging tasks during the design of a mechatronic system. On one hand, it has to provide solutions to deal with concurrency and timeliness issues of the system. On the other hand, it has to glue different disciplines (such as software, control and mechanical) of the system as a whole. In this paper, we propose a model-driven approach to design the software part of a mechatronic system, which consists of two major parts: systematic modeling and correctness-preserving synthesis. The modeling stage is divided into four steps, which focus on different aspects (such as concurrency, multiple disciplines and timeliness) of the system respectively. In particular, we propose a set of handshake patterns to capture the concurrent aspect of the system. These patterns assist designers to build up an adequate top-level model efficiently. Furthermore, they separate the system into a set of concurrent components, each of which can be further refined independently. Subsequently, the multidisciplinary and realtime aspects of the system are naturally specified and analyzed in a series of refinements. After the important aspects of the system are specified and analyzed in a unified model, a software implementation is automatically synthesized from the model, the correctness of which is ensured by construction. The effectiveness of the proposed approach is illustrated by a complex production cell system.
Tools in support of creative collaboration
Authors: Piotr D. Adamczyk, Kevin Hamilton, Michael B. Twidale, Brian P. Bailey
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Creativity support tools are set an especially difficult task when they are applied to art/science collaboration. Not because of any fundamental incompatibility between the disciplines, but because creativity support tools are rarely supple enough to manage dramatically shifting requirements at various stages of design or handle the diversity of artifacts that might be generated. Traditional methods of evaluation of collaborative support tools may not address these aspects. This workshop aims to examine three specific areas open to expanded modes of evaluation; the social aspects of tools and tool use, how artifacts are created and manipulated in support tools, and how the expanding contexts of art/science collaborations may be rapidly changing support tool requirements.
A Special Purpose Co-Processor Prototype for Virtual Surgery Simulators
Authors: Mayssaa Al Najjar, Rafic Ayoubi, Safwan Chendeb, Haissam Ziade
Venue: Proceedings of the International Conference on Medical Information Visualisation - BioMedical Visualisation (2007)

Virtual surgery simulators have recently emerged as an important tool in training surgeons. A typical simulator consists of the set of artificial surgical tools, the graphical display, and the processing unit to compute the deformations of the organ under operation. This paper presents a novel 3D fixed-point FPGA-based prototype processor that computes, in a virtual simulator, the deformations of the organ. The proposed processor not only overcomes the fixed organ connectivity faced in previous designs, but also allows real-time computations without any restriction on the number and direction of neighbors for each point in the modeled organ. Furthermore, it provides a scalable system with modular underlying SIMD sub processors. The first generation proof-of-concept system is implemented on 2v8000ff1152-5 Virtex2 device. The second generation system, when implemented on ASIC, is expected to have about x600 speedup over the software solution.