ppxscal/embedding_network huggingface dataset:
Novel Mathematics-Inspired Algorithms for Self-Adaptive Peer-to-Peer Computing
Authors: Steven Y. Ko, Indranil Gupta, Yookyung Jo
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

This paper describes, and evaluates benefits of, a design methodology to translate certain mathematical models into the design of novel, self-adaptive, peer-to-peer (p2p) distributed computing algorithms ("protocols"). This methodology is potentially a good vehicle for translating natural phenomena, representable via mathematical models, into practical p2p protocols. Concretely, our first contribution is a set of techniques to translate certain discrete "sequence equations" rigorously into new p2p protocols called "sequence protocols". Sequence protocols are self-adaptive, scalable, and fault-tolerant, with applicability in p2p settings like Grids. A sequence protocol is a set of probabilistic local and message-passing actions for each process. These actions are translated from terms in a set of source sequence equations. Without having each process simulate the source sequence equations, the emergent behavior of a sequence protocol in a p2p system is equivalent to, and predicted by, its source sequence equations. This paper's second contribution is a new self-adaptive Grid computing protocol called "HoneyAdapt". HoneyAdapt is derived from sequence equations modeling adaptive bee foraging behavior in nature. HoneyAdapt is intended for Grid applications that allow Grid clients, at run-time, a choice of algorithms for executing chunks of the application's dataset. HoneyAdapt tells each Grid client how to adaptively select at run-time, for each chunk it receives, a "good" algorithm for computing the chunk - this selection is based on continuous feedback from other clients. We present analysis, large-scale simulation results, and deployment results.
Defending against the wily surfer: web based attacks and defenses
Authors: Daniel V. Klein
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

Intrusions are often viewed as catastrophic events which destroy systems, wreak havoc on data through corruption or substitution, yield access to closely guarded sensitive information, or provide a springboard for hackers to attack other systems. Yet not all intrusions on the Web are the blatant, smash-and-grab, trash-the-site kind of attacks. Many attacks are more subtle, and some involve what appears to be normal access to the site (but appearances are deceiving!) This paper presents a compendium of some of the dirty tricks on the Web. These are used to steal bandwidth and server load (as well as revenue) from web sites around the Internet. Other tricks funnel hits to sites other than the intended destination, while additional, more obvious techniques are used to bypass payment schemes and gain free access to sites. A different class of attacks targets the client, instead of the server. Some of the dirty tricks are preventable up-front, while others can only be detected after the security holes have been exploited - and always, there needs to be a balance between accessibility and vulnerability. We present a compendium of problems, attacks, and solutions. Many of the attacks and preventions seem "obvious" once known - this paper aims to forearm by forewarning the reader.
Dynamic Engines -- A Flexible Approach to the Extension of Legacy Code and Process-Oriented Application Development
Authors: Werner Wild, Regina Wirtensohn, Barbara Weber
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Today companies are faced with global competition and ever changing customer demands. Thus the success of a company more and more depends on its ability to flexibly and quickly react to changes. In this paper we present the Dynamic Engines, which allow for the flexible IT support of business processes in highly dynamic environments like the logistics industry, by extracting process logic and business rules from application programs.
A Hybrid P2P Protocol for Real-Time Collaboration
Authors: Dewan Tanvir Ahmed, Shervin Shirmohammadi
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Peer-to-Peer architecture is currently an attractive solution for facilitating the use of collaboration software without any server. Multicasting is usually proposed for group communication, such as IP multicasting, which is the most efficient way to disseminate collaboration data as it eliminates traffic redundancy and improves bandwidth utilization. But due to scalability and deployment issues, an alternative has been addressed to shift IP multi-casting to Application Layer Multicasting (ALM) with the collaboration between the end hosts, the latter also known as P2P. This paper focuses on design and implementation of a hybrid Peer-to-Peer collaboration platform to share group data. Here, we present Fault Tolerant ALM (FT-ALM) architecture for content distribution. Multiple-server based FT-ALM improves cumulative end-to-end latency by reflecting physical network topology on to the overlay network structure. Resilience is ensured through backup policy. The effectiveness of FT-ALM is tested through extensive simulation.
Supporting Change Impact Analysis for Service Oriented Business Applications
Authors: Hua Xiao, Jin Guo, Ying Zou
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Business applications encode various business processes within an organization. Business process specification languages such as BPEL (Business Process Execution Language) are commonly used to integrate various services in order to automate business processes within an organization. To remain competitive edge, managers frequently modify their processes. Determining the cost of modifying a business process is not trivial since the changes to the business process have to account for source code changes in various services. In this paper, we propose an approach to estimating the cost of a business process change in a service oriented business application. The approach applies change impact analysis techniques to business process specifications, and source code. The approach generates an initial change impact set from business process components. These components are then mapped to the corresponding source code entities. These code entities act as seeds for traditional source code impact analysis. Using code dependencies, such as call and inheritance relations, we derive a metric to capture the complexity of particular business process changes. Managers can then use this metric to gauge the cost and resources needed to implement changes in their business processes without having to study the code. We demonstrated the feasibility of our approach using an experiment on an open source service oriented business application.
vTPM: virtualizing the trusted platform module
Authors: Stefan Berger, Ramón Cáceres, Kenneth A. Goldman, Ronald Perez, Reiner Sailer, Leendert van Doorn
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

