ppxscal/embedding_network huggingface dataset:
Maximum Parsimony for Tree Mixtures
Authors: Stefan Grünewald, Vincent Moulton
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2009)

With the number of sequenced genomes growing ever larger, it is now common practice to concatenate sequence alignments from several genomic loci as a first step to phylogenetic tree inference. However, as different loci may support different trees due to processes such as gene duplication and lineage sorting, it is important to better understand how commonly used phylogenetic inference methods behave on such "phylogenetic mixtures". Here we shall focus on how parsimony, one of the most popular methods for reconstructing phylogenetic trees, behaves for mixtures of two trees. In particular, we show that (i) the parsimony problem is NP-complete for mixtures of two trees, (ii) there are mixtures of two trees that have exponentially many (in the number of leaves) most parsimonious trees, and (iii) give an explicit description of the most parsimonious tree(s) and scores corresponding to the mixture of a pair of trees related by a single TBR operation.
More Moore: foolish, feasible, or fundamentally different?
Authors: Rob Aitken, Jerry Bautista, Wojceich Maly, Jan Rabaey
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Moore's law has been a foundation of modern electronics, sustained primarily by scaling. But can this continue despite the serious problems of litho, variability, device physics, and cost? This panel looks at several possibilities. Perhaps Moore's law will muddle through, as it has so far, with a combination of tools, process, and design. But even if technically possible, Moore's law is in practice driven by economics, and economics might turn against further scaling. Also, we've all seen how performance of single cores has topped out, despite scaling. Might this be a fundamental problem with planar technologies, prompting the need to go 3-D to get further performance increases? Or might CMOS itself give way to other technologies, allowing Moore's law yet another respite? Compare and contrast for yourself these four very different visions of the future of your job, your industry, and your personal gadgets.
Detection of Leak Location in a Pipeline by Acoustic Signal
Authors: Umut Yunus, Masaru Tsunasaki, Yiwei He, Masanobu Kominami, Katsumi Yamashita
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Gas or water leaks in pipes that are buried under ground or that are situated in the walls of buildings may occur due to aging or unpredictable accidents, such as earthquakes. Therefore, the detection of leaks in pipes is an important task and has been investigated extensively. In the present paper, we propose a novel leak detection method by means of acoustic wave. We inject an acoustic chirp signal into a target pipeline and then estimate the leak location from the delay time of the compressed pulse by passing the reflected signal through a correlator. In order to distinguish a leak reflection in a complicated pipeline arrangement, the reflection characteristics of leaks are carefully discussed by numerical simulations and experiments. There is a remarkable difference in the reflection characteristics between the leak and other types of discontinuity, and the property can be utilized to distinguish the leak reflection. The experimental results show that, even in a complicated pipe arrangement including bends and branches, the proposed approach can successfully implement the leak detection. Furthermore, the proposed approach has low cost and is easy to implement because only a personal computer and some commonly equipment are required.
Integration of Distributed User Input to Extend Interaction Possibilities with Local Applications
Authors: Kay Kadner, Stephan Mueller
Venue: Engineering Interactive Systems: EIS 2007 Joint Working Conferences, EHCI 2007, DSV-IS 2007, HCSE 2007, Salamanca, Spain, March 22-24, 2007. Selected Papers (2008)

Computing devices do not offer every modality for interaction that a user might want to choose for interacting with an application. Instead of buying new hardware for extending the interaction capabilities, it should be possible to leverage modalities of independent existing devices that are in the vicinity. Therefore, an architecture has to be developed that gathers events on distributed devices and transfers them to the local device for execution. This allows the user to choose devices even at runtime that are better suited for a particular input task. For a convenient use, the system should support input that can be both independent and dependent from the application. Application-dependent input commands imply that meta-information about the application is provided. Since the system should allow the extension of existing applications, the meta-information has to be provided in a way that is transparent for the application. The following paper describes a system that realises those features.
Abducing chances in hybrid humans as decision makers
Authors: Lorenzo Magnani
Venue: Information Sciences: an International Journal (2009)

