ppxscal/embedding_network huggingface dataset:
A Host-Based Approach to Network Attack Chaining Analysis
Authors: Paul Ammann, Joseph Pamula, Julie Street, Ronald Ritchey
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a chain is called an attack path, and the set of all possible attack paths form an attack graph. Researchers have proposed a variety of methods to generate attack graphs. In this paper, we provide a novel alternative approach to network vulnerability analysis by utilizing a penetration tester's perspective of maximal level of penetration possible on a host. Our approach has the following benefits: it provides a more intuitive model in which an analyst can work, and its algorithmic complexity is polynomial in the size of the network, and so has the potential of scaling well to practical networks. The drawback is that we track only "good" attack paths, as opposed to all possible attack paths. Hence, an analyst may make suboptimal choices when repairing the network. Since attack graphs grow exponentially with the size of the network, we argue that suboptimal solutions are an unavoidable cost of scalability, and hence practical utility. A working prototype tool has been implemented to demonstrate the practicality of our approach.
An Aspect Oriented Model Driven Framework
Authors: Devon Simmonds, Raghu Reddy, Robert France, Sudipto Ghosh, Arnor Solberg
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

In model driven development (MDD), specifying transformations between models at various levels of abstraction can be a complex task. Specifying transformations for pervasive system features that are tangled with other system features is particularly difficult because the elements to be transformed are distributed across a model. This paper presents an aspect oriented model driven framework (AOMDF) that facilitates separation of pervasive features and supports their transformation across different levels of abstraction. The framework is illustrated using an example in which a platform independent model of a banking application is transformed to a platform specific model.
A New Test Methodology For DNL Error In Flash ADC"s
Authors: Michael Wieckowski, John Liobe, Quentin Diduck, Martin Margala
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

A novel test methodology is presented for characterizing DNL error in Flash analog to digital converters. This test technique accurately measures the resistance of each resistor in the Flash ladder and in turn, characterizes the DNL of a given chip. A testing time of approximately ms is achieved with a 30% increase in area for a 6-bit Flash ADC. When used in conjunction with standard automated test equipment, a reduction in total testing time and cost is predicted with minimal increase in area and power overhead.
Relevant Past Performance for Selecting Web Services
Authors: Wanita Sherchan, Shonali Krishnaswamy, Seng Wai Loke
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

The selection of web services is typically based on performance (or perception of performance) in past invocations. Instead of using the entire history of invocations in evaluating the performance of services, we use a portion of the history, selected with respect to the current user request. To facilitate this selection, we establish that it is feasible to infer the requirements and preferences of the users from the SLA.
Adaptive Resource Management for Mobile Multimedia Communications in Asymmetric Wireless Network
Authors: Chuang Lin, Yaya Wei, Zhiguang Shan
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

In the multi-service wireless networks, the bandwidth asymmetry is the distinctive characteristic. To avoid wasting uplink and downlink bandwidth in asymmetric network, admissible region for the nonreal- time (NRT) calls has been proposed. But in that scheme the static guard capacity for RT and NRT calls cannot adapt to traffic variation. In addition, the differentiated QoS services to users are not considered. In this paper, we propose an Adaptive Guard Channel Reservation (AGCR) scheme, which has the following novelties: i) the guard capacity for each class is dynamically adjusted so as to adapt to dynamic traffic, ii) the blocking probabilities of classes with higher priority are kept below certain targets and iii) differentiated QoS services to users are provided by maintaining the blocking probability ratios over different classes at the predefined targets. Simulation results have demonstrated the proposed AGCR scheme can keep the blocking probabilities of classes with higher priority below certain targets, track the ratios close to the targets well while maintaining a high bandwidth utilization.
Localisation and Interaction for Augmented Maps
Authors: Gerhard Reitmayr, Ethan Eade, Tom Drummond
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Paper-based cartographic maps provide highly detailed information visualisation with unrivalled fidelity and information density. Moreover, the physical properties of paper afford simple interactions for browsing a map or focusing on individual details, managing concurrent access for multiple users and general malleability. However, printed maps are static displays and while computer-based map displays can support dynamic information, they lack the nice properties of real maps identified above. We address these short-comings by presenting a system to augment printed maps with digital graphical information and user interface components. These augmentations complement the properties of the printed information in that they are dynamic, permit layer selection and provide complex computer mediated interactions with geographically embedded information and user interface controls. Two methods are presented which exploit the benefits of using tangible artifacts for such interactions.
Building learning systems: a study of the design and implementation of two corporate learning systems
Authors: Thomas Schwen
Venue:  (2005)

