ppxscal/embedding_network huggingface dataset:
On the Line Card Collection Model for Bandwidth Utilization and Latency Measurement in High-speed IP Networks
Authors: ZHANG yi, TANG hong, YIN jianru
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

It's one of the most significant issues to acquire path latency and bandwidth utilization ratio of every link in high-speed IP networks for it takes dramatic influence on the performance of resource management, congestion control and multi-route control. In this paper, a novel mixed cover model with line card gathering agent is proposed and implemented for the simultaneous measurement of path latency and bandwidth utilization. Furthermore, the design and simulation of this model has been realized based on FPGA and the test results indicate that this kind of line card can realize the function of link- speed statistics and link-speed management for probe packet. Consequently, the measurement requirements of Gigabit Ethernet can be met appropriately.
Transient Failures in Triple Modular Redundancy Systems with Sequential Modules
Authors: J. F. Wakerly
Venue: IEEE Transactions on Computers (1975)

The effects of transient failures in sequential modules in systems using triple modular redundancy (TMR) cannot be neglected. A transient may place a sequential machine in an erroneous state, and the state may remain erroneous long after the transient has disappeared. We show that the state of a sequential machine can be restored after a transient if and only if the machine has a synchronizing sequence. If synchronizing sequences occur periodically during normal operation of the system, then multiple transients spaced out in time can be tolerated. System structures that have synchronizing sequences are discussed.
Fuzzy Implication Methods in Fuzzy Logic
Authors: Xiaodong Zhu, Zhiqiu Huang, Shuqun Yang, Guohua Shen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The Choice of fuzzy implication methods is a significant problem in the theoretical development of fuzzy set and approximate reasoning. Many operation methods on the fuzzy implication were presented. In this research, first we analyze the truth values of the traditional two valued logical implication using sets theory, propose a novel truth table of the two valued logical implication, then acquire the simplification formulas of the expanded two-valued logical implication using the Karnaugh-map tool; Second we explore the relation of the expanded two valued logical implication and existent fuzzy implication operation methods, subsequently we propose two novel operation methods on the fuzzy implication based on the relation. We validate these two methods with mathematical deduction as well as a concrete example. At last, we compare the superiority of various fuzzy implication methods.
Information Systems for Patient Care
Authors: T. Estrin
Venue: Computer (1979)

Medical information systems capture the decisions and actions of health care providers. Such systems will soon see widespread use in direct patient care.
Designing and evaluating Buster: an indexical mobile travel planner for public transportation
Authors: Jesper Kjeldskov, Eva Andersen, Lars Hedegaard
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

This paper elaborates on previous research into the design and use of mobile information systems for supporting the use of public transportation. Contributing to this domain of HCI research, we describe the design and evaluation of a mobile travel planner, Buster, for the public city bus system of a large regional city in Denmark. Carrying on from on earlier research activities, we did contextual interviews, acting out of future scenarios in situ, and iterative paper prototyping to extend on previous design ideas and explore further the principle of indexicality in interface design for context-aware mobile systems. We then implemented a functional prototype application and evaluated it in the field.
"How may I help you?" Politeness in computer-mediated and face-to-face library reference transactions
Authors: Jessica Luo Carlo, Youngjin Yoo
Venue: Information and Organization (2007)

Drawing upon Wittgenstein's theory of language games, we apply a pragmatic approach to organizational communication. The study extends current theories of computer-mediated communication, and explores how language actually gets used across media. We conduct a comparative study of face-to-face versus computer-mediated reference transactions in an academic library, and analyze people's use of politeness strategies. The study observes that people use politeness strategies to play different language games across media, and that a dynamic interplay exists among the three constituents of language games: sense making, language use, and forms of life. In particular, we found that: First, people use significantly more negative politeness strategies and fewer positive politeness strategies online than face-to-face. Second, language use influences people's understanding and precedes practical forms of life. Third, CMC is a different form of life than a face-to-face communication. The new online form of life shapes people's sense making and the way they use language, resulting in emerging new grammars of CMC. Finally, our findings suggest the interplay among multiple forms of life. This study offers important theoretical and managerial implications for organizational communication and the production and delivery of services in the rapidly expanding digital economy.
A Global Minimum Clock Distribution Network Augmentation Algorithm for Guaranteed Clock Skew Yield
Authors: Bao Liu, Andrew B. Kahng, Xu Xu, Jiang Hu, Ganesh Venkataraman
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Nanometer VLSI systems demand robust clock distribution network design for increased process and operating condition variabilities. In this paper, we propose minimum clock distribution network augmentation for guaranteed skew yield. We present theoretical analysis results on an inserted link in a clock network, which scales down local skew and skew variation, but may not guarantee global skew and skew variation reduction in general. We propose a global minimum clock network augmentation algorithm, which inserts links simultaneously between all nearest sink pairs, apply rule-based link removal, and perform link consolidation by Steiner minimum tree construction for wirelength reduction with guaranteed clock skew yield. Our experimental results show that our proposed algorithm achieves dominant clock network augmentation solutions, e.g., an average of 16% clock skew yield improvement, 9% maximum skew reduction, and 25% reduction of clock skew variation standard deviation with identical wirelength compared with previous best clock network link insertion methods [11].
A Method of Decision Making in Pattern Recognition
Authors: S. K. Das
Venue: IEEE Transactions on Computers (1969)

