ppxscal/embedding_network huggingface dataset:
Study on the biodiversity: biotope factors' relations
Authors: Corina Simian, Vladislav Georgiev, Angela Curtean-Banaduc
Venue: Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry (2009)

The study goal is to highlight the importance of the biodiversity quantified for the assessment of the homeostasis degree and of the support capacity of the lotic systems, also it underline the usefulness of the mathematical models which reveal the biodiversity - biotope factors relations, for the prognoses of these systems evolution. Factorial analysis (correlation and regression analysis) was used to elaborate the mathematical models which show the benthic macro invertebrates diversity variation related with the biotope factors variation.
Genome Sequencing Technology and Algorithms, 1st edition
Authors: Sun Kim, Haixu Tang, Elaine R. Mardis
Venue:  (2007)

The 2003 completion of the Human Genome Project was just one step in the evolution of DNA sequencing. Now from a "who's who" of pioneers in the field comes the latest genome sequencing and assembly advances that are redefining the field. This trail-blazing book gives researchers, unparalleled access to state-of-the-art DNA sequencing technologies, new algorithmic sequence assembly techniques, and emerging methods for both resequencing and genome analysis that together form the most solid foundation possible for tackling experimental and computational challenges in the genome sciences today. Including critiques of existing techniques, this far-reaching resource offers researchers assistance in achieving more rapid and accurate DNA sequencing and developing the next generation of high-throughput methods and devices.
Windows via C/C++, 5th edition
Authors: Jeffrey M. Richter, Christophe Nasarre
Venue:  (2007)

Get the preeminent guide to programming application for Windows with C++. Programming Applications for Microsoft Windows is a classic book (formerly titled Advanced Windows, Third Edition) and is now fully updated for Windows Vista, including the latest information about Windows XP. In-depth and comprehensive, this essential reference covers the Windows operating system and how to program at the API level. Recognized experts provide an inside view of how Windows works and how to use its features in Visual C++ development tasks. Topics covered include processes, thread pooling, virtual memory, DLLs, file I/O, and message crackers. For systems-level programmers, this is a must-have title. Includes code samples in Visual C++.Features coverage of classic topics such as thread pooling, heaps, and advanced DLL techniquesProvides expert guidance fully updated for Windows VistaProvides extensive sample code in Visual C++ 2005
High assurance programming in Cryptol
Authors: Levent Erkök, John Matthews
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

Cryptol is a domain specific language tailored for cryptographic algorithms (www.cryptol.net). Explicit support for program verification is an indispensable part of the Cryptol toolset, due to the inherent high-assurance requirements of the application domain. To this end, Cryptol comes with a suite of formal-methods based tools, allowing users to perform various program verification tasks.
Semi-automatic identification of print layers from a sequence of sample images: A case study from banknote print inspection
Authors: Daniel Soukup, Ulrich Bodenhofer, Markus Mittendorfer-Holzer, Konrad Mayer
Venue: Image and Vision Computing (2009)

This article presents an approach for finding displacements of print layers from sequences of sample images semi-automatically with the aim to simplify and shorten the setup of inspection systems for printing processes in which the perfect alignment of print layers cannot be guaranteed. The basic idea behind the proposed approach is to identify pixels which are likely to have the same displacements for a given pair of images. This relatively coarse information is computed for several pairs of sample images and aggregated in order to identify regions that tend to have the same displacement over a large proportion of image pair comparisons. This idea is motivated and justified in detail. The test cases considered in this study are data from banknote print inspection. We use these data to illustrate the steps of the algorithm. The examples demonstrate the method's capability to sensibly identify print layers, even if they overlap partially. Although the paper concentrates on a particular case study, the method can be used in any print inspection process with similar characteristics.
Collective annotation of Wikipedia entities in web text
Authors: Sayali Kulkarni, Amit Singh, Ganesh Ramakrishnan, Soumen Chakrabarti
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

To take the first step beyond keyword-based search toward entity-based search, suitable token spans ("spots") on documents must be identified as references to real-world entities from an entity catalog. Several systems have been proposed to link spots on Web pages to entities in Wikipedia. They are largely based on local compatibility between the text around the spot and textual metadata associated with the entity. Two recent systems exploit inter-label dependencies, but in limited ways. We propose a general collective disambiguation approach. Our premise is that coherent documents refer to entities from one or a few related topics or domains. We give formulations for the trade-off between local spot-to-entity compatibility and measures of global coherence between entities. Optimizing the overall entity assignment is NP-hard. We investigate practical solutions based on local hill-climbing, rounding integer linear programs, and pre-clustering entities followed by local optimization within clusters. In experiments involving over a hundred manually-annotated Web pages and tens of thousands of spots, our approaches significantly outperform recently-proposed algorithms.
Low bit rate SAR image coding based on adaptive multiscale Bandelets and cooperative decision
Authors: Shuyuan Yang, Yanxiong Lu, Min Wang, Licheng Jiao
Venue: Signal Processing (2009)

