ppxscal/embedding_network huggingface dataset:
Cluster-preserving Embedding of Proteins
Authors: Hristescu Gabriela, Farach Martin
Venue:  (1999)

Similarity searching in protein sequence databases is a standard technique for biologists dealing with a newly sequenced protein. Exhaustive search in such databases is prohibitive because of the large sizes of these database and because pairwise comparisons are slow. Heuristic techniques, such as FASTA and BLAST, are useful because they are fast and accurate, though it has been shown that exhaustive search is more accurate. Therefore, there are times when one would like to perform an exhaustive search. We propose an efficient method, called SparseMap, for preprocessing a database of proteins to support efficient similarity searches using expensive but sensitive distance functions, such as those based on Smith-Waterman similarity. Our method is based on a Low-dimensional Euclidean Embedding approach. We compare our method with other embedding approaches, and show that our method is faster and produces embeddings which preserve more biological information about the proteins, such as pairwise distance and biological clusters.
A community club on safety-critical systems
Authors: Felix Redmill
Venue: Proceedings of the seventh Australian workshop conference on Safety critical systems and software 2002 - Volume 15 (2003)

To mark the inauguration of an Australian community club on safety-critical systems, this paper reviews eleven years of experience of the UK's Safety-Critical Systems Club, which came into being on 1st May 1991. The paper first summarises the background to the Club's formation, and the Club's objectives, structure, and financial arrangements. It then reviews the Club's activities and achievements and extracts lessons for the Australian Club. The paper discusses changes that have taken place in the safety-critical systems domain since the Club's formation, and offers suggestions on a variety of challenges that the Australian Club might address and the influences that it could exert.
Implementation of a web-based collaborative decision-making system using fuzzy logic
Authors: H. M. Yang, C. J. Anumba, P. M. Carrillo
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

The Web-based prototype system this paper presents is designed to cope with the difficulty that geographically distributed project team members have in collaborative decision-making. The system makes it possible for a decision-making team to hold a virtual meeting via a client-server system. It is shown that the system encourages objectivity and eliminates unhealthy in group decision-making through integration of all team members' views and weighting each decision-maker's importance for a specific decision-making issue. Another improvement the system has made is its ability to handle fuzziness during the process of collaborative decision-making. A hypothetical decision-making scenario is used to demonstrate the implementation and operation process of the prototype system.
Online learning of linear classifiers
Authors: Jyrki Kivinen
Venue: Advanced lectures on machine learning (2003)

This paper surveys some basic techniques and recent results related to online learning. Our focus is on linear classification. The most familiar algorithm for this task is the perceptron. We explain the perceptron algorithm and its convergence proof as an instance of a generic method based on Bregman divergences. This leads to a more general algorithm known as the p-norm perceptron. We give the proof for generalizing the perceptron convergence theorem for the p-norm perceptron and the non-separable case. We also show how regularization, again based on Bregman divergences, can make an online algorithm more robust against target movement.
Evaluation of the Adaptation Techniques in Kernel Tool Kit (KTK)
Authors: Bodhisattwa Mukherjee, Karsten Schwan
Venue: Proceedings of the 3rd International Conference on Configurable Distributed Systems (1996)

Our past research with configurable operating system abstractions has developed a model and implementation of adaptive multiprocessor operating systems for improved application performance. Adaptive locks are one such kernel component where lock adaptations are performed for each application program to suit its dynamic locking pattern. The topic of this paper is to compare and evaluate two different methods for performing such runtime adaptation: synchronous adaptations performed in conjunction with program accesses to the abstractions being configured and asynchronous adaptations performed concurrently with the program's execution. Asynchronous and synchronous adaptation schemes are evaluated experimentally using adaptive locks for several multiprocessor applications on a KSR-2 supercomputer. Experiments establish that the attainment of performance gains by use of dynamic adaptation requires the use of both schemes, each suitable for different classes of application programs.
Numerical solution of a special type of integro-differential equations
Authors: M. T. Rashed
Venue: Applied Mathematics and Computation (2003)

The aim of this paper is to present a solutions to special type integro-differential equation of the first and second kind. Practical examples are illustrated Rashed method is very useful in computing a numerical solution of linear integro-differential equation of first and second order. This paper describe three methods to treat a special type of linear integro-differential equation of the first and second kind.
Fault Tolerance in Decentralized Systems
Authors: Brian Randell
Venue: Proceedings of the The Fourth International Symposium on Autonomous Decentralized Systems (1999)

