ppxscal/embedding_network huggingface dataset:
The virtual firefly: a research tool for biologists
Authors: Matt Glover, Joshua McKinnon, Duane Mohney, Mike Taft, Brian Vysocky
Venue: Journal of Computing Sciences in Colleges (2005)

Fireflies communicate using a series for precisely timed pulses to identify potential mates. Each species has a unique pattern of communication. Biologists at our college are actively investigating various aspects of this communication pattern. Their research requires a device to proxy for an actual firefly in a meaningful way. Our project involved creating a "Virtual Firefly" to fill this need.
On Projective Codes Satisfying the Chain Condition
Authors: Sylvia Encheva
Venue: SIAM Journal on Discrete Mathematics (2005)

Projective codes with length above the Griesmer bound that satisfy the chain condition are discussed. Necessary and sufficient conditions for binary linear codes for which the chain condition holds are derived.
Improved approximation algorithms for minimum-weight vertex separators
Authors: Uriel Feige, MohammadTaghi Hajiaghayi, James R. Lee
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We develop the algorithmic theory of vertex separators, and its relation to the embeddings of certain metric spaces. Unlike in the edge case, we show that embeddings into L1 (and even Euclidean embeddings) are insufficient, but that the additional structure provided by many embedding theorems does suffice for our purposes.We obtain an O(√log n) approximation for min-ratio vertex cuts in general graphs, based on a new semidefinite relaxation of the problem, and a tight analysis of the integrality gap which is shown to be Θ(√log n). We also prove various approximate max-flow/min-vertex-cut theorems, which in particular give a constant-factor approximation for min-ratio vertex cuts in any excluded-minor family of graphs. Previously, this was known only for planar graphs, and for general excluded-minor families the best-known ratio was O(log n).These results have a number of applications. We exhibit an O(√log n) pseudo-approximation for finding balanced vertex separators in general graphs. In fact, we achieve an approximation ratio of O(√log opt) where opt is the size of an optimal separator, improving over the previous best bound of O(log opt). Likewise, we obtain improved approximation ratios for treewidth: In any graph of treewidth k, we show how to find a tree decomposition of width at most O(k √log k), whereas previous algorithms yielded O(k log k). For graphs excluding a fixed graph as a minor (which includes, e.g., bounded genus graphs), we give a constant-factor approximation for the treewidth; this can be used to obtain the first polynomial-time approximation schemes for problems like minimum feedback vertex set and minimum connected dominating set in such graphs.
The Potemkin Village and the Art of Deception
Authors: Phillip A. Laplante
Venue: IT Professional (2005)

Identifying a software Potemkin village is easier if you think about antipatterns. Refactoring one takes courage.
Artificial intelligence approach to machine translation: Musashino Electrical Communication Laboratory, Japan
Authors: Hirosato Nomura, Akira Shimazu, Hitoshi IIda, Yasuhiro Katagiri, Yaski Saito, Shozo Naito, Kentaro Ogura, Masako Origasa
Venue: Issue 79 (January 1982) (1982)

The machine translation project attempts a totally intelligent system which can understand languages and translate into other languages. The system has the facilities to support many tasks in translation processes, linguistic analysis, knowledge manipulation, and programming. The main emphasis is on understanding the meanings of sentences, the role of knowledge in understanding and man-machine interactions.
Petri-net based description, analysis and simulation of concurrent processes
Authors: Franz J. Ramming
Venue: ACM SIGDA Newsletter (1977)

<u>1.1 The language CAP</u>While there are a couple of programming languages which allow the representation of parallelism /1,2,5/ there is a lack for languages which allow in an as well disciplined as general manner the description of concurrency.A well defined mathematical description method for concurrent processes is given by the Petri net model /3,7,9/. It fulfils the above requirements and in addition is widely used and extremely easy to understand.This concept is integrated into the language CAP in a very elegant way: Lables are used as places, where one has in mind that a labelled statement puts a token into its label(s) <u>after</u> it has been processed. On the other hand the processability of a statement is controlld by "On-conditions" on labels. Every statement is processed if and only if its "On-condition" has become true. At this time, in accordance with the firing-rule (="On-condition"), "tokens" are withdrawn from certain labels used within the "On-condition" and placed into the labels of the statement.In addition various parameters may be associated to transitions thus offering a description power similar to the Macro-E-Nets /8/. On the other hand there are a lot of language-constructs to support structured programming.<u>1.2 The analysis of CAP-programs at compile-time</u>Since a couple of years Petri nets are object of research. For some rather restricted subclasses of Petri nets sufficiant an necessary conditions for the topology of a net to be well-formed are known /3,4,7/. Under a well-formed net we understand a net <u>without dead-locks</u> being <u>safe</u> (no loss of information) and <u>residue-free</u> (independent from a certain history). Related to results by Herzog an Yoeli /4/ for a subclass of Petri nets we prove that there are six conditions for the topology of a net of the subclass of Petrinets which are used to describe the control-structure of CAP-programs so that the net is well-formed.By this we can decide at compile-time without simulation whether a CAP-program describes a life, safe and residue-free system (i. e. a useful one) or not. After having defined, what we mean ba a "Structured CAP-program" we will have the fine result that every structured CAP-program is well-formed.<u>1.3 The simulation of systems described in CAP</u>As CAP allows the description of systems down to a level of specification which is comparable with the bit-level of digital systems inclusive the detailled description of the real-time-behaviour, for the processing of CAP one needs a system similar to a simulator for digital circuits. On the other hand also very global descriptions on a high level of abstraction are possible.This implies that the run-time system for CAP must be extremely adaptive. We tried to solve this problem by a very flexible and powerful table driven and event oriented simulator with the event-mechanism being directly adopted from the Petri net concept of CAP.
Algorithms to play Mastermind
Authors: T. M. Rao, G. Kazin, D. O'Brien
Venue: Issue 95 (January 1986) (1986)

