ppxscal/embedding_network huggingface dataset:
Standardization initiatives in the (eco)toxicogenomics domain: a review: Conference Papers
Authors: Susanna Assunta Sansone, Norman Morrison, Philippe Rocca-Serra, Jennifer Fostel
Venue: Comparative and Functional Genomics (2004)

The purpose of this document is to provide readers with a resource of different ongoing standardization efforts within the &lsquo;omics&rsquo; (genomic, proteomics, metabolomics) and related communities, with particular focus on toxicological and environmental applications. The review includes initiatives within the research community as well as in the regulatory arena. It addresses data management issues (format and reporting structures for the exchange of information) and database interoperability, highlighting key objectives, target audience and participants. A considerable amount of work still needs to be done and, ideally, collaboration should be optimized and duplication and incompatibility should be avoided where possible. The consequence of failing to deliver data standards is an escalation in the burden and cost of data management tasks. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Space&ndash;time blending: Research Articles
Authors: Galina Pasko, Alexander Pasko, Tosiyasu Kunii
Venue: Computer Animation and Virtual Worlds (2004)

Shape transformation between objects of different topology and positions in space is an open modelling problem. We propose a new approach to solving this problem for two given 2D or 3D shapes. The key steps of the proposed algorithm are: increase dimension by converting two input kD shapes into half-cylinders in (k+1)D space&ndash;time, applying bounded blending with added material to the half-cylinders, and making cross-sections for getting intermediate shapes under the transformation. The additional dimension is considered as a time coordinate for making animation. We use the bounded blending set operations in space&ndash;time defined using R-functions and displacement functions with the localized area of influence applied to the functionally defined half-cylinders. The proposed approach is general enough to handle input shapes with arbitrary topology defined as polygonal objects with holes and disjoint components, set-theoretic objects, or analytically defined implicit surfaces. The obtained unusual amoeba-like behaviour of the shape combines metamorphosis with the non-linear motion. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Segmentation Induced by Scale Invariance
Authors: Stella X. Yu
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Perceptual organization is scale-invariant. In turn, a segmentation that separates features consistently at all scales is the desired one that reveals the underlying structural organization of an image. Addressing cross-scale correspondence with interior pixels, we develop this intuition into a general segmenter that handles texture and illusory contours through edges entirely without any explicit characterization of texture or curvilinearity. Experimental results demonstrate that our method not only performs on par with either texture segmentation or boundary completion methods on their specialized examples, but also works well on a variety of real images.
Optimization of Internet Protocol network design and routing
Authors: Kaj Holmberg, Yves Carbonneaux
Venue: Networks (2004)

We consider network design and routing for Internet Protocol &lpar;IP&rpar; traffic. The design problem concerns capacity dimensioning of communication links, where the design cost consists of fixed charges and linear capacity expansion costs. The optimization problem also concerns determining the amount of traffic demand to be carried by the network and the metric used by a shortest path routing protocol. We present a novel linear mixed-integer mathematical formulation and two heuristic solution procedures. The first heuristic uses mixed-integer programming to generate a sequence of routing solutions. The second solution approach is a simulated annealing meta heuristic. Computational experiments for synthesized and real-life networks show that high-quality solutions can be obtained by both approaches. &copy; 2003 Wiley Periodicals, Inc.
A closed-loop tactor frequency control system for vibrotactile feedback
Authors: Justin Cohen, Masataka Niwa, Robert W. Lindeman, Haruo Noma, Yasuyuki Yanagida, Kenichi Hosaka
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In this paper, we address the problem of maintaining a precise frequency in vibrating motors for use as vibrotactile cueing devices. Our solution utilizes a piezoelectric film sensor that measures the motor frequency and uses a feedback-loop circuit to dynamically adjust the motor power to maintain the target frequency. We confirmed the accuracy of the film with a laser sensor and tested the ability of the feedback system to match a target frequency by changing the physical load placed on the motor. A user study showed that subjects perceived a difference in vibration intensity under loaded conditions with and without our compensation system, indicating the usefulness of such a feedback system on influencing perception. The results can help designers create better interfaces when vibrotactile cues are employed.
Robocode: a fun way to learn to program
Authors: Ken Hartness, Brian Culver
Venue: Journal of Computing Sciences in Colleges (2004)

CS 1 instructors have the difficult task of trying to maintain interest in programming while their students are learning enough to write interesting programs. One way to do so is to provide students with a working program and have them modify parts of it as they learn enough to do so. Robocode [1] is a game that supports virtual robot battles. The behavior of each robot is specified by a Java object that can embody a simple sequence of commands or a complicated subprogram. This tutorial introduces these robots' capabilities with exercises intended to reflect the learning curve of a typical student in a CS 1 course.
Learning program helps win national fleet wargame tournament
Authors: Doug Lenat
Venue: Issue 79 (January 1982) (1982)

