ppxscal/embedding_network huggingface dataset:
Reno Friendly TCP Westwood based on Router Buffer Estimation
Authors: Kazumi KANEKO, Jiro KATTO
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

TCP Reno versions are widely used in current network, however it has been actualized that their throughput deteriorates in high-speed network and wireless environments. To overcome these problems of TCP Reno versions, a number of protocols have been proposed. In these researches, friendliness with TCP Reno becomes important. TCP Westwood is an example that is based on end-to-end bandwidth estimate, and brings higher efficiency performances. However it will be shown that the friendliness with TCP Reno is deteriorated according to network situations such as the buffer size of a bottleneck link router. In this paper, we quantify the buffer size that TCP Reno and TCP Westwood perform friendly to each other, and then propose an improved version of TCP Westwood that achieves friendliness with TCP Reno by estimating the buffer size of a bottleneck link router by using bandwidth estimation technique, RCE, and by updating congestion control parameters under the constraint of throughput estimation models. We confirm effectiveness of our proposal scheme by extensive simulation experiments. Simulation results show that our proposed scheme performs friendly to TCP Reno in various network situations independently of router buffer sizes.
Higher-Order Entity Relationship Modelling with UML
Authors: Alexei Tretiakov, Sven Hartmann
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

To explore the use of UML for creating valuerepresentable data models, we use the Object Management Group (OMG) Meta Object Facility (MOF) to formally describe the Higher-order Entity Relationship Model (HERM). In addition, we formally define a UML profile for HERM. By demonstrating that MOF and UML can represent the most critical capabilities of HERM, we open way for better integration of HERM models into projects relying on UML for application modelling and for the use of UML tools for HERM modelling.
Website usability evaluation using sequential analysis
Authors: Theodore W. Frick
Venue:  (2005)

The Sequential Probability Ratio Test (SPRT) was used as a method to determine the number of subjects needed during summative evaluation of a website. Extant methodology for choosing the number of subjects during formative evaluation has often been based on a Poisson model. The goal of formative evaluation is to identify and correct website usability problems. However, during summative evaluation, the primary goal is to evaluate website effectiveness. Does the SPRT, when used to determine website effectiveness: (1) reduce the number of participants and tasks needed, (2) retain sufficient problem identification, and (3) improve cost effectiveness of usability evaluation? Twenty-five undergraduate pre-education students participated in usability tests that employed a thinking aloud protocol. Each user attempted 20 randomly sampled tasks from a pool of 120 typical tasks for a large website. Three SPRT methods, the Poisson-based model, and a classical sampling approach were used in retrospective data analyses. Resultant identification of usability problems was also observed with these statistical techniques. Results indicated that a website effectiveness decision could be made with the SPRT after testing 5 users chosen at random, with an average of 12 tasks per user. However, this number of users and tasks identified 25% of known usability problems. Likewise, the Poisson-based approach identified 35% of the problems with these same 5 users but with 20 tasks per user. For over 10 years, the prevailing rule of thumb has been that 4 to 5 subjects will identify the usability problems when evaluating websites. Results from this study indicated that more subjects may be needed for identifying 80&ndash;85% of website usability problems. Results also indicated that the SPRT is more cost-effective than the Poisson model if summative evaluation and not problem identification is the goal of usability testing.
Quantifying Agent Strategies under Reputation
Authors: Sergio Marti, Hector Garcia-Molina
Venue: Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (2005)

Our research proposes a simple buyer/seller game that captures the incentives dictating the interaction between peers in resource trading peer-to-peer networks. We prove that for simple reputation-based buyer strategies, a seller¿s decision whether to cheat or not is dependent only on the length of its transaction history, not on the particular actions committed. Given a finite number of transactions, a peer can compute a utility optimal sequence of cooperations and defections. With the limited information provided by many reputation systems, a peer has incentive to defect on a large fraction of its transactions. If temporal information is used, equilibrium is reached when peers predominantly cooperate.
Anomaly intrusion detection and threat evaluation using artificial immunity model and fuzzy logic
Authors: James H. Graham
Venue:  (2005)

