ppxscal/embedding_network huggingface dataset:
A vision for embedded software
Authors: Alberto Sangiovanni-Vincentelli, Grant Martin
Venue: Proceedings of the 2001 international conference on Compilers, architecture, and synthesis for embedded systems (2001)

In this paper we describe a vision for the future evolution of Embedded SW (ESW) design methodologies as part of overall Embedded Systems (ES) development. Fundamentally, we believe that the way in which embedded SW is developed today must change radically. The key steps are: first, to link embedded software upwards in the abstraction layers to system functionality; and second, to link embedded software to the programmable platforms that support it. This will provide the much-needed means to verify whether the constraints posed on Embedded Systems are met. We envisage an optimised, automated, transparent and mathematically correct flow from product specification through to implementation for SW-dominated products implemented with highly programmable platforms.
Software Quality Assurance: A Student Introduction
Authors: Darrel Ince
Venue:  (1995)

:Software Quality Assurance (SQA) is now a major factor in the success of any software development project - a fact reflected in the content of today's undergraduate and postgraduate courses. This book is a truly student-oriented introduction to the subject, applying SQA to all the key stages of development - requirements analysis, project planning, system design, detailed design, programming and finally testing. Pitfalls and remedies in the application of SQA are illustrated by anecdotes, often taken from the author's own experience, and a practical case study shows how to implement the Quality Assurance Process from start to finish.
Efficient selection algorithms on distributed memory computers
Authors: E. L. G. Saukas, S. W. Song
Venue: Proceedings of the 1998 ACM/IEEE conference on Supercomputing (CDROM) (1998)

Consider the selection problem of determining the k th smallest element of a sequence of n elements. Under the CGM (Coarse Grained Multicomputer) model with p processors and O(n/p) local memory, we present a deterministic parallel algorithm for the selection problem that requires O(log p) communication rounds. Besides requiring a low number of communication rounds, the algorithm also attempts to minimize the total amount of data transmitted in each round (only O(p) except in the last round). The basic algorithm is then extended to solve the problem of q simultaneous selections using the same input sequence, also in O(log p) communication rounds and asymptotically same local computing time (if q = O(p) ). The simultaneous selection algorithm gives rise to a communication efficient sorting algorithm, with O(log p) communication rounds and a total of O(p 2) data transmitted in each round except in the last one. In addition to showing theoretical complexities, we present very promising experimental results obtained on two parallel machines that show almost linear speedup, indicating the efficiency and scalability of the proposed algorithms. To our knowledge, this is the best deterministic CGM algorithm in the literature for the selection problem.
SchemaSQL: An extension to SQL for multidatabase interoperability
Authors: Laks V. S. Lakshmanan, Fereidoon Sadri, Subbu N. Subramanian
Venue: ACM Transactions on Database Systems (TODS) (2001)

We provide a principled extension of SQL, called SchemaSQL, that offers the capability of uniform manipulation of data and schema in relational multidatabase systems. We develop a precise syntax and semantics of SchemaSQL in a manner that extends traditional SQL syntax and semantics, and demonstrate the following. (1) SchemaSQL retains the flavor of SQL while supporting querying of both data and schema. (2) It can be used to transform data in a database in a structure substantially different from original database, in which data and schema may be interchanged. (3) It also permits the creation of views whose schema is dynamically dependent on the contents of the input instance. (4) While aggregation in SQL is restricted to values occurring in one column at a time, SchemaSQL permits "horizontal" aggregation and even aggregation over more general "blocks" of information. (5) SchemaSQL provides a useful facility for interoperability and data/schema manipulation in relational multidatabase systems. We provide many examples to illustrate our claims. We clearly spell out the formal semantics of SchemaSQL that accounts for all these features. We describe an architecture for the implementation of SchemaSQL and develop implementation algorithms based on available database technology that allows for powerful integration of SQL based relational DBMS. We also discuss the applicability of SchemaSQL for handling semantic heterogeneity arising in a multidatabase system.
Information-Driven Marketing Decisions: Development of Strategic Information Systems
Authors: A. Coskun Samli
Venue:  (1996)

:Data have almost no value in and for themselves. What's important is how they are used to create the information one needs to make informed decisions, and this is particularly true in making marketing decisions. Thus, Samli's new book dwells on the art and science of information generation and on how to convert it to practical knowledge. Without information and knowledge, says Samli, "the firm faces great risk in the marketplace and its survival probabilities in the long run are very low." Samli explains, first, the various data generating procedures, with special emphasis on data analysis, and second, the procedures for creating information out of data -- all in a clear, systematic presentation that marketing managers will understand and benefit from immediately. Their MIS colleagues, whose goal should be to make data and information "decision-maker friendly," will also benefit. A unique, valuable book for both. 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
A proposed simulation system for modeling cell growth and assessing the effect of drug treatment on tumors
Authors: V. K. Ghanta, C. D. Atnip, M. White, R. N. Hiramoto
Venue: Proceedings of the 14th annual Southeast regional conference (1976)

