ppxscal/embedding_network huggingface dataset:
Age of Mythology: Sybex Official Strategies and Secrets, 1 edition
Authors: Doug Radcliffe, Chris Rupp
Venue:  (2002)

:Obliterate foes with Greek God Zeus's Bolt, turn enemy fortifications into rubble with a flick of Norse God Heimdall's hand, and banish enemies to the far side of the world with Egyptian God Ptah. Age of Mythology introduces fascinating new strategic dimensions to the world's best-selling real-time-strategy game series, and this exclusive guide will help you master the mythological mayhem. Written with the full support of Ensemble Studios and Microsoft, this ultra-detailed guide is packed with the strategies, tactics, and analysis you need to become an expert Age player. Inside you'll find: Hardcore, advanced multiplayer strategies straight from Ensemble Studios' best players Thorough analysis of each culture, including military units, Major and Lesser Gods, and their powers In-depth stats for everything in the game Step-by-step walkthrough of the incredible campaign Detailed economic and military strategies so you can build a thriving economy and survive in combat About the AuthorDoug Radcliffe has been a gamer since the days of the Atari 2600. He's written over a dozen strategy guides, including Age of Empires II: The Conquerors Expansion Official Strategies and Secrets and Dungeon Siege: Sybex Official Strategies and Secrets.
Submicron Systems Architecture
Authors: Charles L. Seitz, Alain J. Martin, Jan L. A. Van de Snepscheut
Venue:  (1993)

No abstract available.
Pre-Allocating Control Bandwidth in an Optical Interconnection Network
Authors: Charles Salisbury, Rami Melhem
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

To fully exploit the performance of optics in parallel processor interconnection networks, the connections must be entirely optical. This requires the use of circuit switching. Techniques such as time division multiplexing (TDM) can be used to provide a large number of circuits without the need for program directed control operations.We describe two protocols for dynamically establishing circuits in an interconnection network. We show how TDM can be used to multiplex communication for data and control purposes together in a single optical network. We explore the ability of the protocols and TDM to exploit locality in the communication pattern to improve performance.
Incorporating Update Rates into Today''s Graphics Systems
Authors: Matthias M. Wloka
Venue:  (1993)

Interactive animation systems and virtual environments incorporate dynamic objects. To display dynamic behavior in a sequence of discrete frames, graphics systems reinquire these dynamic objects every time before a new frame is rendered, thus implicitly implementing update rates. We propose explicitly to associate update rates with every dynamic primitive in a graphics system and let the user control each update rate individually. This approach has many benefits; for example, it yields more efficient systems, allows tradeoffs between computation quality versus computation speed, and eases multimedia integration. However, it also poses new problems to the graphics system designer, e.g., how to specify and incorporate update rates, how to compute update rate defaults, how to determine good update rate operators, and how to degrade update rates. We address these problems in this paper.
Maximum Apache Security
Authors: Anonymous
Venue:  (2002)

:Many of the high-profile attacks on prominent Web sites of the last couple years are a direct result of poor Web site or Web application security. With more than 65 percent of Web sites using the Apache Web server and the Apache-based open source Web development environment and with the risk of sabotage greater than ever Apache administrators and developers need to know how to build and maintain secure Web servers and Web applications. Yet most of the currently available Apache books lack detailed information on important Web administration topics like security.Maximum Apache Security details the complex security weaknesses and risks of Apache, and provides hands-on solutions for keeping a Web site secure and buttressed against intruders. It includes up-to-date coverage of both Apache 2.0 as well as Apache 1.3.
Integration Constraints in Parametric Design of Physical Objects
Authors: Alberto Paoluzzi
Venue:  (1987)

Design by constraint is a powerful approach to improve CAD systems and designer productivity. This paper addresses the topic of incorporating integration constraints concerning object mass and inertia in a CAD system. Two classes of generic objects are discussed that contain affine and conformal images of a given solid, usually derived from the initial design solution. Domain-derivatives are partial derivatives needed to solve the existence problem of an object instance satisfying all constraints and, eventually, to find an optimal design solution. In the paper, it is shown that these derivatives are closely linked to the topology of the solid. They are symbolically expressable as integrals over domains having a lower geometrical dimension than the original solid.
A Theory for Memory-Based Learning
Authors: Jyh Lin, Jeffrey S Vitter
Venue:  (1992)

