ppxscal/embedding_network huggingface dataset:
Global Asymptotic Stability of Cohen-Grossberg Neural Networks with Mixed Time-Varying Delays
Authors: Haijun Jiang, Xuehui Mei
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

In this paper, we study the Cohen-Grossberg neural networks with mixed time-varying delays. By applying the Lyapunov functional method and combining with the inequality 3abc ≤ a 3 + b 3 + c 3 (a,b,c > 0) technique, a series of new and useful criteria on the existence of equilibrium point and its global asymptotical stability are established. The results obtained in this paper extend and generalize the corresponding results existing in previous literature.
An Homogenization-Based Nonlocal Damage Model for Brittle Materials and Applications
Authors: Zhu Qizhi, Djimedo Kondo, Shao Jian-Fu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

A micromechanics-based constitutive damage model with clear physical grounds and few parameters is presented, in which the Ponte-Castaneda and Willis estimate (PCW estimate) is adopted and applied to solid matrix weaken by penny-shaped microcracks. The basic idea is to integrate the homogenization procedure into the standard thermodynamics framework. An energy release rate-based damage criterion is proposed in which the interaction effects between different cracks families are involved. The proposed constitutive model is then extended to an orientation-based nonlocal version. Finally, this model has been implemented into a finite element code and the numerical results obtained for 2D problems show its predictive capacity and mesh independent characteristics.
CAIRN 2: An FPGA Implementation of the Sieving Step in the Number Field Sieve Method
Authors: Tetsuya Izu, Jun Kogure, Takeshi Shimoyama
Venue: Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems (2007)

The hardness of the integer factorization problem assures the security of some public-key cryptosystems including RSA, and the number field sieve method (NFS), the most efficient algorithm for factoring large integers currently, is a threat for such cryptosystems. Recently, dedicated factoring devices attract much attention since it might reduce the computing cost of the number field sieve method. In this paper, we report implementational and experimental results of a dedicated sieving device "CAIRN 2" with Xilinx's FPGA which is designed to handle up to 768-bit integers. Used algorithm is based on the line sieving, however, in order to optimize the efficiency, we adapted a new implementational method (the pipelined sieving). In addition, we actually factored a 423-bit integer in about 30 days with the developed device CAIRN 2 for the sieving step and usual PCs for other steps. As far as the authors know, this is the first FPGA implementation and experiment of the sieving step in NFS.
A Compiler Framework for Supporting Speculative Multicore Processors
Authors: Pen-Chung Yew
Venue: Proceedings of the 12th Asia-Pacific conference on Advances in Computer Systems Architecture (2007)

As multi-core technology is currently being deployed in computer industry primarily to limit power consumption and improve throughput, continued performance improvement of a single application on such systems remains an important and challenging task. Because of the shortened on-chip communication latency between cores, using thread-level parallelism (TLP) to improve the number of instructions executed per clock cycle, i.e., to improve ILP performance, has shown to be effective for many general-purpose applications. However, because of the program characteristics of these applications, effective speculative schemes at both thread- and instruction-level are crucial.
Combining Frequent and Discriminating Attributes in the Generation of Definite Descriptions
Authors: Diego Jesus Lucena, Ivandré Paraboni
Venue: Proceedings of the 11th Ibero-American conference on AI: Advances in Artificial Intelligence (2008)

The semantic content determination or attribute selection of definite descriptions is one of the most traditional tasks in natural language generation. Algorithms of this kind are required to produce descriptions that are brief (or even minimal) and, at the same time, as close as possible to the choices made by human speakers. In this work we attempt to achieve a balance between brevity and humanlikeness by implementing a number of algorithms for the task. The algorithms are tested against descriptions produced by humans in two different domains, suggesting a strategy that is both computationally simple and comparable to the state of the art in the field.
UML-Based Modeling for What-If Analysis
Authors: Matteo Golfarelli, Stefano Rizzi
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

In order to be able to evaluate beforehand the impact of a strategical or tactical move, decision makers need reliable previsional systems. What-if analysis satisfies this need by enabling users to simulate and inspect the behavior of a complex system under some given hypotheses. A crucial issue in the design of what-if applications in the context of business intelligence is to find an adequate formalism to conceptually express the underlying simulation model. In this experience paper we report on how this can be accomplished by extending UML 2 with a set of stereotypes. Our proposal is centered on the use of activity diagrams enriched with object flows, aimed at expressing functional, dynamic, and static aspects in an integrated fashion. The paper is completed by examples taken from a real case study in the commercial area.
Cultural divide and the Internet
Authors: Matías Recabarren, Miguel Nussbaum, Claudia Leiva
Venue: Computers in Human Behavior (2008)