This dissertation proposes a computer immunology model to detect anomaly intrusions from user and program behavior profiling based on a hierarchical fuzzy threat evaluation mechanism. The sequential data of commands from users and system calls from programs is used to construct finite automata which are identified with behavior profiles. The self and non-self behaviors from natural immune systems have been applied in this research to measure both the similarity and deviation of a case with the behavior profile. The values of fuzzy memberships can be calculated using a hierarchical fuzzy reasoning system by comparing test data with the finite automaton. This dissertation also presents a new fuzzy risk analysis approach to identify a case as a linguistic term. The threat as fuzzy memberships can be converted into a generalized fuzzy number with the weight value. Then the synthesized number is compared with linguistic terms denoted as fuzzy numbers to measure the similarities one by one. The linguistic term that has the highest similarity with the synthesized fuzzy number is regarded as the final threat level to the system. The computer immunology model is applied to detect masqueraders and intrusion scenarios from manipulating privileged processes to explore system vulnerabilities. Using truncated commands (without arguments) analysis, it improves upon seven other methods used to detect simulated masqueraders. Using enriched commands with arguments, this model can detect simulated masquerader data in a very short time interval. The immunology model also succeeds in detecting program anomaly behavior patterns and correctly identifying intrusion scenarios. A new experiment is described to detect intruders with the data set collected in a real computer system. The experimental results show that the computer immunology model is very effective and efficient to detect anomalies with real masquerader data. Some future research directions are discussed including user behavior profiling in GUI-based systems, and applying neural network and data mining to anomaly intrusion detection.
Automatic Generation of Buffer Overflow Attack Signatures: An Approach Based on Program Behavior Models
Authors: Zhenkai Liang, R. Sekar
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Buffer overflows have become the most common target for network-based attacks. They are also the primary mechanism used by worms and other forms of automated attacks. Although many techniques have been developed to prevent server compromises due to buffer overflows, these defenses still lead to server crashes. When attacks occur repeatedly, as is common with automated attacks, these protection mechanisms lead to repeated restarts of the victim application, rendering its service unavailable. To overcome this problem, we develop a new approach that can learn the characteristics of a particular attack, and filter out future instances of the same attack or its variants. By doing so, our approach significantly increases the availability of servers subjected to repeated attacks. The approach is fully automatic, does not require source code, and has low runtime overheads. In our experiments, it was effective against most attacks, and did not produce any false positives.
The Need to Improve Local Self-Awareness in CIP/CIIP
Authors: Sandro Bologna, Roberto Setola
Venue: Proceedings of the First IEEE International Workshop on Critical Infrastructure Protection (2005)

Interdependencies represent one of the most relevant elements in the actual techno-social scenario. Indeed, especially due to the wide spread of ICT, we observe an exponential increase in the points of contact among the different infrastructures. This phenomenon is largely due to (or induced by) the increased need to exchange information among large communities of users and stakeholders in order to improve efficiency, to reduce costs and to supply innovative services. Unfortunately, these interdependencies have dramatically increased the level of complexity and introduced, as emphasised by some recent episodes, new and very dangerous vulnerabilities. The need to improve robustness and resilience of the system of systems composed by the different interdependent infrastructures represents a very hard challenge for the next years. In the paper we emphasize that, from the technological point of view, strategies to reach this goal should be based on a better use of information. Indeed in the presence of global threats, we need to improve the local capability to autonomously react to anomaly situations. This capability is largely related, further to an amount of distributed intelligence, to our ability to improve information gathering (from environment) and sharing (among infrastructures). However, as stressed in the paper, technology is just one dimension along which we have to work; indeed, we should consider also social, economical and political activity: Critical Infrastructure Protection is a global task, it calls for global solution.
Be here now together: extended abstract
Authors: Andrew Glassner
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Stories are an essential part of everyday life. We tell stories to entertain each other, to share our cultural and personal histories and values, and to make sense of our world. Stories are a common way to share emotional context. They are a powerful tool not only for understanding what the world is like, but for discovering our own place in the world and how to live our lives.
Privacy Requirements Implemented with a JavaCard
Authors: Anas Abou el Kalam, Yves Deswarte
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Privacy is extremely important in healthcare systems. Unfortunately, most of the solutions already deployed are developed empirically. After discussing some of such existing solutions, this paper describes an analytic and generic approach to protect personal data by anonymization. This approach is then applied to some representative scenarios. The architecture and its implementation with a Javacard are finally presented. Our analysis, solution and implementation are generic enough to be adapted to various collaborative systems that process sensitive data such as ecommerce, e-government, social applications, etc.
Improved Port Knocking with Strong Authentication
Authors: Rennie deGraaf, John Aycock, Michael Jr. Jacobson
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