As a matter of fact, humans continuously delegate and distribute cognitive functions to the environment to lessen their limits. They build models, representations, and other various mediating structures that are considered to aid thought. In doing these, humans are engaged in a process of cognitive niche construction. In this sense, I argue that a cognitive niche emerges from a network of continuous interplays between individuals and the environment, in which people alter and modify the environment by mimetically externalizing fleeting thoughts, private ideas, etc. into external supports. Through mimetic activities, humans create external semiotic anchors that are the result of a process in which concepts, ideas, and thoughts are projected onto external structures. Once concepts and thoughts are externalized and projected, new chances and ways of inferring come up from the blend. For cognitive niche construction may also contribute to make available a great portion of chances - in terms of information and knowledge - that otherwise would remain simply unexpressed or unreachable. The central part of the paper will illustrate that ''abduction'' - or reasoning to explanatory hypotheses - is also central to understanding some features of the problem of action and decision-making. Abduction prompts action and plays a key role in decision-making, like Peirce teaches: the neurological perspective depicted in this paper also increases knowledge about the distinction between thought and motor action, seeing both aspects as fruit of brain activity. We can say that thought possesses an essential ''motor'' component reflected in brain action but not in actual movement. On the basis of this analysis, I can further illustrate some problems related to the role of abducting chances in decision-making, both in deliberate and in unconscious cases.
Applying adaptive swarm intelligence technology with structuration in web-based collaborative learning
Authors: Yueh-Min Huang, Chien-Hung Liu
Venue: Computers Education (2009)

One of the key challenges in the promotion of web-based learning is the development of effective collaborative learning environments. We posit that the structuration process strongly influences the effectiveness of technology used in web-based collaborative learning activities. In this paper, we propose an ant swarm collaborative learning (ASCL) environment based on a swarm intelligence system (SIS) that structures opportunities for effective collaboration and learning in a dynamic way. The results of our experiments indicate that: (1) the self-organizing behavior of SIS is positively associated with system appropriation; (2) the multi-agent-based mechanism of SIS is positively associated with system appropriation; (3) the cohesive capability of SIS is positively associated with system appropriation; and (4) the learner's tendency toward system appropriation is positively associated with learning effectiveness. Our findings also show that learners in an ASCL environment outperform their counterparts in a general web-based learning (GWL) environment. We conclude that different types of technological support can influence the achievement in a web-based learning environment.
Semantic-Based Temporal Text-Rule Mining
Authors: Kjetil Nørvåg, Ole Kristian Fivelstad
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

In many contexts today, documents are available in a number of versions. In addition to explicit knowledge that can be queried/searched in documents, these documents also contain implicit knowledge that can be found by text mining. In this paper we will study association rule mining of temporal document collections, and extend previous work within the area by 1) performing mining based on semantics as well as 2) studying the impact of appropriate techniques for ranking of rules.
Hybrid- and pseudo-distances in pattern recognition: medical applications
Authors: Horia-Nicolai L. Teodorescu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

We revisit several definitions and concepts related to distances; then, we propose the concept of proto-distance and of discrimination function, in view to better model sensorial discrimination and recognition processes. Applications to medicine, including pedometry, hearing, speech clues, and diagnosis in these fields are briefly discussed.
Dihedral Butterfly Digraph and Its Cayley Graph Representation
Authors: Haruaki Onishi, Yuuki Tanaka, Yukio Shibata
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary. We define a new digraph by adding a signed label to each vertex of the d-ary butterfly digraph. We call this digraph the dihedral butterfly digraph and study its properties. Furthermore, we show that this digraph can be represented as a Cayley graph. It is well known that a butterfly digraph can be represented as a Cayley graph on the wreath product of two cyclic groups [1]. We prove that a dihedral butterfly digraph can be represented as a Cayley graph in two ways.
Translation Divergence in English-Sanskrit-Hindi Language Pairs
Authors: Pawan Goyal, R. Mahesh Sinha
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

The development of a machine translation system needs that we identify the patterns of divergence between two languages. Though a number of MT developers have given attention to this problem, it is difficult to derive general strategies which can be used for any language pair. Therefore, further exploration is always needed to identify different sources of translation divergence in different pairs of translation languages. In this paper, we discuss translation pattern between English-Sanskrit and Hindi-Sanskrit of various constructions to identify the divergence in English-Sanskrit-Hindi language pairs. This will enable us to come up with strategies to handle these situations and coming up with correct translation. The base has been the classification of translation divergence presented by Dorr [Dorr, 1994].
Factors Influencing Computer Literacy of Taiwan and South Korea Nurses
Authors: Hui-Mei Hsu, Ying-Hui Hou, I-Chiu Chang, David C. Yen
Venue: Journal of Medical Systems (2009)

