ppxscal/embedding_network huggingface dataset:
A posteriori error estimators for obstacle problems &#x2013; another look
Authors: Dietrich Braess
Venue: Numerische Mathematik (2005)

We show that a posteriori estimators for the obstacle problem are easily obtained from the theory for linear equations. The theory would be even simpler if the Lagrange multiplier does not have a nonconforming contribution as it has in actual finite element computations.
Exploiting predicate structure for efficient reachability detection
Authors: Sujatha Kashyap, Vijay K. Garg
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Partial order (p.o.) reduction techniques are a popular and effective approach for tackling state space explosion in the verification of concurrent systems. These techniques generate a reduced search space that could be exponentially smaller than the complete state space. Their major drawback is that the amount of reduction achieved is highly sensitive to the properties being verified. For the same program, different properties could result in very different amounts of reduction achieved.We present a new approach which combines the benefits of p.o. reduction with the added advantage that the size of the constructed state space is completely independent of the properties being verified. As in p.o. reduction, we use the notion of persistent sets to construct a representative interleaving for each maximal trace of the program. However, we retain concurrency information by assigning vector timestamps to the events in each interleaving. Our approach hinges upon the use of efficient algorithms that parse the encoded concurrency information in the representative interleaving to determine whether a safety violation exists in any interleaving of the corresponding trace. We show that, for some types of predicates, reachability detection can be performed in time that is polynomial in the length of the interleaving. Typically, these predicates exhibit certain characteristics that can be exploited by the detection algorithm.We implemented our algorithms in the popular model checker SPIN, and present experimental results that demonstrate the effectiveness of our techniques. For example, we verified a distributed dining philosophers protocol in 0.03 seconds, using 1.253 MB of memory. SPIN, using traditional p.o. reduction techniques, took 759.71 seconds and 439.116 MB of memory.
Power-Composition Profile Driven Co-Synthesis with Power Management Selection for Dynamic and Leakage Energy Reduction
Authors: Dong Wu, Bashir M. Al-Hashimi, Marcus T. Schmitz, Petru Eles
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Recent research has shown that the combination of dynamic voltage scaling (DVS) and adaptive body biasing (ABB) yields high energy reductions in embedded systems. Nevertheless, the implementation of DVS and ABB requires a significant system cost, making it less attractive for many small systems. In this paper we demonstrate that it is possible to reduce this system cost and to achieve comparable energy saving to that obtained using combined DVS and ABB scheme through a cosynthesis methodology which is aware of the tasks' power-composition profile (the ratio of the dynamic power to the leakage power). In particular, the presented methodology performs a power management selection at the architectural level, i.e., it decides upon which processing elements to be equipped with which power management scheme (DVS, ABB, or combined DVS and ABB) - with the aim to achieve high energy savings at a reduced implementation cost. The proposed technique maps, schedules, and voltage scales applications specified as task graphs with timing constraints. Detailed experiments including a real-life benchmark are conducted to demonstrate the effectiveness of the proposed methodology.
A Parallel File Transfer Protocol for Clusters and Grid Systems
Authors: Dheeraj Bhardwaj, Rishi Kumar
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Parallel File Transfer Protocol (PFTP) introduces the concept of data transfer using multiple parallel data paths between clusters. It makes use of striped data distributed across the multiple IO-nodes of a Parallel File System on clusters. The protocol uses the striping format of the Parallel File System to push multiple stripes of the file over multiple TCP connections. The flexibility in PFTP allows user to use different file transfer applications over these TCP connections. In this paper we describe the design architecture and implementation of PFTP. Several experiments explain how it improves the data transfer rate. We also provide performance results of PFTP for a varying file data size of 100 MB to 4GB. The flexible, secure, fault tolerant and high performance design of PFTP can be useful for large Data Grids.
Asymptotic properties for estimates of nonparametric regression models based on negatively associated sequences
Authors: Han-Ying Liang, Bing-Yi Jing
Venue: Journal of Multivariate Analysis (2005)

