ppxscal/embedding_network huggingface dataset:
Incremental Constraint Satisfaction and its Application to Graphical Interfaces
Authors: Bradley T. Vander Zanden
Venue:  (1988)

Software that emphasizes pictures, rather than text, has become increasingly popular since the introduction of the Macintosh computer. Creating this software is a time-consuming task that can take months or years. Researchers have attempted to speed up this process by developing constraint-based tools that automate portions of the software development cycle. However, these tools are often limited in the types of applications they can generate, since 1) they lack powerful editing models that can manipulate complex data structures, such as lists, trees, and sets; and 2) in large applications, they cannot perform constraint satisfaction quickly enough to provide instantaneous feedback to the user. We present tools for overcoming each of these difficulties. First, we describe a new model, called constraint grammars, that integrates aspects of both attribute grammars and constraint-based, object systems to produce a powerful specification language for graphical interfaces. Constraint grammars integrate important concepts such as the part-whole hierarchy, almost-hierarchical structures, and multidirectional constraints. These features are augmented with a pattern-matching editing model that permits a designer to manipulate complex data structures. We then present techniques for incrementally resatisfying multidirectional, noncircular sets of constraints. It is shown that minimizing the number of re-solved constraints is NP-complete. We therefore describe an approach that attempts to minimize the amount of time spent updating the constraint solution. This technique divides constraint solving into two phases-a planning phase that linearly orders the constraints and an evaluation phase that solves the constraints using this linear order. Previous approaches have thrown away the linear order whenever the constraint system changes. However, this is unnecessary since only a local portion of the linear order is typically modified. We exploit this fact to develop an algorithm that incrementally updates this order. We the augment this algorithm with a heuristic that attempts to choose a linear order that minimizes the number of equations that the evaluation stage must solve. We present benchmarks that show that these algorithms can significantly reduce the number of equations examined by the planning phase and the number of equations solved by the evaluation phase.
Testable Design Representations for Mobile Augmented Reality Authoring
Authors: C. Geiger, V. Paelke, C. Reimann, W. Rosenbach, J. Stoecklein
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This paper applies the idea of a continuously testable design representation to authoring of augmented realities for mobile devices.
The Use of Standardized Documentary Data in Automatic Information Dissemination
Authors: Gerard Salton
Venue:  (1968)

It is likely that future operating information retrieval systems may be based on automatic information analysis methods instead of manual indexing, and on search procedures which allow the user to interact with the system during the search process. The effectiveness of the required analysis and search operations depends to some extent on the availability in machine readable form of standardized information concerning the make-up and content of each stored document. An author-prepared standard manuscript documentation unit, furnished with each manuscript, may simplify the information retrieval and dissemination operations, and improve their effectiveness. The design of such a documentation unit is covered and its use is explained for indexing, classification, vocabulary normalization, searching, and retrieval. 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
DNS-based Internet Client Clustering and Characterization
Authors: Azer Bestavros, Sumit Mehrotra
Venue:  (2001)

Abstract This paper proposes a novel protocol which uses the Internet Domain Name System (DNS) to partition Web clients into disjoint sets, each of which is associated with a single DNS server. We define an L-DNS cluster to be a grouping of Web Clients that use the same Local DNS server to resolve Internet host names. We identify such clusters in real-time using data obtained from a Web Server in conjunction with that server''s Authoritative DNS---both instrumented with an implementation of our clustering algorithm. Using these clusters, we perform measurements from four distinct Internet locations. Our results show that L-DNS clustering enables a better estimation of proximity of a Web Client to a Web Server than previously proposed techniques. Thus, in a Content Distribution Network, a DNS-based scheme that redirects a request from a web client to one of many servers based on the client''s name server coordinates (e.g., hops/latency/loss-rates between the client and servers) would perform better with our algorithm.
OPERA: A CORBA-based Architecture Enabling Distributed Real-Time Simulations
Authors: Thomas Usländer, François-Xavier Lebas
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

The mission of the EU-funded OPERA project is the training of operators in the area of chemical industry by means of flexible and configurable simulation applications running in a cost-effective IT environment. This paper outlines how the problem of real-time combined with the requirement for high performance computing may be solved in a standard environment. The OPERA system provides a way to integrate hybrid simulation models and is highly scalable. It runs both on a single computer and on multi-processor LAN clusters. OPERA results appear to be useful for solving many problems, far beyond the initial requirements in the domain of distributed simulation.
Practical Implementations of Arithmetic Coding
Authors: Paul G. Howard, Jeffrey S Vitter
Venue:  (1991)