A memory-based learning system is an extended memory management system that decomposes the input space either statically or dynamically into subregions for the purpose of storing and retrieving functional information. The main generalization techniques employed by memory-based learning systems are the nearest-neighbor search, space decomposition techniques, and clustering. Research on memory-based learning is still in its early stage. In particular, there are very few rigorous theoretical results regarding memory requirement, sample size, expected performance, and computational complexity. In this paper, we propose a model for memory-based learning and use it to analyze several methods---$\epsilon$-covering, hashing, clustering, tree-structured clustering, and receptive-fields---for learning smooth functions. The sample size and system complexity are derived for each method. Our model is built upon the generalized PAC learning model of Haussler and is closely related to the method of vector quantization in data compression. Our main result is that we can build memory-based learning systems using new clustering algorithms of Lin and Vitter to PAC-learn in polynomial time using only polynomial storage in typical situations. Keywords: Memory-based learning, PAC learning, clustering, approximation, linear programming, relaxation, covering, hashing.
An inequality for polymatroid functions and its applications
Authors: Boros Endre, Elbassioni Khaled, Gurvich Vladimir, Khachiyan Leonid
Venue:  (2001)

An integral-valued set function $f:2^V \mapsto \ZZ$ is called polymatroid if it is submodular, non-decreasing, and $f(\emptyset)=0$. Given a polymatroid function $f$ and an integer threshold $t\geq 1$, let $\alpha=\alpha(f,t)$ denote the number of maximal sets $X \subseteq V$ satisfying $f(X) > t$, let $\beta=\beta(f,t)$ be the number of minimal sets $X \subseteq V $ for which $f(X) \ge t$, and let $n=|V|$. We show that if $\beta \ge 2$ then $\alpha \le \beta^{(\log t)/c}$, where $c=c(n,\beta)$ is the unique positive root of the equation $1=2^c(n^{c/\log\beta}-1)$. In particular, our bound implies that $\alpha \le (n\beta)^{\log t}$ for all $\beta \ge 1$. We also give examples of polymatroid functions with arbitrarily large $t, n, \alpha$ and $\beta$ for which $\alpha \ge \beta^{(.551 \log t)/c}$. More generally, given a polymatroid function $f:2^V \mapsto \ZZ$ and an integral threshold $t \ge 1$, consider an arbitrary hypergraph $\cH$ such that $|\cH| \ge 2$ and $f(H) \ge t$ for all $H \in \cH$. Let $\cS$ be the family of all maximal independent sets $X$ of $\cH$ for which $f(X) > t$. Then $|\cS| \leq |\cH|^{(\log t)/c(n,|\cH|)}$. As an application, we show that given a system of polymatroid inequalities $f_1(X) \ge t_1,\ldots,f_m(X) \ge t_m$ with quasi-polynomially bounded right hand sides $t_1,\ldots,t_m$, all minimal feasible solutions to this system can be generated in incremental quasi-polynomial time. In contrast to this result, the generation of all maximal infeasible sets is an NP-hard problem for many polymatroid inequalities of small range.
Pricing and Fee Sharing for Point to Multipoint and Quality Guaranteed Multicast Services
Authors: Chian-Chi Liu, Shi-Chung Chang, Hsin-Ho Cheng
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

In this paper, the pricing of point to multipoint (PTMP) and quality guaranteed multicast services are investigated. We propose a two-phase, usage-based charging scheme. In phase 1, QoS requirements are converted into bandwidth reservation requirements based on the effective bandwidth theory. Exploiting an empirical model of the relationship between unicast and multicast services, the charging scheme approximates a PTMP multicast session as an aggregated unicast. The incentive compatible unicast charging scheme of Kelly, 1997, is then extended to the multicast case. Phase 2 conducts fair fee allocation among individual multicast users. The fee sharing is proportional to individual members' resource requirements should a unicast service be used. It not only has the fair and reasonable properties of ¿equal charge for the same service level,¿¿a higher charge for a better service level,¿ and ¿a higher member-charge under a higher group cost,¿ but also is feasible for implementation under current technological constraints.
Simple Programs on Strings and Their Decision Problems
Authors: Giorgio Ausiello
Venue:  (1975)

Classes of simple programs operating on srings are considered. Their power as acceptors and their power as generation devices are compared and consequences on upper bounds and lower bounds for several decision problems are derived. It is shown that even for such a small class of programs some problems are undecidable.
Enhancing Domain-Specific Software Architecture Recovery
Authors: Igor Ivkovic, Michael Godfrey
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Performing software rchitecture analysis and recovery on large software system is expensive and time consuming; when it is done at all, it is often performed within narrow context, focused on few areas of particular concern. However, for long-lived system within well understood application domain, the costs for performing detailed architecture recovery may be amortized over several generations of the system; the resulting models can also be broadened and put into context by incorporating information about the history and anticipated future evolution of both the application and its underlying domain.This paper proposes systematic approach for organizing application domain knowledge into unified structure called the Architectural Dom in Assets Set (ADAS). The ADAS structure builds on previous research, as well as our experience in performing an architecture recovery of IBM's DB2. Our initial experiences in using ADAS suggest that it brings needed focus to the recovery process and provides assistance to domain-specific architecture recovery.
The Principles of Networks Designing of Medical Establishments
Authors: Vadim L. Sakharov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

