ppxscal/embedding_network huggingface dataset:
Towards Multi-Site Collaboration in 3D Tele-Immersive Environments
Authors: Wanmin Wu, Zhenyu Yang, Indranil Gupta, Klara Nahrstedt
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

3D tele-immersion (3DTI) has recently emerged as a new way of video-mediated collaboration across the Internet. Unlike conventional 2D video-conferencing systems, it can immerse remote users into a shared 3D virtual space so that they can interact or collaborate "virtually". However, most existing 3DTI systems can support only two sites of collaboration, due to the huge demand of networking resources and the lack of a simple yet efficient data dissemination model. In this paper, we propose to use a general publish-subscribe model for multi-site 3DTI systems, which efficiently utilizes limited network resources by leveraging user interest. We focus on the overlay construction problem in the publish-subscribe model by exploring a spectrum of heuristic algorithms for data dissemination. With extensive simulation, we identify the advantages of a simple randomized algorithm. We present optimization to further improve the randomized algorithm by exploiting semantic correlation. Experimental results demonstrate that we can achieve an improvement by a factor of five.
Scalability of Grid Simulators: An Evaluation
Authors: Wim Depoorter, Nils Moor, Kurt Vanmechelen, Jan Broeckhove
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Due to the distributed nature of resources in grids that cover multiple administrative domains, grid resource management cannot be optimally implemented using traditional approaches. In order to investigate new grid resource management systems, researchers utilize simulators which allows them to efficiently evaluate new algorithms on a large scale. We have developed the Grid Economics Simulator (GES) in support of research into grid resource management in general and economic grid resource management in particular. This paper compares GES to SimGrid and GridSim, two established grid simulation frameworks. We demonstrate that GES compares favourably to the other frameworks in terms of scalability, runtime performance and memory requirements. We explain how these differences are related to the simulation paradigm and the threading model used in each simulator.
Real-Time Detection of Passing Objects Using Virtual Gate and Motion Vector Analysis
Authors: Daw-Tung Lin, Li-Wei Liu
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Real-time human tracking and pedestrian counting in very complex situations with different directions of motion has been important for video surveillance and our daily life applications. This work presents a virtual gate method for the pedestrian detection without the need to construct a background model a priori. The proposed method utilizes motion estimation with three step search and a novel motion vector analysis algorithm which detects moving objects passing through the gate along any desired direction. This method is particularly applicable to complex situations. The experimental results demonstrate that the proposed strategy is reliable.
Performance Evaluation of Workflows Using Continuous Petri Nets with Interval Firing Speeds
Authors: Kunihiko Hiraishi
Venue: Proceedings of the 29th international conference on Applications and Theory of Petri Nets (2008)

In this paper, we study performance evaluation of workflow-based information systems. Because of state space explosion, analysis by stochastic models, such as stochastic Petri nets and queuing models, is not suitable for workflow systems in which a large number of flow instances run concurrently. We use fluid-flow approximation technique to overcome this difficulty. In the proposed method, GSPN (Generalized Stochastic Petri Nets) models representing workflows are approximated by a class of timed continuous Petri nets, called routing timed continuous Petri nets (RTCPN). In RTCPN models, each discrete set is approximated by a continuous region on a real-valued vector space, and variance in probability distribution is replaced with a real-valued interval. Next we derive piecewise linear systems from RTCPN models, and use interval methods to compute guaranteed enclosures for state variables. As a case study, we solve an optimal resource assignment problem for a paper review process.
Incorporating Local Ca2 + Dynamics into Single Cell Ventricular Models
Authors: Anna Sher, David Abramson, Colin Enticott, Slavisa Garic, David Gavaghan, Denis Noble, Penelope Noble, Tom Peachey
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

Understanding physiological mechanisms underlying the activity of the heart is of great medical importance. Mathematical modeling and numerical simulation have become a widely accepted method of unraveling the underlying mechanism of the heart. Calcium (Ca2 + ) dynamics regulate the excitation-contraction coupling in heart muscle cells and hence are among the key players in maintaining normal activity of the heart. Many existing ventricular single cell models lack the biophysically detailed description of the Ca2 + dynamics. In this paper we examine how we can improve existing ventricular cell models by replacing their description of Ca2 + dynamics with the local Ca2 + control models. When replacing the existing Ca2 + dynamics in a given cell model with a different Ca2 + description, the parameters of the Ca2 + subsystem need to be re-fitted. Moreover, the search through the plausible parameter space is computationally very intensive. Thus, the Grid enabled Nimrod/O software tools are used for optimizing the cell parameters. Nimrod/O provides a convenient, user-friendly framework for this as exemplified by the incorporation of local Ca2 + dynamics into the ventricular single cell Noble 1998 model.
Iterative Search for Similar Documents on Mobile Devices
Authors: Kristóf Csorba, István Vajk
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

