ppxscal/embedding_network huggingface dataset:
Descriptional Complexity of Tissue-Like P Systems with Cell Division
Authors: Daniel Díaz-Pernil, Pilar Gallego-Ortiz, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustín Riscos-Núñez
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

In this paper we address the problem of describing the complexity of the evolution of a tissue-like P system with cell division. In the computations of such systems the number of (parallel) steps is not sufficient to evaluate the complexity. Following this consideration, Sevilla Carpets were introduced as a tool to describe the space-time complexity of P systems.Sevilla Carpets have already been used to compare two different solutions of the Subset Sum problem (both designed in the framework of P systems with active membranes) running on the same instance. In this paper we extend the comparison to the framework of tissue-like P systems with cell division.
Improving the delivery efficiency of the customer order scheduling problem in a job shop
Authors: Sheng-Yuan Hsu, C. -H. Liu
Venue: Computers and Industrial Engineering (2009)

The focus of this paper is customer order scheduling (COS) problem, where each order consists of a set of jobs that must be shipped as one batch at the same time. In COS each job is part of a customer order and the make-up of the jobs in the order are pre-specified. Most of the existing research deals with COS in a single machine or in a parallel machine shop for developing an optimal solution. COS is common in a normal job shop, and the more complex the shop, the more complex the scheduling. Most existing research has focused on trying to reduce the completion time of the batch. That is, the focus is only on the point in time the last job is finished, while ignoring the actual duration of the jobs within the same order. The longer it takes to complete all the jobs within an order the more it increases the stock of finished goods and the more it deteriorates the efficiency of the logistics and the supply chain management. A new dispatching rule, referred to as Minimum Flow Time Variation (MFV), has been proposed for COS in a normal job shop, in order to reduce the total time it takes to complete all jobs within the same order. That is, the individual completion times of all jobs for the same customer order will be controlled in order to improve the shipping performance. In the simulation test and statistical analysis, the level of work in process (WIP) under the MFV rule in the finished goods warehouse is reduced by more than 70% compared to any other method. The MFV method will efficiently reduce the stock level of finished goods, and controls the waiting time required before they can be shipped. Depending on the environmental factors, the performance of our proposed method will become increasingly significant the more complex the system.
Conflict-directed backjumping revisited
Authors: Xinguang Chen, Peter van Beek
Venue: Journal of Artificial Intelligence Research (2001)

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classified as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-ahead techniques is sometimes counterproductive to the effects of look-back techniques. In this paper, we focus on the relationship between the two most important look-ahead techniques--using a variable ordering heuristic and maintaining a level of local consistency during the backtracking search--and the look-back technique of conflict-directed backjumping (CBJ). We show that there exists a "perfect" dynamic variable ordering such that CBJ becomes redundant. We also show theoretically that as the level of local consistency that is maintained in the backtracking search is increased, the less that backjumping will be an improvement. Our theoretical results partially explain why a backtracking algorithm doing more in the look-ahead phase cannot benefit more from the backjumping look-back scheme. Finally, we show empirically that adding CBJ to a backtracking algorithm that maintains generalized arc consistency (GAC), an algorithm that we refer to as GAC-CBJ, can still provide orders of magnitude speedups. Our empirical results contrast with Bessière and Régin's conclusion (1996) that CBJ is useless to an algorithm that maintains arc consistency.
The MILE corpus for less commonly taught languages
Authors: Alison Alvarez, Lori Levin, Robert Frederking, Simon Fung, Donna Gates, Jeff Good
Venue: Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers on XX (2006)

This paper describes a small, structured English corpus that is designed for translation into Less Commonly Taught Languages (LCTLs), and a set of re-usable tools for creation of similar corpora. The corpus systematically explores meanings that are known to affect morphology or syntax in the world's languages. Each sentence is associated with a feature structure showing the elements of meaning that are represented in the sentence. The corpus is highly structured so that it can support machine learning with only a small amount of data. As part of the REFLEX program, the corpus will be translated into multiple LCTLs, resulting in parallel corpora can be used for training of MT and other language technologies. Only the untranslated English corpus is described in this paper.
Segmentation of cDNA Microarray Spots Using K-means Clustering Algorithm and Mathematical Morphology
Authors: Hu Yijun, Weng Guirong
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Complementary DNA microarray technology is a powerful tool in many areas. Usually a two channel microarray Red–Green (RG) image is obtained. Due to the nature of cDNA microarray technology, a number of impairments affect the cDNA microarray image before the analysis such as identification of differentially expressed genes. Microarray image processing plays a crucial role in the extraction and quantitative analysis of the relative abundance of the DNA product. In this paper, a method combined K-means clustering algorithm and mathematical morphology is presented. Mathematical morphology is a useful tool for extracting image components. K-means clustering algorithm has a good performance in the segmentation of microarray image processing. The result of the experiment shows that the method presented in this paper is accurate, automatic and robust.
Improving machine translation quality with automatic named entity recognition
Authors: Bogdan Babych, Anthony Hartley
Venue: Proceedings of the 7th International EAMT workshop on MT and other Language Technology Tools, Improving MT through other Language Technology Tools: Resources and Tools for Building MT (2003)