This paper is devoted to the decision of the problems of automation or informatization of the medical and prophylactic establishments. The main layouts of the automation process are shown. The medical establishment's computer networks optimization by usage a graph model is representing. The main principles and algorithm of the network optimization with the usage of partitioning based on modified fractals aggregation is described. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
ENWRICH: A Compute-Processor Write Caching Scheme for Parallel File Systems
Authors: Apratim Purakayastha, Schlatter C Ellis, David Kotz
Venue:  (1995)

Many parallel scientific applications need high-performance I/O. Unfortunately, end-to-end parallel-I/O performance has not been able to keep up with substantial improvements in parallel-I/O hardware because of poor parallel file-system software. Many radical changes, both at the interface level and the implementation level, have recently been proposed. One such proposed interface is {\em collective I/O}, which allows parallel jobs to request transfer of large contiguous objects in a single request, thereby preserving useful semantic information that would otherwise be lost if the transfer were expressed as per-processor non-contiguous requests. Kotz has proposed {\em disk-directed I/O} as an efficient implementation technique for collective-I/O operations, where the compute processors make a single collective data-transfer request, and the I/O processors thereafter take full control of the actual data transfer, exploiting their detailed knowledge of the disk-layout to attain substantially improved performance. Recent parallel file-system usage studies show that writes to write-only files are a dominant part of the workload. Therefore, optimizing writes could have a significant impact on overall performance. In this paper, we propose ENWRICH, a compute-processor write-caching scheme for write-only files in parallel file systems. ENWRICH combines low-overhead write caching at the compute processors with high performance disk-directed I/O at the I/O processors to achieve both low latency and high bandwidth. This combination facilitates the use of the powerful disk-directed I/O technique independent of any particular choice of interface. By collecting writes over many files and applications, ENWRICH lets the I/O processors optimize disk I/O over a large pool of requests. We evaluate our design via simulated implementation and show that ENWRICH achieves high performance for various configurations and workloads.
Computing the Singular Value Decomposition on the Illiac IV
Authors: Franklin T. Luk
Venue:  (1980)

In this paper, we study the computation of the singular value decomposition of a matrix on the ILLIAC IV computer. We describe the architecture of the machine and explain why the standard Golub-Reinsch algorithm is not applicable to this problem. We then present a one-sided orthogonalization method which makes very efficient use of the parallel computing abilities of the ILLIAC machine. Our method is shown to be Jacobi-like and numerically stable. Finally, a comparison of our method on the ILLIAC IV computer with the Golub-Reinsch algorithm on a conventional machine demonstrates the great potential of parallel computers in the important area of matrix computations. Key Words and Phrases: ILLIAC IV computer, singular value decomposition, Golub-Reinsch algorithm, Jacobi-like method, parallel matrix computations.
Statistical estimation of Poisson intensity functions
Authors: Roelof Helmers, I. W. Mangku
Venue:  (1999)

This survey paper is concerned with nonparametric estimation of the global and local intensity of a cyclic Poisson point process $X$. We assume that only a single realization of $X$ is observed, though only within a bounded ''window'', and our aim is to estimate consistently the global intensity and the intensity function at a given point. A simple nonparametric estimator for the global intensity is proposed and studied. We also give a preview of recent work by the present authors, in part joint with R. Zitikis (Winnipeg), on nonparametric estimation of the local intensity at a given point.
Natural Language Understanding with the Generality Feedback
Authors: Galitsky Boris
Venue:  (1999)

This study addresses the problem of improving the quality of natural language (NL) understanding by means of the involvement of the additional criterion of correct formal representation of the input inquiry. This criterion is based on the logical compatibility between the input inquiry, translated into the formal language, and the domain, encoded in the same language. Inquiry generality is measured as a normalized number of object tuples, which deliver the translation satisfaction for a given domain. Computational experiments in various domains show that the certain diapason of generality indicates the proper translation. Specific heuristics are developed for the transformation of the translation formula to improve the value of the generality criterion. Usually, if the generality is too high (there is a large number of the tuples of objects) then the semantic analyzer has likely ignored some syntactic constraints for the translation formula. On the contrary, when the generality is too low (there is no object tuples, satisfying the translation), then the semantic analyzer has likely introduced too many syntactic constraints, and some of them have to be eliminated. Generality criterion helps in the frequent situations, where the morphological and syntactic processing is insufficient for the construction of the proper inquiry translation into the formal language. Our approach is based on the experimentally verified fact that the user poses inquiries with the reasonable generality. This knowledge helps us to improve the semantic analysis to function in the flexible and expandable domains, where the lexical information is rather limited. Compatibility feedback by means of generality control poses the specific requirements to the formal language of inquiry translation and domain knowledge representation. The semantic processor is implemented as a logical program with metalanguage support to present the complex semantic rules. Suggested approach allowed us to build the NL understanding system with high inquiry complexity, involving up to 3-4 concepts.
Experiments in Knowledge Refinement for a Large Rule-Based System
Authors: Wilson A. Harvey, Milind Tambe
Venue:  (1993)

