ppxscal/embedding_network huggingface dataset:
Proceedings of the ECSCW''95: Workshop on the Role of Version Control in CSCW Applications
Authors: David Hicks, Anja Haake, David Durand, Fabio Vitali
Venue:  (1996)

Abstract The workshop entitled "The Role of Version Control in Computer Supported Cooperative Work Applications" was held on September 10, 1995 in Stockholm, Sweden in conjunction with the ECSCW''95 conference. Version control, the ability to manage relationships between successive instances of artifacts, organize those instances into meaningful structures, and support navigation and other operations on those structures, is an important problem in CSCW applications. It has long been recognized as a critical issue for inherently cooperative tasks such as software engineering, technical documentation, and authoring. The primary challenge for versioning in these areas is to support opportunistic, open-ended design processes requiring the preservation of historical perspectives in the design process, the reuse of previous designs, and the exploitation of alternative designs. This report contains a summary in which the workshop organizers report the major results of the workshop. The summary is followed by a section that contains the position papers that were accepted to the workshop. The position papers provide more detailed information describing recent research efforts of the workshop participants as well as current challenges that are being encountered in the development of CSCW applications. A list of workshop participants is provided at the end of the report.
The Fock Expansion, Kato''s Cusp Conditions, and the Exponential Anasatz
Authors: Christopher R. Meyers, Cyrus J. Umrigar, James P. Sethna, John D. Morgan,  III
Venue:  (1991)

We have examined the recent solution of the Fock expansion through O(r**2) for the ground state of the helium atom, and have verified that it correctly treats the discontinuity in the local energy characteristic of the triplecollision point. We have also developed an exponential representation of the Fock expansion which satisfies Kato''s cusp conditions for two-particle collisions even when the expansion is truncated at a finite order.
Recognition of a Crisis Condition of the Network Enterprises with the Help of Theories of the Evidences
Authors: Boris V. Palukh, Andrey V. Konstantinov
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

The technique of recognition of a crisis condition of the network enterprise, as an agent of multi-agent system - virtual enterprise, with the help of theories of the evidences is described in the article. The example of determination of reliance of approach of a crisis condition of some agents of VE is represented.
Global Solution for a Phase-Field Model with Memory and a Nonlinear Gradient Coupling Term
Authors: Margherita Solci
Venue:  (1999)

Purpose of this work is the analysis of a phase-field model with memory effects, where the standard coupling between the energy balance equation and the variational inclusion is modified by the introduction of a nonlinear gradient term. For this problem, we prove existence, uniqueness and regularity results. TEL:: +39-0382-505628 EMAIL:: marghe@dimat.unipv.it 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
Coalition formation with uncertain heterogeneous information
Authors: Sarit Kraus, Onn Shehory, Gilad Taase
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Coalition formation methods allow agents to join together and are thus necessary in cases where tasks can only be performed cooperatively by groups. This is the case in the Request For Proposal (RFP) domain, where some requester business agent issues an RFP - a complex task comprised of sub-tasks - and several service provider agents need to join together to address this RFP. In such environments the value of the RFP may be common knowledge, however the costs that an agent incurs for performing a specific sub-task are unknown to other agents. Additionally, time for addressing RFPs is limited. These constraints make it hard to apply traditional coalition formation mechanisms, since those assume complete information, and time constraints are of lesser significance there.To address this problem, we have developed a protocol that enables agents to negotiate and form coalitions, and provide them with simple heuristics for choosing coalition partners. The protocol and the heuristics allow the agents to form coalitions in the face of time constraints and incomplete information. The overall payoff of agents using our heuristics is very close to an experimentally measured optimal value, as our extensive experimental evaluation shows.
Natural language text classification and filtering with trigrams and evolutionary nearest neighbour classifiers
Authors: William B. Langdon
Venue:  (2000)

N~grams offer fast language independent multi-class text categorization. Text is reduced in a single pass to ngram vectors. These are assigned to one of several classes by a) nearest neighbour (KNN) and b) genetic algorithm operating on weights in a nearest neighbour classifier. 91\% accuracy is found on binary classification on short multi-author technical English documents. This falls if more categories are used but 69\% is obtained with 8~classes. Zipf law is found not to apply to trigrams.
Experiences in process domain engineering at PRC Inc
Authors: C. R. Hollenbach
Venue: Proceedings of the 10th International Software Process Workshop (1996)

