ppxscal/embedding_network huggingface dataset:
The Directed Subgraph Homeomorphism Problem
Authors: Steven Fortune, John E. Hopcroft, James C. Wyllie
Venue:  (1978)

The set of pattern graphs for which the directed subgraph homeomorphism problem is NP-complete is characterized. A polynomial time algorithm is given for the remaining cases. The restricted problem where the input graph is a directed acyclic graph is in polynomial time for all pattern graphs and an algorithm is given.
An Efficient Resource Allocation Scheme for Gang Scheduling
Authors: B. B. Zhou, P. Mackerras, C. W. Johnson, D. Walsh, P. Brent
Venue: Proceedings of the 1st IEEE Computer Society International Workshop on Cluster Computing (1999)

Gang scheduling is currently the most popular scheduling scheme for parallel processing in a time shared environment. One major drawback of using gang scheduling is the problem of fragmentation. The conventional method to alleviate this problem is to allow jobs running in multiple time slots. However, our experimental results show that simply applying this method alone cannot solve the problem of fragmentation, but on the contrary it may eventually degrade the efficiency of system resource utilization.In this paper we introduce an efficient resource allocation scheme which effectively incorporates the ideas of re-packing jobs, running jobs in multiple slots and minimizing time slots into the buddy allocation system to significantly improve the system and job performance. Because there is no process migration involved in job re-packing, this scheme is particularly suitable for clustered parallel computing systems.
Scatter Search: Methodology and Implementation in C
Authors: Manuel Laguna, Karen Price Hossell, Rafael Marti
Venue:  (2002)

:The evolutionary approach called scatter search originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of this approach for solving a diverse array of optimization problems from both classical and real world settings. Scatter search contrasts with other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on generalized path constructions in Euclidean space and by utilizing strategic designs where other approaches resort to randomization. The book's goal is to provide the basic principles and fundamental ideas that will allow the readers to create successful applications of scatter search. The book includes the C source code of the methods introduced in each chapter.
E-Ffective Writing for E-Learning Environments
Authors: Katy Campbell
Venue:  (2003)

Demonstrating how organizations around the world are capitalizing on new technologies such as the Internet and the World Wide Web to develop e-business, this book shows how evolving e-business models, integrated solutions, and improved technological infrastructure are continuously changing the way business is conducted. This discusses the ways in which the e-business revolution brings new ways of dealing with customers and business partners, new revenue streams, new ways of processing information, and new organization structures. In addition, advice is provided on developing new skill sets, electronic supply chains, new standards and policies, new collaborations and adaptable business strategies. --This text refers to the Paperback edition.
Mean Flows and the Onset of Chaos in Large-cell Convection
Authors: S H Greenside, C M Cross, M W Coughran
Venue:  (1988)

Numerical simulations of two-dimensional model equations show that a coupling between amplitude and vertical-vorticity fields allows chaotic flows near the onset of Rayleigh-B\''{e}nard convection in large aspect ratio domains. In cylindrical cells, mean flows arising from this coupling lead to a chaotic nucleation of dislocations that is remarkably similar to recent observations in convection experiments.
Servlets and JSP: The J2EE Web Tier
Authors: Falkner, Kevin W. Jones
Venue:  (2003)

Servlets and JavaServer Pages™ is the first complete guide to building dynamic Java-based Web applications using the new JavaServer Pages 2.0 and Servlets 2.4. Servlets and JavaServer Pages (JSP) provide a robust solution to developing large, complex Web applications, including multiserver projects. In addition to built-in security, portability, and a Web server, they offer developers the freedom to work with any operating system that supports Java-be it Linux, Windows, OSX, or Solaris.This authoritative book begins by explaining how to set up a Servlet and JSP development environment, including a discussion of containers, Java support, and installing and configuring Tomcat. The authors then thoroughly explore servlets and JSP, including significant coverage of custom tag libraries, newly available filters, and popular servlet and JSP design patterns. Readers can then test-drive the knowledge gained by constructing a book-support Web site.Among the topics covered in-depth are: Exception handling JavaBeans and the new JSP Expression Language (JSP EL) The JavaServer Pages Standard Tag Library (JSTL) and coding custom tag libraries Filters Error handling Session and state management Security Design patterns, including Struts Internationalization Multiclient support Database connectivityThe actual book-support site (www.jspbook.com) features frequently asked questions, working code examples, and references.With Servlets and JavaServer Pages™ as their guide, readers will learn how to fully harness the power of these flexible Java technologies. 0321136497B05082003
A comparison of hard-state and soft-state signaling protocols
Authors: Ping Ji, Zihui Ge, Jim Kurose, Don Towsley
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