Knowledge-refinement is a central problem in the field of expert systems. For rule-based systems, refinement implies the addition, deletion and modification of rules in the system so as to improve the system''s overall performance. The goal of this research effort is to understand the methodology for refining large rule-based systems, as well as to develop tools that will be useful in refining such systems. The vehicle for our investigation is Spam, a production system (rule-based system) for the interpretation of aerial imagery. Complex and compute-intensive systems like Spam impose some unique constraints on knowledge refinement. More specifically, the credit/blame assignment problem for locating pieces of knowledge to refine becomes difficult. Given that constraint, we approach the problem in a bottom-up fashion, i.e., begin by refining portions of Spam''s knowledge base, and then attempt to understand the interactions between them. We begin by identifying gaps and/or faults in the knowledge base by comparing spam''s intermediate output to that of an expert, then modifying the knowledge base so that the system''s output more accurately matches the expert''s output. While this approach leads to some improvements, it also raises some interesting issues concerning the evaluation of refined knowledge at intermediate levels and of interaction between the refinements. This paper presents our initial efforts toward addressing these issues.
Decompilation of Binary Programs
Authors: Cristina Cifuentes, K J Gough
Venue:  (1994)

The structure of a decompiler is presented, along with a thorough description of the different modules that form part of a decompiler, and the type of analyses that are performed on the machine code to regenerate high-level language code. The phases of the decompiler have been grouped into three main modules: front-end, universal decompiling machine, and back-end. The front-end is a machine dependent module that performs the loading, parsing and semantic analysis of the input program, as well as generating an intermediate representation of the program. The universal decompiling machine is a machine and language independent module that performs data and control flow analysis of the program based on the intermediate representation, and the program''s control flow graph. The back-end is a language dependent module that deals with the details of the target high-level language.
A Survey on the Software Maintenance Process
Authors: Maria Joao Sousa
Venue: Proceedings of the International Conference on Software Maintenance (1998)

This research paper presents the results of a field survey for the characterisation of Software Maintenance Process in Portugal.It was concluded that the three biggest problems related to the Software Maintenance Process are: the lack of software maintenance process models, the lack of documentation of applications and the lack of time to satisfy the requests.Only 2,7% of the people who answered the questionnaire consider the software maintenance process very efficient; 70,2% consider it of a very low level of efficiency.
Cooperation Structure of Multi-Agent and Algorithms
Authors: Li Changhong, Li Minqiang, Kou Jisong
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Cooperation is the fundamental characteristic of multi-agent system and, cooperation structure is central to the study of multi-agent cooperation. At present, all the previous studies focus on the description to the negotiation, the conflict, the benefit distribution, the cooperation process and the cooperation evolution with game theory or multi-modal theory and, very little is known about the analysis of the multi-agent cooperation structure. Two kinds of multi-agent cooperation structures were provided in literature [6]: the complete cooperation structure and the incomplete structure, but the objective exchanging and the number of both sides wereneglected. This paper begins with an introduction of the current status of research on the multi-agent cooperation and definition of multi-agent cooperation, then sixteen cooperation structures are provided according to the three dimensions, whether cooperation is complete, whether the objective exchanging of both sides exists, and the number of both sides. Furthermore, a set of communication primitives is designed for multi-agent cooperation. Finally, algorithms of realizing the cooperation structures that presented in this paper were described.
Verification and diagnosis of testing equivalence and reduction relation
Authors: Z. P. Tao, G. von Bochmann, R. Dssouli
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

In protocol engineering, a common approach for system design and implementation is to verify if an implementation specification (or any lower level specification) satisfies its service specification. If an implementation specification does not satisfy its service specification, it is necessary to find out the faults and correct them. In this paper, we present an efficient algorithm for verifying whether an implementation satisfies its service specification related by the testing equivalence and the reduction relation, and generating diagnostic information if an implementation does not satisfy its service specification, based on the transformation of the service specification into a special deterministic machine, called refusal graph, and the coupled product of the refusal graph and the implementation