During the month of June 1981, the EURISKO program was set the task of exploring the design of naval fleets conforming to a body of (several hundreds of) rules and constraints as set forward in Traveller: The Trillion Credit Squadron. EURISKO designed a fleet of ships suitable for entry in the 1981 Origins national wargame tournament, held at Dunfey's Hotel, in San Mateo, Ca., over July 4 weekend. The Traveller tournament, run by Game Designers Workshop (based in Normal, Illinois), was single elimination, six rounds. EURISKO's fleet won that tournament, thereby becoming the ranking player in the United States (and also an honorary Admiral in the Traveller navy). This win is made more significant by the fact that the program's creator, Professor Douglas Lenat of Stanford University's Heuristic Programming Project, had never played this game before, nor any miniatures battle game of this type.
Cognition and the Power of Continuous Dynamical Systems
Authors: Whit Schonbein
Venue: Minds and Machines (2005)

Traditional approaches to modeling cognitive systems are computational, based on utilizing the standard tools and concepts of the theory of computation. More recently, a number of philosophers have argued that cognition is too `subtle' or `complex' for these tools to handle. These philosophers propose an alternative based on dynamical systems theory. Proponents of this view characterize dynamical systems as (i) utilizing continuous rather than discrete mathematics, and, as a result, (ii) being computationally more powerful than traditional computational automata. Indeed, the logical possibility of such `super-powerful' systems has been demonstrated in the form of analog artificial neural networks. In this paper I consider three arguments against the nomological possibility of these automata. While the first two arguments fail, the third succeeds. In particular, the presence of noise reduces the computational power of analog networks to that of traditional computational automata, and noise is a pervasive feature of information processing in biological systems. Consequently, as an empirical thesis, the proposed dynamical alternative is under-motivated: What is required is an account of how continuously valued systems could be realized in physical systems despite the ubiquity of noise.
Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm
Authors: Hai Xian Wang, Bin Luo, Quan Bing Zhang, Sui Wei
Venue: Pattern Recognition Letters (2004)

The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm.
Operational Management Contracts for Adaptive Software Organisation
Authors: Alan Colman, Jun Han
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

As modern computing environments become more open, distributed and pervasive, the software we build for those dynamic environments will need to become more adaptable and adaptive. We have previously introduced the ROAD framework for creating flexible and adaptive software structures. This framework is built on a distinction between functional and management roles. Management roles participate in contracts that regulate the global-flow of control through a structure of objects and roles. This paper shows how these operational-management contracts can be defined. Such contracts specify the permissible interactions between objects playing functional roles within an organisational structure. Association aspects are shown to have the expressiveness needed to represent such management contracts.
Auto-configuration by File Construction: Configuration Management with newfig
Authors: William LeFebvre, David Snyder
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

A tool is described that provides for the automatic configuration of systems from a single description. The tool, newfig, uses two simple concepts to provide its functionality: boolean logic for making decisions and file construction for generating the files. Newfig relies heavily on external scripts for anything beyond the construction of files. This simple yet powerful design provides a mechanism that can easily build on other tools rather than a single monolithic stand-alone program. This provides for a great deal of flexibility while maintaining simplicity. The language is a combination of boolean logic and output statements, and also provides for macros and other essential elements. All output is written to channels: an abstraction which provides for extensive configurability. Examples are provided that show the tool's power and flexibility. A description is also provided of the efforts undergone at CNN to integrate this tool in to a sizable infrastructure. The paper concludes with a discussion of future improvements.
Playing around in the CS curriculum: reversi as a teaching tool
Authors: David W. Valentine
Venue: Journal of Computing Sciences in Colleges (2005)

The checkerboard game of Reversi has been used successfully to stimulate student enthusiasm in computer science classrooms ranging from CS1 up through Distributed Processing. There is a respectable research literature attesting to its success as a pedagogical tool. This paper briefly describes the game, and then surveys the relevant research literature. It goes on to describe a simple, yet powerful, version of the game built upon a model of human cognition. Finally, the actual use of the game in a tournament setting for a CS2 course is described.
A testbed for performance evaluation of load-balancing strategies for Web server systems
Authors: Dheeraj Sanghi, Pankaj Jalote, Puneet Agarwal, Nitin Jain, Supriyo Bose
Venue: Software&mdash;Practice Experience (2004)

