ppxscal/embedding_network huggingface dataset:
AlexVG: An OpenVG implementation with SVG-Tiny support
Authors: Hwanyong Lee, Nakhoon Baek
Venue: Computer Standards Interfaces (2009)

Embedded systems and web browsers have started to provide two-dimensional vector graphics features, to finally support scalability of graphics outputs, while traditional graphics systems have focused on the raster and bitmap operations. Nowadays, SVG and Flash are actively used and OpenVG from Khronos group plays the role of a de facto low-level API standard to support them. In this paper, we represent the design and implementation process and the final results of the first commercial OpenVG implementation, AlexVG. From its design stage, our implementation aims at the cooperation with SVG-Tiny, another de facto standard for embedded systems. Currently, our overall system provides not only the OpenVG core features but also a variety of OpenVG application programs and SVG-Tiny media file playing capabilities. For the conformance with the standard specifications, our system completely passed the whole OpenVG conformance test suites and the graphics output portions of the SVG-Tiny conformance test suites. From the performance point of view, we focused on the efficiency and effectiveness especially on the mobile phones and embedded devices with limited resources. As the result, it showed impressive benchmarks on the small-scale CPUs such as ARMs, even without neither any other libraries nor acceleration hardware. We had started commercial services of our AlexVG products since September 2005, and successfully entered the retail market with a good deal of mobile phones up to the present time.
Bayesian models for two-sample time-course microarray experiments
Authors: Claudia Angelini, Daniela De Canditiis, Marianna Pensky
Venue: Computational Statistics Data Analysis (2009)

A truly functional Bayesian method for detecting temporally differentially expressed genes between two experimental conditions is presented. The method distinguishes between two biologically different set ups, one in which the two samples are interchangeable, and one in which the second sample is a modification of the first, i.e. the two samples are non-interchangeable. This distinction leads to two different Bayesian models, which allow more flexibility in modeling gene expression profiles. The method allows one to identify differentially expressed genes, to rank them and to estimate their expression profiles. The proposed procedure successfully deals with various technical difficulties which arise in microarray time-course experiments, such as small number of observations, non-uniform sampling intervals and presence of missing data or repeated measurements. The procedure allows one to account for various types of error, thus offering a good compromise between nonparametric and normality assumption based techniques. In addition, all evaluations are carried out using analytic expressions, hence the entire procedure requires very little computational effort. The performance of the procedure is studied using simulated and real data.
An Improved Method for Designing Prototype Filter for M-Band Pseudo QMF Banks
Authors: A. Kumar, G. K. Singh, R. S. Anand
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This paper presents an iterative algorithm for the design of multichannel cosine modulated pseudo quadrature mirror filter (QMF) banks. In this algorithm, passband frequency is optimized to satisfy new perfect reconstruction condition at frequency ( ). The proposed algorithm is simple, and has high design efficiency. The performance of this algorithm is evaluated in terms of computational time (CPU time), reconstruction error (RE), number of iterations (NOI), aliasing distortion (AD) and signal to noise ratio (SNR). Several design examples are included to illustrate the proposed algorithm and its improved performances over other exiting methods.
Note: On bipartite graphs with minimal energy
Authors: Xueliang Li, Jianbin Zhang, Lusheng Wang
Venue: Discrete Applied Mathematics (2009)

The energy of a graph is the sum of the absolute values of the eigenvalues of the graph. In a paper [G. Caporossi, D. Cvetkovi, I. Gutman, P. Hansen, Variable neighborhood search for extremal graphs. 2. Finding graphs with external energy, J. Chem. Inf. Comput. Sci. 39 (1999) 984-996] Caporossi et al. conjectured that among all connected graphs G with n>=6 vertices and n-1@?m@?2(n-2) edges, the graphs with minimum energy are the star S"n with m-n+1 additional edges all connected to the same vertices for m@?n+@?(n-7)/2@?, and the bipartite graph with two vertices on one side, one of which is connected to all vertices on the other side, otherwise. The conjecture is proved to be true for m=n-1,2(n-2) in the same paper by Caporossi et al. themselves, and for m=n by Hou in [Y. Hou, Unicyclic graphs with minimal energy, J. Math. Chem. 29 (2001) 163-168]. In this paper, we give a complete solution for the second part of the conjecture on bipartite graphs. Moreover, we determine the graph with the second-minimal energy in all connected bipartite graphs with n vertices and m(n@?m@?2n-5) edges.
K-12 computer science certification in Missouri: panel discussion
Authors: Tim DeClue
Venue: Journal of Computing Sciences in Colleges (2009)

