ppxscal/embedding_network huggingface dataset:
An Approach for Measuring Semantic Similarity between Words Using Multiple Information Sources
Authors: Yuhua Li, Zuhair A. Bandar, David McLean
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

Semantic similarity between words is becoming a generic problem for many applications of computational linguistics and artificial intelligence. This paper explores the determination of semantic similarity by a number of information sources, which consist of structural semantic information from a lexical taxonomy and information content from a corpus. To investigate how information sources could be used effectively, a variety of strategies for using various possible information sources are implemented. A new measure is then proposed which combines information sources nonlinearly. Experimental evaluation against a benchmark set of human similarity ratings demonstrates that the proposed measure significantly outperforms traditional similarity measures.
Softboard - A Web-based Application Sharing System for Distance Learning
Authors: Krishna K. Adusumilli, Bassem Al-Halabi, Sam Hsu
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The paper describes the development of SoftBoard, a Web-based application sharing system that provides a convenient writing and sketching tool in delivering instructions and conducting virtual office hours for distance education over the Internet. It is a Web-based shared environment where students and instructors can participate in exchanging information in real time effectively. Similar systems in the form of whiteboards exist today but are quite different from SoftBoard. Users equipped with a standard browser and Internet connection can invoke a SoftBoard system. A light pen can also be used with SoftBoard to provide a convenient way for creating non-textual contents freehand. Several experiments using different computer labs were conducted. Feedback from participants was very positive.
Exploiting Sparsity in Newtown-Like Methods
Authors: Earl S. Marwil
Venue:  (1978)

The basic problem considered here is to solve sparse systems of nonlinear equations. A system is considered to be sparse when the Jacobian has fewer than ten percent nonzero entries. Algorithms are presented and their convergence properties are analyzed. Schubert''s method for solving sparse nonlinear equations is a modification of Broyden''s method, a well known quasi-Newton method. The modification preserves the zero-nonzero structure defined by the sparse Jacobian in the sequence of approximate Jacobians. The algorithm is shown to satisfy the Bounded Deterioration Theorem of Broyden, Dennis and More to obtain a simple local convergence result. A more detailed study of the error bound in the Frobenfus norm shows that the method is superlinearly convergent. Schubert''s method satisfies a minimum norm property and a Kantorovich analysis is also presented. A symmetric Schubert update is derived using an iterative projection technique of Dennis and Powell. The update is expressed in a closed form at the expense of an additional sparse linear system to be solved at each iteration in the algorithm. These sparse linear systems that occur all have the same structure which means they can be handled using the pre-processing performed when solving the first such system. Again the Frobenfus norm is used to estimate the error in the approximate Jacobian. The algorithm is locally and linearly convergent. The update is applicable to a symmetric nonlinear system, particularly those systems arising from unconstrained minimization problems with a continuous second derivative. Another method of solving sparse nonlinear equations using a matrix factorization is presented. Some theory of sparse linear equations is needed to maintain sparseness in triangular factors of a matrix. An approximate Jacobian is factored and one of the triangular factors is updated with Schubert''s updating formula. After a finite number of iterations, a new approximate Jacobian is needed. Algorithms are suggested with local and superlinear convergence properties. The convergence depends on the local continuity of the matrix factorization. Finally, another application of Schubert''s method is proposed for problems in which the Jacobian of the nonlinear system can be written as the direct sum of two transformations. One of these is assumed to be easily computed, and the other is assumed to be sparse. An algorithm is sketched and local and superlinear convergence properties are conjectured. 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 New Approach to Class Formation in Multi-Agent Simulations of Language Evolution
Authors: F. Kaplan
Venue: Proceedings of the 3rd International Conference on Multi Agent Systems (1998)

Multi-agent models of language evolution usually involve agents giving names to internal independently constructed categories. We present an approach in which the creation of categories is part of the language formation process itself. When an agent does not have a word for a particular object it is allowed to use the existing name of another object, close to the original one as defined by an analogy function. In this way, the names in the shared lexicon that has evolved in a collective way, directly yield the different object classes. We present the results of several simulations using this model showing under what conditions the agents will develop meaningful classes. We also examine the effects of an influx and outflux of agents. Finally we discuss the prospects for models in which the classes would constitute relevant complex taxonomies.
Reusable Software Components Based on an Agent Model
Authors: Hideki Hara, Shigeru Fujita, Kenji Sugawara
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops (2000)

