ppxscal/embedding_network huggingface dataset:
Differentiated BGP Update Processing for Improved Routing Convergence
Authors: Wei Sun, Zhuoqing Mao, Kang Shin
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

Internet routers today can be overwhelmed by a large number of BGP updates triggered by events such as session resets, linkfailures, and policy changes. Such excessive updates can delay routing convergence, which, in turn, degrades the performanceof delay-and jitter-sensitive applications. This paper proposes a simple and novel idea of differentiated processing of BGPupdates to reduce routers' load and improve routing convergence without changing the protocol semantics. Based on a set ofcriteria, BGP updates are grouped into different priority classes. Higher-priority updates are processed and propagated sooner,while lower-priority ones, not affecting routing decisions, can be delayed to both reduce routers' load and improve routingconvergence. We first present a general methodology for update classification, update processing, and priority-state inference.By analyzing real BGP data obtained from Route Views, we show that our update classification is feasible and beneficial. Wefurther propose two differentiated update processing (DUP) algorithms and evaluate them using the SSFNet BGP simulator onseveral realistic network topologies. The algorithms are shown to be very effective for large networks, yielding 30% fewerupdates and reducing convergence time by 80%. Our scheme is simple and light-weight with little added processing overhead.It can be deployed incrementally, since BGP messages are not modified and every BGP router makes routing decisions independently.
An approach to formal verification of human&#x2013;computer interaction
Authors: Paul Curzon, Rimvydas Ruk&#x0161;&#x0117;nas, Ann Blandford
Venue: Formal Aspects of Computing (2007)

The correct functioning of interactive computer systems depends on both the faultless operation of the device and correct human actions. In this paper, we focus on system malfunctions due to human actions. We present abstract principles that generate cognitively plausible human behaviour. These principles are then formalised in a higher-order logic as a generic, and so retargetable, cognitive architecture, based on results from cognitive psychology. We instantiate the generic cognitive architecture to obtain specific user models. These are then used in a series of case studies on the formal verification of simple interactive systems. By doing this, we demonstrate that our verification methodology can detect a variety of realistic, potentially erroneous actions, which emerge from the combination of a poorly designed device and cognitively plausible human behaviour.
Videotex Networks
Authors: A. J. S. Ball
Venue: Computer (1980)

Using the home TV screen, videotex networks can provide easy, inexpensive access to vast amounts of information. Here we consider planned and possible network structures.
Lazy Systematic Unit Testing: JWalk versus JUnit
Authors: Anthony J. H. Simons, Christopher D. Thomson
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Lazy systematic unit testing with JWalk is compared against regression testing with JUnit, the leading agile testing tool. JWalk produced exhaustive test sets more quickly and recalculated full state and transition coverage, when testing modified or extended classes. For the same time and effort invested, JWalk tested up to two orders of magnitude more paths than manual tests created for JUnit by an expert tester.
Compacting garbage collection with ambiguous roots
Authors: Joel F. Bartlett
Venue: ACM SIGPLAN Lisp Pointers (1988)

Many modern garbage collectors [4] recover space by copying. Using an initial "root" set of pointers which are stored in known locations, all accessible objects are copied into a "new space". Two of the attractive properties of such a collector are that it results in memory compaction and it can have a running time proportional to the amount of accessible storage [2]. However, such schemes place a large burden on the underlying system as all pointers to the objects must be found and changed.
Feature Guided Texture Synthesis (FGTS) for artistic style transfer
Authors: Xuexiang Xie, Feng Tian, Hock Soon Seah
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

Artistic images and paintings can be regarded as a composition of content and style. The aim of artistic style transfer is to synthesize a stylized image with content of source image but novel style from style example. Based on texture synthesis, a novel Feature Guided Texture Synthesis (FGTS) algorithm for artistic style transfer is proposed in this paper. Compared with existing example-based methods, the content of a source image is better defined in FGTS with a feature field generated from the source image. Though the style is modelled with low-level statistical features, the style transfer process is guided with the feature field which incorporates style and content during synthesis process. Moreover, a modified L neighborhood distance metric is developed to provide better measures of perceptual similarity. Results and comparisons are given to demonstrate that FGTS is an effective method for artistic style transfer.
Algorithms for a Set Partitioning Problem Arising in the Design of Multipurpose Units
Authors: M. R. Garey
Venue: IEEE Transactions on Computers (1977)