Computer Science is not a certifiable area in Missouri, although twenty-five states currently certify computer science as a teaching area in the U.S. at some level. The Computer Science Teacher's Association (CSTA) has called for certification standards across the United States, and has produced a model curriculum for computer science. Accrediting bodies for schools of education currently accredit computer science programs for producing K-12 teachers. Many feel that one primary reason fewer students are choosing to major in computer science in college is because high school students are never exposed to computer science prior to entering college.
Expanding the benefits of computational thinking to diverse populations: Graduate student consortium
Authors: John F. Pane, Susan Wiedenbeck
Venue: Proceedings of the 2008 IEEE Symposium on Visual Languages and Human-Centric Computing (2008)

The sixth annual graduate consortium at VL/HCC addresses the question: How can researchers and designers of end-user development environments support computational problem-solving and information manipulation by diverse user populations?
Text Mining in Radiology Reports
Authors: Tianxia Gong, Chew Lim Tan, Tze Yun Leong, Cheng Kiang Lee, Boon Chuan Pang, C. C. Tchoyoson Lim, Qi Tian, Suisheng Tang, Zhuo Zhang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Medical text mining has gained increasing interest in recent years. Radiology reports contain rich information describing radiologist’s observations on the patient’s medical conditions in the associated medical images. However, as most reports are in free text format, the valuable information contained in those reports cannot be easily accessed and used, unless proper text mining has been applied. In this paper, we propose a text mining system to extract and use the information in radiology reports. The system consists of three main modules: a medical finding extractor, a report and image retriever, and a text-assisted image feature extractor. In evaluation, the overall precision and recall for medical finding extraction are 95.5% and 87.9% respectively, and for all modifiers of the medical findings 88.2% and 82.8% respectively. The overall result of report and image retrieval module and text-assisted image feature extraction module is satisfactory to radiologists.
Structural Formalization of Design-Pattern Based Software Design
Authors: Pushpendra B. Singh, Banshi D. Chaudhary
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper, we present a formalism to represent pattern-based design of an application in terms of design-patterns, their instances, glue, operators and their required parameter-sets. These operators include instantiation, evolution and composition. Structural formalism is modeled in terms of entities and relationship between them. Constraints are defined for entities and relationship between them and these must be honored during composition to ensure the consistency of resultant design. Design pattern composition generally need additional design elements either for efficiency consideration or due to application need. We call such elements as glue. We have also modeled glue using same abstraction as of patterns. We demonstrate our model through an application design example.
A Graphical Model Based Decoder for Recognition of Loss-concealed VoIP Speech
Authors: A. Mandal, K. R. Prasanna Kumar, G. Athithan, C. Chandra Sekhar
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In the recognition of Voice Over Internet Protocol(VoIP) speech, packet losses pose a challenge that is generally addressed by packet loss concealment (PLC)techniques. But improper concealment by these PLC techniques result in unreliable observations that contribute adversely to the Viterbi decoding step and result in misrecognitions. We propose a graphical model based decoding architecture that can skip unreliable observations and hence the corresponding states, so that recognition accuracy improves in spite of improper concealment. Experimental validation of the proposed skip decoder is carried out using the loss-concealed speech samples of isolated words. Results indicate the efficacy of the skip decoder in the improvement of the recognition accuracy for different lengths of burst losses and different PLC schemes.
Spectral domain embedding for elliptic PDEs in complex domains
Authors: S. H. Lui
Venue: Journal of Computational and Applied Mathematics (2009)

Spectral methods are a class of methods for solving partial differential equations (PDEs). When the solution of the PDE is analytic, it is known that the spectral solutions converge exponentially as a function of the number of modes used. The basic spectral method works only for regular domains such as rectangles or disks. Domain decomposition methods/spectral element methods extend the applicability of spectral methods to more complex geometries. An alternative is to embed the irregular domain into a regular one. This paper uses the spectral method with domain embedding to solve PDEs on complex geometry. The running time of the new algorithm has the same order as that for the usual spectral collocation method for PDEs on regular geometry. The algorithm is extremely simple and can handle Dirichlet, Neumann boundary conditions as well as nonlinear equations.
Note: On averaging Frankl's conjecture for large union-closed-sets
Authors: Gábor Czédli
Venue: Journal of Combinatorial Theory Series A (2009)

Let F be a union-closed family of subsets of an m-element set A. Let n=|F|>=2 and for a@?A let s(a) denote the number of sets in F that contain a. Frankl's conjecture from 1979, also known as the union-closed sets conjecture, states that there exists an element a@?A with n-2s(a)==3 and n>=2^m-2^m^/^2. Moreover, for these ''large'' families F we prove an even stronger version via averaging. Namely, the sum of the n-2s(a), for all a@?A, is shown to be non-positive. Notice that this stronger version does not hold for all union-closed families; however we conjecture that it holds for a much wider class of families than considered here. Although the proof of the result is based on elementary lattice theory, the paper is self-contained and the reader is not assumed to be familiar with lattices.
Auditory sparse representation for robust speaker recognition based on tensor structure
Authors: Qiang Wu, Liqing Zhang
Venue: EURASIP Journal on Audio, Speech, and Music Processing (2008)