Software reuse is a key technology to improve the efficiency of design and maintenance of large software systems. One of the problems in reuse technology is in retrieving components which a programmer wants to modify based on the given specification. We have been studied a framework called ADIPS framework which provides agent-based distributed application systems. The framework consists of virtual machines where multi-agent systems work and repositories which manage agent-based components. In this paper, we propose a reuse model of software components applying the framework to it and architecture of the reusable components based on the agent model.
Generalized Pairing Heaps
Authors: Elmasry Amr
Venue:  (2001)

We give a generalized form for the standard implementation of the pairing heaps. A new parameter k is introduced. When the node with the minimum value is to be deleted from the heap, the operations to combine the resulting sub-trees into one tree depend on the value of k. When the value of k is equal to 2, the implementation will be equivalent to the standard pairing heaps'' implementation. We show that, for any constant k, this general form achieves the same bounds as the standard implementation. Finally, experimental results are conducted showing that, by tuning the value of k, the number of comparisons involved in this operation can be reduced. 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
Kernel Andorra Prolog and its Computational Model
Authors: Seif Haridi, Sverker Janson
Venue:  (1990)

The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints. The languages Prolog, GHC, Parlog, and Atomic Herbrand, are all executable in the Kernel Andorra Prolog computation model. There are instances of the framework in which all of these languages are embeddable.
Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors
Authors: C. Mohan, R. Strong, S. Finkelstein
Venue: ACM SIGOPS Operating Systems Review (1985)

This paper describes an application of Byzantine Agreement [DoSt82a, DoSt82e, LyFF82] to distributed transaction commit. We replace the second phase of one of the commit algorithms of [MoLi83] with Byzantine Agreement, providing certain trade-offs and advantages at the time of commit and providing speed advantages at the time of recovery from failure. The present work differs from that presented in [DoSt82b] by increasing the scope (handling a general tree of processes, and multi-cluster transactions) and by providing an explicit set of recovery algorithms. We also provide a model for classifying failures that allows comparisons to be made among various proposed distributed commit algorithms. The context for our work is the Highly Available Systems project at the IBM San Jose Research Laboratory [AAF-KM83].
Automating the Process of Optimization in Spacecraft Design
Authors: A. S. Fukunaga, S. Chien, D. Mutz, R. L. Sherwood, A. D. Stechert
Venue:  (1996)

Spacecraft design optimization is a difficult problem, due to the complexity of optimization cost surfaces and the human expertise in optimization that is necessary in order to achieve good results. In this paper, we propose the use of a set of generic, metaheuristic optimization algorithms (e.g., genetic algorithms, simulated annealing), which is configured for a particular optimization problem by an adaptive problem solver based on artificial intelligence and machine learning techniques. We describe work in progress on OASIS, a system for aptive problem solving based on these principles.
Visual Representations as Feedback in a Programmable Visual Shell
Authors: Francesmary Modugno, Brad A. Myers
Venue:  (1993)

Although visual shells (e.g., Apple Macintosh) are easy to use, they are difficult to program, especially by non-expert users. PURSUIT is a visual shell that contains a programming by demonstration (PBD) system to address this problem. In a PBD system, users execute actions on data and the underlying system attempts to construct a program. Such systems, however, have limitations: feedback is often difficult to understand, disruptive or non existent; and programs often have no representation for users to examine or edit. PURSUIT addresses these problems by presenting the inferred program in an editable graphical language while it is being constructed. The language is a state-based visual language in which icons represent objects such as files and folders and changes in these icons represent operations. The representations are similar to the objects and effects that users see in the real interface. This provides users with an immediate view of the code and feedback in a way that is familiar, easy to understand, and non-disruptive. An intuitive representation that also serves as feedback makes it easier for users to write programs to customize their systems.
Wireless Multimedia Communication through Multichannel Multipoint Distribution Service
Authors: William Biagini, Ning Yang
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The Multichannel Multipoint Distribution Service (MMDS) spectrum has been the focus for a variety of business ventures and technologies over the past twenty years and is anticipated to be at the forefront for competitive multimedia services to the consumer in the near future. In this article, we review the architecture and technical challenges encountered in the design and deployment of a digital video broadcast system for the island of Oahu. Such networks provide insight to the technical challenges and potential solutions in future two-way systems.
Storage Security: Protecting, SANs, NAS and DAS
Authors: John Chirillo, Scott Blaul
Venue:  (2002)

