ppxscal/embedding_network huggingface dataset:
Automated methods for creating diversity in computer systems
Authors: Elena Gabriela Barrantes Sliesarieva
Venue:  (2005)

The pervasive homogeneity of computer systems attached to the Internet represents a serious security threat. Once an effective attack is crafted against one machine, it can quickly and easily be used against thousands of identical systems. A possible response to this situation can be found using biological diversity as inspiration. In nature, diversity provides a defense against unpredictable threats by maximizing the probability that some individuals will survive. Diversity in computer systems could confer security benefits by protecting against attacks that rely on homogeneity. Reducing the uniformity in existing systems is, however, a non-trivial task, as standardization must be maintained at many interface points. This dissertation assesses the costs and benefits of automated diversity by implementing one interface and one implementation randomization. The interface diversification scheme is a machine language randomization, named Randomized Instruction Set Emulation (RISE), intended as a protection against the threat of code-injection attacks, which insert malicious machine-language code into programs. RISE protects against these attacks by creating a unique machine code per process by mapping all executable bytes of the process to a random mask. When injected code attempts to execute, its code is also mapped to the mask, but given that it was not correctly encoded, the emulator &lsquo;decodes&rsquo; it to random bytes, causing the attack to fail. Although the attack will not execute as intended, there is a small probability that random bytes will be interpreted as instructions. Therefore, an analysis of the risks associated with the execution of random instructions is presented. Implementation diversity is used as defense against Denial of Service (DoS) attacks which lock protocols into low-performance emergency states allowing the program to operate under stress without crashing. An attacker with knowledge about the stress assessment algorithm can trick the program into going into one of the emergency states states. The diversity approach presented randomizes parameters used in the TCP congestion control algorithm. The randomization is tested against a DoS attack that throttles the throughput of a system by forcing TCP to go into a congestion avoidance mode. The diversification achieves the objective of keeping a portion of the hosts in the attacked network operating at larger bandwidths than if they were all using the same standard parameter values.
WikiWiki weaving heterogeneous software artifacts
Authors: Ademar Aguiar, Gabriel David
Venue: Proceedings of the 2005 international symposium on Wikis (2005)

Good documentation benefits every software development project, especially large ones, but it can be hard, costly, and tiresome to produce when not supported by appropriate tools and methods.The documentation of a software system uses different artifacts, namely source code, for low-level internal documentation, and specific-purpose models and documents, for higher-level external documentation (e.g. requirements documents, use-case specifications, design notebooks, and reference manuals). All these artifacts require continual review and modification throughout the life-cycle to preserve their consistency and value.Good software documents are often heterogeneous, i.e., they combine different kinds of contents (text, code, models, images) gathered from separate software artifacts, a combination usually difficult to maintain as the system evolves over time, considering that source code, models and documents are typically produced and maintained separately in multiple sources using different environments and editors.This paper presents a wiki that helps on quickly weaving different kinds of contents into a single heterogeneous document, whilst preserving its semantic consistency. The fundamental goal of this wiki (XSDoc Wiki) is to reduce the development-documentation gap by making documentation more convenient and attractive to developers. An example taken from the JUnit framework documentation helps to illustrate the features more relevant to do such weaving.
Fault-Tolerant Routing Algorithm for RDT Structure
Authors: Yang Yu, Tao Li, Yulu Yang, Xiaoshe Dong
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

RDT (Recursive Diagonal Torus) is a class of interconnection networks for massively parallel computers (MPCs). It consists of recursively structured mesh/torus connections. It has been proved that RDT supports better performances than most direct networks. SINOMP designed for the structure simulation and performance analysis between RDT and those networks is proposed. The simulation results also prove the good performances of RDT. In this paper, the fault-tolerant routing algorithms on the RDT structure are proposed and discussed. They select one of the shortest routes computed with the routing vector on the non-faulty network by using the different rank order. The additional hops are used to send packet only when all the shortest routes have faulty links/nodes. The proposed algorithms need no additional virtual channels for fault tolerant and support a reasonably large number of faults without significantly degrading the system performance.
INDUS: A New Platform for Ubiquitous Computing
Authors: Kallol Borah
Venue: Ubiquity (2005)

Kallol Borah began development of the Indus project at the Indian Institute of Technology Madras in 2002. Indus demonstrates how general purpose object oriented programming languages can be extended to enable ubiquitous computing applications.
Discovering Early Aspects
Authors: Elisa Baniassad, Paul C. Clements, Joao Araujo, Ana Moreira, Awais Rashid, Bedir Tekinerdogan
Venue: IEEE Software (2006)

