ppxscal/embedding_network huggingface dataset:
Formal Verification of Type Flaw Attacks in Security Protocols
Authors: Benjamin W. Long
Venue: Proceedings of the Tenth Asia-Pacific Software Engineering Conference Software Engineering Conference (2003)

Security protocols are often modelled at a high levelof abstraction, potentially overlooking implementation-dependentvulnerabilities. Here we use the Z specificationlanguage's rich set of data structures to formally model potentiallyambiguous messages that may be exploited in a'type flaw' attack. We then show how to formally verifywhether or not such an attack is actually possible in a particularprotocol using Z's schema calculus.
The Effects of Process Characteristics on the Value of B2B E-Procurement
Authors: Chandrasekar Subramaniam, Michael J. Shaw
Venue: Information Technology and Management (2004)

Even as more organizations are moving towards implementing Web-based B2B procurement solutions, they are unsure of the real benefits of the Web. In other words, what is the value of B2B e-procurement to an organization and how to measure this value? What factors affect this value? In this paper, we discuss an evaluation framework to determine the value of B2B e-procurement and the effect of process characteristics on the value. We use an empirical study to highlight the different value created by different procurement types. We then develop a more comprehensive economic model to capture the additional effects of demand volume and process complexity. The integration of theoretical and empirical approaches provides a strong foundation to develop and evaluate useful adoption strategies for B2B e-procurement.
On the Cover Time for Random Walks on Random Graphs
Authors: Johan Jonasson
Venue: Combinatorics, Probability and Computing (1998)

The cover time, C, for a simple random walk on a realization, GN, of &Gscr;(N, p), the random graph on N vertices where each two vertices have an edge between them with probability p independently, is studied. The parameter p is allowed to decrease with N and p is written on the form f(N)&#x002F;N, where it is assumed that f(N)&ge;c log N for some c>1 to asymptotically ensure connectedness of the graph. It is shown that if f(N) is of higher order than log N, then, with probability 1&minus;o(1), (1&minus;ε)N log N&le;E[C&#x2223;GN] &le;(1+ε)N log N for any fixed ε>0, whereas if f(N)=O(log N), there exists a constant a>0 such that, with probability 1&minus;o(1), E[C&#x2223;GN] &ge;(1+a)N log N. It is furthermore shown that if f(N) is of higher order than (log N)3 then Var(C&#x2223;GN)= o((N log N)2) with probability 1&minus;o(1), so that with probability 1&minus;o(1), the stronger statement that (1&minus;ε)N log N&le;C&le;(1+ε)N log N holds.
Planning Based on Decision Theory
Authors: Giacomo Della Riccia, Rudolf Kruse, Didier Dubois, Hans-J. Lenz
Venue:  (2004)

Planning of actions based on decision theory is a hot topic for many disciplines. Seemingly unlimited computing power, networking, integration and collaboration have meanwhile attracted the attention of fields like Machine Learning, Operations Research, Management Science and Computer Science. Software agents of e-commerce, mediators of Information Retrieval Systems and Database based Information Systems are typical new application areas. Until now, planning methods were successfully applied in production, logistics, marketing, finance, management, and used in robots, software agents etc. It is the special feature of the book that planning is embedded into decision theory, and this will give the interested reader new perspectives to follow-up.
A Multi-Agent Software Environment for Testing Web-based Applications
Authors: Qingning Huo, Hong Zhu, Sue Greenwood
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

This paper presents an agent-based software environmentfor testing web-based applications. The infrastructureof the system consists of a lightweight agent platformthat supports agent communication, an ontology of softwaretesting that enables flexible integration of multipleagents, and a formalism using XML to represent both thebasic and compound concepts of the ontology. Relationsbetween testing concepts are defined and their propertiesare analysed. A number of agents are implemented toperform various tasks in testing web-based applications.Broker agents use the ontology as a means of inferences tomanage the knowledge about agents and assign each taskto the most appropriate agent.
Maximum Likelihood Based Channel Delay Estimation with Limited Number of Samples Using Diagonal Matrix Approximation
Authors: X. Tang, Y. Bar-Ness
Venue: Wireless Personal Communications: An International Journal (2003)

To achieve fast and computationally simplified channel estimation, we propose a maximum likelihood estimation (MLE) based ``diagonal matrix approximation'' (DMA) scheme which provides an effective solution to overcome the conflict between estimation accuracy, acquisition time, and complexity. Together with over sampling, the proposed scheme exhibits a performance approaching the Cram&eacute;r-Rao Lower Bound (CRLB), while keeping computational complexity linear to the signal dimensions. The DMA scheme can still perform well even when the sample estimate of the covariance matrix, due to insufficient number of observation samples, is singular. Therefore, the proposed scheme is a viable solution for fast channel estimation.
Incremental Dynamic Impact Analysis for Evolving Software Systems
Authors: James Law, Gregg Rothermel
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

