ppxscal/embedding_network huggingface dataset:
Towards a Peer-to-Peer Content Discovery and Delivery Architecture for Service Provisioning
Authors: Emir Hammami
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

Service provisioning includes systems and infrastructures designed for the sharing of services and any other data between users. Before services can be used, they have to be published, discovered and downloaded. These operations are supported by content distribution systems. Moreover the Peer-to- Peer (P2P) approach circumvents many problems of the Client-Server approach and offers an attractive alternative to exchange services over networked nodes. In this paper we first examine issues related to service provisioning systems. Then we present the design and the implementation of a platform allowing users to share contents like services in a P2P network. The platform is composed of a set of modules that provide means to advertise contents and discover others available on the network. The realized API can be integrated into more sophisticated applicationlevel services. We conducted several experiments to assess the performance of the platform. Results show the efficiency and the effectiveness of our approach.
Overlap reduction in symbolic system traversal
Authors: P. M. Peranandam, P. K. Nalla, R. J. Weiss, J. Ruf, T. Kropf, W. Rosenstiel
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

A divide-and-conquer approach in BDD-based verification to handle larger designs is to partition BDDs exceeding a threshold size and to deal with the partitions separately. Crossover transitions to the same state cause the main problem of this methodology, because they result in overlap of the partitions and thus introduce redundant computations when dealing with the partitions. In this paper we describe an algorithm for splitting Boolean functions representing state sets of synchronous systems such that in subsequent symbolic traversal of the resulting subsets the state set overlap is reduced. We demonstrate the effectiveness of our splitting algorithm by applying it in sequential and distributed versions of a bounded property checking algorithm. Also, a dynamic extension to static overlap reduction is sketched.
Modernizing welding courses
Authors: M. M. Tomovic
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Scientific and technological developments of the last decade have transformed the welding industry. Today, the welding industry needs highly educated people, capable of operating sophisticated equipment and controlling complex processes. Thus, academia must equip students with appropriate knowledge and skills in order that they may easily integrate into the 21st century workplace. The paper describes changes in an advanced welding course offered in the Mechanical Engineering Technology Department, Purdue University.
Identification and Congestion Analysis of Transmission Corridors of the Eastern Interconnection
Authors: Aleksandr Rudkevich, Kaan Egilmez, Minghai Liu, Prashant Murti, Poonsaeng Visudhiphan, Richard Tabors, Thomas J. Overbye
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The paper summarizes theoretical methodology and selected simulation results developed by CRA International in the context of supporting the US Department of Energy in conducting the congestion study of the Eastern interconnection of the US grid. The novel methodology described in the paper introduces a functional definition of a power transmission corridor and develops a methodology to systematically define such corridors, measure their importance and level of congestion. The applied analytical techniques combine spatial cluster analysis of electricity markets with GIS data processing, chronological production cost simulations and power flow analyses.
Forecasting the Number of Changes in Eclipse Using Time Series Analysis
Authors: Israel Herraiz, Jesus M. Gonzalez-Barahona, Gregorio Robles
Venue: Proceedings of the Fourth International Workshop on Mining Software Repositories (2007)

In order to predict the number of changes in the follow- ing months for the project Eclipse, we have applied a statis- tical (non-explanatory) model based on time series analy- sis. We have obtained the monthly number of changes in the CVS repository of Eclipse, using the CVSAnalY tool. The input to our model was the filtered series of the num- ber of changes per month, and the output was the number of changes per month for the next three months. Then we aggregated the results of the three months to obtain the to- tal number of changes in the given period in the challenge.
A Process Module to Pre-Process Requirements for Architecting
Authors: Matthias Galster, Armin Eberlein, Mahmood Moussavi
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Software architectures have a significant impact on software quality. However, building architectures is a non-trivial task. In this paper, we present a process module for pre-processing requirements before developing the architecture. The benefit of this module is that it "prepares" requirements for architecting: It helps elicit additional technical and process-related information based on requirements. This information will be useful during the creation of architectures. The module can be used in the context of different architecture processes.
Tracking value function dynamics to improve reinforcement learning with piecewise linear function approximation
Authors: Chee Wee Phua, Robert Fitch
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Reinforcement learning algorithms can become unstable when combined with linear function approximation. Algorithms that minimize the mean-square Bellman error are guaranteed to converge, but often do so slowly or are computationally expensive. In this paper, we propose to improve the convergence speed of piecewise linear function approximation by tracking the dynamics of the value function with the Kalman filter using a random-walk model. We cast this as a general framework in which we implement the TD, Q-Learning and MAXQ algorithms for different domains, and report empirical results demonstrating improved learning speed over previous methods.
Efficient event-driven simulation of parallel processor architectures
Authors: Alexey Kupriyanov, Dmitrij Kissler, Frank Hannig, Jürgen Teich
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

