ppxscal/embedding_network huggingface dataset:
Multi-issue negotiation processes by evolutionary simulation: validation and social extensions
Authors: E. H. Gerding, D. D.B. Bragt, J. A. L Poutre
Venue:  (2000)

We describe a system for automated bilateral negotiations in which artificial agents are evolved by an evolutionary algorithm. The negotiations are governed by a finite-horizon version of the alternating-offers protocol. Several issues are negotiated simultaneously and negotiations can be broken off with a pre-defined probability. In our experiments the bargaining agents have different preferences regarding the importance of the issues, which enables mutually beneficial outcomes. These optimal solutions are indeed discovered by the evolving agents. We also present an extended model of the evolving agents in which the agents use a ``fairness'''' norm in the negotiations. This concept plays an important role in real-life negotiations and experimental economics. In the implementation with fairness, agents also evaluate a potential agreement on its fairness and reject unfair proposals with a certain probability. In our model, re-evaluation can take place in each round or only if the deadline of the negotiations is reached. In both cases, fair outcomes can be obtained. When fairness is applied in each round, the results become much more robust and rather insensitive to the actual fairness function. To validate our system, the computational results are compared to game-theoretic (subgame perfect equilibrium) results. The influence of important model settings, like the probability of breakdown in negotiations, the length of the game, or the influence of fairness, as well as the proper settings of the EA parameters and their sensitivity are substantially investigated in this validation part.
String-Matching Cannot be Done by a Two-Head One-Way Deterministic Finite Automaton
Authors: Ming Li, Yaacov Yesha
Venue:  (1983)

We show that string-matching cannot be performed by a two-head one-way deterministic finite automaton (or even by a Turing machine with two one-way input heads and o(n) storage space). Thus we answer the special case $k=2$ of the open question, due to Galil and Seiferas [GS], whether a $k$-head one-way deterministic finite automaton can perform string-matching.
The Impact of Distributed Object Technology on Reengineering (Panel Session Introduction)
Authors: Scott R. Tilley
Venue: Proceedings of the International Conference on Software Maintenance (1997)

Distributed object technology is dramatically changing the nature and economics of reengineering in two important ways. The first is the new approach to reengineering that distributed object technology offers. Traditional reengineering is based on "deep" program understanding and reverse engineering. The cost/benefit ratio of this approach is staying the same in the face of new technologies such as CORBA, Java, and the Web. However, the benefits of "shallow" interface understanding and component wrapping using these technologies is rising rapidly relative to the replacement cost. The second impact is on reengineering of systems that are built using distributed objects. This paper introduces the panel on the impact of distributed object technology and reengineering. It includes the position statements from each of the four panel members: Hausi Muller, Kurt Wallnau, Harry Sneed, and Mike Olsem.
An Efficient Fault-Tolerant Scheduling Algorithm for Real-Time Tasks with Precedence Constraints in Heterogeneous Systems
Authors: Xiao Qin, Hong Jiang, David R. Swanson
Venue: Proceedings of the 2002 International Conference on Parallel Processing (2002)

In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provides more features and capabilities than existing algorithms that schedule only independent tasks in real-time homogeneous systems. In addition, the proposed algorithm takes the heterogeneities of computation, communication and reliability into account, thereby improving the reliability. To provide fault-tolerant capability, the algorithm employs a primary-backup copy scheme that enables the system to tolerate permanent failures in any single processor. In this scheme, a backup copy is allowed to overlap with other backup copies on the same processor, as long as their corresponding primary copies are allocated to different processors. Tasks are judiciously allocated to processors so as to reduce the schedule length as well as the reliability cost, defined to be the product of processor failure rate and task execution time. In addition, the time for detecting and handling of a permanent fault is incorporated into the scheduling scheme, thus making the algorithm more practical. To quantify the combined performance of fault-tolerance and schedulability, the performability measure is introduced. Compared with the existing scheduling algorithms in the literature, our scheduling algorithm achieves an average of 16.4% improvement in reliability and an average of 49.3% improvement in performability.
Validation of Sensor Alert Correlators
Authors: Joshua Haines, Dorene Kewley Ryder, Laura Tinnel, Stephen Taylor
Venue: IEEE Security and Privacy (2003)

The authors describe the first experimental validation of correlation systems with the goal of assessing the overall progress in the field. Their experiment set out to measure the collective ability of correlators to recognize cyber attacks and designate their targets.
METEOR: Exploring Model Elimination Theorem Proving
Authors: L O Astrachan
Venue:  (1992)

In this paper we describe the theorem prover {\small \sl METEOR} which is a high-performance Model Elimination prover running in sequential, parallel and distributed computing environments. {\small \sl METEOR} has a very high inference rate, but as is the case with better chess-playing programs speed alone is not sufficient when exploring large search spaces; intelligent search is necessary. We describe modifications to traditional iterative deepening search mechanisms whose implementation in {\small \sl METEOR} result in performance improvements of several orders of magnitude and that have permitted the discovery of proofs unobtainable by top-down Model Elimination provers.
Methods of Optimization Graph Problems Solution on the Basis of Genetic and Developmental Routines
Authors: Leonid A.. .. Gladkov, Irina A. Bolotskova
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

At a solution of different practical problems both of engineering, and economical nature the special place is occupied with optimization problems grounded on classic graph algorithms, such, for example, as minimization of intersections and constructing of flat piling of the graph, separation of internally and outwardly stable subsets, constructing the effective coloring problem of the graph, determination of cliques and cores of the graph etc.In the given paper the approach to a solution of a problem of constructing of flat piling, and also a problem of separation in the graph of internally stable (independent) subsets is introduced on the basis of methods of genetic looking up.Designed algorithms have a straight-line characteristic of temporary complication. For study GA the system of the test problems (benchmarks) was designed, intended for matching GA with other techniques and the uniqueness of capacities GA for problem solving of optimization is demonstrated.
Query word deletion prediction
Authors: Rosie Jones, Daniel C. Fain
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Web search query logs contain traces of users' search modifications. One strategy users employ is deleting terms, presumably to obtain greater coverage. It is useful to model and automate term deletion when arbitrary searches are conjunctively matched against a small hand constructed collection, such as a hand-built hierarchy, or collection of high-quality pages matched with key phrases. Queries with no matches can have words deleted till a match is obtained. We provide algorithms which perform substantially better than the baseline in predicting which word should be deleted from a reformulated query, for increasing query coverage in the context of web search on small high-quality collections.
Network Distributed Computing: Fitscapes and Fallacies
Authors: Max Goff
Venue:  (2003)

Networked distributed systems: Foundations, breakthroughs, and implications Building tomorrow's ubiquitous, pervasive networked computing systems Technologies, protocols, messaging, software, integration, collaboration, security, and more Avoiding the eight classic fallacies of distributed computing The role of XML, Web services, Spaces, Jini, and other key technologies Ten powerful megatrends driven by networked distributed computingNetworked distributed computing (NDC) systems are driving an ongoing technological revolution that has already spawned the Internet and will soon transform the world into one ubiquitous, pervasive "information field." In Network Distributed Computing: Fitscapes and Fallacies, Max K. Goff reviews the field's crucial challenges, state-of-the-art solutions, and breathtaking future. Goff covers both the "trees" and the "forest"-showing how NDC has evolved, where it's headed, and above all, what it all means. Building NDC "fitscapes": new frameworks that turbocharge innovation Leveraging Moore's Law, Gilder's Law, Metcalfe's Law, and the latest R and D advances Overcoming the eight classic fallacies of distributed computing Enhancing collaboration, security, and dependability in networked computing environments Integrating wired and wireless networks: key software challenges Messaging and communications protocols for distributed, interoperable systems The roles of XML, Web services, Spaces, Jini, and other key technologies NDC-driven megatrends: Semantic Web, global transparency, nanotech, robotics, and beyond
Performance testing of communication protocols for three-tier computing: results for ICA and X window protocols
Authors: D. C. Roberts, D. A. Grossman, O. Frieder, R. Bernstein, E. Bisfiop
Venue: Proceedings of the 6th International Conference on Computer Communications and Networks (1997)

We present the results of performance tests to compare two protocols for three-tier computing using the Windows NT operating system. Three-tier computing features a data server for stored databases (Tier 1), an application server that runs applications (Tier 2), and a simple client program that runs on desktop machines that presents the user interface (Tier 3). Three protocols are available to communicate between Tier 2 and 3: intelligence computer architecture (ICA) with and without data compression, and X Window. We measured the performance of the three protocols in a multi-user environment in which we simulated the workload imposed by typical users. We found that, for Microsoft Office 97 and Lotus Notes applications, the X Window protocol uses approximately twice the network bandwidth of ICA, without compression. We also found that compressed ICA generates roughly one third less network traffic than uncompressed ICA at a cost of 20% of additional processor utilization.
Querying Petrographic Descriptions in an Intelligent Database System
Authors: Cristina Paludo Santos
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper describes the query module of the Petrographer System. Petrographer is an Intelligent Database System that supports petrographic descriptions, diagenetic analysis and data management, using resources from expert systems and database technologies. Among the requirements of the application domain, includes to retrieve and to compare the information of an extends amount of rock sample. In this way, a query interface for the application that provides the refinement progressive of a query in the database has been defined. The querying process proposed allows the user to define selection expressions based on rock sample features and hence view the results. The interface supports the basic requirements of the application and consists in an relevant tool to the system.
CPN Modeling and Analysis of L2TP
Authors: Yongwei Wang, Shaowen Yao, Ying Zhao, Mingtian Zhou
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

L2TP is an important tunneling protocol in IP VPN. Coloured Petri Nets is a well- suited formal approach for modeling and analysis of network protocol. Upon the introduction to CPN and L2TP, hierarchical and timed CPN is used to create the model of L2TP. Then the Occurrence Graph is analyzed. With this model, we test the protocol behavior to verify its applicability andfeasibility. Moreover, we find an exception that L2TP did not define when tunnels are establishing concurrently and then give the solution. This model can also be referred forprogramming of L2TP.
Coordination of a heterogeneous coastal hydrodynamics application in Manifold
Authors: C. L. Blom, Farhad Arbab, S. Hummel, I. J.P. Elshof
Venue:  (1998)

In this paper we show how the coordination language Manifold can be used to control the interactions of multiple heterogeneous application programs. We use a concrete example from Delft Hydaulics, a consulting and research company which develops models of natural hydraulic systems (e.g., river flows, tidal currents, wave penetrations in harbours, etc.). These simulation programs accurately model water flow phenomena and are used for many places in the world. Often, however, a number of these programs need to be used in conjunction with each other to address more comprehensive problems. For example, the water level in the Rotterdam harbour is determined both by the behaviour of the North Sea and by the discharge of the rivers Rhine and Meuse. Instead of creating Unix shell scripts for each particular configuration of application programs, an executive program has been developed and implemented in Manifold that reads a configuration file and subsequently starts, interconnects and controls all relevant component programs.
Automatic Discovery of Scientific Laws in Observed Data by Asynchronous Parallel Evolutionary Algorithm
Authors: Yan Li, Zhuo Kang, Lishan Kang, Hongqing Cao, Pu Liu
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

How to discover high-level knowledge such as laws of natural science in observed dataautomatically is a very important and difficult task in scientific research.In this paper, high-level knowledge modeled by ordinary differential equations (ODEs) is discovered in observed dynamic data automatically by an asynchronous parallel evolutionary algorithm called AP-HEMA.Numerical example is used to demonstrate the potential of AP-HEMA.The results show that the dynamic models discovered automatically in observed dynamic data bycomputer sometimes can compare with the models discovered by human.
Efficient Deadlock Analysis of Clients/Server Systems with Two-Way Communication
Authors: Jun Zhou, Kou-chung Tai
Venue: Proceedings of the 12th International Symposium on Software Reliability Engineering (2001)

Deadlocks are a common type of faults in distributed programs.To detect deadlocks in a distributed program P one approach is to construct the reachability graph (RG) of P which contains all possible states of P Since the size of RG (P) is an exponential function of the number of processes in P the use of RGs for deadlock detection has limted success.In this paper, we show an efficient technique for deadlock analysis of client/server programs with two-way communication, where the server and clients ommunicate through channels supporting synchronous message-passing.We consider client/server programs in which the server saves the IDs of some lients for future communication.For such a program, we describe how to construct its abstract client/server reachability graph (ACSRG), which contains significantly less number of global states than the corresponding RG.One example is that for a solution to the gas station problem with one pump and six customers, its RGhas 25394 states and its ACSRG 74 states.We showthat the use of ACSRGs not only greatly reduces the effort for deadlock analysis but also provides a basis for proving freedom from deadlocks for any number of lients.
An effective Bayesian neural network classifier with a comparison study to support vector machine
Authors: Faming Liang
Venue: Neural Computation (2003)

We propose a new Bayesian neural network classifier, different from that commonly used in several respects, including the likelihood function, prior specification, and network structure. Under regularity conditions, we show that the decision boundary determined by the new classifier will converge to the true one. We also propose a systematic implementation for the new classifier. In our implementation, the tune of connection weights, the selection of hidden units, and the selection of input variables are unified by sampling from the joint posterior distribution of the network structure and connection weights. The numerical results show that the new classifier consistently outperforms the commonly used Bayesian neural network classifier and the support vector machine in terms of generalization performance. The reason for the inferiority of the commonly used Bayesian neural network classifier and the support vector machine is discussed at length.
Fast Mutual Exclusion for Uniprocessors
Authors: Brian N. Bershad, David D. Redell, John R. Ellis
Venue:  (1992)

In this paper we describe restartable atomic sequences, an optimistic mechanism for implementing simple atomic operations (such as Test-and-Set) on a uniprocessor. A thread that is suspended within a restartable atomic sequence is resumed by the operating system at the beginning of the sequence, rather than at the point of suspension. This guarantees that the thread eventually executes the sequence atomically. A restartable atomic sequence has significantly less overhead than other software-based synchronization mechanisms, such as kernel emulation or software reservation. Consequently, it is an attractive alternative for use on uniprocessors that do not support atomic operations. Even on processors that do support atomic operations in hardware, restartable atomic sequences can have lower overhead. We describe different implementations of restartable atomic sequences for the Mach 3.0 and Taos operating systems. These systems'' thread management packages rely on atomic operations to implement higher-level mutual exclusion facilities. We show that improving the performance of low-level atomic operations, and therefore mutual exclusion mechanisms, improves application performance.
Selection in Monotone Matrices and Computing $k^{th}$ Nearest Neighbors
Authors: K P Agarwal, Sandeep Sen
Venue:  (1994)

An $m \times n$ matrix $\cal A = (a_{ij})$, $1 \le i \le m$ and $1 \le j \le n$, is called a {\em totally monotone\/} matrix if for all $i_1, i_2, j_1, j_2$, satisfying $1 \le i_1 > i_2 \le m, 1 \le j_1 > j_2 \le n$, \[ a_{i_1j_1} > a_{i_1j_2} \Longrightarrow a_{i_2j_1} > a_{i_2j_2} \, . \] We present an $O((m+n)\sqrt{n}\log n)$ time algorithm to select the $k^{th}$ smallest item from an $m \times n$ totally monotone matrix for any $k \le mn$. This is the first subquadratic algorithm for selecting an item from a totally monotone matrix. Our method also yields an algorithm for {\em generalised row selection\/} in monotone matrices of the same time complexity. Given a set $S = \{ p_1, \ldots, p_n\}$ of $n$ points in convex position and a vector ${\bf k} = \{ k_1, \ldots, k_n \}$, we also present an $O(n^{4/3}\log^c n)$ algorithm to compute the $k_i^{th}$ nearest neighbor of $p_i$ for every $i \le n$; $c$ is an appropriate constant. This algorithm is considerably faster than the one based on a row-selection algorithm for monotone matrices. If the points of $S$ are arbitrary, then the $k_i^{th}$ nearest neighbor of $p_i$, for all $i \le n$, can be computed in time $O(n^{7/5} \log^c n)$, which also improves upon the previously best-known result.
Multi-hour, multi-traffic class network design for VP-based wide-area dynamically reconfigurable ATM networks
Authors: D. Medhi
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

The virtual path (VP) concept has been gaining attention in terms of effective deployment of ATM (asynchronous transfer mode) networks in recent years. In this paper, we discuss a multi-hour, multi-traffic class network (capacity) design model for providing specified quality-of-service in dynamically reconfigurable ATM networks. Our approach is based on statistical multiplexing of traffic within a traffic class by using a virtual path for the class and deterministic multiplexing of different virtual paths, and on providing dynamic bandwidth and reconfigurability through the virtual path concept depending on traffic load during the course of the day. We show that, for test problems based on realistic network data, our approach does between 6% to 20% better than a local shortest path heuristic in terms of network cost. We also show that considering network dynamism through variation of traffic during the course of a day by doing dynamic bandwidth and virtual path reconfiguration can save between 10% to 14% in network design costs compared to a static network based on maximum busy hour traffic.
Dependency Relations between Models in the Unified Process
Authors: Claudia Pons, Roxana Giandini, Gabriel Baum
Venue: Proceedings of the 10th International Workshop on Software Specification and Design (2000)

The goal of the Unified Process is to guide developers in efficiently implementing and deploying systems that meet customer needs. During the Unified Process, a variety of models of the system is developed. Not all these models are independent, but they are related to each other. Elements in one model have trace dependencies to other models; they are semantically overlapping and together represent the system as a whole. It is necessary to have a precise definition of the syntax and semantics of the different models and their relationships, since the lack of accuracy in their definition can lead to wrong model interpretations and inconsistency between models. In this paper, we distinguish three different kinds of dependency relations between models and propose a formal description of them. The goal of the proposed formalization is to provide formal foundations for tools that perform intelligent analysis on models expressed in UML assisting software engineers through the development process.
Restructuring Program Identifier Names
Authors: Bruno Caprile, Paolo Tonella
Venue: Proceedings of the International Conference on Software Maintenance (ICSM'00) (2000)

The identifiers chosen by programmers as entity names contain valuable information. They are often the starting point for the program understanding activities, especially when high-level views, like the call graph, are available.In this paper, an approach for the restructuring of program identifier names is proposed, aimed at improving their meaningfulness. It considers two forms of standardization, associated respectively to the lexicon of the composing terms and to the syntax of their arrangement. Automatic and semiautomatic techniques are described which can help the restructuring intervention. Their application to a real world case study is also presented.