Impact analysis - determining the potential effects ofchanges on a software system - plays an important role inhelping engineers re-validate modified software. In previouswork we presented a new impact analysis technique,PathImpact, for performing dynamic impact analysis atthe level of procedures, and we showed empirically thatthe technique can be cost-effective in comparison to prominentprior techniques. A drawback of that approach as presented,however, is that when attempting to apply the techniqueto a new version of a system as that system and itstest suite evolves, the process of recomputing the data requiredby the technique for that version can be excessivelyexpensive. In this paper, therefore, we present algorithmsthat allow the data needed by PathImpact to be collectedincrementally. We present the results of a controlled experimentinvestigating the costs and benefits of this incrementalapproach relative to the approach of completely recomputingprerequisite data.
A model for efficient configuration of management agents in distributed systems
Authors: Hasina Abdu, Hanan Lutfiyya, Michael A. Bauer
Venue: Performance Evaluation (2003)

With the increased availability and complexity of distributed systems comes a greater need for solutions to assist in the management of distributed system components. Despite the significant contributions made towards the development of management tools that monitor and control distributed systems, little has been done towards formally defining management systems and the requirements to be satisfied by these systems. In this paper, we model three main aspects of achieving efficiency in distributed systems management: (i) the need for minimising resource consumption by management, (ii) the need to satisfy system and application requirements, and (iii) the need for dynamic solutions. We also present experimental results that illustrate the scalability and validity of our model.
Comparison of Several Difference Schemes on 1D and 2D Test Problems for the Euler Equations
Authors: Richard Liska, Burton Wendroff
Venue: SIAM Journal on Scientific Computing (2003)

The results of computations with eight explicit finite difference schemes on a suite of one-dimensional and two-dimensional test problems for the Euler equations are presented in various formats. Both dimensionally split and two-dimensional schemes are represented, as are central and upwind-biased methods, and all are at least second-order accurate.
Patients' online communities experiences of emergent Swedish self-help on the internet
Authors: Ulrika Josefsson
Venue: Communities and Technologies (2003)

This paper identifies and analyses characteristics of Patients' Online Communities (POC) in Sweden. The purpose of the paper is to increase our understanding of how individuals design online social support and how this can inform design in a wider perspective. The study presents a fine-grained picture of POC covering both the contextual structures and the community culture. Two important driving forces of POC (to get informed and to interact with others in similar situation) are identified. These serve as a basis for the introductory discussion provided on how the experiences from POC can serve as implications for the emergent design of Internet based communication between patients and health care providers.
Polyphonic music modeling with random fields
Authors: Victor Lavrenko, Jeremy Pickens
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Recent interest in the area of music information retrieval and related technologies is exploding. However, very few of the existing techniques take advantage of recent developments in statistical modeling. In this paper we discuss an application of Random Fields to the problem of creating accurate yet flexible statistical models of polyphonic music. With such models in hand, the challenges of developing effective searching, browsing and organization techniques for the growing bodies of music collections may be successfully met. We offer an evaluation of these models in terms of perplexity and prediction accuracy, and show that random fields not only outperform Markov chains, but are much more robust in terms of overfitting.
Modeling and simulation of ATM systems and networks
Authors: M. S. Obaidat, N. Boudriga
Venue: Applied system simulation: methodologies and applications (2003)

Through efficient multiplexing and routing, asynchronous transfer mode (ATM) technology can interconnect multiple classes of users and transport applications cost-effectively with guaranteed performance. A combined approach of simulation and analysis can be used to assess the performance of large scale and distributed services. This chapter discusses the modeling and simulation techniques of ATM systems and networks. The chapter presents the main characteristics of traffic flows, congestion method, and service classes in order to lay out the foundations for simulation.
Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN
Authors: Adam D. Bradley, Azer Bestavros, Assaf J. Kfoury
Venue: Proceedings of the 11th IEEE International Conference on Network Protocols (2003)

