ppxscal/embedding_network huggingface dataset:
Scrap Your Type Applications
Authors: Barry Jay, Simon Peyton Jones
Venue: Proceedings of the 9th international conference on Mathematics of Program Construction (2008)

System F is ubiquitous in logic, theorem proving, language meta-theory, compiler intermediate languages, and elsewhere. Along with its type abstractions come type applications, but these often appear redundant. This redundancy is both distracting and costly for type-directed compilers.We introduce System IF, for implicit System F, in which many type applications can be made implicit. It supports decidable type checking and strong normalisation. Experiments with Haskell suggest that it could be used to reduce the amount of intermediate code in compilers that employ System F.System IF constitutes a first foray into a new area in the design space of typed lambda calculi, that is interesting in its own right and may prove useful in practice.
Automated Dynamic Maintenance of Composite Services Based on Service Reputation
Authors: Domenico Bianculli, Radu Jurca, Walter Binder, Carlo Ghezzi, Boi Faltings
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Service-oriented computing promotes the construction of applications by composing distributed services that are advertised in an open service market. In such an environment, individual services may change and evolve dynamically, requiring composite services to adapt to such changes. The prevailing strategy is to react on failures and replace the defective component of the composite service. However, this reactive approach does not fully exploit the opportunities of a dynamic market where older services may be replaced by better ones.In this paper we promote a novel architecture for automated, dynamic, pro-active, and transparent maintenance and improvement of composite services. We leverage fine-grained client-side monitoring techniques to generate information regarding functional and non-functional properties of service behavior. A reputation manager is responsible for collecting and aggregating this information, and provides economical incentives for honest sharing of feedback. Composite services can thus use reliable reputation information to pro-actively improve their aggregate performance.
On-Line Interactive Dexterous Grasping
Authors: Matei T. Ciocarlie, Peter K. Allen
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In this paper we describe a system that combines human input and automatic grasp planning for controlling an artificial hand, with applications in the area of hand neuroprosthetics. We consider the case where a user attempts to grasp an object using a robotic hand, but has no direct control over the hand posture. An automated grasp planner searches for stable grasps of the target object and shapes the hand accordingly, allowing the user to successfully complete the task. We rely on two methods for achieving the computational rates required for effective user interaction: first, grasp planning is performed in a hand posture subspace of highly reduced dimensionality; second, our system uses real-time input provided by the human user, further simplifying the search for stable grasps to the point where solutions can be found at interactive rates. We demonstrate our approach on a number of different hand models and target objects, in both real and virtual environments.
Experiments with Supervised Fuzzy LVQ
Authors: Christian Thiel, Britta Sonntag, Friedhelm Schwenker
Venue: Proceedings of the 3rd IAPR workshop on Artificial Neural Networks in Pattern Recognition (2008)

Prototype based classifiers so far can only work with hard labels on the training data. In order to allow for soft labels as input label and answer, we enhanced the original LVQ algorithm. The key idea is adapting the prototypes depending on the similarity of their fuzzy labels to the ones of training samples. In experiments, the performance of the fuzzy LVQ was compared against the original approach. Of special interest was the behaviour of the two approaches, once noise was added to the training labels, and here a clear advantage of fuzzy versus hard training labels could be shown.
Multi-ring Particle Swarm Optimization
Authors: Carmelo J. A. Bastos-Filho, Marcel P. Caraciolo, Péricles B. C. Miranda, Danilo F. Carvalho
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

Particle Swarm Optimization (PSO) has been used to solve many different types of optimization problems. By applying PSO to problems where the feasible solutions are too much difficult to find, new ways of solving the problems are required, mainly for hyper dimensional spaces. Many variations on the basic PSO form have been explored, targeting the velocity update equation. Other approaches attempt to change the structure of the swarm. In this paper a novel PSO topology based on multiples rings is proposed for improving the results achieved focusing on the diversity provided by the ring rotations. A comparison with star and ring topologies was performed. Our simulation results have shown that the proposed topology achieves better results than the well known star and ring topologies.
Advanced Permission-Role Relationship in Role-Based Access Control
Authors: Min Li, Hua Wang, Ashley Plank, Jianming Yong
Venue: Proceedings of the 13th Australasian conference on Information Security and Privacy (2008)

