ppxscal/embedding_network huggingface dataset:
An alternative time management mechanism for distributed simulations
Authors: Wentong Cai, Stephen J. Turner, Bu-Sung Lee, Junlan Zhou
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2005)

Over the past few years, there has been a keen interest in the management of time in distributed simulation environments. Previous emphasis in time management (TM) services has been based on time stamp ordering, which is both computation and bandwidth intensive. This article discusses an alternative approach to time management based on causal ordering. Traditional causal ordering protocols incur a large amount of communication overhead, which is generally of the order of N2 for a distributed system of N processes. A new causal ordering protocol proposed by the authors, the Modified Schiper-Eggli-Sandoz (MSES) protocol, is presented in this article. This new protocol minimizes the control information overhead of causal ordering by using the direct dependency tracking technique. The MSES protocol works well in both unicast and multicast environments, without relying on information about the underlying network topology and communication pattern among the processes of the distributed system. The MSES protocol has been successfully implemented as a middleware on top of DMSO RTI. Experiments have been conducted to benchmark the performance of the new time management mechanism with respect to the existing TM mechanisms available in DMSO RTI. The simulation scenarios of the experiments vary with different degrees of inter-federate dependency and federate event granularities. The ordering limitations of the causality based TM mechanism are addressed in this article and the trade-off of the degree of event ordering and execution speed of simulations is discussed.
Book review: Natural Language Generation in Artificial Intelligence and Computational Linguistics Edited by Cecile L. Paris, William R. Swartout, and William C. Mann (Kluwer Academic, Dordrecht,1990)
Venue: ACM SIGART Bulletin (1991)

This book is a selection of papers presented at the Fourth International Workshop on Natural Language Generation, held in Catalina, California in July of 1988. If there is a central theme to this compilation of articles, it is that natural language generators are no longer relatively straightforward, mechanistic translators which produce text from an internal representation language. Rather, state-of-the-art theories of generation look very much like theories of planning. Many analogies can be made between the generation process and hierarchical planning. The first level of planning in most systems corresponds to the selection of an overall discourse structure. As planning continues, lexical selection is analogous to the task of operator selection. Each lexical choice imposes constraints on the rest of the "plan" which restrict further choices.
Hierarchical Tournament Selection Genetic Algorithm for the Vehicle Routing Problem with Time Windows
Authors: Guilherme Bastos Alvarenga, Geraldo Robson Mateus
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known and complex combinatorial problem, which has received considerable attention in recent years. The VRPTW benchmark problems of Solomon (1987) have been most commonly chosen to evaluate and compare all exact and heuristic algorithms. A genetic algorithm and a set partitioning two phases approach has obtained competitive results in terms of total travel distance minimization. However, a great number of heuristics has used the number of vehicles as the first objective and travel distance as the second, subject to the first. This paper proposes a three phases approach considering both objectives. Initially, a hierarchical tournament selection genetic algorithm is applied. It can reach all best results in number of vehicles of the 56 Solomon's problems explored in the literature. After then, the two phase approach, the genetic and the set partitioning, is applied to minimize the travel distance as the second objective.
tranSticks: physically manipulatable virtual connections
Authors: Yuji Ayatsuka, Jun Rekimoto
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

A virtually connected medium called tranStick is described that functions both as a "virtual wire" and as a "memory card" containing a shared space. A user can connect two networked devices by simply placing one of a pair of tranSticks with the same identifier into each device. The tranSticks provide feedback indicating that the devices are connected; the connection to be closed or changed in the same way it would be if the devices were connected by a physical cable. A user can also access to a shared space on a network as if the space were in the tranStick. Since tranSticks contain long secret keys, the process of finding another tranStick with the same identifier can be encrypted. The tranStick approach differs from other approaches in that it provides feedback from the connection as well as serving as a medium for establishing a connection, and it enables disconnection and switchover to be done intuitively because the operations are reversible.
Web server QoS models: applying scheduling rules from production planning
Authors: Nong Ye, Esma S. Gel, Xueping Li, Toni Farley, Ying-Cheng Lai
Venue: Computers and Operations Research (2005)