Traditionally, aspect-oriented software development (AOSD) has focused on the software life cycle's implementation phase: aspects are identified and captured mainly in code. But aspects are evident earlier in the life cycle, such as during requirements gathering and architecture development. Identifying these early aspects ensures that you can appropriately capture aspects related to the problem domain (as opposed to merely the implementation). Additionally, it offers opportunities for early recognition and negotiation of trade-offs and allows forward and backward aspect traceability. This makes requirements, architecture, and implementation more seamless and lets you apply aspects more systematically. Many techniques exist for dealing with early aspects in practice, but a holistic approach is lacking. This article is an overview of how to exploit early aspects and charts aspects as they move from project inception to development.
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Authors: Jimeng Sun, Huiming Qu, Deepayan Chakrabarti, Christos Faloutsos
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Many real applications can be modeled using bipartite graphs, such as users vs. files in a P2P system, traders vs. stocks in a financial trading system, conferences vs. authors in a scientific publication network, and so on. We introduce two operations on bipartite graphs: 1) identifying similar nodes (Neighborhood formation), and 2) finding abnormal nodes (Anomaly detection). And we propose algorithms to compute the neighborhood for each node using random walk with restarts and graph partitioning; we also propose algorithms to identify abnormal nodes, using neighborhood information. We evaluate the quality of neighborhoods based on semantics of the datasets, and we also measure the performance of the anomaly detection algorithm with manually injected anomalies. Both effectiveness and efficiency of the methods are confirmed by experiments on several real datasets.
Proceedings of the 2005 workshops on Genetic and evolutionary computation
Venue: Genetic And Evolutionary Computation Conference (2005)

Genetic and evolutionary algorithms (GEA) are efficient nature-inspired planning and optimization methods based on the principles of natural evolution and genetics. Due to their efficiency and the simple underlying principles, these methods are used for a large number of problems in the context of problem solving, optimization, and machine learning. The book at hand presents a careful selection of papers that address the latest trends and hot topics in GEAs. All papers in this book have been presented at the workshop sessions at the Genetic and Evolutionary Computation Conference (GECCO) 2005. The format and style of the workshops was varying. The common property of the workshops was that they addressed current trends and hot topics in GEA research and application. The GECCO 2005 workshops, of which this volume contains the proceedings, were held in Washington, D.C., USA, on June 25-26, 2005. The GECCO 2005 workshop series consisted of the following individual workshops: bull; BioGEC 2005, the Fourth annual Workshop on Biological Applications of Genetic and Evolutionary Computation, bull; EvoDOP 2005, the FirstWorkshop on Evolutionary Algorithms for Dynamic Optimization Problems, bull; IWLCS 2005, The Eighth International Workshop on Learning Classifier Systems, bull; MedGEC 2005, the First Workshop on Medical Applications of Genetic and Evolutionary Computation, bull; MSAEC 2005, the Second Workshop on Military and Security Applications of Evolutionary Computation, bull; OBUPM 2005, the FourthWorkshop on Optimization by Building and Using Probabilistic Models, bull; PSGEA 2005, the First Workshop on Parameter setting in Genetic and Evolutionary Algorithms, bull; SEEDS 2005, the First Workshop on Scalable, Evolvable, Emergent Design and Developmental Systems, bull; SOEA 2005, the Second Workshop On Self-Organization in Representations For Evolutionary Algorithms: Building complexity from simplicity, and bull; TheoryRep 2005, the First Workshop on Theory of Representations. In addition, attendees of the GECCO 2005 workshop sessions could also attend the "Ask the consultant" workshop organized by Dave Davis and the "Coevolution Discussion Forum" organized by Anthony Bucci, Edwin de Jong, and R. Paul Wiegand. The GECCO 2005 workshop series also includes two student-oriented workshops: bull; GWS 2005, the Graduate Student Workshop, and bull; UGWS 2005, the Undergraduate Student Workshop on Evolutionary Computation. Both workshops were an important link between students and researchers and gave students the opportunity to present interesting and high-quality work.
Driving View Simulation Synthesizing Virtual Geometry and Real Images in an Experimental Mixed-Reality Traffic Space
Authors: Shintaro Ono, Koichi Ogawara, Masataka Kagesawa, Hiroshi Kawasaki, Masaaki Onuki, Ken Honda, Katsushi Ikeuchi
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

We propose an efficient and effective image generation system for an experimental mixed-reality traffice space. Our enhanced traffic/driving simulation system represents the view through a hybrid that combines virtual geometry with real images to realize high photo-reality with little human cost. Images for datasets are captured from the real world, and the view for the simulation system is created by synthesizing image datasets with a conventional driving simulator.
Computing almost shortest paths
Authors: Michael Elkin
Venue: ACM Transactions on Algorithms (TALG) (2005)

