ppxscal/embedding_network huggingface dataset:
Auto-Coding UML Statecharts for Flight Software
Authors: Ed Benowitz, Ken Clark, Garth Watney
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

Statecharts have been used as a means to communicate behaviors in a precise manner between system engineers and software engineers. Handtranslating a statechart to code, as done on some previous space missions, introduces the possibility of errors in the transformation from chart to code. To improve auto-coding, we have developed a process that generates flight code from UML statecharts. Our process is being used for the flight software on the Space Interferometer Mission (SIM).
A Generic Trust Overlay Simulator for P2P Networks
Authors: Wei Wang, Guosun Zeng
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Traditional overlay network simulators provide accurate low-level models of the network hardware and protocols but are but none of them deal with the problem of trust in the large scale overlay networks. We tackle this problem by employing a trust overlay simulator, which offer a viable solution to simulate trustworthy behavior in overlay networks. With this simulator, we can exam varies kinds of the trust and reputation mechanisms in the overlay environment. We hope that this simulator will help move the overlay network closer to fulfilling its promise by developing and testing trust and reputation-based protocols on it.
File System Support for Collaboration in theWide Area
Authors: Vasile Gaburici, Pete Keleher, Bobby Bhattacharjee
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

We describe the design, implementation, and performance of MFS, a new file system designed to support efficient widearea collaboration. MFS is structured around the twin abstractions of lightweight sessions and snapshots, along with a highly configurable capability-based security architecture. Sessions simplify and clarify collaborative semantics. Snapshots allow atomic access to arbitrary collections of files, and allow sharing to be defined in a simple and expressive fashion. MFS's security architecture is a layered system that allows diverse usage scenarios. Pure capability-based access allows clients to access data without needing expensive public key or authentication servers, or complicated administration. However, MFS's capabilities can also be watermarked, allowing a range of services to be added on a per-mount basis, up to and including traditional user authentication based on passwords or public keys. Basing the system around the use of immutable snapshots enables the underlying system to use several performance optimizations aggressively. Performance results from our MFS prototype show that, far from adding overhead, the use of snapshots allows the system to perform comparably to NFS in the local-area case and significantly outperform existing systems in wide-area environments.
A simple and efficient algorithm for multifocus image fusion using morphological wavelets
Authors: Ishita De, Bhabatosh Chanda
Venue: Signal Processing (2006)

This paper presents a simple yet efficient algorithm for multifocus image fusion, using a multiresolution signal decomposition scheme. The decomposition scheme is based on a nonlinear wavelet constructed with morphological operations. The analysis operators are constructed by morphological dilation combined with quadratic downsampling and the synthesis operators are constructed by morphological erosion combined with quadratic upsampling. A performance measure based on image gradients is used to evaluate the results. The proposed scheme has some interesting computational advantages as well.
Algorithmic construction of sets for k-restrictions
Authors: Noga Alon, Dana Moshkovitz, Shmuel Safra
Venue: ACM Transactions on Algorithms (TALG) (2006)

This work addresses k-restriction problems, which unify combinatorial problems of the following type: The goal is to construct a short list of strings in &Sigma;m that satisfies a given set of k-wise demands. For every k positions and every demand, there must be at least one string in the list that satisfies the demand at these positions. Problems of this form frequently arise in different fields in Computer Science.The standard approach for deterministically solving such problems is via almost k-wise independence or k-wise approximations for other distributions. We offer a generic algorithmic method that yields considerably smaller constructions. To this end, we generalize a previous work of Naor et al. [1995]. Among other results, we enhance the combinatorial objects in the heart of their method, called splitters, and construct multi-way splitters, using a new discrete version of the topological Necklace Splitting Theorem [Alon 1987].We utilize our methods to show improved constructions for group testing [Ngo and Du 2000] and generalized hashing [Alon et al. 2003], and an improved inapproximability result for SET-COVER under the assumption P &neq; NP.
Resolving mutually exclusive interactions in agent based distributed simulations
Authors: Lihua Wang, Stephen John Turner, Fang Wang
Venue: Proceedings of the 36th conference on Winter simulation (2004)

With the properties of autonomy, social ability, reactivity and pro-activeness, agents can be used to represent entities in distributed simulations, where fast and accurate decision making is a determining factor of the whole environment. Resolving concurrent interactions is a key problem of this kind of system, as the shared environment needs to allow agents to interact with the environment in a causally consistent way. There will usually be either mutually exclusive or collaborative interactions. This paper presents our research in designing a middleware component called Interaction Resolver (IR) to resolve the effect of concurrent interactions and still guarantee the consistency and causality of the system. The ownership management services provided by the High Level Architecture (HLA) are compared with IRs in resolving mutually exclusive interactions in our prototype, a minesweeping game. Conclusions are drawn based on the experimental results.
Clique-critical graphs: maximum size and recognition
Authors: Liliana Alcón
Venue: Discrete Applied Mathematics (2006)

