ppxscal/embedding_network huggingface dataset:
Application of the object-oriented principles for hardware and embedded system design
Authors: R. Damaševičius, V. Štuikys
Venue: Integration, the VLSI Journal (2004)

As the complexity of hardware (HW) and embedded system design is constantly increasing, the researchers are seeking to develop new more abstract and productive design methods or adapt the existing ones from other domains such as software design. This paper addresses the problem of using the object-oriented (OO) design techniques in HW domain. The main OO design techniques are as follows: abstraction, separation of concerns, composition and generalization. The application of the OO design paradigm has many aspects: high-level specification of HW models using OO formal notations such as Petri Nets and UML diagrams, HW description using OO HW description languages such as VHDL extensions and SystemC, HW design using OO HW architectures, platforms and design patterns. In this paper, we present a comprehensive overview of the application of the OO design paradigm in HW and embedded system design domains and formulate its main principles, discuss the current achievements in the area, and outline the future trends.
Synchronetics: description of the Synchronetics system used for MUC-3
Authors: James Mayfield, Edwin Addison
Venue: Proceedings of the 3rd conference on Message understanding (1991)

Synchronetics, Inc., is a startup company in Baltimore founded to develop text processing software products for the commercial and Government sectors. The company, consisting of 7 people, was founded in 1989. Synchronetics had two natural language processing software development projects prior to participation in MUC-3: an off-the-shelf parsing utility called NL-Builder; and a text retrieval system prototype called Text-SR, which was developed under an SBIR contract for Wright Patterson Air Force Base.
Kolmogorov Complexity for Possibly Infinite Computations
Authors: Verónica Becher, Santiago Figueira
Venue: Journal of Logic, Language and Information (2005)

In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired output via a possibly non-halting computation. Clearly this function gives a lower bound of the classical Kolmogorov complexity. In particular, if the machine is allowed to overwrite its output, this complexity coincides with the classical Kolmogorov complexity for halting computations relative to the first jump of the halting problem. However, on machines that cannot erase their output --called monotone machines--, we prove that our complexity for non effective computations and the classical Kolmogorov complexity separate as much as we want. We also consider the prefix-free complexity for possibly infinite computations. We study several properties of the graph of these complexity functions and specially their oscillations with respect to the complexities for effective computations.
A robust self-calibrating transmission scheme for on-chip networks
Authors: Frédéric Worm, Paolo Ienne, Patrick Thiran, Giovanni De Micheli
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2005)

Systems-on-Chip (SoC) design involves several challenges, stemming from the extreme miniaturization of the physical features and from the large number of devices and wires on a chip. Since most SoCs are used within embedded systems, specific concerns are increasingly related to correct, reliable, and robust operation. We believe that in the future most SoCs will be assembled by using large-scale macro-cells and interconnected by means of on-chip networks. In this paper, we examine some physical properties of on-chip interconnect busses, with the goal of achieving fast, reliable, and low-energy communication. These objectives are reached by dynamically scaling down the voltage swing, while ensuring data integrity--in spite of the decreased signal to noise ratio--by means of encoding and retransmission schemes. In particular, we describe a closed-loop voltage swing controller that samples the error retransmission rate to determine the operational voltage swing. We present a control policy which achieves our goals with minimal complexity; such simplicity is demonstrated by implementing the policy in a synthesizable controller. Such a controller is an embodiment of a self-calibrating circuit that compensates for significant manufacturing parameter deviations and environmental variations. Experimental results show that energy savings amount up to 42%, while at the same time meeting performance requirements.
Coordination mechanisms for congestion games
Authors: Marek Chrobak, Elias Koutsoupias
Venue: ACM SIGACT News (2004)

Recently there has been a lot of interest in problems at the intersection of Game Theory, Economics, and Computer Science. For example, there are interesting developments concerning algorithms for equilibria and cost sharing, algorithmic mechanism design, and the efficiency of systems with selfish users [25]. In this note, I will focus on the last area and in particular on the price of anarchy of task allocation, selfish routing, and congestion games. I will discuss the issues of this area, mention the central results, and suggest some open problems, some of them close in spirit to competitive analysis.
Twol-amalgamated priority queues
Authors: Rick Siow Mong Goh, Ian Li-Jin Thng
Venue: Journal of Experimental Algorithmics (JEA) (2004)

