ppxscal/embedding_network huggingface dataset:
Communication Response Time in P-NET Networks: Worst-Case Analysis Considering the Actual Token Utilization
Authors: Eduardo Tovar, Francisco Vasques, Alan Burns
Venue: Real-Time Systems (2002)

Fieldbus networks aim at the interconnection of field devices such as sensors, actuators and small controllers. Therefore, they are an effective technology upon which distributed computer-controlled systems (DCCS) can be built. DCCS impose strict timeliness requirements to the communication network. In essence, by timeliness requirements we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit, which means that in the worst-case the communication response time could be derived considering that the token is fully utilized by all stations. However, such analysis can be proved to be quite pessimistic. In this paper, we propose a more sophisticated P-NET timing analysis model, which considers the actual token utilization by different masters. The major contribution of this model is to provide a less pessimistic, and thus more accurate, analysis for the evaluation of the worst-case communication response time in P-NET fieldbus networks.
The Unified Modeling Language: Technical Aspects and Applications, 1st edition
Authors: Martin Schader, A. Korthaus
Venue:  (1999)

:The Unified Modeling Language is the new official OMG standard for object-oriented modeling languages. This volume contains papers presented during the 1st GROOM-workshop on the Unified Modeling Language (UML). GROOM (Grundlagen objektorientierter Modellierung) is a working group of the Gesellschaft fur Informatik (GI), the German Society of Computer Science. The papers are presented in three chapters as follows: UML vs. other approaches - business process modeling and applications - technical aspects and concepts. Researchers and practitioners interested in object-oriented software development, analysis, and design of software systems, and standardization efforts in the field of object technology will benefit from this volume.
MCSE Exam Notes: Proxy Server 2, 1st edition
Authors: Scott Richardson, Todd Lammle
Venue:  (1998)

:MCSE Exam Notes: Proxy Server 2 provides the fastest and most effective way to make sure you're ready for Exam 70-088, Implementing and Supporting Microsoft Proxy Server 2.0. The unique, innovative Exam Notes approach helps you gain and retain the knowledge you need, objective by objective: Critical Information sections provide detailed analyses of the key issues for each exam objective. Necessary Procedures sections cover the nuts and bolts of each topic with concise step-by-step instructions. Exam Essentials sections highlight crucial subject areas you'll need to know for the exam. Key Terms and Concepts sections define words and concepts vital to passing the exam. Sample Questions sections preview the types of questions found in the exam and give answers and explanations.
iMac, iBook, and G3 Troubleshooting Pocket Reference, 1st edition
Authors: Don Rittner
Venue:  (2000)

:A fast, handy reference for today's iMac, iBook, and G3 users! If you are among the millions of Mac users today, then you need an up-to-date and comprehensive reference that will provide fast answers to your software, hardware, network, and system maintenance questions. The iMac, iBook, & G3 Troubleshooting Pocket Reference is a handy, common-sense guidebook that covers the full range of basic problems and troubleshooting procedures. Inside this portable guide you'll find: Lists of symptoms so you can locate your problem quickly Step-by-step instructions to fixing common problems Tools for basic maintenance Instructions for adding memory Directions for using the Internet for help Tips on where to find parts for easy-to-fix at home solutions Written by Mac expert and enthusiast Don Rittner, this crystal-clear and concise reference provides you with the all information you need, from basic to more advanced topics, at your fingertips!
Fundamentals of Signals and Systems: With MATLAB Examples, 2nd edition
Authors: Edward Kamen, Bonnie Heck
Venue:  (2000)