We provide a tutorial on arithmetic coding, showing how it provides nearly optimal data compression and how it can be matched with almost any probabilistic model. We indicate the main disadvantage of arithmetic coding, its slowness, and give the basis of a fast, space-efficient, approximate arithmetic coder with only minimal loss of compression efficiency. Our coder is based on the replacement of arithmetic by table lookups coupled with a new deterministic probability estimation scheme.
Combinatorial Design of Multi-Ring Networks with Combined Routing and Flow Control
Authors: Wool Avishai, Yener Bulent
Venue:  (1999)

In this paper we present a novel design technique, and combined routing and flow control algorithms, for congestion-free packet switched networks. The design is based on the construction of multiple virtual rings, under the constraint that the path between any two nodes is either confined to a single ring, or traverses exactly two rings (passing through a single bridge node). Our best designs are constructed by using Finite Generalized Quadrangles of combinatorial design theory, together with a scaling algorithm for realizing networks of arbitrary size. The target topology is obtained by taking the edge union of the multiple virtual rings. Capitalizing on the underlying topological properties, we design routing, flow and access control protocols. We prove that the proposed network architecture, coupled with our protocols, ensures that (i) no loss due to congestion occurs inside a network, under arbitrary traffic patterns; (ii) all the packets reach their destinations within bounded time; and (iii) the bandwidth is allocated fairly and no host is starved. Moreover, we achieve these desirable properties much more efficiently than earlier proposals. Our best designs have a maximum route length of O(N^{1/3}) and require O(N^{1/3}) ports to be used at each node for an N-node network. The designs attain these bounds while manifesting a high degree of redundancy, with multiple disjoint paths between all pairs of nodes. This significantly improves upon the designs of [YOY94b,YOY98], where both the route length and number of ports are Omega(sqrt(N)), and only a single path exists between every pair of nodes. We also provide a theoretical bound for the impact of fairness and congestion-freeness on netwok utilization. We used this design technique to generate network designs of various sizes. We then implemented our protocols and verified their performance by simulations.
Towards an Effective and Integrated Design for Information Systems
Authors: B. Kouninef, M. K. Abdi, M. K. Rahmouni
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The development of Information Systems (I.S) is of great importance for researchers and industrial users. Different methods for I.S design have been proposed until now. Some of them put emphasis on the statical aspect, and others on the dynamical aspect. A third category of methods has recently appeared, which try to take into account both aspects, and therefore provide an unified view of data and treatments. In addition, there exist approaches that put the stress on rigor in the specification and validation process.This paper presents a Case Tool which constitute a conceptual help to Information Systems design: that tries, on one hand, to handle the statical and dynamical, aspects while providing, at the same time, the user with products that are readables and easy to understood and, on the other hand, to validate the specification obtained in a rigorous way. In fact, it is an attempt to satisfy both the designer and the user.
Sharing video on demand
Authors: Amotz Bar-Noy, Juan A. Garay, Amir Herzberg
Venue: Discrete Applied Mathematics (2003)

We formulate the problem of video on demand (VOD) from a resource allocation perspective. We introduce the decision element into a movie vending environment, which complements the current approaches. In contrast with the traditional resource allocation problems (e.g., machine scheduling), the problem possesses the distinctive batching property, which stands for the feasibility of several requests being served by one resource.First, we investigate the problem in an on-line fashion, namely, having to accept or reject a request for a movie without any knowledge about future requests. We show upper and lower bounds on the competitive ratio of on-line movie scheduling algorithms for a variety of scenarios depending on the notification time. In particular, when the length of the movie and the notification time on requests are linearly related, we present a simple competitive algorithm.Second, we propose a new approach--Shared VOD--which gives a more balanced functionality/ price tradeoff than the two popular approaches full VOD and near VOD. In this approach, several users may share the same channels, but the movies are selected by the users themselves.In this framework, we evaluate a variety of on-line channel allocation algorithms under "typical" conditions. We compare these strategies to the off-line strategy, and show that the algorithm we introduce substantially outperforms the rest.
DB2 UDB v8.1 for Sun Solaris: The Official Guide
Authors: Thomas Bauch, Mark Wilding
Venue:  (2003)