Healthcare is experiencing a major transformation in its information technology base. Hospitals are adopting information technology (IT) to reduce costs and increase competitiveness. IT applications in healthcare are trending towards electronic patient records and even health records. Therefore, practices in nursing are also affected by IT. Many researchers have studied what computer literacy a nurse should possess, but have focused less on factors that actually impact computer literacy. The purposes of this study are to examine current computer literacy levels of nurses, and to indicate what variables influence their computer literacy. Taiwan and South Korea both implemented a national health insurance system, and used state-of-the art IT to provide higher volume and better quality of services. The data were collected from two case hospitals which are located in Taiwan and South Korea, respectively. By using a structured questionnaire, a total of 203 nurses responded; 104 from Taiwan and 99 from South Korea. The results revealed that personal innovativeness in IT, computer education, and age are significant factors that affected computer literacy levels. These factors serve as reference for administrators and executives in hospitals, or nursing educators seeking the data necessary to make decisions on curriculum.
Video File Allocation over Disk Arrays for Video-On-Demand
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

A Video-on-Demand (VOD) server needs to store hundreds of movie titles and to support thousands of concurrent accesses. We define access profile as the number of concurrent accesses to each movie title that should be supported by a VOD server. A current high-end magnetic disk array (disk) can only support tens of MPEG-2 concurrent accesses, and it is necessary to replicate and/or stripe the hot movie files over multiple disk arrays. How to replicate, stripe, and place the movie files over a minimum number of magnetic disk arrays such that a given access profile can be supported is an important problem. In this paper, we formulate and solve this problem. The result of this study can be applied to the design of the storage subsystem of a VOD server to economically minimize the cost or to maximize the utilization of disk arrays. 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
General Highlight Detection in Sport Videos
Authors: Reede Ren, Joemon M. Jose
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

Attention is a psychological measurement of human reflection against stimulus. We propose a general framework of highlight detection by comparing attention intensity during the watching of sports videos. Three steps are involved: adaptive selection on salient features, unified attention estimation and highlight identification. Adaptive selection computes feature correlation to decide an optimal set of salient features. Unified estimation combines these features by the technique of multi-resolution auto-regressive (MAR) and thus creates a temporal curve of attention intensity. We rank the intensity of attention to discriminate boundaries of highlights. Such a framework alleviates semantic uncertainty around sport highlights and leads to an efficient and effective highlight detection. The advantages are as follows: (1) the capability of using data at coarse temporal resolutions; (2) the robustness against noise caused by modality asynchronism, perception uncertainty and feature mismatch; (3) the employment of Markovian constrains on content presentation, and (4) multi-resolution estimation on attention intensity, which enables the precise allocation of event boundaries.
Minimal Simplex for IFS Fractal Sets
Authors: Elena Babače, Ljubiša Kocić
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

Fractal sets manipulation and modeling is a difficult task due to their complexity and unpredictability. One of the basic problems is to determine bounds of a fractal set given by some recursive definitions, for example by an Iterated Function System (IFS). Here we propose a method of bounding an IFS-generated fractal set by a minimal simplex that is affinely identical to the standard simplex. First, it will be proved that for a given IFS attractor, such simplex exists and it is unique. Such simplex is then used for definition of an Affine invariant Iterated Function System (AIFS) that then can be used for affine transformation of a given fractal set and for its modeling.
Carbothermal reduction growth of ZnO nanostructures on sapphire-comparisons between graphite and activated charcoal powders
Authors: M. Biswas, E. McGlynn, M. O. Henry
Venue: Microelectronics Journal (2009)

Zinc oxide (ZnO) nanostructures were grown by the vapour phase transport (VPT) method on a-plane sapphire substrates via carbothermal reduction of ZnO powders with various carbon powders. Specifically, graphite powder and activated charcoal powder (of larger total surface area but similar mesh size) were used. ZnO nanostructures can be grown at lower temperatures (~800^oC) using activated charcoal than those required using graphite powder. Furthermore, the morphologies of ZnO nanostructures obtained using activated charcoal were different to those obtained using graphite. At higher temperatures (~950^oC), where well-aligned nanorods were obtained using graphite powder, no nanostructures were found using activated charcoal. In contrast to previous results on Si substrates we find that the effects on ZnO nanostructure growth on a-sapphire cannot be explained solely in terms of increased Zn vapour pressure due to the enhancement of the carbothermal reduction reaction rate by the high surface area activated charcoal.
A PostScript&reg; tutorial: tutorial presentation
Authors: Jim Clark
Venue: Journal of Computing Sciences in Colleges (2009)