A method of decision making which leads to the formation of a gain vector by utilizing a design set of patterns from only the class to be recognized is proposed. Some comparisons of this method with the adaline technique have been made and the method has been applied to the practical problem of speaker verification.
MP1: real time scheduling theory and its use with ada
Authors: Frank Singhoff
Venue: ACM SIGAda Ada Letters (2007)

This tutorial assumes basic knowledge or experience with the Ada programming language. Basic understanding of tasking and real-time constraints -- at the level of tutorial MA1 -- would be helpful. We assume that attendees have a minimal background on real time operating systems, Ada tasking and critical real time applications/systems; however, a (very) short presentation of such topics will be included in the tutorial. This tutorial deals with real time scheduling theory and its use with Ada. Real time scheduling theory was firstly proposed in 1974, but stays mostly unused by many software designers. Too many practitioners have no background on real time scheduling. This tutorial should help them to understand the basis of such a theory and to apply it with Ada technologies. This tutorial is expected to help Ada engineers to predict the performances of their critical Ada real time applications. This tutorial will be organized in three parts: 1. First, we define what a real time system is and then, the theoretical results of the real time scheduling theory are presented. The basic task models and schedulers are explained (their behavior and their properties). The tutorial focusses on fixed priority scheduler and its feasibility tests (eg. Rate monotonic and worst case task response time) which is the most useful scheduler with current real-life applications. However, a dynamic priority scheduler is also presented (eg. EDF). At the end of this first part, attendees should understand what a feasibility test is and how it can help them to predict performances of their real time applications. This part is ended with a short introduction on shared resource support (eg. what a priority inversion is, how PIP/PCP work). 2. Second, we show how real time scheduling features are taken into account in Ada international standards such as ISO/IEC Ada 1995 and 2005, the POSIX 1003 Ada binding and ARINC 653 (which is an avionic operating system standard providing an Ada binding). In this part, we try to show the relationships between the real time scheduling theory and the implementation of real time schedulers into practical systems. 3. Finally, some Ada program examples are presented and explained.
Detecting mobile land targets in LADAR imagery with fuzzy algorithms
Authors: David DeKruger, Jesse Hodge, James C. Bezdek, James M. Keller, Paul Gader
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

We describe an automatic target detection system whose objective is to detect surface-to-air missile launchers and tanks -- small, mobile land targets. The system uses range and intensity images from a Laser Detection and Ranging (LADAR) sensor. Each type of image is filtered and passed to a pair of (different) detectors. Outputs from the four detectors are subsequently filtered with a Choquet fuzzy integral, and then fused with a generalized mean. Finally, blob detections are superposed on intensity images for visual assessment, and blob windows are compared to ground truth to compute performance statistics. The system is illustrated using images from two scenes available in several volumes of the Joint Advanced Weapons Guidance data; a target board site, and the so-called "Chicken Little" outer compound. The main objective of this article is to document the proposed architecture -- a novel target detection approach based on fuzzy decision theory -- as a proof of concept. We have left detailed comparisons with other approaches, as well as concrete error rate analysis, to another investigation.
On the production of creative subjectivity
Authors: Brett Rolfe
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Businesses today are requiring higher levels of creativity and innovation in the face of rapid change, fierce competition and increasingly complex markets. Nowhere is the more obvious than in digital media, where new approaches are being sought to creative concept development. Grounded in psychology, academic research into creativity has focused almost exclusively on the individual, acknowledging social and cultural environment as passive factors. This paper proposes an approach that radically de-centers the individual, suggesting that creativity emerges from within a complex engagement of individuals, processes, resources, structures and limitations. The model proposed draws on the notions of 'distributed cognition' and 'machinic subjectivity' to provide a framework that encompasses the creative potential of the individual, but situates it within other equally critical environmental elements. Given this understanding of the creative endeavour, the term 'manager' becomes too limited and prescriptive, and might best be replaced with a more suitable term such as 'facilitator' or 'catalyst'. There is a clear consensus on the value of 'creative generalists' who are able to bridge discourses and act as catalysts for creative connection. Such generalists as these appear to be ideally placed to facilitate the creative assemblages that are taking shape inside digital media agencies.
Middleware/System Services
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