We study the <i>s-sources almost shortest paths</i> (abbreviated <i>s-ASP</i>) problem. Given an unweighted graph <i>G</i> equals; (<i>V,E</i>), and a subset <i>S</i> sube; <i>V</i> of <i>s</i> nodes, the goal is to compute almost shortest paths between all the pairs of nodes <i>S</i> times; <i>V</i>. We devise an algorithm with running time <i>O</i>( mid;<i>E</i> mid;<i>n</i><sup> rho;</sup> plus; <i>s</i> middot; <i>n</i><sup>1 plus; zeta;)</sup> for this problem that computes the paths <i>P</i><sub><i>u,w</i></sub> for all pairs (<i>u,w</i>) isin; <i>S</i> times; <i>V</i> such that the length of <i>P</i><sub><i>u,w</i></sub> is at most (1 plus; epsi;) <i>d</i><sub><i>G</i></sub>(<i>u,w</i>) plus; beta;( zeta;, rho;, epsi;), and beta;( zeta;, rho;, epsi;) is constant when zeta;, rho;, and epsi; are arbitrarily small constants. We also devise a distributed protocol for the <i>s</i>-ASP problem that computes the paths <i>P</i><inf><i>u,w</i></inf> as above, and has time and communication complexities of <i>O</i>(<i>s</i> middot; <i>Diam(G)</i> plus; <i>n</i><sup>1 plus; zeta;/2</sup>) (respectively, <i>O</i>(<i>s</i> middot; <i>Diam(G)</i> log<sup>3</sup> <i>n</i> plus; <i>n</i><sup>1 plus; zeta;/2</sup> log <i>n</i>)) and <i>O</i>( mid;<i>E</i> mid; <i>n</i><sup> rho;</sup> plus; <i>s</i> middot; <i>n</i><sup>1 plus; zeta;)</sup> (respectively, <i>O</i>( mid;<i>E</i> mid; <i>n</i><sup> rho;</sup> plus; <i>s</i> middot; <i>n</i><sup>1 plus; zeta;</sup> plus; <i>n</i><sup>1 plus; rho; plus; zeta;( rho; minus; zeta;/2)/2)) in the synchronous (respectively asynchronous) setting. Our sequential algorithm, as well as the distributed protocol, is based on a novel algorithm for constructing (1 plus; epsi;, beta;( zeta;, rho;, epsi;))-spanners of size <i>O</i>(<i>n</i><sup>1 plus; zeta;</sup>), developed in this article. This algorithm has running time of <i>O</i>( mid;<i>E</i> mid; <i>n</i><sup> rho;</sup>), which is significantly faster than the previously known algorithm given in Elkin and Peleg [2001], whose running time is <i> Otilde;</i>(<i>n</i><sup>2 plus; rho;</sup>). We also develop the first distributed protocol for constructing (1 plus; epsi;, beta;)-spanners. The communication complexity of this protocol is near optimal.
Simulation language development for health care systems analysis
Authors: Stephen D. Roberts
Venue: ACM SIGSIM Simulation Digest (1979)

Two simulation language developments are described which facilitate the modeling of health care systems. The languages are based on a network format to promote model description and create a communications vehicle for participatory modeling. INS is a general purpose simulation language especially useful in operational environments where problems can be described as a network of queues. SLN is oriented to the modeling of decisions which can be described by a network of logical or decision processes. Both languages are well documented and written in standard FORTRAN for portability.
CRANAI: A New Search Model Reinforced by Combining a Ranking Algorithm with Author Inputs
Authors: Jun Lai, Ben Soh
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The explosion of information on the Internet has made search engine become the main method for users to find information on the web. In this paper, we propose a new search model by combining a hyperlink-based page ranking algorithm with author inputs. The page ranking algorithm measures page importance by calculating the page weight based on incoming and outgoing hyperlinks in the page. The author input takes into account the weight of relevance in terms of keywords or phrases of a page specified by the page creators. Our evaluation shows that the proposed search method performs better than that using only the page ranking algorithm.
An Advanced Minimization Technique for Multiple Valued Multiple Output Logic Expressions Using LUT and Realization Using Current Mode CMOS
Authors: Md. Sumon Shahriar, A. R. Mustafa, Chowdhury Farhan Ahmed, Abu Ahmed Ferdaus, A. N. M. Zaheduzzaman, Shahed Anwar, Hafiz MD Hasan Babu
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

We proposed an advanced minimization method for multiple valued multiple output functions in this paper. We extracted the shared sub functions with a proposed heuristic method to pair the functions. New minimization approach for multiple valued functions has also been proposed where we used Kleenean Coefficients and we used LUT to reduce the complexity as well. Our minimization method reduces the number of implicants significantly. The realization of the minimized circuits has also been shown using current mode CMOS.
Data Mining Analysis of Granular Bed Caking during Hop Extraction
Authors: Jerzy W. Grzymala-Busse, Zdzislaw S. Hippe, Teresa Mroczek, Edward Roj, Boleslaw Skowronski
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Our objective was to investigate an influence of some factors contributing to the bed caking tendency during the hop extraction process. It is important to keep the process free of bed caking since it prolongs extraction. In our research, three data sets describing the extraction process were used for knowledge discovery using rule induction and generation of belief networks. Experts analyzed discovered knowledge from the view point of potential applications. Finally, an error rate for all used methods was estimated using ten-fold cross validation.
A perspective on interactive survey analysis
Authors: Edmund D. Meyers,  Jr.
Venue: ACM SIGSOC Bulletin (1979)