:The book contains an introductory, yet comprehensive, treatment of continuous time and discrete-time signal and systems with demos on the Web and MATLAB examples integrated throughout the text. The second edition contains modifications of the material in the first edition to improve the presentation, additional illustrative examples and homework problems, a new chapter on communication systems, and the use of numerous on-line demos that illustrate the concepts and techniques presented in the book. The demos are available at the Web site (http://users.ece.gatech.edu/~bonnie/book) that accompanies this text. The chapter on communications covers both analog and digital modulation with an emphasis on the digital case, including phase-shift keying, frequency-shift keying, quadrature amplitude modulation, and on-off keying.
Professional Java 2 Enterprise Edition with BEA WebLogic Server
Authors: Paco Gomez, Peter Zadrozny
Venue:  (2000)

:Technology OverviewThe Java 2 Enterprise Edition (J2EE) specification is one of Java's success stories; a standard for enterprise web application development that has wide industry support. J2EE is basically a collection of specifications for web services, business objects, data access, and messaging. They define the way in which web applications communicate with the servers that host them. J2EE focuses on two things - creating a standard that allows web applications to be portable between servers, and giving the server control of component lifecycle and other resources, in order that it can handle issues of scaling, concurrency, transaction management, and security. This book is based around one of the most popular J2EE and EJB implementations, BEA WebLogic Server. The authors work for BEA in Europe, providing technical support for customer's implementations of Weblogic-based solutions. They have first-hand knowledge of the practical difficulties developers face in applying J2EE and WebLogic to their projects, and in debugging and testing these applications. This book is a distillation of their real-world expertise. Who is this book for? This book is for professional Java developers who want to see the development of a full J2EE example and its configuration and deployment on BEA WebLogic Server. Coverage of the APIs involved, reasoning behind the architecture decisions made, and how the example is tested, is included. Java knowledge is assumed, as is a basic tutorial understanding of the J2EE APIs. Some experience of enterprise level / web application programming is expected. What does this book cover? Moving a client/server app to the web using J2EE APIs Interfacing multiple front ends to the underlying business logic How to create business logic components with Enterprise JavaBeans Using Java Message Service for reliable and broadcast messaging WebLogic Server-specific programming and configuration detail Security concerns for an e-commerce site The Grinder, a stress-tester for web applications Results of stress-tests compare application architectures under different loads Full working example developed and tested in the book Peter Zadrozny and Francisco Gomez work for BEA in Europe, providing technical support for customer's implementations of Weblogic-based solutions. They thus have first-hand knowledge of the problems developers face in applying WebLogic, EJBs and in tuning, debugging and testing these applications.
Strategic Software Production with Domain-Oriented Reuse, 1st edition
Authors: Paolo Predonzani, Giancarlo Succi, Tullio Vernazza
Venue:  (2000)

:Strategic Software Production With Domain-Oriented Reuse is the first-ever book that presents a systematic approach to creating and positioning reusable software components and products. It is a resource that guides readers through all phases of domain analysis and engineering, showing how commonality and variability analysis are used in studying the market, coordinating with competitors, engineering new products, and minimizing risks. Real-world case studies illustrate applications of the methodologies covered within, including Sherlock, a unique new method that binds domain analysis to market analysis and planning.
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks
Authors: Benjie Chen, Kyle Jamieson, Hari Balakrishnan, Robert Morris
Venue: Wireless Networks (2002)

This paper presents Span, a power saving technique for multi-hop ad hoc wireless networks that reduces energy consumption without significantly diminishing the capacity or connectivity of the network. Span builds on the observation that when a region of a sharedchannel wireless network has a sufficient density of nodes, only a small number of them need be on at any time to forward traffic for active connections. Span is a distributed, randomized algorithm where nodes make local decisions on whether to sleep, or to join a forwarding backbone as a coordinator. Each node bases its decision on an estimate of how many of its neighbors will benefit from it being awake, and the amount of energy available to it. We give a randomized algorithm where coordinators rotate with time, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology. Improvement in system lifetime due to Span increases as the ratio of idle-to-sleep energy consumption increases. Our simulations show that with a practical energy model, system lifetime of an 802.11 network in power saving mode with Span is a factor of two better than without. Additionally, Span also improves communication latency and capacity.
TCP behavior across multihop wireless networks and the wired internet
Authors: Kaixin Xu, Sang Bae, Sungwook Lee, Mario Gerla
Venue: Proceedings of the 5th ACM international workshop on Wireless mobile multimedia (2002)

Emerging wireless ad hoc networks find their most important applications in untethered, mobile, multihop scenarios where there is no wired infrastructure. Yet, when the wired infrastructure (say, the Internet) is within reach, opportunistic connections to Internet sites may be established across the multihop network to transfer files and update databases. These file transfers use TCP for reliability and congestion control. However, recent experiments with ad hoc, multihop 802.11 networks have exposed serious instabilities when TCP connections span both wired and wireless domains. In particular, some TCP connections capture the wireless channel and drive the throughput on other connections virtually to zero. This is most surprising in view of the fact that connections between 802.11 (single hop) wireless LAN stations and the Internet are well behaved. In fact they are routinely used in most Campuses, Businesses and Research Labs. This paper is an experimental study of the unstable behavior of TCP across 802.11 ad hoc networks and the wired Internet. We investigate the fairness issues of multiple TCP flows as well as the coexistence of TCP flows and video streams in the wired/wireless scenario. Detailed analysis of the measurement results is also presented. The paper will prove very valuable to future commercial and military ad hoc networks.
Pi-Web Join in a Web Warehouse
Authors: Sourav S. Bhowmick, Sanjay Kumar Madria, Wee Keong Ng, Ee-Peng Lim
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

With the enormous amount of data stored in the World Wide Web, it is increasingly important to design and develop powerful web warehousing tools. The key objective of our web warehousing project, called WHOWEDA (Warehouse of Web Data), is to design and implement a web warehouse that materializes and manages useful information from the Web. In this paper, we introduce the concept of Pi-web join in the context of WHOWEDA. Pi-web join operator is a web information manipulation operator to combine relevant web information residing in two web tables. Informally, it is the combination of web join and web project operators which filter out irrelevant information from a joined web table. In this paper, we show how to construct the Pi-joined web table and its schema. We also highlight the benefits of the Pi-web join operator.
SOM-Based Methodology for Building Large Text Archives
Authors: Arnulfo P. Azcarraga, Teddy N. Yap,  Jr.
Venue: Proceedings of the 7th International Conference on Database Systems for Advanced Applications (2001)

Abstract: Not only have Self-Organizing Maps (SOMs), such as the WEBSOM, been shown to scale up to very large datasets, these maps also allow for a novel mode of navigating through a large collection of text documents. The entire text collection is presented to a user as a regular map, where each point in the map is associated to a group of documents that are likely to be composed of similar terms and phrases. In addition, the closer two points are in the map, the more similar are their respective associated documents. Thus, once an interesting document is found in the map, the user just has to click around the vicinity of that document to retrieve other similar documents. A major drawback of SOMs, however, is the long training time required, especially for document collections where both the volume and the dimensionality are huge. In this paper, we demonstrate how the size of the initial text collection is progressively and drastically reduced from the raw document collection to the final SOM-based text archive. We demonstrate this using a widely studied Reuters collection.
A Hierarchical BSP Model Supporting Processor Locality
Authors: Hojung Cha, Dongho Lee
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper presents a parallel computing model, called H-BSP, which adds a hierarchical concept to the BSP(Bulk Synchronous Parallel) computing model. A H-BSP program consists of a number of BSP groups which are dynamically created at run time and executed in a hierarchical fashion. H-BSP allows algorithm designer to develop more efficient algorithm by utilizing processor locality in the program. This paper describes the structure of H-BSP model, complexity analysis and some examples of H-BSP algorithm. Also presented is a performance characteristics of H-BSP algorithms based on the simulation analysis. Simulation results show that H-BSP model takes advantages of processor locality and performs well in low bandwidth networks or in a constant-valence architecture such as 2-dimensional mesh. It is also proved that H-BSP model can predict algorithm performance better than BSP model, due to its locality preserving nature.
Performances of the PS2 Parallel Storage and Processing System for Tomographic Image
Authors: Vincent Messerli, Benoit A. Gennart, Roger D. Hersch
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

We propose a new approach for developing parallel I/O- and compute-intensive applications. At a high level of abstraction, a macro data flow description describes how processing and disk access operations are combined. This high-level description (CAP) is precompiled into compilable and executable C++ source language. Parallel file system components specified by CAP are offered as reusable CAP operations. Low-level parallel file system components can, thanks to the CAP formalism, be combined with processing operations in order to yield efficient pipelined parallel I/O and compute intensive programs. The underlying parallel system is based on commodity components (PentiumPro processors, Fast Ethernet) and runs on top of WindowsNT. The CAP-based parallel program development approach is applied to the development of an I/O and processing intensive tomographic 3D image visualization application. Configurations range from a single PentiumPro 1-disk system to a four PentiumPro 27-disk system. We show that performances scale well when increasing the number of processors and disks. With the largest configuration, the system is able to extract in parallel and project into the display space between three and four 512x512 images per second. The images may have any orientation and are extracted from a 100 MByte 3D tomographic image striped over the available set of disks.
Managing Evolving Workflow Specifications
Authors: Gregor Joeris, Otthein Herzog
Venue: Proceedings of the 3rd IFCIS International Conference on Cooperative Information Systems (1998)

Dynamic evolution of workflow models due to process (re)engineering activities and dynamic changing situations of the real process is one of the most important challenges in workflow management. In this paper, we present an approach for the management of evolving workflow specifications which copes with the evolution of a workflow schema and the dynamic modification of workflow instances. The approach is based on the integrated modeling of workflow schema and instance elements, the separated definition of "what to do" and "how to do" in the workflow schema, late binding of workflows at run-time, and the versioning of the workflow schema. On this basis, we support lazy, eager, and selective propagation as well as local customization of instances and their upward propagation. Furthermore, we address the problem of managing consistent configurations of the versioned entities of a workflow schema. In our workflow-specific versioning approach, the consistency of the workflow configuration is guaranteed and hence the version mechanism is transparent to the user.
Federating Object-Oriented and Relational Databases: The IRO-DB Experience
Authors: Georges Gardarin, Béatrice Finance, Peter Fankhauser
Venue: Proceedings of the Second IFCIS International Conference on Cooperative Information Systems (1997)

From the beginning of 1994 to the end of 1996, the IRO-DB (Interoperable Relational and Object-Oriented Databases) ESPRIT project has developed tools for accessing relational and object-oriented databases in an integrated way, and for designing and maintaining integrated applications on large federations of heterogeneous databases. IRO-DB is based on the ODMG pivotal object model and gives an OQL/OML-C++ interface to users on a federation of relational and object-oriented databases. This paper summarizes the main problems and choices done during the system design, describes the IRO-DB architecture and components, presents the project's achievements and gives a synthesis of the lessons learned during the project's development. It also introduces future plans for the system.
A Strong Proxy Signature Scheme with Proxy Signer Privacy Protection
Authors: K. Shum, Victor K. Wei
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

Mambo, et al. [3] discussed the delegation of signature power to a proxy signer. Lee, et al. [5]constructed a strong non-designated proxy signature scheme in which the proxy signer had strong non-repudiation. In this paper, we present an enhancement to their scheme such that the identity of the proxy signer is hidden behind an alias. The identity can be revealed only by the alias authority. We also discuss other applications of this technique.
Determination and Evaluation of Web Accessibility
Authors: Cornelia Boldyreff
Venue: Proceedings of the 11th IEEE International Workshops on Enabling Technologies: nfrastructure for Collaborative Enterprises (2002)

The Web is the most pervasive collaborative technology in widespread use today; however,access to the web and its many applications cannot be taken for granted. Web accessibility encompasses a variety of concerns ranging from societal, political, and economic to individual, physical, and intellectual through to the purely technical. Thus, there are many perspectives from which web accessibility can be understood and evaluated. In order to discuss these concerns and to gain a better understanding of web accessibility, an accessibility framework is proposed using as its base a layered evaluation framework from Computer Supported Co-operative Work research and the ISO standard, ISO/IEC 9126 on software quality. The former is employed in recognition of the collaborative nature of the web and its importance in facilitating communication. The latter is employed to refine and extend the technical issues and to highlight the need for considering accessibility from the viewpoint of the web developer and maintainer as well as the web user. A technically inaccessible web is unlikely to be evolved over time. A final goal of the accessibility framework is to provide web developers and maintainers with a practical basis for considering web accessibility through the development of a set of accessibility factors associated with each identified layer.
A Loop Parallelization Method for Nested Loops with Non-uniform Dependences
Authors: Chul-Kwon Cho, Mann-Ho Lee
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper proposes an efficient method of partitioning nested loops with non-uniform dependences for maximizing parallelism. Our approach is based on convex hull theory, and it will divide the iteration space of the loop into three regions as two parallel regions where the iterations can be fully executed in parallel and one parallelizable region where the iterations are inherently serial, but possible parallelism can be exploited. And in order to maximize parallelism from the parallelizable region, an algorithm using integer programming which partitions a loop into variable size partitions is also proposed. In comparison with some works on partitioning, the proposed method is a simple and exact partitioning method, and it gives much better speedup and extracts more parallelism than them.
A Multiprocessor Scheduling Heuristic for Functional Parallelism and its Performance Measure
Authors: Dingchao Li, Akira Mizuno, Yuji Iwahori, Naohiro Ishii
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

This paper addresses the following scheduling problem: given a precedence graph with communication costs and a machine architecture with different types of processors, construct a schedule that runs on the given architecture at the minimum possible execution time. The main contributions are:- Firstly, we present a static scheduling algorithm that keeps processors idle for future important tasks and fills idle time slots incurred due to interprocessor communication.- Secondly, to evaluate the effectiveness of the algorithm, we develop a lower bound on the length of a optimal schedule as a yardstick.Experiments show that this new approach produces better schedules and takes much less compile time.