:Here is the ultimate storage security handbook from the nation's top security expert, renowned Hack Attacks author John Chirillo. To create a detailed blueprint for protecting vital storage systems, John and coauthor Scott Blaul analyze SANs, DAS, and NAS in detail. They examine strengths and weaknesses, describe architectural security concerns and considerations, and identify ways to implement and design more secure storage systems, protect against security breaches, and develop effective countermeasures in case of attack. If storage security is your responsibility, you simply cannot afford to be without their advice.
Minimax relations for T-join packing problems
Authors: J. Cohen, C. L. Lucchesi
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

In this paper we present structural and algorithmic results for problems involving the packing of T-joins. We explore minimax relations that relate the size of a packing of T-joins with the size of a minimum T-cut in a graph. We present a new conjecture stating that if all T-cuts have the same parity then the maximum size of a family of T-joins that uses each edge at most twice equals the double of the size of a minimum T-cut. We show that this conjecture is equivalent to a famous conjecture for perfect matchings. We also prove a theorem for the case |T|/spl les/8 and describe a polynomial time algorithm for the maximization problem.
A learning-based coalition formation model for multiagent systems
Authors: Leen-Kiat Soh, Xin Li
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we present a learning-based coalition formation model that forms sub-optimal coalitions among agents to solve real-time constrained allocation problems in a dynamic, uncertain and noisy environment. This model consists of three stages (coalition planning, coalition instantiation and coalition evaluation) and an integrated learning framework. An agent first derives a coalition formation plan via case-based reasoning (CBR). Guided by this plan, the agent instantiates a coalition through negotiations with other agents. When the process completes, the agent evaluates the outcomes. The integrated learning framework involves multiple levels embedded in the three stages. At a low level on strategic and tactical details, the model allows an agent to learn how to negotiate. At the meta-level, an agent learns how to improve on its planning and the actual execution of the plan. The model uses an approach that synthesizes reinforcement learning (RL) and case-based learning (CBL). We have implemented the model partially and conducted experiments on CPU allocation in a multisensor target-tracking domain.
Linear Algebraic Transformations of the Bidomain Equations and Their Implications on Numerical Methods
Authors: Nigel Hooke, Craig Henriquez, Paul Lanzkron, J D Rose
Venue:  (1992)

In this paper we give a mathematical framework for the treatment of the bidomain equations used to model propagation in cardiac tissue. We show how previous work fits into this framework and discuss the implications of various linear transformations of the equations on the numerical methods of solution.
An Environment for Automated Reasoning About Partial Functions
Authors: David A. Basin
Venue:  (1987)

We report on a new environment developed and implemented inside the Nuprl type theory that facilitates proving theorems about partial functions. It is the first such automated type-theoretic account of partiality. We demonstrate that such an environment can be used effectively for proving theorems about computability and for developing partial programs with correctness proofs. This extends the well-known proofs as programs paradigm to partial functions.
Kleene Algebra with Tests and Program Schematology
Authors: Allegra Angus, Dexter Kozen
Venue:  (2001)

The theory of flowchart schemes has a rich history going back to Ianov (1960); see Manna (1974) for an elementary exposition. A central question in the theory of program schemes is scheme equivalence. Manna presents several examples of equivalence proofs that work by simplifying the schemes using various combinatorial transformation rules. In this paper we present a purely algebraic approach to this problem using Kleene algebra with tests (KAT). Instead of transforming schemes directly using combinatorial graph manipulation, we regard them as a certain kind of automaton on abstract traces. We prove a generalization of Kleene''s theorem and use it to construct equivalent expressions in the language of KAT. We can then give a purely equational proof of the equivalence of the resulting expressions. We prove soundness of the method and give a detailed example of its use.
A replica control method for improving availability for read-only transactions
Authors: Chang Sup Park, Myoung Ho Kim, Yoon Joon Lee
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

