ppxscal/embedding_network huggingface dataset:
Phrase animation generation reflecting impression of words
Authors: Ryou Morita, Takehisa Onisawa
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

This paper proposes a phrase animation generation reflecting impressions of words. The process of generating phrase animations consists of two procedures; impression estimation and animation output. In the former procedure, impressions of an inputted phrase are estimated from impressions of an inputted adjective/adjectival verb. That is derived from the number of co-occurrence on web search between the adjective/adjectival verb and prepared specific words. Experiments are performed in order to confirm validity of outputted phrase animations. As a result, it is found that the phrase animations have the possibility to reflect impressions of inputted adjective/adjectival verb.
Discovering subword associations in strings in time linear in the output size
Authors: Alberto Apostolico, Giorgio Satta
Venue: Journal of Discrete Algorithms (2009)

Given a text string x of n symbols and an integer constant d, we consider the problem of finding, for any pair (y,z) of subwords of x, the tandem index associated with the pair, which is defined as the number of times that y and z occur in tandem (i.e., with no intermediate occurrence of either one of them) within a distance of d symbols of x. Although in principle there might be O(n^4) distinct subword pairs in x, it is seen that it suffices to consider a family of only O(n^2) such pairs, with the property that for any neglected pair (y^',z^') there exists a corresponding pair (y,z) contained in our family such that: (i) y^' is a prefix of y and z^' is a prefix of z; and (ii) the tandem index of (y^',z^') equals that of (y,z). The main contribution of the paper consists of an algorithm showing that the computation of all non-zero tandem indices for a string can be carried out optimally in time and space linear in the size of the output.
Achieving low-cost UMTS networks via pricing
Authors: Saravut Yaipairoj, Fotios Harmantzis
Venue: Netnomics (2008)

One of the main concerns of mobile operators towards deployment of Universal Mobile Telecommunications System (UMTS) networks is the investment cost. The costly radio access network, based on the network equipment required in a service area, prevents incumbents and new entrants from upgrading or building a new UMTS network. In this article, a novel, low-cost approach to the UMTS radio access network design is proposed. The approach employs the use of pricing incentives. This approach is based on the assumption that a pricing mechanism is in place to control excessive traffic load during peak periods. By incorporating this assumption into the network design, the network designer is able to relax certain design parameters, which may contribute to significant savings in equipment cost. Investigation is focused on the UMTS coverage and capacity planning, using the Net Present Value (NPV) financial analysis. For certain price-sensitivity levels, the analysis indicates that this approach provides a suitable strategy for mobile operators to comfortably move forward with UMTS upgrade and gain competitive edge in the wireless market.
Adaptive Search Range Algorithms for Variable Block Size Motion Estimation in H.264/AVC
Authors: Zhenxing Chen, Yang Song, Takeshi Ikenaga, Satoshi Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Comparing with search pattern motion estimation (ME) algorithms, adaptive search range (ASR) algorithms are more fundamental, regular and flexible. In variable block size motion estimation (VBSME), ASR algorithms can be applied whether on a whole frame (frame level), or on an entire macroblock which includes up to forty-one blocks (macroblock level), or just on a single block (block level). In the other hand, in H.264/AVC, not the motion vectors (MVs) but the motion vector differences (MVDs) are coded and the median motion vector predictors (median-MVPs) are used to place the search centers. In this sense, it can be thought that the search windows (SWs) are centered at the positions pointed by median-MVPs, the search ranges (SRs) play the role of limiting MVDs. Thus it is reasonable for considering using MVDs to predict SRs. In this paper, one of the MB level and two of the block level, at all three MVD based SR prediction algorithms are proposed. VBSME based experiments are carried out to assess the proposed algorithms. Comparisons between the proposed three algorithms and the previously proposed one given in [8] are done in terms of encoding quality and computational complexity.
A fuzzy quality control-decision support system for improving operational reliability of liquid transfer operations in laboratory automation
Authors: Hakki Ozgur Unver, Greg Wendel
Venue: Expert Systems with Applications: An International Journal (2009)