In this paper we present a new approach for generating high-speed optimized event-driven instruction set level simulators for adaptive massively parallel processor architectures. The simulator generator is part of a methodology for the systematic mapping, evaluation, and exploration of massively parallel processor architectures that are designed for special purpose applications in the world of embedded computers. The generation of high-speed cycle-accurate simulators is of utmost importance here, because they are directly used both for parallel processor architecture debugging and evaluation purposes, as well as during time-consuming architecture/compiler co-exploration. We developed a modeling environment which automatically generates a C++ simulation model either from a graphical input or directly from an XML-based architecture description. Here, we focus on the underlying event-driven simulation model and present our modeling environment, in particular the features of the graphical parallel processor architecture editor and the automatic instruction set level simulator generator. Finally, in a case-study, we demonstrate the pertinence of our approach by simulating different processor arrays. The superior performance of the generated simulators compared to existing simulators and simulator generation approaches is shown.
On multidimensional data and modern disks
Authors: Steven W. Schlosser, Jiri Schindler, Stratos Papadomanolakis, Minglong Shao, Anastassia Ailamaki, Christos Faloutsos, Gregory R. Ganger
Venue: Proceedings of the 4th conference on USENIX Conference on File and Storage Technologies - Volume 4 (2005)

With the deeply-ingrained notion that disks can efficiently access only one dimensional data, current approaches for mapping multidimensional data to disk blocks either allow efficient accesses in only one dimension, trading off the efficiency of accesses in other dimensions, or equally penalize access to all dimensions. Yet, existing technology and functions readily available inside disk firmware can identify non-contiguous logical blocks that preserve spatial locality of multidimensional datasets. These blocks, which span on the order of a hundred adjacent tracks, can be accessed with minimal positioning cost. This paper details these technologies, analyzes their trends, and shows how they can be exposed to applications while maintaining existing abstractions. The described approach can achieve the best possible access efficiency afforded by the disk technologies: sequential access along primary dimension and access with minimal positioning cost for all other dimensions. Experimental evaluation of a prototype implementation demonstrates a reduction of overall I/O time for multi-dimensional data queries between 30% and 50% when compared to existing approaches.
"Inclusive Bridging" over Co-existential Entities: A Fundamental Structure of Deep Communication via "Slow Information"
Authors: Osamu Katai, Takayuki Shiose, Hiroshi Kawakami
Venue: Proceedings of the Second International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2007)

This paper presents a novel way of deep communication with the use of "slow information" which affects the whole structure of the co-existential entities constituting a problem in hand. We focus our attentions to the distinction between "natural systems" and "artificial systems". We then focus on the two basic force (power) that constructs or destructs the whole structure of the entities. The former one is the associative or "inclusive" force and the latter the dissociative or "exclusive" force. We then relate them to the notions of Leibnizian Space and Time that are sometimes contrasted with Newtonian Space and Time. The inclusive force is regarded to be the original source of Leibnizian Space and the exclusive force as that of Leibnizian Time. Also, the former force is related to the slow information and the latter the fast information, that is, the one in Shannon's sense. These notions are then used to examine the construction and the destruction of co-existential structure of the problem. The final discussions are on practices in "Inclusive Design" workshops done in cooperation with an NPO.
Optimized High-Order Derivative and Dissipation Operators Satisfying Summation by Parts, and Applications in Three-dimensional Multi-block Evolutions
Authors: Peter Diener, Ernst Nils Dorband, Erik Schnetter, Manuel Tiglio
Venue: Journal of Scientific Computing (2007)