Named entities create serious problems for state-of-the-art commercial machine translation (MT) systems and often cause translation failures beyond the local context, affecting both the overall morphosyntactic well-formedness of sentences and word sense disambiguation in the source text. We report on the results of an experiment in which MT input was processed using output from the named entity recognition module of Sheffield's GATE information extraction (IE) system. The gain in MT quality indicates that specific components of IE technology could boost the performance of current MT systems.
Complexity and Algorithms for Monomial and Clausal Predicate Abstraction
Authors: Shuvendu K. Lahiri, Shaz Qadeer
Venue: Proceedings of the 22nd International Conference on Automated Deduction (2009)

In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relative to the asymptotic complexity of checking an annotated program in a given assertion logic. Unlike previous approaches, we pose the predicate abstraction problem as a decision problem, instead of the traditional inference problem. For assertion logics closed under weakest (liberal) precondition and Boolean connectives, we show two restrictions of the predicate abstraction problem where the two complexities match. The restrictions correspond to the case of monomial and clausal abstraction. For these restrictions, we show a symbolic encoding that reduces the predicate abstraction problem to checking the satisfiability of a single formula whose size is polynomial in the size of the program and the set of predicates. We also provide a new iterative algorithm for solving the clausal abstraction problem that can be seen as the dual of the Houdini algorithm for solving the monomial abstraction problem.
Use of PERC Pico in the AIDA avionics platform
Authors: Tobias Schoofs, Eric Jenn, Stéphane Leriche, Kelvin Nilsen, Ludovic Gauthier, Marc Richard-Foy
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

In this paper, we present the DIANA experiment on the use of Java in avionics safety critical applications. First, we discuss some concerns about the porting of the Java platform on the ARINC 653 operating system. Then the paper focuses on some important features of the Safety Critical Java Technology adopted in the project. Particular attention is turned on the Java memory model which is stack-based as opposed to the ongoing JSR-302 memory regions model. Benefits and issues of this approach are discussed through a real use case implementation representing part of a Flight Warning System.
Using reasoning patterns to simplify games
Authors: Dimitrios Antos, Avi Pfeffer
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

In complex strategic situations decision-making agents interact with many other agents and have access to many pieces of information throughout their play. This usually leads to game solving being a very complex, almost intractable procedure. Moreover, algorithms for solving games usually fail to explain how the various equilibria come about and how "plausible" they are. Reasoning patterns try to capture the strategic thinking of agents and formalize the usage of the various information or evidence they obtain during their interactions. Identifying reasoning patterns can lead to a significant refinement over the full range of equilibria, as well as considerable computational savings in solving the game. Here we present a polynomial-time algorithm that simplifies the original game by iteratively identifying noneffective (ignorable) decision nodes and removing redundant information edges. In some cases, this can lead to exponential-time savings in computing an equilibrium, yet some -potentially efficient-equilibria may be lost in the process.
Phylogenomics: evolution and genomics intersection
Authors: Virendra S. Gomase, Somnath Tagore
Venue: International Journal of Bioinformatics Research and Applications (2009)

Phylogenomics is the analysis of genomes of a group of closely related species. Almost all functional prediction methods rely on the identification, characterisation and quantification of sequence similarity between the gene of interest and genes for which functional information is available. This is the new evolved branch that is developed from the ongoing genome sequencing projects that have led to a phylogenetic approach based on genome-scale data. The use of large data sets in phylogenomic analysis results in a global increase in resolution owing to a decrease in sampling error.
A Divergence Formula for Randomness and Dimension
Authors: Jack H. Lutz
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