As an adaptive approximation tool, bandelets exhibit enormous potential in image compression. In this paper, we propose a low complexity adaptive multiscale bandelets transform (AMBT) for synthetic aperture radar (SAR) image compression. Different from optical images, SAR images carry information in low frequency bands as well as high frequency bands. So in our proposed approach multilevel wavelet packet decomposition is performed on images firstly, and then dyadic partition is employed to get some squares on which to perform a bandeletization subsequently. The determination of the optimal direction of geometric flow is one of the most important issues in the implementation of bandelets. Here a cooperative decision of the flow direction is adopted to obtain accurate flows. Because the proposed approach can avoid the bottom to top pruning algorithm of wavelet quadtree and the exhaustive searching of geometric flows in the second generation bandelets, it is of low complexity and thus can be implemented rapidly. Moreover, the proposed AMBT exhibits good performance at low bit rate because of the efficient representation of bandelet in capturing geometrics in image. Finally some experiments were carried out on some SAR images and the results show that our proposed scheme outperforms wavelet and the second generation bandelet methods in both PSNR and time consumption.
A GPU Tile-Load-Map architecture for terrain rendering: theory and applications
Authors: Yacine Amara, Xavier Marsault
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

This paper describes a robust, modular, complete GPU architecture&#x2014;the Tile-Load-Map (TLM)&#x2014;designed for the real-time visualization of wide textured terrains created with arbitrary meshes. It extends and completes our previous succinct paper Amara et al. (ISVC 2007, Part 1, Lecture Notes in Computer Science, vol. 4841, pp. 586&#x2013;597, Springer, Berlin, 2007) by giving further technical and implementation details. It provides new solutions to problems that had been left unresolved, in the context of a joint use of OpenGL and CUDA, optimized on the G80 graphics chip. We explain the crucial components of the shaders, and emphasize the progress we have proposed, while resolving some difficulties. We show that this texturing architecture is well suited to current challenges, and takes into account most of the distinctive aspects of terrain rendering. Finally, we demonstrate how the design of the TLM facilitates the integration of geomatic input-data into procedural selection/rendering tasks on the GPU, and immediate applications to amplification.
Applications of Klee&#x2019;s Dehn&#x2013;Sommerville Relations
Authors: Isabella Novik, Ed Swartz
Venue: Discrete Computational Geometry (2009)

We use Klee&#x2019;s Dehn&#x2013;Sommerville relations and other results on face numbers of homology manifolds without boundary to (i)&#x00a0;prove Kalai&#x2019;s conjecture providing lower bounds on the f-vectors of an even-dimensional manifold with all but the middle Betti number vanishing, (ii)&#x00a0;verify K&#x00fc;hnel&#x2019;s conjecture that gives an upper bound on the middle Betti number of a 2k-dimensional manifold in terms of k and the number of vertices, and (iii) partially prove K&#x00fc;hnel&#x2019;s conjecture providing upper bounds on other Betti numbers of odd- and even-dimensional manifolds. For manifolds with boundary, we derive an extension of Klee&#x2019;s Dehn&#x2013;Sommerville relations and strengthen Kalai&#x2019;s result on the number of their edges.
Reflection Prompts to Facilitate Students' Thinking about Teaching in Teachable Agent Environment
Authors: Longkai Wu, Chee-Kit Looi
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

The teachable agent environment provides middle school students with opportunities of engaging in teaching activities in an interactive environment that fosters active learning (Biswas, Schwarz, & Bransford, 2001). However, they are not directly supported to think about their teaching as they teach. This paper proposes a reflection prompt production mechanism in a teachable agent environment to prompt students to reflect on their teaching process. A pilot study on the benefits of introducing reflection prompts and the further development of the teachable agents with reflective learning support are described.
A Method of Human Skin Region Detection Based on PCNN
Authors: Lijuan Duan, Zhiqiang Lin, Jun Miao, Yuanhua Qiao
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