Permission-role assignment is an important issue in role-based access control (RBAC). There are two types of problems that may arise in permission-role assignment. One is related to authorization granting process. Conflicting permissions may be granted to a role, and as a result, users with the role may have or derive a high level of authority. The other is related to authorization revocation. When a permission is revoked from a role, the role may still have the permission from other roles. In this paper, we discuss granting and revocation models related to mobile and immobile memberships between permissions and roles, then provide proposed authorization granting algorithm to check conflicts and help allocate the permissions without compromising the security. To our best knowledge, the new revocation models, local and global revocation, have not been studied before. The local and global revocation algorithms based on relational algebra and operations provide a rich variety. We also apply the new algorithms to an anonymity scalable payment scheme.
eGovernment Front-End Services: Administrative and Citizen Cost-Benefits
Authors: Kim Viborg Andersen, Rony Medaglia
Venue: Proceedings of the 7th international conference on Electronic Government (2008)

This paper proposes a cost-benefit model for evaluating front-end e-government services. The citizens' gains are estimated by calculating the citizens' time savings multiplied with their salary earned. The administrative costs and benefits are measured by time savings and the corresponding savings in terms of staff salaries. By illustrating the model through four scenarios for changes in frequency and time savings for case handling and general inquiries in a public state agency, this paper contributes to the field of development of e-government assessment methodologies.
AERIAL: hypothetical trajectory planning for multi-UAVs coordination and control
Authors: Paul-Edouard Marson, Michaël Soulignac, Patrick Taillibert
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

This paper presents a distributed application named AERIAL which allows coordination and control of multiple Unmanned Aerial Vehicles (UAVs) engaged in temporally constrained missions. This application combines multiagent paradigm and trajectory planning techniques and relies on a coordination model taking both deliberation and planning durations into account.
Image Denoising Using Three Scales of Wavelet Coefficients
Authors: Guangyi Chen, Wei-Ping Zhu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

The denoising of a natural image corrupted by the Gaussian white noise is a classical problem in image processing. In this paper, a new image denoising method is proposed by using three scales of dual-tree complex wavelet coefficients. The dual-tree complex wavelet transform is well known for its approximate shift invariance and better directional selectivity, which are very important in image denoising. Experiments show that the proposed method is very competitive when compared with other existing denoising methods in the literature.
H ∞ Filtering for a Mobile Robot Tracking a Free Rolling Ball
Authors: Xiang Li, Andreas Zell
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

This paper focuses on the problem of tracking and predicting the location and velocity of a rolling ball in the RoboCup environment, when the ball is pushed consecutively by a middle-size omnidirectional robot to follow a given path around obstacles. A robust algorithm based on the H &infin; filter is presented to accurately estimate the ball's real-time location and velocity. The performance of this tracking strategy was also evaluated by real-world experiments and comparisons with the Kalman filter.
Improvement of microcalcification cluster detection in mammography utilizing image enhancement techniques
Authors: A. Papadopoulos, D. I. Fotiadis, L. Costaridou
Venue: Computers in Biology and Medicine (2008)

In this work, the effect of an image enhancement processing stage and the parameter tuning of a computer-aided detection (CAD) system for the detection of microcalcifications in mammograms is assessed. Five (5) image enhancement algorithms were tested introducing the contrast-limited adaptive histogram equalization (CLAHE), the local range modification (LRM) and the redundant discrete wavelet (RDW) linear stretching and shrinkage algorithms. CAD tuning optimization was targeted to the percentage of the most contrasted pixels and the size of the minimum detectable object which could satisfactorily represent a microcalcification. The highest performance in two mammographic datasets, were achieved for LRM (A"Z=0.932) and the wavelet-based linear stretching (A"Z=0.926) methodology.
Arithmetic Design on Quantum-Dot Cellular Automata Nanotechnology
Authors: Ismo Hänninen, Jarmo Takala
Venue: Proceedings of the 8th international workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2008)

Quantum-dot cellular automata nanotechnology promises molecular digital circuits with ultra-high clock frequencies, to replace the traditional approaches reaching their physical limits. Although large scale utilization requires still several breakthroughs, there has been serious effort in digital design on this sunrise technology. This review describes the basic concepts of the nanotechnology and the most important existing designs, providing new research directions for the digital community.
A Two-Layer Key Establishment Scheme for Wireless Sensor Networks
Authors: Yun Zhou, Yuguang Fang
Venue: IEEE Transactions on Mobile Computing (2007)