This paper briefly describes experiences at PRC Inc. in performing domain engineering on software process domains. It describes the domain engineering method used, the results of the domain engineering, and lessons learned. At PRC, domain engineering is applicable to software processes, beneficial to organizations at varying levels of process capability, dependent upon sustained managerial support, and helpful in evolving increasingly reusable assets.
Telecommunication software development using SDL-92: practical experience
Authors: B. Hatim, M. O. Droma
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

This paper is concerned with the application of the SDL-92 language supported by the SDT tool to produce a telecommunication product which interfaces with a public ISDN network. The paper reports on the specification to implementation work for this real-time software engineering application, with the particular focus on evaluating the effectiveness of an SDL language approach to design and implementation. The target application is an ISDN basic access services management unit located on the user's premises. The development included implementation of data link layer and network layer protocol software for implementation of both sides of an ISDN basic access interface, viz. TE and NT sides. To validate this SDL system design, apart from software simulations, the C code is generated and down-loaded onto the micro-controller in the target unit and for testing on a public ISDN.
General AIMD congestion control
Authors: Y. R. Yang, S. S. Lam
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

Instead of the increase-by-one decrease-to-half strategy used in TCP for congestion window adjustment, we consider the general case such that the increase value and decrease ratio are parameters. That is, in the congestion avoidance state, the window size is increased by /spl alpha/ per window of packets acknowledged and it is decreased to /spl beta/ of the current value when there is congestion indication. We refer to this window adjustment strategy as general additive increase multiplicative decrease (GAIMD). We present the (mean) sending rate of a GAIMD flow as a function of /spl alpha/, /spl beta/, loss rate, mean round-trip time, mean timeout value, and the number of packets acknowledged by each ACK. We conducted extensive experiments to validate this sending rate formula. We found the formula to be quite accurate for a loss rate of up to 20%. We also present a simple relationship between /spl alpha/ and /spl beta/ for a GAIMD flow to be TCP-friendly, that is, for the GAIMD flow to have approximately the same sending rate as a TCP flow under the same path conditions. We present results from simulations in which TCP-friendly GAIMD flows (/spl alpha/=0.31, /spl beta/=7/8) compete for bandwidth with TCP Reno flows and with TCP SACK flows, on a DropTail link as well as on a RED link. We found that the GAIMD flows were highly, TCP-friendly. Furthermore, with /spl beta/ at 7/8 instead of 1/2, these GAIMD flows have reduced rate fluctuations compared to TCP flows.
Wearable Computing for Field Archaeology
Authors: Chris Baber, James Cross, Sandra I. Woolley, Vince L. Gaffney
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

Wearable computers offer many potential uses in field archaeology. Our paper presents the uses identified in a Field Archaeology Wearable Computing Workshop held at The University of Birmingham, U.K., and describes the challenges and outcomes of a prototype system trialed with ¿The Birmingham University Field Archaeology Unit' (BUFAU) at the Forum Novum archaeological site, Italy.
Parallel Sparse Orthogonal Factorization on DistributedMemory Multiprocessors
Authors: Chunguang Sun
Venue:  (1993)

We describe the issues involved in the design and implementation of an efficient parallel multifrontal algorithm for computing the QR factorization of a large sparse matrix on distributed-memory multiprocessors. Strategies for balancing arithmetic work among processors and reducing communication costs are explored. Our parallel sparse QR factorization algorithm is compared with a previously-proposed approach in the literature and is shown to be much more efficient. The arithmetic and communication complexities of our algorithm on regular grid problems are presented. Experimental results on an Intel iPSC/860 machine are obtained for a collection of sparse matrix problems including regular grid problems and practical sparse problems with irregular sparsity structure.
Response to 'More comments on: a cohesion measure for object-oriented classes'
Authors: Heung-Seok Chae, Yong-Rae Kwon, Doo-Hwan Bae
Venue: Software&mdash;Practice Experience (2003)

The authors insist that monotonicity is a necessary property of a good cohesion metric and the violation of the monotonicity property limits the application of CBMC. They also state that the augmented CBMC can also be used as a guideline for quality evaluation and restructuring of poorly designed classes. This paper raises the question about the necessity of monotonicity by analyzing the reason that causes CBMC to violate the monotonicity property. In addition, we give a detailed description of the restructuring procedure based on CBMC.
Using Computers in the Law Office, 4 edition
Authors: Brent D. Roper
Venue:  (2003)