We present the design and implementation of a system that enables trusted computing for an unlimited number of virtual machines on a single hardware platform. To this end, we virtualized the Trusted Platform Module (TPM). As a result, the TPM's secure storage and cryptographic functions are available to operating systems and applications running in virtual machines. Our new facility supports higher-level services for establishing trust in virtualized environments, for example remote attestation of software integrity. We implemented the full TPM specification in software and added functions to create and destroy virtual TPM instances. We integrated our software TPM into a hypervisor environment to make TPM functions available to virtual machines. Our virtual TPM supports suspend and resume operations, as well as migration of a virtual TPM instance with its respective virtual machine across platforms. We present four designs for certificate chains to link the virtual TPM to a hardware TPM, with security vs. efficiency trade-offs based on threat models. Finally, we demonstrate a working system by layering an existing integrity measurement application on top of our virtual TPM facility.
Adaptive instantaneous frequency estimation of multi-component FM signals
Authors: Z. M. Hussain
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Estimation of the instantaneous frequency (IF) of multicomponent FM signals with additive Gaussian noise is considered. A reduced interference distribution (RID) with high resolution is used for time-frequency representation of signals. If the IF law is a nonlinear function of time, the bias and variance of the estimate depend on the window length. The optimal window length for bias-variance tradeoff depends on the unknown IF law, hence calling for an adaptive algorithm with time-varying and data-driven window length to resolve this tradeoff. The adaptive estimation of multiple IF laws is based on tracking the component maxima in the time-frequency plane. Simulation results for multi-component signals are comparable with those obtained for mono-component signals when the components are well separated.
Static specification inference using predicate mining
Authors: Murali Krishna Ramanathan, Ananth Grama, Suresh Jagannathan
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

The reliability and correctness of complex software systems can be significantly enhanced through well-defined specifications that dictate the use of various units of abstraction (e.g., modules, or procedures). Often times, however, specifications are either missing, imprecise, or simply too complex to encode within a signature, necessitating specification inference. The process of inferring specifications from complex software systems forms the focus of this paper. We describe a static inference mechanism for identifying the preconditions that must hold whenever a procedure is called. These preconditions may reflect both data flow properties (e.g., whenever p is called, variable x must be non-null) as well as control-flow properties (e.g., every call to p must bepreceded by a call to q). We derive these preconditions using a ninter-procedural path-sensitive dataflow analysis that gathers predicates at each program point. We apply mining techniques to these predicates to make specification inference robust to errors. This technique also allows us to derive higher-level specifications that abstract structural similarities among predicates (e.g., procedure p is called immediately after a conditional test that checks whether some variable v is non-null.) We describe an implementation of these techniques, and validate the effectiveness of the approach on a number of large open-source benchmarks. Experimental results confirm that our mining algorithms are efficient, and that the specifications derived are both precise and useful-the implementation discovers several critical, yet previously, undocumented preconditions for well-tested libraries.
Track Introduction: Digital Media: Content and Communication
Authors: Michael Shepherd
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Digital Media: Content and Communication Track has been running for several years. Its name has changed a few times over these years to better reflect the changing nature of the Track itself and thus reflect the dynamic nature of digital media. This year, we have three new minitracks to complement the three mainstay minitracks of the Track. The Semantic Web and Software Agent Technologies Minitrack has moved to the Decision Technologies and Service Sciences Track as part of a theme grouping on Services Computing.
Network Resource Awareness and Control in Mobile Applications
Authors: Arjan Peddemors, Henk Eertink, Mortaza Bargh, Ignas Niemegeers
Venue: IEEE Internet Computing (2007)