Quality control in liquid transfer operations can eliminate false assay results due to transfer failures, monitor the stability of laboratory equipment, provide baselines for continuous improvement, and enable automatic recovery actions for a number of fault conditions. This paper describes the work done to add real-time quality control capability in liquid transfer operations on a closed-loop controlled MEMS based liquid transfer device. Real-time data acquisition enables the interpretation of system variables. Using fuzzy logic as a decision support tool, an overall quality metric and failure mode is deduced from these variables for each channel per operation. Detection of ordinary fault conditions like clogged tips or unexpected empty source wells can activate automatic recovery actions without human intervention, leading to 24/7 utilization of an automated laboratory system. Exported quality data can be used for bio-informatics data analysis as well as documentation for regulatory agencies.
Research on Variable Fin Stabilizers with Double Wings at Zero Speed
Authors: Yu Wang, Chunmei Hua
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The fin stabilizer is used to reduce the roll motion of ship at zero speed, which is a new application of fin stabilizer. In order to study the process of lift generation of fin stabilizer at zero speed, the model of lift generation of fin stabilizer with double variable chord wings is built based on biomimetic theory such as Weis-Fogh mechanism by the conformal representation. By the methods of simulation analysis, the lift characteristics of variable chord Wes-Fogh lift model with different motion law is researched and the results indicate that the different lift characteristics could be provided for ship according to different wave periods by dynamical changing chord length at stated fling law, the lift model proposed could be able to reflect the lift characteristic in still flow field.
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
Authors: Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

In this paper we consider the problem of characterizing the directed graphs that admit an upward straight-line embedding into every point set in convex or in general position. In particular, we show that no biconnected directed graph admits an upward straight-line embedding into every point set in convex position, and we provide a characterization of the Hamiltonian directed graphs that admit upward straight-line embeddings into every point set in general or in convex position. We also describe how to construct upward straight-line embeddings of directed paths into convex point sets and we prove that for directed trees such embeddings do not always exist. Further, we investigate the related problem of upward simultaneous embedding without mapping, proving that deciding whether two directed graphs admit an upward simultaneous embedding without mapping is $\cal NP$-hard.
Informed Virtual Geographic Environments: An Accurate Topological Approach
Authors: Sébastien Paris, Mehdi Mekni, Bernard Moulin
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Virtual Geographic Environment (VGE) technique derives from Geographic Information Systems (GIS) and Virtual Reality (VR). A VGE represents three dimensional geographic data, to target visualisation as well as simulation applications. It is generally built upon a grid-based representation which raises the well-known problems of localised data accuracy and multiple data merging. In this paper we propose a novel approach of VGE using a topological model. This approach provides an exact representation of GIS data, allowing an accurate geometrical exploitation. Moreover, our model can merge and represent several semantic information, even if spatially overlapping. Finally, we illustrate this model with a VGE application which is able to automatically extract the required data from standard GIS files, and which then allows to navigate and retrieve information from the computed VGE.
Design Contribution Square
Authors: Turkka Keinonen
Venue: Advanced Engineering Informatics (2009)

During the last couple of decades a remarkable number of human centered design (HCD) approaches have been introduced. Understanding the differences between more traditional methods and emerging creative approaches has become a non-trivial challenge for practitioners. This article outlines a framework, Design Contribution Square (DCS), for organizing human centered design approaches and assisting in identifying their characteristics. The Square is based on the amount of proactive initiative users and/or designers show in design collaboration. The article presents activity scales describing the participants' design contribution from inactive to proactive, constructs the DCS framework, and positions several human centered design approaches on the framework. It will be shown that a mapping based on the participants' initiative is capable of explicating essential differences between HCD approaches, and consequently, is a feasible tool for planning HCD projects and competence development with human centered approaches.
Why Fodor's Theory of Concepts Fails
Authors: Jussi Jylkkä
Venue: Minds and Machines (2009)

Fodor's theory of concepts holds that the psychological capacities, beliefs or intentions which determine how we use concepts do not determine reference. Instead, causal relations of a specific kind between properties and our dispositions to token a concept are claimed to do so. Fodor does admit that there needs to be some psychological mechanisms mediating the property---concept tokening relations, but argues that they are purely accidental for reference. In contrast, I argue that the actual mechanisms that sustain the reference determining concept tokening relations are necessary for reference. Fodor's atomism is thus undermined, since in order to refer with a concept it is necessary to possess some specific psychological capacities.
FastRoute3.0: a fast and high quality global router based on virtual capacity
Authors: Yanheng Zhang, Yue Xu, Chris Chu
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

