ppxscal/embedding_network huggingface dataset:
Statistical Independence and Determinants in a Contingency Table - Interpretation of Pearson Residuals based on Linear Algebra -
Authors: Shusaku Tsumoto, Shoji Hirano
Venue: Fundamenta Informaticae (2009)

This paper analyzes pearson residuals, which is an important element of chi-square test statistic, in a contingency table from the viewpoint of matrix theory as follows. First, a given contingency table is viewed as a matrix and the residual of each element in a matrix are obtained as the difference bewteen observed values and expected values calculated by marginal distributions. Then, each residual &sigma;$_{ij}$ is decomposed into the linear sum of the 2 &times; 2 subderminants of a original matrix, except for i-th column and j-th row. Furthermore, the number of the determinants is equal to the degree of freedom for the chi-square test statistic for a given contingency table. Thus, 2 &times; 2 subdeterminants in a contingencymatrix determine the degree of statistical independence of two attributes as elementary granules.
Informative transcription factor selection using support vector machine-based generalized approximate cross validation criteria
Authors: Insuk Sohn, Jooyong Shim, Changha Hwang, Sujong Kim, Jae Won Lee
Venue: Computational Statistics Data Analysis (2009)

The genetic regulatory mechanism plays a pivotal role in many biological processes ranging from development to survival. The identification of the common transcription factor binding sites (TFBSs) from a set of known co-regulated gene promoters and the identification of genes that are regulated by the transcription factor (TF) that have important roles in a particular biological function will advance our understanding of the interaction among the co-regulated genes and intricate genetic regulatory mechanism underlying this function. To identify the common TFBSs from a set of known co-regulated gene promoters and classify genes that are regulated by TFs, the new approaches using Support Vector Machine (SVM)-based Generalized Approximate Cross Validation (GACV) criteria are proposed. Two variable selection methods are considered for Recursive Feature Elimination (RFE) and Recursive Feature Addition (RFA). Performances of the proposed methods are compared with the existing SVM-based criteria, Logistic Regression Analysis (LRA), Logic Regression (LR), and Decision Tree (DT) methods by using both two real TF target genes data and the simulated data. In terms of test error rates, the proposed methods perform better than the existing methods.
Electronic governance and citizen journalism
Authors: Kishor Pradhan
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Electronic Governance (e-Governance) is the use of Information and Communication Technologies (ICTs) to provide citizens and organizations with more convenient access to government information and services, and to provide better public services. The most important anticipated benefits of e-Governance include more efficiency, improved services, better accessibility of public services, and more transparency and accountability. Citizen journalism, on the other hand is the act of citizens playing an active role in the process of collecting, reporting, analyzing and disseminating news and information. The intent of this participation is to provide independent, reliable, accurate, wide-ranging and relevant information that a democracy and governance requires. If e-Governance is still the top-down flow of information, then citizen journalism is a bottom-up flow. However, in both -- on e-Governance through the state, and on citizen journalism through the citizens; the quantum of practices has grown in leaps and bounds with the rapid penetration of new media technologies, like the Internet in the economic, social, political and other processes. The soul searching still needs to be done on do e-Governance and citizen journalism flock together? Can e-Governance facilitate and integrate bottom-up flow of information and make people participate in the governance process? This panel, consisting of primarily e-Governance and citizen journalism practitioners, shall try to look into what has worked and what has not worked as far as e-Governance and citizen journalism working in isolation and in tandem is concerned.
Information literacy skills: Teacher understandings and practice
Authors: Elizabeth Probert
Venue: Computers Education (2009)

This article reports on a project, involving three New Zealand schools, which investigated teachers' understanding of information literacy and their associated classroom practices. Recently published work, while lamenting school students' lack of information literacy skills, including working with online resources, provides little research investigating classroom teachers' knowledge of information literacy skills and their related pedagogical practice. The findings of this project indicate that while some of the teachers in this project had a reasonably good understanding of the concept of information literacy, very few reported developing their students' information literacy skills.
A Combined Classification Algorithm Based on C4.5 and NB
Authors: Liangxiao Jiang, Chaoqun Li, Jia Wu, Jian Zhu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