It is sometimes desirable to allow access to open ports on a firerewall only to authorized external users and present closed ports to all others. We examine ways to construct an authentication service to achieve this goal, and then examine one such method, "port" knocking,and its existing implementations, in detail. We improve upon these existing implementations by presenting a novel port knocking architecture that provides strong authentication while addressing the weaknesses of existing port knocking systems.
Integrating Speech Technologies into a One-on-one Digital English Classroom
Authors: Jie Chi Yang, Chih Hung Lai, Yu Min Chu
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

This paper deals with the development and evaluation of a system for a one-on-one digital English classroom by integrating speech technologies. The system is designed for English oral practice and assessment for students using their handheld devices (PDAs) with wireless connected environment in a classroom. The system consists of four modules - speech, testing, learning portfolio, and teacher management modules. An evaluation study was conducted to examine how students used the system by analyzing the system log data, questionnaires, and interview. The results showed that (1) students increased their performance on oral practice (the number of times of 'wrong answer' and 'answering a question' decreased); (2) students increased their confidence in speaking English; (3) students highly accepted the learning style of using handheld devices for English learning; and (4) functions for providing students' statistic data to the teacher was very useful.
An ASM Operational Semantics for Use Case Maps
Authors: Jameleddine Hassine, Juergen Rilling, Rachida Dssouli
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Scenario-driven requirement specifications are widely used to capture and represent functional requirements. Use Case Maps (UCM) is being standardized as part of the User Requirements Notation (URN), the most recent addition to ITU-T¿s family of languages. UCM models allow the description of functional requirements and high-level designs at early stages of the development process. Recognizing the importance of having a well defined semantic, we propose, in this work, a concise and rigorous formal semantics for Use Case Maps, defined in terms of Multi-Agent Abstract State Machines. The proposed formal semantics addresses UCM¿s operational semantics and provides a sound basis for executing UCM specifications using simulation tools and supporting formal verification.
Content-based image retrieval: approaches and trends of the new age
Authors: Ritendra Datta, Jia Li, James Z. Wang
Venue: Proceedings of the 7th ACM SIGMM international workshop on Multimedia information retrieval (2005)

The last decade has witnessed great interest in research on content-based image retrieval. This has paved the way for a large number of new techniques and systems, and a growing interest in associated fields to support such systems. Likewise, digital imagery has expanded its horizon in many directions, resulting in an explosion in the volume of image data required to be organized. In this paper, we discuss some of the key contributions in the current decade related to image retrieval and automated image annotation, spanning 120 references. We also discuss some of the key challenges involved in the adaptation of existing image retrieval techniques to build useful systems that can handle real-world data. We conclude with a study on the trends in volume and impact of publications in the field with respect to venues/journals and sub-topics.
An algebraic theory of dynamic network routing
Authors: João Luís Sobrinho
Venue: IEEE/ACM Transactions on Networking (TON) (2005)

We develop a non-classic algebraic theory for the purpose of investigating the convergence properties of dynamic routing protocols. The algebraic theory can be regarded as a generalization of shortest-path routing, where the new concept of free cycle generalizes that of a positive-length cycle. A primary result then states that routing protocols always converge, though not necessarily onto optimal paths, in networks where all cycles are free. Monotonicity and isotonicity are two algebraic properties that strengthen convergence results. Monotonicity implies protocol convergence in every network, and isotonicity assures convergence onto optimal paths.A great many applications arise as particular instances of the algebraic theory. In intra-domain routing, we show that routing protocols can be made to converge to shortest and widest paths, for example, but that the composite metric of Internet Gateway Routing Protocol (IGRP) does not lead to optimal paths. The more interesting applications, however, relate to inter-domain routing and its Border Gateway Protocol (BGP), where the algebraic framework provides a mathematical template for the specification, design, and verification of routing policies. We formulate existing guidelines for inter-domain routing in algebraic terms, propose new guidelines contemplating backup relationships between domains, and derive a sufficient condition for signaling correctness of internal-BGP.
Two studies in combinatorial optimization: contact-map overlap and minimum-bends tsp
Authors: Michael J. Collins
Venue:  (2005)