As mobile devices become increasingly capable of simultaneously using various kinds of wireless and fixed networks, developers must match mobile application needs to network resource dynamics. The authors' network resource model and network abstraction layer (NAL) software offer an extensible network resource abstraction to applications running on mobile devices. The NAL service can be used in conjunction with well-known APIs, such as the Socket API, which provide access to these resources; it also accommodates support for mobility management facilities, such as Mobile IP, if available.
Regular expression constrained sequence alignment
Authors: Abdullah N. Arslan
Venue: Journal of Discrete Algorithms (2007)

We introduce regular expression constrained sequence alignment as the problem of finding the maximum alignment score between given strings S"1 and S"2 over all alignments such that in these alignments there exists a segment where some substring s"1 of S"1 is aligned to some substring s"2 of S"2, and both s"1 and s"2 match a given regular expression R, i.e. s"1,s"2@?L(R) where L(R) is the regular language described by R. For complexity results we assume, without loss of generality, that n=|S"1|>=|m|=|S"2|. A motivation for the problem is that protein sequences can be aligned in a way that known motifs guide the alignments. We present an O(nmr) time algorithm for the regular expression constrained sequence alignment problem where r=O(t^4), and t is the number of states of a nondeterministic finite automaton N that accepts L(R). We use in our algorithm a nondeterministic weighted finite automaton M that we construct from N. M has O(t^2) states where the transition-weights are obtained from the given costs of edit operations, and state-weights correspond to optimum alignment scores we compute using the underlying dynamic programming solution for sequence alignment. If we are given a deterministic finite automaton D accepting L(R) with t"d states then our construction creates a deterministic finite automaton M"d with t"d^2 states. In this case, our algorithm takes O(t"d^2nm) time. Using M"d results in faster computation than using M when t"d
How to build a trusted database system on untrusted storage
Authors: Umesh Maheshwari, Radek Vingralek, William Shapiro
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

Some emerging applications require programs to maintain sensitive state on untrusted hosts. This paper presents the architecture and implementation of a trusted database system, TDB, which leverages a small amount of trusted storage to protect a scalable amount of untrusted storage. The database is encrypted and validated against a collision-resistant hash kept in trusted storage, so untrusted programs cannot read the database or modify it undetectably. TDB integrates encryption and hashing with a low-level data model, which protects data and metadata uniformly, unlike systems built on top of a conventional database system. The implementation exploits synergies between hashing and log-structured storage. Preliminary performance results show that TDB outperforms an off-the-shelf embedded database system, thus supporting the suitability of the TDB architecture.
Mining the Future: Predicting Itemsets' Support of Association Rules Mining
Authors: Shenoda Guirguis, Khalil M. Ahmed, Nagwa M. El Makky, Alaaeldin M. Hafez
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

This paper proposes a novel research dimension in the field of data mining, which is mining the future data before its arrival, or in other words: predicting association rules ahead before the arrival of the data. To achieve that, we need only predict the itemsets' support, upon which association rules could be easily produced. A time series analysis approach (MFTP) is proposed to perform itemsets' support prediction task. The proposed technique outperforms other prediction techniques for short history. The conducted performance study showed good prediction accuracy and response time. Thus, we provide a new tool to provide more information in the decision support field.
Worst-Case Routing Performance Metrics for Sensor Networks
Authors: Edwin Soedarmadji
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

