ppxscal/embedding_network huggingface dataset:
A unified Approach for Software Architecture Evolution at different abstraction levels
Authors: Nassima Sadou, Dalila Tamzalit, Mourad Oussalah
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

This paper presents a model for software architecture evolution, called SAEV (Software Architecture EVolution Model). A software architecture is defined through its architectural elements (components, connectors, configurations...).We associate to these architectural elements three abstraction levels namely from the most abstract one: the meta level, the architectural level and the application one. SAEV offers a whole of concepts, which are evolution operations, evolution rules, evolution strategies and invariants, to describe and manage uniformly the evolution of architectures at the architectural level as well as at the application level. This is done independently of any description or implementation language. In addition, SAEV offers a uniform mechanism to carry out a given evolution at these different levels.
A Framework for Real-Time Worm Attack Detection and Backbone Monitoring
Authors: Thomas Dubendorfer, Arno Wagner, Bernhard Plattner
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

We developed an open source Internet backbone monitoring and traffic analysis framework named UPFrame. It captures UDP NetFlow packets, buffers it in shared memory and feeds it to customised plug-ins. UPFrame is highly tolerant to misbehaving plug-ins and provides a watchdog mechanism for restarting crashed plug-ins. This makes UPFrame an ideal platform for experiments. It also features a traffic shaper for smoothing incoming traffic bursts. Using this framework, we have investigated IDS-like anomaly detection possibilities for high-speed Internet backbone networks. We have implemented several plug-ins for host behaviour classification, traffic activity pattern recognition, and traffic monitoring. We successfully detected the recent Blaster, Nachi and Witty worm outbreaks in a medium-sized Swiss Internet backbone (AS559) using border router Net- Flow data captured in the DDoSVax project. The framework is efficient and robust and can complement traditional intrusion detection systems.
A real-time joint trajectory planner for dynamic walking bipeds in the sagittal plane
Authors: J. Vermeulen, B. Verrelst, D. Lefeber, P. Kool, B. Vanderborght
Venue: Robotica (2005)

A real-time joint trajectory generator for planar walking bipeds is proposed. This trajectory planner generates dynamically stable motion patterns by using a set of objective locomotion parameters as its input, and by tuning and exploiting the natural upper body dynamics. The latter can be determined and manipulated by using the angular momentum equation. Basically, trajectories for hip and swing foot motion are generated, which guarantee that the objective locomotion parameters attain certain prescribed values. Additionally, the hip trajectories are slightly modified such that the upper body motion is steered naturally, meaning that it requires practically no actuation. This has the advantage that the upper body actuation hardly influences the position of the Zero Moment Point. The effectiveness of the developed strategy is demonstrated by simulation results.
Ip-based virtual private networks and proportional quality of service differentiation
Authors: Nirwan Ansari
Venue:  (2004)

IP-based virtual private networks (VPNs) have the potential of delivering cost-effective, secure, and private network-like services. Having surveyed current enabling techniques, an overall picture of IP VPN implementations is presented. In order to provision the equivalent quality of service (QoS) of legacy connection-oriented layer 2 VPNs (e.g., Frame Relay and ATM), IP VPNs have to overcome the intrinsically best effort characteristics of the Internet. Subsequently, a hierarchical QoS guarantee framework for IP VPNs is proposed, stitching together development progresses from recent research and engineering work. To differentiate IP VPN QoS, the proportional QoS differentiation model, whose QoS specification granularity compromises that of IntServ and Diffserv, emerges as a potential solution. The investigation of its claimed capability of providing the predictable and controllable QoS differentiation is then conducted. With respect to the loss rate differentiation, the &ldquo;packet shortage&rdquo; phenomenon shown in two classical proportional loss rate (PLR) dropping schemes is studied. On the pursuit of a feasible solution, the potential of compromising the system resource, that is, the buffer, is ruled out; instead, an enhanced &ldquo;debt-aware&rdquo; mechanism is suggested to relieve the negative effects of &ldquo;packet shortage.&rdquo; Simulation results show that &ldquo;debt-aware&rdquo; partially curbs the biased loss rate ratios, and improves the queueing delay performance as well. With respect to the delay differentiation, the dynamic behavior of the average delay difference between successive classes is first analyzed, aiming to gain insights of system dynamics. Then, two classical delay differentiation mechanisms, that is, proportional average delay (PAD) and waiting time priority (WTP), are simulated and discussed. Based on observations on their differentiation performances over both short and long time periods, a combined delay differentiation (CDD) scheme is introduced. Simulations are utilized to validate this method. Both loss and delay differentiations are based on a series of differentiation parameters. Though previous work on the selection of delay differentiation parameters has been presented, that of loss differentiation parameters mostly relied on network operators' experience. A quantitative guideline, based on the principles of queueing and optimization, is then proposed to compute loss differentiation parameters. Aside from analysis, the new approach is substantiated by numerical results.
Exploring Web Services from a Business Value Perspective
Authors: Bas van der Raadt, Jaap Gordijn, Eric Yu
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Emerging web services technologies provide an open infrastructure for automated business interaction, thereby creating new opportunities for business actors to collaborate within a networked constellation of enterprises via the Internet. The basis for a viable network of web services (the supporting information system of such a networked constellation of enterprises) is a value model that shows sound value propositions to all actors involved. Requirements engineering techniques can be developed to support: (1) exploring alternative business models, and (2) evaluating alternatives on their economic viability, leading into the design and implementation of technical systems. In this paper we present a Business-oriented Approach Supporting web Services Idea Exploration (BASSIE), which exploits the synergy between the agent- and goal-oriented i* framework and the value-based e3value framework. The approach iterates between exploration of structural alternatives and qualitative evaluation using i, and quantitative modeling and evaluation of business value using e3value. The approach is illustrated with a real-life case study in digital music distribution.
A problem in production management
Authors: Thomas J. Schriber
Venue: ACM SIGSIM Simulation Digest (1974)