To improve response time of a Web site, one replicates the site on multiple servers. The effectiveness of a replicated server system will depend on how the incoming requests are distributed among replicas. A large number of load-balancing strategies for Web server systems have been proposed.In this paper we describe a testbed that can be used to evaluate the performance of different load-balancing strategies. The testbed uses a general architecture which allows different load-balancing approaches to be supported easily. It emulates a typical World Wide Web scenario and allows variable load generation and performance measurement. We have performed some preliminary experiments to measure the performance of a few policies for load balancing using this testbed. Copyright &copy; 2003 John Wiley & Sons, Ltd.
Implementation and Evaluation of a Java Based Computational Grid for Bioinformatics Applications
Authors: Chao-Tung Yang, Yi-Chun Hsiung, Heng-Chuan Kan
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In the present study, THUBioGrid, an experimental distributed computing application for bioinformatics (BioGrid) is proposed. THUBioGrid incorporates directory services (data and software), grid computing methods (security, authentication, data transport and remote jobs), and gene sequence/genomic data processing methods. It uses Java CoG Kit plus bioinformatics Java packages to perform various computational tasks. The performance of THUBioGrid has been tested by executing the FASTA and mpiBLAST programs for protein sequence alignment applications. Results demonstrate the speed-up effects with increasing number of processors used in the computations.
A Discontinuous Galerkin Method for Three-Dimensional Shallow Water Equations
Authors: Clint Dawson, Vadym Aizinger
Venue: Journal of Scientific Computing (2005)

We describe the application of a local discontinuous Galerkin method to the numerical solution of the three-dimensional shallow water equations. The shallow water equations are used to model surface water flows where the hydrostatic pressure assumption is valid. The authors recently developed a DG\linebreak method for the depth-integrated shallow water equations. The method described here is an extension of these ideas to non-depth-integrated models. The method and its implementation are discussed, followed by numerical examples on several test problems.
A New Navigation Method for an Automatic Guided Vehicle
Authors: Chen Wuwei, James K. Mills, Shi Wenwu
Venue: Journal of Robotic Systems (2004)

This paper presents a new navigation method for an automatic guided vehicle (AGV). This method utilizes a new navigation and control scheme based on searching points on an arc. Safety measure indices are defined and are generated from the output of a fuzzy neural network which define the actions the AGV is to take when in the presence of obstacles. The proposed algorithm integrates several functions required for automatic guided vehicle navigation and tracking control and it exhibits satisfactory performance when maneuvering in complex environments. The automatic guided vehicle with this navigation control system not only can quickly process environmental information, but also can efficiently avoid dynamic or static obstacles, and reach targets safely and reliably. Extensive simulation and experimental results demonstrate the effectiveness and correct behavior of this scheme. &copy; 2004 Wiley Periodicals, Inc.
A New Hybrid Methodology for Intelligent Chinese Character Recognition
Authors: David Al-Dabass, David Evans, Manling Ren
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

A new methodology is proposed to combine fuzzy possibilistic reasoning with knowledge mining of syntax dynamics using hybrid recurrent nets. The structure of Chinese characters consist of a 3-layer hierarchy of character, radical and stroke. Fuzzy possibilistic reasoning is an appropriate set of algorithmic tools to aid automatic recognition of these characters. Associative memory artificial neural network algorithms form a suitable technique for realising these concepts. Several issues are explored: vagueness of radicals, their situation, position invariance, extraction order and shape. Hybrid recurrent nets are proposed to deal with recognition at the syntax level. Each character is the 2-D output of a syntax generating system which is subjected to a knowledge mining process to determine its behaviour parameters. The knowledge mining architecture consists of an extensible recurrent hybrid net hierarchy of multi-agents where the composite behaviour of agents at any one level is determined by those of the level immediately below.
Generating XSLT scripts for the fast transformation of XML documents
Authors: Dong-Hoon Shin, Kyong-Ho Lee
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper proposes a method of generating XSLT scripts, which support the fast transformation of XML documents, given one-to-one matching relationships between leaf nodes of XML schemas. The proposed method enhances the transformation speed of generated XSLT scripts through reducing template calls. Experimental results show that the proposed method has generated XSLT scripts that support the faster transformation of XML documents, compared with previous works.
Using Bayesian networks for monitoring computer users
Authors: Yu. V. Kapitonova, N. M. Mishchenko, O. D. Felizhanko, N. N. Shchegoleva
Venue: Cybernetics and Systems Analysis (2005)

The structure and methods of a knowledgebase are discussed. This knowledgebase is considered to be a component part of personal expert systems designed for monitoring computer users and computer environments with a view to detecting a harmful effect of computers on the state of health of computer users and making recommendations concerning the neutralization of this effect. Such expert systems are based on Bayesian networks that have a simple topology and represent random relations between harmful conditions of a computer environment and the state of help of users.
Interview with Rick Mandler
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2005)