We consider an abstract partitioning problem which has applications to the design of standard libraries of multipurpose units (such as multi-purpose circuit cards) and to storage allocation in the presence of users with conflicting demands. Although the general problem of finding minimum cost partitions appears to be very difficult, we describe a dynamic programming approach which can be quite efficient if the parameters for the items to be partitioned take on only a limited number of distinct values.
Syntactic Recognition of Imperfectly Specified Patterns
Authors: M. G. Thomason
Venue: IEEE Transactions on Computers (1975)

The methods developed in this correspondence represent an approach to the problem of handling error-corrupted syntactic pattern strings, an area generally neglected in the numerous techniques for linguistic pattern description and recognition which have been reported. The basic approach consists of applying error transformations to the productions of context-free grammars in order to generate new grammars (also context-free) capable of describing not only the original error-free patterns, but also patterns containing specific types of errors such as deleted, added, and interchanged symbols which arise often in the pattern-scanning process. Theoretical developments are illustrated in the framework of a syntactic recognition system for chromosome structures.
An SLA-Enabled Grid DataWarehouse
Authors: Rogerio Luis de Carvalho Costa, Pedro Furtado
Venue: Proceedings of the 11th International Database Engineering and Applications Symposium (2007)

Database servers typically offer a best-effort model of service to submitted commands, that is, they try to process every command as fast as possible. Hence, they are not prepared to provide differentiation for quality of service. In this paper we consider the distributed Grid-DWPA architecture context, which fragments and replicates data into several sites to provide an efficient grid data warehouse solution. Instead of offering best-effort service to every query, we propose the use of a performance predict model that is used in conjunction with QoS oriented scheduling to enable the establishment of Service Level Agreements (SLA).
Bringing Worst Case Execution Time Awareness to an Open Smart Card OS
Authors: Nadia Bel Hadj Aissa, Gilles Grimaud, Vincent Benony
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Smart card platforms are migrating from restrictive proprietary environments to open multi-application infrastructures. Computing the worst case execution time of an embedded application while there is no way to make previous assumptions on the CPU configuration available on the smart card had to be faced differently. In this paper, an evaluation of a distributed WCET computation method is presented. A low-level analysis on an ARM7TDMI CPU core is also described. We explain how the global WCET of a dynamically loaded application is extracted. Experimental results show a small overestimation compared to the observed execution time for a PIN-based authentication applet. Hardware-dependent WCET computation can also take advantage of the typing information related to the intermediate language. Improvement in the performance evaluation is up to 81,22%.
Software Development for Distributed Systems
Authors: D. J. Faber
Venue: Computer (1975)

My prime interest in participating in this session is to project the applicability of SP to the development of software for Distributed Computer Systems (such as the UC Irvine Distributed Computer System and the CMU C.MMP). The difficulties common to all software design and development efforts are made even more acute when writing software for a DCS. Setting up experiments that involve widely separated, loosely coupled computers is not an easy or straightforward task. Error situations may develop fortuitously and then evade most efforts to cause them to occur again. In this predicament, structured modular top-down programming techniques appear likely to play an important role since they offer an opportunity to bring significant software reliability improvements. 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
The SAFE Management System Model Based on Context Automatic Awareness
Authors: Kook-Hee Han, Yiwen Liu, Young-Jik Kwon, Byeong-do Kang, Roger Yim Lee
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Ubiquitous is a Latin-derived word meaning "to exist at any time and place likes water or air. In computing, the word "ubiquitous" indicates an environment in which users have access to networks without any limitation regarding computers, networks or places. Important issues in building Ubiquitous Korea (U-Korea) are the social problems appearing with a rapid increase in the old age population. Nowadays, with the rise of the nuclear family, the increase in the number of elderly people living alone, and the change in the status of women, both wives and husbands are employed outside the home, and the relatives who would be responsible for supporting the elderly sometimes are on long or short business trips, and it happens that old people can't be looked after. Therefore the government developed a wireless paging system for the sick , disabled, old and weak so that when an emergency happens, by just simply dialing 119, an emergency aid center could take prompt action. However, the present wireless paging systems composing the under-layer of the emergency aid information system have some problems, such as, a lack of reliability, problems among terminals, mobile transmitters and receiving terminals, the users' refusal to admit the need for the system and poor operational skills, administrators' perfunctory management and checks, etc. On account of these problems, the system efficiency has degraded and therefore a system upgrade is necessary. In this paper, we attempt to evaluate the newly implemented SAFE119 system, a new wireless paging system seeking to correct the problems of the current system.
Classification Algorithm Based on Human Social Behavior
Authors: Arit Thammano, Jittraporn Moolwong
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