In a decentralised system the problems of fault tolerance, and in particular error recovery, vary greatly depending on the design assumptions. For example, in a distributed database system, if one disregards the possibility of undetected invalid inputs or outputs, the errors that have to be recovered from will just affect the database, and backward error recovery will be feasible and should suffice. Such a system is typically supporting a set of activities that are competing for access to a shared database, but which are otherwise essentially independent of each other - in such circumstances conventional database transaction processing and distributed protocols enable backward recovery to be provided very effectively. But in more general systems the multiple activities will often not simply be competing against each other, but rather will at times be attempting to co-operate with each other, in pursuit of some common goal. Moreover, the activities in decentralised systems typically involve not just computers, but also external entities that are not capable of backward error recovery. Such additional complications make the task of error recovery more challenging, and indeed more interesting. This paper provides a brief analysis of the consequences of various such complications, and outlines some recent work on advanced error recovery techniques that they have motivated.
Study of a Content Oriented Web Architectural Model
Authors: Qingshan Li
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Many larger and complex web applications, such as e-commerce, ASP, portals, are content oriented, in which content is the critical elements and always under constant updates; content organization and presentation generally is required custom-tailored. Developing and maintaining such web applications demands a suitable model that can capture its features. For architectural descriptions address high-level aspects of the systems such as the overall organization, the decomposition into components, and the way the components interact, wefirst analyze the features of typical content oriented web application framework. In succession, this paper defines the types, structure, semantics, constraints of component and connector in our conceptual model of web content component, within which a web content component is regarded as an independent process unit performing necessary content organizing, processing and presenting functions. In component standpoint, a web application is regarded as a collection of web content components and some other service components providing certain content service. In this paper, our first concern has been to identify, classify, and support a variety of web content components and their connections, serving more effective development and maintenance of web applications.
An Image Processing Software Package for the Laser Scanning Phase Modulation Microscope
Authors: William J. Murray
Venue:  (1986)

This thesis documents the most recent effort to develop a user-friendly image processing software package for the Laser Scanning Phase Modulation Microscope (LSPMM). The LSPMM is composed of three integrated subsystems, the Laser Scanning (LS) system, the Phase Modulation (PM) system, and Digital Image Acquisition (DIA) system. Under the control of the image processing software, the DIA system can receive and store the digital image data, display the image on a monochrome monitor, and process the image to provide the microscopist with quantitative information regarding the image. The implementation of this image processing software package required the specification of a four level software hierarchy to serve as an organizational framework, with the highest level interacting with the LSPM microscopist, and the lowest level performing hardware control. This framework should prove useful for the development and implementation of additional software in the future. The programs that were developed accept command line arguments; however, most will interactively query the user if the command line arguments are not known. This software provides the microscopist with the capability to scan, save, and display a 512 by 512 pixel image. The image may be scanned to, saved from, or displayed in either of the two DeAnza image display memory planes. Considerable effort has been made to incorporate all of the devices useful for image processing into a single operating system kernel. This alleviates the problem of taking down one operating system and bringing up another version in order to dump image files on magnetic tape. 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
The B-SYS Programmable Systolic Array
Authors: Daniel P. Lopresti, Richard Hughey
Venue:  (1989)

We introduce a general architecture for programmable systolic arrays that incorporates the following features: regular topology with nearest-neighbor connections, synchronous SIMD control, interprocessor communication using shared registers, and stream-based I/O. In our model, neighboring processors are granted direct access to one another''s working storage: as a result, computation and communication are tightly intertwined, the latter being a natural consequence of the former. We have found that many systolic algorithms can be expressed in such a fashion. The Brown Systolic Array (B-SYS) is an embodiment of this philosophy. B-SYS is as highly parallel array of simple processing elements tuned for solving combinatorial problems, including sequence comparison. We are currently in the midst of implementing a B-SYS prototype in 2$mu$-CMOS. Although working hardware is not yet available, we have programmed a number of algorithms using B-SIM, a software emulator that has helped us refine the architecture. Preliminary estimates indicate that B-SYS will provide supercomputer performance for the applications of interest.
Comprehension of Software Analysis Data Using 3D Visualization
Authors: Andrian Marcus, Louis Feng, Jonathan I. Maletic
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

The paper presents a software visualization application-framework that utilizes a variety of 3Dmetaphors to represent large software system and related analysis data. The 3D representation is based on the SeeSoft pixel representation and extends that original metaphor by rendering the visualization in a 3D space. Object-based manipulation methods and simultaneous alternative mappings are available to the user. The visual elements, mappings, and user interactions implemented and used by the framework are described with respect to their support for software understanding tasks. Examples are presented and discussed to demonstrate how the system's current features support the needs of the user.
Evaluation and Comparison of Task Allocation and Scheduling Methods for Distributed Real-Time Systems
Authors: Jan Jonsson, Jonas Vasell
Venue: Proceedings of the 2nd IEEE International Conference on Engineering of Complex Computer Systems (1996)