Priority queues are essential function blocks in numerous applications such as discrete event simulations. This paper describes and exemplifies the ease of obtaining high performance priority queues using a two-tier list-based structure. This new implementation, called the Twol structure, is amalgamated with three priority queues, namely, the Henriksen's queue, splay tree and skew heap, to enhance the efficiency of these basal priority queue structures. Using a model that combines traditional average case and amortized complexity analysis, Twol-amalgamated priority queues that maintain N active events are theoretically proven to offer O(1) expected amortized complexity under reasonable assumptions. They are also demonstrated empirically to offer stable near O(1) performance for widely varying priority increment distributions and for queue sizes ranging from 10 to 10 million. Extensive empirical results show that the Twol-amalgamated priority queues consistently outperform those basal structures (i.e., without the Twol structure) with an average speedup of about three to five times on widely different hardware architectures. These results provide testimony that the Twol-amalgamated priority queues are suitable for implementation in sizeable application scenarios such as, but not limited to, large-scale discrete event simulation.
Saving and using encountered information: implications for electronic periodicals
Authors: Catherine C. Marshall, Sara Bly
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

As part of a focus on electronic publications, we undertook an exploratory study of how people saved and used the information they encountered while reading. In particular, we wanted to understand the role of clipping and whether it would be a necessary form of interaction with electronic publications. We interviewed 20 diverse individuals at home and at work, bringing together narrative accounts and physical and digital examples to investigate how people currently collect and use clippings from their everyday reading. All study participants had examples of materials they had deliberately saved from periodicals, ranging from ads torn from newspapers and URLs received in email messages to large stacks of magazines. Participants rarely read periodicals specifically to clip but rather recognized items of interest when they were encountered. The work highlights the importance of encountering information as an activity distinct from task-focused browsing and searching and reveals design implications for online reading and clipping technologies.
Defending against distributed denial-of-service attacks with max-min fair server-centric router throttles
Authors: David K. Y. Yau, John C. S. Lui, Feng Liang, Yeung Yam
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

Our work targets a network architecture and accompanying algorithms for countering distributed denial-of-service (DDoS) attacks directed at an Internet server. The basic mechanism is for a server under stress to install a router throttle at selected upstream routers. The throttle can be the leaky-bucket rate at which a router can forward packets destined for the server. Hence, before aggressive packets can converge to overwhelm the server, participating routers proactively regulate the contributing packet rates to more moderate levels, thus forestalling an impending attack. In allocating the server capacity among the routers, we propose a notion of level-k max-min fairness. We first present a control-theoretic model to evaluate algorithm convergence under a varitey of system parameters. In addition, we present packet network simulation results using a realistic global network topology, and various models of good user and attacker distributions and behavior. Using a generator model of web requests parameterized by empirical data, we also evaluate the impact of throttling in protecting user access to a web server. First, for aggressive attackers, the throttle mechanism is highly effective in preferentially dropping attacker traffic over good user traffic. In particular, level-k max-min fairness gives better good-user protection than recursive pushback of max-min fair rate limits proposed in the literature. Second, throttling can regulate the experienced server load to below its design limit - in the presence of user dynamics - so that the server can remain operational during a DDoS attack. Lastly, we present implementation results of our prototype on a Pentium III/866 MHz machine. The results show that router throttling has low deployment overhead in time and memory.
Adaptation of parameters in ecology models
Authors: V. G. Il'Ichev
Venue: Automation and Remote Control (2005)

Model mechanisms of adaptation of the parameters of populations are suggested on the basis of mathematical criteria of the competitive selection. Ecologically evolutional models of a small dimension are set up, in which the dynamics of variables and the adaptation of parameters are simultaneously traced. This approach is used to seek sets of the evolutionally stable parameters of water plants under periodic changes of the medium temperature.
Civic responsibility and information security: an information security management, service learning course
Authors: Melissa J. Dark
Venue: Proceedings of the 1st annual conference on Information security curriculum development (2004)

This paper describes a needed and innovative service learning Information Security Management class that was designed, developed, and offered at Purdue University in spring 2004. This paper overviews 1) the need for service learning, 2) the more specific need for service learning in information technology and educational technology programs, 3) the need for information security in K12 school corporations as these bodies of work pertain to this experimental course. For faculty interested in developing a similar course, the paper then 4) highlights the course description and objectives as a reference point, and 5) describes how this course evolved from past work with an emphasis on the type of capacity that was needed to make such a course possible.
Creating and Simulating Skeletal Muscle from the Visible Human Data Set
Authors: Joseph Teran, Eftychios Sifakis, Silvia S. Blemker, Victor Ng-Thow-Hing, Cynthia Lau, Ronald Fedkiw
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

