ppxscal/embedding_network huggingface dataset:
Lexbfs based recognition algorithms for cographs and related families
Authors: Anna Bretscher
Venue:  (2005)

We develop new, easily implemented, optimal recognition algorithms for the cograph, distance hereditary, P4 -reducible and P4-sparse graph families. Cographs are the graphs with no induced path on four vertices (P 4), distance hereditary graphs are named after their characterizing property that the distance between any two connected vertices x and y of an induced subgraph equals their distance in the original graph, P4-reducible graphs are the graphs such that no vertex belongs to more than one P4, and P 4-sparse graphs are the graphs such that no set of five vertices induces more than one P4. Each graph family has a rooted tree representation, which defines a decomposition scheme: for Cographs, modular decomposition; for distance hereditary graphs, split decomposition; and for P4-sparse and P4-reducible, a simplification of homogeneous decomposition. Consequently, for these families, the recognition algorithms are also decomposition algorithms. Structurally, each algorithm adheres to the following simple paradigm; order the vertices using a multisweep LexBFS approach, check a neighbourhood property and report a certificate verifying inclusion or exclusion in(from) the family. The algorithms are based upon new graph characterizations and a new search, LexBFS&minus;, a variant of Lexicographic Breadth First Search (LexBFS); LexBFS&minus; operates on the complement using only the edges of the given graph. The neighbourhood check, for each graph family, is based on a new characterization of the graph class with respect to LexBFS. The final step returns a certificate in the form of a tree representation if the graph is in the family, and a forbidden induced subgraph otherwise. Each step is linear in the number of edges and vertices of the graph combining for an optimal algorithm. These algorithms are significant because of their simplicity, linear time complexity and potential to be extended to recognize other graph classes such as permutation graphs, HHD-free graphs, P4-extendible etc., and ultimately, to solve the related decomposition problems.
Towards an empirical measure of evolvability
Authors: Joseph Reisinger, Kenneth O. Stanley, Risto Miikkulainen
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Genetic representations that do not employ a one-to-one mapping of genotype to phenotype are known as indirect encodings, and can be much more efficient than direct encodings for complex problems. Increasing a representation's capacity to facilitate effective search, i.e. its evolvability, has long been a goal of Evolutionary Computation. However, currently no benchmarks exist to measure evolvability. One reason is that it is difficult to decouple a representation's capacity to evolve under any fitness function, i.e. the latent evolvability, and its performance on a specific benchmark. Towards this goal, a method is proposed in this paper that measures the representation's ability to extract invariant properties from a changing fitness function. The test is applied to three distinct representations and it is able to distinguish all three. Ultimately, this test can serve as the foundation for performing controlled experiments determining what factors contribute to evolvability.
XML
Authors: C. M. Sperberg-McQueen
Venue: Queue (2005)

XML, as defined by the World Wide Web Consortium in 1998, is a method of marking up a document or character stream to identify structural or other units within the data. XML makes several contributions to solving the problem of semi-structured data, the term database theorists use to denote data that exhibits any of the following characteristics:
A Novel Pricing Approach for QoS Enabled 3G Networks
Authors: Vitalis G. Ozianyi, Neco Ventura
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The prices used for the charging of data and multimedia services in communication networks depend on the profit maximization goals of the network operators and service providers, and the market forces affecting the industry. In many scenarios the tariff rates used increase with the speed of the access channel. Next generation networks will offer higher data rates. Users will not get incentives to utilise the extra capacity if current tariff structures are retained. In this paper, a novel, network congestion dependent dynamic billing scheme is proposed. Differentially priced network service profiles are introduced, and the use of DiffServ and connection admission control for QoS provisioning is explored. A hybrid billing scheme is designed. The implementation architecture is given, and a testbed for evaluating the scheme is built.
Problem-Solving Environments for Biological Morphogenesis
Authors: Roeland M. H. Merks, Alfons G. Hoekstra, Jaap A. Kaandorp, Peter M. A. Sloot, Paulien Hogeweg
Venue: Computing in Science and Engineering (2006)

Simulation is becoming an important tool to understand developmental mechanisms. In this article we discuss two prototypical problem solving environments (PSEs) for biological development.The first PSE implements a three-dimensional model of coral growth and enables marine biologists to construct and analyze simulations with high-level concepts. The second PSE helps explore the interplay between genetic information and physical mechanisms during embryonic development of multicellular organisms and its evolution. The two PSEs have contrasting demands. A single simulation of a coral and its environment is very expensive. Thus the PSE manages single simulation set-ups and streamlines analysis of single simulations. The study of biological evolution requires high simulation throughput, and for this reason we use a simple, efficient two-dimensional model of biological development. The modular architecture of the PSEs gives advanced users full control, while keeping them accessible to the computationally unskilled.
Support vector machine learning for interdependent and structured output spaces
Authors: Tomas Hofmann
Venue:  (2005)