The clique graph of G, K(G), is the intersection graph of the family of cliques (maximal complete sets) of G. Clique-critical graphs were defined as those whose clique graph changes whenever a vertex is removed. We prove that if G has m edges then any clique-critical graph in K-1 (G) has at most 2m vertices, which solves a question posed by Escalante and Toft [On clique-critical graphs, J. Combin. Theory B 17 (1974) 170-182]. The proof is based on a restatement of their characterization of clique-critical graphs. Moreover, the bound is sharp. We also show that the problem of recognizing clique-critical graphs is NP-complete.
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Authors: Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch
Venue: Distributed Computing (2005)

We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in mobile ad hoc networks. Our approach is based on associating abstract atomic objects with certain geographic locations. We assume the existence of focal points, geographic areas that are normally "populated" by mobile nodes. For example, a focal point may be a road junction, a scenic observation point, or a water resource in the desert. Mobile nodes that happen to populate a focal point participate in implementing a shared atomic object, using a replicated state machine approach. These objects, which we call focal point objects, are prone to occasional failures when the corresponding geographic areas are depopulated. The GeoQuorums algorithm uses the fault-prone focal point objects to implement atomic read/write operations on a fault-tolerant virtual shared object. The GeoQuorums algorithm uses a quorum-based strategy in which each quorum consists of a set of focal point objects. The quorums are used to maintain the consistency of the shared memory and to tolerate limited failures of the focal point objects, which may be caused by depopulation of the corresponding geographic areas. We present a mechanism for changing the set of quorums on the fly, thus improving efficiency. Overall, the new GeoQuorums algorithm efficiently implements read and write operations in a highly dynamic, mobile network.
Efficient large-scale BGP simulations
Authors: Xenofontas A. Dimitropoulos, George F. Riley
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2006)

Simulation has been the method of choice for analyzing large, complex, and highly volatile systems. One of these systems is the inter-domain routing infrastructure of the Internet. Despite the need for high quality Border Gateway Protocol (BGP) simulation tools, traditional BGP simulators have limitations either in their modeling fidelity or in their scalability. In this work we introduce BGP++, a scalable BGP simulator that employs state-of-the-art techniques to address the abstraction-scalability trade-off.BGP++ builds on high quality software in network simulation, routing and parallel-distributed simulation to deliver a detailed yet scalable implementation of BGP. Moreover, with respect to the needs of researchers and operators, BGP++ has a CISCO-like configuration language, a seamless partitioning engine for parallel-distributed simulations and a configuration toolset that expedites common simulation configuration tasks.
An Integrated Time Management Model for Distributed Workflow Management Systems
Authors: Jianxun Liu, Chunjie Zhou
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

This paper proposes an integrated time management model, DWfS-TMM, which consists of a set of general time ontology and a set of general rules for unified transformation between different time zones and different time granularity units. The description of build-time and run-time temporal constraints in workflow processes and the temporal consistency checking method in this model are investigated too.
Nonlinear Mean Shift for Clustering over Analytic Manifolds
Authors: Raghav Subbarao, Peter Meer
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

The mean shift algorithm is widely applied for nonparametric clustering in Euclidean spaces. Recently, mean shift was generalized for clustering on matrix Lie groups. We further extend the algorithm to a more general class of nonlinear spaces, the set of analytic manifolds. As examples, two specific classes of frequently occurring parameter spaces, Grassmann manifolds and Lie groups, are considered. When the algorithm proposed here is restricted to matrix Lie groups the previously proposed method is obtained. The algorithm is applied to a variety of robust motion segmentation problems and multibody factorization. The motion segmentation method is robust to outliers, does not require any prior specification of the number of independent motions and simultaneously estimates all the motions present.
Broad coverage paragraph segmentation across languages and domains
Authors: Caroline Sporleder, Mirella Lapata
Venue: ACM Transactions on Speech and Language Processing (TSLP) (2006)

This article considers the problem of automatic paragraph segmentation. The task is relevant for speech-to-text applications whose output transcipts do not usually contain punctuation or paragraph indentation and are naturally difficult to read and process. Text-to-text generation applications (e.g., summarization) could also benefit from an automatic paragaraph segementation mechanism which indicates topic shifts and provides visual targets to the reader. We present a paragraph segmentation model which exploits a variety of knowledge sources (including textual cues, syntactic and discourse-related information) and evaluate its performance in different languages and domains. Our experiments demonstrate that the proposed approach significantly outperforms our baselines and in many cases comes to within a few percent of human performance. Finally, we integrate our method with a single document summarizer and show that it is useful for structuring the output of automatically generated text.
Fair Transaction Protocols Based on Electronic Cash
Authors: Chun-I Fan, Yu-Kuang Liang, Bo-Wei Lin
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

