ppxscal/embedding_network huggingface dataset:
A Graph-Based Approach for Sentiment Sentence Extraction
Authors: Kazutaka Shimada, Daigo Hashimoto, Tsutomu Endo
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

As the World Wide Web rapidly grows, a huge number of online documents are easily accessible on the Web. We obtain a huge number of review documents that include user's opinions for products. To classify the opinions is one of the hottest topics in natural language processing. In general, we need a large amount of training data for the classification process. However, construction of training data by hand is costly. In this paper, we examine a method of sentiment sentence extraction. This task is to classify sentences in documents into opinions and non-opinions. For the task, we use the Hierarchical Directed Acyclic Graph (HDAG) proposed by Suzuki et al. We obtained high accuracy in the sentiment sentence extraction task. The experimental result shows the effectiveness of the method based on the HDAG.
Petascale computing with accelerators
Authors: Michael Kistler, John Gunnels, Daniel Brokenshire, Brad Benton
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

A trend is developing in high performance computing in which commodity processors are coupled to various types of computational accelerators. Such systems are commonly called hybrid systems. In this paper, we describe our experience developing an implementation of the Linpack benchmark for a petascale hybrid system, the LANL Roadrunner cluster built by IBM for Los Alamos National Laboratory. This system combines traditional x86-64 host processors with IBM PowerXCell™" 8i1 accelerator processors. The implementation of Linpack we developed was the first to achieve a performance result in excess of 1.0 PFLOPS, and made Roadrunner the #1 system on the Top500 list in June 2008. We describe the design and implementation of hybrid Linpack, including the special optimizations we developed for this hybrid architecture. We then present actual results for single node and multi-node executions. From this work, we conclude that it is possible to achieve high performance for certain applications on hybrid architectures when careful attention is given to efficient use of memory bandwidth, scheduling of data movement between the host and accelerator memories, and proper distribution of work between the host and accelerator processors.
Approximation algorithms for constrained generalized tree alignment problem
Authors: Srikrishnan Divakaran
Venue: Discrete Applied Mathematics (2009)

In generalized tree alignment problem, we are given a set S of k biologically related sequences and we are interested in a minimum cost evolutionary tree for S. In many instances of this problem partial phylogenetic tree for S is known. In such instances, we would like to make use of this knowledge to restrict the tree topologies that we consider and construct a biologically relevant minimum cost evolutionary tree. So, we propose the following natural generalization of the generalized tree alignment problem, a problem known to be MAX-SNP Hard, stated as follows: Constrained Generalized Tree Alignment Problem [S. Divakaran, Algorithms and heuristics for constrained generalized alignment problem, DIMACS Technical Report 2007-21, 2007]: Given a set S of k related sequences and a phylogenetic forest comprising of node-disjoint phylogenetic trees that specify the topological constraints that an evolutionary tree of S needs to satisfy, construct a minimum cost evolutionary tree for S. In this paper, we present constant approximation algorithms for the constrained generalized tree alignment problem. For the generalized tree alignment problem, a special case of this problem, our algorithms provide a guaranteed error bound of 2-2/k.
A 52-mW 8.29mm2 19-mode LDPC decoder chip for mobile WiMAX applications
Authors: Xin-Yu Shih, Cheng-Zhou Zhan, Cheng-Hung Lin, An-Yeu (Andy) Wu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

This paper presents a LDPC decoder chip supporting all 19 modes in Mobile WiMAX applications. An efficient IC design strategy is proposed to reduce 31.25% decoding latency, and enhance hardware utilization ratio from 50% to 75%. In addition, we propose a new early termination scheme that can dynamically adjust the iteration number. The multi-mode chip implemented in 8.29mm2 die area can be maximally measured at 83.3MHz with only 52mW power consumption.
A rule base modification scheme in fuzzy controllers for time-delay systems
Authors: Hakkı Murat Genc, Engin Yesil, Ibrahim Eksin, Mujde Guzelkaya, Ozgur Aydın Tekin
Venue: Expert Systems with Applications: An International Journal (2009)

In time-delay control systems, the observed information is naturally related to a past instant and this delayed information signal will usually cause unsatisfactory results. This study deals with how the time-delay information can be used in reorganizing the rule base of the fuzzy controller so as to improve system performance. It basically proposes a new scheme of appropriate shifting of the rule base to compensate the information lag caused by time delay in the system. The parameters affecting the shifting scheme are elaborated in detail and the new shifting scheme is proposed in a tabulated form that assumes the system time constant and the value of time delay as the main parameters. The effectiveness of the proposed methodology has firstly been tried to be illustrated on different simulation examples and, secondly, a real time application has been done on a heat transfer experimental setup.
Parallel algorithm for sorting on OTIS-ring multicomputer
Authors: Keny T. Lucas
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

