ppxscal/embedding_network huggingface dataset:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Revisited
Authors: Andreas Maletti, Cătălin Ionuţ Tîrnăucă
Venue: Proceedings of the 3rd International Conference on Algebraic Informatics (2009)

Quasi-alphabetic tree bimorphisms [Steinby, Tîrnă ucă: Defining syntax-directed translations by tree bimorphisms. Theor. Comput. Sci., to appear. http://dx.doi.org/10.1016/j.tcs.2009.03.009 , 2009] are reconsidered. It is known that the class of (string) translations defined by such bimorphisms coincides with the class of syntax-directed translations. This result is extended to a smaller class of tree bimorphisms namely (linear and complete) symbol-to-symbol tree bimorphisms. Moreover, it is shown that the class of simple syntax-directed translations coincides with the class of translations defined by alphabetic tree bimorphisms (also known as finite-state relabelings). This proves that alphabetic tree bimorphisms are not sufficiently powerful to model all syntax-directed translations. Finally, it is shown that the class of tree transformations defined by quasi-alphabetic tree bimorphisms is closed under composition. The corresponding result is known in the variable-free case. Overall, the main results of [Steinby, Tîrnă ucă] are strengthened.
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Authors: Petr Krajca, Vilem Vychodil
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorithms for computing particular patterns represented by maximal rectangles in binary matrices were proposed but their major drawback is their computational complexity limiting their application on relatively small datasets. In this paper we introduce a scalable distributed algorithm for computing maximal rectangles that uses the map-reduce approach to data processing.
Generation of Role Based Access Control Security Policies for Java Collaborative Applications
Authors: J. Briffaut, X. Kauffmann-Tourkestansky, J.-F. Lalande, W. W. Smari
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

Java collaborative applications are increasingly and widely used in the form of applets or servlets, as a way to easily download and execute small programs on one's computer. However, security associated with these downloaded applications, even if it exists, is not easily manageable. Most of the time, it relies on the user's ability to define a security policy for his virtual machine, which is undesirable. This paper proposes to integrate an RBAC mechanism for any Java application. It introduces a simple tag process that allows the developer to incorporate the appropriate policy in the source code of his application. The user is endowed with the ability to choose a role that corresponds to the required level of trust required in order for him to embed the policy in the executed code. A case study of a collaborative application shows how works the proposed API for managing roles, generating policies and logging in. At the end, a discussion about the dynamic enforcement of the generated policies is presented.
Run-Time Adaptation of a Universal User Interface for Ambient Intelligent Production Environments
Authors: Kai Breiner, Daniel Görlich, Oliver Maschino, Gerrit Meixner, Detlef Zühlke
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

The SmartFactory KL is an arbitrarily modifiable and expandable (flexible) intelligent production environment, connecting components from multiple manufacturers (networked), enabling its components to perform context-related tasks autonomously (self-organizing), and emphasizing user-friendliness (user-oriented). This paper presents the results of a research project focusing on the run-time generation and adaptation of a universal task-oriented user interface for such intelligent production environments. It employs a Room-based Use Model (RUM) developed in the context of a continuing research project series on universal remote control devices for intelligent production environments. The SmartFactory KL is the first ambient intelligent production environment for demonstration and development purposes worldwide. After three years of research, a first prototype has been finished that allows for controlling the production line using a single remote user interface able to adapt to varying remote devices according to the actual context of use, in a complex, model-based approach.
An Efficient Algorithm for Fingerprint Matching Based on Convex Hulls
Authors: Chengming Wen, Tiande Guo
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

The purpose of fingerprint matching is to compare two fingerprint images and return a similarity score that represents to the probability of match between the two fingerprints. The performance of an automatic fingerprint identification system is greatly determined by its fingerprint matching algorithm. In this paper, a full fingerprint matching algorithm is presented. The main contribution of this paper is that a novel algorithm based on convex hulls for eliminating spurious matching in fingerprint matching is proposed. It is very important for improving the performance of fingerprint matching algorithm to reducing spurious matching. The algorithm is tested on a public database FVC2002 DB1_A. Experimental results show that the proposed algorithm is performed well compared with other ones.
An Agile MDA Approach for the Development of Service-Oriented Component-Based Applications
Authors: I. Lazar, B. Parv, S. Motogna, I.-G. Czibula, C.-L. Lazar
Venue: Proceedings of the 2008 First International Conference on Complexity and Intelligence of the Artificial and Natural Complex Systems. Medical Applications of the Complex Systems. Biomedical Computing (2008)

Agile Model Driven Architecture (MDA) software development processes apply agile principles in the context of executable models. In this paper we present an agile MDA approach for constructing, running, and testing executable UML service-oriented components. This work is part of a series referring to COMDEVALCO - a framework for Software Component Definition, Validation, and Composition.
Exemplar-Based Interpolation of Sparsely Sampled Images
Authors: Gabriele Facciolo, Pablo Arias, Vicent Caselles, Guillermo Sapiro
Venue: Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition (2009)

A nonlocal variational formulation for interpolating a sparsely sampled image is introduced in this paper. The proposed variational formulation, originally motivated by image inpainting problems, encourages the transfer of information between similar image patches, following the paradigm of exemplar-based methods. Contrary to the classical inpainting problem, no complete patches are available from the sparse image samples, and the patch similarity criterion has to be redefined as here proposed. Initial experimental results with the proposed framework, at very low sampling densities, are very encouraging. We also explore some departures from the variational setting, showing a remarkable ability to recover textures at low sampling densities.
A Study of Orthogonal Matrix-valued Multivariate Wavelet Packets Associated with a Dilation Matrix
Authors: Jun Lu, Tizheng Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

The notion of matrix-valued multiresolution analysis of space L^2(R^3,C^{r\times r}) is introduced. An approach for constructing orthogonal matrix-valued higher-dimensional wavelet packets is presented and their properties are discussed by means of time-frequency analysis method, matrix theory and functional analysis method. Three orthogonality formulas concerning these wavelet packets are obtained. Finally, one new orthonormal basis of L^2(R^3,C^{r\times r}) is obtained by constructing a series of subspaces of orthogonal matrix-valued wavelet packets.
Product-type skew-Hermitian triangular splitting iteration methods for strongly non-Hermitian positive definite linear systems
Authors: Lev A. Krukier, Tatiana S. Martynova, Zhong-Zhi Bai
Venue: Journal of Computational and Applied Mathematics (2009)

By further generalizing the modified skew-Hermitian triangular splitting iteration methods studied in [L. Wang, Z.-Z. Bai, Skew-Hermitian triangular splitting iteration methods for non-Hermitian positive definite linear systems of strong skew-Hermitian parts, BIT Numer. Math. 44 (2004) 363-386], in this paper, we present a new iteration scheme, called the product-type skew-Hermitian triangular splitting iteration method, for solving the strongly non-Hermitian systems of linear equations with positive definite coefficient matrices. We discuss the convergence property and the optimal parameters of this method. Moreover, when it is applied to precondition the Krylov subspace methods, the preconditioning property of the product-type skew-Hermitian triangular splitting iteration is analyzed in detail. Numerical results show that the product-type skew-Hermitian triangular splitting iteration method can produce high-quality preconditioners for the Krylov subspace methods for solving large sparse positive definite systems of linear equations of strong skew-Hermitian parts.
Anatomy of Differential Power Analysis for AES
Authors: Jude Angelo Ambrose, Naeill Aldon, Aleksandar Ignjatovic, Sri Parameswaran
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

Side channel attacks are a significant threatto the deployment ofsecure embedded systems. Differential Power Analysis is one of the powerful power analysis attacks, which can be exploited in secure devices such as smart cards, PDAs and mobile phones. Several researchers in the past havepresented experiments and countermeasures for Differential Power Analysis in AES cryptography, though none of them have described the attack in a step by step manner, covering all the aspects of the attack. Some of the important missing segments are the consideration of pipelines, analysis of the power profile to locate the points of attack, thecorrespondence of the source code, its assemblyrepresentation, and the point of attack.In this paper we describe in detail a step-wise explanation of the Differential Power Analysis of an AES implementation, with all of the aspects identified above.
Enhancing the platform independence of the real-time specification for Java
Authors: A. J. Wellings, Y. Chang, T. Richardson
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

The Real-Time Specification for Java (RTSJ) extends Java's support for platform-independence into the realms of real-time systems. It supports an environment that facilitates on-line feasibility analysis. However, an RTSJ program is normally run on an execution platform that might be shared with other (possibly non Java) applications. This paper explores how the notion of service contracts can be used to enhance the platform-independence of RTSJ applications. It also considers the role of real-time application components within an RTSJ environment.
A study of the non-linear adjustment for analogy based software cost estimation
Authors: Y. F. Li, M. Xie, T. N. Goh
Venue: Empirical Software Engineering (2009)

Cost estimation is one of the most important but most difficult tasks in software project management. Many methods have been proposed for software cost estimation. Analogy Based Estimation (ABE), which is essentially a case-based reasoning (CBR) approach, is one popular technique. To improve the accuracy of ABE method, several studies have been focusing on the adjustments to the original solutions. However, most published adjustment mechanisms are based on linear forms and are restricted to numerical type of project features. On the other hand, software project datasets often exhibit non-normal characteristics with large proportions of categorical features. To explore the possibilities for a better adjustment mechanism, this paper proposes Artificial Neural Network (ANN) for Non-linear adjustment to ABE (NABE) with the learning ability to approximate complex relationships and incorporating the categorical features. The proposed NABE is validated on four real world datasets and compared against the linear adjusted ABEs, CART, ANN and SWR. Subsequently, eight artificial datasets are generated for a systematic investigation on the relationship between model accuracies and dataset properties. The comparisons and analysis show that non-linear adjustment could generally extend ABE's flexibility on complex datasets with large number of categorical features and improve the accuracies of adjustment techniques.
A remote doctor for homecare and medical diagnoses on cardiac patients by an adaptive ECG analysis
Authors: Claudio De Capua, Antonella Meduri, Rosario Morello
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

Today the telemedicine applications are experiencing rapid growth. The possibility of having portable devices to use comfortably at home for monitoring the health of the patient has involved many research areas. In this paper a remote doctor for homecare and medical diagnoses on cardiac patient is proposed. An original smart system has been projected in order to adapt itself to the patient and develop, in this way, a personalized diagnosis taking into account his personal data and his clinical history; a practical and economical device that can adapt to any type of patient. The system is based on a PDA and an ECG sensor which acquires, at a fixed sampling frequency, the heart electrical impulses. In details, a removable and updatable memory is used to store the clinical and personal patient data, while an additional internal and read-only memory stores information on the metrological status of the measurement system. On PDA display, it is possible to observe the ECG signal graph, the information relating to diagnosis and the measurement uncertainty. The patient also has the opportunity to print the results by a Bluetooth printer. Through build-in models the ECG waveform is analyzed in order to diagnose possible arrhythmias occurrences or the happening of a heart attack according to some parameters like age, sex and physical constitution of the patient, and information on the measurement uncertainty. The embedded information on the system metrological performances and patient data are used to configure the computing algorithm and so to reduce the happening of diagnosis faults.
A Dynamic Environment for Video Surveillance
Authors: Paolo Bottoni, Maria Marsico, Stefano Levialdi, Giovanni Ottieri, Mario Pierro, Daniela Quaresima
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Video surveillance systems must support multiple streaming and prompt alert notification. We propose a two-tiered environment: a supervisor defines presentation layouts and model interface reactions to alerts; a surveillant watches synchronized videos, adapts layouts, and is notified with alerts.
Energy-Aware Loop Scheduling and Assignment for Multi-Core, Multi-Functional-Unit Architecture
Authors: Meikang Qiu, Meiqin Liu, Hao Li, Hung-Chung Huang, Wenyuan Li, Jiande Wu
Venue: Journal of Signal Processing Systems (2009)

Switching activity and instruction cycles are two of the most important factors in power dissipation when the supply voltage is fixed. This paper studies the scheduling and assignment problems that minimize the total energy caused by both instruction processing and switching activities for applications with loops on multi-core, multi-Functional-Unit (multi-FU) architectures. An algorithm, EMPLS (Energy Minimization with Probability using Loop Scheduling), is proposed to minimize the total energy (E) while satisfying timing constraint (L) with guaranteed probability (P). We perform scheduling and assignment simultaneously. Our approach shows better performance than the approaches that consider scheduling and assignment in separate phases. Compared with previous work, our algorithm exhibits significant improvement in total energy reduction.
LiveTree: an integrated workbench for discourse processing
Authors: Gian Lorenzo Thione, Martin van den Berg, Chris Culy, Livia Polanyi
Venue: Proceedings of the 2004 ACL Workshop on Discourse Annotation (2004)

In this paper, we introduce LiveTree, a core component of LIDAS, the Linguistic Discourse Analysis System for automatic discourse parsing with the Unified Linguistic Discourse Model (U-LDM) (X et al, 2004). LiveTree is an integrated workbench for supervised and unsupervised creation, storage and manipulation of the discourse structure of text documents under the U-LDM. The LiveTree environment provides tools for manual and automatic U-LDM segmentation and discourse parsing. Document management, grammar testing, manipulation of discourse structures and creation and editing of discourse relations are also supported.
Intelligent Mobile Interaction: A Learning System for Mentally Disabled People (IMLIS)
Authors: Heidi Schelhowe, Saeed Zare
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

This paper describes the main ideas and the architecture of a system called Intelligent Mobile Learning Interaction system (IMLIS) that provides a mobile learning environment for mentally disabled people. The design of IMLIS is based on the idea to adjust its content, the kind of tasks and the mode of display to specific needs of individuals and to engage them for learning activities with new learning motivations due to IMLIS' dynamic structure and flexible patterns. We apply knowledge from the field of research and practice with mentally disabled people as well as pedagogical and didactical aspects in the design.
Brain Dynamics Promotes Function
Authors: Carlos Lourenço
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

Dynamical structure in the brain promotes biological function. Natural scientists look for correlations between measured electrical signals and behavior or mental states. Computational scientists have new opportunities to receive 'algorithmic' inspiration from brain processes and propose computational paradigms. Thus a tradition which dates back to the 1940s with neural nets research is renewed. Real processes in the brain are 'complex' and withstand trivial descriptions. However, dynamical complexity need not be at odds with a computational description of the phenomena and with the inspiration for algorithms that actually compute something in an engineering sense. We engage this complexity from a computational viewpoint, not excluding dynamical regimes that a number of authors are willing to label as chaos. The key question is: what may we be missing computation-wise if we overlook brain dynamics? At this point in brain research, we are happy if we can at least provide a partial answer.
Optimal regression for reasoning about knowledge and actions
Authors: Hans Van Ditmarsch, Andreas Herzig, Tiago De Lima
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We show how in the propositional case both Reiter's and Scherl & Levesque's solutions to the frame problem can be modelled in dynamic epistemic logic (DEL), and provide an optimal regression algorithm for the latter. Our method is as follows: we extend Reiter's framework by integrating observation actions and modal operators of knowledge, and encode the resulting formalism in DEL with announcement and assignment operators. By extending Lutz' recent satisfiability-preserving reduction to our logic, we establish optimal decision procedures for both Reiter's and Scherl & Levesque's approaches: satisfiability is NP-complete for one agent, PSPACE-complete for multiple agents and EXPTIME-complete when common knowledge is involved.
Complemental Use of Multiple Cameras for Stable Tracking of Multiple Markers
Authors: Yuki Arai, Hideo Saito
Venue: Proceedings of the 3rd International Conference on Virtual and Mixed Reality: Held as Part of HCI International 2009 (2009)

In many applications of Augmented Reality (AR), rectangular markers are tracked in real time by capturing with cameras. In this paper, we consider the AR application in which virtual objects are displayed onto markers while the markers and the cameras are freely moving. In this situation, the marker cannot be tracked when the marker is occluded by some objects. In this paper, we propose a method for tracking the projection matrix between the image and the marker even when the maker is occluded, by using cameras. In this method, we transfer the projection matrix for the marker that is detected by the cameras in order to estimate the relative projection matrix for the occluded marker. After computing the relative projection matrices using multiple cameras, we compute a more accurate projection matrix by using particle filter. As a result, we can continuously track the markers even when the marker is occluded.
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
Authors: Ueli Maurer, Stefano Tessaro
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

Computational indistinguishability amplification is the problem of strengthening cryptographic primitives whose security is defined by bounding the distinguishing advantage of an efficient distinguisher. Examples include pseudorandom generators (PRGs), pseudorandom functions (PRFs), and pseudorandom permutations (PRPs).The literature on computational indistinguishability amplification consists only of few isolated results. Yao's XOR-lemma implies, by a hybrid argument, that no efficient distinguisher has advantage better than (roughly) n2 m ¿ 1 ¿ m in distinguishing the XOR of m independent n-bit PRG outputs S 1,...,S m from uniform randomness if no efficient distinguisher has advantage more than ¿ in distinguishing S i from a uniform n-bit string. The factor 2 m ¿ 1 allows for security amplification only if $\delta: For the case of PRFs, a random-offset XOR-construction of Myers was the first result to achieve strong security amplification, i.e., also for $\frac{1}{2} \le \delta .This paper proposes a systematic treatment of computational indistinguishability amplification. We generalize and improve the above product theorem for the XOR of PRGs along five axes. First, we prove the tight information-theoretic bound 2 m ¿ 1 ¿ m (without factor n) also for the computational setting. Second, we prove results for interactive systems (e.g. PRFs or PRPs). Third, we consider the general class of neutralizing combination constructions, not just XOR. As an application, this yields the first indistinguishability amplification results for the cascade of PRPs (i.e., block ciphers) converting a weak PRP into an arbitrarily strong PRP, both for single-sided and two-sided queries. Fourth, strong security amplification is achieved for a subclass of neutralizing constructions which includes as a special case the construction of Myers. As an application we obtain highly practical optimal security amplification for block ciphers, simply by adding random offsets at the input and output of the cascade. Fifth, we show strong security amplification also for weakened assumptions like security against random-input (as opposed to chosen-input) attacks.A key technique is a generalization of Yao's XOR-lemma to (interactive) systems which is of independent interest.