Automatic tool support for scheduling of distributed real-time applications on various platforms is of critical importance both to guarantee critical application demands, such as safety requirements, as well as to keep development costs down. It is, however, difficult to choose a proper scheduling technique from the plethora of more or less practical approaches that are available, as means for objective evaluation and comparison of scheduling approaches are lacking. In this paper we propose a framework for description, evaluation, and comparison of methods for task allocation and scheduling on distributed real-time systems. By using this framework it is possible to perform studies, both of existing techniques as well as of new combinations of existing techniques. Our framework uses a decomposition approach wherein existing scheduling methods have been analyzed and broken down into a set of independent parameter choices.
Mach-Based Channel Library
Authors: Rajit Manohar, K. M Chandy
Venue:  (1994)

No Abstract.
Fireworks MX Bible, 1 edition
Authors: Joseph W. Lowery, Derren Whiteman
Venue:  (2002)

:Create traffic-stopping vector or bitmap Web graphics and animationsBuild eye-catching effects using layers, rollovers, frames, and slicesMaster the new interface and improved graphics and Web connectivity toolsIf Fireworks MX can do it, you can do it too . . .From vector drawing and bitmap editing to animations and JavaScript output, Fireworks MX puts all the Web graphics tools you need into a single cohesive package. Packed with time-saving tips and real-world examples - including 16 pages of color illustrations - this comprehensive guide shows you how to make the most of Fireworks, whether you're looking for an in-depth tutorial on program fundamentals or the lowdown on the new interface or new options for transparent gradients, text editing, and pop-up menus.Inside, you'll find complete coverage of Fireworks MXMaster the basics, from object creation to full-blown photo manipulationEnhance your images with sophisticated fills, filters, xtras, layers, and Live EffectsBuild in interactivity using hotspots, slices, and JavaScript behaviors - no coding requiredSpeed up production with styles, libraries, and round-trip workflow featuresMake the most of sliced file auto-checkout, XHTML support, and other new tools for Dreamweaver integrationGet up to speed fast on GIF animation and create state-of-the-art banner adsBonus CD-ROMFireworks commands, templates, textures, gradients, strokes, and imagesMacromedia Flash MX, Dreamweaver MX, Fireworks MX, and FreeHand trial versionsSplat!, Eye Candy 4000, and Xenofex demo versions by Alien Skin Software
Quicken 2003 for Dummies, 1 edition
Authors: Stephen L. Nelson
Venue:  (2002)

:Take control of your personal finances today - and start saving time and money!Maximize investments, minimize taxes, and manage your bills!Make the most of Quicken to manage your expenses and build wealthWant to pay bills, track investments, and calculate interest with the click of a mouse? With this friendly guide and Quicken 2003, it's all possible. Offering thorough coverage of the new interface and expanded help on tax issues, CPA Stephen Nelson shows you step by step how to get a handle on Quicken - and manage your money like a pro.The Dummies WayExplanations in plain English"Get in, get out" informationIcons and other navigational aidsTear-out cheat sheetTop ten listsA dash of humor and fun
The Event-Triggered and Time-Triggered Medium-Access Methods
Authors: Vilgot Claesson, Cecilia Ekelin, Neeraj Suri
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

The processes of accessin a shared communication media have been extensively researched in the dependability and real-time area. For embedded systems, the primary approaches have revolved around the event-triggered and the time-triggered paradigms. In this paper, our goal is to objectively and quantitatively outline the capabilities and limitations of each of these paradigms. The event-triggered approach is commonly perceived as providing high flexibility, while the time-triggered approach is expected to provide for a higher degree of predictable communication access to the media. We have quantified the spread of their differences, and provide a summary discussion about suggested best usage for each approach. The focus of our work is on the response times of the communication system, and also on the schedulability of the communication system in collaboration with tasks in the nodes.
Special Edition Using Adobe Photoshop 7 with CD-ROM
Authors: Peter Bauer, Jeff Foster
Venue:  (2002)

:Photoshop is simply the best image-editing software available and is the choice of millions of graphic artists worldwide. In Special Edition Using Photoshop 7, authors Peter Bauer and Jeff Foster combine deep technical expertise, Photoshop community involvement, teaching experience, and artistic talent. They offer numerous practical and creative tips to highlight clear explanations of both theory and technique. Full coverage is provided of all new tools and upgraded features in Photoshop 7, including:Macintosh OS X compliance (native mode and carbonized)An integrated image management systemAn improved painting engine for both PC and Mac versionsA more advanced web workflow capabilityAdded editing features
A generalized non-preemptive priority queue
Authors: Duan-Shin Lee
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1 (1995)

