ppxscal/embedding_network huggingface dataset:
Agent-oriented Design for Network Survivability
Authors: Mehdi Shajari, Ali A. Ghorbani
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Intelligent behavior is the selection of actions based on knowledge. The design of the Fuzzy Adaptive Survivability Tool (FAST) agents and their intelligent behavior is explained. A FAST agent uses Belief- Desire-Intention (BDI) logic as the reasoning framework to decide on desirable response plans. These decisions are both context-sensitive to take into account the changes in the network status and costsensitive to avoid the risk of collateral damage. A realworld scenario, which shows how the FAST agents choose desirable responses to mitigate scanning worm traffic, is also presented.
The journal of irreproducible results
Authors: JACOB A. HURWITZ, DANIEL A. QUIRK,  Jr.
Venue: ACM SIGSIM Simulation Digest (1976)

"Statistical significance," writes William L. Hays, "is a statement about conditional probability, nothing else. It does not guarantee that something important, or even meaningful, has been found." Hays, of course, is only one of many who have bemoaned this glaring shortcoming of conventional statistical tests. Given the increasing number of research reports vying for the attention of any serious scholar, surely the time has come for statistics which will aid us in ascertaining the importance and meaningfulness of our findings. The purpose of this paper is to provide such statistics. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A simulation-based scheduling and management information system for a machine shop
Authors: Suresh K. Jain
Venue: ACM SIGSIM Simulation Digest (1977)

This paper describes the design, working, performance, costs and benefits of a computerized scheduling and management information system that has been developed for a large, generalized m/n machine shop which had previously been a bottleneck facility in the Cast Roll Manufacturing complex of Bethlehem Steel Corporation. A flexible discrete-event simulation model, at the heart of the computer system, generates two types of schedules: Planning Schedules for making long- and medium-term planning and operating decisions, and Production Schedules for sequencing approximately 1000 rolls on 40 machines on a day-to-day basis.A number of supporting programs perform data management, file management, and report-generation functions. Data-collection functions are deliberately performed manually to avoid the high costs associated with automatic data-collection equipment normally used in large computer systems. The computer programs are run in a time-sharing environment. A cathode ray tube and a medium-speed printer are the only hardware requirements of the system. With the implementation of the computer system, significant improvement is now being obtained as measured by productivity, labor and machine efficiencies, due date performance, and work-in-process inventory. The computer system is saving Bethlehem a substantial amount of money every year, and a notable feature of this system is its low annual operating cost. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
DBmbench: fast and accurate database workload representation on modern microarchitecture
Authors: Minglong Shao, Anastassia Ailamaki, Babak Falsafi
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

With the proliferation of database workloads on servers, much recent research on server architecture has focused on database system benchmarks. The TPC benchmarks for the two most common server workloads, OLTP and DSS, have been used extensively in the database community to evaluate the database system functionality and performance. Unfortunately, these benchmarks fall short of being effective in microarchitecture and memory system research due to several key shortcomings. First, setting up the experimental environment and tuning these benchmarks to match the workload behavior of interest involves extremely complex procedures. Second, the benchmarks themselves are complex and preclude accurate correlation of microarchitecture-and memory-level bottlenecks to dominant workload characteristics. Finally, industrial-grade configurations of such benchmarks are too large and preclude their use in detailed but slow microarchitectural simulation studies of future servers. In this paper, we first present an analysis of the dominant behavior in DSS and OLTP workloads, and highlight their key processor and memory performance characteristics. We then introduce a systematic scaling framework to scale down the TPC benchmarks. Finally, we propose the DBmbench, consisting of two substantially scaled-down benchmarks: µTPC-H and µTPC-C that accurately (> 95%) capture the processor and memory performance behavior of DSS and OLTP workloads.
Camera-based Kanji OCR for Mobile-phones: Practical Issues
Authors: Masashi Koga, Ryuji Mine, Tatsuya Kameyama, Toshikazu Takahashi, Masahiro Yamazaki, Teruyuki Yamaguchi
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A camera-based optical character reader (OCR) for Japanese Kanji characters was implemented on a mobile-phone. This OCR has three key features. The first is discriminative feature extraction (DFE) which enables a character classifier needing only small memory size. The second is a word-segmentation method specially designed for looking up Japanese words in a dictionary. The third feature is a GUI suitable for a mobile-phone. A prototype mobile-phone Kanji OCR was constructed and experimentally tested. Recognition accuracy of over 95% was obtained under the best conditions, which shows the potential of our prototype as a new type of electronic dictionary.
Patterns and Tools for Achieving Predictability and Performance with Real-Time Java
Authors: Krishna Raman, Yue Zhang, Mark Panahi, Juan A. Colmenares, Raymond Klefstad
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The Real-time Specification for Java (RTSJ) offers the predictable memory management needed for real-time applications, while maintaining Java¿s advantages of portability and ease of use. RTSJ¿s scoped memory allows object lifetimes to be controlled in groups, rather than individually as in C++. While easier than individual object lifetime management, scoped memory adds programming complexity from strict rules governing memory access across scopes. Moreover, memory leaks can potentially create jitter and reduce performance. To manage the complexities of RTSJ¿s scoped memory, we developed patterns and tools for RTZen, a Real-time CORBA Object Request Broker (ORB). We describe four new patterns that enable communication and coordination across scope boundaries, an otherwise difficult task in RTSJ. We then present IsoLeak, a runtime debugging tool that visualizes the scoped hierarchies of complex applications and locates memory leaks. Our empirical results show that RTZen is highly predictable and has acceptable performance. RTZen therefore demonstrates that the use of patterns and tools like IsoLeak can help applications meet the stringent QoS requirements of DRE applications, while supporting safer, easier, cheaper, and faster development in Real-time Java.
Co-authorship networks in the digital library research community
Authors: Xiaoming Liu, Johan Bollen, Michael L. Nelson, Herbert Van de Sompel
Venue: Information Processing and Management: an International Journal (2005)