In a large scale sensor network, it is infeasible to assign a unique Transport Layer Key (TLK) for each pair of nodes to provide the end-to-end security due to the huge memory cost per node. Thus conventional key establishment schemes follow a key pre-distribution approach to establish a Link Layer Key (LLK) infrastructure between neighboring nodes and rely on multi-hop paths to provide the end-to-end security. Their drawbacks include the vulnerability to the node compromise attack, large memory cost and energy inefficiency in the key establishment between neighboring nodes. In this paper, we propose a novel key establishment scheme, called LAKE, for sensor networks. LAKE uses a t-degree tri-variate symmetric polynomial to facilitate the establishment of both TLKs and LLKs between sensor nodes in a two-dimensional space, where each node can calculate direct TLKs and LLKs with some logically neighboring nodes and rely on those nodes to negotiate indirect TLKs and LLKs with other nodes. Any two end nodes can negotiate a TLK on demand directly or with the help of only one intermediate node, which can be determined in advance. As for the LLK establishment, LAKE is more secure under the node compromise attack with much less memory cost than conventional solutions. Due to the location-based deployment, LAKE is also energy efficient in that each node has direct LLKs with most neighbors without spending too much energy on the establishment of indirect LLKs with neighbors through multi-hop routing.
Laplacian Spectrum of Weakly Quasi-threshold Graphs
Authors: R. B. Bapat, A. K. Lal, Sukanta Pati
Venue: Graphs and Combinatorics (2008)

In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) adding a new vertex and making it adjacent to all old vertices, (iii) disjoint union of two old graphs, and (iv) adding a new vertex and making it adjacent to all neighbours of an old vertex. This class contains the class of quasi-threshold graphs. We show that weakly quasi-threshold graphs are precisely the comparability graphs of a forest consisting of rooted trees with each vertex of a tree being replaced by an independent set. We also supply a quadratic time algorithm in the the size of the vertex set for recognizing such a graph. We completely determine the Laplacian spectrum of weakly quasi-threshold graphs. It turns out that weakly quasi-threshold graphs are Laplacian integral. As a corollary we obtain a closed formula for the number of spanning trees in such graphs. A conjecture of Grone and Merris asserts that the spectrum of the Laplacian of any graph is majorized by the conjugate of the degree sequence of the graph. We show that the conjecture holds for cographs.
On applications of rough sets theory to knowledge discovery
Authors: Edgar Acuna
Venue:  (2008)

Knowledge Discovery in Databases (KDD) is the nontrivial extraction of implicit, previously unknown and potentially useful information from data. Data preprocessing is a step of the KDD process that reduces the complexity of the data and offers better conditions to subsequent analysis. Rough sets theory, where sets are approximated using elementary sets, is another approach for developing methods for the KDD process. In this doctoral Thesis, we propose new algorithms based on Rough sets theory for three data preprocessing steps: Discretization, feature selection, and instance selection. In Discretization, continuous features are transformed into new categorical features. This is required for some KDD algorithms working strictly with categorical features. In Feature selection, the new subset of features leads to a new dataset of lower dimension, where it is easier to perform a KDD task. When a dataset is very large, an instance selection process is required to decrease the computational complexity of the KDD process. In addition to that, we combine a partitioning clustering algorithm with the Rough sets approach obtaining comparable results to a hierarchical clustering algorithm used along with rough sets. The new methods proposed in this thesis have been tested on datasets taken from the Machine Learning Database Repository at the University of California at Irvine.
Parallel Visualisation Approach of a 3D Heart Model
Authors: Kalpana Kanthasamy, Alwin Kumar Rathinam
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

This research done introduces a parallel approach in visualising a three dimensional (3D) virtual heart model simulation dataset. The paper outlines briefly the Immersed Boundary Method (IBM) and how they differ from regular CFD. The dissimilarities motivate the need to show graphical representation of the IBM. The Immersed Boundary Method was then used to compute the 3D heart model simulation. The resulting simulation data was then visualised utilising a parallel adaptation of the Visualisation Tool Kit (VTK), an open source library. The visualisation was conducted in a cluster computing environment. The computers used in the cluster were off-the-shelf commodity personal computers. The number of processors involved in the parallelism would help to speed up the rendering performance. This research will assist in low cost building of visualising biological modelling applications in the future.
On the State Complexity of Operations on Two-Way Finite Automata
Authors: Galina Jirásková, Alexander Okhotin
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

The number of states in two-way deterministic finite automata (2DFAs) is considered. It is shown that the state complexity of basic operations is: at least m + n ¿ o(m + n) and at most 4m + n + 1 for union; at least m + n ¿ o(m + n) and at most m + n + 1 for intersection; at least n and at most 4n for complementation; at least $\Omega(\frac{m}{n}) + \frac{2^{\Omega(n)}}{\log m}$ and at most $2m^{m+1}\cdot 2^{n^{n+1}}$ for concatenation; at least $\frac{1}{n} 2^{\frac{n}{2}-1}$ and at most $2^{O(n^{n+1})}$ for both star and square; between n and n + 2 for reversal; exactly 2n for inverse homomorphism. In each case m and n denote the number of states in 2DFAs for the arguments.
Brief communication: Tape measure protein having MT3 motif facilitates phage entry into stationary phase cells of Mycobacterium tuberculosis
Authors: Azger Dusthackeer, V.N. Sameer Hassan, Vanaja Kumar
Venue: Computational Biology and Chemistry (2008)

