ppxscal/embedding_network huggingface dataset:
Using Low-Cost Workstations to Investigate Computer Networks and Distributed Systems
Authors: Mark Sherman, Ann Marks
Venue:  (1986)

A quality education in contemporary computer science requires that students gain experience with realistic systems. Many efforts at bringing empirical computer science to undergraduates focus on rather old technologies, for example, building a compiler or simulating a disk scheduler. Although efforts are being made to use some newer technologies, the efforts are concentrating on teaching traditional material in a new medium. However, the medium itself -- networked workstations in a server environment -- is worthy of exploration by undergraduate students in a laboratory setting. At Dartmouth, we developed a Computer Network Laboratory to let students experiment with computer networks, protocols and distributed systems. Through this article, we wish to share our experiences in the design of the laboratory and give an example of how the laboratory was used in a computer network course.
Novel ?-Type Resistor Network in D/A Converter Based on Multiple-Valued Logic
Authors: Xunwei Wu, Xuanchang Zhou
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

This paper analyses the mathematical expression of digital-to-analog conversion and explains the physical realization of a binary DAC by means of dividing current, whereby the resistor network of the quaternary DAC is proposed. By using quaternary signal decode, a novel ( -type resistor network is derived. Comparing with conventional T-type resistor network, a quarter of resistors in this network can be saved and the precision is ensured.
Performance and Architectural Features of Segmented Multiple Bus System
Authors: Jungjoon Kim, Ahmed El-Amawy
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

The paper introduces a new class of bus-based systems called the Segmented Multiple Bus System (SMBS). The SMBS overcomes the architectural limitations of bus-based shared memory systems while maintaining their advantages in terms of high degree of fault tolerance, ease of expansion and ease of programming. In addition SMBS's are scalable; unlike conventional MBS's. Another interesting feature of the SMBS is that it supports wormhole routing which is traditionally used in direct network topologies.Using approximate Mean Value Analysis, we evaluate performance in terms of processing efficiency and request response time. We show good scalability for the SMBS. The approach we adopt in developing the models is comprehensive in the sense that the models incorporate features of both direct and non-direct networks. This makes our performance models easily adaptable to several other network topologies.
The solution of radiation transport equations with adaptive finite elements
Authors: Stals Linda
Venue:  (2001)

We compare the performance of an inexact Newton-multigrid method and Full Approximation Storage multigrid when solving radiation transport equations. We also present an adaptive refinement algorithm and explore its impact on the solution of such equations. 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
Distribution of Distances in Star Graphs
Authors: Dejter Italo J.
Venue:  (2001)

The distribution of distances in the star graph ST_n, where n is an integer <1, is determined from any fixed vertex, in particular to the vertices of each one of the n so-called efficient dominating sets, or 1-perfect codes.
Automatic jazz accompaniment computation: an open advice-based approach
Authors: M. Balaban, S. Irish
Venue: Proceedings of the 7th Israeli Conference on Computer-Based Systems and Software Engineering (1996)

Music systems are based on always partial, sometimes default, knowledge. In order to meet this essential character we need open systems that can constantly adapt their music assumptions. Ideally, the system should provide the naive end-user with the ability to manipulate the music knowledge on a user-understandable level. The paper presents a computer tool, entitled JOINME, that composes a jazz accompaniment consisting of drums, bass and piano lines. JOINME is an advice propagation system, that separates the music knowledge from the actual accompaniment computation. The system supports changes/revisions of its musical knowledge on the user interface level. Its open architecture enables a close, smooth collaboration with jazz experts.
Visualization of Data from an Intranet Training Systems using Virtual Reality Modelling Language (VRML)
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper describes the design of a generic computer-based Training Information System (TIS) and visualisation of the data that it generates. Today's desktop training applications are delivered over the Internet to users who can exploit this flexibility and train when and where they like. However, the training manager or the author of the training material require a record of who has been trained, when they were trained and what kind of progress they made. The TIS coordinates this by remotely recording each training session, then sending a small summarising session database back to a central collection point for collation and subsequent analysis.Because of the large amounts of data that this generates in large companies we are beginning to use Virtual Reality for analysis and presentation of training results. Described in this paper are the results from a session of monitored intranet training that was undertaken by approximately 60 students over a one week period.
A Theory of Lexicographic Multi-Criteria Optimization
Authors: Mark J. Rentmeesters, Wei K. Tsai, Kwei-Jay Lin
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

The field of multi-criteria optimization is reviewed as it pertains to lexicographic optimization over real-valued vector spaces. How lexicographic optimization differs from multi-criteria optimization that is restricted to proper Pareto optima is explained. Through a survey of previous work, it is revealed that there are currently no generally applicable methods for solving lexicographic optimization problems, and it is explained that this is due to the lack of an adequate mathematical theory for such problems. A more adequate mathematical theory is then presented for lexicographic optimization in this paper.
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
Authors: Vassos Hadzilacos, Sam Toueg
Venue:  (1994)

NO SUPPLIED
Direct Numerical Simulation for the Receptivity and the Whole Process of Transition Around 2-D Airfoils
Authors: C. Liu, Z. Liu, G. Xiong
Venue:  (1995)

The two- and three- dimensional development of leading-edge receptivity and transition in a 2-D Joukowsky airfoil boundary layer are investigated by direct numerical simulation (DNS) using the incompressible Navier-Stokes equations. The numerical investigation are based on the so-called spatial approach. A contravariant based governing system is derived so that we can simulate the receptivity and transition with complex geometric configuration. The numerical results agreed very well with the experimental results for the flat plate case, and also agreed very well with the result obtained by Buter & Reed (1994) for the 2-D ellipse-leading edge receptivity case.
Dynamic Feature Ordering for Efficient Registration
Authors: Tat-Jen Cham, James M. Rehg
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive ordering for the features (e.g. based on size or resolution). This paper presents a formal framework for computing an ordering for features which maximizes search efficiency.Features are ranked according to matching ambiguity measure, and an algorithm is proposed which couples the feature selection with the parameter estimation, resulting in a dynamic feature ordering. The analysis is extended to template features where the matching is non-discrete and a sample-refinement process is proposed.The framework is demonstrated effectively on the localization of a person in an image, using a kinematic model with template features. Different priors are used on the model parameters and the results demonstrate nontrivial variations in the optimal feature hierarchy.
Towards a Multi-Agent System for the Supervision of Dynamic Systems
Authors: M.-K. Allouche, C. Sayettat, O. Boissier
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

The supervision of dynamic systems is essential in industrial applications. The decentralization of such systems make their supervision more difficult. In this article, we tackle the supervision problem by using a temporal scenario recognition approach. The supervision is performed by a society of agents where an agent is considered as a watching process responsible for a subset of possible scenarios of the functioning of the system. The cooperation among agents is based on interaction protocols as well as dependence networks.
Multiple-Valued Dynamic Source-Coupled Logic
Authors: Takahiro Hanyu, Akira Mochizuki, Michitaka Kameyama
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

A new multiple-valued current-mode (MVCM) integratedcircuit based on dynamic source-coupled logic (SCL) isproposed for low-power VLSI applications. The use of aprecharge-evaluate logic style makes steady current flow cutoff, thereby greatly saving the power dissipation. A combinationof SCL and dynamic logic styles makes it possibleto reduce the power dissipation while maintaining a high-speedswitching capability due to small input-voltage swingwith SCL. As a typical example of a high-performancearithmetic circuit, a radix-2 signed-digit adder based on theproposed dynamic SCL is implemented in a 0.18-µm CMOStechnology. Its power dissipation is reduced to about 33percent in comparison with that of the corresponding binaryCMOS implementation under the normalized switching delay.
Stable Effectivity Functions and Perfect Graphs
Authors: E. Boros, V. Gurvich
Venue:  (1996)

An effectivity function $\cE$ is called {\em stable} if the core $C(\cE,u)$ is not empty for any payoff $u$. The problem to characterize stable effectivity functions seems, in general, very difficult. In this paper we apply a graph theoretic approach to this problem. Using a graph based model we obtain some necessary and some sufficient conditions for stability in terms of perfect graphs. We also demonstrate that the conjecture by Berge and Duchet (1983) related to perfect graphs and kernels, in fact, is a special case of the considered problem of stability of effectivity functions.
Visual C++.NET Bible, 1 edition
Authors: Tom Archer, Andrew Whitechap
Venue:  (2002)

:If you want to gain more precise control over Windows and Web-based applications, this is the only comprehensive combination reference with tutorial you need by your side. Expert programmer and author Tom Archer begins with thorough hands on introduction, such as SDI applications, MDI applications and dialogs then moves quickly to the skills expected of professionals, such as internet programming, multithreaded programming and attribute programming. The author ensures that the novice professional receives special explanation as well as dispensing expert tips, such as ATL Server issues and programming .NET for the advanced developers. This book fills the "holes " between understanding how to create a Visual C++ project and how to implement a complex application. Visual C++.NET Bible is the essential guide for developers at every skill level with its step-by-step instructions, real world examples and Tom's expert insight into developing industrial strength applications.
Identifying reusable functions using specification driven program slicing: a case study
Authors: A. Cimitile, A. De Lucia, M. Munro
Venue: Proceedings of the International Conference on Software Maintenance (1995)

We present the results of a case study in identifying and isolating reusable functions from C programs. The work exploits and specializes to programs written in C the theoretical framework of specification driven program slicing, a new program slicing process for isolating code fragments implementing functional abstractions. The specification of the function to be isolated, given in terms of a precondition and a postcondition, is used to identify a suitable slicing criterion. The preconditions for the execution of program statements and predicates are abstracted by using symbolic execution and compared with the conditions of the specification. The statements whose preconditions are equivalent to the pre and postconditions of the functional abstraction are candidates for entry and exit points of the slice implementing the abstraction. Once the slicing criterion has been identified, the slice can be isolated using algorithms based on control flow graphs and dependence graphs.
ELM-IT: EAGLES Specifications for Italian morphosyntax Lexicon Specification and Classification Guidelines
Authors: Monica Monachini
Venue:  (1996)

The aim of the present document is to offer a concrete example of how the EAGLES recommendations for the encoding of morphosyntactic information in lexicons presented in the document by Monachini and Calzolari 1995 are applied to Italian. In particular, in order to accomplish the task of practically encoding a lexicon at the morphosyntactic level, complete guidelines, i.e. clear criteria and tests for the applications of the above mentioned specifications are provided. TEL:: +39 50 560481
Symmetric Logspace is Closed Under Complement
Authors: Noam Nisan, Amnon Ta-Shma
Venue:  (1995)

We present a Logspace, many-one reduction from the undirected s-t connectivity problem to its complement. This shows that SL=coSL.
Submicron Systems Architecture Project: Semiannual Technial Report
Authors: Charles L. Seitz
Venue:  (1989)

No abstract available.
Hacking the Xbox: An Introduction to Reverse Engineering
Authors: Andrew Bunnie Huang
Venue:  (2003)

:This hands-on guide to hacking Microsoft's powerful video games console starts with step-by-step tutorials on hardware modification that teach basic hacking techniques as well as essential reverse engineering skills. Full discussions of the Xbox security mechanisms and other advanced hacking topics are here, along with practical pointers from hacking gear resources to soldering techniques. Xbox owners are shown exactly how to increase the value and utility of their Xbox, as well as problem-solve. The book covers the social and political implications of hacking, profiles the humans behiind the hacks in candid interviews, and includes a chapter written by the Electronic Frontier Foundation (EFF) on the rights and responsibilities of hackers. Debugging tips, a hardware reference guide, and a discussion of the latest trends and vulnerabilities in secure PC platforms wrap it up.
Heuristic Search + Local Model Checking in Selective mu-Calculus
Authors: Antonella Santone
Venue: IEEE Transactions on Software Engineering (2003)

Many tools for the automatic analysis or verification of finite-state distributed systems are based on the construction of the global state graph of the system under consideration. Thus, they often fail because of the state explosion problem: The state space of a distributed system potentially increases exponentially in the number of its parallel components. To overcome this problem in this paper, we present a model checking procedure, based on the combination of heuristic searches with ideas taken from local model checking. We use heuristic mechanisms for the exploration of the search space in order to avoid the construction of the complete state graph.
Multicasting and Broadcasting in Undirected WDM Networks
Authors: Lin Li, Yinglong Xu, Guoling Chen, Yingyu Wan
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

This paper addresses the problem of multicasting and broadcasting in undirected WDM networks. Given an undirected network G=(V,E) with a source node s and a set of destination nodes D, is the set of wavelength that can be used in the network. Associated with every edge e, there is a set of available wavelengths on it. The multicast problem is to find a tree rooted at s including all nodes in D such that the cost of the tree is minimum in terms of thecost of wavelength conversion at nodes and the cost of using wavelength on edges. This paper proves that the multicast problem is NP-Complete and can not be approximated within a constant factor, unless P=NP. Then we construct an auxiliary graph for the original WDM networks and reduce the multicast problem to a group steiner tree problem on the auxiliary graph. Employing the known algorithm for the group steiner tree problem, we get an algorithm for our problem which delivers a solution withinO(log2(nk)loglog(nk)logp) times the optimum.
System administration in a single address space operating system
Authors: C. Ansley, P. Ashton
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

The authors examine some important system administration issues in an object-oriented SASOS environment. They argue that administration issues must be taken into account when designing major system services. The paper concentrates on two major issues related to the management of secondary storage. The first issue is what structures are needed to replace the traditional file system. The second issue is the complications introduced by having an item of meta-data (the object's address) that has system-wide significance. They identify a need for a construct that provides an abstraction for secondary storage components, and conclude by suggesting paths for future research.
Multiple-Valued Product-of-Sums Expression with Truncated Sum
Authors: Yutaka Hata, Naotake Kamiura, Kazuharu Yamato
Venue: Proceedings of the 27th International Symposium on Multiple-Valued Logic (1997)

Truncated sum (TSUM for short) can be useful for MV-PLAs realization. This paper introduces multiple-valued product-of-sums expressions where sum refers to TSUM and product does MIN. We investigate the multiple-valued product-of-sums expressions and show the minimization method and the simulation results. We describe the minimization method based on binary Quine-McCluskey algorithm. It is proved that in the minimal product-of-sums expressions, the implicate number of the expressions with TSUM is equivalent to the number of those with MAX. Next, we propose multiple-valued product-of-sums expressions with variables. The expressions involve the TSUM of variables and nonzero constants as the coefficients of the implicates. The minimization method is also proposed. Finally, we show the simulation results for some multiple-valued arithmetic functions. In them, an efficiency of the product-of-sums expressions with variables is shown and some comparisons are made.Keywords, multiple-Valued logic design, truncated sum, product-of-sums form, minimization
Query length in interactive information retrieval
Authors: N. J. Belkin, D. Kelly, G. Kim, J.-Y. Kim, H.-J. Lee, G. Muresan, M.-C. Tang, X.-J. Yuan, C. Cool
Venue: Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval (2003)

Query length in best-match information retrieval (IR) systems is well known to be positively related to effectiveness in the IR task, when measured in experimental, non-interactive environments. However, in operational, interactive IR systems, query length is quite typically very short, on the order of two to three words. We report on a study which tested the effectiveness of a particular query elicitation technique in increasing initial searcher query length, and which tested the effectiveness of queries elicited using this technique, and the relationship in general between query length and search effectiveness in interactive IR. Results show that the specific technique results in longer queries than a standard query elicitation technique, that this technique is indeed usable, that the technique results in increased user satisfaction with the search, and that query length is positively correlated with user satisfaction with the search.
High Performance Subcircut Recognition Using a New Ptobabilistic Circuit Labeling Algorithm
Authors: Nikolay Rubanov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

Recognition of subcircuit instances in a larger circuit is widely used in simulation and verification of IC CAD. Subcircuit recognition (SR) can be stated as a problem of finding images of a model bipartite graph (BG) corresponding to a subcircuit in an object BG corresponding to a circuit. The best-known SR algorithms are based on the search-oriented subgraph isomorphism methods. Unfortunately, the search methods may require exponential runtime for large and symmetrical circuits. In this paper we develop a high performance SR method based on a new efficient BG labeling algorithm (LA). This algorithm computes probabilistic labels for the vertices corresponding to devices and nets based on the exhaustive analysis of the non-local vertex surroundings. The high discriminate properties of the LA allow combining it with an optimization based graph recognition technique. The experimental results show that hte new subcircuit recognition method recognizes all the subcircuit instances about an order of magnitude faster than the search algorithms. 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
Design of ATM switch using hypercube with distributed shared input buffers and dedicated output buffers
Authors: D. C. W. Pao, W. N. Chau
Venue: Proceedings of the 1995 International Conference on Network Protocols (1995)

We investigate a dynamic packet routing approach to ATM switch design using a hypercube. An (n+1)-dimensional hypercube is used to implement an N/spl times/N switch, where N=2/sup n/. Cells arriving at input ports are routed towards their destinations in store-and-forward (SAF) manner. In addition to the SAF buffer, each input/output port has a dedicated buffer. A distributed deflection routing algorithm where the routing priority is based on the age of the cells is developed. An interesting feature of the routing algorithm is that the store-and-forward buffers and the input buffers behave as distributed shared-buffer which effectively smooth out uneven traffic. In addition, our routing algorithm does not suffer from the HOL blocking problem as in the conventional input-output buffered switch architecture. The processing power of each node in the hypercube scales up by a factor of Q(log N) as the network size N is increased. Hence, our approach is suitable for implementing large scale ATM switches. Performance of our design is studied via simulation and found to be better than the conventional input-output buffered nonblocking switch architecture.
On graphic structured languages
Authors: V. V. Prokhorov
Venue: Proceedings of the IEEE Conference on Information Visualisation (1997)

This paper describes a family of structured visual languages. The algorithmic one includes constructions for the programming of parallel processes. The syntactical language allows the definition of context-dependent languages. Software supporting the languages is discussed. The environment allows the development of programs in chart dialects of C++, Java and the syntactical language.