Most web servers, in practical use, use a queuing policy based on the Best Effort model, which employs the first-in-first-out (FIFO) scheduling rule to prioritize web requests in a single queue. This model does not provide Quality of Service (QoS). In the Differentiated Services (DiffServ) model, separate queues are introduced to differentiate QoS for separate web requests with different priorities. This paper presents web server QoS models that use a single queue, along with scheduling rules from production planning in the manufacturing domain, to differentiate QoS for classes of web service requests with different priorities. These scheduling rules are Weighted Shortest Processing Time (WSPT), Apparent Tardiness Cost (ATC), and Earliest Due Date. We conduct simulation experiments and compare the QoS performance of these scheduling rules with the FIFO scheme used in the basic Best Effort model with only one queue, and the basic DiffServ model with two separate queues. Simulation results demonstrate better QoS performance using WSPT and ATC, especially when requested services exceed the capacity of a web server.
Direct approximation theorems for Dirichlet series in the norm of uniform convergence
Authors: Brigitte Forster
Venue: Journal of Approximation Theory (2005)

We consider functions f ∈ AC(D-) on a convex polygon D ⊂ C and their regularity in terms of Tamrazov's moduli of smoothness. Using the relation between Fourier and Leont'ev coefficients given in (CMFT 1(1) (2001) 193) we prove direct approximation theorems of Jackson type for the Dirichlet expansion f(z) ∼ Σλ ∈ Λ K f(λ)eλz/L'(λ), where L(z) = Σk=1Ndkeakz is a quasipolynomial with respect to the vertices a1 ..... aN of D and Λ its set of zeros. We show by an example that our results improve Mel'nik's estimates in (Ukrainian Math. J. 40(4) (1988) 382) on the rate of convergence.
A Minimal Solution for Relative Pose with Unknown Focal Length
Authors: Henrik Stewenius, David Nister, Fredrik Kahl, Frederik Schaffalitzky
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Assume that we have two perspective images with known intrinsic parameters except for an unknown common focal length. It is a minimally constrained problem to find the relative orientation between the two images given six corresponding points. We present an efficient solution to the problem and show that there are 15 solutions in general (including complex solutions). To the best of our knowledge this was a previously unsolved problem. The solutions are found through eigen-decomposition of a 15 × 15 matrix. The matrix itself is generated in closed form. We demonstrate through practical experiments that the algorithm is correct and numerically stable.
Misuse Case-Based Design and Analysis of Secure Software Architecture
Authors: Joshua J. Pauli, Dianxiang Xu
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper presents an approach to the architectural design and analysis of secure software systems based on the system requirements elicited in the form of use cases and misuse cases. We identify architectural components and their connections and analyze whether or not a candidate architecture can address security concerns. This provides a smooth transition from requirements specification to high-level design for engineering secure software systems, and greatly improves the traceability of security concerns, which allows a system developer to know what requirement an architectural component references back to. We demonstrate our approach through a case study on a security-intensive hospital information system.
A state machine for real-time cutting of tetrahedral meshes
Authors: D. Bielser, P. Glardon, M. Teschner, M. Gross
Venue: Graphical Models (2004)

We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the current cut tool position at every point in time. Tetrahedra are subdivided by using a progressive method, which inserts the required sub-structures step by step. A state machine tracks the topology of each tetrahedron and controls the progressive subdivision. In order to keep the state machine as small and clear as possible, each topological pattern of a tetrahedral intersection appears only once. These topological patterns are mapped onto the actual case of a tetrahedral intersection by some given transformation operations. The state transitions, which contain the specific subdivision operations, are described in a predefined lookup table, which is written in a simple script language. The handling of reverse movements and possible trembling of the users hand, as well as a recursive continuation of the state machine concept, complement the proposed algorithm. In three examples, covering free form modeling, volume visualization, and surgery simulation, we indicate the large field of applications in which our algorithm can be utilized.
Desynchronized Pfair Scheduling on Multiprocessors
Authors: UmaMaheswari C. Devi, James H. Anderson
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Pfair scheduling, currently the only known way of optimally scheduling recurrent real-time tasks on multiprocessors, imposes certain requirements that may limit its practical implementation. In this paper, we address one such limitation - which requires processor time to always be allocated in units of fixed-sized quanta that are synchronized across processors - and determine the impact of relaxing it. We show that if this requirement, which may lead to wasted processor time, is relaxed, then under an otherwiseoptimal Pfair scheduling algorithm deadlines are missed by at most one quantum only, which is sufficient to provide soft real-time guarantees. This result can be shown to extend to most prior work on Pfair scheduling: in general, tardiness bounds guaranteed by previously-proposed suboptimal Pfair algorithms are worsened by at most one quantum only.
The use of dynamic segment scoring for language-independent question answering
Authors: Daniel Pack, Clifford Weinstein
Venue: Proceedings of the first international conference on Human language technology research (2001)