Learning general functional dependencies between arbitrary input and output spaces is one of the main goals in machine learning. Recent progress in kernel-based methods has focused on designing flexible and powerful input representations, far example, involving sequences, strings, or graphs. This dissertation addresses the complementary issue of designing classification algorithms that can deal with more complex outputs. In particular, the problems we consider fall into two generic cases: first, problems where output themselves can be characterized by certain output-specific attributes, and learning should occur across outputs as much as across inputs; second, problems where the outputs are structured, that is, they describe a configuration over components, with possible dependencies among the components. We approach these problems by generalizing multiclass support vector machines in a maximum-margin formulation that involves features extracted jointly from inputs and outputs, and supports the use of general loss functions. This leads to a quadratic program with a potentially prohibitive, for instance, exponential, number of constraints. Nevertheless, we present a cutting plane algorithm that solves the optimization problem in polynomial time for a large class of problems. Besides the respective theoretical results, we present experiments from various domains involving different types of output spaces, that emphasize the breadth and generality of our approach. The proposed method has important applications in areas such as computational biology, natural language processing, information retrieval extraction, and optical character recognition.
Investigating physical and chemical changes in high-k gate stacks using nanoanalytical electron microscopy
Authors: A. J. Craven, M. MacKenzie, D. W. McComb, F. T. Docherty
Venue: Microelectronic Engineering (2005)

The thermal budget involved in processing high-k gate stacks can cause undesirable physical and chemical changes which limit device performance. The transmission electron microscope and associated analytical techniques provide a way of investigating these changes on a sub-nanometre scale. Using electron energy loss near edge structure (ELNES), information on the local chemistry may be extracted. These techniques are applied to high-k dielectric stacks grown on Si and containing HfO2 and HfSiO layers.
Programming language trends: an empirical study
Authors: Ali Mili
Venue:  (2003)

Predicting the evolution of software engineering technology trends is a dubious proposition. The recent evolution of software technology is a prime example; it is fast paced and affected by many factors, which are themselves driven by a wide range of sources. This dissertation is part of a long term project intended to analyze software engineering technology trends and how they evolve. Basically, the following questions will be answered: How to watch, predict, adapt to, and affect software engineering trends? In this dissertation, one field of software engineering, programming languages, will be discussed. After reviewing the history of a group of programming languages, it shows that two kinds of factors, intrinsic factors and extrinsic factors, could affect the evolution of a programming language. Intrinsic factors are the factors that can be used to describe the general design criteria of programming languages. Extrinsic factors are the factors that are not directly related to the general attributes of programming languages, but still can affect their evolution. In order to describe the relationship of these factors and how they affect programming language trends, these factors need to be quantified. A score has been assigned to each factor for every programming language. By collecting historical data, a data warehouse has been established, which stores the value of each factor for every programming language. The programming language trends are described and evaluated by using these data. Empirical research attempts to capture observed behaviors by empirical laws. In this dissertation, statistical methods are used to describe historical programming language trends and predict the evolution of the future trends. Several statistics models are constructed to describe the relationships among these factors. Canonical correlation is used to do the factor analysis. Multivariate multiple regression method has been used to construct the statistics models for programming language trends. After statistics models are constructed to describe the historical programming language trends, they are extended to do tentative prediction for future trends. The models are validated by comparing the predictive data and the actual data.
Program Slicing Metrics and Evolvability: an Initial Study
Authors: Tracy Hall, Paul Wernick
Venue: Proceedings of the IEEE International Workshop on Software Evolvability (2005)