The field of digital libraries (DLs) coalesced in 1994: the first digital library conferences were held that year, awareness of the World Wide Web was accelerating, and the National Science Foundation awarded $24 Million (US) for the Digital Library Initiative (DLI). In this paper we examine the state of the DL domain after a decade of activity by applying social network analysis to the co-authorship network of the past ACM, IEEE, and joint ACM/IEEE digital library conferences. We base our analysis on a common binary undirectional network model to represent the co-authorship network, and from it we extract several established network measures. We also introduce a weighted directional network model to represent the co-authorship network, for which we define AuthorRank as an indicator of the impact of an individual author in the network. The results are validated against conference program committee members in the same period. The results show clear advantages of PageRank and AuthorRank over degree, closeness and betweenness centrality metrics. We also investigate the amount and nature of international participation in Joint Conference on Digital Libraries (JCDL).
Comparison between error correcting output codes and fuzzy support vector machines
Authors: Tomonori Kikuchi, Shigeo Abe
Venue: Pattern Recognition Letters (2005)

One-against-all support vector machines with discrete decision functions have unclassifiable regions. To resolve unclassifiable regions, support vector machines with continuous decision functions and fuzzy support vector machines have been proposed. If, in ECOC (error correcting output code) support vector machines, instead of discrete error functions, continuous error functions are used, unclassifiable regions are resolved. In this paper, first we prove that for one-against-all formulation, support vector machines with continuous decision functions are equivalent to fuzzy support vector machines with minimum and average operators. Then we discuss minimum operations as well as average operations for error functions of support vector machines and show the equivalence of ECOC support vector machines and fuzzy support vector machines for one-against-all formulation. Finally, we show by computer simulations that ECOC support vector machines are not always superior to one-against-all fuzzy support vector machines.
Linear Required-Arrival-Time Trees and their Construction
Authors: Parthasarathi Dasgupta, Prashant Yadava
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Interconnects are dominating VLSI circuit design in Deep sub-micron regime. Construction of global routing trees based on Required Arrival Times (RAT) has gained importance over the traditional problem of finding minimum-cost trees. Moreover, recent investigations on the fidelity of delay estimators indicate that the RAT trees with Manhattan distance delay, known as Linear RAT trees, are likely to be a viable alternative to buffered trees with Elmore delay model. This paper introduces the Linear RAT trees, discusses some related analysis, and proposes a heuristic method for constructing such trees.
On Using Rule Induction in Multiple Classifiers with a Combiner Aggregation Strategy
Authors: Jerzy Stefanowski, Slawomir Nowaczyk
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The paper is an experimental study of using the rough sets based rule induction algorithmMODLEM in the framework of multiple classifiers. Particular attention is paid to using a meta-classifier called combiner, which learns how to aggregate answers of component classifiers. The experimental results confirm that the range of classification improvement for the combiner depends on the independence of errors made by the component classifiers. Moreover, we summarize the experience with using MODLEM in other multiple classifiers, namely the bagging and n2 classifiers.
Some experiences in interfacing a PL/I module with GPSS-V
Authors: D. J. Cooespoti
Venue: ACM SIGSIM Simulation Digest (1980)

