ppxscal/embedding_network huggingface dataset:
Investigations on event-based summarization
Authors: Mingli Wu
Venue: Proceedings of the 21st International Conference on computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics: Student Research Workshop (2006)

We investigate independent and relevant event-based extractive mutli-document summarization approaches. In this paper, events are defined as event terms and associated event elements. With independent approach, we identify important contents by frequency of events. With relevant approach, we identify important contents by PageRank algorithm on the event map constructed from documents. Experimental results are encouraging.
MicroPen direct-write deposition of polyimide
Authors: Yu Cao, Liangwen Zhou, Xiaoye Wang, Xiangyou Li, Xiaoyan Zeng
Venue: Microelectronic Engineering (2009)

Polyimide has been widely used as structural or sacrificial material in MEMS device fabrication. However, all the typical methods for processing polyimide are based on lithographic technique, which are time-consuming, expensive and non-flexible. In this paper, we propose a novel approach for depositing polyimide patterns by the microPen direct-write deposition technique, which is CAD direct-driven, maskless, rapid-prototyping, and diverse materials integration. Material and device for the microPen direct-write deposition of polyimide technique are presented in detail, and the influences of direct-writing parameters, such as extrusive gas-pressure, direct-writing velocity and the tip-to-substrate distance, on the profile of the deposited polyimide pattern are discussed. Using commercial gold paste (Au) as the structural layer material and polyimide as the sacrificial layer, a micro air-bridge array is successfully fabricated by the microPen direct-write deposition technique, which shows its potential applications in the area of MEMS device fabrication.
On the Tractability of Maximal Strip Recovery
Authors: Lusheng Wang, Binhai Zhu
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subsequences in the input maps, either directly or in reversed and negated form. The problem Maximal Strip Recovery (MSR) is to find two subsequences G¿ and H¿ of G and H, respectively, such that the total length of disjoint strips in G¿ and H¿ is maximized (or, conversely, the number of markers hence deleted, is minimized). Previously, besides some heuristic solutions, a factor-4 polynomial-time approximation is known for the MSR problem; moreover, several close variants of MSR, MSR-d (with d > 2 input maps), MSR-DU (with marker duplications) and MSR-WT (with markers weighted) are all shown to be NP-complete. Before this work, the complexity of the original MSR problem was left open. In this paper, we solve the open problem by showing that MSR is NP-complete, using a polynomial time reduction from One-in-Three 3SAT. We also solve the MSR problem and its variants exactly with FPT algorithms, i.e., showing that MSR is fixed-parameter tractable. Let k be the minimum number of markers deleted in various versions of MSR, the running time of our algorithms are O(22.73k n + n 2) for MSR, O(22.73k dn + dn 2) for MSR-d, and O(25.46k n + n 2) for MSR-DU.
A domain-specific approach for software development on Manycore platforms
Authors: Jerker Bengtsson, Bertil Svensson
Venue: ACM SIGARCH Computer Architecture News (2009)

The programming complexity of increasingly parallel processors calls for new tools that assist programmers in utilising the parallel hardware resources. In this paper we present a set of models that we have developed as part of a tool for mapping dataflow graphs onto manycores. One of the models captures the essentials of manycores identified as suitable for signal processing, and which we use as target for our algorithms. As an intermediate representation we introduce timed configuration graphs, which describe the mapping of a model of an application onto a machine model. Moreover, we show how a timed configuration graph by very simple means can be evaluated using an abstract interpretation to obtain performance feedback. This information can be used by our tool and by the programmer in order to discover improved mappings.
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
Authors: Rudolf Wille
Venue: Proceedings of the 7th International Conference on Formal Concept Analysis (2009)

Lattice theory today reflects the general Status of current mathematics: there is a rich production of theoretical concepts, results, and developments, many of which are reached by elaborate mental gymnastics; on the other hand, the connections of the theory to its surroundings are getting weaker and weaker, with the result that the theory and even many of its parts become more isolated. Restructuring lattice theory is an attempt to reinvigorate connections with our general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattice theory.
Wireless networks security: Proof of chopchop attack
Authors: Mouhcine Guennoun, Aboubakr Lbekkouri, Amine Benamrane, Mohamed Ben-Tahir, Khalil El-Khatib
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