Several algorithms to play mastermind have been published. However, the overall complexity of the algorithm has not been discussed. In this paper, we present three algorithms and an analysis of their complexity.
A Lightweight, Scalable Grid Computing Framework for Parallel Bioinformatics Applications
Authors: Hans De Sterck, Rob Markel, Rob Knight
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

In recent years our society has witnessed an unprecedented growth in computing power available to tackle important problems in science, engineering and medicine. For example, the SHARCNET network links large computing resources in 11 leading academic institutions in South Central Ontario, thus providing access to thousands of compute processors. It is a continuous challenge to develop efficient and scalable algorithms and methods for solving large scientific and engineering problems on such parallel and distributed computers. If the computing power available in such computational grids can be unleashed effectively in a scalable way, large scientific problems can be solved that would otherwise be hard to solve using the machines available in a stand-alone way. This paper describes techniques and software developed that allow to apply the power of computational grids to large-scale, loosely coupled parallel bioinformatics problems. Our approach is based on decentralization and implemented in Java, leading to a flexible, portable and scalable software solution for parallel bioinformatics. We discuss advantages and disadvantages of this approach, and demonstrate seamless performance on an ad-hoc grid composed of a wide variety of hardware for a real-life parallel bioinformatics problem. The bioinformatics problem described consists of virtual experiments in RNA folding executed on hundreds of compute processors concurrently, which may establish one of the missing links in the chain of events that led to the origin of life.
On the Charney-Davis and Neggers-Stanley conjectures
Authors: Victor Reiner, Volkmar Welker
Venue: Journal of Combinatorial Theory Series A (2005)

For a graded naturally labelled poset P, it is shown that the P-Eulerian polynomial W(P, t): = Σw ∈ L(P) tdes(w) counting linear extensions of P by their number of descents has symmetric and unimodal coefficient sequence, verifying the motivating consequence of the Neggers-Stanley conjecture on real zeroes for W(P, t) in these cases. The result is deduced from McMullen's g-Theorem, by exhibiting a simplicial polytopal sphere whose h-polynomial is W(P, t).Whenever this simplicial sphere turns out to be flag, that is, its minimal non-faces all have cardinality two, it is shown that the Neggers-Stanley Conjecture would imply the Charney-Davis Conjecture for this sphere. In particular, it is shown that the sphere is flag whenever the poset P has width at most 2. In this case, the sphere is shown to have a stronger geometric property (local convexity), which then implies the Charney-Davis Conjecture in this case via a result from Leung and Reiner (Duke Math. J. 111 (2002) 253).It is speculated that the proper context in which to view both of these conjectures may be the theory of Koszul algebras, and some evidence is presented.
Multilevel full-chip routing with testability and yield enhancement
Authors: Katherine Shu-Min Li, Chung-Len Lee, Yao-Wen Chang, Chauchin Su, Jwu-E Chen
Venue: Proceedings of the 2005 international workshop on System level interconnect prediction (2005)

We propose a multilevel full-chip routing algorithm that improves testability and diagnosability, manufacturability, and signal integrity for yield enhancement. Two major issues are addressed. (1) The oscillation ring (OR) test and its diagnosis scheme for interconnect based on the IEEE P1500 are integrated into the multilevel routing framework to achieve testability enhancement. (2) We present a heuristic to balance routing congestion to optimize the multiple-fault probability, chemical mechanic polishing (CMP) and optical proximity correction (OPC) induced manufacturability, and crosstalk effects, for yield improvement. Experimental results on the MCNC benchmark circuits show that the proposed OR method achieves 100% fault coverage and the maximal diagnosis resolution for interconnects, and the multilevel routing algorithm effectively balances the routing density to achieve 100% routing completion. Compared with [14], the experimental results show that our router improves the maximal congestion by 1.24X--6.11X in runtime speedup by 1.08X--7.66X, and improves the average congestion by 1.00X--4.52X with the improved congestion deviation by 1.37X--5.55X.
Proceedings of the 6th international conference on Mobile data management
Venue: International Conference On Mobile Data Management (2005)