Tape measure protein (TMP) having MT3 motif in mycobacteriophage TM4 genome has been reported to enable the phage infection of Mycobacterium smegmatis during stationary phase. In the present work looking at eight additional mycobacteriophage genomes by in silico analysis, six of them have been found to possess MT3 motif in TMP. The absence of MT3 motif in Che12 and D29 probably makes them incapable of infecting stationary phase cells of Mycobacterium tuberculosis which was experimentally evaluated by the performance of respective luciferase reporter phage constructs developed from the parental phages Che12, D29 and TM4.
Performance and computational burden of histogram based color image retrieval techniques
Authors: K. Konstantinidis, I. Andreadis
Venue: Journal of Computational Methods in Sciences and Engineering (2005)

Due to the fact that image libraries have largely become overcrowded, the need of improved methods for retrieving color images from such libraries has increased immensely. Color-based Image Retrieval (CBIR) is a collection of techniques for retrieving images on the basis of color. An efficient tool, which is widely used in CBIR, is image color histograms. In this paper we present a comparison among the methods used to compare global and local histograms in the color spaces of RGB, HSV, L*a*b* and LCH. Moreover, the computational burden of all the systems carried out was compared and discussed both in terms of CPU time and number of computations. One of the key results from the experiments with global histograms was that the main computational burden was produced by the color space transforms rather than the comparative techniques. All the comparisons of the featured methods were performed through simulations under the environment of the MathWorks' Matlab package.
Masking Faults While Providing Bounded-Time Phased Recovery
Authors: Borzoo Bonakdarpour, Sandeep S. Kulkarni
Venue: Proceedings of the 15th international symposium on Formal Methods (2008)

We focus on synthesis techniques for transforming existing fault-intolerant real-time programs to fault-tolerant programs that provide phased recovery. A fault-tolerant program is one that satisfies its safety and liveness specifications as well as timing constraints in the presence of faults. We argue that in many commonly considered programs (especially in mission-critical systems), when faults occur, simple recovery to the program's normal behavior is necessary, but not sufficient. For such programs, it is necessary that recovery is accomplished in a sequence of phases, each ensuring that the program satisfies certain properties. In this paper, we show that, in general, synthesizing fault-tolerant real-time programs that provide bounded-time phased recovery is NP-complete. We also characterize a sufficient condition for cases where synthesizing fault-tolerant real-time programs that provide bounded-time phased recovery can be accomplished in polynomial-time in the size of the input program's region graph.
Naming Game --- An Automated Tool for Analyzing and Practicing Rapid Serial Naming on Dyslexic Persons
Authors: Jyrki Rissanen
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Most of the recent research on dyslexia agrees on that the speed of rapid serial naming (RSN) is an important correlate of reading acquisition. The reason for its importance lies in the fact that serial naming and reading depend partly on the same processes. Traditionally, rapid automatized naming (RAN) tests have been conducted manually without the help of computer programs. Because of the many limitations related to such method, we have developed a tool called Naming Game to automatize measurement and practicing of the rapid serial naming. Our aim is not only to create a versatile research tool for the researchers of RSN but also to offer an easy-to-use tool for health care professionals who need to carry out these kind of assessments.
Regional Traffic Assignment by ACO
Authors: Vittorio Maniezzo, Matteo Roffilli, Roberto Gabrielli, Alessandra Guidazzi, Manuel Otero, Rolando Trujillo
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

An established research line in ACO systems supports the intuition that ant algorithms are particularly fit for dynamic optimization problems because of their ability to construct an internal representation of the essential elements of the problem to solve, a representation which needs to be updated and not reconstructed when the instance changes.
Languages, Ambiguity, and Verification
Authors: The Spark Team
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

This position paper is based on presentations given at the Grand Challenge workshops held at Gresham College in March 2004 and in Newcastle in July 2005. It reports some of our experience from building the SPARK language and its verification tools. We argue that the provision of an unambiguous semantics for a programming language is crucial if the verification framework is to be sound, deep and efficient. Secondly, we offer some reflections on the (mostly non-technical) barriers that we encounter in trying to deploy SPARK within organizations. Finally, we try to set some goals for future work. 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