Consider the nonparametric regression model Y"n"i=g(x"n"i)+@e"n"i for i=1,...,n, where g is unknown, x"n"i are fixed design points, and @e"n"i are negatively associated random errors. Nonparametric estimator g"n(x) of g(x) will be introduced and its asymptotic properties are studied. In particular, the pointwise and uniform convergence of g"n(x) and its asymptotic normality will be investigated. This extends the earlier work on independent random errors (e.g. see J. Multivariate Anal. 25(1) (1988) 100).
State complexity of shuffle on trajectories
Authors: Michael Domaratzki, Kai Salomaa
Venue: Journal of Automata, Languages and Combinatorics (2004)

It is easy to get an upper bound for the state complexity of shuffle on trajectories that generalizes the bound for unrestricted shuffle. We establish improved bounds for slender trajectories, that is, trajectories which have only a constant number of strings of a given length. For trajectories with USL-index 1 (or 1-thin trajectories, those with only one string of each length) we obtain an asymptotically optimal lower bound when the state complexity of the trajectory grows with respect to the state complexity of the component languages. Some estimations are improved by considering nondeterministic state complexity.
Guest Editors' Introduction: Asynchronous Middleware and Services
Authors: Doug Lea, Steve Vinoski, Werner Vogels
Venue: IEEE Internet Computing (2006)

Asynchronous middleware is playing an increasingly important role in distributed and Web-based systems. This issue's theme articles address some research and engineering challenges that remain before this technology can fully make good on its promises.
JGN 11 (Japan Gigabit Network 11)
Authors: Yoshihiko Kanaurni, Takashi Miyake, Ichiro Yamauchi, Kazumasa Kobayashi, Hiroshi Esaki
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

This paper presents a overview of JGN2, Japan Gigabit Network 2, which has been established on the end of March 2004. JGN2 was built as a successor of JGN1, which has been established by Telecommunication Advancement Organization (TAO) in 1999. First, JGN2 network structure is explained. JGN2 provides gigabit level layer one, two, three functionalities to the research communities. Layer one provides optical path, layer two provides Ethernet connection, layer three provides IPv6 network respectively. JGN2 can be used not only for Japanese domestic network research but also for international network research. Network structure of Pacijc Northwest GigaPoP and Aisia PciJic POPs are described and it is shown how JGN2 is connected to other gigabit research network in worldwide. Experiments on JGN2 at international conferences are also described. High Dejnition(HD) TV transmission experiment at JGN2 symposium 2005 and VoIP connection to the Internet at APRICOT 2005 is described and examined the effectiveness of the gigabit network.
Systems Engineering for the Living Enterprise
Authors: Doug McDavid
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This paper explores an approach to enterprises as living human social systems. It introduces the problem of widespread failure of reengineering efforts and the application of information technologies to business entities. The heart of the problem is characterized as a gap between business professionals and technologists, which is intrinsic, but needs to be bridged in a way that yields effective technological interventions. Several architectural viewpoints are introduced that describe the nature of enterprise, and that raise interesting questions about possible extensions to systems engineering methods.
Building near real-time P-2-P applications with JXTA
Authors: D. C. Parker, S. A. Collins, D. C. Cleary
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

The development of peer-to-peer applications has reached a point where they will have to surpass the limitations of tradition file sharing applications like those pioneered by Napster and Gnutella. In this paper we examine the JXTA platform v2.1 and the challenges it faces in meeting the near real-time characteristics required by next generation peer-to-peer applications.
A Complexity-Aware Live Streaming System with Bit Rate Adjustment
Authors: Meng-Ting Lu, Chang-Kuan Lin, Jason Yao, Homer Chen
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

For a live streaming server, it is highly desirable to allocate the available computational resource and bandwidth to each channel fairly and efficiently. In this paper, we propose a complexity-aware live streaming system with bit rate adjustment that can handle the allocation of bandwidth and computational resource of a live streaming server. The proposed system encodes the input videos at different quality levels based on the priority of the input videos and the available computational resource. It incorporates a bit rate adjustment mechanism to compensate for the video quality drop resulted from the quality level change of high priority encoders. The resulting system is able to handle channels more efficiently because the complexity of high priority encoders can also be dynamically adjusted with little quality drop. A new complexity adjustment method is developed that enables the system to stabilize more quickly and minimizes the variance of the time buffer. The experimental results show that the system can handle more channels while still maintaining the quality of high priority encoders. The proposed system is applicable to multimedia home gateways, surveillance, IP-based TV, and on-line sports game relays.
Bookmark Shared System Using Agent Systems
Authors: Yasuo NAGAI, Kazunori INOUE
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Recently, collaborative filtering is proposed as an information gathering technology of the WWW in the network. Collaborative filtering is a technology that recommends information on the Web page for an arbitrary user who wants to acquire recommendation information based on many users' evaluation and retrieval histories. In this paper, the bookmark shared system that filters bookmark information collaboratively is described. Especially, we explain the details of the bookmark shared system using agent systems and it's collaborative filtering on the distributed environment. In a concrete agent modeling, the multiagent does a simple communication to notify the profile update, and the retrieval processing is done by a mobile agent. As a result, the profile management on the distributed environment is facilitated, and it is possible to construct collaborative filtering system that can decrease the communication frequency in the retrieval processing.
Challenges in OCR of Dev anagari Documents
Authors: Suryaprakash Kompalli, Sankalp Nayak, Srirangaraj Setlur, Venu Govindaraju
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