The aim of this paper is to study the relationship between culture and Internet usage. In the light of studies showing the existence of subcultures within a country, an experiment was designed and conducted based on the Hofstede cultural model and Tiwana's expert knowledge model to determine how social differences affect the Internet usage of first-year university students. Data-mining techniques were then used to find relationships between culture and Internet usage. We conclude that abilities and performance relating to Internet use differs among subcultures not only because of the digital divide but also because of cultural differences. We also show that subcultures tend to converge over time when placed in the same context.
Improved Bounds for Testing Juntas
Authors: Eric Blais
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

We consider the problem of testing functions for the property of being a k-junta (i.e., of depending on at most k variables). Fischer, Kindler, Ron, Safra, and Samorodnitsky (J. Comput. Sys. Sci., 2004) showed that $\tilde{O}(k^2)/\epsilon$ queries are sufficient to test k-juntas, and conjectured that this bound is optimal for non-adaptive testing algorithms.Our main result is a non-adaptive algorithm for testing k-juntas with $\tilde{O}(k^{3/2})/\epsilon$ queries. This algorithm disproves the conjecture of Fischer et al.We also show that the query complexity of non-adaptive algorithms for testing juntas has a lower bound of $\min \big(\tilde{\Omega}(k/\epsilon), 2^k/k\big)$, essentially improving on the previous best lower bound of ¿(k).
A Model for Java with Wildcards
Authors: Nicholas Cameron, Sophia Drossopoulou, Erik Ernst
Venue: Proceedings of the 22nd European conference on Object-Oriented Programming (2008)

Wildcards are a complex and subtle part of the Java type system, present since version 5.0. Although there have been various formalisations and partial type soundness results concerning wildcards, to the best of our knowledge, no system that includes all the key aspects of Java wildcards has been proven type sound. This paper establishes that Java wildcards are type sound. We describe a new formal model based on explicit existential types whose pack and unpack operations are handled implicitly, and prove it type sound. Moreover, we specify a translation from a subset of Java to our formal model, and discuss how several interesting aspects of the Java type system are handled.
Magical Tile
Authors: Maki Terai, Jun Fujiki, Reiji Tsuruno, Kiyoshi Tomimatsu
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

Many computer games are based on "overhead" two-dimensional (2D) computer graphics which are suitable for displaying planar figure. However, in such graphical engines, three-dimensional (3D) structures are also presented in 2D. In the overhead view, the width of a shape is displayed by a horizontal line, and the height and depth are expressed as a vertical line. Such an expression in not realistic, but is intuitively recognizable, particularly in computer games. In this system, 3D geometry data recognizable by the user is generated from tiles placed on a canvas. The geometric shape created by the system can be viewed from an arbitrary angle by a gradual warping of the geometry, without the user being aware of the conversion to the 3D expression.
Electronic Programme Guide Design for Preschool Children
Authors: Ana Vitoria Joly, Lyn Pemberton, Richard Griffiths
Venue: Proceedings of the 6th European conference on Changing Television Environments (2008)

The proliferation of audiovisual content available for young children brings with it the need for an appropriate Electronic Programme Guide (EPG) that meets needs and preferences of pre-schoolers. Two approaches to the design of such a service are discussed. Firstly, a range of existing guidelines on interactive television applications, personalized recommendation systems and interaction design for children are reviewed, in the context of theories of child development. Secondly, we explore the potential for children's collaboration during the categorization process to create a user-appropriate information architecture and interface.
A Methodology for Bridging between RBAC and an Arbitrary Application Program
Authors: Candy Wai-Yue Shum, Sylvia L. Osborn, He Wang
Venue: Proceedings of the 5th VLDB workshop on Secure Data Management (2008)

Role-Based Access Control (RBAC) models have been available since the early 1990s. However, there is no well-understood methodology for using RBAC with an arbitrary application program. We highlight tradeoffs between the ANSI RBAC model and the Role Graph Model, and also enumerate different versions of each. We then discuss alternatives to bridging between an RBAC model and an ad hoc program. An example of the application of one of the alternatives is given.
E-Business in ArguGRID
Authors: Francesca Toni
Venue: Proceedings of the 4th international workshop on Grid Economics and Business Models (2008)

The ArguGRID project aims at supporting e-business applications, and in particular e-procurement, earth observation and business migration scenarios, by means of argumentative agent-based grid technologies. In this paper we outline the main features of the ARGUGRID envisaged system, intended to support more generally service selection and composition in distributed environments, including the grid and service-oriented architectures.
An Energy-Efficient Query Aggregation Scheme for Wireless Sensor Networks
Authors: Jun-Zhao Sun
Venue: Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks (2008)