The definitive guide to DB2 Version 8 for Solaris -- straight from IBM's experts Covers planning, installation, configuration, administration, and optimization Shows how to leverage both Solaris and DB2 features to maximize performance and scalability Fully updated for the newest DB2 Universal Database V8 tools, features, and enhancementsPRENTICE HALLUpper Saddle River, NJ 07458www.phptr.com$59.99 U.S.$90.00 Canada0-13-046380-9IBM's DB2 Universal Database Version 8 for Solaris has been carefully engineered to deliver all of the immense power, flexibility, and scalability of DB2, while taking full advantage of the capabilities of Sun's Solaris operating system. Now, direct from IBM", there's a definitive guide to installing, running, and optimizing the latest versions of DB2 on the Solaris platform.DB2 for Solaris: The Official Guide offers systematic and authoritative guidance on every key decision and challenge you'll face, from choosing the right DB2 edition to monitoring and optimizing performance, implementing clustering to managing backup and recovery.This book presents never-before-published insights from IBM's DB2 for Solaris support experts, as well as the leader of IBM's DB2 Solaris port. You'll find best practices, techniques, tips, guidelines, and rules of thumb for all this, and more:Sum Installing DB2 on Solaris Working with disks, file systems, memory, and CPUs Using the graphical administration and monitoring tools of DB2 Optimizing database and Solaris operating system performance Implementing clusters with Veritas Cluster Server and Sun Cluster Managing client/server communications and TCP/IP networking Leveraging lightweight OS semaphores, kernelized asynchronous I/O, SMP processor sets, intimate shared memory, and other advanced Solaris features Utilizing inter-partition parallelism with DB2 Universal Database Enterprise Server Edition's Data Partitioning feature
Partitioned garbage collection of a large stable heap
Authors: B. Liskov, U. Maheshwari, T. Ng
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

This paper describes a new garbage collection scheme for large persistent object stores. The scheme makes efficient use of the disk and main memory and does not delay applications. The heap is divided into partitions that are collected independently using stable information about inter-partition references. We use novel techniques to maintain this information using in-memory data structures and a log to avoid disk accesses. The result is a scheme that truly preserves the localized and scalable nature of partitioned collection.
Exploring Query Expansion Strategies for MEDLINE
Venue:  (1995)

This paper evaluates the retrieval effectiveness of query expansion strategies on a MEDLINE test collection using Cornell University''s Smart retrieval system. Two expansion strategies are tested on their ability to identify appropriate MeSH terms for user queries: expansion using an inter--field statistical thesaurus and expansion via pure retrieval feedback. These expansion strategies do not require prior relevance decisions. The study compares retrieval effectiveness using the original unexpanded and the alternative expanded user queries on a collection of 75 queries and 2,334 MEDLINE citations. Retrieval effectiveness is assessed using eleven point average precision scores (11-AvgP). Expansion by retrieval feedback gives the best improvement of 16.4\% over a baseline performance of 0.5169 11-AvgP. Query expansion using the inter--field thesaurus gives a significant but lower performance improvement (9.9\%) over the same baseline. This study recommends query expansion using retrieval feedback for adding MeSH search terms to a user''s initial query. 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
Macromedia ColdFusion MX: Training from the Source
Authors: Kevin Schmidt, Nate Weiss
Venue:  (2002)

:If you're a Web designer recently tasked with using ColdFusion to build interactivity into your site or if you're just eager to learn how to create dynamic sites using Macromedia's leading Web application server, you'll want to read Macromedia ColdFusion MX: Training from the Source from cover to cover. This simple, concise guide uses step-by-step, project-based lessons developed in the Macromedia training centers to guide you through all of the program's basic features, both new and old. Every step has a screenshot so you can see exactly what you need to do, every step of the way. Even with no prior knowledge of ColdFusion, you'll learn how to use forms, retrieve database information, modify databases, work with advanced data types, create user defined functions, and more. Plus, the book ships with a companion CD-ROM that includes all of the lesson files used in the book as well as software demos, enabling you to immediately use what you've learned.
Computation Times of NP Sets of Different Densities
Authors: Juris Hartmanis, Yaacov Yesha
Venue:  (1983)

In this paper, we study the computational complexity of sets of different densities in NP. We show that the deterministic computation time for sets in NP can depend on their density if and only if there is a collapse or partial collapse of the corresponding higher nondeterministic and deterministic time bonded complexity classes. We show also that for NP sets of different densities there exist complete sets of the corresponding density under polynomial time Turing reductions. Finally, we show that these results can be interpreted as results about the complexity of theorem proving and proof presentation in axiomatized mathematical systems. This interpretation relates fundamental questions about the complexity of our intellectual tools to basic structural problems about P, NP, CoNP, and PSPACE, discussed in this paper.
Initial flexural failure prediction of fibre-reinforced laminated sector mindlin plates
Authors: M. Salehi, A. R. Sobhani
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Initial first ply failure prediction in laminated sector plates with shear deformation is carried out. This is achieved by solving a laminated sector plate field equations with the aid of dynamic relaxation method and then applying Tsai-Hill failure criterion to each of the layers. The loading on the plate is a uniform pressure loading with clamped edge constraints.
IEC 880: feedback of experience and guidelines for future work
Authors: N. N. Q. Thuy, F. Ficheux-Vapne
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