Formal correctness of complex multi-party network protocols can be difficult to verify. While models of specific fixed compositions of agents can be checked against design constraints, protocols which lend themselves to arbitrarily many compositions of agents ¿ such as the chaining of proxies or the peering of routers¿ are more difficult to verify because they represent potentially infinite state spaces and may exhibit emergent behaviors which may not materialize under particular fixed compositions. We address this challenge by developing an algebraic approach that enables us to reduce arbitrary compositions of network agentsinto a behaviorally-equivalent (with respect to some correctness property) compact, canonical representation, which is amenable to mechanical verification. Our approach consists of an algebra and a set of property-preserving rewrite rules for the Canonical Homomorphic Abstraction of Infinite Network protocol compositions (CHAIN). Using CHAIN, an expression over our algebra (i.e., a set of configurations of network protocol agents) can be reduced to another behaviorally-equivalent expression (i.e., a smaller set of configurations). Repeated applications of such rewrite rules produces a canonical expression which can be checked mechanically. We demonstrate our approach by characterizing deadlock-prone configurations of HTTP agents, as well as establishing useful properties of an overlay protocol for scheduling MPEG frames, and of a protocol for Web intra-cache consistency.
Detecting watermarks at arbitrary image resolution
Authors: Josef Scharinger
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Informally speaking, a digital watermark is some usually imperceptible embedded control code carrying information related to the intellectual property rights of the data. When we deal with the application of watermarks in digital imaging an essential requirement is that embedded watermarks can still successfully be detected after an image has been printed out and scanned in again.Printing and scanning causes a number of alterations to the image: A/D and D/A conversion, filtering, modification of resolution on and slight changes in image geometry due to imperfections of devices and personnel involved in the process. Even more, when scanning in a printed image we usually have no idea about the pixel resolution of the original digital image, a significant problem in watermark detection applications.In this contribution we present novel watermark embedding and corresponding detection algorithms that are capable of dealing with these aforementioned difficulties. It can be expected that these findings might be of considerable importance to bring digital watermarking one step closer to practical image copyright enforcement.
Testing and Reliability Techniques for High-Bandwidth Embedded RAMs
Authors: Kanad Chakraborty
Venue: Journal of Electronic Testing: Theory and Applications (2004)

Application-specific integrated circuits (ASICs) and high-performance processors such as Itanium and Compaq Alpha use a total of almost 75% of chip real estate for accommodating various types of embedded (or on-chip) memories. Although most of these embedded memories are single-port static (and in relatively few cases, dynamic) RAMs today, the high demand for bandwidth in digital television, fast signal processing, and high-speed networking applications will also fuel the need for on-chip multiport memories in the foreseeable future. The reliability of a complex VLSI chip will depend largely on the reliability of these embedded memory blocks. With device dimensions moving rapidly toward the ultimate physical limits of device scaling, which is in the regime of feature sizes of 50 nm or so, a host of complex failure modes is expected to occur in memory circuits. This tutorial underlines the need for appropriate testing and reliability techniques for the present to the next generation of embedded RAMs. Topics covered include: reliability and quality testing, fault modeling, advanced built-in self-test (BIST), built-in self-diagnosis (BISD), and built-in self-repair (BISR) techniques for high-bandwidth embedded RAMs.
Required software proficiency in general education and business courses
Authors: Linda Lynam
Venue: Current issues in IT education (2003)

Approximately 1,100 students in a general education computer course at a Midwestern state university with a technology focus were required to demonstrate competency in Microsoft Word®, Excel®, and PowerPoint® during the Fall 2001 and Spring 2002 semesters. The entrance requirement at the university requires a minimum of an ACT score of 20 or in the upper two-thirds of their high school graduating class. Many students are in the 20 to 23 range of ACT scores. A large portion of the students lack high school experience in independent study and individual responsibility. Results of the project indicate that students with little experience in self-responsibility can achieve at the university level when required.
Bookshelf: Art, Craft, Science--How about Profession?
Venue: IEEE Software (2003)

Philipp K. Janert reviews Software Craftsmanship by Pete McBreen, Melissa Stange reviews Debugging by David J. Agans, and Robert C. Larrabee reviews Bell Labs: Life in the Crown Jewel by Narain Gehani.
Ontological Excavation: Unearthing the core concepts of the application
Authors: Idris Hsi, Colin Potts, Melody Moore
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Applications possess and implement a specific "theoryof the world" or ontology. Recovering and modeling thisontology may help inform software developers seeking toextend or adapt an application's functionality for its nextrelease. We have developed a method for the black-boxreverse engineering or excavation of an application'sontology. The ontology is represented as a semanticnetwork, and graph theoretic measures are used toidentify core concepts. Core concepts contributedisproportionately to the structural integrity of theontology. We present analyses of ontologies excavatedfrom several interactive applications. From a set ofseveral candidate metrics for identifying core conceptswe find node betweenness centrality is a good measure ofa concept's influence on ontological integrity and that thek-core algorithm may be useful for identifying cohesivesubgroups of core features. We conclude by discussinghow these analyses can be applied to support applicationevolution.
Micro-operation cache: a power aware frontend for variable instruction length ISA
Authors: Baruch Solomon, Avi Mendelson, Ronny Ronen, Doron Orenstien, Yoav Almog
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Modern computer architectures that support variable length instruction set architectures (ISA), such as the Intel's IA-32, distinguish between the architectural level of presentation and the micro-architectural representations of the instructions. At the micro-architectural level, instructions are represented by fixed-length micro-operations termed uops, and complex instructions are broken into sequence of uops. The fetch and decode operations in such architectures are extremely complicated and power hungry, especially if they aim to handle several variable length instructions per cycle. This paper suggests caching uop sequences from decoded instructions in a special structure, termed uop cache (UC), and use this fix-length decoded format when possible. Doing so enables reduction in the processor's power and energy consumption while not compromising performance. We will show that a moderately-sized UC can eliminate about 75% instruction decodes across a broad range of benchmarks and over 90% in multimedia applications and high-power tests. For existing Intel P6 family processors, the eliminated work may save about 10% of the full-chip power consumption. While the new proposed technique can be used to save power without degrading performance, we can also use it to improve processor performance when power is constrained.
Mixing Time for a Markov Chain on Cladograms
Authors: David J. Aldous
Venue: Combinatorics, Probability and Computing (2000)