When John Warnock and Chuck Geschke founded Adobe Systems in 1982, they undertook the design of the PostScript programming language --- an outgrowth of Warnockand others' 1976 research project exploring the use of an interpreted language to build large graphical data bases and Warnock's later work related to printing and graphical arts. In 1985 PostScript was used as the page description language (PDL) in the Apple LaserWriter, successfully competing against PDLs developed by HP, Xerox, and IBM to become the de-facto standard.
Adjustment-based modeling for statistical static timing analysis with high dimension of variability
Authors: Lin Xie, Azadeh Davoodi, Jun Zhang, Tai-Hsuan Wu
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

This paper presents an adjustment-based modeling framework for Statistical Static Timing Analysis (SSTA) when the dimension of parameter variability is high. Instead of building a complex model between the circuit timing and parameter variability, we build a model which adjusts an approximate variation-aware timing into an accurate one. The intuition is that it is simpler to build a model which adjusts an approximate estimate into an accurate one. It is also more efficient to obtain an approximate circuit timing model. The combination of these two observations makes the use of an adjustment-based model a good choice for SSTA with high dimension of parameter variability. To build the adjustment model, we use a simulation-based approach, which is based on Gaussian Process. Combined with intelligent sampling, we show that an adjustment-based model can more effectively capture the nonlinearity of the circuit timing with respect to parameter variability compared to polynomial modeling. We also show that with only 200 samples of the circuit timing and 42 independent parameter variations, adjustment-based modeling obtains higher accuracy than direct SSTA using quadratic modeling.
Hermite WENO Schemes and Their Application as Limiters for Runge-Kutta Discontinuous Galerkin Method, III: Unstructured Meshes
Authors: Jun Zhu, Jianxian Qiu
Venue: Journal of Scientific Computing (2009)

In [J. Comput. Phys. 193:115---135, 2004] and [Comput. Fluids 34:642---663, 2005], Qiu and Shu developed a class of high order weighted essentially non-oscillatory (WENO) schemes based on Hermite polynomials, termed HWENO (Hermite WENO) schemes, for solving nonlinear hyperbolic conservation law systems, and applied them as limiters for the Runge-Kutta discontinuous Galerkin (RKDG) methods on structured meshes. In this continuation paper, we extend the method to solve two dimensional problems on unstructured meshes. The emphasis is again on the application of such HWENO finite volume methodology as limiters for RKDG methods to maintain compactness of RKDG methods. Numerical experiments for two dimensional Burgers' equation and Euler equations of compressible gas dynamics are presented to show the effectiveness of these methods.
An algebraic characterization of the optimum of regularized kernel methods
Authors: Francesco Dinuzzo, Giuseppe Nicolao
Venue: Machine Learning (2009)

The representer theorem for kernel methods states that the solution of the associated variational problem can be expressed as the linear combination of a finite number of kernel functions. However, for non-smooth loss functions, the analytic characterization of the coefficients poses nontrivial problems. Standard approaches resort to constrained optimization reformulations which, in general, lack a closed-form solution. Herein, by a proper change of variable, it is shown that, for any convex loss function, the coefficients satisfy a system of algebraic equations in a fixed-point form, which may be directly obtained from the primal formulation. The algebraic characterization is specialized to regression and classification methods and the fixed-point equations are explicitly characterized for many loss functions of practical interest. The consequences of the main result are then investigated along two directions. First, the existence of an unconstrained smooth reformulation of the original non-smooth problem is proven. Second, in the context of SURE (Stein's Unbiased Risk Estimation), a general formula for the degrees of freedom of kernel regression methods is derived.
General-purpose integrated indexing circuits: a proposal
Authors: A. C. D. De Figueiredo
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

For applications requiring irregular forms of addressing, the high speed of operation of present day random-access memories and large-scale-integrated arithmetic structures can hardly lead to any significant improvements over conventional techniques unless appropriate means are used for addressing the operands at comparable speeds. This paper proposes the architecture for an integrated indexing unit intended for high-speed generation of the addressing patterns required for a wide range of such applications. Reference is made to the usefulness of the proposed unit for the organization of fast array processing attachments to conventional minicomputers and microcomputers.
Geometrical Analysis of Model Predictive Control: A Parameterized Polyhedra Approach
Authors: S. Olaru, I. Dumitrache, D. Dumur
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The paper deals with the receding horizon optimal control schemes. The presence of input and state constraints is shown to lead at the implementation stage to the resolution of a parametric optimization problem. A geometrical analysis of the set of constraints can be done using the concept of parameterized polyhedra.