One of the key infrastructure components in all telecommunication networks, ranging from the telephone network, to VC-oriented data networks, to the Internet, is its signaling system. Two broad approaches towards signaling can be identified: so-called hard-state and soft-state approaches. Despite the fundamental importance of signaling, our understanding of these approaches - their pros and cons and the circumstances in which they might best be employed - is mostly anecdotal (and occasionally religious). In this paper, we compare and contrast a variety of signaling approaches ranging from a "pure" soft state, to soft-state approaches augmented with explicit state removal and/or reliable signaling, to a "pure" hard state approach. We develop an analytic model that allows us to quantify state inconsistency in single- and multiple-hop signaling scenarios, and the "cost" (both in terms of signaling overhead, and application-specific costs resulting from state inconsistency) associated with a given signaling approach and its parameters (e.g., state refresh and removal timers). Among the class of soft-state approaches, we find that a soft-state approach coupled with explicit removal substantially improves the degree of state consistency while introducing little additional signaling message overhead. The addition of reliable explicit setup/update/removal allows the soft-state approach to achieve comparable (and sometimes better) consistency than that of the hard-state approach.
Non-linear analysis of continuous composite beams by a mixed approach
Authors: A. Dall'Asta, A. Zona
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

A three fields mixed finite element is proposed for the non-linear analysis of composite beams with weak shear connection. The formulation is based on the Hu-Washizu functional and considers the non-linear behaviour of materials and deformable shear connectors. Numerical applications are performed using as working example a steel-concrete two span continuous beam that is of practical interest in structural engineering and a difficult test for composite beam elements. The results are discussed and comparisons are made between the established mixed element and displacement based elements adopted by the authors in previous works.
Fault Tolerant Shared-Object Management System with Dynamic Replication Control Strategy
Authors: Juan Carlos Leonardo, Takaichi Yoshida, Shuji Narazaki
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

This paper is based on a dynamic replication control strategy for minimizing communications costs. In dynamic environments where the access pattern to share resources can not be predicted statically, it is required to monitor such parameter during the whole lifetime of the system so as to adapt it to new requirements. The shared-object management system is implemented in a centralized manner in which a master processor deals with the serialization of invocations. On one hand, we attempt to provide fault tolerance as a way to adjust the system parameters to work only with a set of correct processors to enhance system functionality. On the other hand, we attempt to furnish availability by masking the failure of the master processor. A new master processor is elected that resumes the master processor processing. Our shared-object management system modularity is realized through a Meta level implementation.
An Integrated Development Environment for Distributed Multi-Agent Applications
Authors: Anshu Mehra, Virginio Chiodini
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

This paper presents an Agent Development Environment (ADE) for building distributed multi-agent applications. ADE provides a predefined class hierarchy of agents and agent parts, an agent communications "middleware," and a graphical language for designing and developing agent behavior based on the Grafcet standard. In addition, ADE provides a distributed simulation environment to test agent-based applications, and a center to deploy agents on the network. In this paper we provide a brief overview of ADE and present two Adaptive Control applications developed with ADE.
The secular salvation story of the digital divide
Authors: Kevin McSorley
Venue: Ethics and Information Technology (2003)