Previous research has identified a number of metrics derived from program slicing. In this paper we discuss how these metrics relate to the effort required to evolve an existing software-based system. Whilst our interest in this work stems from our development of simulation models of long-term software evolution processes, it will also be directly relevant to the managers of software evolution activities.
A Quick XML Parser for Extracting Signatures of Secure Web Services
Authors: Kuo-Yi Chen, Chi-Chih Huang, Ting-Wei Hou, Tzuo-Chun Lee, Shu-Fen Yang, Po-Wen Cheng
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Signatures of SOAP/XML messages were necessary to enforce the security. This paper proposes an approach to accelerate the process of validating signatures of web service calls. We developed a Quick XML Parser (QXP). The QXP is motivated by Xerces, but QXP outperforms Xerces ranging from 7 to 21 times speedup in the two benchmark programs.
Efficiently Mining Frequent Closed Partial Orders
Authors: Jian Pei, Jian Liu, Haixun Wang, Ke Wang, Philip S. Yu, Jianyong Wang
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Mining ordering information from sequence data is an important data mining task. Sequential pattern mining [1] can be regarded as mining frequent segments of total orders from sequence data. However, sequential patterns are often insufficient to concisely capture the general ordering information.
On Queues with Markov Modulated Service Rates
Authors: Sai Rajesh Mahabhashyam, Natarajan Gautam
Venue: Queueing Systems: Theory and Applications (2005)

In this paper, we consider a queue whose service speed changes according to an external environment that is governed by a Markov process. It is possible that the server changes its service speed many times while serving a customer. We derive first and second moments of the service time of customers in system using first step analysis to obtain an insight on the service process. In fact, we obtain an intriguing result in that the moments of service time actually depend on the arrival process! We also show that the mean service rate is not the reciprocal of the mean service time.Further, since it is not possible to obtain a closed form expression for the queue length distribution, we use matrix geometric methods to compute performance measures such as average queue length and waiting time. We apply the method of large deviations to obtain tail distributions of the workload in the queue using the concept of effective bandwidth. We present two applications in computer systems: (1) Web server with multi-class requests and (2) CPU with multiple processes. We illustrate the analysis and various methods discussed with the help of numerical examples for the above two applications.
Building a MAC-Based Security Architecture for the Xen Open-Source Hypervisor
Authors: Reiner Sailer, Trent Jaeger, Enriquillo Valdez, Ramon Caceres, Ronald Perez, Stefan Berger, John Linwood Griffin, Leendert van Doorn
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

We present the sHype hypervisor security architecture and examine in detail its mandatory access control facilities. While existing hypervisor security approaches aiming at high assurance have been proven useful for high-security environments that prioritize security over performance and code reuse, our approach aims at commercial security where near-zero performance overhead, non-intrusive implementation, and usability are of paramount importance. sHype enforces strong isolation at the granularity of a virtual machine, thus providing a robust foundation on which higher software layers can enact finer-grained controls. We provide the rationale behind the sHype design and describe and evaluate our implementation for the Xen open-source hypervisor.
Controllable Open Macrosystems in Thermodynamics and Microeconomics
Authors: A. M. Tsirlin, V. Kazakov, V. V. Trushkov
Venue: Open Systems Information Dynamics (2005)

In this paper stationary regimes of open macro-systems that include active subsystems (with controlled parameters) near equilibrium are considered. A generalized Prigogine extremal principle for such systems is formulated and proved. The conditions on optimal behavior of active subsystems in such systems are derived. It is shown that the obtained general results can be specified for thermodynamic and microeconomic systems to obtain the heat engine maximal power, the minimal irreversible work of separation, the limiting productivity of heat driven separation and the maximal capital extraction.
A Comparison of End-to-end Performance Over Three Multicast Sending Rate Control Schemes For Internet DTV
Authors: Xin Wang, Fei Li, Xiangyang Xue
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we examine the end-to-end performance of for Internet DTV and analyze the difficulties of network DTV programs multicast. Then we propose two end system-based multicast sending rate control algorithms, Buffer-based Network-adaptive Multicast Rate Control approach (BNMRC) and Improved TFMCC based Sending Rate Control (ITSRC), both of which can suit for the change of network traffic and satisfy the requirement of DTV decoder by controlling sending rate logically. The test results show that they have good practical value in comparison with existing TFMCC.
Providing on-demand sports video to mobile devices
Authors: Qingshan Liu, Zhigang Hua, Cunxun Zang, Xiaofeng Tong, Hanqing Lu
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper introduces a system for providing on-demand sports video to mobile devices, which has two main contributions. First, we construct an infrastructure for extracting and delivering the highlights instead of the whole sport videos to mobile clients, which can significantly reduce the bandwidth consumption. Second, we design an advanced UI for the mobile clients to effectively browse and interact with the video highlights. To validate the practicality and effectiveness of this system, we conduct the experiments on several real soccer videos. The results demonstrated that more than 65% of bandwidth consumption could be reduced. Moreover, the initial user study results show that the mobile users could interact effectively with the interface to seek or navigate sports videos.
Edge and percolation effects on VT window in nanocrystal memories
Authors: R. Gusmeroli, A. S. Spinelli, C. Monzio Compagnoni, D. Ielmini, A. L. Lacaita
Venue: Microelectronic Engineering (2005)