The XML signature specification provides a rich and flexible message signature model for XML documents, and it has been adopted by SOAP applications to provide message-level security. However, the XML signature design introduces a number of complex processing steps, such as canonicalization and XPath filtering, that often lead to performance and scalability problems when encountering extremes of size and rate in the processing of XML. In this paper, we focus on the performance of validating large signed XML messages, as might be sent by a scientific application using grid Web services. We present the design and implementation of the GHPX/SSSV system for the streaming validation of SOAP digital signature. Our model consists of a streaming canonicalization and optimized SOAP signature validation. We present an empirical study of the performance characteristics of these streaming validation features. Based on our evaluations we conclude that the streaming validation model can not only provide high performance, but is also memory efficient. 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
An Approach to Dynamic Ontology Integration for P2P/DAKS Coalitions
Authors: S. M. Deen, K. Ponnamperuma, M. Takizawa
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In this paper we discuss an approach to dynamic and automatic integration of ontologies for peer to peer data and knowledge sharing (P2P/DAKS) networks (called coalitions), where peer schemas are assumed to be heterogeneous, and a peer is permitted to join many such coalitions. In this approach each peer provides a peer ontology, appropriate to a coalition, for the global interpretation of its schema. These peer ontologies, based on hierarchic relationships among its entity concepts, can be dynamically integrated into a global coalition ontology, using a graph-based inclusion technique.
Time scheduling of transit systems with transfer considerations using genetic algorithms
Authors: Kalyanmoy Deb, Partha Chakroborty
Venue: Evolutionary Computation (1998)

Scheduling of a bus transit system must be formulated as an optimization problem, if the level of service to passengers is to be maximized within the available resources. In this paper, we present a formulation of a transit system scheduling problem with the objective of minimizing the overall waiting time of transferring and nontransferring passengers while satisfying a number of resource-and service-related constraints. It is observed that the number of variables and constraints for even a simple transit system (a single bus station with three routes) is too large to tackle using classical mixed-integer optimization techniques. The paper shows that genetic algorithms (GAs) are ideal for these problems, mainly because they (i) naturally handle binary variables, thereby taking care of transfer decision variables, which constitute the majority of the decision variables in the transit scheduling problem; and (ii) allow procedure-based declarations, thereby allowing complex algorithmic approaches (involving if then-else conditions) to be handled easily. The paper also shows how easily the same GA procedure with minimal modifications can handle a number of other more pragmatic extensions to the simple transit scheduling problem: buses with limited capacity, buses that do not arrive exactly as per scheduled times, and a multiple-station transit system having common routes among bus stations. Simulation results show the success of GAs in all these problems and suggest the application of GAs in more complex scheduling problems.
An Improved Multi-particle Swarm Co-evolution Algorithm
Authors: Kun Yao, Feifei Li, Xiyu Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Illumined by phenomenon of co-evolution in nature, particle swarm optimization is combined with co-evolution, in this paper, an improved multi-particle swarm co-evolution algorithm is presented. In the process of evolution, particles not only have to exchange information with the others that are in its own sub-swarm but also are influenced by the particles from the other sub-swarms. By doing experiments on three benchmark functions, the results show that the algorithm avoids trapping into local optimum in certain extents and improves the precision of convergence.
Erratum-July Issue
Venue: Computer (1980)