When our learning task is to build a model with accurate classification, C4.5 and NB are two very important algorithms for achieving this task because of their simplicity and high performance. In this paper, we present a combined classification algorithm based on C4.5 and NB, simply C4.5-NB. In C4.5-NB, the class probability estimates of C4.5 and NB are weighted according to their classification accuracy on the training data. We experimentally tested C4.5-NB in Weka system using the whole 36 UCI data sets selected by Weka, and compared it with C4.5 and NB. The experimental results show that C4.5-NB significantly outperforms C4.5 and NB in terms of classification accuracy. Besides, we also observe the ranking performance of C4.5-NB in terms of AUC (the area under the Receiver Operating Characteristics curve). Fortunately, C4.5-NB also significantly outperforms C4.5 and NB.
Run-time Optimisation of Grid Workflow Applications
Authors: Rubing Duan, Radu Prodan, Thomas Fahringer
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

The execution of workflow applications on the Grid is a complex issue because of its dynamic and heterogeneous nature. While the Grid provides good potential for achieving high performance, it also introduces a broad set of unpredictable overheads and possible failures. In this paper we present new methods for scalable and fault tolerant coordination of workflows in dynamic Grid environments, including partitioning, static and dynamic optimisation, as well as Virtual Single Execution Environment, incorporated into the ASKALON distributed workflow Enactment Engine. We demonstrate the effectiveness of our methods on a material science workflow application executed in a real-world Grid environment.
Program analysis for compiler validation
Authors: Anna Zaks, Amir Pnueli
Venue: Proceedings of the 8th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering (2008)

Translation Validation is an approach of ensuring compilation correctness in which each compiler run is followed by a validation pass that proves that the target code produced by the compiler is a correct translation (implementation) of the source code. It has been previously shown that the problem of translation validation can be reduced to checking if a single system - the corss-product of the source and target, satisfies a specific property. In this paper, we show how to adapt the existing program analysis techniques in the setting of translation validation. In addition, we present a novel invariant generation algorithm which strengthens our analysis when the input programs contain dynamically allocated data structures. Finally, we report on the prototype tool that applies the developed methodology to verification of the LLVM compiler. The tool handles many of the classical intraprocedural compiler optimizations such as constant folding, reassociation, common subexpression elimination, code motion, dead code elimination, and others.
Robust Appearance Based Visual Route Following for Navigation in Large-scale Outdoor Environments
Authors: Alan M. Zhang, Lindsay Kleeman
Venue: International Journal of Robotics Research (2009)

In this paper we present a navigation algorithm that enables mobile robots to retrace routes previously taught under the control of human operators in outdoor environments. Possible applications include robot couriers, autonomous vehicles, tour guides and robotic patrols. The appearance-based approach presented in the paper is provably convergent, computationally inexpensive compared with map-based approaches and requires only odometry and a monocular omnidirectional vision sensor. A sequence of reference images is recorded during the human-guided route-teaching phase. Before starting the autonomous phase, the robot needs to be positioned at the beginning of the route. During the autonomous phase, the measurement image is compared with reference images using image cross-correlation performed in the Fourier domain to recover the difference in relative orientation. Route following is achieved by compensating for this orientation difference. Over 18 km of experiments performed under varying conditions demonstrate the algorithm's robustness to lighting variations and partial occlusion. Obstacle avoidance is not included in the current system.
A 158 MS/s JPEG 2000 Codec with a Bit-Plane and Pass Parallel Embedded Block Coder for Low Delay Image Transmission
Authors: Masayuki Miyama, Yuusuke Inoie, Takafumi Kasuga, Ryouichi Inada, Masashi Nakao, Yoshio Matsuda
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper describes a 158 MS/s JPEG 2000 codec with an embedded block coder (EBC) based on bit-plane and pass-parallel architecture. The EBC contains bit-plane coders (BPCs) corresponding to each bit-plane in a code-block. The upper and the lower bit-plane coding overlap in time with a 1-stripe and 1-column gap. The bit-modeling passes in the bit-plane coding also overlap in time with the same gap. These methods increase throughput by 30 times in comparison with the conventional. In addition, the methods support not only vertically causal mode, but also regular mode, which enhances the image quality. Furthermore, speculative decoding is adopted to increase throughput. This codec LSI was designed using 0.18 μm process. The core area is 4.7 × 4.7 mm2 and the frequency is 160 MHz. A system including the codec enables image transmission of PC desktop with 8 ms delay.
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Authors: Daniel Štefankovič, Santosh Vempala, Eric Vigoda
Venue: Journal of the ACM (JACM) (2009)