An encryption protocol is the first line of defense against network attacks. The Wired Equivalent Privacy (WEP), used to secure 802.11 based networks, suffers from many weaknesses that were exploited in order to compromise the security of the network, data confidentiality and integrity. An attack named ChopChop can decrypt the content of a frame without knowing the encryption key. There has been no theoretical proof of the functionality of the attack. In this paper, we will give a review of the attack and build a mathematical model to prove theoretically that the attack is capable of decrypting messages in WEP enabled wireless networks without requiring the knowledge of the encryption key.
Relating spectral and species diversity through rarefaction curves
Authors: D. Rocchini, C. Ricotta, A. Chiarucci, V. de Dominicis, I. Cirillo, S. Maccherini
Venue: International Journal of Remote Sensing (2009)

Rarefaction represents a powerful analytical approach in ecology for estimating the expected number of species within a given study area from local (α-diversity) to regional (γ-diversity) scales. From a landscape perspective, rarefaction curves are directly related to the environmental heterogeneity of the area sampled. The greater the landscape heterogeneity, the greater the expected species diversity. Therefore, remotely sensed images may potentially be used for predicting species diversity through the indirect method of analysing local spectral variation. The aim of this study was to test whether spectral variability can be used as a proxy for species diversity, from local to regional spatial scales. A total of 977 sampling units, each 50 m×50 m, were selected within the Asciano district (Central Italy) following a stratified random sampling. Each sampling unit was manually classified according to the first level of the Corine Land Cover classification legend. Data on plant species composition were collected in 10 m×10 m plots located within 98 random sampling units. The normalized difference vegetation index (NDVI) was calculated from a QuickBird image, and quantized into 8-bit data (256 digital numbers, DNs) for building spectral rarefaction curves. Only those plots falling within the QuickBird image were used, which had the effect of reducing the thematic legend to two classes: crops and seminatural vegetation. Species and spectral rarefaction curves were then constructed for each land cover class. Rarefaction curves based on species and spectral properties showed similar results, that is a significantly different number of accumulated values given the same sampling effort for the two classes considered. The results of this study suggest that the shape of the spectral rarefaction curves may be an indirect indicator of environmental diversity, and thus may have potential for predicting biodiversity from local to landscape scales.
Towards a neurocomputational model of speech production and perception
Authors: Bernd J. Kröger, Jim Kannampuzha, Christiane Neuschaefer-Rube
Venue: Speech Communication (2009)

The limitation in performance of current speech synthesis and speech recognition systems may result from the fact that these systems are not designed with respect to the human neural processes of speech production and perception. A neurocomputational model of speech production and perception is introduced which is organized with respect to human neural processes of speech production and perception. The production-perception model comprises an artificial computer-implemented vocal tract as a front-end module, which is capable of generating articulatory speech movements and acoustic speech signals. The structure of the production-perception model comprises motor and sensory processing pathways. Speech knowledge is collected during training stages which imitate early stages of speech acquisition. This knowledge is stored in artificial self-organizing maps. The current neurocomputational model is capable of producing and perceiving vowels, VC-, and CV-syllables (V=vowels and C=voiced plosives). Basic features of natural speech production and perception are predicted from this model in a straight forward way: Production of speech items is feedforward and feedback controlled and phoneme realizations vary within perceptually defined regions. Perception is less categorical in the case of vowels in comparison to consonants. Due to its human-like production-perception processing the model should be discussed as a basic module for more technical relevant approaches for high-quality speech synthesis and for high performance speech recognition.
Probabilistic model for production costs with discrete variable
Authors: Daniela Damian, Adela Sasu, Nicoleta David, Lucian Patrascu
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

In this paper we present a probabilistic model for the production costs weighed with quantitative units. The random variable is considered discrete. With help of this model we can calculate an average value of the costs.
An Evaluation on Using Virtual Reality and 3D Visualisation in Science Education
Authors: Yau-Yuen Yeung
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)