The use of simulation techniques to develop schedules for chemotherapy of solid tumors is discussed. In recent years the Gompertz model has been verified as an accurate model of tumor cell growth. Interest in describing the growth of cell systems has resulted in the development of generalized cell growth simulation systems, enabling models of cell growth, cell kills and reaction to different stimuli to be simulated.This paper discusses the development of GOMPSIM, a hybrid system based on one such cell growth simulation system, CELLSIM, and an algorithm that fits actual tumor growth data to the Gompertz model. GOMPSIM modifies the CELLSIM parameters in successive trials until the simulated cell growth matches the Gompertz description of the tumor growth. Once the CELLSIM parameters describing the actual tumor growth are determined, the model created by these parameters is used to determine if effective chemotherapy is possible by simulating "cell kills" similar to events resulting from administering a drug. By observing the simulated reaction of the tumor (continued growth, attrition,...), it is hoped that a better understanding of cell kinetics and ultimately an effective drug treatment program can be determined.
Fix Your Own PC, 4th edition
Authors: Corey Sandler
Venue:  (1997)

:With a good set of screwdrivers, an antistatic strap, and Fix Your Own PC, you'll be ready to tackle any job - big or small. Packed with detailed graphics and photos, this guide will quickly and easily help you diagnose and fix your own PC.
Learning temporal patterns for anomaly intrusion detection
Authors: Alexandr Seleznyov, Oleksiy Mazhelis
Venue: Proceedings of the 2002 ACM symposium on Applied computing (2002)

For the last decade an explosive spread of computer systems and computer networks has resulted in a society that is increasingly dependent on information stored on these systems. A computer system connected to the network is accessible from another computer in this network regardless of its geographical position. Along with providing many benefits for legitimate users this technology creates almost unlimited opportunities for malicious persons, which using software vulnerabilities may successfully penetrate the networked computer systems. In order to eliminate potential devastating consequences caused by breaches in computer systems, more and more attention is drawn to the information security problems. However, despite these efforts, the occurrences of the security violations in the computer networks became increasingly frequent. In this paper we discuss an approach to detect the intrusions. Being able to accurately recognize its legitimate users a system may effectively detect masqueraders. The paper particularly focuses on the question of temporal pattern extraction from user behavior and shows that sequential patterns are not the only ones that may be found in user events sequences. There are also temporal patterns present in user behavior, which together with sequential may be used for efficient user recognition.
Using task models to generate multi-platform user interfaces while ensuring usability
Authors: Mir Farooq Ali, Manuel A. Pérez-Quiñones
Venue: CHI '02 extended abstracts on Human factors in computing systems (2002)

The widespread emergence of new computing devices and associated interaction metaphors has necessitated new ways of building User Interfaces (UIs) for these devices. In this paper, we describe our approach of using a Task Model in conjunction with the User Interface Markup Language (UIML) to drive generation of Multi-Platform User Interfaces. We also discuss briefly how current usability engineering practices have to be modified to accommodate the development of multi-platform UIs.
Oracle8 DBA: SQL and PL/SQL Exam Cram
Authors: Michael R. Ault
Venue:  (2000)

:Contains material previously only available in training materials from Oracle, including key terms and definitions. Includes all technologies covered on the Introduction to Oracle: SQL and PL/SQL examination. Provides practice questions with detailed explanations of why the right answer is correct and the wrong answer is wrong. Oracle is the industry leader in database software, with a market share of over 60%, creating a great demand for certified professionals.
Word 7 for Windows 95 Quick and Easy, 3rd edition
Authors: Christian Crumlish
Venue:  (1995)

:In just a few minutes, you can learn how to create, save, and print your first document; format text; and revise your work - even if you've never used Word before. Each self-contained lesson covers a fundamental task you can learn in minutes. Straightforward explanations simplify every job, from start-up to editing. Full-color screen shots are paired with simple instructions. When your screen looks like the one in the book, you'll know its right.
The Longman Handbook for Writers and Readers
Authors: Christopher M. Anson
Venue:  (1997)

:The authors designed the book as a resource both for times when you are looking for the answer to a specific question and for times when you want extended help.
A note on proactive password checking
Authors: Jianxin Jeff Yan
Venue: Proceedings of the 2001 workshop on New security paradigms (2001)

Nowadays, proactive password checking algorithms are based on the philosophy of the dictionary attack, and they often fail to prevent some weak passwords with low entropy. In this paper, a new approach is proposed to deal with this new class of weak passwords by (roughly) measuring entropy. A simple example is given to exploit effective patterns to prevent low-entropy passwords as the first step of entropy-based proactive password checking.
Scheduling flows with unknown sizes: approximate analysis
Authors: Liang Guo, Ibrahim Matta
Venue: Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2002)