In this paper, we analyze a generalized non-preemptive queue with two priority classes. When the server serves the low priority queue, up to l customers are served before the server returns to the high priority queue. We study the embedded Markov chain at departure epochs and obtain the transforms of the queue-length and sojourn-time distributions. From these transforms, it is easy to find the moments.
Implementation Issues in an Open Architectural Framework for Digital Object Services
Authors: Carl Lagoze, David Ely
Venue:  (1995)

We provide high level designs for implementing some key aspects of the Kahn/Wilensky Framework for Distributed Digital Object Services. We focus on five aspects of the architecture: 1) Negotiation on terms and conditions initiated by requests for stored digital objects. 2) Replication of handle server data and the notion of a primary handle server, 3) The mechanisms for replicating digital objects in multiple repositories and the assertions concerning such replication. 4) The meaning of mutable and immutable states for digital objects and the mechanisms for changing these states. 5) The basic services that the Repository Access Protocol (RAP) needs to support the infrastructure.
A Proof Correctness of Rem''s Semaphore Implementation of the With-When Statement
Authors: David Gries
Venue:  (1977)

NO SUPPLIED
A Small Planar Inverted-F Antenna for Wearable Applications
Authors: Pekka Salonen, Lauri Sydänheimo, Mikko Keskilammi, Markku Kivikoski
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Small printed antennas will replace the commonly used normal-mode helical antennas of mobile handsets and systems in the future. This paper presents a novel small planar inverted-F antenna (PIFA) which is a common PIFA in which a U-shaped slot is etched to form a dual band operation for wearable and ubiquitous computing equipment. Health issues are considered in selecting suitable antenna topology and the placement of the antenna. Various applications are presented while the paper mainly discusses about the GSM applications.
SouthamptonTAC: An adaptive autonomous trading agent
Authors: Minghua He, Nicholas R. Jennings
Venue: ACM Transactions on Internet Technology (TOIT) (2003)

Software agents are increasingly being used to represent humans in on-line auctions. Such agents have the advantages of being able to systematically monitor a wide variety of auctions and then make rapid decisions about what bids to place in what auctions. They can do this continuously and repetitively without losing concentration. Moreover, in complex multiple auction settings, agents may need to modify their behavior in one auction depending on what is happening in another. To provide a means of evaluating and comparing (benchmarking) research methods in this area, the Trading Agent Competition (TAC) was established. This competition involves a number of agents bidding against one another in a number of related auctions (operating different protocols) to purchase travel packages for customers. Against this background, this artcle describes the design, implementation and evaluation of our adaptive autonomous trading agent, SouthamptonTAC, one of the most successful participants in TAC 2002.
The Schema Analysis of Emergent Bargaining Strategies in Agent-Based Double Auction Markets
Authors: Shu Chen, Bin-Tzong Chie
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

In this paper, we simulate the double auction markets with AIE-DA Ver.2.Given thatall traders are truth tellers and non-adaptive, we find that the GP trader can always findthe most profitable trading strategies.Furthermore, the analysis shows that the tradingstrategies discovered by GP are very market-specific, which makes our artificial bargaining agent behave quite intelligently.
Soft learning vector quantization
Authors: Sambu Seo, Klaus Obermayer
Venue: Neural Computation (2003)

Learning vector quantization (LVQ) is a popular class of adaptive nearest prototype classifiers for multiclass classification, but learning algorithms from this family have so far been proposed on heuristic grounds. Here, we take a more principled approach and derive two variants of LVQ using a gaussian mixture ansatz. We propose an objective function based on a likelihood ratio and derive a learning rule using gradient descent. The new approach provides a way to extend the algorithms of the LVQ family to different distance measure and allows for the design of "soft" LVQ algorithms. Benchmark results show that the new methods lead to better classification performance than LVQ 2.1. An additional benefit of the new method is that model assumptions are made explicit, so that the method can be adapted more easily to different kinds of problems.
A pipelined memory architecture for high throughput network processors
Authors: Timothy Sherwood, George Varghese, Brad Calder
Venue: ACM SIGARCH Computer Architecture News (2003)

Designing ASICs for each new generation of backbone routers is a time intensive and fiscally draining process. In this paper we focus on the design of a programmable architecture for backbone routers, based on the manipulation of wide irregular memory words, that can provide a feasible design alternative to custom ASICs. We propose a pipelined memory design that emphasizes worst-case throughput over latency, and co-explore architectural tradeoffs with the design of several important network algorithms. Through this co-exploration, we show that a programmable architecture can efficiently exploit behavior inherent to most common network algorithms to keep up with next generation network speeds.