Information technology advances and the continuing development of specifications for learning content are changing the way learning content is developed, stored, and presented in the corporate environment. This change is occurring as organizations continue to rethink training strategies, information technology use, and how information technology can best serve the organization in an increasingly global economy. Using an action research approach, this paper reports the design, development, and implementation of two systems for creating, storing, and presenting learning content in a large manufacturing organization. One system, a database-based application, is explained in detail; including its entity relationship diagram, table data, and schema. The attempt to integrate this system into the larger IT environment is presented. The second system, a set of tools and process for creating web-based SCORM-conformant (Sharable Content Object Reference Model) courses, is described. The description includes observations on content meta-data requirements and opportunities, reusable learning objects, and reusable interaction objects. The attempt to integrate this system into the larger organizational context is also provided. These two cases illustrate: the need for project management and information technology partners to carefully manage risk in the development and implementation of learning applications, the role of champions in learning technology innovation, the need for well-defined exit strategies, and the tension between core business needs and organizational learning.
Service-oriented Accounting Configuration Management based on Diameter
Authors: Frank Eyermann, Peter Racz, Burkhard Stiller, Christian Schaefer, Thomas Walter
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The increasing deployment of Universal Mobile Telecommunication System (UMTS) networks and WLAN (Wireless Local Area Network) hot-spots will shape the future development of wireless and mobile communication systems. The key objective of systems beyond 3G [4] besides the integration of existing systems to interwork with each other and with new air interfaces is an advanced mobility management across technological and administrative domains. Mobility management is seen as an enabler to perform accounting, charging, and billing of mobile users in a multiple Mobile Network Operator (MNO) environment.
Guiding agent-oriented requirements elicitation: HOMER
Authors: Damien Wilmann, Leon Sterling
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

There has been a surge of interest in agent-oriented software engineering in recent years. The key area of requirements engineering for agent-based systems has received considerable attention. However, while notations and models for requirements have been discussed, there has been little attention focused on techniques for elicitation. This paper introduces HOMER, an approach for requirements elicitation that is explicitly agent-oriented. HOMER can be used with existing approaches for agent-oriented software engineering. In this paper, we show how HOMER may be integrated with a specific agent-oriented software engineering approach, ROADMAP. HOMER is aimed to increase the ease with which people may readily design and develop agent-based systems.
Developing Distributed Virtual Machines for the Tri-Integration-Pattern Based Platform (TIPBP)
Authors: Qing Duan, Zhihong Liang, Hua Zhou, Hongzhi Liao, Hongji Yang
Venue: Proceedings of the IEEE International Workshop (2005)

Virtual machine is a concept that has been used frequently in the computing world to solve different problems. It plays an important role that is continuing to extend the abilities of computer systems. In this paper, the concept of virtual machine is put into practice within Tri-Integration-Pattern Based Platform (TIPBP) in order to facilitate component assembly and application extension. The distributed virtual machines development aims to improve the performance of TIPBP. The paper presents the relationship between the distributed virtual machines and TIPBP, and details how to design the virtual machines at both server-side and client-side.
Network Intrusion and Failure Detection System with Statistical Analyses of Packet Headers
Authors: Kunio Goto, Koji Kojima
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

In this research, practical application for quasi-realtime intrusion and network failure detection was designed and implemented. IP packet headers are counted at the monitoring point and summarized in every 5 minutes. Then four kind of statistical analyses are applied to the 5-minute summaries to find a sudden increase/decrease. As the result, the developed application works fine with a standard desktop PC. Warnings were reported in at most 1 minute after every 5-minute summary. In addition to the warning report, Web interfaces were implemented to help the administrator to trace the cause of a warning.
Universal nonuniform random vector generator based on acceptance-rejection
Authors: Gleb Beliakov
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2005)

The acceptance/rejection approach is widely used in universal nonuniform random number generators. Its key part is an accurate approximation of a given probability density from above by a hat function. This article uses a piecewise constant hat function, whose values are overestimates of the density on the elements of the partition of the domain. It uses a sawtooth overestimate of Lipschitz continuous densities, and then examines all local maximizers of such an overestimate. The method is applicable to multivariate multimodal distributions. It exhibits relatively short preprocessing time and fast generation of random variates from a very large class of distributions.
OLAP for XML Data
Authors: Hongzhi Wang, Jianzhong Li, Zhenying He, Hong Gao
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