This paper presents a new method for searching documents which have similar topics to an already present document set. It is designed to help mobile device users to search for documents in a peer-to-peer environment which have similar topic to the ones on the users own device. The algorithms are designed for slower processors, smaller memory and small data traffic between the devices. These features allow the application in an environment of mobile devices like phones or PDA-s. The keyword list based topic comparison is enhanced with cascading, leading to a series of document searching elements specialized on documents not selected by previous stages. The architecture, the employed algorithms, and the experimental results are presented in this paper.
Pointer Analysis, Conditional Soundness, and Proving the Absence of Errors
Authors: Christopher L. Conway, Dennis Dams, Kedar S. Namjoshi, Clark Barrett
Venue: Proceedings of the 15th international symposium on Static Analysis (2008)

It is well known that the use of points-to information can substantially improve the accuracy of a static program analysis. Commonly used algorithms for computing points-to information are known to be sound only for memory-safe programs. Thus, it appears problematic to utilize points-to information to verify the memory safety property without giving up soundness. We show that a sound combination is possible, even if the points-to information is computed separately and only conditionally sound. This result is based on a refined statement of the soundness conditions of points-to analyses and a general mechanism for composing conditionally sound analyses.
Continuous Time Bayesian Networks for Host Level Network Intrusion Detection
Authors: Jing Xu, Christian R. Shelton
Venue: Proceedings of the European conference on Machine Learning and Knowledge Discovery in Databases - Part II (2008)

We consider the problem of detecting host-level attacks in network traffic using unsupervised learning. We model the normal behavior of a host's traffic from its signature logs, and flag suspicious traces differing from this norm. In particular, we use continuous time Bayesian networks learned from historic non-attack data and flag future event sequences whose likelihood under this normal model is below a threshold. Our method differs from previous approaches in explicitly modeling temporal dependencies in the network traffic. Our model is therefore more sensitive to subtle variations in the sequences of network events. We present two simple extensions that allow for instantaneous events that do not result in state changes, and simultaneous transitions of two variables. Our approach does not require expensive labeling or prior exposure to the attack type. We illustrate the power of our method in detecting attacks with comparisons to other methods on real network traces.
The Heart Pacemaker by Cellular Automata on Complex Networks
Authors: Danuta Makowiec
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

Specially desinged network of Greenberg-Hastings (GH) cellular automata is shown to be a reliable approximation to cardiac pacemaker. A complex network is built basing on a square lattice where some edges are rewired locally and with preference to link to cells which are more connected to other cells. GH automata are systems with cyclic intrinsic dynamics where three possible cell's states are characterized by timings -- time steps spent in each state. Complex networks of GH automata evolve rhythmically with periods determined by timings. Diversity of oscillations coexisting in the system depends on network topology. Large variety in oscillations is interpreted as effectiveness to response to actual needs of a body.
A Proposal for a Japanese Keyboard on Cellular Phones
Authors: Maurice Margenstern, Benoît Martin, Hiroshi Umeo, Shogo Yamano, Kazuhiro Nishioka
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

In this paper, we propose a new way to display alphabetical signs in order to write messages on a cellular phone in the Japanese language.
An Efficient Two-Party Identity-Based Key Exchange Protocol
Authors: Yuh-Min Tseng
Venue: Informatica (2007)

A key exchange (or agreement) protocol is designed to allow two entities establishing a session key to encrypt the communication data over an open network. In 1990, Gunther proposed an identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. Afterwards, several improved protocols were proposed to reduce the number of communication steps and the communicational cost required by Gunther's protocol. This paper presents an efficient identity-based key exchange protocol based on the difficulty of computing a discrete logarithm problem. As compared with the previously proposed protocols, it has better performance in terms of the computational cost and the communication steps. The proposed key exchange protocol provides implicit key authentication as well as the desired security attributes of an authenticated key exchange protocol.
Load-Balanced IP Fast Failure Recovery
Authors: Mingui Zhang, Bin Liu, Beichuan Zhang
Venue: Proceedings of the 8th IEEE international workshop on IP Operations and Management (2008)

