ppxscal/embedding_network huggingface dataset:
The Book of Overclocking: Tweak Your PC to Unleash Its Power
Authors: Scott Wainner, Robert Richmond
Venue:  (2003)

:THE BOOK OF OVERCLOCKING is the definitive guide to the art of running a PC's processor faster than the manufacturer intended. This book explains the entire overclocking process, for PC enthusiasts who don't mind voiding the manufacturer's warranty. Readers learn how not to fry their systems while pushing the speed on everything from the Pentium II to the latest Athlon XP and Pentium 4 processors. Entire sections on cooling, troubleshooting, and benchmarking make sure readers will get the most out of their machines.
Some constacyclic codes over Z2k and binary quasi-cyclic codes
Authors: H. Tapia-Recillas, G. Vega
Venue: Discrete Applied Mathematics (2003)

The concept of negacyclic code was recently introduced in Wolfmann (IEEE Trans. Inform. Theory 45 (1999) 2527-2532), in which some relations between the negacyclic codes and their Gray map images are proved. In this note, for k ≥ 1 an isometry φk between codes over Z2k+1 and codes over Z4 is introduced and used to give a generalization of the Gray map equivalent to the one given in Carlet (IEEE Trans. Inform. Theory 44 (1998) 1543-1547). Furthermore, by means of this isometry, the concept of negacyclic codes is extended to codes over the ring Z2k+1, obtaining a class of constacyclic codes referred to as hpo-cyclic codes (half plus one-cyclic codes). A characterization of these codes in terms of their images under φk is given. It is also proved that the generalized Gray map image of an hpo-cyclic code is a binary distance invariant (not necessarily linear) quasi-cyclic code. Finally, some linear hpo-cyclic codes are discussed and a few examples are given.
Object oriented network operation, administration and management
Authors: C. Kroll
Venue: Proceedings of the IEEE Symposium on Computers and Communications (ISCC'95) (1995)

The rapid increase of communication networks complexity force to the need of a common information pool for network operation, administration and management. Siemens Austria developed a network management information system in cooperation and under supervision of ESA. The resulting system based on object oriented techniques provides a powerful tool for network control and coordination in every day use. This paper focuses on the design and implementation process of the project.
Finding a maximum stable set in pentagraphs
Authors: Zverovich I. E., Zverovich I. I.
Venue:  (2001)

Penta is the configuration shown in Figure 1(a), where continuous lines represent edges and dotted lines represent non-edges. The vertex $u$ in Figure 1(a) is called the center of Penta. A graph $G$ is called a pentagraph if every induced subgraph $H$ of $G$ has a vertex $v$ which is not a center of induced Penta in $H$. The class of pentagraphs is a common generalization of chordal (triangulated) graphs and Mahadev graphs. We construct a polynomial-time algorithm that either find a maximum stable set of $G$ or concludes that $G$ is not a pentagraph.
On the symbiosis of a data mining environment and a DBMS
Authors: Martin L. Kersten, Marcel Holsheimer
Venue:  (1995)

One of the main obstacles in applying data mining techniques to large, real-world databases is the lack of efficient data management. In this paper, we outline a two-level architecture, consisting of a mining tool and a database server. Key elements in its success are a clear separation of concerns: the mining tool organizes and controls the search process, while all data-handling is performed by the parallel main memory DBMS. Data is stored as a set of binary tables. The interaction consists of queries for statistical information. Properties of the DBMS and the search algorithm are exploited for optimization of the data handling. In particular, results of previous computations are re-used, and I/O activity is reduced by keeping a small hot-set of binary tables in main-memory. As test results show, this system handles large datasets at a competitive performance.
Configurable and Networked Web-Based Vertical Applications
Authors: David C. Ni, S. Ni
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

As Network and Mobile Computing technologies evolving, the enterprise applications are alsoexpanded to web-based platforms facilitated by these enabling technologies. The progress isfurther propelled by large-scale e-Commerce activities such as B2C (Business-to-Consume)and B2B (Business-to-Business) applications. This paper proposes the use of observations and models of brain development in the early childhood for e-Commerce and WWW growthmodels, particularly for B2C and B2B activities. Biological models enlighten the effectiveness of business cluster models. Based on these models, we propose a configurable and networked architecture and present a cost-effective implementation for supporting businesscollaboration by emerging Internet frameworks and AI technologies such as rule-based systems and neural networks.
Expectation: the logic of flexible motivation
Authors: Bình Vu Trân, James Harland, Margaret Hamilton
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

The notion of goals, which tend to have strong properties (e.g. goals should be consistent, feasible, not yet achieved, etc.) has received more attention than other motivational notions such as desires. Desires seem more applicable in a multi-agent setting since an agent may cooperate with other agents without an explicitly agreed goal, but cannot act purely independently. However, the connection between desires and real world actions is not formally described. In this work, we introduce the notion of expectation in order to address these problems. A formalism is developed to describe the association of expectations and observations as well as how expectations could drive future observations.
Legends of Wrestling 2
Venue:  (2002)

:Don't Go Into the Ring Unprepared ·In-depth statistics, hints, game play tips and strategies. ·Complete cheat information for unlocking all hidden wrestlers, arenas, and other special features. ·Comprehensive bios of all 66 legends. ·A special introduction by Hulk Hogan and chapter intros by Rowdy Roddy Piper, "Big Poppa Pump" Scott Steiner, Jerry "The King" Lawler and Bruno Sammartino. ·Complete moves sets for each and every legend. ·Detailed explanation and strategies for implementing the exclusive ISP (Intermediate Start Position) control system. ·Strategies and tips for mastering all game modes and match types. ·Complete walkthrough of the new Shop Mode including how best to spend and gamble your money to earn special rewards and unlock secret items.Hulk Hogan, Andre the Giant, Rowdy Roddy Piper, Bret "Hitman" Hart, Bruno Sammartino, Scott Steiner, Sid Vicious, Jerry "The King" Lawler, Owen Hart, Big John Studd, just a few of the greatest wrestling legends of all-time.Legends of WrestlingTM 2 brings together 66 of professional wrestling’s top headliners for over-the-top, knockdown, drag-out, in-your-face mayhem.This official Legends of WrestlingTM 2 strategy guide supplies you with all the hints, tips and strategies you'll need to battle the best wrestlers the squared circle has ever seen. 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
A System for Document Reuse
Authors: D. Barta, J. Gil
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

The paper is concerned with issues and methods for reusing document pieces in the process of constructing other document. Asserting that the practice of reuse deserves a central role in the process of document creation, the authors present a document reuse model (DRM) that captures the essential aspects of document reuse. In order to explore and demonstrate the basic functions necessary to implement the model, they build a prototype for the System for Document Reuse (SDR), and use it in constructing actual documents, including this paper. The core idea is that if one can find a good enough reuse model and implement a prototypical system that demonstrates its principles, then one can suggest a shift of focus in the traditional authoring habits for many kinds of documents. That is, from the beginning an author will be writing for reuse, and will be constructing document pieces as the main activity, as opposed to just writing the single document that is needed for now. The model presents the concept of a reuse library, that contains previously written material about some knowledge domain. For the purpose of reuse, the material is divided into independently managed document pieces that are linked to one another. A writer constructs new documents by reusing document pieces from the library and by writing new material that also goes into the library. SDR enables the writer to create, catalog, retrieve, manipulate and link document pieces. As a test of the ideas presented, the tool was used to write this paper, a software maintenance manual, and a seminar, based on the same material. This experience enabled us to explore and understand document reuse, and find better ways to reuse existing material.
Tallorad usability engineering methods and tools
Authors: Johann Schrammel, Verena Giller
Venue: Proceedings of the 1st European UPA conference on European usability professionals association conference - Volume 3 (2002)

Learn an approach to enhancing and accelerating professional usebility consulting through the support of Innovative methods and tools. Examples are presented to demonstrate the concept, show the benefits, and provide experiences from real-life-usage.
Design and Evaluation of A Submesh Allocation Scheme for Two-Dimensional Mesh-Connected Parallel Computers
Authors: J. Morris Chang
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

This paper presents the design and evaluation of a novel submesh allocation algorithm called the Optimized Buddy System which is derived from conventional binary buddy system. Our scheme is made feasible by using a bit-map to represent the status of the processors. The proposed scheme can be mapped into hardware directly to take the advantage of the speed of a pure combinational-logic implementation. Although the buddy system may allocate a submesh that is much larger than the requested size, the logic that finds a free submesh can be augmented by a "bit-flipper" to relinquish the unused portion at the end of the submesh. This effectively eliminates internal fragmentation. The hardware complexity of proposed scheme (i.e. and-gate tree, or-gate ree and bit-flipper) is O(m x n), where m x n is the total number of the processors. The unique blind spot issue of proposed system is also investigated. Simulation results show that the allocation efficiency of the proposed scheme is similar to the one that uses best-fit approach.
On the Complexity of Reasoning in Kleene Algebra
Authors: Dexter Kozen
Venue:  (1997)

We study the complexity of reasoning in Kleene algebra and *-continuous Kleene algebra in the presence of extra equational assumptions $E$; that is, the complexity of deciding the validity of universal Horn formulas $E\imp s=t$, where $E$ is a finite set of equations. We obtain various levels of complexity based on the form of the assumptions $E$. Our main results are: for *-continuous Kleene algebra, \begin{itemize} \item if $E$ contains only commutativity assumptions $pq=qp$, the problem is $\Pi_1^0$-complete; \item if $E$ contains only monoid equations, the problem is $\Pi_2^0$-complete; \item for arbitrary equations $E$, the problem is $\Pi_1^1$-complete. \end{itemize} The last problem is the universal Horn theory of the *-continuous Kleene algebras. This resolves an open question of Kozen (1994). 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
An Interior Newton Method for Quadratic Programming
Authors: Thomas F. Coleman, Jianguo Liu
Venue:  (1993)

Quadratic programming represents an extremely important class of optimization problem. In this paper we propose a new (interior) approach for the general quadratic programming problem. We establish that our new method is globally and quadratically convergent published alternative interior approaches do not share such strong convergence properties for the nonconvex case. We also report on the results of preliminary numerical experiments: the results indicate that the proposed method has considerable prcatival potential.
Integrating Autonomous Enterprise Systems through Dependable CORBA Objects
Authors: Carlo Marchetti, Antonino Virgillito, Massimo Mecella, Roberto Baldoni
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

Integrating autonomous enterprise systems allows the cooperation among applications belonging to distinct systems. As an example, this problem shows up when integrating software services of large departments and organizations in e-Government initiatives. This paper studies, in the context of the Unitary Network of the Italian Public Administration, the problem of increasing the availability of services exported by an autonomous enterprise system towards others. In particular we show how a fault tolerant CORBA system, namely the Interoperable Replication Logic (IRL), can be used to increase such an availability by building a replicated cooperative gateway that wraps enterprise applications.
Improving Performance of TCP over Wireless Networks
Authors: Bikram S. Bakshi, P. Krishna, N. H. Vaidya, D. K. Pradhan
Venue: Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97) (1997)