Welcome to MDM 2005 and the beautiful island of Cyprus! It is our great pleasure to welcome you all to the 6th International Conference on Mobile Data Management that is a specialized forum for exchanging ideas on state of the art on mobile data management, systems, and applications. This year the MDM series has reached a new milestone with MDM 2005 taking place for the first time in Europe. Cyprus is a member State of the European Union. The first conferences in the MDM series took place in Hong Kong, MDM 2002 in Singapore, MDM 2003 in Australia, and MDM 2004 in Berkeley, CA of USA. As the past MDM conferences, MDM 2005 promises to be very exciting and successful, attracting large international participation of researchers and practitioners from databases, networking, and mobile computing communities. The three Program Co-Chairs, Alex Delis (University of Athens, Greece), Ouri Wolfson (University of Illinois at Chicago), and Arkady Zaslavsky (Monash University, Australia), have put together an excellent and selective program. The research program is enhanced by industrial and demo sessions, as well as with four tutorials. It also includes two keynote speeches and two panels focusing on the challenges in the presence of mobility (of users and devices). Our special appreciation to our keynote speakers, Joao Da Silva from the European Commission and Jari Veijalainen from the University of Jyvaskyla, Finalnd. We own our sincere gratitude to all the people who contributed in assembling such a high quality program: the three PC Co-Chairs and the members of their technical program committee, the Industrial Track Chair Apratim Purakayastha (IBM Research, USA) along with industrial track reviewers, the Demo Co-Chairs Avigdor Gal (Technion University, Israel) and Vijay Kumar (University of Missouri at Kansas City), the Tutorials Chair Christian Becker (University of Stuttgart, Germany) and the Panel Chair Evi Pitoura (University of Ioannina, Greece). Besides coming to Europe for the first time, another new event at MDM this year is the introduction of specialized single-day workshops which are co-located with the MDM conference. Two workshops were selected to complement the MDM 2005: Managing Context Information in Mobile and Pervasive Environments (MCMP05) and Semantics in Mobile Environments (SME05). Consistent with the MDM tradition, the organizers of the two workshops have put together a common, single-track research program consisting of high quality papers.
Structural optimization by genetic algorithm with degeneration (GAd)
Authors: Tetsuyuki Takahama, Setsuko Sakai, Takumi Ichimura, Yoshinori Isomichi
Venue: Systems and Computers in Japan (2004)

Genetic Algorithms (GAs) are models of biological evolution. But the concept of degeneration had not previously been introduced to GA. Degeneration is the evolutionary decline or loss of a function or characteristic, and it had not been thought that degeneration could be used for optimization. In this paper, GA with degeneration (GAd), which introduces the concept of degeneration to GA, is proposed. It is assumed that damaged genes and irreversible mutations cause degeneration and that if degeneration occurs, some characteristics of an individual are lost. If the characteristics are regarded as parameters in a model, the number of parameters can be reduced and the optimal parameter structure can be discovered. It is shown that the optimal parameter structure of some models such as neural networks can be discovered by GAd. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(5): 32&ndash;43, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10552
Kode Vicious Reloaded
Authors: George Neville-Neil
Venue: Queue (2005)

Dear KV, I've been working on a program in C++ to handle some simple data analysis at my company. The program should be a small project, but every time I start specifying the objects and methods it seems to grow to a huge size, both in the number of lines and the size of the final program. I think the problem is that there are just too many things in the system to analyze and each one needs a special case, which requires just a bit more code, or another subclass to be created. Help!
An Integrated Error Control and Constrained Sequence Code Based on Multimode Coding
Authors: A. Hughes, I. J. Fair
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

We present a method of integrating constrained sequence (CS) and error control (EC) codes for digital communication systems. This technique is based on multimode coding where a single source word (SW) is represented by a set of complementary EC code words (CWs). From this set the encoder selects the CW that best meets the CS goals of the system. These goals are to have balanced transmission and a high number of transitions to aid in clock recovery. The decoding structure avoids the problem of CS error propagation by performing error correction before decoding the CS code. A hardware implementation was constructed to verify code operation and to measure the power spectral density (PSD) which is shown to match calculations. The PSD plots show that the encoded sequence has a null at 0 Hz and thus it is dc-free. Furthermore, BER simulations demonstrate the superior performance of this combined EC and CS code on a dc-constrained noisy channel.
Mixing things up: collaboration, converging disciplines, and the music curriculum
Authors: Christopher Watts
Venue: Organised Sound (2004)