OCR ofDevanagari script presents a wide range of challeng es that aa not seen in Latin based scripts. This paper outlines the implementation of a neural network based Devana gari OCR. Experimental rsults on a standard data set are reported and analyzed.
Testing in resource constrained execution environments
Authors: Gregory M. Kapfhammer, Mary Lou Soffa, Daniel Mosse
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Software for resource constrained embedded devices is often implemented in the Java programming language because the Java compiler and virtual machine provide enhanced safety, portability, and the potential for run-time optimization. It is important to verify that a software application executes correctly in the environment in which it will normally execute, even if this environment is an embedded one that severely constrains memory resources. Testing can be used to isolate defects within and establish a confidence in the correctness of a Java application that executes in a resource constrained environment. However, executing test suites with a Java virtual machine (JVM) that uses dynamic compilation to create native code bodies can introduce significant testing time overheads if memory resources are highly constrained. This paper describes an approach that uses adaptive code unloading to ensure that it is feasible to perform testing in the actual memory constrained execution environment. The experiments demonstrate that code unloading can reduce both the test suite execution time by 34% and the code size of the test suite and application under test by 78% while maintaining the overall size of the JVM.
Scalable, synthetic, sensor network data generation
Authors: Yan Yu
Venue:  (2005)

Sensor networks are a new class of distributed systems composed of a large number of densely deployed sensors, actuators, low power computation, and wireless communication devices. Sensor network research is still in its infancy. There is a large volume of exploratory research; however, few real systems are deployed and little experimental data from sensor networks is available to test proposed protocol design. Due to lack of experimental data and sophisticated models derived from such data, most data processing algorithms from the sensor network literature are evaluated with data generated from simple models. Through statistical performance analysis and algorithm evaluation using experimental data, we demonstrate the need to evaluate algorithms using realistic data corresponding to a wide range of parameter values and irregular topology input. Motivated out of a concern for data sensitivity and a lack of experimental data, we propose a scalable synthetic data generation framework to support systematic algorithm evaluation and robust algorithm design. We have two strategies to achieve scalable synthetic data generation. First, using case studies of concrete sensor network algorithms we identify a small number of parameters to manipulate in our synthetic data generation. This significantly reduces the search space from exponential to a manageable number. Second, we use empirical models derived from experimental data to guide simulation towards those portions of the space that represent real world scenarios. Guided by these two strategies, we implement algorithms to generate synthetic data either with similar characteristics as the experimental data, or exhibiting a wide range of data characteristics. In addition to the irregular topology data generation toolbox, we also provide ready-to-use test suites to encourage people to utilize more realistic data when evaluating their algorithms. Moreover, the sensor data replay addition to EmStar enhances EmStar simulation/emulation with more realistic sensor data traces.
Sequential Pattern Mining in Multiple Streams
Authors: Gong Chen, Xindong Wu, Xingquan Zhu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper, we deal with mining sequential patterns in multiple data streams. Building on a state-of-the-art sequential pattern mining algorithm PrefixSpan for mining transaction databases, we propose MILE¹, an efficient algorithm to facilitate the mining process. MILE recursively utilizes the knowledge of existing patterns to avoid redundant data scanning, and can therefore effectively speed up the new patterns' discovery process. Another unique feature of MILE is that it can incorporate some prior knowledge of the data distribution in data streams into the mining process to further improve the performance. Extensive empirical results show thatMILE is significantly faster than PrefixSpan. As MILE consumes more memory than PrefixSpan, we also present a solution to balance the memory usage and time efficiency in memory constrained environments.
The Metamorphoses of Workflow Projects in their Early Stages
Authors: Thomas Herrmann, Marcel Hoffmann
Venue: Computer Supported Cooperative Work (2005)