Simulation of the musculoskeletal system has important applications in biomechanics, biomedical engineering, surgery simulation, and computer graphics. The accuracy of the muscle, bone, and tendon geometry as well as the accuracy of muscle and tendon dynamic deformation are of paramount importance in all these applications. We present a framework for extracting and simulating high resolution musculoskeletal geometry from the segmented visible human data set. We simulate 30 contact/collision coupled muscles in the upper limb and describe a computationally tractable implementation using an embedded mesh framework. Muscle geometry is embedded in a nonmanifold, connectivity preserving simulation mesh molded out of a lower resolution BCC lattice containing identical, well-shaped elements, leading to a relaxed time step restriction for stability and, thus, reduced computational cost. The muscles are endowed with a transversely isotropic, quasi-incompressible constitutive model that incorporates muscle fiber fields as well as passive and active components. The simulation takes advantage of a new robust finite element technique that handles both degenerate and inverted tetrahedra.
Video Decompression Estimation and Playout Scheme Over the Internet
Authors: Sanjay K. Jha, Michael Fry
Venue: Multimedia Tools and Applications (2005)

This paper examines problems associated with display of live continuous media. Under the assumption that the network cannot guarantee the required bounds on delay and jitter and the operating system scheduling is non-realtime, there is a need to accommodate the delay and jitter in the end systems in order to maintain a desirable Quality of Service (QoS). We propose a method of video playback which requires accurate estimation of display cycle time of video frames and the delay suffered by frames in the packet network. We apply various deterministic forecasting methods used in time series analysis on experimental data collected from video transmission. Suitable methods are recommended for display cycle time and delay estimation.
Remote Integration and Coordination of Verification Tools in JETI
Authors: Tiziana Margaria, Ralf Nagel, Bernhard Steffen
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

We present jETI, a redesign of the Electronic Tools Integration platform (ETI), that addresses the major issues and concerns accumulated over seven years of experience with tool providers, tool users and students. Most important was here the reduction of the effort for integrating and updating tools. jETI combines Eclipse and Web Services functionality with our Application Building Center (ABC), a framework supporting coordination based application development. This provides (1) lightweight remote component (tool) integration, (2) distributed component (tool) libraries, (3) a graphical coordination environment, and (4) a distributed execution environment. We illustrate these features by discussing their impact on the typical jETI user groups: the Tool Providers, the Standard Tool Users, and the Advanced Tool Users.
Efficient parallel exponentiation in GF(qn) using normal basis representations
Authors: Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho
Venue: Journal of Algorithms (2005)

Von zur Gathen proposed an efficient parallel exponentiation algorithm in finite fields using normal basis representations. In this paper we present a processor-efficient parallel exponentiation algorithm in GF(qn) which improves upon von zur Gathen's algorithm. We also show that exponentiation in GF(qn) can be done in O((log2 n)2 / logq n) time using n / (log2 n)2 processors. Hence we get a processor-time bound of O(n / logq n), which matches the best known sequential algorithm. Finally, we present an efficient on-line processor assignment scheme which was missing in von zur Gathen's algorithm.
MAC Layer Support for Real-Time Traffic in a SAHN
Authors: Muhammad Mahmudul Islam, Ronald Pose, Carlo Kopp
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

In multi-hop ad-hoc wireless networks with shared medium and a contention based media access control (MAC) protocol, guaranteed quality of service (QoS) support for realtime traffic (e.g. voice, video, interactive applications etc.) is very challenging. Commercially available contention based MAC protocols, e.g. IEEE 802.11e, do not provide any mechanism to prevent a network from getting overloaded. Hence they fail to provide desired QoS (e.g. throughput, end-to-end delay, delivery ratio) for realtime traffic when the network is loaded beyond certain limits. In our previous work we have explained in details why trivial solutions are inadequate to support deterministic QoS for real-time traffic in multi-hop ad-hoc networks. We have also presented an analytical model to offer a distributed admission control and bandwidth reservation scheme by extending the features of the basic channel access mechanism of IEEE 802.11e and coordinating with the network layer. In this paper we have extended our analytical model to make it more effective than the initial one by considering neighboring nodes in bandwidth calculation. We refer to the improved IEEE 802.11e as SAHN-MAC. The proposed admission control mechanism of SAHN-MAC prevents any new data stream from initiating if the new stream saturates or is about to saturate any part of the network. The bandwidth reservation scheme is necessary for the admission control scheme to work properly. The proposed mechanisms have also been verified and evaluated via various simulations.
Optimizing instruction TLB energy using software and hardware techniques
Authors: I. Kadayif, A. Sivasubramaniam, M. Kandemir, G. Kandiraju, G. Chen
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2005)