A cladogram is a tree with labelled leaves and unlabelled degree-3 branchpoints. A certain Markov chain on the set of n-leaf cladograms consists of removing a random leaf (and its incident edge) and re-attaching it to a random edge. We show that the mixing time (time to approach the uniform stationary distribution) for this chain is at least O(n2) and at most O(n3).
BlueMesh: degree-constrained multi-hop scatternet formation for Bluetooth networks
Authors: Chiara Petrioli, Stefano Basagni, Imrich Chlamtac
Venue: Mobile Networks and Applications (2004)

In this paper we describe BlueMesh, a new protocol for the establishment of scatternets, i.e., multi-hop wireless networks of Bluetooth devices. BlueMesh defines rules for device discovery, piconet formation and piconet interconnection so to generate connected scatternets with the following desirable properties. BlueMesh forms scatternets without requiring the Bluetooth devices to be all in each other transmission range. BlueMesh scatternet topologies are meshes with multiple paths between any pair of nodes. BlueMesh piconets are made up of no more than 7 slaves. Simulation results in networks with over 200 nodes show that BlueMesh is effective in quickly generating a connected scatternet in which each node, on average, does not assume more than 2.4 roles. Moreover, the route length between any two nodes in the network is comparable to that of the shortest paths between the nodes.
The business model concept: theoretical underpinnings and empirical illustrations
Authors: Jonas Hedman, Thomas Kalling
Venue: European Journal of Information Systems (2003)

The business model concept is becoming increasingly popular within IS, management and strategy literature. It is used within many fields of research, including both traditional strategy theory and in the emergent body of literature on e-business. However, the concept is often used independently from theory, meaning model components and their interrelations are relatively obscure. Nonetheless, we believe that the business model concept is useful in explaining the relation between IS and strategy. This paper offers an outline for a conceptual business model, and proposes that it should include customers and competitors, the offering, activities and organisation, resources and factor market interactions. The causal inter-relations and the longitudinal processes by which business models evolve should also be included. The model criticises yet draws on traditional strategy theory and on the literature that addresses business models directly. The business model is illustrated by an ERP implementation in a European multi-national company.
Per-queue stability analysis of a dynamic quota sharing scheme for wireless networks
Authors: Sum Lam, Rocky K. C. Chang
Venue: ACM SIGMETRICS Performance Evaluation Review (2003)

In this paper we consider a dynamic quota sharing scheme to support different classes of data traffic in wireless networks. The novelty of this scheme enables the lower-priority classes of traffic to use what has not been used by the higher-priority classes. We have performed per-queue stability analysis for this scheme. Based on the stability results, threshold values can be appropriately determined to fulfill certain throughput requirements.
A Stateful Intrusion Detection System for World-Wide Web Servers
Authors: Giovanni Vigna, William Robertson, Vishal Kher, Richard A. Kemmerer
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

Web servers are ubiquitous, remotely accessible, and oftenmisconfigured. In addition, custom web-based applicationsmay introduce vulnerabilities that are overlookedeven by the most security-conscious server administrators.Consequently, web servers are a popular target for hackers.To mitigate the security exposure associated with webservers, intrusion detection systems are deployed to analyzeand screen incoming requests. The goal is to perform earlydetection of malicious activity and possibly prevent moreserious damage to the protected site. Even though intrusiondetection is critical for the security of web servers, the intrusiondetection systems available today only perform verysimple analyses and are often vulnerable to simple evasiontechniques. In addition, most systems do not provide sophisticatedattack languages that allow a system administratorto specify custom, complex attack scenarios to be detected.This paper presents WebSTAT, an intrusion detection systemthat analyzes web requests looking for evidence of maliciousbehavior. The system is novel in several ways. First ofall, it provides a sophisticated language to describe multi-stepattacks in terms of states and transitions. In addition,the modular nature of the system supports the integratedanalysis of network traffic sent to the server host, operatingsystem-level audit data produced by the server host, andthe access logs produced by the web server. By correlatingdifferent streams of events, it is possible to achieve more effectivedetection of web-based attacks.