In this paper, interactive survey analysis is broadly conceived so that discussion is not limited simply to researchers fondling data files. The digital computer -- especially the time-shared type -- has potential for constructive use by researchers well beyond the process of analyzing survey data. Consideration is given to accomplished resources, projects under development, and capabilities which might be developed; so it is worth keeping an eye on what is fact and what is fantasy.
A Metamorphic Approach to Integration Testing of Context-Sensitive Middleware-Based Applications
Authors: W. K. Chan, T. Y. Chen, Heng Lu
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

During the testing of context-sensitive middleware-based software, the middleware identifies the current situation and invokes the appropriate functions of the applications. Since the middleware remains active and the situation may continue to evolve, however, the conclusion of some test cases may not be easily identified. Moreover, failures appearing in one situation may be superseded by subsequent correct outcomes and may, therefore, be hidden. We alleviate the above problems by making use of a special kind of situation, which we call checkpoints, such that the middleware will not activate the functions under test. We propose to generate test cases that start at a checkpoint and end at another. We identify functional relations that associate different execution sequences of a test case. Based on a metamorphic approach, we check the results of the test case to detect any contravention of such relations. We illustrate our technique with an example that shows how re-hidden failures may be detected.
RFID tags for ambient intelligence: present solutions and future challenges
Authors: Hughes Metras
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

The present paper aims at delivering a broad overview of current state of the art technologies in the field of RFID including standardization issues. On that basis the potential use of RFID in ambient intelligence (AmI) scenarios will be discussed highlighting the two main visions and paradigms that are proposed in the field: one concentrates all the information on centralized or distributed data servers that are accessed through web services pointed by the URL addresses stored in the tags read by the user; the other is built on the use of tags or sensors as a media to gather information in the close environment of the user in order to enrich its experience. Finally, we will have a look at the various tag functionalities and performances that need improvements to meet AmI requirements and we will discuss the associated research and technology development challenges.
Visitor Access Management in Personal Wireless Networks
Authors: N. Asokan, Seamus Moloney, Philip Ginzboorg, Kari Kostiainen
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

The increasing popularity and variety of consumer multimedia devices is driving the need for networked homes. Yet setting up a secure wireless network is a daunting task for most ordinary users. Recently, there have been several proposals for easing this process. However, none of the proposals consider the problem of how to make it easy to manage visitor access. In this paper, we motivate the requirements for visitor management, show the shortcomings of the current easy setup proposals in this regard, and propose a new setup procedure that makes it easy to manage visitor access to wireless networks. Our contributions are twofold: First we present an approach to assigning categories to client devices at admission time so that selective revocation of clients based on those categories becomes possible. Then we present the idea of admission tickets, a flexible and secure way to delegate conditional access rights. We report the results and experience of prototyping of the proposed procedure using the HostAP framework.
A Study of Signaling Game and Its Bayesian Equilibrium in CRM
Authors: Q. J. Yin, R. C. Gan
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

The paper applies the analysis method of the signaling game into the Customer Relationship Management (CRM). Based on the bi-direction information transmitted in the CRM, the signaling game model of business-customer is established, which is represent by six factors, such as advertisement input level, product price, service level, consultation input level, purchase quantity and satisfactory degree. The model focuses on the equilibrium activities of the business and customer in the environment of CRM. The Bayesian equilibrium of the model is obtained by applying Backwards Induction.
Experimental approaches to the study of systems documentation
Authors: T. D. C. Kuch
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

In addition to reporting on various documentation methods and proposing new ones, I suggest that there is a need for an experimental approach to the measurement of documentation. It may be appropriate for SIGDOC, or a SIGDOC member at a university, to apply for a grant to evaluate HIPO, Autoflow, and other techniques, including combinations of techniques. In general, the experiment might take this form:1. Select a fairly small system which performs fairly simple functions, say, calculates a non-complex payroll. The system should comprise fewer than eight (or so) programs, including calls to sorts or other utility programs. The system should have been in operation long enough so that virtually all its quirks are known.2. Prepare a number of different documentation packages for the system, and present copies to test subjects, one subject per package.3. Measure: a. Time required by the subject until he claims "understanding" of the documentation; b. Number of questions the subject has about the system that were not answered by the documentation.4. Then, present the test subject with a series of problems, such as "Increase Federal tax withheld by 0.5% for each employee", or "Print the names of all employees earning less than $4 an hour". 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