This paper investigates the problem of speaker recognition in noisy conditions. A new approach called nonnegative tensor principal component analysis (NTPCA) with sparse constraint is proposed for speech feature extraction. We encode speech as a general higher-order tensor in order to extract discriminative features in spectrotemporal domain. Firstly, speech signals are represented by cochlear feature based on frequency selectivity characteristics at basilar membrane and inner hair cells; then, low-dimension sparse features are extracted by NTPCA for robust speaker modeling. The useful information of each subspace in the higher-order tensor can be preserved. Alternating projection algorithm is used to obtain a stable solution. Experimental results demonstrate that our method can increase the recognition accuracy specifically in noisy environments.
A Simple FFSK Modulator and Its Coherent Demodulator
Authors: Dayan Adionel GuimarÃEs
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this letter, a simple binary Fast Frequency Shift Keying (FFSK) modulator and its coherent demodulator is proposed. The performance of the proposed modem is in between a coherently detected and a non-coherently detected binary FSK, but its bandwidth requirement is the same as for the Minimum Shift Keying (MSK) modulation.
Text Cube: Computing IR Measures for Multidimensional Text Database Analysis
Authors: Cindy Xide Lin, Bolin Ding, Jiawei Han, Feida Zhu, Bo Zhao
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Since Jim Gray introduced the concept of ”data cube” in 1997, data cube, associated with online analytical processing (OLAP), has become a driving engine in data warehouse industry. Because the boom of Internet has given rise to an ever increasing amount of text data associated with other multidimensional information, it is natural to propose a data cube model that integrates the power of traditional OLAP and IR techniques for text. In this paper, we propose a Text-Cube model on multidimensional text database and study effective OLAP over such data. Two kinds of hierarchies are distinguishable inside: dimensional hierarchy and term hierarchy. By incorporating these hierarchies, we conduct systematic studies on efficient text-cube implementation, OLAP execution and query processing. Our performance study shows the high promise of our methods.
101 Secretos de Vista
Authors: De Luca, Damian, Pea Millahual, Claudio
Venue:  (2008)

In this book you will find the necessary information to give a boost to your PC, turn it into a fortress against all types of attacks, surf the Net faster, and make the best out the latest Windows version.
A confidential and DoS-resistant multi-hop code dissemination protocol for wireless sensor networks
Authors: Hailun Tan, Diethelm Ostry, John Zic, Sanjay Jha
Venue: Proceedings of the second ACM conference on Wireless network security (2009)

Code dissemination protocols provide a convenient way to update program images via wireless communication. Due to the open environment in which Wireless Sensor Networks (WSNs) are typically deployed, it is important that a code dissemination protocol ensures that a program image update can be authenticated as coming from a trusted source. In some applications it is also required that the data be kept confidential in spite of the possibility of message interception. Authentication and confidentiality are implemented through cryptographic operations which may be expensive in power consumption, making a protocol with these features vulnerable to attack by an adversary who transmits forged data, forcing nodes to waste energy in identifying it as invalid i.e., a signature-based DoS attack). Additionally, in multi-hop dissemination protocols, each sensor node is required to broadcast its program image when requested by its neighbors. An adversary could repeatedly send spurious program image requests to its neighbors, making them exhaust their energy reserves i.e., request-based DoS attack). In this paper, we present a new approach to achieve confidentiality in multi-hop code dissemination. We propose counter-measures against both types of DoS attacks mentioned above. To our knowledge, we are the first to integrate confidentiality and DoS-attack-resistance in a multi-hop code dissemination protocol. Our approach is based on Deluge, an open source, state-of-the-art code dissemination protocol for WSNs. In addition, We provide a performance evaluation in terms of latency and energy consumption in our scheme, compared with the original Deluge and the existing secure Deluge.
Multiscale 3D navigation
Authors: James McCrae, Igor Mordatch, Michael Glueck, Azam Khan
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

We present a comprehensive system for multiscale navigation of 3-dimensional scenes, and demonstrate our approach on multiscale datasets such as the Earth. Our system incorporates a novel image-based environment representation which we refer to as the cubemap. Our cubemap allows consistent navigation at various scales, as well as real-time collision detection without pre-computation or prior knowledge of geometric structure. The cubemap is used to improve upon previous work on proximal object inspection (HoverCam), and we present an additional interaction technique for navigation which we call look-and-fly. We believe that our approach to the navigation of multiscale 3D environments offers greater flexibility and ease of use than mainstream applications such as Google Earth and Microsoft Virtual Earth, and we demonstrate our results with this system.
Strategic Agent Communication: An Argumentation-Driven Approach
Authors: Jamal Bentahar, Mohamed Mbarki, John-Jules Ch. Meyer, Bernard Moulin
Venue: Declarative Agent Languages and Technologies VI: 6th International Workshop, DALT 2008, Estoril, Portugal, May 12, 2008, Revised Selected and Invited Papers (2008)