Despite much discussion of the digital divide, little academic work has directly analyzed the specific political and policy contexts in which the concept is being developed and deployed. This paper undertakes an analysis of one such initiative, the activity of the supranational Digital Opportunity Task Force (DOT Force). The analysis provides a critical discursive analysis of the final report of the DOT Force, together with thick description of the processes by which it was produced. The resolution of numerous antagonisms between the participants in the narrative of the final report reflects the field of power in which the DOT Force operates. The issue of the digital divide can be best understood as providing a generative resource through which the various political interests represented in the DOT Force process can normatively reconfigure the conceptual and ethical possibilities it signifies to renew a dominant, singular `secular salvation story' of the global. The specific closure, articulation and legitimation of the digital divide instantiates an action-oriented temporality and a transformed moral agenda, from a concern with inequality to a pressing inclusionary imperative to connect with the promise of technology and development.
Proof Procedures for Logic Programming
Authors: W D Loveland, Gopalan Nadathur
Venue:  (1994)

Proof procedures are an essential part of logic applied to artificial intelligence tasks, and form the basis for logic programming languages. As such, many of the chapters throughout this handbook utilize, or study, proof procedures. The study of proof procedures that are useful in artificial intelligence would require a large book so we focus on proof procedures that relate to logic programming. We begin with the resolution procedures that influenced the definition of SLD-resolution, the procedure upon which Prolog is built. Starting with the general resolution procedure we move through linear resolution to a very restricted linear resolution, SL-resolution, which actually is not a resolution restriction, but a variant using an augmented logical form. (SL-resolution actually is a derivative of the Model Elimination procedure, which was developed independently of resolution.) We then consider logic programming itself, reviewing SLD-resolution and then describing a general criterion for identifying inference systems that can serve as bases for logic programming. This criterion requires, in essence, that logical symbols exhibit a duality between a declarative and a search-related meaning and we present the notion of a uniform proof as a means for formalizing such a duality. We describe some first-order systems that extend the Horn clause logic while satisfying this criterion. The usefulness of these extended systems from the perspective of programming and the construction of proof procedures for them is then examined. The third section discusses two proposed logic programming languages that extend Prolog in a manner that overcomes some of its limitations. Specifically, these proposals involve the addition of hypothetical implication and positive disjunctions. These extensions are viewed from the perspective of constructing uniform proofs.
Optimization problems from feature testing of communication protocols
Authors: D. Lee, M. Yannakakis
Venue: Proceedings of the 1996 International Conference on Network Protocols (ICNP '96) (1996)

In feature testing of communication protocols, we want to construct a minimal number of tests with a desirable fault coverage. We model the protocols by extended finite state machines and reduce the test generation process to optimization problems on graphs. We study efficient algorithms and their complexity. We report experimental results on real systems, including Personal HandyPhone System, a 5ESS based ISDN wireless system, and 5ESS Intelligent Network Application Protocol.
Modifying agent systems for an open, dynamic agent environment
Authors: Adam L. Berger, Robert R. Kessler
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Most agent systems today are closed and static. That is, one builds agent systems in which the set of agents is specified ahead of time and ontologies and protocols are predefined. Today's Internet is open and dynamic. We describe a new approach to constructing agents that matches the open, dynamic environment of the Internet, and the supporting infrastructure required to make such an approach work. This includes the use of a central dictionary of well-defined keywords and a simplified interaction protocol that better fits a dynamic environment by enabling greater flexibility and adaptation over time.
Windows Server 2003 in 24 Hours
Authors: Habraken
Venue:  (2003)

:Windows .NET Server fixes problems such as security and scalability found in Windows 2000 and adds a number of new services and application deployment tools. This book should appeal to many IT professionals who wish to configure a .NET test Server and read about its deployment. Network administrators and IT professionals often want a quick fix when it comes to learning about new IT solutions such as the .NET Server software. This book provides a hands-on approach to quickly learning and running the features of .NET Server. The book will also provide information on advanced features such as routing and remote access and Virtual Private Networking, which is often skipped in books of this size and intent. 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
Use of Statistical Methods to Reduce Delays for Media Playback Buffering
Authors: Prathima Agrawal, Cormac J. Sreenan, Jyh-Cheng Chen
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems (1998)

Receiver playback buffers are required to smooth network delay variations. A playback buffer operates by introducing additional delay, acting as a holding area for packets whose scheduled playback time is in the future. Packets which arrive after their scheduled playback time are considered late and are discarded. The algorithms commonly used in the Internet are reactive, in that measure immediate network delay variations and then adjust the buffer size to avoid lateness, resulting in potentially large end to end delays and frequent buffer changes. This paper works with an alternative predictive approach, which records historical information and uses it to make short-term predictions about network delay, with the aim of not reacting too quickly to short-lived variations. This allows an application-controlled trade-off of packet lateness against buffering delay, suitable for applications which demand low delay but can tolerate or conceal a small amount of late packets. This paper builds on previous work by proposing aging techniques to improve delay predictions, evaluating performance using trace-driven simulation.
SYN-dog: Sniffing SYN Flooding Sources
Authors: Haining Wang, Danlu Zhang, Kang G. Shin
Venue: Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02) (2002)

This paper presents a simple and robust mechanism called SYN-dog to sniff SYN flooding sources. We install SYN-dog as a software agent at leaf routers that connect stub networks to the Internet. The statelessness and low computation overhead of SYN-dog make itself immune to any flooding attacks. The core mechanism of SYN-dog is based on the protocol behavior of TCP SYN-SYN/ACK pairs, and is an instance of the Sequential Change Detection [1]. To make SYN-dog insensitive to site and access pattern, a non-parametric CumulativeSum (CUSUM) method [4] is applied, thus making SYN-dog much more generally applicable and its deployment much easier. Due to its proximity to the flooding sources, SYN-dog can trace the flooding sources without resorting to expensive IP traceback.
Classification of Material Mixtures in Volume Data for Visualization and Modeling
Authors: David H. Laidlaw, Kurt W. Fleischer, Alan H. Barr
Venue:  (1994)

Material classification is a key stop in creating computer graphics models and images from volume data, We present a new algorithm for identifying the distribution of different material types in volumetric datasets such as those produced with Magnetic Resonance Imaging (NMI) or Computed Tomography (CT). The algorithm assumes that voxels can contain more than one material, e.g. both muscle and fat; we wish to compute the relative proportion of each material in the voxels. Other classification methods have utilized Gaussian probability density functions to model the distribution of values within a dataset. These Gaussian basis functions work well for voxels with unmixed materials, but do not work well where the materials are mixed together. We extend this approach by deriving non-Gaussian "mixture" basis functions. We treat a voxel as a volume, not as a single point. We use the distribution of values within each voxel-sized volume to identify materials within the voxel using a probabilistic approach. The technique reduces the classification artifacts that occur along boundaries between materials. The technique is useful for making higher quality geometric models and renderings from volume data, and has the potential to make more accurate volume measurements. It also classifies noisy, low-resolution data well.
Acquisition system for syntactic and semantic type and selection. SPARKLE Deliverable 7.2.
Authors: Ted Briscoe, Diana McCarthy, John Carroll, Paolo Allegrini, Nicoletta Calzolari, Stefano Federici, Simonetta Montemagni, Vito Pirrelli, Steven Abney, Franz Beil, Glenn Carroll, Marc Light, Detlef Prescher, Stefan Riezler, Matz Rooth
Venue:  (1999)

This report describes the acquisition system for syntactic and semantic type and selection of the Cambridge, Pisa and Stuttgart groups in the EC SPARKLE project.
Solving Problems in the Presence of Process Crashes and Lossy Links
Authors: Anindya Basu, Bernadette Charron-Bost, Sam Toueg
Venue:  (1996)

We study the effect of link failures on the solvability of problems in asynchronous systems that are subject to process crashes: given a problem that can be solved in a system with process crashes and reliable links, is the problem solvable even if links are lossy? We answer this question for two types of lossy links, and show that the answer depends on the maximum number of processes that may crash and the nature of the problem to be solved. In particular, we prove that the answer is positive if fewer than half of the processes may crash or if the problem specification does not refer to the state of processes that crash. However, in general, the answer is negative even if each link can loose only a finite number of messages.
Combining Textual and Visual Cues for Content-based Image Retrieval on the World Wide Web
Authors: Marco La Cascia, Sarathendu Sethi, Stan Sclaroff
Venue:  (1998)

Abstract Some WWW image engines allow the user to form a query in terms of text keywords. To build the image index, keywords are extracted heuristically from HTML documents containing each image, and/or from the image URL and file headers. Unfortunately, text-based image engines have merely retro-fitted standard SQL database query methods, and it is difficult to include images cues within such a framework. On the other hand, visual statistics ({\em e.g.}, color histograms) are often insufficient for helping users find desired images in a vast WWW index. By truly unifying textual and visual statistics, one would expect to get better results than either used separately. In this paper, we propose an approach that allows the combination of visual statistics with textual statistics in the vector space representation commonly used in query by image content systems. Text statistics are captured in vector form using latent semantic indexing (LSI). The LSI index for an HTML document is then associated with each of the images contained therein. Visual statistics ({\em e.g.}, color, orientedness) are also computed for each image. The LSI and visual statistic vectors are then combined into a single index vector that can be used for content-based search of the resulting image database. By using an integrated approach, we are able to take advantage of possible statistical couplings between the topic of the document (latent semantic content) and the contents of images (visual statistics). This allows improved performance in conducting content-based search. This approach has been implemented in a WWW image search engine prototype.
MobileSpaces: A Framework for Building Adaptive Distributed Applications Using a Hierarchical Mobile Agent System
Authors: Ichiro Satoh
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

This paper presents a new framework for constructing mobile agents. The framework introduces the notion of agent hierarchy and inter-agent migration and thus allows a group of mobile agents to be dynamically assembled into a single mobile agent. It provides a powerful method to construct a distributed application, in particular a large-scale mobile application.To demonstrate how to exploit our framework, we construct an extensible and portable mobile agent system based on the framework. The system is implemented as a collection of mobile agents and thus can dynamically change and evolve its functions by migrating agents that offer the functions. Also, mobile agent-based applications running on the system can naturally inherit the extensibility and adaptability of the system.