XML is an important standard of information exchange and representation on the web. Analysis of data on the web requires data analysis techniques of XML data. With tags representing semantics, XML data has more complex structure than relational database. Therefore, analysis of XML data can be more flexible. In this paper, concepts of XOLAP, OLAP of XML data, are presented. In order to supporting XOLAP, a general aggregation operator of XML, GXaggregation, is presented. Based on GXaggregation, XCube, an extension of tradition cube operator, is defined on XML data model. These operators can be embedded into XML query languages such as XQuery. In this paper, definitions and expressions operators related to XOLAP are presented, as well as a primary implementation of GXaggregation and XCube.
Self-Stabilizing Structured Ring Topology P2P Systems
Authors: Ayman Shaker, Douglas S. Reeves
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

We propose a self-stabilizing and modeless peer-to-peer (P2P) network construction and maintenance protocol, called the Ring Network (RN) protocol. The RN protocol. when started on a network of peers that are in an arbitrary state, will cause the network to converge to a structured P2P system with a directed ring topology, where peers are ordered according to their ideniifers. Furthermore, the RN protocol maintains the structure in the face of peer joins and departures. The RN protocol is a distributed and asynchronous message-passing protocol, which fits well the autonomous behavior of peers in a P2P system. The RN protocol requires only the existence of a bootstrapping system which is weakly connected. Peers do not need to be informed of any global network state, nor do they need to assist in repairing the network topology when they leave. We provide a proof of the self-stabilizing nature of the protocol, and experimentally measure the average cost (in time and number of messages) to achieve convergence.
EXPERIMENTAL EVALUATION OF FSM-BASED TESTING METHODS
Authors: Rita Dorofeeva, Nina Yevtushenko, Khaled El-Fakih, Ana R. Cavalli
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

The development of test cases is an important issue for testing software, communication protocols and other reactive systems. A number of methods are known for the development of a test suite based on a formal specification given in the form of a finite state machine. Well-known methods are called the W, Wp, UIO, UIOv, DS, H and HIS test derivation methods. These methods have been extensively used by research community in the last years; however no proper comparison has been made between them. In this paper, we experiment with these methods to assess their complexity, applicability, completeness, fault detection capability, length and derivation time of their test suites. The experiments are conducted on randomly generated specifications and on a realistic protocol called the Simple Connection Protocol.
A Time-Domain Based Approach for Short-Term Fading Depth Evaluation in Wideband Mobile Communication Systems
Authors: Filipe D. Cardoso, Luis M. Correia
Venue: Wireless Personal Communications: An International Journal (2005)

In this paper a time-domain technique for wideband fading depth evaluation, is proposed, which is applicable to both Line-of-Sight and Non-Line-of-Sight cases, and the probability functions of the wideband received power are derived, contributing for filling in the gap of short-term fading characterisation in wideband systems. Application examples for different systems, namely GSM, UMTS and HIPERLAN/2, working in different standard reference environments, are shown. As expected, it is observed that Rayleigh and Rice distributions are appropriate for evaluating the fading margins for GSM in some environments; nevertheless, for UMTS and HIPERLAN/2, fading margins are usually well below the ones obtained from considering these narrowband distributions, the differences reaching up to around 10 and 13 dB, respectively.A simple relationship between the physical and the geometrical environment properties, and the rms delay spread of the propagation channel is also proposed, establishing a relationship between two models independently derived by different authors. Using the proposed relationship, fading depth results from the proposed time-domain technique are compared with the ones for an environment-geometry based one, and a good agreement is verified. The difference in fading depth between both approaches is roughly below 2 dB.
Cursive word skew/slant corrections based on Radon transform
Authors: Jian-xiong Dong, Ponson Dominique, Adam Krzyyzak, Ching Y. Suen
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper presents two fast and robust algorithms for word skew and slant corrections based on Radon transform. For the skew correction, we maximize a global measure which is defined by Radon transform of image and its gradient to estimate the slope. For the slant correction, Radon transform is used to estimate the long strokes and a word slant is measured by the average angle of these long strokes. Compared with the previous methods, these two algorithms do not require the setting of parameters heuristically. Moreover, the algorithms perform well on words of short length, where the traditional methods usually fail.
Quantum algorithms and complexity for certain continuous and related discrete problems
Authors: Henryk Wozniakowski
Venue:  (2005)