A method of human skin region detection based on PCNN is proposed in this paper. Firstly, the input origin image is translated from RGB color space to YIQ color space, and I channel image is obtained. Secondly, we use the synchronous pulse firing mechanism of pulse coupled neural network (PCNN) to simulate the skin region detection mechanism of human eyes. Skin and non-skin regions are fired in different time. Therefore, skin regions are detected. Our comparison with other methods shows that the proposed method produces more accurate segmentation results.
Learning dynamic temporal graphs for oil-production equipment monitoring system
Authors: Yan Liu, Jayant R. Kalagnanam, Oivind Johnsen
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Learning temporal graph structures from time series data reveals important dependency relationships between current observations and histories. Most previous work focuses on learning and predicting with "static" temporal graphs only. However, in many applications such as mechanical systems and biology systems, the temporal dependencies might change over time. In this paper, we develop a dynamic temporal graphical models based on hidden Markov model regression and lasso-type algorithms. Our method is able to integrate two usually separate tasks, i.e. inferring underlying states and learning temporal graphs, in one unified model. The output temporal graphs provide better understanding about complex systems, i.e. how their dependency graphs evolve over time, and achieve more accurate predictions. We examine our model on two synthetic datasets as well as a real application dataset for monitoring oil-production equipment to capture different stages of the system, and achieve promising results.
Information Modelling and Global Risk Management Systems
Authors: Hannu Jaakkola, Bernhard Thalheim, Yutaka Kidawara, Koji Zettsu, Xing Chen, Anneli Heimbürger
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

Utilization of global information resources as a part of risk management is insufficient. The authorities are maintaining information systems mainly for their own purposes, without access to high quality public information sources in Internet and without interoperability between systems of different authorities. Beneficial use of all available information resources would provide an opportunity to create knowledge based on different pieces of information. However, powerful distributed knowledge management, mining of the information items, analysing the quality of them, is needed to create new information to be utilized. The distributed operations needs support of complex network architectures, models supporting mutual understanding over the cultures and language borders, and ability to recognize the context and adapt the results to the new context. This paper opens discussion from different viewpoints to the topic of global risk management. Architectural solutions supporting interoperability, quality of data in wide networks, ubiquity and mobility as well as time dimension of the information space are covered.
TrInc: small trusted hardware for large distributed systems
Authors: Dave Levin, John R. Douceur, Jacob R. Lorch, Thomas Moscibroda
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

A simple yet remarkably powerful tool of selfish and malicious participants in a distributed system is "equivocation": making conflicting statements to others. We present TrInc, a small, trusted component that combats equivocation in large, distributed systems. Consisting fundamentally of only a non-decreasing counter and a key, TrInc provides a new primitive: unique, once-in-a-lifetime attestations. We show that TrInc is practical, versatile, and easily applicable to a wide range of distributed systems. Its deployment is viable because it is simple and because its fundamental components--a trusted counter and a key--are already deployed in many new personal computers today. We demonstrate TrInc's versatility with three detailed case studies: attested append-only memory (A2M), PeerReview, and BitTorrent. We have implemented TrInc and our three case studies using real, currently available trusted hardware. Our evaluation shows that TrInc eliminates most of the trusted storage needed to implement A2M, significantly reduces communication overhead in PeerReview, and solves an open incentives issue in BitTorrent. Microbenchmarks of our TrInc implementation indicate directions for the design of future trusted hardware.
Higher Order Applications of Technology: Perception of WebQuests among Pre-service Teachers
Authors: Hsiang-Ju Ho, Cynthia C. Choi
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

WebQuests are inquiry-oriented learning activities that encourage learners to gather, analyze, and synthesize information, thus represent a higher order use of technology. This research is designed to understand perceptions of such use among pre-service teachers. Preliminary results report positive feedback on the effectiveness of WebQuests.
Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas
Authors: Kai Labusch, Erhardt Barth, Thomas Martinetz
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

We show how the "Online Sparse Coding Neural Gas" algorithm can be applied to a more realistic model of the "Cocktail Party Problem". We consider a setting where more sources than observations are given and additive noise is present. Furthermore, we make the model even more realistic, by allowing the mixing matrix to change slowly over time. We also process the data in an online pattern-by-pattern way where each observation is presented only once to the learning algorithm. The sources are estimated immediately from the observations. In order to evaluate the influence of the change rate of the time dependent mixing matrix and the signal-to-noise ratio on the reconstruction performance with respect to the underlying sources and the true mixing matrix, we use artificial data with known ground truth.
Automatic detection of learning styles for an e-learning system
Authors: Ebru Özpolat, Gözde B. Akar
Venue: Computers Education (2009)