While conductins a research project, it was necessary to make an extensive number of executions using two large GPSS-V models. In order to consolidate the statistics produced by GPSS from these runs, it was decided to interface a PL/I module with GPSS-V using the HELPCPLI block. The PL/I module accesses the GPSS data structures and writes information selected from them to a data set. The data set is then used to consolidate the statistics using separate PL/I programs. The following is a brief summary of some experiences encountered while attempting to achieve the interface.
Adaptive Aircraft Flight Control Simulation Based on an Artificial Immune System
Authors: Charles L. Karr, K. Nishita, Kenneth S. Graham
Venue: Applied Intelligence (2005)

Over the past decade much progress has been made in the development of adaptive, model-following flight control systems. These systems are being designed to account for the degradation and even the failure of the actuators used to implement the control laws within aircraft. Typically, these adaptive, model-following flight control systems require software components capable of (1) monitoring system performance, (2) quantifying changes occurring in the performance characteristics of actuators, and (3) adapting control laws based on changes in actuator performance. Interestingly enough, the challenges facing natural immune systems also require the successful completion of three similar tasks: (1) monitoring organism performance, (2) identification of antigens, and (3) distribution of targeted antibodies. Thus, the characteristics inherent in natural immune systems have been captured and employed in computational systems called artificial immune systems (AISs). This paper describes an adaptive, model-following flight control system based on an artificial immune system. The effectiveness of the approach is demonstrated in a system designed to maintain cruise conditions in the simulation of a Boeing 747 aircraft in the presence of atmospheric turbulence and degradations in the performance characteristics of actuators used to manipulate various control surfaces.
Designing and implementing a family of intrusion detection systems
Authors: Richard A. Kemmerer
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Intrusion detection systems are distributed applications that analyze the events in a networked system to identify malicious behavior. The analysis is performed using a number of attack models (or signatures) that are matched against a specific event stream. Intrusion detection systems may operate in heterogeneous environments, analyzing different types of event streams. Currently, intrusion detection systems and the corresponding attack modeling languages are developed following an ad hoc approach to match the characteristics of specific target environments. As the number of systems that have to be protected increases, this approach results in increased development effort. To overcome this limitation, we developed a framework, called STAT, that supports the development of new intrusion detection functionality in a modular fashion. The STAT framework can be extended following a well-defined process to implement intrusion detection systems tailored to specific environments, platforms, and event streams. The STAT framework is novel in the fact that the extension process also includes the extension of the attack modeling language. The resulting intrusion detection systems represent a software family whose members share common attack modeling features and the ability to reconfigure their behavior dynamically. The STAT framework allows an Intrusion Detection Administrator to express high-level configuration requirements that are mapped automatically to a detailed deployment and/or reconfiguration plan. This approach supports automation of the administrator tasks and better assurance of the effectiveness and consistency of the deployed sensing infrastructure.
NWPerf: a system wide performance monitoring tool for large Linux clusters
Authors: R. Mooney, K. P. Schmidt, R. S. Studham
Venue: Proceedings of the 2004 IEEE International Conference on Cluster Computing (2004)

We present NWPerf, a new system for analyzing fine granularity performance metric data on large-scale supercomputing clusters. This tool is able to measure application efficiency on a system wide basis from both a global system perspective as well as providing a detailed view of individual applications. NWPerf provides this service while minimizing the impact on the performance of user applications. We describe the type of information that can be derived from the system, and demonstrate how the system was used detect and eliminate a performance problem in an application application that improved performance by up to several thousand percent. The NWPerf architecture has proven to be a stable and scalable platform for gathering performance data on a large 1954-CPU production Linux cluster at PNNL.
Automatic generating detail-on-demand hypervideo using MPEG-7 and SMIL
Authors: Tina T. Zhou, Tom Gedeon, Jess S. Jin
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Detail-on-demand hypervideo will provide a powerful mechanism to allow viewers to see additional information of video segments through hyperlinks. A large number of tools are devoted to the identification of selectable video objects and the synchronization mechanisms for linking additional information to selectable video objects. We focus here on the automatic generation of additional information and the integration of the additional information to its corresponding selectable video object. We demonstrate a method using the Multimedia Content Description Interface defined in MPEG-7 and the Synchronized Multimedia Integration Language (SMIL) to automatically generate detail-on-demand hypervideos.
A Quantitative Analysis of eClass, UNSPSC, eOTD, and RNTD: Content, Coverage, and Maintenance
Authors: Martin Hepp, Joerg Leukel, Volker Schmitz
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