The applications of digital technologies in the world of art continue to explode, and various artistic disciplines begin to converge as a result. More artists are working in a wide variety of media while, at the same time, increasing specialisation results in a greater number of collaborative, interdisciplinary activities. The ability to collaborate effectively with other artists is a skill set that must be addressed from a curricular standpoint, and music faculty must engage with colleagues in the other arts to provide students with the appropriate learning opportunities. While many institutions have developed successful models for doing this, information about those models has not been widely disseminated. Institutions that have found this change difficult may face a variety of obstacles, including highly compartmentalised departments, a crowded curriculum, and shortages in staffing and funds. One model for change is presented that focuses on building curriculum and shared facilities, using technology as a means to facilitate interdisciplinary collaboration.
Control of a rigid manipulator mounted on a compliant base
Authors: H. Bassan, H. A. Talebi, R. V. Patel, M. Moallem
Venue: Robotica (2005)

Structural flexibility is an inherent characteristic of a class of macro-micro manipulators consisting of a rigid micro manipulator mounted on a long-reach (flexible) macro manipulator. Vibrations caused by flexibility make it difficult to achieve accurate control of the end-point of the micro manipulator. In this paper, we develop a control strategy that can be applied to such a system. An experimental test-bed has been developed in which a 6 DOF PUMA 560 manipulator is mounted on a compliant platform. The control strategy consists of a rigid body inverse dynamics controller together with a neural network based strategy for damping out the oscillations due to the flexible base. Experimental results obtained from the test-bed are presented to show the effectiveness of the proposed control scheme.
ARTIST-DESIGNERS AND INTERACTION DESIGN
Authors: Gillian Crampton Smith
Venue: ACM SIGCHI Bulletin (1991)

The computer is now more than a tool. It is a medium.Until recently visual displays for human-computer interface were limited. Ten years ago, for instance, a PC offered just four variables: normal, inverse and flashing type, and position on the screen---comparable to designing a type-written page. 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
Introducing VAUCANSON
Authors: Sylvain Lombardy, Yann Régis-Gianas, Jacques Sakarovitch
Venue: Theoretical Computer Science (2004)

This paper reports on a new software platform called VAUCANSON and dedicated to the computation with automata and transducers. Its main feature is the capacity of dealing with automata whose labels may belong to various algebraic structures.The paper successively describes the main features of the VAUCANSON platform, including the fact that the very rich data structure used to implement automata does not weigh too much on the performance, shows how VAUCANSON allows to program algorithms on automata in a way which is very close to the mathematical expression of the algorithm and finally explains the main choices of the programming design that enable to achieve both genericity and efficiency.
Practical, transparent operating system support for superpages
Authors: Juan Navarro, Sitaram Iyer, Peter Druschel, Alan Cox
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Most general-purpose processors provide support for memory pages of large sizes, called superpages. Superpages enable each entry in the translation lookaside buffer (TLB) to map a large physical memory region into a virtual address space. This dramatically increases TLB coverage, reduces TLB misses, and promises performance improvements for many applications. However, supporting superpages poses several challenges to the operating system, in terms of superpage allocation and promotion tradeoffs, fragmentation control, etc. We analyze these issues, and propose the design of an effective superpage management system. We implement it in FreeBSD on the Alpha CPU, and evaluate it on real workloads and benchmarks. We obtain substantial performance benefits, often exceeding 30%; these benefits are sustained even under stressful workload scenarios.
Mobile peer-to-peer computing: challenges, metrics and applications
Authors: Vana Kalogeraki
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

The pervasiveness of computers in our current society (transportation, e-commerce, home appliances, medical monitoring, process control) expands our freedom for flexible ad-hoc communication and dynamic collaboration between individuals through a wide variety of devices. With the pervasive deployment of computers, the Peer-to-Peer (P2P) model is increasingly receiving attention for direct and symmetric interaction and to perform critical functions in a decentralized manner. Some of the benefits of a P2P environment include its ability for self-organization, scalability by avoiding dependency on centralized servers, resource aggregation and adaptation to different loads, resiliency to node failures and lower cost of ownership and cost sharing. The goal of this panel is to explore the synergy of these two technologies, identify the challenges along with their shortcomings and explore promising approaches.
On business activity modeling using grammars
Authors: Savitha Srinivasan, Arnon Amir, Prasad Deshpande, Vladimir Zbarsky
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Web based applications offer a mainstream channel for businesses to manage their activities. We model such business activity in a grammar-based framework. The Backus Naur form notation is used to represent the syntax of a regular grammar corresponding to Web log patterns of interest. Then, a deterministic finite state machine is used to parse Web logs against the grammar. Detected tasks are associated with metadata such as time taken to perform the activity, and aggregated along relevant corporate dimensions.