In this paper, we will propose a novel fair transaction protocol based on electronic cash. With the extension of untraceable electronic cash, we have designed a fair transaction protocol to satisfy both the anonymity and the fairness properties simultaneously. Under the existence of an off-line trusted third party (TTP), the protocol is efficient and practical. Furthermore, the payment information of each customer is not revealed to anyone else including the TTP, and thus, the anonymity or privacy of the customer is protected completely in our protocol. Especially, the proposed method is independent of the underlying electronic cash (e-cash) scheme such that it can be realized by any e-cash system based on the concept of blind signatures.
X-SIGMA: XML Based Simple Data Integration System for Gathering, Managing, and Accessing Scientific Experimental Data in Grid Environments
Authors: Dongkwang Kim, Karpjoo Jeong, Suntae Hwang, Kum Won Cho
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

Effective scientific data management is crucial for e-Science applications. Scientific data management raises challenging requirements: (1) support for not only experimental data but also context data, (2) both schema evolution and integration, (3) and compatibility with legacy data management conventions or environments. In this paper, we present a scientific data management system (called XSIGMA) which is designed to address those issues. X-SIGMA is a Grid-based integrated system for managing, integrating, and accessing scientific experimental data. A prototype system is implemented and has been being used to develop the scientific data management system for the national cyberinfrastructure project called KOCED in Korea.
Multistability in a driven nonlinear system controlled by weak subharmonic perturbations
Authors: V. N. Chizhevsky, R. Corbalan
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

It is shown that weak resonant perturbations at sub-harmonic frequencies can induce and control multi-stability in a wide class of nonlinear systems, which display the period doubling route into chaos or possess isolated subharmonic branches. The number of attractors induced depends on the subharmonic frequency, amplitude and phase of periodic perturbations as well as an initial dynamical state of nonlinear systems. Besides, phase scaling relations for the onsets of both saddle-node bifurcations and boundary crises induced by resonant periodic perturbations at subharmonic frequencies are found from the numerical simulation. These phase dependences determine the domains of existence of induced attractors in (bifurcation parameter, perturbation phase) parameter space. The overlapping of these domains leads to the formation of zones with different number of coexisting attractors. Experimental and numerical evidences are given on the basis of a loss-modulated CO/sub 2/ laser.
Synthesis of Synchronous Interfaces
Authors: Purandar Bhaduri, S. Ramesh
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

Reuse of IP blocks has been advocated as a means to conquer the complexity of today's system-on-chip (SoC) designs. Component integration and verification in such systems is a cumbersome and time consuming process. We present synchronous interface automata (SIA) as a framework for modelling communication aspects of IP blocks, to serve as a unifying model in the top-down refinement, synthesis and verification stages of the design process. We show how to formally specify component composition and protocol compatibility in our model, and how we can apply the model to the problem of synthesising converters for incompatible protocols of interaction between IP blocks. Our model is based on the game theoretic framework of interface automata, suitably adapted for practical modelling of IP blocks.
Hierarchical Model Fitting to 2D and 3D Data
Authors: A. van den Hengel, A. Dick, T. Thormahlen, B. Ward, P. H. S. Torr
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