a Abstract: Data replication is often considered in distributed database systems to enhance availability and performance. The benefit of data replication, however can only be realized at the cost of maintaining the consistency of data. In particular, network partition failures make it more difficult to achieve high data availability while ensuring strong correctness criteria such as l-copy serializability. We propose a replica control method to improve the availability of data in the presence of network partition failures. Our method extends the traditional primary copy method by using the relaxed correctness criterion called insular consistency for large-scale distributed systems, where partition failures frequently occur. We focus on increasing the availability of data for read-only transactions. We introduce a version vector as a tool for guaranteeing insular consistency and present a mechanism that allows read-only transactions to be executed at any partition as long as the insular consistency is satisfied. An asynchronous update propagation mechanism is also employed to improve the performance of update operations. We also show that the proposed method is correct and give some performance considerations.
Microsoft Office Excel 2003 Step by Step
Authors: Curtis Frye
Venue:  (2003)

Teach yourself how to use the data-presentation and number-crunching power in the latest version of Microsoft Excel-one step at a time! Learn exactly the skills you need for Excel 2003 using easy, self-paced lessons and hands-on practice exercises.
Probabilistic Analysis of Cyclic Packet Transmission Scheduling in WDM Optical Networks
Authors: Keqin Li
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

We study the packet transmission-scheduling problem with tuning delay in wavelength-division multiplexed (WDM) optical communication networks with tunable transmitters and fixed-tuned receivers. By treating the numbers of packets as random variables, we conduct probabilistic analysis of the average-case performance ratio for the cyclic packet transmission-scheduling algorithm. Our numerical data as well as simulation results demonstrate that the average-case performance ratio of cyclic schedules is very close to one for reasonable system configurations and probability distributions of the numbers of packets. In particular, when the number of receivers that share a channel and/or the granularity of packet transmission are large, the average-case performance ratio approaches one. Better performance can be achieved by overlapping tuning delays with packet transmission. We derive a bound for the normalized tuning delay ? such that tuning delay can be completely masked with high probability. Our study implies that by using currently available tunable optical transceivers, it is possible to build single-hop WDM networks that efficiently utilize all the wavelengths.
Working Session: Empirical Studies of Programming-in-the-Large: How?
Authors: Marian Petre
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Studying software design is a juggling act of tradeoffs and constraints. There are good, pragmatic reasons why most empirical studies of programming and software engineering have focused on programming-in-the-smalleven programming-in-the-miniature. Such research has certainly revealed some useful things. However, have we made our focus so small that we have not even noticed the real design issues? The difference between programming-in-the-small and programming-in-the large is measured, not just in lines of code, but also in data, roll calls, engineering processes, tools and environments, and - crucially - time.How can we scale up the focus of our empirical studies without exceeding feasibility? Is it enough just to change the granularity of our examination? How can we take a longitudinal view, examining software development over the whole project lifetime, rather than within a given hour in the life of a program? How at least can we look enough at programming-in-the-large to identify issues that are small, tractable, and critical? This session will begin to address the application of empirical methods to the study of programming-in-the-large, and will consider what lessons might be drawn from past research experience.
Best Websites for Financial Professionals, Business Appraisers, and Accountants, 2 edition
Authors: Eva M. Lang, Jan Davis Tudor
Venue:  (2003)

:A no-nonsense guide to quickly finding and evaluating the quality and usefulness of a siteWritten by two of the industrys leading researchers, this book helps professionals evaluate, target, and locate the best financial and business Web sites. The authors reveal tips and traps and recommend favorite sites, including a comprehensive review of the most important financial sites on the Internet.Eva Lang (Memphis, TN) is a nationally recognized expert on electronic research for business valuation and litigation support services. She currently serves as Chief Operating Officer of the Financial Consulting Group, the largest alliance of business valuation and consulting firms in the U.S. Jan Tudor (Portland, OR) is President of JT Research and a popular speaker on research strategies on the Internet.
A Dynamic Delayed ACK Control Scheme on MobileIP Networks
Authors: Yuko Onoe, Yukio Atsumi, Fumiaki Sato, Tadanori Mizuno
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

During TCP/IP communication, MobileIP routing optimization functions may transmit out-of-order TCP packet sequences.To solve this problem, we propose a dynamicdelayed ACK control scheme in which the wireless link-state management part of notifies the upper TCP/IP layer of base-station hand-over, and at this time the TCP/IP layer sends dynamic delayedACKs in response by using two-level-timer (i.e., hard-timer andsoft-timer) processing.Simulation results confirm that applyingdynamic ACK control to MobileIP networks improves averagethroughput.