The Optical Transpose Interconnection System (OTIS) based interconnection network has already gained popularity among researchers for achieving high performance computation. It has become one of the efficient models for optoelectronic parallel computers. Sorting is one of the fundamental problems and is commonly used in many scientific and engineering applications. We are motivated to develop sorting algorithm due to its popularity. In this paper, we propose a parallel algorithm for sorting N (= n2) data elements on an OTIS-Ring optoelectronic parallel computer containing N (= n2) processors. To analyze the time complexity of our proposed algorithm, we count the data movements on electronic links (electronic move) and that on optical links (OTIS move) separately. Our proposed parallel algorithm for sorting requires 0.5n(n2+3n+1) electronic moves + n(2n+0.5) OTIS moves. Thus, the ratio of number of electronic moves to OTIS move of our proposed algorithm is O(n)
A coherent query language for XML
Authors: Krishnaprasad Thirunarayan, Trivikram Immaneni
Venue: Journal of Intelligent Information Systems (2009)

Text search engines are inadequate for indexing and searching XML documents because they ignore metadata and aggregation structure implicit in the XML documents. On the other hand, the query languages supported by specialized XML search engines are very complex. In this paper, we present a simple yet flexible query language, and develop its semantics to enable intuitively appealing extraction of relevant fragments of information while simultaneously falling back on retrieval through plain text search if necessary. Our approach combines and generalizes several available techniques to obtain precise and coherent results.
Intersection between spacecraft viewing vectors and digital elevation models
Authors: N. A. Teanby
Venue: Computers Geosciences (2009)

A method is presented for determining the latitude, longitude, and altitude of each pixel in a remotely sensed image of a planet for the case where there is significant surface topography. The method works by sequentially stepping along the line-of-sight of each pixel in an image until an intersection with the planet surface is detected. The position and altitude of each pixel on the planet can then be used for further analysis and allows comparison with other data sets. For pixels where no intersection occurs the altitude and location of the tangent point are determined. These pixels are important as they provide views of the planet limb and are useful for studying the vertical structure of the atmosphere. Provision is made for reference to an oblate spheroid when calculating the tangent point, which is required for atmospheric applications on oblate planets such as the Earth. The algorithm requires a digital elevation model, along with the viewing geometry and position of the instrument. Illustrative examples are given using the Martian MOLA topography data set for oblique and limb viewing cases.
A survey on MAC protocols for cognitive radio networks
Authors: Claudia Cormio, Kaushik R. Chowdhury
Venue: Ad Hoc Networks (2009)

In cognitive radio (CR) networks, identifying the available spectrum resource through spectrum sensing, deciding on the optimal sensing and transmission times, and coordinating with the other users for spectrum access are the important functions of the medium access control (MAC) protocols. In this survey, the characteristic features, advantages, and the limiting factors of the existing CR MAC protocols are thoroughly investigated for both infrastructure-based and ad hoc networks. First, an overview of the spectrum sensing is given, as it ensures that the channel access does not result in interference to the licensed users of the spectrum. Next, a detailed classification of the MAC protocols is presented while considering the infrastructure support, integration of spectrum sensing functionalities, the need for time synchronization, and the number of radio transceivers. The main challenges and future research directions are presented, while highlighting the close coupling of the MAC protocol design with the other layers of the protocol stack.
Can expertise be discerned from traversal behavior in a content designed hypertext (web) environment?
Authors: Perwaiz B. Ismaili, Richard M. Golden
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

In this paper, we describe new ways of observing effects of content presentation and domain knowledge upon navigation behaviors by designing hypertext presentation format that adheres to content design inspired by discourse and text comprehension literature. Twenty undergraduate Psychology students participated in this preliminary study in investigating domain knowledge and content presentation influence on Hypertext (web) site traversal behavior. Classical data analysis (ANOVA) were used to explore these qualitative phenomena.
Uncovering Interaction Patterns in Mobile Outdoor Gaming
Authors: Daniel Orellana, Monica Wachowicz, Natalia Andrienko, Gennady Andrienko
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