In a certain factory, a tentative operating objective is to keep 50 machines of a particular kind in production 8 hours a day, 5 days a week. Management owns 50 machines of the kind in question, and employs 50 machine operators to run the machines. An operator can only run one machine at a time. And, because of production restrictions, it is infeasible to have any of these machine operators work overtime. Under ideal conditions, the tentative operating objective could be met with the 50 machines and 50 operators. Unfortunately, each of the machines is subject to random failure. A machine's production lifetime is 160&plusmn;25 hours (uniformly distributed). Whenever a machine fails, it is sent to an in-house repair shop, which is manned by two repairmen.
Using AICC to Create Reusable Adaptive Hypermedia E-learning Content
Authors: Miroslav Bures, Ivan Jelinek
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

Adaptive hypermedia systems represent one of promising future Internet concepts, especially in the area of E-learning. One of important contemporary claims is to create reusable adaptive hypermedia content, compatible with existing systems, to ease a widespread of this promising technology. In this paper we propose method of adaptive hypermedia E-learning courses construction using AICC communication standard. This proposal is based on formal description of adaptive hypermedia course topology and its mapping to AICC communication structure.
Discriminant local features selection using efficient density estimation in a large database
Authors: Alexis Joly, Olivier Buisson
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

In this paper, we propose a density-based method to select discriminant local features in images or videos. We first introduce a new fast density estimation technique using a simple grid index structure and specific queries based on the energy of the gaussian function. This method enables the nonparametric density estimation of target features with very large sets of source features. We then apply it to the selection of discriminant local features: the principle is to keep only the features having the lowest density in a feature database constructed from a large collection of representative objects (images or videos). Experiments are reported to evaluate the density estimation technique in terms of both quality and speed. The density-based selection of discriminant local features is evaluated in a complete video content-based copy detection framework using Harris interest points.
Live CDs and security lab configuration
Authors: Ed Crowley
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

Developing and configuring an information security lab can require a substantial budget, support, and resource commitment. In addition to an appropriate software budget, activities such as installing security software, setting up user accounts, and configuring lab systems can require a significant labor commitment. In a traditional environment, it may also require the semester long dedication of a computer lab to a single security class section. In many educational environments, obtaining these commitments is problematic.To mitigate these problems, we developed a supplementary security lab framework that utilizes Open Source Software and the Knoppix Live CD. By definition, a Live CD is a bootable CD that contains a complete operating system. Some Live CDs, such as Knoppix, also include system utility and application programs. In addition to being self configuring, the Knoppix Live CD may also be remastered to accommodate additional security tools. In this paper, we will present an overview of our supplemental lab framework and its components the Knoppix Live CD and Open Source tools. We will also discuss a sample Live CD based security project that utilizes our supplementary security lab framework.
Where do Goals Come from: the Underlying Principles of Goal-Oriented Requirements Engineering
Authors: Gil Regev, Alain Wegmann
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Goal is a widely used concept in requirements engineering methods. Several kinds of goals, such as achievement, maintenance and soft goals, have been defined in these methods. These methods also define heuristics for the identification of organizational goals that drive the requirements process. In this paper we propose a set of principles that explain the nature of goal-oriented behavior. These principles are based on regulation mechanisms as defined in General Systems Thinking and Cybernetics. We use these principles to analyze the existing definitions of these different kinds of goals and to propose more precise definitions. We establish the commonalities and differences between these kinds of goals, and propose extension for goal identification heuristics.
Statistical tests of random number generators
Authors: Robert Bohrer, Daniel Putnam
Venue: ACM SIGSIM Simulation Digest (1976)