With prudent consideration of the plausible merits and impacts in both the learning and instructional domains, an array of relatively simple and inexpensive virtual reality and 3D visualisation technologies were employed to develop many sets of science courseware or resource kits to support the training of science teachers. Most of those materials are being placed on the Internet (website address http://www.ied.edu.hk/has/ised/eindex.htm) as self-learning materials to supplement regular classroom teaching of science. After being grouped into 7 categories, the educational values for using each category of resources in the learning and teaching of certain science topics were carefully and systematically identified in accordance with our literature review and professional judgments. Besides, questionnaire surveys had been administered to 23 classes of student-teachers to collect information about their prior knowledge, receptivity and evaluation of those science courseware/resource kits and their underlying technologies for facilitating science teaching and learning. The survey findings show that respondents rated most of our science courseware with high quality. It is also revealed that respondents were taking a quite positive attitude towards the adoption of those new technologies in their future teaching or learning of science.
Computing some fundamental numbers of the variety of nodal cubics in P3
Authors: Josep M. Miret, Jordi Pujolàs, Kumar Saurav, Sebastià Xambó-Descamps
Venue: Journal of Symbolic Computation (2009)

In this paper we obtain some fundamental numbers of the family U"n"o"d of non-degenerate nodal cubics in P^3 involving, in addition to the characteristic conditions, other fundamental conditions, as for example that the node lies on a plane. Some of these numbers were first obtained by Schubert in his Kalkul der abzahlenden Geometrie. In our approach we construct several compactifications of U"n"o"d, which can be obtained as a sequence of blow-ups of a suitable projective bundle K"n"o"d. We also provide geometric interpretations of the degenerations that appear as exceptional divisors. The computations have been carried out with the Wit system.
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
Authors: A. S. Lewis, D. R. Luke, J. Malick
Venue: Foundations of Computational Mathematics (2009)

The idea of a finite collection of closed sets having &#x201c;linearly regular intersection&#x201d; at a point is crucial in variational analysis. This central theoretical condition also has striking algorithmic consequences: in the case of two sets, one of which satisfies a further regularity condition (convexity or smoothness, for example), we prove that von Neumann&#x2019;s method of &#x201c;alternating projections&#x201d; converges locally to a point in the intersection, at a linear rate associated with a modulus of regularity. As a consequence, in the case of several arbitrary closed sets having linearly regular intersection at some point, the method of &#x201c;averaged projections&#x201d; converges locally at a linear rate to a point in the intersection. Inexact versions of both algorithms also converge linearly.
Security Policies Enforcement Using Finite Edit Automata
Authors: Danièle Beauquier, Joëlle Cohen, Ruggero Lanotte
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Edit automata have been introduced by J. Ligatti et al. as a model for security enforcement mechanisms which work at run time. In a distributed interacting system, they play a role of monitor that runs in parallel with a target program and transforms its execution sequence into a sequence that obeys the security property. In this paper we characterize security properties which are enforceable by finite edit automata, i.e. edit automata with a finite set of states. We prove that these properties are a sub-class of ~-regular sets. Moreover given an ~-regular set P, one can decide in time O(n^2) whether P is enforceable by a finite edit automaton (where n is the number of states of the finite automaton recognizing P) and we give an algorithm to synthesize the controller.
Conceptual Modeling of IS-A Hierarchies for XML
Authors: Martin Necasky, Jaroslav Pokorny
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

In this paper we briefly describe a new conceptual model for XML called XSEM. It is a combination of several approaches in the area. It divides the conceptual modeling process to conceptual and structural level. At the conceptual level, we design an overall conceptual schema of a domain independently on the required hierarchical representations of the data in XML documents. At the structural level, we design required hierarchical representations of the modeled data in different types of XML documents. In this paper, we further extend XSEM for modeling IS-A hierarchies. We also show how conceptual XSEM schemes can be represented at the logical level in XML schemes specified in the XML Schema language.
An intelligent adaptive noise cancellation system for the extraction of fetal electrocardiogram
Authors: Ravi Kumar Jatoth, Saladi S. V. K. K. Anoop, Ch. Midhun Prabhu
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

The continuous monitoring of fetal heart condition during pregnancy is of great medical importance. Electro Cardio Gram (ECG) is used to record changes in the heart, thus can diagnose any malfunctioning in the heart. The obtained fetal ECG (FECG) signal is severely contaminated by maternal cardiogram (MECG), power line interference, base line-wander etc. The low Signal to noise Ratio of fetal ECG makes it difficult to analyze it effectively. This paper describes the bio-medical application of adaptive noise cancelling techniques for filtering of the obtained noisy ECG using biologically inspired algorithms such as Genetic Algorithm (GA) and Particle Swarm Optimization (PSO).
A robust and efficient finite volume scheme for the discretization of diffusive flux on extremely skewed meshes in complex geometries
Authors: Philippe Traoré, Yves Marcel Ahipo, Christophe Louste
Venue: Journal of Computational Physics (2009)

In this paper an improved finite volume scheme to discretize diffusive flux on a non-orthogonal mesh is proposed. This approach, based on an iterative technique initially suggested by Khosla [P.K. Khosla, S.G. Rubin, A diagonally dominant second-order accurate implicit scheme, Computers and Fluids 2 (1974) 207-209] and known as deferred correction, has been intensively utilized by Muzaferija [S. Muzaferija, Adaptative finite volume method for flow prediction using unstructured meshes and multigrid approach, Ph.D. Thesis, Imperial College, 1994] and later Fergizer and Peric [J.H. Fergizer, M. Peric, Computational Methods for Fluid Dynamics, Springer, 2002] to deal with the non-orthogonality of the control volumes. Using a more suitable decomposition of the normal gradient, our scheme gives accurate solutions in geometries where the basic idea of Muzaferija fails. First the performances of both schemes are compared for a Poisson problem solved in quadrangular domains where control volumes are increasingly skewed in order to test their robustness and efficiency. It is shown that convergence properties and the accuracy order of the solution are not degraded even on extremely skewed mesh. Next, the very stable behavior of the method is successfully demonstrated on a randomly distorted grid as well as on an anisotropically distorted one. Finally we compare the solution obtained for quadrilateral control volumes to the ones obtained with a finite element code and with an unstructured version of our finite volume code for triangular control volumes. No differences can be observed between the different solutions, which demonstrates the effectiveness of our approach.
Classification Algorithm Based on Feature Selection and Samples Selection
Authors: Yitian Xu, Ling Zhen, Liming Yang, Laisheng Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

A new classification algorithm based on support vector machine and Rough set theory is proposed in the paper. We make great use of the advantages of Rough set theory in dealing with vagueness and uncertainty information, firstly select important features by attribute reduction; secondly select effective samples by rule induction; finally construct support vector classifier by the selected important features and effective samples. Thus it can reduce training samples' dimensions, decrease training samples' scales and noise disturbing. It can provide us with the benefits of improving support vector machine's training speed and classification accuracy. Result of image recognition verifies its efficiency and feasibility. It also provides us an effective method to deal with the large scale and high dimensions data set.
Symmetry Breaking using Value Precedence
Authors: Toby Walsh
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

We present a comprehensive study of the use of value precedence constraints to break value symmetry. We first give a simple encoding of value precedence into ternary constraints that is both efficient and effective at breaking symmetry. We then extend value precedence to deal with a number of generalizations like wreath value and partial interchangeability. We also show that value precedence is closely related to lexicographical ordering. Finally, we consider the interaction between value precedence and symmetry breaking constraints for variable symmetries.
A Foundational Architecture for Artificial General Intelligence
Authors: Stan Franklin
Venue: Proceeding of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006 (2007)

Implementing and fleshing out a number of psychological and neuroscience theories of cognition, the LIDA conceptual model aims at being a cognitive “theory of everything.” With modules or processes for perception, working memory, episodic memories, “consciousness,” procedural memory, action selection, perceptual learning, episodic learning, deliberation, volition, and non-routine problem solving, the LIDA model is ideally suited to provide a working ontology that would allow for the discussion, design, and comparison of AGI systems. The LIDA architecture is based on the LIDA cognitive cycle, a sort of “cognitive atom.” The more elementary cognitive modules and processes play a role in each cognitive cycle. Higher-level processes are performed over multiple cycles. In addition to giving a quick overview of the LIDA conceptual model, and its underlying computational technology, we argue for the LIDA architecture's role as a foundational architecture for an AGI. Finally, lessons For AGI researchers drawn from the model and its architecture are discussed.
A semi-analytical-numerical technique to nonlinear stochastic differential equations
Authors: Parviz Darania, Jafar Ahmadi Shali, Karim Ivaz
Venue: Proceedings of the 13th WSEAS international conference on Applied mathematics (2008)

In this note, we study the approximate solutions of nonlinear stochastic differential equations by using the theories and methods of mathematics analysis. An approximate method based on piecewise linearazation is developed for the determination of semi-analytical-numerical solution of nonlinear stochastic differential equations. Also, linearazation methods for initial value problems in stochastic differential equations which have singular points are introduced.
Pneumatic haptic interface fuzzy controller for simulation of abdominal palpations during colonoscopy
Authors: Mario Cheng, Josh Passenger, Olivier Salvado, Stephan Riek, Sebastien Ourselin, Marcus Watson
Venue: Proceedings of the World Haptics 2009 - Third Joint EuroHaptics conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2009)

Pneumatic control has been used for armature control of robots with pneumatic air muscles achieving accurate position control of the piston actuator with inexpensive solenoid valves. We describe a pneumatic fuzzy controller associated with a pulse width modulation conversion scheme in a novel haptic device within a colonoscopy simulation system. A rubber bladder was used to simulate forces experienced during abdominal palpation during colonoscopy. The haptic device showed good steady-state response when tested with step inputs. A settling time of 0.41s was achieved on positive control step and 0.52–0.81s for negative steps. Dynamic response was adequate for mimicking interactions during inflation stages while noticeably deficient during deflation periods. Tracking accuracy averaged 94.2% within 300ms of the reference input while the user was actively applying abdominal palpation and minor repositioning.