If S is an infinite sequence over a finite alphabet Σ and β is a probability measure on Σ, then the dimension of S with respect to β, written $\dim^\beta(S)$, is a constructive version of Billingsley dimension that coincides with the (constructive Hausdorff) dimension dim(S) when β is the uniform probability measure. This paper shows that dim β (S) and its dual Dim β (S), the strong dimension of S with respect to β, can be used in conjunction with randomness to measure the similarity of two probability measures ¿ and β on Σ. Specifically, we prove that the divergence formula $$ {\mathrm {dim}}^\beta(R) = {\mathrm{Dim}}^\beta(R) =\frac{{\mathcal{H}}(\alpha)}{{\mathcal{H}}(\alpha) + {\mathcal{D}}(\alpha || \beta)} $$holds whenever ¿ and β are computable, positive probability measures on Σ and R ¿ Σ ¿ is random with respect to ¿. In this formula, ${\mathcal{H}}(\alpha)$ is the Shannon entropy of ¿, and ${\mathcal{D}}(\alpha||\beta)$ is the Kullback-Leibler divergence between ¿ and β.
Provably Secure Short Proxy Signature Scheme from Bilinear Maps
Authors: Hu Guozheng, Hong Fan
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

A new formal model of security for proxy signature schemes is presented and a provably secure short proxy signature scheme is proposed from bilinear maps. The proposed proxy signature scheme is based on two short secure signature schemes. Finally, a security proof of the proposed proxy signature scheme is showed by reducing directly the security of the proxy scheme to the security of the two basic signature schemes. The proposed proxy signature scheme has the shortest proxy signatures, the proxy signature generation needs no pairing operation and verification needs just one pairing operation.
Social networking and education: emerging research within CSCL
Authors: Christine Greenhow
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

In this paper I introduce a youth-initiated practice: online social networking that is transforming our society in important ways and has vast implications for learning research and education. I introduce the social and technical features that characterize social networking systems and outline results from emerging research that suggests the social and intellectual practices in which participants naturally engage and how these relate to the competencies increasingly valued in formal education. Next, I discuss one research projects which I am currently pursuing that build on early work and suggest how educational programs might employ such practices to advantage. Finally, I discuss what I see as the educative value of this technology in certain contexts and suggest a course for future research and development. My overall goals are to inform other researchers interested in pursuing similar projects and to stimulate interdisciplinary conversation about where such agendas fit within and advance the aims of CSCL.
The Economic Benefts of Web Mining
Authors: David Kinzel, Micah Klettke, Paul Uppal, Naheed Visram, Keivan Kianmehr, Reda Alhajj, Jon Rokne
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

In this paper, we investigate and explore the process of analyzing log data of website visitor traffic in order to assist the owner of a website in understanding the behavior of its visitors. The developed approach involves the review of statistical data on the types of visitors that come to the website, as well as the steps they take to reach and satisfy the goal of their visit. The value added from the analysis of this data provides eCommerce and commercial website owners with the information needed to display targeted advertisements or messages to their customers. In the long run, this is expected to allow for the increase in sales and overall customer loyalty.
Computer Aided Numerical Analysis upon the Connecting Rod Bearing Cave Corroding Fault
Authors: Yang Kun, OuYang Guangyao, Yi Tailian, Ye Lina
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

An exceptional breakage on the connecting rod bearing is discovered during the repair of one type of marine diesel engine, and it is found that the fault appears very popular through general investigation, so it is very necessary that the reason for the fault be found to avoid the occurrence of the fault again. In this paper, the axis orbit shape is solved with the Holland algorithm firstly, and then the precise oil film pressure distributionof the bearing wall is obtained by taking advantage of the FEM(FEM: Finite Element Method), finally the cause for the fault is got, Besides this, further research on several improved measures are put in force, which provides powerful theory evidence for both the subsequent rational usage and the configuration betterment of the connecting rod bearing.
Training Data Cleaning for Text Classification
Authors: Andrea Esuli, Fabrizio Sebastiani
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

In text classification (TC) and other tasks involving supervised learning, labelled data may be scarce or expensive to obtain; strategies are thus needed for maximizing the effectiveness of the resulting classifiers while minimizing the required amount of training effort. Training data cleaning (TDC) consists in devising ranking functions that sort the original training examples in terms of how likely it is that the human annotator has misclassified them, thereby providing a convenient means for the human annotator to revise the training set so as to improve its quality. Working in the context of boosting-based learning methods we present three different techniques for performing TDC and, on two widely used TC benchmarks, evaluate them by their capability of spotting misclassified texts purposefully inserted in the training set.
The role of perceived risks among heavy users in e-commerce: a research in Pernambuco, Brazil
Authors: Melissa de Andrade Souza, Jairo Dornelas
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

Consumer behaviour on the Internet is usually related to the user's level of familiarity with the technology and the Internet itself. The more familiar with the Internet, the higher the likelihood of purchasing online. Researchers have demonstrated that Internet literacy may reduce users' perception of risk in electronic commerce. Accordingly, new Internet users perceive more risks than experienced users when it comes to buying items online. As a consequence, new users are more resistant to electronic commerce (e-commerce). It is expected that their low level of online purchasing increases as they become more accustomed to the Internet. This article provides a novel insight into the subject of perceived risks in e-commerce. Unlike previous studies, this research conducted in Brazil indicates that experience in using the Internet may provide heavy users with a high perception of risk that will also prevent them from making online purchases.
Practical High-Throughput Crossbar Scheduling
Authors: Nikos Chrysos, Giorgos Dimitrakopoulos
Venue: IEEE Micro (2009)

A practical deterministic crossbar scheduler achieves almost full throughput without being heavily affected by short virtual output queues or traffic burstiness. Simple additions offer deterministic service guarantees and distribute the bandwidth of congested links in a weighted, fair manner.
Fast and Efficient Synchronization and Communication Collective Primitives for Dual Cell-Based Blades
Authors: Epifanio Gaona, Juan Fernández, Manuel E. Acacio
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

The Cell Broadband Engine (Cell BE) is a heterogeneous multi-core processor specifically designed to exploit thread-level parallelism. Its memory model comprehends a common shared main memory and eight small private local memories. Programming of the Cell BE involves dealing with multiple threads and explicit data movement strategies through DMAs which make the task very challenging. This situation gets even worse when dual Cell-based blades are considered. In this context, fast and efficient collective primitives are indispensable to reduce complexity and optimize performance.In this paper, we describe the design and implementation of three collective operations: barrier, broadcast and reduce. Their design takes into consideration the architectural peculiarities and asymmetries of dual Cell-based blades. Meanwhile, their implementation requires minimal resources, a signal register and a buffer. Experimental results show low latencies and high bandwidths, synchronization latency of 637 ns, broadcast bandwidth of 38.33 GB/s for 16 KB messages, and reduce latency of 1535 ns with 32 floats, on a dual Cell-based blade with 16 SPEs.
Switching to a Mac Portable Genius
Authors: Paul McFedries
Venue:  (2009)

The Genius is in. You don't have to be a genius to switch from a PC to a Mac. But if you want to make the move with less hassle, put this savvy Portable Genius guide to work. Want to share data between your Mac and your PC? Understand the differences between Mac OSX and Windows? Learn how to perform everyday Mac tasks? Transfer important stuff like calendars, contact lists, and music? You'll find cool and useful Genius tips, full-color screenshots, and pages of easy-to-access shortcuts and tools that will save you loads of time and let you enjoy your Mac to the max. Paul McFedries is the president of Logophilia Limited, a technical writing company. He has written more than four dozen books that have sold more than two million copies worldwide. These books include Macs Portable Genius, Teach Yourself VISUALLY Macs, and Teach Yourself VISUALLY Windows Vista. Paul encourages all readers to drop by his Web site, www.mcfedries.com. Portable GENIUS Fun, hip, and straightforward, the new Portable Genius series gives forward-thinking Apple users useful information in handy, compact books that are easy to navigate and don't skimp on the essentials. Collect the whole series and make the most of your Apple digital lifestyle. 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
A computational model for tiling recognizable two-dimensional languages
Authors: Marcella Anselmo, Dora Giammarresi, Maria Madonia
Venue: Theoretical Computer Science (2009)

Tiling systems are a well accepted model to define recognizable two-dimensional languages but they are not an effective device for recognition unless a scanning strategy for the pictures is fixed. We define a tiling automaton as a tiling system equipped with a scanning strategy and a suitable data structure. The class of languages accepted by tiling automata coincides with the REC family. In this framework it is possible to define determinism, non-determinism and unambiguity. Then (deterministic) tiling automata are compared with the other known (deterministic) automata models for two-dimensional languages.
Clipping: A Semantics-Directed Syntactic Approximation
Authors: Dan R. Ghica, Adam Bakewell
Venue: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science (2009)

In this paper we introduce ``clipping,'' a new method of syntactic approximation which is motivated by and works in conjunction with a sound and decidable denotational model for a given programming language. Like slicing, clipping reduces the size of the source code in preparation for automatic verification; but unlike slicing it is an imprecise but computationally inexpensive algorithm which does not require a whole-program analysis. The technique of clipping can be framed into an iterated refinement cycle to arbitrarily improve its precision. We first present this rather simple idea intuitively with some examples, then work out the technical details in the case of an Algol-like programming language and a decidable approximation of its game-semantic model inspired by Hankin and Malacaria's ``lax functor'' approach. We conclude by presenting an experimental model checking tool based on these ideas and some toy programs.