This dissertation presents a pair of quite different investigations in combinatorial optimization. The first section is a study of &ldquo;Contact-Map Overlap&rdquo; (CMO), a graph-theoretic problem derived from computational biology, more specifically from protein structure comparison. This problem has a natural formulation as an integer linear program; using the AMPL modeling language, we have developed a robust, efficient, flexible implementation of the ILP. Our approach to CMO is primarily heuristic and empirical, focused on computational techniques that are useful for obtaining approximate solutions to problems large enough to be of biological interest. In particular, we present the first algorithm which can efficiently find provably near-optimal alignments of highly dissimilar proteins with about two hundred amino acids. We also present a simple but effective heuristic for approximating all-to-all comparison on a large collection of structurally similar proteins. In addition, we make a detailed investigation of the sensitivity of the underlying LP to numerical round-off errors. The second part of this dissertation is an investigation of what is usually called the minimum-bends travelling-salesman problem; given a finite set of points, find a piecewise-linear tour through all these points, minimizing either the number of corners or the total angle of turn. This problem has been much less studied than most other elementary geometric-combinatorial questions, in spite of its wide variety of potential applications in robotics, sensor placement, and machining. Our approach here is less heuristic and more rigorous, with proofs of upper and lower bounds for a variety of instances. We have obtained considerable improvements over previous results in this area, and have found new evidence for a long-standing conjecture.
External Double Hashing with Choice
Authors: Walter A. Burkhard
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

A novel extension to external double hashing providing significant reduction to both successful and unsuccessful search lengths is presented. The experimental and analytical results demonstrate the reductions possible. This method does not restrict the hashing table configuration parameters and utilizes very little additional storage space per bucket. The runtime performance for insertion is slightly greater than for ordinary external double hashing.
64-bit versus 32-bit Virtual Machines for Java: Research Articles
Authors: Kris Venstermans, Lieven Eeckhout, Koen De Bosschere
Venue: Software&mdash;Practice Experience (2006)

The Java language is popular because of its platform independence, making it useful in a lot of technologies ranging from embedded devices to high-performance systems. The platform-independent property of Java, which is visible at the Java bytecode level, is only made possible thanks to the availability of a Virtual Machine (VM), which needs to be designed specifically for each underlying hardware platform. More specifically, the same Java bytecode should run properly on a 32-bit or a 64-bit VM. In this paper, we compare the behavioral characteristics of 32-bit and 64-bit VMs using a large set of Java benchmarks. This is done using the Jikes Research VM as well as the IBM JDK 1.4.0 production VM on a PowerPC-based IBM machine. By running the PowerPC machine in both 32-bit and 64-bit mode we are able to compare 32-bit and 64-bit VMs. We conclude that the space an object takes in the heap in 64-bit mode is 39.3&percnt; larger on average than in 32-bit mode. We identify three reasons for this: (i) the larger pointer size, (ii) the increased header and (iii) the increased alignment. The minimally required heap size is 51.1&percnt; larger on average in 64-bit than in 32-bit mode. From our experimental setup using hardware performance monitors, we observe that 64-bit computing typically results in a significantly larger number of data cache misses at all levels of the memory hierarchy. In addition, we observe that when a sufficiently large heap is available, the IBM JDK 1.4.0 VM is 1.7&percnt; slower on average in 64-bit mode than in 32-bit mode. Copyright &copy; 2005 John Wiley & Sons, Ltd.
A Hybrid Dialogue Strategy for Speech-enabled Mobile Commerce
Authors: Yandong Fan, Elizabeth A. Kendall
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Designing a dialogue strategy for speech-enabled mobile commerce is a significant challenge due to the context. This paper introduces a hybrid dialogue strategy to overcome the inflexibility of application-directed interactions while avoiding the significant recognition difficulty of a full mixed-initiative style. The system uses N-Gram grammars to govern the recognition at the request segment of a dialogue, and employs an application-directed strategy at the clarification discourse segment. The paper also details generating a corpus for the N-Gram grammar through a Case-Based Reasoning approach, and constructing application-directed dialogues with decision trees. Our preliminary testing indicates the strategy is a feasible and effective solution for voice-enabling mobile commerce applications.
Characteristics of Fault Diagnosis for Analog Circuits Based on Preset Test
Authors: Yukiya Miura
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

We have proposed a method for diagnosing analog circuits, which is realized by combining the operation-region model and the X-Y zoning method. In the method, since we developed a data processing method to handle data discretely, we cloud implement a diagnosis procedure based on the preset test which is a diagnostic method for digital circuits. In this paper, we analyze results of the proposed diagnosis method by changing several parameters for diagnosing a circuit and show their characteristics. Moreover, we propose a new data processing method to obtain a short diagnostic sequence length. We demonstrate the effectiveness of the proposed method by applying it to ITC'97 benchmark circuits with hard faults and soft faults.