This paper proposes the new approach to deal with the classification problems by employing the sociological concept of "in-group" and "out-group." The main idea of the concept is about the behavior of in-group members that try to unite with their own group as much as possible, and at the same time maintain social distance from the out-group members. The performance of the proposed model was compared with the fuzzy ARTMAP neural network. The results on five benchmark problems are very encouraging.
CAT: A Cost-Aware BitTorrent
Authors: Shusuke Yamazaki, Hideki Tode, Koso Murakami
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

With an enhanced client computer performance and network bandwidth, peer-to-peer (P2P) content distribution networks are receiving much attention. However, along with the popularization of P2P content distribution networks, inter- Internet Service Provider (ISP) traffic and ISP costs are increasing, and pose an impediment for making a potential P2P content distribution network social infrastructure. This paper presents a method to constitute P2P content distribution networks and a reduction in ISP costs by considering the form of the ISP interconnection in its distribution. Results from our simulations show that our proposal achieves a reduction in ISP costs and distribution time, regardless of the number of peers joining a P2P network and the capacity of its content.
Multi-scale Morphologic Tracking Approach for Edge Detection
Authors: Zhenhua Li, Yingping Yang, Wei Jiang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Aimed at eliminating the noise in the images, an edge detection algorithm based on multi-scale morphologic edge tracking approach is introduced in this paper. While edge detecting it can restrain the noise efficiently, if proper threshold parameters are selected. First, the morphology gradient is calculated under each scale. Second, after tracing the edge images acquired by sequential scale structuring elements, noises have been removed and useful edge informations have been reserved. Third, different weights are imposed to construct the outcome edge image. By comparing with other edge detection algorithms, the feasibility and superiority of this algorithm have been verified according to the experiment result.
Generating Fuzzy Rules from Examples Using the Particle Swarm Optimization Algorithm
Authors: A. A. A. Esmin
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

The use of Fuzzy Logic to solve control problems have been increasing considerably in the past years. The problem of generating desirable fuzzy rules is very important in the development of fuzzy systems. It is known that the fuzzy control rules for a control system is always built by designers with trial and error and based on their experience or some experiments. This paper presents a generation method of fuzzy rule by learning from examples using the Particle Swarm Optimization method (PSO). The proposed algorithm can obtain a set of fuzzy rules which cover the examples set in iterative process. The proposed method is tested with promising results.
Double-Particle Swarm Optimization with Induction-Enhanced Evolutionary Strategy to Solve Constrained Optimization Problems
Authors: Xiao-Li Kou, San-Yang Liu, Wei Zheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper presents double-particle swarm optimization (PSO) with induction-enhanced evolutionary strategy (DIEPSO) to solve global nonlinear optimization problems. A new PSO algorithm with induction-enhanced evolutionary strategy (IEPSO) is constructed. In the algorithm, a deterministic selection strategy is proposed to ensure the diversity of population. Meanwhile, the induction of evolving direction is enhanced by adding gene-adjusting and adaptive focus-varied tuning operator. The constraint handling approach uses double-particle swarm searching mechanism. It guides the searching process towards the feasible region. Also, a simple diversity mechanism is added, which properly allows some particles of infeasible region to be preserved in the feasible region. It makes the particles close to the boundary of the feasible region. The approach has been tested on four problems commonly used in the literature, and compared with other approaches. Results indicate that the approach is competitive and easy to be implemented.
A Multivariate Analysis of Static Code Attributes for Defect Prediction
Authors: Burak Turhan, Ayse Bener
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Defect prediction is important in order to reduce test times by allocating valuable test resources effectively. In this work, we propose a model using multivariate approaches in conjunction with Bayesian methods for defect predictions. The motivation behind using a multivariate approach is to overcome the independence assumption of univariate approaches about software attributes. Using Bayesian methods gives practitioners an idea about the defectiveness of software modules in a probabilistic framework rather than the hard classification methods such as decision trees. Furthermore the software attributes used in this work are chosen among the static code attributes that can easily be extracted from source code, which prevents human errors or subjectivity. These attributes are preprocessed with feature selection techniques to select the most relevant attributes for prediction. Finally we compared our proposed model with the best results reported so far on public datasets and we conclude that using multivariate approaches can perform better. Keywords: Defect prediction, Software Metrics, Naïve Bayes. Topics: Software Quality, Methods and Tools.
Interview with Uffe K. Wiil
Authors: Claus Atzenbeck
Venue: ACM SIGWEB Newsletter (2007)