:The third edition of Using Computers in the Law Office reviews computer skills for legal assistants in a practical, hands-on manner. The book uses many updated legal-specific examples, charts, tables, exercises, step-by-step explanations, case histories, and software to make it easy to use and understand. The latest technologies are covered including a whole new chapter on the Internet and electronic mail, and descriptions of the latest software and hardware. An expanded ethics section is included in each chapter and a complete chapter on how to avoid malpractice with computers is also included. New case histories have been added throughout the book to emphasize how computer technology is being used to win cases and to practice law more efficiently and effectively. Features:Current legal software is included with the bookScreen shots of current software products allow readers to view the software being used in legal-specific waysCurrent case histories of computer use in litigation enable readers to bridge the gap between learning and using technologyEthical considerations for each chapter help readers to understand ethical responsibilities that are relative to computer technology. 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
Variational Bayesian learning of ICA with missing data
Authors: Kwokleung Chan, Te-Won Lee, Terrence J. Sejnowski
Venue: Neural Computation (2003)

Missing data are common in real-world data sets and are a problem for many estimation techniques. We have developed a variational Bayesian method to perform independent component analysis (ICA) on high-dimensional data containing missing entries. Missing data are handled naturally in the Bayesian framework by integrating the generative density model. Modeling the distributions of the independent sources with mixture of gaussians allows sources to be estimated with different kurtosis and skewness. Unlike the maximum likelihood approach, the variational Bayesian method automatically determines the dimensionality of the data and yields an accurate density model for the observed data without overfitting problems. The technique is also extended to the clusters of ICA and supervised classification framework.
Linear Hashing
Authors: Noga Alon, Martin Dietzfelbinger, Peter B Miltersen, Erez Petrank, Gabor Tardos
Venue:  (1997)

Consider the set ${\cal H}$ of all linear (or affine) transf ormations between two vector spaces over a finite field $F$. We study how good $\cal H$ is as a class of hash functions, namely we consider hashing a set $S$ of size $n$ into a range having the same cardinali ty $n$ by a randomly chosen function from ${\cal H}$ and look at the expected size of the largest hash bucket. $\cal H$ is a universal class of hash functions for any fini te field, but with respect to our measure different fields behave differen tly. \par If the finite field $F$ has $n$ elements then there is a bad set $S\subset F^2$ of size $n$ with expected maximal bucket size $\Omega(n^{1/3})$. If $n$ is a perfect square then there is even a bad set with largest bucket size {\em always} at least $\sqrt n$. (This is worst possible, since with respect to a universal class of hash functions every set of size $n$ has expected largest bucket size below $\sqrt n+1/2$.) \par If, however, we consider the field of two elements then we get much better bounds. The best previously known upper bound on the expected size of the largest bucket for this class was $O( 2^{\sqrt{\log n}})$. We reduce this upper bound to $O(\log n\log\log n)$. Note that this is not far from the guarantee for a random function. There, the average largest bucket would be $\Theta(\log n/\log \log n)$. \par In the course of our proof we develop a tool which may be of independent interest. Suppose we have a subset $S$ of a vector space $D$ over ${\bf Z}_2$, and consider a random linear mapping of $D$ to a smaller vector space $R$. If the cardinality of $S$ is larger than $c_\e|R|\log|R|$ then with probability $1-\e$, the image of $S$ will cover all elements in the range.
Negligence: engineering safety-critical systems
Authors: John McMullan
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

The conclusion set out at Chapter 5 of the Report of the Presidential Commission into the explosion of the Space Shuttle Challenger reads as follows: "The decision to launch the space shuttle Challenger was flawed."The consequences of failure of engineering safetycritical systems are sometimes very high. In the January 1986 Challenger disaster, it cost 7 lives, and billions of dollars.Even in the small Australian market, we have seen many, recent, celebrated failures of engineering safety-critical systems, and big litigation as a result. The Longford gas explosion, for example, was the subject of a recently released report by the Royal Commission comprising Sir Daryl Dawson and Mr John Brooke.Environmental accident/pollution cases have become normal. The USA has substantial experience in these types of cases. Similarly, European countries have some experience in the litigation of such claims. There have been several instances of similar pollution accident cases, which have not yet resulted in litigation.This paper briefly discusses the present-day law of negligence as it affects people managing and engineering safety-critical systems, and notes certain damages issues which arise in environmental accident/pollution ("mega-hazard") cases, with particular reference to Australian court decisions and practices. Some of these issues have been discussed recently in Australian journals.
Adobe FrameMaker 7.0 Classroom in a Book
Authors: Adobe Creative Team
Venue:  (2002)