We construct optimized high-order finite differencing operators which satisfy summation by parts. Since these operators are not uniquely defined, we consider several optimization criteria: minimizing the bandwidth, the truncation error on the boundary points, the spectral radius, or a combination of these. We examine in detail a set of operators that are up to tenth order accurate in the interior, and we surprisingly find that a combination of these optimizations can improve the operators' spectral radius and accuracy by orders of magnitude in certain cases. We also construct high-order dissipation operators that are compatible with these new finite difference operators and which are semi-definite with respect to the appropriate summation by parts scalar product. We test the stability and accuracy of these new difference and dissipation operators by evolving a three-dimensional scalar wave equation on a spherical domain consisting of seven blocks, each discretized with a structured grid, and connected through penalty boundary conditions. In particular, we find that the constructed dissipation operators are effective in suppressing instabilities that are sometimes otherwise present in the restricted full norm case.
Requirements and Scenarios: Running Aspect-Oriented Software Architectures
Authors: Elena Navarro, Patricio Letelier, Isidro Ramos
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

The intertwining of Requirements and Software Architectures must be based on solid traceability mechanisms in order to effectively maintain the consistency between the two specifications. A new issue has come to the fore in this area: Aspect- Oriented Software Development (AOSD). Achieving the separation of concerns from the very beginning of software development along with their proper traceability throughout the lifecycle is mandatory in terms of quality and maintainability. ATRIUM is a methodology that is defined to guide the development of architectures from requirements and using AOSD techniques as its cornerstone. In this work, we present how ATRIUM uses a scenario technique that provides traceability support. ATRIUM pays special attention to non-functional requirements, their crosscutting relationships, and how they can derive aspects in the software architecture.
Web Deployed Interface for a Medical Knowledge Grid
Authors: Martin Kuba, Zora Sebestianova
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

We present our work on web-deployed human interface for a knowledge grid intended for sharing medical knowledge. The grid allows medical specialists to provide their knowledge encapsulated as grid services, it allows the same or other medical specialists to easily locate the services, eventually build complex processing workflows from the services, and apply them to their data. Everything is done in secure manner, which is crucial in medicine. The human interface has two parts - a web interface for so called documentation service and a web-deployed GUI interface for searching grid services and invoking grid workflows. As the grid connects experts from the whole world, a two-layered internationalization is an important feature.
Improved Grid Metascheduler Design using the Plackett-Burman Methodology
Authors: Daniel C. Vanderster, Nikitas J. Dimopoulos, Randall J. Sobie
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

In the context of computational grids, a metascheduler is the service responsible for scheduling jobs across many geographically distributed processor clusters. Typically, these software systems are complex and difficult to understand, resulting in initial designs which are ad hoc and suboptimal. This paper shows how a formal design methodology can be to used to better understand the relationships between metascheduler parameters, and thereby to achieve a well-designed metascheduler. Using a Plackett-Burman design, the methodology is demonstrated in the design of a knapsack grid metascheduler. The design is performed using efficiency and delay as the target variables.
Privacy Preserving Nearest Neighbor Search
Authors: Mark Shaneck, Yongdae Kim, Vipin Kumar
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Data mining is frequently obstructed by privacy concerns. In many cases data is distributed, and bringing the data together in one place for analysis is not possible due to privacy laws (e.g. HIPAA) or policies. Privacy preserving data mining techniques have been developed to address this issue by providing mechanisms to mine the data while giving certain privacy guarantees. In this work we address the issue of privacy preserving nearest neighbor search, which forms the kernel of many data mining applications. To this end, we present a novel algorithm based on secure multiparty computation primitives to compute the nearest neighbors of records in horizontally distributed data. We show how this algorithm can be used in three important data mining algorithms, namely LOF outlier detection, SNN clustering, and kNN classification.
Testing the executability of scenarios in general inhibitor nets
Authors: Robert Lorenz, Sebastian Mauser, Robin Bergenthum
Venue: Proceedings of the Seventh International Conference on Application of Concurrency to System Design (2007)

In this paper we introduce executions of place/transition Petri nets with weighted inhibitor arcs (PTI-net) as enabled labeled stratified order structures (LSOs) and present a polynomial algorithm to decide, whether a scenario given by an LSO is an execution of a given PTI-net. The algorithm is based on an equivalent characterization of enabled LSOs called token flow property. Although the definition of the token flow property involves exponentially many objects in the size of the LSO, there is a nontrivial transformation into a flow optimization problem which can be solved in polynomial time.
NetViewer: a network traffic visualization and analysis tool
Authors: Seong Soo Kim, A. L. Narasimha Reddy
Venue: Proceedings of the 19th conference on Large Installation System Administration Conference - Volume 19 (2005)