As an easily implemented approach, ripup and reroute has been employed by most of today's global routers, which iteratively applies maze routing to refine solution quality. But traditional maze routing is susceptible to get stuck at local optimal results. In this work, we will present a fast and high quality global router FastRoute3.0, with the new technique named virtual capacity. Virtual capacity is proposed to guide the global router at maze routing stage to achieve higher quality results in terms of overflow and runtime. During maze routing stage, virtual capacity works as a substitute for the real edge capacity in calculating the maze routing cost. There are two sub techniques included: (1) virtual capacity initialization, (2) virtual capacity update. Before the maze routing stage, FastRoute3.0 initializes the virtual capacity by subtracting the predicted overflow generated by adaptive congestion estimation (ACE) from the real edge capacity. And in the following maze routing iterations, we further reduce the virtual capacity by the amount of existing overflow (edge usage minus real edge capacity) for the edges that are still congested. To avoid excessive "pushing-away" of routing wires, the virtual capacity is increased by a fixed percentage of the existing overflow if edge usage is smaller than real edge capacity. Experimental results show that FastRoute3.0 is highly proficient dealing with ISPD98, ISPD07 and ISPD08 benchmark suites. The results outperform published ripup and reroute based academic global routers in both routability and runtime. In particular, (1) FastRoute3.0 completes routing all the ISPD98 benchmarks. (2) For ISPD07 and ISPD08 global routing contest benchmarks, it generates 12 out of 16 congestion free solutions. (3) The total runtime is enhanced greatly.
Influence of Mg2+ on the binding modes of HIV-1 integrase with thiazolothiazepine inhibitor studied by molecular simulation
Authors: Lidong Wang
Venue: Computers in Biology and Medicine (2009)

We studied the Influence of Mg^2^+ ions on binding modes of HIV-1 integrase (IN) with thiazolothiazepine (THI) inhibitor by molecular simulation. The results in this work show that the binding process of THI and IN can be divided into two phases, the docking phase and the molecular dynamics (MD) phase. Docking results show that Mg^2^+ ions, the cofactors of HIV-1 IN in vivo, can remarkably affect THI binding on IN. In each chain of HIV-1 IN, two Mg^2^+ ions take part in the docking phase. Each of the two chains of HIV-1 IN dimer contains two Mg^2^+ ions. The Mg^2^+ ion, which binds with ASP64 and ASP116, can result in lower docking energy but higher binding specificity. Another Mg^2^+ ion, which binds with ASP64 and GLU152, is harmful for the THI binding on IN. The synergetic actions of these two Mg^2^+ ions can extend the docking energy range and strengthen the binding affinity. MD simulation results illuminate, in the best docking mode, the IN dimer having two Mg^2^+ ions in each core domain binds with THI conformation of cluster 1. However, this mode has to endure big structure changes so as to reach the stable state. In the MD phase, ASP116, ASN117 and PRO142 of IN show strong interactions with THI. In IN dimer, only these two Mg^2^+ ions binding with ASP64 and ASP116 interact with THI. O8, N9, C10, and S11 of THI are important to the binding.
A new probabilistic routing algorithm for packet-switched computer networks
Authors: Chi-Yuan Chin, Kai Hwang
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

A probabilistic method is proposed for message routing in packet-switched computer networks with distributed control. The routing table associated with each node consists of path entries, instead of branch entries as found in most routing schemes. Packets are assigned with different paths on a probabilistic basis. The path selection is entirely processed at the source node. The routing table is updated dynamically with change of packet-generating rates at all nodes. We introduce a new quantitative measure, path capacity, to model each path as an M/M/1 queue. With the path capacities, routing tables are updated frequently to achieve balanced minimum delays among all paths. The update overhead is a constant, independent of the size of the network. Both analytical and simulation results are presented and compared with the new ARPANET routing method under various traffic conditions. This probabilistic, path-directed routing algorithm performs significantly better than the new ARPANET routing method under moderate and heavy traffic conditions. Under very light traffic conditions, the two methods have almost equal performance. This method can be applied to improve packet routing in any computer communications networks with distributed control.
On/off Detection Method for Reconstructing the Statistics of Quantum Optical States: An Overview
Authors: G. Brida, M. Genovese, M. Gramegna, F. Piacentini, S. Olivares, M. G. A. Paris
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

We give a brief overview of the demontration of a photon statistics recontruction method based on Maximum Likelihood estimation and on/off detection. This method has been succesfully applied to a large number of cases and, recently, extended to a scheme for a full reconstruction of the density matrix. Experimental results concerning the heralded single-photon state and the seeded parametric down-conversion are presented in some details.
A multi threaded and resolution approach to simulated futures evaluation
Authors: David R. Pratt, Robert W. Franceschini, Robert B. Burch, Robert S. Alexander
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