A significant part of data and content management in e-business scenarios deals with exchanging product-related data between business entities, and integrating them into target applications (e.g. ERP systems) or target documents (e.g. e-catalogs) at the recipient's side. Content integration tasks can be much better automated if the textual descriptions are augmented by a machine-readable representation of the semantics. For this purpose, categorization standards for products and services, like UNSPSC, eClass, eOTD, or the Rosettanet Technical Dictionary (RNTD) are widely in use. Existing research, however, has focused on the architecture and structure of such standards, and did not investigate their actual content. In this paper, we present a framework of metrics for the quality and maturity of categorization standards, and apply these metrics to eClass, UNSPSC, eOTD, and RNTD. The results clearly show weaknesses which hamper the use in many application domains. Also, we can reveal that only some of these standards are actually maintained and updated, while others are rather inactive, dead collections.
Minimality and Convexity Properties in Spatial CSPs
Authors: Priti Chandra, Arun K. Pujari
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The research in qualitative reasoning and in spatial CSP is always investigated in the backdrop of its temporal counterpart- qualitative temporal reasoning and TCSP. Unlike the case of Interval Algebra (IA), the composition table of RCC, IA's so-called spatial counterpart, is in general neither complete nor extensional, the compositional consistency can be still a valid reasoning mechanism. Even in such a restricted situation, many of the known properties of IA have not been investigated for validity in the context of RCC. We address, in this paper two such properties-convexity and minimality. The importance of minimality cannot be underestimated as in a minimal network every label is feasible and hence determining all the consistent scenarios can be accomplished very efficiently. It is known that path consistency does not yield a minimal network for tractable classes of RCC-8.We represent RCC-8 relations as a partially ordered set and exploit the properties of partial ordering to derive very interesting theoretical results. We show here that there exists a convex class of relations of RCC-8 for which path consistency yields a minimal network. Our results are very important as it gives a sufficient condition for minimality and useful to generate all consistent scenarios whenever compositional consistency is a valid reasoning mechanism.
Predicting Program Guides for Video Structuring
Authors: Jean-Philippe Poli
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

The French National Audiovisual Institute is in charge of archiving continuously the video stream of every French channel. In order to be described, each program must be isolated in the stream. Our work focuses on creating a system which can find programs' boundaries. We propose in this article a way to predict various programs' boundaries to obtain temporal windows in which our system will be able to search.
A Hybrid Static/Dynamic DVS Scheduling for Real-Time Systems with (m, k)-Guarantee
Authors: Linwei Niu, Gang Quan
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Energy reduction is critical to increase the mobility and to extend the mission period in the development of today's pervasive computing systems. On the other hand, however, energy reduction must be subject to the requirements not to compromise the quality of service (QoS) that these systems need to provide. While most of the current research in energy-aware real-time scheduling has been focused on hard real-time systems, a large number of practical applications and systems exhibit more soft real-time nature. In this paper, we study the problem of minimizing energy for soft real-time systems with the requirements of QoS-guarantee. The QoS requirements are deterministically quantified with the (m,k)-constraints, which require that at least m out of any k consecutive jobs of a task meet their deadlines. To deal with the dynamic characteristics of such applications and systems, we propose a hybrid static/dynamic scheduling approach that can efficiently reduce the energy consumption while guaranteeing the (m,k)-constraints. The experimental results demonstrate that our proposed techniques outperform previous research significantly in terms of both the energy savings and QoS that can be achieved.
XML Document Clustering Using Common XPath
Authors: Ho-pong Leung, Fu-lai Chung, Stephen C. F. Chan, Robert Luk
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

XML is becoming a common way of storing data. The elements and their arrangement in the document's hierarchy not only describe the document structure but also imply the data's semantic meaning, and hence provide valuable information to develop tools for manipulating XML documents. In this paper, we pursue a data mining approach to the problem of XML document clustering. We introduce a novel XML structural representation called common XPath (CXP), which encodes the frequently occurring elements with the hierarchical information, and propose to take the CXPs mined to form the feature vectors for XML document clustering. In other words, data mining acts as a feature extractor in the clustering process. Based on this idea, we devise a path-based XML document clustering algorithm called PBClustering which groups the documents according to their CXPs, i.e. their frequent structures. Encouraging simulation results are observed and reported.