The thesis contains an analysis of two computational problems. The first problem is discrete quantum Boolean summation. This problem is a building block of quantum algorithms for many continuous problems, such as integration, approximation, differential equations and path integration. The second problem is continuous multivariate Feynman-Kac path integration, which is a special case of path integration. The quantum Boolean summation problem can be solved by the quantum summation (QS) algorithm of Brassard, H&oslash;yer, Mosca and Tapp, which approximates the arithmetic mean of a Boolean function. We improve the error bound of Brassard et al. for the worst-probabilistic setting. Our error bound is sharp. We also present new sharp error bounds in the average-probabilistic and worst-average settings. Our average-probabilistic error bounds prove the optimality of the QS algorithm for a certain choice of its parameters. The study of the worst-average error shows that the QS algorithm is not optimal in this setting; we need to use a certain number of repetitions to regain its optimality. The multivariate Feynman-Kac path integration problem for smooth multivariate functions suffers from the provable curse of dimensionality in the worst-case deterministic setting, i.e., the minimal number of function evaluations needed to compute an approximation depends exponentially on the number of variables. We show that in both the randomized and quantum settings the curse of dimensionality is vanquished, i.e., the minimal number of function evaluations and/or quantum queries required to compute an approximation depends only polynomially on the reciprocal of the desired accuracy and has a bound independent of the number of variables. The exponents of these polynomials are 2 in the randomized setting and 1 in the quantum setting. These exponents can be lowered at the expense of the dependence on the number of variables. Hence, the quantum setting yields exponential speedup over the worst-case deterministic setting, and quadratic speedup over the randomized setting.
A General Signalling Approach for Local Adaptation
Authors: Attila Takacs, Akos Kovacs, Franz Kalleitner
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

With the fast improvements of broadband wireless technologies more and more demanding services can be provided over wireless access networks. However, the highly varying nature of wireless channels and the stringent requirements of real-time applications require enhancements of service delivery. To achieve high user-perceived quality adaptive applications and adaptationsupportive network entities play a key role. Recently, cross-layer adaptation is getting acceptance as a method that efficiently increases the performance of wireless communications. Although several cross-layer optimisation methods have been proposed over the past years, the research for end-to-end concepts was rather short-handed. The Multimedia Pipe (M-Pipe) project1 was started, among others, to research existing approaches and propose a conceptual solution for cross-layer optimisation of multimedia delivery. In this paper, we overview some of the concepts under investigation in the project.
Enterprise Application Integration: A Manager's Perspective
Authors: Rodney Gleghorn
Venue: IT Professional (2005)

To remain competitive, organizations must operate efficiently and be flexible enough to rapidly respond toand even preemptchanging market conditions. IT managers must therefore continually seek ways to support more effective and accurate business processes. Enterprise application integration (EAI) is a key technology in meeting this mandate, but before implementing any data-integration solution, an organization should be aware of the technical risks as well as the operations involved in the process.
Positioning Analysis of Multiple Antennas in a Dense RFID Reader Environment
Authors: Kin Seong Leong, Mun Leng Ng, Peter H. Cole
Venue: Proceedings of the International Symposium on Applications on Internet Workshops (2006)

The study and analysis of RFID antenna positioning is important for supply chain large-scale deployment. In a dense reader environment, there will be multiples of RFID readers and readers interference will reduce the reliability and efficiency of the RFID system. In the worst case, the interference would paralyse an entire RFID system. This paper explores antenna positioning in an RFID deployment zone and aims to provide guidelines on safe distance between antennas in a dense reader environment or even in a "Listen Before Talk" regulated area. By planning of antenna positioning, a RFID system can be optimised and its interference to other RF systems in the surroundings can be minimised. All the simulations results presented in this paper are obtained using MATLAB.
Guest Editor's Introduction: Reliability-Aware Microarchitecture
Authors: Sarita V. Adve, Pia Sanda
Venue: IEEE Micro (2005)

This special issue of IEEE Micro addresses the trends toward reliability-aware microarchitecture,their system-level implications, and some innovative ideas on how to build systems in the face of those challenges.