Empirical studies on workflow usually focus on systems which have already been introduced and on the problems which occur with these systems if exceptional cases differ from the regular business processes. This study focuses on the problems that occur in the early stages of projects intended to introduce workflow systems but which do not inevitably succeed. In most cases the companies under investigation eventually introduced other types of software, or the business processes were merely analysed and improved but not automated during the project. We explain this phenomenon by referring to Orlikowski's concept of metamorphoses which analysed organizational change under conditions of groupware usage. A number of empirical details in our study of seven companies during a 4-year period can be related to this concept as well as to literature on workflow. In our ex-post study of the workflow projects we concluded that paradoxically starting with a workflow project might be an appropriate way of introducing improvement in cooperation and coordination without using workflow management technology and that concepts for flexible workflow technology are of minor relevance for this improvement.
Automatic image orientation determination with natural image statistics
Authors: Siwei Lyu
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we propose a new method for automatically determining image orientations. This method is based on a set of natural image statistics collected from a multi-scale multi-orientation image decomposition (e.g., wavelets). From these statistics, a two-stage hierarchal classification with multiple binary SVM classifiers is employed to determine image orientation. The proposed method is evaluated and compared to existing methods with experiments performed on 18040 natural images, where it showed promising performance.
Quantitative Analysis of Enterprise's Logistics Capability Based on Supply Chain Performance
Authors: Xiaoqun Liu, Shihua Ma
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

An analysis is made on the concept and structure of logistics capability to establish the multistage index system of enterprise's logistics capability based on supply chain performance, for which, a multistage fuzzy analytical model is applied on the basis of the fuzzy mathematics and hierarchy process analytical methods. At the end of the analysis from the bottom indexes to topmost, the enterprise's logistics capability index is ascertained via proposed model. When comparing to the performance of supply chain and the benchmark enterprise, tracing backward to the fuzzy analytical model can identify the advantage and disadvantage of enterprise's logistics capability, which lead to the optimization of enterprise's logistics capability.
Multi-scale Techniques for Document Page Segmentation
Authors: Zhixin Shi, Venu Govindaraju
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Page segmentation algorithms found in published literatures often rely on some predetermined parameters such as general font sizes, distances between text lines and document scan resolutions. Variations of these parameters in real document images greatly affect the performance of the algorithms. In this paper we present a novel approach for document page segmentation using a multi-scale technique. An efficient implementation of a local connectivity algorithm transforms a document image into a parameter domain in which a parameter value at a pixel location represents a connectivity property for its neighboring foreground pixels in the original document image. Then a top-down approach with a linear search reveals the document regions at each scale levels as text block, text lines and graphics. We consider our algorithm a transform based multi-scale method. Our ongoing research shows that the algorithm is robust for variations of document parameters.
A Peer-to-Peer Extension of Network-Enabled Server Systems
Authors: Eddy Caron, Frederic Desprez, Cedric Tedeschi, Franck Petit
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

DIET (Distributed Interactive Engineering Toolbox) is a set of hierarchical components to design Network Enabled Server (NES) systems. In these systems, clients ask to agents (discovery and scheduling components) to find servers able to solve their problem using some performance metrics and information about the location of data already on the network. Today's NES middleware, in which agents are statically connected and potentially bottlenecks, don't cope with the dynamic and heterogeneous nature of future grid environments. In this paper, we present the design, the implementation and the experimentation of the first architecture extending traditional NES systems with an unstructured peer-to-peer network dynamically connecting distributed agents, to provide to clients an entry point to servers geographically distributed. Our implementation is based on DIET and the JXTA toolbox. Different algorithms have been implemented and experimented over the VTHD network which connects several supercomputers in different research institutes through a high-speed network, showing the scalability of the system.
Everyday robotics: new visions, new challenges
Authors: Frederic Kaplan
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

The field of everyday robotics is concerned with inventing new forms of robotic objects for everyday use. These range from service robot companion meant to enhance and extend the individuals own ability to perform crucial tasks to entertainment devices designed to be interesting for their own sake.