This paper notes several results from statistical distribution theory which are useful in checking random number generators. It illustrates these methods by application to the normal random number generator GGNRF from the IMSL program package. Independence is checked with both time and frequency domain tests. The normal distributional properties are checked with goodness of fit tests and tests of the mean and variance.
An Experimental Study of Soft Errors in Microprocessors
Authors: Giacinto P. Saggese, Nicholas J. Wang, Zbigniew T. Kalbarczyk, Sanjay J. Patel, Ravishankar K. Iyer
Venue: IEEE Micro (2005)

The issue of soft errors is an important emerging concern in the design and implementation of future microprocessors.To date, in all but the most mission-critical applications, implementing parity and Error Correction Codes for caches and other large, regular SRAM structures has been sufficient to stem the growing soft error tide.However, this may not be the case for long, and questions remain as to efficient methods to detect and recover from soft errors - in particular errors in the less structured execution sections. In this work, we examine the impact of soft errors on two different microarchitectures: a simple 5-stage DLX processor and high-performance implementation of an Alpha processor.The results contrast impact of soft errors on combinational and sequential logic, identify the most vulnerable units, and assess the impact of soft errors on the application.
Packetization interval of haptic media in networked virtual environments
Authors: Masaki Fujimoto, Yutaka Ishibashi
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

This paper deals with the packetization interval of haptic media in networked virtual environments. We here handle work in which a user moves an object by manipulating a haptic interface device. In previous studies, we packetize haptic media on capturing them. In this paper, we propose a scheme which lengthens the packetization interval and evaluate the efficiency of the work by experiment. Experimental results show that the packetization interval of several milliseconds produces higher efficiency of the work. We also examine the influences of the packetization interval and network latency on the efficiency of the work in the proposed scheme.
Enhancing QoS Support for Vertical Handoffs Using Implicit/Explicit Handoff Notifications
Authors: Ling-Jyh Chen, Guang Yang, Tony Sun, M. Y. Sanadidi, Mario Gerla
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Vertical handoffs between different wireless technologies usually lead to dramatic changes in the link capacity. A successful QoS solution for vertical handoffs must be able to fast track the capacity changes and agilely adapt the delivery rates and qualities of the ongoing applications. Though traditional AIMD-based source adaptation schemes (as found in TCP, TFRC, etc.) have been well designed for mild, gradual rate adjustments required by load fluctuations and network congestion, their response time is inadequate when the rate must be adjusted to the drastic network capacity changes that are typical in vertical handoff scenarios. To expedite the response to such changes, we propose in this paper two adaptive algorithms, named the Fast Rate Adaptation (FRA) and Early Rate Reduction (ERR), that are launched when the handoff is from low to high capacity (LOW-to-HIGH) or from high to low capacity (HIGH-to-LOW), respectively. We also propose two vertical handoff notification mechanisms to work with FRA and/or ERR, i.e. the Implicit Handoff Notification (IHN) and Explicit Handoff Notification (EHN). We show by simulation that our proposed schemes are able to provide better QoS support than the traditional AIMD based schemes during vertical handoffs.
A Very Large-Scale Neighborhood Search Approach to Capacitated Warehouse Routing Problem
Authors: Yue Geng, Yanzhi Li, Andrew Lim
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Warehouse management is an important issue in supply chain management. Among all warehouse operations, "order-picking" is the most expensive one and its cost is mainly due to the travelling expenses. In this paper, we study the capacitated warehouse routing problem (CWRP) so as to save the travelling cost, i.e., travelling distance in order-picking. The problem is shown to be strongly NP-hard. However, by noting that the unconstrained routing problem can be tackled by a dynamic programming method, a search heuristic, which is based on the very large-scale neighborhood (VLSN) technique, was designed to solve the capacity-constrained version. We compared the computational results with solutions obtained from branch-and-price method, which are within 1% error bound and identified that our heuristic is efficient in getting high quality solutions of CWRP.
Integrated levels of detail
Authors: Georgios Stylianou, Yiorgos Chrysanthou
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