A desirable characteristic for an e-learning system is to provide the learner the most appropriate information based on his requirements and preferences. This can be achieved by capturing and utilizing the learner model. Learner models can be extracted based on personality factors like learning styles, behavioral factors like user's browsing history and knowledge factors like user's prior knowledge. In this paper, we address the problem of extracting the learner model based on Felder-Silverman learning style model. The target learners in this problem are the ones studying basic science. Using NBTree classification algorithm in conjunction with Binary Relevance classifier, the learners are classified based on their interests. Then, learners' learning styles are detected using these classification results. Experimental results are also conducted to evaluate the performance of the proposed automated learner modeling approach. The results show that the match ratio between the obtained learner's learning style using the proposed learner model and those obtained by the questionnaires traditionally used for learning style assessment is consistent for most of the dimensions of Felder-Silverman learning style.
Studying the effects of noisy text on text mining applications
Authors: Lipika Dey, S. K. Mirajul Haque
Venue: Proceedings of The Third Workshop on Analytics for Noisy Unstructured Text Data (2009)

Text mining aims at deriving high quality information from text in an automated way. Text mining applications rely on Natural Language Processing (NLP) tools like tagger, parser etc. to locate and retrieve relevant information in an application specific manner. Most of these NLP tools however have been designed to work on clean and grammatically correct text. Presently, many organizations are interested to derive information from informally written text that is generated as a result of human communication through emails, or blog posts, web-based reviews etc. These texts are highly noisy and often found to contain mixture of languages. In this study we present some analysis on how noise introduced due to incorrect English affects the performance of some of the NLP tools and thereafter the text mining applications. The text mining application that we focus on is opinion mining. Opinion mining is the most significant text mining application that has to deal with noisy text generated in an unregulated fashion by users.
Automated Assessment of Problem Difficulty in Mathematical Analysis
Authors: Ildikó Pelczer, Fernando Gamboa
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

It is common between teachers of mathematics to assess the difficulty of the problems they gave to students. The evaluation is mostly based on subjective appreciation with no explicit consideration of difficulty factors. However, in a computerized environment for mathematics instruction it would be highly beneficial to dispose of such explicit factors and automated assessment of problem difficulty. In the present paper a set of factors for sequence problems in analysis are proposed. For the automated detection of these factors a set of rules was defined. Knowledge representation and implementation details are described.
An Effect of Comment Statements on Source Code Corrective Maintenance
Authors: Hirohisa Aman, Hirokazu Okazaki, Hiroyuki Yamada
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

This paper focuses on the density of comment statements in a source code, and statistically analyzes an impact of the comment statement density (CSD) on the source code change rate (SCR) through a corrective maintenance. More thorough writing of comments encourages the developers to review their source code more carefully, then that leads to quality improvements of those code. An empirical study is performed with 1,820 version-upgrade cases in an open-source software, Eclipse. The empirical results show that SCR tends to increase when CSD is less than 59.5%.
Query support for multi-dimensional and dynamic databases
Authors: Hakan Ferhatosmanoglu
Venue:  (2008)

In this PhD dissertation, we propose database solutions to support a set of queries for large scale, multi-dimensional and dynamic databases. In particular, we discuss two main topics: Angular Similarity Queries and Bitmap Indexes. We start with presenting the notion of Angular Similarity that previously lack the database support and discuss our index structures suited for that kind of queries. These proposed compression-based methods enable the angular queries to run faster than the current practice. Cosine, correlation coefficient, and inner product are examples of distance measures utilized as angular similarities. These measures find applications in astrophysics, aviation, graphics, text documents, time series, etc. Then we focus on Bitmap Indexes, which are widely used in data warehouses, scientific applications and which are also implemented by commercial database products such as Oracle. We investigate the Bitmap Indexes from three different perspectives. First, we present our approximate encoding scheme for these indexes. Second, we investigate the data ordering techniques and study their effectiveness on the compression ratios of bitmap indexes. We provide theoretical foundations and a performance analysis on two popular ordering techniques, namely lexicographical ordering and Gray code ordering. Our analysis does not only focus on bitmaps, but from a wider perspective, we cover these approaches in the context of Boolean matrices and binary data. Third, we explore the dynamic nature of real data sets. By exploiting the append-only trend in data warehouses and scientific data sets, we propose a dynamic organization technique for bitmap indexes. For static data sets, compression is shown to be greatly improved by data ordering techniques. However, these data reorganization methods are not applicable to dynamic and very large data sets because of their significant overhead. Our dynamic data structure and the algorithm for organizing the bitmap indexes provide better compression and query processing performance. Our scheme enforces a compression rate close to the optimum for a target ordering of the data which results in fast query response time.