We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our work is to approximating the partition function Z of a discrete system, such as the Ising model, matchings or colorings of a graph. The typical approach to estimating the partition function Z(&beta;&ast;) at some desired inverse temperature &beta;&ast; is to define a sequence, which we call a cooling schedule, &beta;0 &equals; 0 < &beta;1 < &hellip; < &beta; &ell; &equals; &beta;&ast; where Z(0) is trivial to compute and the ratios Z(&beta;i+1)/Z(&beta;i) are easy to estimate by sampling from the distribution corresponding to Z(&beta;i). Previous approaches required a cooling schedule of length O&ast;(ln A) where A&equals;Z(0), thereby ensuring that each ratio Z(&beta;i+1)/Z(&beta;i) is bounded. We present a cooling schedule of length &ell; &equals;O&ast;(&sqrt; lnA). For well-studied problems such as estimating the partition function of the Ising model, or approximating the number of colorings or matchings of a graph, our cooling schedule is of length O&ast;(&sqrt; n), which implies an overall savings of O&ast;(n) in the running time of the approximate counting algorithm (since roughly &ell; samples are needed to estimate each ratio). A similar improvement in the length of the cooling schedule was recently obtained by Lov&aacute;sz and Vempala in the context of estimating the volume of convex bodies. While our reduction is inspired by theirs, the discrete analogue of their result turns out to be significantly more difficult. Whereas a fixed schedule suffices in their setting, we prove that in the discrete setting we need an adaptive schedule, that is, the schedule depends on Z. More precisely, we prove any nonadaptive cooling schedule has length at least O&ast;(ln A), and we present an algorithm to find an adaptive schedule of length O&ast;(&sqrt; ln A).
Curvature-Based Feature Extraction Method for 3D Model Retrieval
Authors: Yujie Liu, Xiaolan Yao, Zongmin Li
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Curvature on the surface of 3D mesh model is an important discrete differential geometrical descriptor. It can show the curving degree very well for those models with curving pieces and the ones with extreme points or extension components. In this paper, we use mean curvature and corresponding coordinates of the vertexes on the surface as the feature descriptor of model. The descriptor we defined describes models accurately and keeps invariant for transformation and rotation. Additionally, we bring EMD (Earth Moving Distance) method into the similarity measure frame. This comparison way is very efficient and especially adapt to these conditions: different numbers of the two features, variant or indefinite dimension of the features. Thought several retrieval experiments, the results implied that this descriptor could be used to find the exact model from the PSB model library. Particularly for models which are made up of curving pieces and those models with extreme points or parts, the result showed much better than other feature descriptors.
Advances in Ontology Matching
Authors: Avigdor Gal, Pavel Shvaiko
Venue: Advances in Web Semantics I: Ontologies, Web Services and Applied Semantic Web (2008)

Matching of concepts describing the meaning of data in heterogeneous distributed information sources, such as database schemas and other metadata models, grouped here under the heading of an ontology, is one of the basic operations of semantic heterogeneity reconciliation. The aim of this chapter is to motivate the need for ontology matching, introduce the basics of ontology matching, and then discuss several promising themes in the area as reflected in recent research works. In particular, we focus on such themes as uncertainty in ontology matching, matching ensembles, and matcher self-tuning. Finally, we outline some important directions for future research.
Improving voice activity detection used in ITU-T G.729.B
Authors: H. Farsi, M. A. Mozaffarian, H. Rahmani
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

In this paper, by using a new envelope estimation algorithm and a geometrical adaptive threshold method; we present a novel method to improve the performance of ITU-T G.729.B systems in various noisy environments. The proposed system has minimum change from this standard. We compare the performance of the proposed method with G.729B, ETSI AMR option 1 and 2 using objective measures.
Computing with field-coupled nanomagnets
Authors: Wolfgang Porod
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Magnetic phenomena are commonly used for data-storage applications, but there are relatively few attempts to exploit magnetic phenomena for logic applications. In this presentation, we review our recent work on logic functionality in systems of physically-coupled nanometer-scale magnets. Nanomagnets are special in that they exhibit only two distinct stable states of magnetization, which is the basis for their use in magnetic random access memories and in hard disk drives. These latter applications, for which fabrication of dense arrays is under development, face the challenge of avoiding magnetic dipole interactions between individual elements, which limits data storage density. In contrast, these interactions are exploited in the magnetic quantum-dot cellular automata (MQCA) system, which is a network of closely-spaced, dipole-coupled, single-domain nanomagnets designed for digital computation. Our work demonstrates that logic functions can be realized in properly-structured arrays of physically-coupled nanomagnets, and points to the possibility of all-magnetic information processing systems that incorporate both memory and logic.
On positive solutions for fourth-order boundary value problem with impulse
Authors: Ilkay Yaslan Karaca
Venue: Journal of Computational and Applied Mathematics (2009)