As a promising approach to improve network reliability, Proactive Failure Recovery (PFR) re-routes data traffic to backup paths without waiting for the completion of routing convergence after a local link failure. However, the diverted traffic may cause congestion on the backup paths if it is not carefully split over multiple paths according to their available capacity. Existing approach assigns new link weights based on links' load and re-calculates the routing paths, which incurs significant computation overhead and is susceptible to route oscillations. In this paper, we propose an efficient scheme for load balancing in PFR. We choose an adequate number of different types of loop-free backup paths for potential failures, and once a failure happens, the affected traffic is diverted to multiple paths in a well balanced manner. We formulate the traffic allocation problem as a tractable linear programming optimization problem, which can be solved iteratively and incrementally. As a result, only the flows affected by the failures are re-allocated to backup paths incrementally without disturbing flows not directly affected by the failures. Simulation results show that our scheme is computationally efficient, can effectively balance link utilization in the network, and can avoid route oscillations.
Networking, 2nd edition
Authors: Jeffrey S. Beasley
Venue:  (2008)

Networking Second Edition Jeffrey S. Beasley This text provides a comprehensive look at computer networking from the point of view of the network administrator. It guides readers from an entry-level knowledge in computer networks to advanced concepts in Ethernet networks; router configuration; TCP/IP networks; local-, campus-, and wide-area network configuration; network security; optical networks; voice over IP; and industrial networks. Extensive examples on the Windows Server 2003/2008 configuration and system configuration for the Linux operating system are also included. A complete chapter is devoted to protecting and securing a network from potential network attacks. Topics include denial of service attacks, firewalls, intrusion detection, password cracking, packet sniffing, and analyzing unsecured data packets. Other key network security issues, such as configuring router access lists, configuring a virtual private network (VPN) connection, and securing wireless networks, are also covered. Router configuration is examined, ranging from an introduction to router configuration to configuring multiple routing protocols for intranet and Internet data traffic. Routing protocols key to basic network operations are examined, including static, RIP, IGRP, OSPF, EIGRP, and BGP. The discussions on routing protocols are accompanied with in-depth steps for configuring the router to run the protocol, verify operation, and troubleshoot the router. Key Pedagogical Features NET-CHALLENGE SOFTWARE provides a simulated, hands-on experience in configuring routers and switches. Exercises provided in the text and on the CD challenge readers to undertake certain router/switch network configuration tasks. The software has the look and feel of actually being connected to the router or switch console port. PROTOCOL ANALYZER SOFTWARE included with the text uses the Finisar Surveyor Demo. Examples of using the software to analyze data traffic are included throughout the text. ACCOMPANYING CD-ROM includes the Finisar Surveyor Demo software and captured data traffic used in the text, which enables readers to capture data traffic on their own networks. CONFIGURING, ANALYZING, or TROUBLESHOOTING sections are included with each chapter to guide the reader through advanced techniques in networking. OBJECTIVES and INTRODUCTION at the beginning of each chapter clearly outline specific goals for the reader. EXTENSIVE PROBLEM SETS, SUMMARIES, and QUESTIONS AND PROBLEMS (including Critical Thinking questions) are found at the end of each chapter. KEY TERMS and their definitions are highlighted in the margins to foster inquisitiveness and ensure retention.
Web Services Orchestration and Choreography
Authors: Chris Peltz
Venue: Computer (2003)

The terms orchestration and choreography describe two aspects of emerging standards for creating business processes from multiple Web services. The two terms overlap somewhat, but orchestration refers to an executable business process that can interact with both internal and external Web services. Orchestration always represents control from one party's perspective. This distinguishes it from choreography, which is more collaborative and allows each involved party to describe its part in the interaction.Proposed orchestration and choreography standards must meet several technical requirements that address the language for describing the process workflow and the supporting infrastructure.
Resource allocation on computational grids using a utility model and the knapsack problem
Authors: Daniel C. Vanderster, Nikitas J. Dimopoulos, Rafael Parra-Hernandez, Randall J. Sobie
Venue: Future Generation Computer Systems (2009)

This work introduces a utility model (UM) for resource allocation on computational grids and formulates the allocation problem as a variant of the 0-1 multichoice multidimensional knapsack problem. The notion of task-option utility is introduced, and it is used to effect allocation policies. We present a variety of allocation policies, which are expressed as functions of metrics that are both intrinsic and external to the task and resources. An external user-defined credit-value metric is shown to allow users to intervene in the allocation of urgent or low priority tasks. The strategies are evaluated in simulation against random workloads as well as those drawn from real systems. We measure the sensitivity of the UM-derived schedules to variations in the allocation policies and their corresponding utility functions. The UM allocation strategy is shown to optimally allocate resources congruent with the chosen policies.
A Generalised-Mutual-Information-Based Oracle for Hierarchical Radiosity
Authors: Jaume Rigau, Miquel Feixas, Mateu Sbert
Venue: Proceedings of the 7th international conference on Computational Science, Part II (2007)