We present results of 3D Monte Carlo simulation of nanocrystal memory cells, investigating the impact of edge and percolation effects on the achievable threshold voltage window. While edge effects reduce the performance for narrow cells, percolation can play a beneficial role for W scaling, but is critical when scaling L. To reduce edge effects, a structure with non-overlapped trenches is proposed and investigated, showing that it can improve the performance by about 20% in terms of σΔVT/ΔVT.
A manpower analysis of private practice dentistry thru simulation
Authors: Thomas M. Kisko, Kerry E. Kilpatrick, Richard S. Mackenzie
Venue: ACM SIGSIM Simulation Digest (1974)

A simulation model of solo private practice dentistry has been developed to evaluate the effects of introducing expanded function auxiliary personnel. The model permits the experimental investigation of a variety of staffing patterns and facility configurations. Four task assignment schemes are examined over 208 experiments. Results indicate increases in net revenue of 118% can be realized by the addition of expanded function auxiliary personnel.
Detecting of Requirements Inconsistency: An Ontology-Based Approach
Authors: Xuefeng Zhu, Zhi Jin
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Detecting of requirements inconsistency is key to the development of heterogeneous software system. But at present, although there are a lot of work on the detecting of requirements inconsistency, most of them are limited in detecting of requirements inconsistency at syntax level, we still lack of a promising method for the detection of requirements inconsistency at semantic level. Based on an abstract requirements refinement process model, this paper takes domain ontology as infrastructure for the refinement of software requirements, software requirements can then be seen as interactions between software agents and the ambiences they exist. We assume that the real effect of these interactions is to make the state of ambience changed, so we explicitly represent requirements of software agents as a set of state transition diagrams, each is for one entity in the ambience. And we realized semantic level inconsistency detecting of software requirements based on state transition of ambience.
Verification of C Programs using Slicing Execution
Authors: Xiaodong Yi, Ji Wang, Xuejun Yang
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

The paper presents a novel method, namely slicing execution, to verify C programs with respect to temporal safety properties. The distinguished feature is that it only simulates the execution of the relevant statements under abstraction criteria and checks the properties on the fly. The abstraction criterion begins with a proper initial set of program variables and may be iteratively refined according to spurious counter-examples. Provided that the properties to be verified usually involve only a few variables in practical programs, slicing execution may have the same precision as path-sensitive simulation with the cost close to standard flow-sensitive dataflow analysis. The presented method has been used to verify the initial handshake process of SSL protocol based on the C source code of openssl-0.9.6c. The experiment results confirm our claim and show that slicing execution is not only practical but also effective.
Scalable network emulation
Authors: Cameron Kiddle
Venue:  (2005)

Network emulation provides a testing environment where real network protocols and applications running on real network hosts can interact under controlled and repeatable network conditions. One approach to emulation involves simulating a network model, called the virtual network, with a real-time network simulator and providing an I/O interface that enables interaction between real hosts and the virtual network. To reflect the behavior of large networks such as the Internet it is important that the emulation environment be scalable. The virtual network must be able to scale in size and in traffic volume and the I/O interface must be able to scale in the number of real hosts and in real traffic volume. This thesis focuses on addressing scalability of the virtual network through the use of various simulation techniques. Parallel simulation techniques are employed in both shared memory and distributed memory environments. A simulation abstraction technique is also introduced that allows for the interaction of packet-based traffic flows and fluid-based traffic flows. With only parallel simulation techniques employed, real-time emulation performance of nearly 50 million packet transmissions per second is achieved on 128 processors for a network model consisting of about 20,000 nodes. With all simulation techniques employed, real-time emulation performance of nearly 500 million packet transmissions per second is achieved on 128 processors for a network model consisting of about 200,000 nodes.
Teaching SRE to Software Practitioners
Authors: John D. Musa
Venue: Proceedings of the 16th IEEE International Symposium on Software Reliability Engineering (2005)

Teachers can learn many lessons by examining experiences in teaching SRE to software practitioners and analyzing their feedback. I have taught several thousand participants over 15 years in a wide variety of organizations and applications. Participants included software developers, testers, reliability and quality control staff, and managers. Most of what I've learned applies to any course and is not SRE-specific. It also applies to the practitioners of the future, university students.