Transmission Control Protocol~(TCP) assumes a relatively reliable underlying network where most packet losses are due to congestion. In a wireless network, however, packet losses will occur more often due to unreliable wireless links than due to congestion. When using TCP over wireless links, each packet loss on the wireless link results in congestion control measures being invoked at the source. This causes severe performance degradation. In this paper, we study the effect of (a) burst errors on wireless links, (b) packet size variation on the wired network, (c) local error recovery by the base station, and (d) explicit feedback by the base station, on the performance of TCP over wireless networks. It is shown that the performance of TCP is sensitive to the packet size, and that significant performance improvements are obtained if a `good' packet size is used. While local recovery by the base station using link-level retransmissions is found to improve performance, timeouts can still occur at the source, causing redundant packet retransmissions. We propose an ``explicit feedback'' mechanism to prevent these timeouts during local recovery. Results indicate significant performance improvements when explicit feedback from the base station is used. A major advantage of our approaches over existing proposals is that, no state maintenance is required at any intermediate host. Experiments are performed using the Network Simulator (NS) from Lawrence Berkeley Labs. The simulator has been extended to incorporate wireless link characteristics.
Multimedia Service Configuration and Reservation in Heterogeneous Environments
Authors: Dongyan Xu, Duangdao Wichadakul, Klara Nahrstedt
Venue: Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000) (2000)

Widely deployed multimedia services are expected to accommodate clients in a highly heterogeneous environment. Clients of a multimedia service may vary greatly in processing and communication capabilities. In addition, due to workload, location, and service time differences, the availability of end-to-end resources between a client and a server may also vary.Current solutions tend to focus on either the qualitative heterogeneity (in client and resource types) or the quantitative heterogeneity (in resource availability) problem. In this paper, we present a framework for dynamic end-to-end multimedia service configuration and reservation - an integrated solution to both aspects of the heterogeneity problem.Service configuration is responsible for choosing appropriate service components to compose a customized service delivery to each client; while service reservation is responsible for reserving the end-to-end resources in a coordinated manner, and providing the best possible quality within the chosen configuration. We have implemented a prototype of this framework as part of the 2K operating system, and tested it by building a proof-of-concept video streaming service on top of it. Our experiments show the soundness of this framework.
PL/CT, Another Approach to Two Problems in Interactive PL/I
Authors: Steven L. Worona
Venue:  (1975)

NO SUPPLIED
SmartNode: Achieving 802.11 MAC Interoperability in Power-efficient Ad Hoc Networks with Dynamic Range Adjustments
Authors: Edmond Poon, Baochun Li
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

The standard CSMA/CA based IEEE 802.11 protocol assumesthat each node uses a certain fixed (or maximum)transmission power for the transmission of each packet.However, a MAC protocol with power adjustments can havesignificant benefits towards better power conservation andhigher system throughput through better spatial reuse ofspectrum. In this work, we propose a power efficient MAClayer algorithm, SmartNode, that is compatible with thebasic RTS-CTS-DATA-ACK MAC protocol defined in IEEE802.11. Our algorithm uses the minimum required powerlevel for the transmission of data packets, which requiresspecial handling for the exchange of control packets. Comparedwith previously proposed power-controlled MAC protocols,our algorithm does not require multiple data channelsat the physical layer, so that it is able to inter-operatewith regular nodes running the existing IEEE 802.11 MACprotocol. Through extensive performance evaluations, wehave demonstrated that our proposed algorithm is effectivein a power-controlled ad hoc network - it is able to increasesystem throughput while conserving power with dynamicpower adjustments.
Multi-Agent based Intrusion Detection Architecture
Authors: Ran Zhang, Depei Qian, Chongming Bao, Weiguo Wu, Xiaobing Guo
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Intrusion detection research has been conducted for nearly 20 years but still remains in its infancy. The existing intrusion detection system architectures have a number of problems that limit their configurability, scalability, and efficiency. This paper first discusses the threats to networked computer systems, and introduces the intrusion detection mechanisms and agenttechnologies. On the basis of the above discussion, a multi-agent based intrusion detection architecture for LAN is proposed. This architecture can be easily extended and maintained, supporting distributed and intelligent intrusion detection. In addition, it can enhance the wholesystem's detection efficiency greatly.
Dynamic Reorganization of Object Databases
Authors: Vlad S. Wietrzyk, Mehmet A. Orgun
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

We consider the problem of optimizing the number of I/O operations by means of an effective clustering with the objective to overcome defficiencies of existing solutions. Our objective is to dynamically adapt physical database organizations, on-line, according to the access patterns of the users without adding significant overhead on processing workload. We propose a clustering schedule that may be convenient for any Object Database Management Systems [ODBMS]; it combines flexibility, dynamics, and efficiency. This paper describes relative partial validation of our approach using Versant.
Towards an accurate AS-level traceroute tool
Authors: Zhuoqing Morley Mao, Jennifer Rexford, Jia Wang, Randy H. Katz
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

Traceroute is widely used to detect routing problems, characterize end-to-end paths, and discover the Internet topology. Providing an accurate list of the Autonomous Systems (ASes) along the forwarding path would make traceroute even more valuable to researchers and network operators. However, conventional approaches to mapping traceroute hops to AS numbers are not accurate enough. Address registries are often incomplete and out-of-date. BGP routing tables provide a better IP-to-AS mapping, though this approach has significant limitations as well. Based on our extensive measurements, about 10% of the traceroute paths have one or more hops that do not map to a unique AS number, and around 15% of the traceroute AS paths have an AS loop. In addition, some traceroute AS paths have extra or missing AS hops due to Internet eXchange Points, sibling ASes managed by the same institution, and ASes that do not advertise routes to their infrastructure. Using the BGP tables as a starting point, we propose techniques for improving the IP-to-AS mapping as an important step toward an AS-level traceroute tool. Our algorithms draw on analysis of traceroute probes, reverse DNS lookups, BGP routing tables, and BGP update messages collected from multiple locations. We also discuss how the improved IP-to-AS mapping allows us to home in on cases where the BGP and traceroute AS paths differ for legitimate reasons.
Deriving Upwinding, Mass Lumping and Selective Reduced Integration by Residual-Free Bubbles
Authors: Leopoldo P. Franca, Alessandro Russo
Venue:  (1995)

We show that three well-known "variational crimes" in finite elements upwinding, mass lumping and selective reduced integration - may be derived from the Galerkin method employing the standard polynomial-based finite element spaces enriched with residual-free bubbles.
Parametric Real-Time Reasoning
Authors: Rajeev Alur, Thomas A. Henzinger
Venue:  (1993)

Traditional approaches to the algorithmic verification of real-time systems are limited to checking program correctness with respect to concrete timing properties (e.g., ``message delivery within 10 milliseconds''''). We address the more realistic and more ambitious problem of deriving symbolic constraints on the timing properties required of real-time systems (e.g., ``message delivery within the time it takes to execute two assignment statements''''). To model this problem, we introduce parametric timed automata finite-state machines whose transitions are constrained with parametric timing requirements. The emptiness question for parametric timed automata is central to the verification problem. On the negative side, we show that in general this question is undecidable. On the positive side, we provide algorithms for checking the emptiness of restricted classes of parametric timed automata. The practical relevance of these classes is illustrated with several verification examples. There remains a gap between the automata classes for which we know that emptiness is decidable and undecidable, respectively, and this gap is related to various hard and open problems of logic and automata theory.