In this paper, we consider a fourth-order boundary value problem with impulse. First, we establish criteria for the existence of one or more than one positive solution of a non-eigenvalue problem. Second, we are concerned with determining values of @l, for which there exist positive solutions for an eigenvalue problem. In both problems, we shall use the Krasnoselskii fixed point theorem.
A Large Frequency Offset Estimation Algorithm for IEEE 802.11a System
Authors: Han Qingwen, Zhang Peng, Zhang Youfang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

According to the packet structure of IEEE Standard 802.11a and the characters of short training symbols, a new frequency offset estimation algorithm is presented. A two stages strategy based on auto-correlation algorithm is used to solve the contradiction between estimation accuracy and estimation range. At the first stage, the coarse frequency offset estimating bases on the identity of half cyclical short training symbol. Then the exact frequency offset estimating can be done by the cancellation operation of long training symbols. The simulation based on 802.11a PHY model is done. And the simulation result shows that this algorithm not only overcome the influence of carrier frequency offset but also eliminate the carrier frequency offset. Comparing with the traditional algorithm this algorithm can reduce the complication of the calculation, and the estimation range can be expanded to 2 times. Furthermore, the precise estimation can be acquired as well.
Multimedia applications using a database programming language-INADA
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

Abstract: INADA is a new database programming language under development at Kyushu University. INADA can create and manipulate C++ objects stored in a database (persistent object). The key idea of INADA is the introduction of distributed shared virtual memory. We propose multimedia applications using distributed shared virtual memory. We introduce stream heap for time-based media, and global heap for non time-based media. To test our idea we implemented two prototype multimedia applications, white board and telephone using INADA.
A multimedia interface for facilitating comparisons of opinions
Authors: Giuseppe Carenini, Lucas Rizoli
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Written opinion on products and other entities can be important to consumers and researchers, but expensive and difficult to analyze. We present a multimedia interface designed to facilitate the analysis of opinions on multiple entities, which could be beneficial to many individuals and organizations. It integrates an information visualization and an intelligent system that selects notable comparisons in the data and summarizes them in text. This system applies a set of statistics for comparing opinions across entities. We conducted a study of our interface with 36 subjects. Subjects liked the visualization overall and our system's selections overlapped with those of subjects more than did the selections of baseline systems. Given the choice, subjects often changed their selections to be more consistent with those of our system. This suggests that system selections were valuable to them.
A Robust and Non-invasive Fetal Electrocardiogram Extraction Algorithm in a Semi-Blind Way
Authors: Yalan Ye, Zhi-Lin Zhang, Jia Chen
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Fetal electrocardiogram (FECG) extraction is of vital importance in biomedical signal processing. A promising approach is blind source extraction (BSE) emerging from the neural network fields, which is generally implemented in a semi-blind way. In this paper, we propose a robust extraction algorithm that can extract the clear FECG as the first extracted signal. The algorithm exploits the fact that the FECG signal's kurtosis value lies in a specific range, while the kurtosis values of other unwanted signals do not belong to this range. Moreover, the algorithm is very robust to outliers and its robustness is theoretically analyzed and is confirmed by simulation. In addition, the algorithm can work well in some adverse situations when the kurtosis values of some source signals are very close to each other. The above reasons mean that the algorithm is an appealing method which obtains an accurate and reliable FECG.
Interactivity attributes: a new way of thinking and describing interactivity
Authors: Youn-kyung Lim, Sang-Su Lee, Kwang-young Lee
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We propose a new perspective, seeing interactivity that is the immaterial part of an interactive artifact as something concretely describable and perceivable as we do with physical materials. In order to examine the validity of this proposal, we extracted a set of interactivity attributes to be used as a design language for thinking and describing interactivity in a new way, and conducted an online survey with 14 Flash prototypes representing pairs of values of 7 interactivity attributes we extracted. The result showed that all the interactivity attributes were significant, and participants experienced distinctive and meaningful emotional effects for different interactivity attributes.
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph
Authors: Vadim V. Lozin
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

From the theory of graph minors we know that the class of planar graphs is the only critical class with respect to tree-width. In the present paper, we reveal a critical class with respect to clique-width, a notion generalizing tree-width. This class is known in the literature under different names, such as unit interval, proper interval or indifference graphs, and has important applications in various fields, including molecular biology. We prove that the unit interval graphs constitute a minimal hereditary class of unbounded clique-width. As an application, we show that list coloring is fixed parameter tractable in the class of unit interval graphs.