We introduce a new mesh representation for arbitrary surfaces that integrates different levels of detail into the final representation. It is produced after remeshing an existing model and omits storing connectivity information. Switching between resolutions can be instantly accomplished without extra computation. This representation is generated by chartifying initial the mesh, parametrizing and re-meshing each chart using a regular grid of control points in a multilevel approach. Finally, the model becomes watertight by hierarchically stitching each chart's boundary points and normals.
The Use of Targeted Bulk SMS Texting to Enhance Student Support, Inclusion and Retention
Authors: Brendan Riordan, John Traxler
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

The University of Wolverhampton serves a region of considerable social, economic and educational diversity and disadvantage in the UK. The University is aware of the potential of mobile learning, teaching and administration in addressing the needs of its students and it has national Centre of Excellence (CETL) status for using innovative technologies in its work. After several pilot projects with handheld computers and mobile phones (cell phones), it is now moving to a large-scale scheme that will use targeted bulk SMS texting to enhance student support, inclusion and retention. This paper examines the range of technologies and pedagogies that underlie the educational use of texting, the institutional issues that the proposed large-scale texting scheme must address and the interim results and progress of the scheme prior to its launch at the start of the academic year 2005/2006.
Hybrid OCR combination approach complemented by a specialized ICR applied on ancient documents
Authors: Hubert Cecotti, Abdel Belayd
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In spite of the improvement of CommercialOptical Character Recognition (OCR) during the last years, their ability to process different kinds of documents can also be a default. They cannot produce a perfect recognition for all documents. However they allow producing high result for standard cases. We propose in this paper a model combining several OCRs and a specialized ICR (Intelligent Character Recognition) based on a convolutional neural network to complement them. Instead of just performing several OCRs in parallel and applying a fusing rule of the results, a specialized neural network with an adaptive topology is added to complement the OCRs in function of the OCRs errors. This system has been tested on ancient documents containing old characters and old fonts not used in contemporary documents. The OCRs combination increases the recognition of about 3% whereas the ICR improves the recognition of rejected characters of more than 5%.
The Solution for Link Enhancement Problem Based on Ant Algorithm
Authors: Yuhua Liu, Kaihua Xu, Haiyan Zhu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In this paper, we discuss the essential of Traveling Salesman Problem (TSP) and Link Enhancement Problem. We present a solution for Link Enhancement Problem based on ant algorithm. To deal with the restriction condition, we propose two different kinds of strategies. By the simulation experiment, the algorithm is proved to be feasible. With the result of simulation experiment, we analyze the enactment of the parameters, and compare the performance of the two strategies.
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology
Authors: Yun Zhang, Faisal N. Abu-Khzam, Nicole E. Baldwin, Elissa J. Chesler, Michael A. Langston, Nagiza F. Samatova
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Graph-theoretical approaches to biological network analysis have proven to be effective for small networks but are computationally infeasible for comprehensive genome-scale systems-level elucidation of these networks. The difficulty lies in the NP-hard nature of many global systems biology problems that, in practice, translates to exponential (or worse) run times for finding exact optimal solutions. Moreover, these problems, especially those of an enumerative flavor, are often memory-intensive and must share very large sets of data effectively across many processors. For example, the enumeration of maximal cliques - a core component in gene expression networks analysis, cis regulatory motif finding, and the study of quantitative trait loci for high-throughput molecular phenotypes can result in as many as 3^n/3 maximal cliques for a graph with n vertices. Memory requirements to store those cliques reach terabyte scales even on modest-sized genomes. Emerging hardware architectures with ultra-large globally addressable memory such as the SGI Altix and Cray X1 seem to be well suited for addressing these types of data-intensive problems in systems biology. This paper presents a novel framework that provides exact, parallel and scalable solutions to various graph-theoretical approaches to genome-scale elucidation of biological networks. This framework takes advantage of these large-memory architectures by creating globally addressable bitmap memory indices with potentially high compression rates, fast bitwise-logical operations, and reduced search space. Augmented with recent theoretical advancements based on fixed-parameter tractability, this framework produces computationally feasible performance for genome-scale combinatorial problems of systems biology.
Penalty OBS Scheme for Feedforward Neural Network
Authors: Jiang Meng
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

This paper presented a new scheme called penalty OBS (Optimal Brain Surgeon) for the feedforward neural network learning. The penalty OBS scheme takes OBS pruning case as a penalty item of the network cost function, and develops two applied methods based on the common algorithms of network learning. As a novel revision of OBS, the new scheme not only saves the runtime to calculate Hessian matrix after training, but also improves the generalization a lot and keeps over-linear rapidity of convergence. The simulating results verified the advantages.