Uffe Kock Wiil is a professor at the Maersk Mc-Kinney Moller Institute, University of Southern Denmark. He holds a M.Sc. in Computer Engineering (1990) and a Ph.D. in Computer Science (1993) from Aalborg University, Denmark. He has previously held positions at Aalborg University and University of Aarhus (both in Denmark). He also spent time visiting Texas A&M University (1991--92) and University of California, Irvine (1996). He has held various academic management positions from 1998--2006 including Department Head and Dean. He has served the hypertext community in many ways including Chair of the Open Hypermedia Systems Working Group (OHSWG) (1997--2001), Program Chair (ACM Hypertext 1999), General Chair (ACM Hypertext 2006), and ACM SIGWEB Treasurer (1997--1999, 2003--2005).
Designing CMOS Circuits for Switch-Level Testability
Authors: Dick Liu, Edward McCluskey
Venue: IEEE Design Test (1987)

Conventional testing techniques often fail to be effective for CMOS combinational circuits, since most of their switch-levelfaults cannot be detected by stuck-at-fault testing. The alternative is to design for testability. The design techniques presentedhere for fully testable CMOS combinational circuits use a three-pattern test scheme to detect both stuck-open and stuck-onswitch-level faults. The circuit is implemented with specially designed gates that have no undetectable stuck-on faults. Aninverting buffer is inserted between logic gates, and two FETs are added to each logic gate to make it testable for stuck-onfaults.
Self-Diagnosis in Distributed Systems
Authors: C. S. Holt
Venue: IEEE Transactions on Computers (1985)

This paper deals with computer system diagnosis that is performed by a system itself, rather than by an outside mechanism. The devices performing the diagnosis and the devices communicating diagnostic information are included in the system model and may be potentially faulty. This paper differs from previous work in several ways. A more general diagnostic model is used that permits analysis of a larger class of systems, and the diagnostic goals are more closely matched to realistic self-diagnosis problems. In addition, there are differences in assumptions regarding test invalidation and effects of faults on communication that produce greater self-diagnosibility while accurately modeling faulty system behavior.
Scheduling Techniques for Operating Systems
Authors: R. B. Bunt
Venue: Computer (1976)

One of the primary functions of an operating system is to distribute the resources under its control among the users of the system in such a way as to achieve installation standards of performance (including service).
A New Approach for Overload Management in Content-based Publish/Subscribe
Authors: Xiangfeng Guo, Hua Zhong, Jun Wei, Dongli Han
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

Overload management is of vital importance in wide-area publish/subscribe systems, yet current solutions are best-effort. In this paper, we present an admission control scheme for overload management in large-scale and scalable content-based publish/subscribe systems. We analyze the stumbling block for implementing admission control in publish/subscribe systems, and point out how it differs from admission control schemes in other research areas. We propose a cover relation based algorithm to compute subscription resource requirements and an admission control algorithm based on subscription routing. The scheme ensures time, space and flows decoupling without sacrificing scalability of publish/subscribe systems. Finally, we conduct experiments to verify the effectiveness of the scheme.
Technical Section: Employing personality-rich virtual persons-New tools required
Authors: Ido A. Iurgel, Adérito F. Marcos
Venue: Computers and Graphics (2007)

Digital personalities are virtual characters that possess situation dependent, personality revealing behaviors. This paper introduces concepts, current and prospective usages of personality-rich virtual characters, and focus on authoring issues for artists that want to create digital portrays of digital persons. Different categories of digital personalities are introduced, in particular virtual actors for CG-movies are explained in more detail because of the importance of understanding the functioning of virtual actors-other types of virtual personalities will often be build upon the faculties of virtual actors. It is proposed that an essential feature of the prospective authoring process of digital personalities is the support of generalization. This would allow for a ''concrete authoring'', that modifies and defines concrete cases. Thus, the author would be able to employ concrete cases as basis for generalizations. In this context, possible technologies that would support a concrete authoring process are presented, in particular Case-Based Reasoning.
QoS Scheduling Algorithm Based on Hybrid Particle Swarm Optimization Strategy for Grid Workflow
Authors: Chunhua Hu, Min Wu, Guoping Liu, Wen Xie
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

The service oriented grid workflow has been a research focus in grid technology. As an NP complete problem, grid service scheduling is difficult to solve by means of classic algorithms This paper presents an algorithm HPSOA (hybrid particle swarm optimization Algorithm) to resolve dynamic Web services selection with QoS global optimal in grid workflow.The essence of the algorithm is that the problem of dynamic Web Service selection with QoS global optimal is transformed into a multi-objective services composition optimization with QoS constraints.The operations of the cross and mutation in genetic algorithm are brought into PSOA (particle swarm optimization Algorithm) to form a mix algorithm, which called HPSOA solve the QoS global optimal problem. Theoretical analysis and experimental results indicate the feasibility and efficiency of the algorithm.