As part of the DARPA Deep Green efforts, SAIC developed a multi-threaded and resolution approach to constructing and evaluating simulated futures to address the SimPath component. By making use of heuristically derived breakpoints in a provided plan, we can construct a series of possible futures that are grouped into what is referred to as the probabilistic fluent graph (PFG). Evaluation of the PFG is done through a multiple resolution and fidelity modeling system that applies computational resources to the areas of highest likelihood. In this paper, we will describe the architecture, processing, and data structures needed to bring this concept to fruition.
An Investigation of Audio-Visual Speech Recognition as Applied to Multimedia Speech Therapy Applications
Authors: Voula C. Georgopoulos
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

A multimedia speech therapy system should be able to be used for customized speech therapy for different problems and for different ages. The speech recognition must be designed to work with high inter- and intra-speaker variability. In addition to displaying text on a screen, recording the voice reading the text, analyzing the recorded spoken signal and performing speech recognition which includes identification of speech irregularities and tracking of patient progress, it should be capable of analyzing visual signal of the patients speech and provide visual as well as audio feedback. This implies that the synchronization of different media is important in realizing effective multimedia speech therapy applications. In order to perform speech recognition and identification tasks, time-frequency analysis and neural networks are proposed with integration of visual information. 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
Approximation by Shepard type pseudo-linear operators and applications to Image Processing
Authors: Barnabás Bede, Emil Daniel Schwab, Hajime Nobuhara, Imre J. Rudas
Venue: International Journal of Approximate Reasoning (2009)

Recently, it has been shown that sum and product are not the only operations that can be used in order to define concrete approximation operators. Several other operations provided by fuzzy sets theory can be used. In the present paper, pseudo-linear approximation operators are investigated from the practical point of view in Image Processing. We study max-min, max-product Shepard type approximation operators together with Shepard operators based on pseudo-operations generated by an increasing continuous generator. It is shown that in several cases these outperform classical approximation operators based on sum and product operations.
A utility-aware middleware architecture for decentralized group communication applications
Authors: Jianjun Zhang, Ling Liu, Lakshmish Ramaswamy, Gong Zhang, Calton Pu
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Although unstructured Peer-to-Peer (P2P) networks provide economical platforms for supporting group communication applications, their ad-hoc nature poses significant challenges to the performance of the group communication services. This paper presents the design and implementation of GroupCast -- a utility-aware middleware architecture for scalable and efficient P2P group communications. The GroupCast design is characterized by two unique features. First, we present a utility function for quantifying the role of unicast links in enhancing the scalability and efficiency of the group communication applications. Second, we develop a utility-aware distributed spanning tree construction algorithm for efficiently propagating group communication messages. It dynamically creates and maintains the group communication channels by optimizing the utility value of the group communication spanning trees. In addition, we also outline a utility-based overlay management protocol for constructing and maintaining low-diameter overlay networks. Our experiments show that the GroupCast system can improve the scalability of wide-area group communication services by one to two orders of magnitude.
An Elementary Course in Partial Differential Equations, 2nd edition
Authors: T. Amaranath
Venue:  (2008)

An Elementary Course in Partial Differential Equations is a concise, 1-term introduction to partial differential equations for the upper-level undergraduate/graduate course in Mathematics, Engineering and Science. Divided into two accessible parts, the first half of the text presents first-order differential equations while the later half is devoted to the study of second-order partial differential equations. Numerous applications and exercises throughout allow students to test themselves on key material discussed.
Kitsou Dubois and the Weightless Body
Authors: Annick Bureaud
Venue: IEEE MultiMedia (2009)

Annick Bureaud, the author of this article, is a key figure in technology, science, and the arts in Europe, through her writing and her organizational work for Leonardo/Olats. Her publications include Connexions: Art, Réseaux, Media in 2002 with Nathalie Magnan (Ensba Press), which brought major texts on art and communication technologies to French speaking audiences, and her articles as a freelance art critic for Art Press, a major French contemporary art magazine. Here she brings to the English-speaking world the work of Kitsou Dubois, a major figure in the European dance world who has been working with issues relating to outer space, weightlessness, and scientific research in dance. Dubois recently began to use sensor technologies.
Discrete event simulation: optimizing patient flow and redesign in a replacement facility
Authors: Marshall Ashby, David Ferrin, Martin Miller, Niloo Shahi
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This study observed the challenges of taking an existing facility's inpatient volumes and procedures and projecting them into a replacement facility with differently sized units, overall scale, and layout. Discrete event simulation is used to examine the impacts of this transition as well as the operational impacts of capacity changes, process redesign, and process improvements. This effort to optimize patient flow throughout the inpatient units is done while modeling and observing the impacts on other interdependent parts of the hospital such as the Emergency Department, and Operating Rooms.