This paper presents an outline of the work currently done at Electricite de France for the identification of requirements applicable to software in category, B (as defined by publication 1226 of the IEC) systems. The first part presents an analysis of the weaknesses of publication 880 of the IEC, an existing and related standard expressing requirements applicable to software in category A systems. Based on this feedback of experience, the second part identifies some general recommendations and guidelines that should be followed for the establishment of requirements in a standard for software. The third part presents the main technical objectives that can be proposed for software in category B systems. These technical objectives are all derived from a unique primacy objective: safety integrity, i.e., the likelihood of software to achieve its safety functions under all stated conditions within a stated period of time.
Resource-Conscious Customization of CORBA for CAN-Based Distributed Embedded Systems
Authors: Kimoon Kim, Gwangil Jeon, Seongsoo Hong, Sunil Kim, Taehyung Kim
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

While recently emerging middleware technologies such as CORBA and DCOM address the complexity of distributed programming, they cannot be directly applied to distributed control system design due to their excessive resource demand and inadequate communication models.In this paper, we propose a new CORBA design for CAN-based distributed embedded control systems. Our design goal is to minimize its resource need and make it support group communication without losing the IDL (interface definition language) level compliance to the OMG standards. To achieve this, we develop a transport protocol on the CAN and a group communication scheme based on the well-known publisher/subscriber model. The protocol effectively realizes subject-based addressing and supports anonymous publisher/subscriber communication. We also customize the method invocation and message passing protocol, referred to as the general inter-ORB protocol (GIOP), of CORBA so that CORBA method invocations are efficiently serviced on a low-bandwidth network such as the CAN.This customization includes packed data encoding and variable-length integer encoding for compact representation of IDL data types. The new CORBA design clearly demonstrates that it is feasible to use CORBA in developing distributed embedded systems on real-time networks possessing severe resource limitations.
Admission Control and Scheduling for High Performance WWW Servers
Authors: Azer Bestavros, Naomi Katagai, Jorge Londono
Venue:  (1997)

Abstract In this paper we examine a number of admission control and scheduling protocols for high-performance web servers. In particular, we propose the use of a 2-phase policy for serving HTTP requests. The first ``registration'''' phase involves establishing the TCP connection for the HTTP request and parsing/iterpreting its arguments, whereas the second ``service'''' phase involves the service/transmission of data in response to the HTTP request. By introducing a delay between these two phases, we show that the performance of a web server could be improved significantly through the adoption of a number of scheduling policies that optimize the utilization of various system components (e.g. memory cache and I/O). In addition, to its premise for improving the performance of a single web server, the delineation between the registration and service phases of an HTTP request may be useful for load balancing purposes on clusters of web servers. We are investigating the use of such a mechanism as part of the Commonwealth testbed being developed at Boston University.
Autonomous Decentralized Scheduling Algorithm for a Job-Shop Scheduling Problem with Complicated Constraints
Authors: H. Iima, T. Hara, N. Ichimi, N. Sannomiya
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

This paper deals with a job-shop scheduling problem with complicated constraints. In this problem precedence relations exist not only among operations but also among jobs. The system has several types of single function machines and a type of multi-function machine. Furthermore, the number of machines belonging to each type is not single but plural. Therefore selection of the machine is necessary for executing each operation. In addition the problem has a multiobjective function. An autonomous decentralized scheduling algorithm is proposed to obtain a suboptimal solution of this problem. In this algorithm, a number of decision makers called subsystems cooperate with one another in order to attain the goal of the overall system. They determine the scheduling plan on the basis of their cooperation and the satisfaction of their own objective function levels. The effectiveness of the proposed algorithm is investigated by examining numerical results. Moreover, the algorithm is also applied to a rescheduling problem in the case where a machine breaks down.
Building Documentation Generators
Authors: Arie van Deursen, Tobias Kuipers
Venue: Proceedings of the IEEE International Conference on Software Maintenance (1999)

In order to maintain the consistency between sources and documentation, while at the same time providing documentation at the design level, it is necessary to generate documentation from sources in such a way that it can be integrated with hand-written documentation. In order to simplify the construction of documentation generators, we introduce island grammars, which only define those syntactic structures needed for (re)documentation purposes.We explain how they can be used to obtain various forms of documentation, such as data dependency diagrams for mainframe batch jobs.Moreover, we discuss how the derived information can be made available via a hypertext structure. We conclude with an industrial case study in which a 600,000 LOC COBOL legacy system is redocumented using the techniques presented in the paper.