Previous job scheduling studies indicate that providing rapid response to interactive jobs which place frequent but small demands, can reduce the overall system average response time [1], especially when the job size distribution is skewed (see [2] and references therein). Since the distribution of Internet flows is skewed, it is natural to design a network system that favors short file transfers through service differentiation. However, to maintain system scalability, detailed per-flow state such as flow length is generally not available inside the network. As a result, we usually resort to a threshold-based heuristic to identify and give preference to short flows. Specifically, packets from a new flow are always given the highest priority. However, the priority is reduced once the flow has transferred a certain amount of packets.In this paper, we use the MultiLevel (ML) feedback queue [3] to characterize this discriminatory system. However, the solution given in [3] is in the form of an integral equation, and to date the equation has been solved only for job size distribution that has the form of mixed exponential functions. We adopt an alternative approach, namely using a conservation law by Kleinrock [1], to solve for the average response time in such system. To that end, we approximate the average response time of jobs by a linear function in the job size and solve for the stretch (service slowdown) factors. We show by simulation that such approximation works well for job (flow) size distributions that possess the heavy-tailed property [2], although it does not work so well for exponential distributions.Due to the limited space available, in Section 2 we briefly describe the queueing model and summarize our approximation approach to solving for the average response time of the M/G/1/ML queueing system. We conclude our paper in Section 3.
A Generalized Processor Mapping Technique for Array Redistribution
Authors: Ching-Hsien Hsu, Yeh-Ching Chung, Don-Lin Yang, Chyi-Ren Dow
Venue: IEEE Transactions on Parallel and Distributed Systems (2001)

In many scientific applications, array redistribution is usually required to enhance data locality and reduce remote memory access in many parallel programs on distributed memory multicomputers. Since the redistribution is performed at runtime, there is a performance trade-off between the efficiency of the new data decomposition for a subsequent phase of an algorithm and the cost of redistributing data among processors. In this paper, we present a generalized processor mapping technique to minimize the amount of data exchange for BLOCK-CYCLIC(kr) to BLOCK-CYCLIC(r) array redistribution and vice versa. The main idea of the generalized processor mapping technique is first to develop mapping functions for computing a new rank of each destination processor. Based on the mapping functions, a new logical sequence of destination processors can be derived. The new logical processor sequence is then used to minimize the amount of data exchange in a redistribution. The generalized processor mapping technique can handle array redistribution with arbitrary source and destination processor sets and can be applied to multidimensional array redistribution. We present a theoretical model to analyze the performance improvement of the generalized processor mapping technique. To evaluate the performance of the proposed technique, we have implemented the generalized processor mapping technique on an IBM SP2 parallel machine. The experimental results show that the generalized processor mapping technique can provide performance improvement over a wide range of redistribution problems.
Sams Teach Yourself Microsoft Excel 97 in 24 Hours, 1st edition
Authors: Lois R. Patterson
Venue:  (1997)

:This step-by-step guide teaches you how to master the power and versatility of Excel in just 24 easy-to-follow lessons. Upon completion of this book, you will have a solid grasp on Excel 97 and you will be able to manipulate your numerical data in new ways and present your results in stunning formats. Real-world examples, hands-on techniques, and review questions make it easy to Teach Yourself Microsoft Excel 97 in 24 Hours!
3D agent-based virtual communities
Authors: Zhisheng Huang, Anton Eliëns, Cees Visser
Venue: Proceedings of the seventh international conference on 3D Web technology (2002)

In this paper we propose an approach to 3D agent-based virtual communities in which autonomous agents are participants in VRML-based virtual worlds to enhance the interaction with users or serve as intelligent navigation assistants. In addition, an agent communication language (ACL) is designed as a high-level communication facility, in particular for the realization of shared objects in virtual communities. As a typical example of 3D agent-based virtual communities, a VRML-based multi-user soccer game has been developed and implemented in the distributed logic programming language DLP. We discuss how DLP can be used for the implementation of 3D agent-based virtual communities.
Word 6 for Windows: Visual Pocketguide, 1st edition
Authors: CORPORATE Ruth Staff Maran
Venue:  (1994)

:The good news is that Microsoft never runs out of great features to add to Word, its powerful and popular word processing program. The bad news is that all those new features aren't always easy to learn. Word 6 For Windows Visual Pocket Guide presents everything from opening, saving, and printing Word 6 documents to formatting professional-looking documents with tables and checking them with Word's built-in grammar and spell-checking functions. In this one compact, full-color guide you see exactly where and what to click, what to type, and what to drag and drop. There's no better illustrated resource for learning and using all the basic, essential capabilities of Word 6 for Windows. 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
Properties of on-chip inductive current loops
Authors: Andrey V. Mezhiba, Eby G. Friedman
Venue: Proceedings of the 12th ACM Great Lakes symposium on VLSI (2002)