In Ware Myers' "Computer Graphics: A Two-Way Street" (pages 49-58), the images reproduced on pages 55-56 were drawn from the Siggraph '79 slide collection, which was issued as part of ACM Computer Graphics, VOl. 13, No. 4. 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
Two multi-constrained multicast QoS routing algorithms
Authors: Huang Lin, Zhang Yu-Lin, Ren Yong-Hong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Multicast routing algorithms that are capable of providing quality of service (QoS) to its members will play an important role in future communications networks.In the paper,for the multi-constrained minimum Steiner tree problem,we proposed a CBT-based multi-constrained-multicast routing algorithm(CMCMRA) and a SPH-based multiconstrained multicast routing algorithm(SMCMRA). Anlysis showed the algorithms are easy to implement and the time complexities are quite and simulation results illustrated the algorithms have features of well performance of cost and guarantee QoS multiple constraints efficiently.
Architectural trends in large systems
Authors: Gene M. Amdahl
Venue: ACM SIGMICRO Newsletter (1972)

Large systems architectural ideas progressed very rapidly during the middle of the 60's but is currently in a sort of hiatus. This hiatus is largely due to the need to digest the significance of the preceding developments and is currently reinforced by the economic recession. These architectural developments have yielded announced or about to be announced products like the IBM 195, the CDC 7600 and STAR, and the ILLIAC IV. These machines represent not only different solutions to the problem of high performance, but also different views of what constitutes the problem. These concepts of problems, along with their solutions, goes from: consisting of identical processing performed at each of a great many points---so put in many execution units run by a single instruction control---and ranges to: problems require quite diverse functions rather locally---so make it possible to utilize these diverse facilities concurrently. These machines above are listed in the order of their degree of independence of problem regularity when it occurs. The common denominator of these machines is the intent to capitalize upon the existence of concurrently executable sequentially independent process strings.
Design, Implementation, and Evaluation of Trellis-SDP for File-Level Data Parallelism
Authors: Meng Ding, Paul Lu, Juefu Wang, Mauricio D. Sacchi
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Although data parallelism is a well-known computational model, there are few programming systems that are both easy to program (for simple applications) and able to work across administrative domains. For data sets (e.g., collections of image data) that are often inherently distributed, there is a need for a simple data-parallel programming system. We describe the design, implementation, and an evaluation of Trellis-SDP, a simple data-parallel programming system that facilitates the rapid development of dataintensive applications. Trellis-SDP is layered on top of the Trellis infrastructure, a software system for creating overlay metacomputers: user-level aggregations of computer systems. Trellis-SDP is based on file-level data parallelism and provides a Master-Worker programming framework in which the worker components can run self-contained, new or existing binary applications. We evaluate our programming system with a non-trivial seismic data processing application.
Survey of Traceability Approaches in Model-Driven Engineering
Authors: Ismenia Galvao, Arda Goknil
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Models have been used in various engineering fields to help managing complexity and represent information in dif- ferent abstraction levels, according to specific notations and stakeholder's viewpoints. Model-Driven Engineering (MDE) gives the basic principles for the use of models as primary artefacts throughout the software development phases and presents characteristics that simplify the engi- neering of software in various domains, such as Enterprise Computing Systems. Hence, for its successful application, MDE processes must consider traceability practices. They help the understanding, capturing, tracking and verifica- tion of software artefacts and their relationships and depen- dencies with other artefacts during the software life-cycle. In this survey, we discuss the state-of-the-art in traceabil- ity approaches in MDE and assess them with respect to five general comparison criteria: representation, mapping, scalability, change impact analysis and tool support. As a complementary result, we have identified some open issues that can be better explored by traceability in MDE.
Analyzing microarray data using CLANS
Authors: Tancred Frickey, Georg Weiller
Venue: Bioinformatics (2007)

Summary: Analysis of microarray experiments is complicated by the huge amount of data involved. Searching for groups of co-expressed genes is akin to searching for protein families in a database as, in both cases, small subsets of genes with similar features are to be found within vast quantities of data. CLANS was originally developed to find protein families in large sets of amino acid sequences where the amount of data involved made phylogenetic approaches overly cumbersome. We present a number of improvements that greatly extend the previous version of CLANS and show its application to microarray data as well as its ability of incorporating additional information to facilitate interactive analysis. Availability: The program is available for download from: http://bioinfoserver.rsbs.anu.edu.au/downloads/clans/ Contact: Georg.Weiller@anu.edu.au Supplementary information: http://bioinfoserver.rsbs.anu.edu.au/programs/clans