The frequent and large-scale network attacks have led to an increased need for developing techniques for analyzing network traffic. If efficient analysis tools were available, it could become possible to detect the attacks, anomalies and to appropriately take action to contain the attacks before they have had time to propagate across the network. This paper describes NetViewer, a network monitoring tool that can simultaneously detect, identify and visualize attacks and anomalous traffic in real-time by passively monitoring packet headers. NetViewer represents the traffic data as images, enabling the application of image/video processing techniques for the analysis of network traffic. NetViewer is released free to the general public. By employing a freely available visualization tool, the users of NetViewer can comprehend the characteristics of the network traffic observed in the aggregate. NetViewer can be employed to detect and identify network anomalies such as DoS/DDoS attacks, worms and flash crowds. NetViewer can also provide information on traffic distributions over IP address/port number domains, utilization of link capacity and effectiveness of Quality of Service policies.
Varieties of Static Analyzers: A Comparison with ASTREE
Authors: Patrick COUSOT, Radhia COUSOT, Jerome FERET, Antoine MINE, Laurent MAUBORGNE, David MONNIAUX, Xavier RIVAL
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

We discuss the characteristic properties of ASTRÉE, an automatic static analyzer for proving the absence of runtime errors in safety-critical real-time synchronous controlcommand C programs, and compare it with a variety of other program analysis tools.
A poor man's approach to dynamic invocation of C++ member functions
Authors: Thomas Kofler, Walter Bischofberger, Bruno Schäffer, André Weinand
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

During the last year we built several solutions for opening our ET++ applications for internal and external scripting. The most annoying part to be coded manually was the code stubs that translate a string based request into the invocation of a member function. For this reason we built an ET++ specific solution that provides dispatchable member functions in an inexpensive, non-intrusive way. Our solution consists of an extension of the macro generated ET++ run time meta information. To make a member function dispatchable, a developer has to write one macro call. This generates a member function meta object providing information about arguments and a function that serves to invoke the respective member function. These two generated parts work in the context of the dynamic invocation framework, which embodies an architecture that can be customized for varying interfacing needs.
Temporally scalable motion compensated adaptive temporal subband coding of video
Authors: L. L. Winger
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

It has been asserted that temporal subband coding (TSB) is inferior to predictive coding for regionally motion compensated (e.g. block-based MC) temporally scalable compressed video. There are two major disadvantages of TSB coding: temporal filtering distortions, and 'open-loop' predictive coding of covered and uncovered regions. The 'open-loop' structure of TSB coding, however, affords two major advantages not enjoyed by MCP coding: simple optimal bit-allocation, non-existence of quantization error feedback. A new adaptive temporal subband (TSB) motion compensated predictive (MCP) coder is proposed. Hierarchical variable-sized block-matched regions with low predictive error are TSB coded, while poorly predicted regions are 'open-loop' MCP coded. Simulation results demonstrate that the adaptive coder substantially improves the temporal scalability of TSB coding, retains an advantageous 'open-loop' structure and provides comparable or superior PSNR to both MCP and TSB coding at MPEG-1 quality bitrates.
Cohort selection and word grammar effects for speaker recognition
Authors: J. M. Colombi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

Automatic speaker recognition systems are maturing and databases have been designed to specifically compare algorithms and results to target error rates. The LDC YOHO speaker verification database was designed to test error rates at the 1% false rejection and 0.1% false acceptance level. This work examines the use of speaker-dependent (SD) monophone models to meet these requirements. By representing each speaker with 22 monophones, both closed-set speaker identification and global-threshold verification was performed. Using four combination lock phrases, speaker identification error rates are obtained at 0.19% for males and 0.31% for females. By defining a test hypothesis, a critical error analysis for speaker verification is developed and new results reported for YOHO. A new Bhattacharyya distance is developed for cohort selection. This method, based on the second order statistics of the enrolment Viterbi log-likelihoods, determines the optimal cohorts and achieves an equal error rate of 0.282%.
Research Methods and Applications Introduction to Minitrack at HICSS 40
Authors: Sajda Qureshi, Doug Vogel, Kerry Ward
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Organizational systems and new information technologies continue to affect organizations in a number of ways and have opened a myriad of methodological challenges for academics in particular as to how to understand the effect of these technologies on organizations and for practitioners in general attempting to meet organizational needs. Papers in the research methods and applications mini-track have reported on a number of research approaches. Papers investigating research questions on a number of issues have yielded mixed results and generated animated discussion in the sessions of this mini-track. The following papers promise to yield further discussion and debate in this area: