ppxscal/embedding_network huggingface dataset:
An Ngram-based reordering model
Authors: Marta R. Costa-jussí, José A. R. Fonollosa
Venue: Computer Speech and Language (2009)

This paper describes in detail a novel approach to the reordering challenge in statistical machine translation (SMT). This Ngram-based reordering (NbR) approach uses the powerful techniques of SMT systems to generate a weighted reordering graph. Thus, statistical criteria reordering constraints are supplied to an SMT system, and this allows an extension to the SMT decoding search. The NbR approach is capable of generalizing reorderings that have been learned during training, through the use of word classes instead of words themselves. Improvement in translation performance is demonstrated with the EPPS task (Spanish and German to English) and the BTEC task (Arabic to English).
An Improved Gene Expression Programming for Fuzzy Classification
Authors: Xiaobo Liu, Zhihua Cai, Wenyin Gong
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Extracting accurate and understandable classification rules from data is a fundamental data mining activity. Fuzzy classification rules is considered a better classification of knowledge that the fuzzy rules of readability and analytical, and the use of fuzzy rules is very intuitive. In this paper, we present an improved gene expression programming (GEP) for extracting fuzzy classification rules by a logical operators instead of mathematical ones to represent the chromosome validity evaluation. Moreover, a novel technique to evaluate the fitness of the individual rather than transform the chromosome into expression tree is proposed. Our proposed approach has been tested on some benchmark datasets selected from UCI and the results indicate that our approach is highly comparable with other techniques including basic GEP, C4.5 and C4.5 rule.
Dynamic Analysis of Bounds Versus Domain Propagation
Authors: Christian Schulte, Peter J. Stuckey
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Constraint propagation solvers interleave propagation (removing impossible values from variable domains) with search. Previously, Schulte and Stuckey introduced the use of static analysis to determine where in a constraint program domain propagators can be replaced by more efficient bounds propagators and still ensure that the same search space is traversed.This paper introduces a dynamic yet considerably simpler approach to uncover the same information. The information is obtained by a linear time traversal of an analysis graph that straightforwardly reflects the properties of propagators implementing constraints. Experiments confirm that the simple dynamic method is efficient and that it can be used interleaved with search, taking advantage of the simplification of the constraint graph that arises from search.
An interactive introduction to OpenGL and OpenGL ES programming
Authors: Ed Angel, Dave Shreiner
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

OpenGL is a library for doing computer graphics. By using it, you can create interactive applications that render high-quality color images composed of 3D geometric objects and images.
Towards a study opportunities recommender system in ontological principles-based on semantic web environment
Authors: Ana María Borges, Marla Corniel, Richard Gil, Leonardo Contreras, Rafael H. Borges
Venue: WSEAS Transactions on Computers (2009)

A professional career selection is a complicated process for university student candidates and often little technical tolls are available for who aim to enter to the superior education system, since it is necessary to consider the incidence of a multiplicity of variables to obtain a "satisfactory answer" that comes near to the idea that they have preconceived. These variables build up a complex relations map that requires the formulation of an exhaustive and rigorous conceptual scheme. In this research a domain ontological model is presented as support to the student's decision making for opportunities of University studies level of the Venezuelan education system. For the declaration of the domain ontological model developed, the information provided by two organisms (OPSU & CNU) is used. Both are responsible to design the policies and strategies for the superior education in Venezuela. The ontology is designed and created using Methontology approach, since this methodology offers the possibility of improving the progressive creation or captures and knowledge articulation, its elements and relations. In order to represent the ontology Protégé 3.1.1 tool is used, based on the ontological language for the Web: OWL (Web Ontology Language) and; finally, to accede and to visualize the ontology, an application based on the Semantic Web is developed. In the field of the computation, computer science and systems, the concept of profiles or users models has many meanings and connotations, its first and greater diffusion arise with the development and use of on-line increasing systems; however, they have gain great preponderance recently, not only to refer and/or to respond to the passive user who approaches "the system", but for the possibility of taking care of a user stimulated and attracted by "the system". In that sense, the possibility of this "personalized attention" and/or recommendations from "the system" will be obviously conditioned by the user context. Centered on the possibility of giving that "customized attention" from which they must select an option between many, it is tried in the future to construct a meta-ontology that integrates the domain ontology with a user profile ontology, thus aiming towards to a Semantic Recommendation System under Multiagent approach in the future, that could be useful to support students decision making process for career selection over different study opportunities in Higher Education level in Venezuela.
Partial Functions and Equality in Answer Set Programming
Authors: Pedro Cabalar
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In this paper we propose an extension of Answer Set Programming (ASP) [1], and in particular, of its most general logical counterpart, Quantified Equilibrium Logic (QEL) [2], to deal with partial functions. Although the treatment of equality in QEL can be established in different ways, we first analyse the choice of decidable equality with complete functions and Herbrand models, recently proposed in the literature [3]. We argue that this choice yields some counterintuitive effects from a logic programming and knowledge representation point of view. We then propose a variant called where the set of functions is partitioned into partial and Herbrand functions (we also call constructors). In the rest of the paper, we show a direct connection to Scott's Logic of Existence [4] and present a practical application, proposing an extension of normal logic programs to deal with partial functions and equality, so that they can be translated into function-free normal programs, being possible in this way to compute their answer sets with any standard ASP solver.
Online energy aware routing in wireless networks
Authors: Aravind B Mohanoor, Sridhar Radhakrishnan, Venkatesh Sarangan
Venue: Ad Hoc Networks (2009)

Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flows. To maximize network lifetime, the paths for message flows are chosen in such a way that the total energy consumed along the path is minimized while avoiding energy depleted nodes. Finding paths which consume minimum energy and finding paths which do not use energy depleted nodes lead to conflicting objectives. In this paper, we propose two-phased energy aware routing strategies that balance these two conflicting objectives by transforming the routing problem into a multi-metric widest path problem. We find that the proposed approaches outperform the best-known algorithms in the literature. We also demonstrate a simple but insightful relationship between the total energy required along a path and the minimum remaining energy of a node along the path. We further exploit this relationship to show that staying within the solution space of paths with high residual energy and low total energy provides much improved lifetimes in general.
CCITT standardization for digital facsimile
Authors: T. L. McCullough
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

In November, 1979, the CCITT Study Group XIV met to complete, among other items, several years of work on the Recommendations defining Group 3 digital facsimile. This paper reviews the results of this work in terms of technical implication, terminal features, and facsimile services. In particular, CCITT Recommendations T.4 and T.30 are discussed. (These Recommendations will be finalized by the CCITT in Geneva, November, 1980.)
On some construction methods for 1-Lipschitz aggregation functions
Authors: Jana Kalická
Venue: Fuzzy Sets and Systems (2009)

Flipping method for constructing copulas from a given copula is extended to aggregation functions. Aggregation functions admitting flipping method are characterized and studied. Moreover, the algebraic structure of several kinds of dualities on aggregation functions, including the flipping method, the reverse method and the standard duality, is classified. Based on composition of construction methods, several new construction methods for 1-Lipschitz aggregation functions are introduced, and their algebraic relationships are studied.
Encouraging witting participation and performance in digital live art
Authors: Jennifer G. Sheridan, Nick Bryan-Kinns, Alice Bayliss
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

We describe a framework for characterizing people's behavior with Digital Live Art. Our framework considers people's wittingness, technical skill, and interpretive abilities in relation to the performance frame. Three key categories of behavior with respect to the performance frame are proposed: performing, participating, and spectating. We exemplify the use of our framework by characterizing people's interaction with a DLA - iPoi. This DLA is based on the ancient Maori art form of poi and employs a wireless, peer-to-peer exertion interface. The design goal of iPoi is to draw people into the performance frame and support transitions from audience to participant and on to performer. We reflect on iPoi in a public performance and outline its key design features.
The Decomposition of Human-Written Book Summaries
Authors: Hakan Ceylan, Rada Mihalcea
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

In this paper, we evaluate the extent to which human-written book summaries can be obtained through cut-and-paste operations from the original book. We analyze the effect of the parameters involved in the decomposition algorithm, and highlight the distinctions in coverage obtained for different summary types.
Recognition of Emotions in German Speech Using Gaussian Mixture Models
Authors: Martin Vondra, Robert Vích
Venue: Multimodal Signals: Cognitive and Algorithmic Issues: COST Action 2102 and euCognition International School Vietri sul Mare, Italy, April 21-26, 2008 Revised Selected and Invited Papers (2009)

The contribution describes experiments with recognition of emotions in German speech signal based on the same principle as recognition of speakers. The most robust algorithm for speaker recognition is based on Gaussian Mixture Models (GMM). We examine three parameter sets: the first contains suprasegmental features, in the second are segmental features and the last is a combination of the two previous parameter sets. Further we want to explore the dependency of the classification accuracy on the number of GMM model components. The aim of this contribution is a recommendation for the number of GMM components and the optimal selection of speech parameters for emotion recognition in German speech.
Note: Minimal achievable approximation ratio for MAX-MQ in finite fields
Authors: Shang-Wei Zhao, Xiao-Shan Gao
Venue: Theoretical Computer Science (2009)

Given a multivariate quadratic polynomial system in a finite field F"q, the problem MAX-MQ is to find a solution satisfying the maximal number of equations. We prove that the probability of a random assignment satisfying a non-degenerate quadratic equation is at least 1q-O(q^-^n^2), where n is the number of the variables in the equation. Consequently, the random assignment provides a polynomial-time approximation algorithm with approximation ratio q+O(q^-^n^2) for non-degenerate MAX-MQ. For large n, the ratio is close to q. According to a result by Hastad, it is NP-hard to approximate MAX-MQ with an approximation ratio of q-@e for a small positive number @e. Therefore, the minimal approximation ratio that can be achieved in polynomial time for MAX-MQ is q.
Local overlaps in special unfoldings of convex polyhedra
Authors: Brendan Lucier
Venue: Computational Geometry: Theory and Applications (2009)

We define a notion of local overlaps in polyhedron unfoldings. We use this concept to construct convex polyhedra for which certain classes of edge unfoldings contain overlaps, thereby negatively resolving some open conjectures. In particular, we construct a convex polyhedron for which every shortest path unfolding contains an overlap. We also present a convex polyhedron for which every steepest edge unfolding contains an overlap. We conclude by analyzing a broad class of unfoldings and again find a convex polyhedron for which they all contain overlaps.
Finding the influence set through skylines
Authors: Xiaobing Wu, Yufei Tao, Raymong Chi-Wing Wong, Ling Ding, Jeffrey Xu Yu
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

Given a set P of products, a set O of customers, and a product p &epsilon; P, a bichromatic reverse skyline query retrieves all the customers in O that do not find any other product in P to be absolutely better than p. More specifically, a customer o &epsilon; O is in the reverse skyline of p &epsilon; P if and only no other product in P better matches the preference of o on all dimensions. The only existing bichromatic reverse skyline algorithm, which we refer to as basic, is designed for uncertain data. This paper focuses on traditional datasets, where each object is a precise point. Since a precise point can be regarded as a special uncertain object, basic can still be applied. However, as precise data are inherently easier to handle than uncertain data, one should expect that basic can be further improved by taking advantage of the reduced problem complexity. Indeed, we observe several non-trivial heuristics that can optimize the access order to achieve stronger pruning power. Motivated by this, we propose a new algorithm called BRS, and prove that BRS never entails more I/Os than basic. Besides our theoretical analysis, we also perform extensive experiments to show that in practice BRS usually outperforms basic by a large factor. For example, when both P and O follow the anti-correlated distribution, BRS is faster than basic by an order of magnitude. Finally, we address a new variation of bichromatic reverse skyline search where the conventional definition of dynamic skylines no longer makes sense.
The influence of cell geometry on the accuracy of upwind schemes in the low mach number regime
Authors: Felix Rieper, Georg Bader
Venue: Journal of Computational Physics (2009)

It is well known, that standard upwind schemes for the Euler equations face a number of problems in the low Mach number regime: stiffness, cancellation and accuracy problems. A new aspect, presented in this paper, is the dependence on the cell geometry: applied on a triangular grid, the accuracy problem disappears, i.e. flows of arbitrarily small Mach numbers can be simulated on a fixed mesh. We give an asymptotic analysis of this, up to date unknown, phenomenon for the first-order Roe scheme and present a number of numerical results.
Detecting P2P Botnets Using a Multi-phased Flow Model
Authors: Sang-Kyun Noh, Joo-Hyung Oh, Jae-Seo Lee, Bong-Nam Noh, Hyun-Cheol Jeong
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

In this paper, we propose a useful method for modeling multi-phased flows of P2P botnet traffic. Botnets are becoming more sophisticated and more dangerous each day and attackers use the P2P protocol to avoid centralized botnet topologies. We focus on the feature that a peer bot generates multiple traffic to communicate with large number of remote peers. In this case, phased botnet flows have similar patterns, which occur at irregular intervals. We compress duplicated flows via flow grouping and construct a transition model of the clustered flows using a probability-based matrix. A flow state is decided by features consisting of; protocol, port, and traffic. Our model involves transition information about the state values. Finally, we use the likelihood ratio for detection. In the experimental evaluation, we show the efficiency of our proposed system with the SpamThru, Storm, and Nugache botnets.
Software implementation of a neuronal system which enables the prediction of the wire breaking during continuous casting
Authors: Gelu Ovidiu Tirian, Camelia Bretotean Pinca
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

In case of the neuronal system useful for predicting wire breaking during continuous casting, we have used the Matlab implementing environment. Because during the dynamic serial networks the temperature has the same value, all spatial networks have the same temperature during the process, the system training has been reduced to using each type of neuronal network at the time. Due to this fact, the dynamic-serial network has been used separately from the spatial network. While testing the networks that use different new data sets, 100% of them suffered from cracks, whether there had been no crack before. Once we have used all the networks, the entire neuronal system could have been tested. The system has acknowledged all the cases very accurately.
(Bi)simulations up-to characterise process semantics
Authors: David de Frutos Escrig, Carlos Gregorio Rodríguez
Venue: Information and Computation (2009)

We define (bi)simulations up-to a preorder and show how we can use them to provide a coinductive, (bi)simulation-like, characterisation of semantic (equivalences) preorders for processes. In particular, we can apply our results to all the semantics in the linear time-branching time spectrum that are defined by preorders coarser than the ready simulation preorder. The relation between bisimulations up-to and simulations up-to allows us to find some new relations between the equivalences that define the semantics and the corresponding preorders. In particular, we have shown that the simulation up-to an equivalence relation is a canonical preorder whose kernel is the given equivalence relation. Since all of these canonical preorders are defined in an homogeneous way, we can prove properties for them in a generic way. As an illustrative example of this technique, we generate an axiomatic characterisation of each of these canonical preorders, that is obtained simply by adding a single axiom to the axiomatization of the original equivalence relation. Thus we provide an alternative axiomatization for any axiomatizable preorder in the linear time-branching time spectrum, whose correctness and completeness can be proved once and for all. Although we first prove, by induction, our results for finite processes, then we see, by using continuity arguments, that they are also valid for infinite (finitary) processes.
Application of Radial Basis Function Neural Network for Sales Forecasting
Authors: R. J. Kuo, Tung-Lai Hu, Zhen-Yao Chen
Venue: Proceedings of the 2009 International Asia Conference on Informatics in Control, Automation and Robotics (2009)

This paper proposes a hybrid evolutionary algorithm based radial basis function neural network (RBFnn) for sales forecasting. The proposed hybrid of particle swarm and genetic algorithm based optimization (HPSGO) algorithm gathers virtues of particle swarm optimization (PSO) and genetic algorithm (GA) to improve the learning performance of RBFnn. The diversity of chromosomes results in higher chance to search in the direction of global minimum instead of being confined to local minimum. Experimental results of papaya milk sales data show that the proposed HPSGO algorithm outperforms PSO, GA and Box-Jenkins model in accuracy.
QoS-Constrained Stochastic Workflow Scheduling in Enterprise and Scientific Grids
Authors: Ali Afzal, John Darlington, A. McGough
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Grid computing infrastructures are inherently dynamic and unpredictable environments shared by many users. Grid schedulers aim to make efficient use of Grid resources while providing the best possible performance to the Grid applications and satisfying the associated performance and policy constraints. Additionally, in commercial Grid settings, where the Grid resource brokering becomes an increasingly important part of Grid scheduling, it is necessary to minimise the cost of application execution on the behalf of the Grid users, while ensuring that the applications meet their QoS constraints. Efficient resource allocation could in turn also allow the resource broker to maximise it's profit by minimising the number of resources procured. Scheduling in such a large-scale, dynamic and distributed environment is a complex undertaking. In this paper, we propose an approach to Grid scheduling which abstracts over the details of individual applications, focusing instead on the global cost optimisation problem and the scheduling of the entire Grid workload. Our model places particular emphasis on the stochastic and unpredictable nature of the Grid, leading to a more accurate reflection of the state of the Grid and hence more efficient and accurate scheduling decisions.
On using mixed-initiative control: a perspective for managing large-scale robotic teams
Authors: Benjamin Hardin, Michael A. Goodrich
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Prior work suggests that the potential benefits of mixed initiative management of multiple robots are mitigated by situational factors, including workload and operator expertise. In this paper, we present an experiment where allowing a supervisor and group of searchers to jointly decide the correct level of autonomy for a given situation ("mixed initiative") results in better overall performance than giving an agent exclusive control over their level of autonomy ("adaptive autonomy") or giving a supervisor exclusive control over the agent's level of autonomy ("adjustable autonomy"), regardless of the supervisor's expertise or workload. In light of prior work, we identify two elements of our experiment that appear to be requirements for effective mixed initiative control of large-scale robotic teams: (a) Agents must be capable of making progress toward a goal without having to wait for human input in most circumstances. (b) The operator control interface must help the human to rapidly understand and modify the progress and intent of several agents.