Successful integration of pervasive sensor networks in mission critical applications depends on the ability of these networks to cope with and reasonably perform under the worst-case scenarios. One of the key performance measures is the network's ability to route information from the source node to the intended destination. This paper introduces a general framework with which worst-case routing performance of sensor networks can be evaluated and compared. Ultimately, our method can either be used as a design optimization tool, or a decision making tool to select and price contending sensor network designs.
Distributed VR for Collaborative Design and Manufacturing
Authors: Li Jin, Zhigang Wen, Ilias A. Oraifige
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Virtual Manufacturing (VM) applies Virtual Reality (VR) technology to provide a digital manufacturing solution in both 3D visual and interactive ways. It makes VR no longer a state-of-the art but rather an innovation technology to support modern industry. With the rapid growth of network technology and Web 3D graphics techniques, we propose a cost-effective distributed VM system for Small and Medium-sized Enterprises (SMEs) with limited equipment, funds and technical capabilities. The system enables SMEs to perform collaborative tasks including product design, manufacturing and resources sharing through the World Wide Web (WWW) in lower cost. This paper describes the design and critical integration issues of the system and the use of the Web 3D technology - X3D. It also evaluates the distributed VM system by comparing it to the conventional standalone CAD/CAM system.
On multiple-parameter source localization
Authors: C. Vaidyanathan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Localization of multiple-parameter sources is considered in this paper. Specifically, the problem of localizing EEG polarized sources is addressed. Expressions are presented for the variance of the source parameter estimates for the MUSIC estimator. The expressions are presented for both finite sample effects and the model perturbations effects. A comparative study of the performance is presented when the dipole orientation is known and unknown.
Context Aware Orchestration Meta-Model
Authors: Frederick Seyler, Chantal Taconet, Guy Bernard
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

With orchestrations, one service may be realized through the cooperation of several services. This cooperation has to be formally described. In this paper, we propose to describe service orchestrations through several UML2 diagrams. Component model is a tool for describing each service external interfaces. Collaboration diagrams describe the structural composition of services. And activity diagrams describe the orchestration of services. Furthermore, the second contribution of this article is to mix the composition meta-model with a context metamodel. Thus, we propose to include the descriptions of context aware composition adaptations into the composition meta-model. Describing compositions and their context-awareness with a model (conform to a meta-model) allows middleware with model-transformation capabilities to produce ad-hoc compositions in term of adaptation to current context execution and in term of target execution platforms. The article is illustrated through a concrete context-aware composition example. Our proposition is compared with other related works.
Analysis of the frequency-domain block LMS algorithm
Authors: R. Gupta
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We present a new rigorous analysis of the FBLMS algorithm. We derive the equations which control the expected convergence of the FBLMS algorithm and then go on to analyze the eigenvalues of the matrix which control the convergence behaviour of the FBLMS algorithm. Using Gerschgorin's theorem, we then show that all the eigenvalues of the normalized constrained and unconstrained FBLMS algorithms tend asymptotically towards the same value.
Jump: a system for interactive, tangible queries of paper
Authors: Michael Terry, Janet Cheung, Justin Lee, Terry Park, Nigel Williams
Venue: Proceedings of Graphics Interface 2007 (2007)

This paper introduces Jump, a prototype computer vision-based system that transforms paper-based architectural documents into tangible query interfaces. Specifically, Jump allows a user to obtain additional information related to a given architectural document by framing a portion of the drawing with physical brackets. The framed area appears in a magnified view on a separate display and applies the principle of semantic zooming to determine the appropriate level of detail to show. Filter tokens can be placed on the paper to modify the digital presentation to include information not on the original drawing itself, such as electrical, mechanical, and structural information related to the given space. These filter tokens serve as tangible sliders in that their relative location on the paper controls the degree to which their information is blended with the original document. To address the issue of recognition errors, Jump introduces the notion of a reflection window, or an inset window that serves to reproduce Jump's current interpretation of the visual scene. The system's overall design is informed by a set of in situ studies of architectural technologists and formative evaluations with the same group.
The importance of scale when selecting pixels for image registration
Authors: Rupert Brooks, Tal Arbel
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Direct methods of image registration work by defining a measure of the difference between two images and using numerical optimization methods to find the transformation that minimizes the difference. It has often been proposed that these methods may be speeded up by using only a sub- set of pixels to compute the difference measure. Previous work has suggested some criteria to use in pixel selection based on the derivative of the image, but has not addressed the issue of performance degradation that can result from applying these techniques. In this paper, we show that un- less applied carefully, these methods do not actually help. Specifically, reliability of the registration algorithm is lost if the initial starting position is further from the optimum than the scale of the derivative. Additionally, we propose new criteria for pixel selection which are strongly based on in- formation theory, and are faster to compute. We verify these propositions for two popular image difference measures by examining their behavior as the transformation parameters are varied, and by registering a number of typical images.