We propose a method for interactively generating a model-based reconstruction of a scene from a set of images. The method facilitates the fitting of multiple object models to the data in a manner that provides the best overall fit to the image set. This requires that models are not fit independently, but rather collectively, each potentially impacting upon the fit of the other.
Improve Searching by Reinforcement Learning in Unstructured P2Ps
Authors: Xiuqi Li, Jie Wu
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Existing searching schemes in unstructured P2Ps can be categorized as either blind or informed. The quality of query results in blind schemes is low. Informed schemes use simple heuristics that lack the theoretical background to support the simulation results. In this paper, we propose to improve searching by reinforcement learning (RL), which has been proven in artificial intelligence to be able to learn the best sequence of actions in order to achieve a certain goal. Our approach, ISRL (intelligent searching by reinforcement learning), aims at locating the best path to desired files at low cost. It explores new paths by forwarding queries to randomly chosen neighbors. It also exploits the paths that have been discovered to reduce the cumulative query cost. Two models of ISRL are proposed: the basic ISRL for finding one desired file, and MP-ISRL (multipath ISRL) for finding multiple desired files. ISRL outperforms existing searching approaches in unstructured P2Ps by achieving higher query quality with less query traffic. The experimental result supports the performance improvement of ISRL.
A Fast-Startup TCP Mechanism for VoIP Services in Long-Distance Networks
Authors: Mong-Fong Horng, Hung-Wei Hsu, Wan-Ling Du, Yi-Hsiang Hung, Ming-Harng Lee
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, a fast-startup TCP (fsTCP) mechanism for VoIP services in long-distance networks is proposed. Most VoIP applications usually operate on the top of UDP/IP protocol. However, there are some weaknesses in long-distance connections. For example, UDP offers no congestion control and no adjustment in voice packet rate. Traditional TCP protocol employees sliding windows to solve the problems, but the slow-startup feature of TCP causes a low initial throughput of VoIP connections at startup. The low throughput caused by TCP slow-start operation is not able to meet the bit-rate requirement of VoIP Codec. The quality of voice will degrade seriously during startup period of TCP. To improve the deficiency, the fast-startup TCP is proposed. A feasibility study of TCP-like congestion control applied on VoIP services. The proposed scheme improves throughputs of VoIP connections by adjusting TCP congestion window parameters before transmitting VoIP data. Three popular VoIP codecs, including G.711, G.726 and G. 729, are simulated in the proposed TCP to demonstrate the fast start-up throughput characteristics. Via the sliding window of congestion control, the VoIP services operating on TCP protocol will be able to adjust the bit-rates of codec in response to the time-varying network dynamics.
New grid scheduling and rescheduling methods in the GrADS project
Authors: F. Berman, H. Casanova, A. Chien, K. Cooper, H. Dail, A. Dasgupta, W. Deng, J. Dongarra, L. Johnsson, K. Kennedy, C. Koelbel, B. Liu, X. Liu, A. Mandal, G. Marin, M. Mazina, J. Mellor-Crummey, C. Mendes, A. Olugbile, Jignesh M. Patel, D. Reed, Z. Shi, O. Sievert, H. Xia, A. YarKhan
Venue: International Journal of Parallel Programming (2005)

The goal of the Grid Application Development Software (GrADS) Project is to provide programming tools and an execution environment to ease program development for the Grid. This paper presents recent extensions to the GrADS software framework: a new approach to scheduling workflow computations, applied to a 3-D image reconstruction application; a simple stop/migrate/restart approach to rescheduling Grid applications, applied to a QR factorization benchmark; and a process-swapping approach to rescheduling, applied to an N-body simulation. Experiments validating these methods were carried out on both the GrADS MacroGrid (a small but functional Grid) and the MicroGrid (a controlled emulation of the Grid).
A Prototype of Autonomous Intelligent Surveillance Cameras
Authors: Wanqing Li, Igor Kharitonenko, Serge Lichman, Chaminda Weerasinghe
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

This paper presents an architecture and an FPGAbased prototype of an autonomous intelligent video surveillance camera. The camera takes the advantage of high resolution of CMOS image sensors and enables instantly automatic pan, tilt and zoom adjustment based upon motion activity. It performs automated scene analysis and provides immediate response to suspicious events by optimizing camera capturing parameters. The video output of the camera can be optimized to any region of interest while the camera continues to monitor the entire scene. Field trials of the prototyped camera have verified the proposed architecture.
Managing Diversity in Regression Ensembles
Authors: Gavin Brown, Jeremy L. Wyatt, Peter Tiňo
Venue: The Journal of Machine Learning Research (2005)

Ensembles are a widely used and effective technique in machine learning---their success is commonly attributed to the degree of disagreement, or 'diversity', within the ensemble. For ensembles where the individual estimators output crisp class labels, this 'diversity' is not well understood and remains an open research issue. For ensembles of regression estimators, the diversity can be exactly formulated in terms of the covariance between individual estimator outputs, and the optimum level is expressed in terms of a bias-variance-covariance trade-off. Despite this, most approaches to learning ensembles use heuristics to encourage the right degree of diversity. In this work we show how to explicitly control diversity through the error function. The first contribution of this paper is to show that by taking the combination mechanism for the ensemble into account we can derive an error function for each individual that balances ensemble diversity with individual accuracy. We show the relationship between this error function and an existing algorithm called negative correlation learning, which uses a heuristic penalty term added to the mean squared error function. It is demonstrated that these methods control the bias-variance-covariance trade-off systematically, and can be utilised with any estimator capable of minimising a quadratic error function, for example MLPs, or RBF networks. As a second contribution, we derive a strict upper bound on the coefficient of the penalty term, which holds for any estimator that can be cast in a generalised linear regression framework, with mild assumptions on the basis functions. Finally we present the results of an empirical study, showing significant improvements over simple ensemble learning, and finding that this technique is competitive with a variety of methods, including boosting, bagging, mixtures of experts, and Gaussian processes, on a number of tasks.