The variation of inductance with circuit length is investigated in this paper. The nonlinear variation of inductance with length is shown to be a result of inductive coupling among circuit segments. If the distance between the forward and return current paths of a current loop is much smaller than the loop length, the inductive coupling to the forward current is similar to the coupling to the return current, resulting in negligible coupling. The inductance of these circuits therefore varies approximately linearly with length. Similarly, the effective inductive coupling between two parallel current loops is reduced through cancellation and has a negligible effect on the net inductance of a circuit. As a general rule, the inductance of circuits where the distance between the forward and return current is much smaller than the characteristic dimensions of the circuit scales linearly with circuit dimensions. This linear behavior can be used to simplify the inductance extraction and circuit analysis process.
Information servers: a scaleable communication paradigm for wide area networks and the information superhighway
Authors: Mark D. Wood, Bradford B. Glade
Venue: Proceedings of the 7th workshop on ACM SIGOPS European workshop: Systems support for worldwide applications (1996)

The predominant use of point-to-point communication protocols on the global Internet, combined with the communication patterns imposed by the World Wide Web, make inefficient use of the Internet's increasingly scarce network bandwidth. While more network fiber helps to belay the impact of these inefficiencies, ultimately more intelligent coordination of data distribution and the use of more efficient distribution protocols will be necessary to support the user population of the Information Superhighway. To this end, we propose the notion of Information Servers. Using the publish-subscribe paradigm, Information Servers distribute information in such way to minimize network traffic.
Parallelizing a high accuracy hardware-assisted volume renderer for meshes with arbitrary polyhedra
Authors: Janine Bennett, Richard Cook, Nelson Max, Deborah May, Peter Williams
Venue: Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics (2001)

This paper discusses our efforts to improve the performance of the high-accuracy (HIAC) volume rendering system, based on cell projection, which is used to display unstructured, scientific data sets for analysis. The parallelization of HIAC, using the pthreads and MPI API's, resulted in significant speedup, but interactive frame rates are not yet attainable for very large data sets.
Multimedia Workshop 3.0, 1st edition
Authors: Matthew Holtz
Venue:  (1995)

:Written in a computer-applications style, this book provides explanations and how-to instructions, followed by numerous exercises. Labeled icons flag the hands-on exercises, alerting users to pitfalls and help.
The Internet Trainer's Total Solutions Guide (with Training Diskette), 2nd edition
Authors: Diane K. Kovacs
Venue:  (1997)

:Expanding on Kovacs' The Internet Trainer's Guide, this turnkey guide for Internet trainers will enable you to custom-tailor training for any type of end-user, including business, academic, and medical.Kovacs outlines techniques to help instructors determine what trainees already know and what they want to get out of Internet training, as well as how to help trainees effectively apply their new-found knowledge to daily tasks and functions. Includes: -- Scripted lesson plans-- Training disk that can be customized according to the audience-- WebExtra resources downloadable from VNR's website-- Questionnaires to assess training needs-- Exercises for training classes.
Technology mapping for high-performance static CMOS and pass transistor logic designs
Authors: Yanbin Jiang, Sachin S. Sapatnekar, Cyrus Bamji
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2001)

Two new techniques for mapping circuits are proposed in this paper. The first method, called the odd-level transistor replacement (OTR) method, has a goal that is similar to that of technology mapping, but without the restriction of a fixed library size and maps a circuit to a virtual library of complex static CMOS gates. The second technique, the static CMOS/pass transistor logic (PTL) method, uses a mix of static CMOS and PTL to realize the circuit and utilized the relation between PTL and binary decision diagrams. The methods are very efficient and can handle all of the ISCAS'85 benchmark circuits in minutes. A comparison of the results with traditional technology mapping using SIS on different libraries shows an average delay reduction above 18% for OTR, and an average delay reduction above 35% for the static CMOS/PTL method, with significant savings in the area
Choosing and using a driving problem for CVE technology development
Authors: William L. Mitchell, Daphne Economou, Steve R. Pettifer, Adrian J. West
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2000)

The need for a real-world driving problem to guide technology development has long been recognised. However, this does not guarantee the identification of requirements for technology development. This paper argues that a more systematic approach is needed for choosing and making best use of a driving problem for CVE technology. The method consists of identifying the stakeholders in the technology development project. A series of issues must then be addressed: choice of problem area, choice of application, choice of research approach, design of the application, ensuring use by real users, choice of method of study, and identification of technology requirements. The method is illustrated by considering the development of the Deva CVE system with an art-based application and with an educational application.