Significant advances in recreation planning have been achieved thanks to the mobile technology and the ubiquitous computation. Today it is possible to know the real time position of a group of individuals participating in an outdoor game, and to obtain a large amount of data about their movements. However, most analyses have focused onindividual movements based on trajectories. In this paper we present a novel form of conceptualising and analysing human movement, based on a metaphor we have called "movement as interaction" which conceives movement as a result of interaction between individuals, collectives and the environment. The implementation of the proposed approach has enabled us to uncover interaction patterns in a group of children participating in an outdoor game based on mobile technology. The first results demonstrate the feasibility of our approach to detect game interactions.
Simplicity and efficiency of integrate-and-fire neuron models
Authors: Hans E. Plesser, Markus Diesmann
Venue: Neural Computation (2009)

Lovelace and Cios (2008) recently proposed a very simple spiking neuron (VSSN) model for simulations of large neuronal networks as an efficient replacement for the integrate-and-fire neuron model. We argue that the VSSN model falls behind key advances in neuronal network modeling over the past 20 years, in particular, techniques that permit simulators to compute the state of the neuron without repeated summation over the history of input spikes and to integrate the subthreshold dynamics exactly. State-of-the-art solvers for networks of integrate-and-fire model neurons are substantially more efficient than the VSSN simulator and allow routine simulations of networks of some 105 neurons and 109 connections on moderate computer clusters.
Revisiting constraint-directed search
Authors: Magnus Ågren, Pierre Flener, Justin Pearson
Venue: Information and Computation (2009)

In constraint-based local search the solutions are described declaratively by a conjunction of (often high-level) constraints. In this article we show that this opens up new ideas for constraint-directed search. For a constraint we introduce three neighbourhoods, where the penalty for that constraint alone is decreasing, increasing, or unchanged. We give specialised algorithms for common constraints that efficiently implement these neighbourhoods. Further, we give a general algorithm that implements these neighbourhoods from specifications of constraints in monadic existential second-order logic. Finally, we show how common constraint-directed local search algorithms are often easier to express using these neighbourhoods.
Optimal parameter trajectory estimation in parameterized SDEs: An algorithmic procedure
Authors: Shalabh Bhatnagar, Karmeshu, Vivek Kumar Mishra
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (2009)

We consider the problem of estimating the optimal parameter trajectory over a finite time interval in a parameterized stochastic differential equation (SDE), and propose a simulation-based algorithm for this purpose. Towards this end, we consider a discretization of the SDE over finite time instants and reformulate the problem as one of finding an optimal parameter at each of these instants. A stochastic approximation algorithm based on the smoothed functional technique is adapted to this setting for finding the optimal parameter trajectory. A proof of convergence of the algorithm is presented and results of numerical experiments over two different settings are shown. The algorithm is seen to exhibit good performance. We also present extensions of our framework to the case of finding optimal parameterized feedback policies for controlled SDE and present numerical results in this scenario as well.
Network front-end processors, yet again
Authors: Mike O'Dell
Venue: Communications of the ACM (2009)

The history of NFE processors sheds light on the trade-offs involved in designing network stack software.
Local area data distribution
Authors: Thomas G. Albright, Robert J. Wallace
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The Information Processing Industry now has available a new link-technology between information and the information user. The new technology is the local radio frequency (RF) voice-grade data broadcast channel.
Verifying UML/OCL Operation Contracts
Authors: Jordi Cabot, Robert Clarisó, Daniel Riera
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