One of the main problems in the radiosity method is how to discretise a scene into mesh elements that allow us to accurately represent illumination. In this paper we present a new refinement criterion for hierarchical radiosity based on the continuous and discrete generalised mutual information measures between two patches or elements. These measures, derived from the generalised entropy of of Harvda-Charvát-Tsallis, express the information transfer within a scene. The results obtained improve on the ones based on kernel smoothness and Shannon mutual information.
Endmember Extraction Methods: A Short Review
Authors: Miguel A. Veganzones, Manuel Graña
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III (2008)

The analysis of hyperspectral images on the basis of the spectral decomposition of their pixels through the so called spectral unmixing process, has applications in thematic map generation, target detection and unsupervised image segmentation. The critical step is the determination of the endmembers used as the references for the unmixing process. We give a comprehensive enumeration of the methods used in practice, because of its implementation in widely used software packages, and those published in the literature. We have structured the review according to the basic computational approach followed by the algorithms: those based on the computational geometry formulation, the ones following lattice computing ideas and heuristic approaches with a weak formal foundation.
A Framework for In-Network Management in Heterogeneous Future Communication Networks
Authors: Christopher Foley, Sasitharan Balasubramaniam, Eamonn Power, Miguel Ponce Leon, Dmitri Botvich, Dominique Dudkowski, Giorgio Nunzi, Chiara Mingardi
Venue: Proceedings of the 3rd IEEE international workshop on Modelling Autonomic Communications Environments (2008)

Future communication networks will be composed of a diversity of highly heterogeneous network variants, ranging from energy constrained wireless sensor networks to large-scale wide area networks. The fact that the size and complexity of such networks will experience tremendous growth will eventually render existing traditional network management paradigms unfeasible. We propose the radically new paradigm of in-network management, which targets the embedding of self-management capabilities deep inside the network nodes. In this paper, we focus on our framework for in-network management, which allows management logic to be embedded and executed within network nodes. Based on a specific use-case of bio-inspired network management, we demonstrate how our framework can be exploited in a network failure scenario using quorum sensing and chemotaxis.
Deep Packet Inspection using Parallel Bloom Filters
Authors: Sarang Dharmapurikar, Praveen Krishnamurthy, Todd S. Sproull, John W. Lockwood
Venue: IEEE Micro (2004)

Because conventional software-based packet inspection algorithms have not kept pace with high-speed networks, interest has turned to using hardware to process network data quickly. String scanning with Bloom filters can scan entire packet payloads for predefined signatures at multi-gigabit-per-second line speeds.
Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
Authors: Nir Halman, Chung-Lun Li, David Simchi-Levi
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We consider the deadline problem and budget problem of the nonlinear time-cost tradeoff project scheduling model in a series-parallel activity network. We develop fully polynomial time approximation schemes for both problems using K-approximation sets and functions, together with series and parallel reductions.
On the Impact of Mobile Hosts in Peer-to-Peer Data Networks
Authors: Zhenyun Zhuang, Sandeep Kakumanu, Yeonsik Jeong, Raghupathy Sivakumar, Aravind Velayutham
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Peer-to-peer (P2P) data networks dominate Internet traffic. In this work, we study the problems that arise when mobile hosts participate in P2P networks. We primarily focus on the performance issues as experienced by the mobile host, but also study the impact on other fixed peers. Using Bit Torrent as a key example, we identify several unique problems that arise due to the design aspects of P2P networks being incompatible with typical characteristics of wireless and mobile environments. We then present a wireless P2P (wP2P) client application that is backward compatible with existing fixed peer client applications, but when used on mobile hosts can significant improve performance.
Testing validity and reliability of classical school of strategicanagement
Authors: Lara Jelenc
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

School of strategic management is a concept that relates to paradigm, as the common way of perceiving process of strategic management. Sharing the same beliefs, judgments, point of view and values researches form a special way - paradigm of perceiving process of strategic management. The construct of classical school of strategic management consists of several premises and differ from other schools of strategic management. This paper is testing validity and reliability of the one of the schools of strategic management. Validity is tested with content validity and reliability with internal consistency coefficient Cronbach alfa. Only if the results show satisfying level of conformance of both of the tests, construct of the classical school of strategic management can be taken into further statistical analysis and the conclusion grasped from the data can meet the requirements of the scientific relevance and robustness.