Power consumption and power density for the Translation Look-aside Buffer (TLB) are important considerations not only in its design, but can have a consequence on cache design as well. After pointing out the importance of instruction TLB (iTLB) power optimization, this article embarks on a new philosophy for reducing the number of accesses to this structure. The overall idea is to keep a translation currently being used in a register and avoid going to the iTLB as far as possible---until there is a page change. We propose four different approaches for achieving this, and experimentally demonstrate that one of these schemes that uses a combination of compiler and hardware enhancements can reduce iTLB dynamic power by over 85&percent; in most cases.The proposed approaches can work with different instruction-cache (iL1) lookup mechanisms and achieve significant iTLB power savings without compromising on performance. Their importance grows with higher iL1 miss rates and larger page sizes. They can work very well with large iTLB structures that can possibly consume more power and take longer to lookup, without the iTLB getting into the common case. Further, we also experimentally demonstrate that they can provide performance savings for virtually indexed, virtually tagged iL1 caches, and can even make physically indexed, physically tagged iL1 caches a possible choice for implementation.
Example centric programming
Authors: Jonathan Edwards
Venue: ACM SIGPLAN Notices (2004)

Programmers tend to understand programs by thinking of concrete examples. Example Centric Programming seeks to add IDE support for examples throughout the process of programming. Instead of programmers interpreting examples in their head, the examples are written down and the IDE interprets them automatically. Advanced UI techniques are used to present the results closely integrated with the code. Traditionally distinct programming tools (the editor, Read-Eval-Print-Loop, debugger, and test runner) are unified into a single tool that might be called an example-enlightened editor. This is expected to benefit a wide spectrum of programming activities, for both novice and experienced programmers. Some novel methods for testing and development are made possible. In the longer term, example centrism has implications for the design of future programming languages. A prototype has been implemented for Java in Eclipse.
Contribution to Design of Complex Mechatronic Systems. An Approach through Evolutionary Optimization
Authors: S. Sakka, P. Coiffet
Venue: Journal of Intelligent and Robotic Systems (2005)

This paper describes a new evolutionary methodology aimed at optimizing various and heterogeneous data in common evolution. The representation of solutions uses mixed-integer genotypes and variable-length chromosomes to face a complex problem of task decomposition and high-level control generation. A memory operator is introduced to face convergency uncertainties issued from the irregularities of both discontinuous evaluation function and heterogeneous solution representation. The stability of the evolutionary algorithm is analyzed with dimension changes in the optimization problem.
Potential pitfalls in packaged software adoption
Authors: Ben Light
Venue: Communications of the ACM (2005)

Numerous organizational considerations influence packaged software purchasing.
Interactive Posters: TECHNOLOGY TRANSFER OF USER CENTERED ARCHITECTURE IN A LARGE U.S. CORPORATION
Authors: Kathleen D. Cebulka, Michael J. Muller, Lillian Ruston
Venue: ACM SIGCHI Bulletin (1991)

Bellcore develops software products conforming to the OSCATM architecture. Aimed at ensuring interoperability in a heterogeneous environment, the OSCA architecture separates concerns into three types of entities: data layer building blocks, user layer building blocks (ULBBs), and processing layer building blocks (PLBBs). In 1990, we undertook a project to refine the User Layer (UL) of the OSCA architecture. In this poster, we briefly describe the refined architecture and explore reasons for our success. To account for this, we have had to answer the question: Who are the users of an architecture? We found that acceptance of a user centered architecture (i.e., centered on the end user) is greatly enhanced by the use of a user centered design process of that architecture (i.e., centered on the development users of the architecture).
Special Issue: Grids and Web Services for e-Science: Editorials
Authors: Tony Hey, Geoffrey Fox
Venue: Concurrency and Computation: Practice Experience (2005)

This editorial describes four papers that summarize key Grid technology capabilities to support distributed e-Science applications. These papers discuss the Condor system supporting computing communities, the OGSA-DAI service interfaces for databases, the WS-I+ Grid Service profile and finally WS-GAF (the Web Service Grid Application Framework). We discuss the confluence of mainstream IT industry development and the very latest science and computer science research and urge the communities to reach consensus rapidly. Agreement on a set of core Web Service standards is essential to allow developers to build Grids and distributed business and science applications with some assurance that their investment will not be obviated by the changing Web Service frameworks. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Online Scheduling of Precedence Constrained Tasks
Authors: Yumei Huo, Joseph Y, .-T. Leung
Venue: SIAM Journal on Computing (2005)

A fundamental problem in scheduling theory is that of scheduling a set of n tasks, with precedence constraints, on $m \ge 1$ identical and parallel processors so as to minimize the makespan (schedule length). In the past, research has focused on the setting whereby all tasks are available for processing at the beginning (i.e., at time t = 0). In this article we consider the situation where tasks, along with their precedence constraints, are released at different times, and the scheduler has to make scheduling decisions without knowledge of future releases. In other words, the scheduler has to schedule tasks in an online fashion. We consider both preemptive and nonpreemptive schedules. We show that optimal online algorithms exist for some cases, while for others it is impossible to have one. Our results give a sharp boundary delineating the possible and the impossible cases.