This paper presents a novel method for optimizing sliding window based continuous queries. We deal with two categories of aggregation operations: stepwise aggregation (e.g. COUNT) and direct aggregation (e.g. MEDIAN). Our approach is, by using packet merging or compression techniques, to reduce the data size to the best extent, so that the total performance is optimal. A QoS weight item is specified together with a query, in which the importance of the four factors, power, delay, accuracy and error rate can be expressed. An optimal query plan can be obtained by studying all the factors simultaneously, leading to the minimum cost. Experiments are conducted to validate the effectiveness of the proposed method.
Attacking the Filter Generator over GF(2m)
Authors: Sondre Rønjom, Tor Helleseth
Venue: Proceedings of the 1st international workshop on Arithmetic of Finite Fields (2007)

We consider the filter generator over GF(2 m ) consisting of a linear feedback shift register of length k that generates a maximal length linear sequence of period 2 mk ¿ 1 over GF(2 m ) and a Boolean function of degree d that combines bits from one element in the shift register (considered as an element in GF(2 m )) and creates a binary output bit z t at any time t. We show how to extend a recent attack by the authors on the binary filter generator to the filter generator over GF(2 m ). The attack recovers the initial state of the filter generator from L keystream bits with complexity O(L), after a pre-computation with complexity $O(L (log_2 L)^3)$, where L is the linear complexity upper bounded by $D=\sum_{i=1}^d {n \choose i}$ with n = mk, which is also the number of monomials of degree ≤ d over GF(2). In addition we explain why a function of only one element of the shift register reduces the linear complexity of the keystream significantly, compared to using the function freely on bits from several words in the initial state. We also discuss implications for the WG stream cipher [4].
Scene Change Detection Schemes for Video Indexing in Uncompressed Domain
Authors: Eyas El-Qawasmeh
Venue: Informatica (2003)

There are a growing number of applications, which extensively use the visual media. A key requirement in those applications is efficient access to the stored visual information for the purposes of indexing, fast retrieval, and scene analysis. To support this vision, many scene change detection algorithms have been developed for both sudden and gradual scene change in uncompressed domain. This paper presents a comparison of shot boundary detection and classification techniques and their variations including histogram, pixel-differences, likelihood ratio, and motion vector. In addition, the pros and cons of each approach with many clarifying comments are presented.
A Social and Emotional Model for Obtaining Believable Emergent Behaviors
Authors: Javier Asensio, Marta Jiménez, Susana Fernández, Daniel Borrajo
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

This paper attempts to define an emotional model for virtual agents that behave autonomously in social worlds. We adopt shallow modeling based on the decomposition of the emotional state in two qualities: valence (pleasantness or hedonic value) and arousal (bodily activation) and, also, for the agent personality based on the five factors model (openness, conscientiousness, extroversion, agreeableness and neuroticism). The proposed model aims to endow agents with a satisfactory emotional state achieved through the social actions, i.e. the development of social abilities. Psychology characterizes these social abilities for: using the language as a tool (verbal and nonverbal communication), being learned, producing reciprocal reward among the individuals involved in the communication and for depending on the individual features. We have implemented our model in the framework of a computer game, AI-live, to show its validity.
High Performance Computer Simulations of Cardiac Electrical Function Based on High Resolution MRI Datasets
Authors: Michal Plotkowiak, Blanca Rodriguez, Gernot Plank, Jürgen E. Schneider, David Gavaghan, Peter Kohl, Vicente Grau
Venue: Proceedings of the 8th international conference on Computational Science, Part I (2008)

In this paper, we present a set of applications that allow performance of electrophysiological simulations on individualized models generated using high-resolution MRI data of rabbit hearts. For this purpose, we propose a pipeline consisting of: extraction of significant structures from the images, generation of meshes, and application of an electrophysiological solver. In order to make it as useful as possible, we impose several requirements on the development of the pipeline. It has to be fast, aiming towards real time in the future. As much as possible, it must use non-commercial, freely available software (mostly open source). In order to verify the methodology, a set of high resolution MRI images of a rabbit heart is investigated and tested; results are presented in this work.
Puzzles, tableaux, and mosaics
Authors: Kevin Purbhoo
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is that we obtain bijective proofs of commutativity and associativity for the ring structures defined either of these objects. In particular, we obtain a new, easy proof of the Littlewood-Richardson rule. Finally we discuss how our operation is related to other known constructions, particularly jeu de taquin.
Characterizing Pseudobase and Predicting RNA Secondary Structure with Simple H-Type Pseudoknots Based on Dynamic Programming
Authors: Oyun-Erdene Namsrai, Keun Ho Ryu
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