Interview with Rick Mandler (April 18, 2005) Rick Mandler is vice president and general manager of Walt Disney Internet Group and ABCs Enhanced TV (http://corporate.disney.go.com/wdig/bios/rick_mandler.html). He and his teams have won two Emmys for their interactive TV programs. In the video interview, you will hear Ricks answers to the following questions: What are the two Emmy award winning Interactive TV applications? Video 1 Are there more interactive TV programs planned to run on the Windows XP Media Center Edition PC platform? Video 2 How do you see the future of 2-screen applications vs. single-screen applications? Video 3 I would imagine that it is easier to add interactivity to a sporting event than to a sitcom. How do you determine which television programs lend themselves to interactivity? Video 4 How important is interactive television to ABC? Video 5
Illinois debris-mitigation EUV applications laboratory
Authors: B. E. Jurczyk, E. Vargas-Lopez, M. N. Neumann, D. N. Ruzic
Venue: Microelectronic Engineering (2005)

Gaseous discharge light sources are leading candidates for generating 13.5 nm wavelengths needed for next-generation optical lithography. Electrode debris reaching the first collector optic is a serious concern for device lifetime and cost of ownership. This paper describes the experimental setup and initial data obtained for testing secondary-plasma-based debris mitigation for EUV gas discharge light sources. Operation of a dense plasma focus, secondary RF debris mitigation system, and several in situ diagnostics were successfully tested, achieving first measurements for debris attenuation. It was also found that fast ion and fast neutral particle erosion processes at the optical mirror location dominate over deposition of sputtered metal if a collimator or ''foil trap'' is positioned between the hot pinch plasma and the first collector optic.
Analytic residues along algebraic cycles
Authors: Carlos A. Berenstein, Alekos Vidras, Alain Yger
Venue: Journal of Complexity (2005)

Let W be a q-dimensional irreducible algebraic subvariety in the affine space ACn, P1, ..., Pmm elements in C[X1, ..... Xn], and V(P) the set of common zeros of the Pj's in Cn. Assuming that |W| is not included in V(P), one can attach to P a family of nontrivial W-restricted residual currents in 'D0,k(Cn), 1≤k≤min(m,q), with support on |W|. These currents (constructed following an analytic approach) inherit most of the properties that are fulfilled in the case q = n. When the set |W| ∩ V(P) is discrete and m = q, we prove that for every point α ∈ |W| ∩ V(P) the W-restricted analytic residue of a (q,0)-form R dζI, R ∈ C[X1, ..., Xn], at the point α is the same as the residue on W (completion of W in Proj C[X0, ..., Xn], at the point α in the sense of Serre (q = 1) or Kunz-Lipman (1<q<n) of the q-differential form (R/P1 ... Pq)dζI. We will present a restricted affine version of Jacobi's residue formula and applications of this formula to higher dimensional analogues of Reiss (or Wood) relations, corresponding to situations where the Zariski closures of |W| and V(P) intersect at infinity in an arbitrary way.
Why use memo for all?: restructuring mobile applications to support informal note taking
Authors: Liwei Dai, Wayne G. Lutters, Carlie Bower
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Informal note taking is an essential activity in Personal Information Management (PIM). Most mobile devices support this via a suite of applications, employing both highly structured (e.g., calendar, task list, contacts) and loosely structured (e.g., memos) data formats. Contextual interviews and artifact inspections with expert PIM-on-PDA (Personal Digital Assistant) users explored task-to-application mapping. Structured tools were routinely avoided for informal note taking in favor of unstructured ones, even though this made managing the information more difficult. Improved support lies somewhere in between, suggesting the design of an integrated architecture, which links data across all PIM tools and provides a persistent, universal organizational system.
New Books
Authors: Keith Price
Venue: Issue 109 (July 1989) (1989)

This work presents a theory of planning called Case-Based Planning that suggests the use of a planner's dynamic memory of experience rather than a static base of rules. This view of planning from experience is supported by a learning system that incorporates new experiences into the planner's episodic memory. A process of plan repair is also presented in which plan failures are diagnosed through a casual analysis of the steps and states that led to their occurrence. Successful plans, failures, and past repairs are stored, with successes being accessed and modified to create new plans, failures being used to warn the planner of impending problems, and repair strategies being referenced to tell the planner how to deal with faulty plans at hand. By storing failures as well as successes, the planner is able to anticipate and avoid future plan failures. These ideas of memory, learning, and planning are implemented in the case-based planner CHEF, which creates new plans in the domain of Szechwan cooking. 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