In current model-driven development approaches, software models are the primary artifacts of the development process. Therefore, assessment of their correctness is a key issue to ensure the quality of the final application. Research on model consistency has focused mostly on the models' static aspects. Instead, this paper addresses the verification of their dynamic aspects, expressed as a set of operations defined by means of pre/postcondition contracts.This paper presents an automatic method based on Constraint Programming to verify UML models extended with OCL constraints and operation contracts. In our approach, both static and dynamic aspects are translated into a Constraint Satisfaction Problem. Then, compliance of the operations with respect to several correctness properties such as operation executability or determinism are formally verified.
Subdivision Drawings of Hypergraphs
Authors: Michael Kaufmann, Marc Kreveld, Bettina Speckmann
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We introduce the concept of subdivision drawings of hypergraphs. In a subdivision drawing each vertex corresponds uniquely to a face of a planar subdivision and, for each hyperedge, the union of the faces corresponding to the vertices incident to that hyperedge is connected. Vertex-based Venn diagrams and concrete Euler diagrams are both subdivision drawings. In this paper we study two new types of subdivision drawings which are more general than concrete Euler diagrams and more restricted than vertex-based Venn diagrams. They allow us to draw more hypergraphs than the former while having better aesthetic properties than the latter.
e-governance in community-based poverty reduction strategies
Authors: Sanjo Faniran, Kayode Olaniyan
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This paper highlights the opportunities for e-government strategies in the implementation of Nigeria's Community Economic Empowerment and Development Strategy CEEDS, and details some possible architectural configuration and infrastructural requirements. Using satellite-based communication, the proposed e-government model links up government to citizens (G2C) such that communities can identify their desired projects, communicate with government, implement the project and also provide feedback to the government. Simultaneously, the model enables government to improve programme implementation by identifying opportunities for infrastructure-sharing among contiguous communities, identifying optimal financial resource and risks combination in a cost-efficient manner as well as undertaking monitoring and evaluation of project implementation. It concludes that the citizens would be better off if this technology is deployed in a measured and coordinated way, further leading to the emergence of model e-communities in Nigeria.
Automatic Lip Tracking: Bayesian Segmentation and Active Contours in a Cooperative Scheme
Authors: M. Lievin, P. Delmas, P. Y. Coulon, F. Luthon, V. Fristot
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

An algorithm for speaker's lip contour extraction is presented in this paper. A color video sequence of speaker's face is acquired, under natural lighting conditions and without any particular make-up. First, a logarithmic color transform is performed from RGB to HI (hue, intensity) color space. A bayesian approach segments the mouth area using Markov random field modelling. Motion is combined with red hue lip information into a spatiotemporal neighbourhood. Simultaneously, a Region Of Interest and relevant boundaries points are automatically extracted. Next, an active contour using spatially varying coefficients is initialised with the results of the preprocessing stage. Finally, an accurate lip shape with inner and outer borders is obtained with good quality results in this challenging situation.
Computable Functions in ASP: Theory and Implementation
Authors: Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, Nicola Leone
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Disjunctive Logic Programming (DLP) under the answer set semantics, often referred to as Answer Set Programming (ASP), is a powerful formalism for knowledge representation and reasoning (KRR). The latest years witness an increasing effort for embedding functions in the context of ASP. Nevertheless, at present no ASP system allows for a reasonably unrestricted use of function terms. Functions are either required not to be recursive or subject to severe syntactic limitations, if allowed at all in ASP systems.In this work we formally define the new class of finitely-ground programs, allowing for a powerful (possibly recursive) use of function terms in the full ASP language with disjunction and negation. We demonstrate that finitely-ground programs have nice computational properties: (i) both brave and cautious reasoning are decidable, and (ii) answer sets of finitely-ground programs are computable. Moreover, the language is highly expressive, as any computable function can be encoded by a finitely-ground program. Due to the high expressiveness, membership in the class of finitely-ground program is clearly not decidable (we prove that it is semi-decidable). We single out also a subset of finitely-ground programs, called finite-domain programs, which are effectively recognizable, while keeping computability of both reasoning and answer set computation.We implement all results in DLP, further extending the language in order to support list and set terms, along with a rich library of built-in functions for their manipulation. The resulting ASP system is very powerful: any computable function can be encoded in a rich and fully declarative KRR language, ensuring termination on every finitely-ground program. In addition, termination is "a priori" guaranteed if the user asks for the finite-domain check.
New Call Admission Control and Handoff Techniques for 3-G Mobile Networks
Authors: Geetam Singh Tomar, Shekhar Verma
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

In mobile Networks each type of Services has distinct characteristics and QoS requirement. The important issues in 3-G N/W are to prepare a framework for multi-class services to perform call admission and handoff efficiently. The available Call Admission Control (CAC) and Handoff Techniques in mobile network have considered only single class of service or have touched value of few classes but not beyond. In this paper we have considered 8 types of services, which are differentiated according to their Acceptable delay in transmission, Buffering capacity, Transmission mode and Bit rate. In this approach CAC and Handoff issues are resolved by awarding Priority Number to each cal, which will also resolve issue of collision in CAC and handoff. Performance of proposed framework for CAC and Handoff is evaluated by calculating Call Dropping probability and Call Completion probability.
Human investment techniques for effective software maintenance
Authors: Nicholas L. Marselos
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This paper presents methods for improving the maintenance of software by addressing the psychological issues that impact on software maintenance personnel. The emphasis in this paper is on making software maintenance developers more effective through goal setting, by using team-building approaches, through support personnel, and by using skill profiles to plan for their technical growth.