This paper presents a novel language-independent question/answering (Q/A) system based on natural language processing techniques, shallow query understanding, dynamic sliding window techniques, and statistical proximity distribution matching techniques. The performance of the proposed system using the latest Text REtrieval Conference (TREC-8) data was comparable to results reported by the top TREC-8 contenders.
A robust open ascending-price multi-unit auction protocol against false-name bids
Authors: Atsushi Iwasaki, Makoto Yokoo, Kenji Terada
Venue: Decision Support Systems (2005)

This paper develops a new ascending-price multi-unit auction protocol that has the following characteristics: (i) it has an open format, and (ii) sincere bidding is an equilibrium strategy even if the marginal values of each agent can increase and agents can submit false-name bids. False-name bids are bids submitted under fictitious names such as multiple e-mail addresses, which can be done easily on the Internet. This is the first protocol that has both of these characteristics. Our simulation results indicate that the developed protocol obtains a social surplus close to Pareto efficient.
Maintenance of expert systems: life-cycle validity
Authors: John C. McCallum
Venue: Issue 94 (October 1985) (1985)

It is well known in the business computing community that program and data base maintenance are the largest component of the software system life cycle (Boehm, 1981). Little concern has been raised about the maintenance of knowledge bases of expert systems. The majority of interest in maintenance (which might be classified as being validity over the life cycle of the expert system (Mostow. 1985), and in the maintenance of consistency of a data base (Balzer et al. 1983). One commercial selling strategy of expert systems is that they do not change with time like human knowledge. A person who doesn't change with time however, is not necessarily an intelligent person. An expert system without maintenance is "an old fogey," unable to learn new things. In a preliminary study on now to implement a data base for critical evaluation of atomic and molecular data (Cann and Nicholls, 1980), it was decided to incorporate names of researchers, dates of data added as well as critical notes on methods and recommendations on results. The reasons for this were to be able to compare and update experimental data with time and with new experimental results. But, new results are not always better. Often, older values are obtained through more thorough study then some newer results. There are several different types of errors that can exist in data or knowledge bases.
Integration with Web Services
Authors: Steve Vinoski
Venue: IEEE Internet Computing (2003)

Middleware's success and proliferation has recreated¿at a higher level¿the very problem it was designed to address. Rather than having to deal with multiple different OSs, todayýs distributed-application developers face multiple middleware approaches. Indeed, middleware does provide the promised abstractions, but different approaches provide different types of abstractions. For example, those found in message-queuing systems are quite different from the ones in distributed object systems.
"SelfService": A Theoretical Protocol for Autonomic Distribution of Services in P2P Communities
Authors: Fabrice Saffre, Havard Rast Blok
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

In this paper, we present a theoretical protocol for autonomic distribution of services in a P2P environment, as well as the results of its simulated implementation. Our objective is to demonstrate that it is possible to obtain a distribution of the corresponding software modules that meets the requirement of the community in the absence of any centralized resource management. Instead, an acceptable balance between offer and demand is achieved via a simple "trial-and-error" mechanism, involving a simple, locally applied "reasoning" loop running independently on every peer.
MiSpider: a continuous agent on web pages
Authors: Yujiro Fukagaya, Tadachika Ozono, Takayuki Ito, Toramatsu Shintani
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we propose a Web based agent system called MiSpider, which provides intelligent web services on web browsers. MiSpider enables users to use agents on existing browsers. Users can use MiSpider all over the world only to access the Internet. MiSpider Agent has persistency, and agents condition doesn't change if users change a browsing page. Moreover, agents have a message passing skill to communicate among the agents.
Internet traffic classification using bayesian analysis techniques
Authors: Andrew W. Moore, Denis Zuev
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

Accurate traffic classification is of fundamental importance to numerous other network activities, from security monitoring to accounting, and from Quality of Service to providing operators with useful forecasts for long-term provisioning. We apply a Naïve Bayes estimator to categorize traffic by application. Uniquely, our work capitalizes on hand-classified network data, using it as input to a supervised Naïve Bayes estimator. In this paper we illustrate the high level of accuracy achievable with the \Naive Bayes estimator. We further illustrate the improved accuracy of refined variants of this estimator.Our results indicate that with the simplest of Naïve Bayes estimator we are able to achieve about 65% accuracy on per-flow classification and with two powerful refinements we can improve this value to better than 95%; this is a vast improvement over traditional techniques that achieve 50--70%. While our technique uses training data, with categories derived from packet-content, all of our training and testing was done using header-derived discriminators. We emphasize this as a powerful aspect of our approach: using samples of well-known traffic to allow the categorization of traffic using commonly available information alone.
Mitigating Risk of Data Loss in Preservation Environments
Authors: Reagan W. Moore, Joseph F. JaJa, Robert Chadduck
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

Preservation environments manage digital records for time periods that are much longer than that of a single vendor product. A primary requirement is the preservation of the authenticity and integrity of the digital records while simultaneously minimizing the cost of long-term storage, as the data is migrated onto successive generations of technology. The emergence of low-cost storage hardware has made it possible to implement innovative software systems that minimize risk of data loss and preserve authenticity and integrity. This paper describes software mechanisms in use in current persistent archives and presents an example based upon the NARA research prototype persistent archive.
Dynamic Load Distribution in the Borealis Stream Processor
Authors: Ying Xing, Stan Zdonik, Jeong-Hyon Hwang
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Distributed and parallel computing environments are becoming cheap and commonplace. The availability of large numbers of CPUýs makes it possible to process more data at higher speeds. Stream-processing systems are also becoming more important, as broad classes of applications require results in real-time. Since load can vary in unpredictable ways, exploiting the abundant processor cycles requires effective dynamic load distribution techniques. Although load distribution has been extensively studied for the traditional pull-based systems, it has not yet been fully studied in the context of push-based continuous query processing. In this paper, we present a correlation based load distribution algorithm that aims at avoiding overload and minimizing end-to-end latency by minimizing load variance and maximizing load correlation. While finding the optimal solution for such a problem is NP-hard, our greedy algorithm can find reasonable solutions in polynomial time. We present both a global algorithm for initial load distribution and a pair-wise algorithm for dynamic load migration.
The astrophysics simulation collaboratory portal: a framework for effective distributed research
Authors: Ruxandra Bondarescu, Gabrielle Allen, Gregory Daues, Ian Kelley, Michael Russell, Edward Seidel, John Shalf, Malcolm Tobias
Venue: Future Generation Computer Systems (2005)

We describe the Astrophysics Simulation Collaboratory (ASC) Portal, a collaborative environment in which distributed projects can perform research. The ASC project seeks to provide a web-based problem solving framework for the astrophysics community to harness Computational Grids. To facilitate collaboration amongst distributed researchers within a virtual organization, the ASC Portal supplies specialized tools for the management of large-scale numerical simulations and the resources on which they are performed. The ASC virtual organization uses the Cactus framework for studying numerical relativity and astrophysics phenomena. We describe the architecture of the ASC Portal and present its components with emphasis on elements related to the Cactus framework.
Computer Simulation of 3-D Liquid Transport in Fibrous Materials
Authors: D. Lukas, V. Soukupova, N. Pan, D. V. Parikh
Venue: Simulation (2004)

Liquid movement in 3-D fibrous materials is studied in this article by means of Monte Carlo simulation based on the Ising model with so-called Kawasaki kinetics. Computer simulation algorithms are then developed in accordance with the standard liquid wicking rate tests from both EDANA and INDA, and the simulation results provide information of liquid wicked into computer-generated fiber assemblies as a function of time. The work focuses mainly on the relationship between fiber orientation and the liquid wicking rate, while other geometrical parameters of the fiber mass remain fixed. Furthermore, this simulation also presents dynamic data of both liquid mass uptake and energy changes of the system. The results are in agreement with known experimental evidence.
Team game programming assignment
Authors: Jim McKeown
Venue: Journal of Computing Sciences in Colleges (2004)

Students in the Advanced Visual Basic Programming course must complete a group project to develop a computer game. While the topic does not fit exactly in a business programming course, for the students it is a good exercise in software development. Students enjoy the game aspect and the development, but from a learning perspective, the development process is more valuable. Most of the work and development must be completed on their own. They work as a team and become responsible, not only to themselves, but to the other members of the team as well. The students work in teams of three for the project. Student ideas for a computer game are submitted in advance. The games can range from simple card games like Solitaire and Black Jack, to parlor games like 3-D Tic-Tac-Toe and Chutes and Ladders, to games of chance like Craps and Roulette. The programs must have online help screens available, storage for winners and scores and an option to play against the computer. Each student writes a proposal and a description of the game they would like to program. Students teams are drawn randomly and the student projects are selected randomly from the proposals submitted for that group. From there, one team member writes a complete set of rules for the game. Another writes the requirements for the program and a third creates the algorithm for the program. Each then critiques the work of the other team members and they submit their plan for approval. Once approved the group develops their software. Each team member must log their share of work on the project and each team member rates the other team members. The projects are scored and the students are graded.