RNA is a unique biopolymer that has the ability to store genetic information, like DNA, but also can have a functional role in the cell, like protein. The function of an RNA is determined by its sequence and structure, and the RNA structure is to a large extent determined by RNA's ability to form base pairs with itself. Most work has been done to predict structures that do not contain pseudoknots. Pseudoknots are usually excluded due to the hardness of examining all possible structures efficiently and model the energy correctly. In this paper we will present characterization of Pseudobase and then we will introduce an improved version of dynamic programming solution to find the conformation with the maximum number of base pairs. After then we will introduce an implementation of predicting H-type pseudoknots based on dynamic programming. Our algorithm called "Iterated Dynamic Programming" has better space and time complexity than the previously known algorithms. The algorithm has a worst case complexity of O(N3) in time and O(N2) in storage. In addition, our approach can be easily extended and applied to other classes of more general pseudoknots. Availability: The algorithm has been implemented in C++ in a program called "IDP", which is available at http://dblab.cbu.ac.kr/idp.
The Pathways of Complement
Authors: Jonathan M. Aitken, Tim Clarke, Jonathan I. Timmis
Venue: Proceedings of the 7th international conference on Artificial Immune Systems (2008)

The natural world has developed very effective methods for dealing with pathogens that are invading an organism. By taking inspiration from the in-built, innate, response this paper develops a new algorithm that mimics activation path of the Alternative Pathway of Complement. The Alternative Pathway is triggered by cell surfaces. If the surfaces display safe characteristics then a strong suppression process prevents activation. In the case of non-safe surfaces a positive feedback loop rapidly identifies the location marking it for removal by phagocytosis.
The Visual Expression Process: Bridging Vision and Data Visualization
Authors: Jose Fernando Rodrigues,  Jr., Andre G. Balan, Agma J. Traina, Caetano Traina,  Jr.
Venue: Proceedings of the 9th international symposium on Smart Graphics (2008)

Visual data analysis follows a sequence of steps derived from perceptual faculties that emanate from the human vision system. Firstly, pre-attentive phenomena determine a map of potential interesting objectives. Then, attentive selection concentrates on one element of a vocabulary of visual perceptions. Lastly, perceptions in working memory combine to long-term domain knowledge to support cognition. Following this process, we present a model that joins vision theory and visual data analysis aiming at settling a comprehension of why graphical presentations expand the human intellect, making us smarter.
Powerful Compact Tactile Display with Microhydraulic Actuators
Authors: Pauwel Goethals, Hans Lintermans, Mauro M. Sette, Dominiek Reynaerts, Hendrik Brussel
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

In minimally invasive surgery, tactile feedback is lacking. A tactile display, consisting of a matrix of micro-actuators, represents tactile sensations on the fingertip. Miniaturising powerful, dynamic and accurate actuators with a sufficient stroke is a considerable challenge. This paper presents a proof of concept of a tactile display, based on microhydraulic actuators. A prototype with five taxels is designed, built and evaluated. The result is a light and compact display. It is mobile, has a stroke of 2 mm, a spatial resolution of 2 mm and can exert a maximal force of 0.5 N. The actuation principle is innovative in the field of tactile displays and has a great potential.
An On-the---Flight Proxy System for Multi-format Web Content Transcoding for Mobile Devices
Authors: Juan G. González Serna, Hugo Estrada Esquivel, Azucena Montes Rendon, Victor Sosa Sosa, J. Carlos Olivares R.
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

One of the trends in current information society is the visualization of Web sites using mobile devices. At present time, there are millions of mobile devices that are used by the owner to navigate in the web. However, not all the information placed in the web is appropriately adapted to be visualized in mobile devices. As a result, not all functionalities can be exploded by the users. To solve this situation, we need mechanisms to allow users of mobile devices to visualize Web sites independently if the Web sites were specifically designed or not for these types of devices. The problem of this scenario is that the contents of the Web site need to be adapted to the limitations of each mobile device. In this paper, an on-the-flight Web content transcoding mechanism is presented as solution to this problem. The mechanism proposes the inclusion of a new HTTP header in the HTTP package to describe a transcoding format command. This header is generated by a client-side Proxy named GAP, which runs on mobile devices with Windows CE operating system (Pocket PC, Smartphone, among others). The transcoding header is interpreted by a server-side Proxy, named GAT MT, that converts Web documents to WML, XHTML-MP, PDF, plain text, PostScript, XML and HTML adapted for mobile devices. To do this, the mechanism uses XSL technologies (XSLT and XSL-FO) to define Stylesheets according to a specific device.