:Adobe FrameMaker has long been the software of choice for technical documentation and large-scale document publishing because of its versatility and ability to handle the entire publishing processfrom word processing and page layout to electronic distribution. Now, with the introduction of version 7.0, the popular publishing program has gone even further to accommodate businesses' growing need for multi-format publishing by adding the ability to automatically reformat the same document for delivery in a number of formats, including Web pages, Acrobat print files, Palm handheld devices, and more. And that's just the beginning: Adobe's official Classroom in a Book training series guides readers through all of the program's features, tools, and techniquesboth old and newusing hands-on projects and end-of-chapter review questions to make sure the newly acquired knowledge sticks! Beginners will become experts by reading the book from cover to cover, and FrameMaker veterans will return again and again to find just the information they need. From the basics (such as character and paragraph formatting) to more advanced tasks (like cross-referencing text and creating indexes) and all of the enhancements in between from new authoring and collaboration tools to improved graphics handling and text import. Adobe FrameMaker 7.0 Classroom in a Book covers it all.
An Application of Branch and Cut to Open Pit Mine Scheduling
Authors: Louis Caccetta, Stephen P. Hill
Venue: Journal of Global Optimization (2003)

The economic viability of the modern day mine is highly dependent upon careful planning and management. Declining trends in average ore grades, increasing mining costs and environmental considerations will ensure that this situation will remain in the foreseeable future. The operation and management of a large open pit mine having a life of several years is an enormous and complex task. Though a number of optimization techniques have been successfully applied to resolve some important problems, the problem of determining an optimal production schedule over the life of the deposit is still very much unresolved. In this paper we will critically examine the techniques that are being used in the mining industry for production scheduling indicating their limitations. In addition, we present a mixed integer linear programming model for the scheduling problems along with a Branch and Cut solution strategy. Computational results for practical sized problems are discussed.
The Professional's Guide to Mining the Internet,2nd Edition, 2 edition
Authors: Brian Clegg
Venue:  (2002)

:When "Mining the Internet" was first published in 1999, the Internet already presented a vast, confusing mix of incredibly useful information and garbage. Since then, the volume of information has exploded. The good news about using the Internet for research is that almost anything you want to know is probably out there somewhere. The bad news is that it is like searching for a particular item on a bulletin board, planted with millions of other boards in a field the size of Texas. This new edition reflects the changes since 1999 - the breadth of information sources, the new wave of e-commerce, the changing vehicles for getting into the Net - but the main purpose of the book continues to be to take the pain out of using the Internet as an information source, whether you need to know what's on at your local theater, to find a telephone number of a company on the other side of the world, or to produce in-depth research material for your academic studies. It provides simple, practical ways to improve your ability to find the right information, with specific application focused-sections to find specific requirements. The Internet is much too fluid for a guidebook to provide more than a taster. Instead of taking the user on a tour of the Internet, this book builds the skills needed to be your own explorer. It keeps the subject light, concentrating on the information, rather than the technology. "The Professional's Guide to Mining the Internet" is a shortcut to becoming an expert Internet navigator. Using a combination of readable text and handy side references, it will give you the guidance to tame the Internet. This is the book you will want to keep by your PC. 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
Modeling and analysis of a single server queue with autocorrelated traffic
Authors: B. Melamed, Qiang Ren, B Sengupta
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2 (1995)

In performance analysis of computer and communication systems, the designer is often faced with two challenges: modelling an input process accurately and then solving a resulting queueing problem. The authors present a modelling methodology called QTES (quantized transform-expand-sample) which can be used to model the interarrival distribution (histogram) accurately and to capture the effect of autocorrelations approximately. They then show that a difficult queueing problem (using a QTES input with autocorrelations) can be solved. The method is analytically tractable and numerically robust as shown by various examples.
Using CARE to Construct Verified Software
Authors: Peter Lindsay, David Hemer
Venue: Proceedings of the 1st International Conference on Formal Engineering Methods (1997)

The CARE project investigated integration of well-understood formal development principles into an industrial organization's software development methodology. The result was a method for construction and verification of programs from formal specifications, using libraries of pre-proven, formally specified components. Tools help the user build products by selecting and instantiating components to fit the problem at hand, and generating and discharging correctness-of-fit proof obligations. This paper illustrates the method on part of the development of a software module for logging events in a medical embedded device.