This paper proposes a formal framework for agent communication where agents can reason about their goals using strategic reasoning. This reasoning is argumentation-based and enables agents to generate a set of strategic goals depending on a set of constraints. Sub-goals are generated using this reasoning and they can be cancelled or substituted for alternatives during the dialogue progress. An original characteristic of this framework is that agents can use this strategic reasoning together with a tactic reasoning to persist in the achievement of their goals by considering alternatives depending on a set of constraints. Tactic reasoning is responsible of selecting the communicative acts to perform in order to realize the strategic goals. Some constraints are fixed when the conversation starts and others during the dialogue progress. The paper also discusses the computational complexity of such a reasoning.
Algorithms for Optimal Price Regulations
Authors: Alexander Grigoriev, Joyce Loon, Marc Uetz
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Since summer 2007, mobile phone users in the European Union (EU) are protected by a ceiling on the roaming tariff when calling or receiving a call abroad. We analyze the effects of this price regulative policy, and compare it to alternative implementations of price regulations. The problem is a three-level mathematical program: The EU determines the price regulative policy, the telephone operator sets profit-maximizing prices, and customers choose to accept or decline the operator's offer. The first part of this paper contains a polynomial time algorithm to solve such a three-level program. The crucial idea is to partition the polyhedron of feasible price regulative parameters into a polynomial number of smaller polyhedra such that a certain primitive decision problem can be written as an LP on each of those. Then the problem can be solved by a combination of enumeration and linear programming. In the second part, we analyze more specifically an instance of this problem, namely the price regulation problem that the EU encounters. Using customer-data from a large telephone operator, we compare different price regulative policies with respect to their social welfare. On the basis of the specific social welfare function, we observe that other price regulative policies or different ceilings can improve the total social welfare.
Efficient approximation of min set cover by moderately exponential algorithms
Authors: N. Bourgeois, B. Escoffier, V. Th. Paschos
Venue: Theoretical Computer Science (2009)

We study the approximation of min set cover combining ideas and results from polynomial approximation and from exact computation (with non-trivial worst case complexity upper bounds) for NP-hard problems. We design approximation algorithms for min set cover achieving ratios that cannot be achieved in polynomial time (unless problems in NP could be solved by slightly super-polynomial algorithms) with worst-case complexity much lower (though super-polynomial) than those of an exact computation.
Image Re-Composer: A Post-production Tool using Composition Information of Pictures
Authors: Shoji Tanaka, Jun Kurumizawa, Andre Plante, Yuichi Iwadate, Seiji Inokuchi
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we propose a post-production tool for refining pictures called the Image Re-Composer. This tool decomposes an original picture into figure objects and the ground, and then recomposes the figure objects according to composition information taken from a well designed picture, such as an art masterpiece. The figure extraction is performed by a figure extraction method that utilizes a characteristic of the V4 cortex in the human visual system. The composition information is extracted based on the idea of the golden section.
On Query Algebras for Probabilistic Databases
Authors: Christoph Koch
Venue: ACM SIGMOD Record (2009)

This article proposes a core query algebra for probabilistic databases. In essence, this core is part of the query languages of most probabilistic database systems proposed so far, but is sometimes hidden in complex language definitions. We give a formal definition of the algebra and illustrate it by examples. We then survey the current state of knowledge regarding the expressive power and complexity of this core.
V-QBE: video database retrieval by means of example motion of objects
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: Multimedia databases consist of text, static images, sound, and/or video. Video data is considered to be the most informative among those types of data. It conveys the meaning of a scene, the existence and/or motion of certain objects, and others. We present a system that retrieves video data by means of the motions of objects observed in video data in the database. That is, a query for a video database is specified by drawing an example trajectory of an object.
An XQDD-Based Verification Method for Quantum Circuits
Authors: Shiou-An Wang, Chin-Yung Lu, I-Ming Tsai, Sy-Yen Kuo
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Synthesis of quantum circuits is essential for building quantum computers. It is important to verify that the circuits designed perform the correct functions. In this paper, we propose an algorithm which can be used to verify the quantum circuits synthesized by any method. The proposed algorithm is based on BDD (Binary Decision Diagram) and is called X-decomposition Quantum Decision Diagram (XQDD). In this method, quantum operations are modeled using a graphic method and the verification process is based on comparing these graphic diagrams. We also develop an algorithm to verify reversible circuits even if they have a different number of garbage qubits. In most cases, the number of nodes used in XQDD is less than that in other representations. In general, the proposed method is more efficient in terms of space and time and can be used to verify many quantum circuits in polynomial time.