OpenRaiser/Intern-Atlas huggingface dataset:
Dynamic Facial Expression of Emotion Made Easy
Venue: arXiv cs.HC 2012
Year: 2012

Facial emotion expression for virtual characters is used in a wide variety of areas. Often, the primary reason to use emotion expression is not to study emotion expression generation per se, but to use emotion expression in an application or research project. What is then needed is an easy to use and flexible, but also validated mechanism to do so. In this report we present such a mechanism. It enables developers to build virtual characters with dynamic affective facial expressions. The mechanism is based on Facial Action Coding. It is easy to implement, and code is available for download. To show the validity of the expressions generated with the mechanism we tested the recognition accuracy for 6 basic emotions (joy, anger, sadness, surprise, disgust, fear) and 4 blend emotions (enthusiastic, furious, frustrated, and evil). Additionally we investigated the effect of VC distance (z-coordinate), the effect of the VC's face morphology (male vs. female), the effect of a lateral versus a frontal presentation of the expression, and the effect of intensity of the expression. Participants (n=19, Western and Asian subjects) rated the intensity of each expression for each condition (within subject setup) in a non forced choice manner. All of the basic emotions were uniquely perceived as such. Further, the blends and confusion details of basic emotions are compatible with findings in psychology.
An Effective Fingerprint Classification and Search Method
Venue: arXiv cs.CV 2012
Year: 2012

This paper presents an effective fingerprint classification method designed based on a hierarchical agglomerative clustering technique. The performance of the technique was evaluated in terms of several real-life datasets and a significant improvement in reducing the misclassification error has been noticed. This paper also presents a query based faster fingerprint search method over the clustered fingerprint databases. The retrieval accuracy of the search method has been found effective in light of several real-life databases.
Numerical comparison of different algorithms for construction of wavelet matrices
Venue: arXiv cs.NA 2012
Year: 2012

Factorization of compact wavelet matrices into primitive ones has been known for more than 20 years. This method makes it possible to generate wavelet matrix coefficients and also to specify them by their first row. Recently, a new parametrization of compact wavelet matrices of the same order and degree has been introduced by the last author. This method also enables us to fulfill the above mentioned tasks of matrix constructions. In the present paper, we briefly describe the corresponding algorithms based on two different methods, and numerically compare their performance
Applying Dynamic Model for Multiple Manoeuvring Target Tracking Using Particle Filtering
Venue: arXiv cs.CV 2012
Year: 2012

In this paper, we applied a dynamic model for manoeuvring targets in SIR particle filter algorithm for improving tracking accuracy of multiple manoeuvring targets. In our proposed approach, a color distribution model is used to detect changes of target's model . Our proposed approach controls deformation of target's model. If deformation of target's model is larger than a predetermined threshold, then the model will be updated. Global Nearest Neighbor (GNN) algorithm is used as data association algorithm. We named our proposed method as Deformation Detection Particle Filter (DDPF) . DDPF approach is compared with basic SIR-PF algorithm on real airshow videos. Comparisons results show that, the basic SIR-PF algorithm is not able to track the manoeuvring targets when the rotation or scaling is occurred in target' s model. However, DDPF approach updates target's model when the rotation or scaling is occurred. Thus, the proposed approach is able to track the manoeuvring targets more efficiently and accurately.
Secured Ontology Mapping
Venue: arXiv cs.OH 2012
Year: 2012

Todays market evolution and high volatility of business requirements put an increasing emphasis on the ability for systems to accommodate the changes required by new organizational needs while maintaining security objectives satisfiability. This is all the more true in case of collaboration and interoperability between different organizations and thus between their information systems. Ontology mapping has been used for interoperability and several mapping systems have evolved to support the same. Usual solutions do not take care of security. That is almost all systems do a mapping of ontologies which are unsecured.We have developed a system for mapping secured ontologies using graph similarity concept. Here we give no importance to the strings that describe ontology concepts, properties etc. Because these strings may be encrypted in the secured ontology. Instead we use the pure graphical structure to determine mapping between various concepts of given two secured ontologies. The paper also gives the measure of accuracy of experiment in a tabular form in terms of precision, recall and F-measure.
A New Similarity Measure for Taxonomy Based on Edge Counting
Venue: arXiv cs.AI 2012
Year: 2012

This paper introduces a new similarity measure based on edge counting in a taxonomy like WorldNet or Ontology. Measurement of similarity between text segments or concepts is very useful for many applications like information retrieval, ontology matching, text mining, and question answering and so on. Several measures have been developed for measuring similarity between two concepts: out of these we see that the measure given by Wu and Palmer [1] is simple, and gives good performance. Our measure is based on their measure but strengthens it. Wu and Palmer [1] measure has a disadvantage that it does not consider how far the concepts are semantically. In our measure we include the shortest path between the concepts and the depth of whole taxonomy together with the distances used in Wu and Palmer [1]. Also the measure has following disadvantage i.e. in some situations, the similarity of two elements of an IS-A ontology contained in the neighborhood exceeds the similarity value of two elements contained in the same hierarchy. Our measure introduces a penalization factor for this case based upon shortest length between the concepts and depth of whole taxonomy.
WiSANCloud: a set of UML-based specifications for the integration of Wireless Sensor and Actor Networks (WSANs) with the Cloud Computing
Venue: arXiv cs.SE 2012
Year: 2012

Giving the current trend to combine the advantages of Wireless Sensor and Actor Networks (WSANs)with the Cloud Computing technology, this work proposes a set of specifications, based on the Unified Modeling Language - UML, in order to provide the general framework for the design of the integration of said components. One of the keys of the integration is the architecture of the WSAN, due to its structural relationship with the Cloud in the definition of the combination. Regarding the standard applied in the integration, UML and its subset, Systems Modeling Language - SysML, are proposed by the Object Management Group - OMG to deal with cloud applications; so, this indicates the starting point of the process of the design of specifications for WSAN-Cloud integration. Based on the current state of UML tools for analysis and design, there are several aspects to take into account in order to define the integration process.
An Insight View of Kernel Visual Debugger in System Boot up
Venue: arXiv cs.OS 2012
Year: 2012

For many years, developers could not figure out the mystery of OS kernels. The main source of this mystery is the interaction between operating systems and hardware while system's boot up and kernel initialization. In addition, many operating system kernels differ in their behavior toward many situations. For instance, kernels act differently in racing conditions, kernel initialization and process scheduling. For such operations, kernel debuggers were designed to help in tracing kernel behavior and solving many kernel bugs. The importance of kernel debuggers is not limited to kernel code tracing but also, they can be used in verification and performance comparisons. However, developers had to be aware of debugger commands thus introducing some difficulties to non-expert programmers. Later, several visual kernel debuggers were presented to make it easier for programmers to trace their kernel code and analyze kernel behavior. Nowadays, several kernel debuggers exist for solving this mystery but only very few support line-by-line debugging at run-time. In this paper, a generic approach for operating system source code debugging in graphical mode with line-by-line tracing support is proposed. In the context of this approach, system boot up and evaluation of two operating system schedulers from several points of views will be discussed.
Gaussian Assumption: the Least Favorable but the Most Useful
Venue: arXiv cs.IT 2012
Year: 2012

This paper focuses on three contributions. First, a connection between the result, proposed by Stoica and Babu, and the recent information theoretic results, the worst additive noise lemma and the isoperimetric inequality for entropies, is illustrated. Second, information theoretic and estimation theoretic justifications for the fact that the Gaussian assumption leads to the largest Cramér-Rao lower bound (CRLB) is presented. Third, a slight extension of this result to the more general framework of correlated observations is shown.
Summarizing Reviews with Variable-length Syntactic Patterns and Topic Models
Venue: arXiv cs.IR 2012
Year: 2012

We present a novel summarization framework for reviews of products and services by selecting informative and concise text segments from the reviews. Our method consists of two major steps. First, we identify five frequently occurring variable-length syntactic patterns and use them to extract candidate segments. Then we use the output of a joint generative sentiment topic model to filter out the non-informative segments. We verify the proposed method with quantitative and qualitative experiments. In a quantitative study, our approach outperforms previous methods in producing informative segments and summaries that capture aspects of products and services as expressed in the user-generated pros and cons lists. Our user study with ninety users resonates with this result: individual segments extracted and filtered by our method are rated as more useful by users compared to previous approaches by users.
Mutually Exclusive Rules in LogicWeb
Venue: arXiv cs.LO 2012
Year: 2012

LogicWeb has traditionally lacked devices for expressing mutually exclusive clauses. We address this limitation by adopting choice-conjunctive clauses of the form $D_0 \adc D_1$ where $D_0, D_1$ are Horn clauses and $\adc$ is a linear logic connective. Solving a goal $G$ using $D_0 \adc D_1$ -- $\prov(D_0 \adc D_1,G)$ -- has the following operational semantics: choose a successful one between $\prov(D_0,G)$ and $\prov(D_1,G)$. In other words, if $D_o$ is chosen in the course of solving $G$, then $D_1$ will be discarded and vice versa. Hence, the class of choice-conjunctive clauses precisely captures the notion of mutually exclusive clauses.
On the behavior of tile assembly system at high temperatures
Venue: arXiv cs.CC 2012
Year: 2012

Behaviors of Winfree's tile assembly systems (TASs) at high temperatures are investigated in combination with integer programming of a specific form called threshold programming. First, we propose a way to build bridges from the Boolean satisfiability problem (SAT) to threshold programming, and further to TAS's behavior, in order to prove the NP-hardness of optimizing temperatures of TASs that behave in a way given as input. These bridges will take us further to two important results on the behavior of TASs at high temperatures. The first says that arbitrarily high temperatures are required to assemble some shape by a TAS of "reasonable" size. The second is that for any temperature at least 4 given as a parameter, it is NP-hard to find the minimum size TAS that self-assembles a given shape and works at the given temperature or below.
Scaling Genetic Programming for Source Code Modification
Venue: arXiv cs.NE 2012
Year: 2012

In Search Based Software Engineering, Genetic Programming has been used for bug fixing, performance improvement and parallelisation of programs through the modification of source code. Where an evolutionary computation algorithm, such as Genetic Programming, is to be applied to similar code manipulation tasks, the complexity and size of source code for real-world software poses a scalability problem. To address this, we intend to inspect how the Software Engineering concepts of modularity, granularity and localisation of change can be reformulated as additional mechanisms within a Genetic Programming algorithm.
Service Composition Design Pattern for Autonomic Computing Systems using Association Rule based Learning and Service-Oriented Architecture
Venue: arXiv cs.SE 2012
Year: 2012

In this paper we present a Service Injection and composition Design Pattern for Unstructured Peer-to-Peer networks, which is designed with Aspect-oriented design patterns, and amalgamation of the Strategy, Worker Object, and Check-List Design Patterns used to design the Self-Adaptive Systems. It will apply self reconfiguration planes dynamically without the interruption or intervention of the administrator for handling service failures at the servers. When a client requests for a complex service, Service Composition should be done to fulfil the request. If a service is not available in the memory, it will be injected as Aspectual Feature Module code. We used Service Oriented Architecture (SOA) with Web Services in Java to Implement the composite Design Pattern. As far as we know, there are no studies on composition of design patterns for Peer-to-peer computing domain. The pattern is described using a java-like notation for the classes and interfaces. A simple UML class and Sequence diagrams are depicted.
Design Of A Reconfigurable DSP Processor With Bit Efficient Residue Number System
Venue: arXiv cs.AR 2012
Year: 2012

Residue Number System (RNS), which originates from the Chinese Remainder Theorem, offers a promising future in VLSI because of its carry-free operations in addition, subtraction and multiplication. This property of RNS is very helpful to reduce the complexity of calculation in many applications. A residue number system represents a large integer using a set of smaller integers, called residues. But the area overhead, cost and speed not only depend on this word length, but also the selection of moduli, which is a very crucial step for residue system. This parameter determines bit efficiency, area, frequency etc. In this paper a new moduli set selection technique is proposed to improve bit efficiency which can be used to construct a residue system for digital signal processing environment. Subsequently, it is theoretically proved and illustrated using examples, that the proposed solution gives better results than the schemes reported in the literature. The novelty of the architecture is shown by comparison the different schemes reported in the literature. Using the novel moduli set, a guideline for a Reconfigurable Processor is presented here that can process some predefined functions. As RNS minimizes the carry propagation, the scheme can be implemented in Real Time Signal Processing & other fields where high speed computations are required.
Value, Variety and Viability: New Business Models for Co-Creation in Outcome-based Contracts
Venue: arXiv cs.OH 2012
Year: 2012

We propose that designing a manufacturer's equipment-based service value proposition in outcome-based contracts is the design of a new business model capable of managing threats to the firm's viability that can arise from the contextual variety of use that customers may subject the firm's value propositions. Furthermore, manufacturers need to understand these emerging business models as the capability of managing both asset and service provision to achieve use outcomes with customers, including emotional outcomes such as customer experience. Service-Dominant Logic proposes that all "goods are a distribution mechanism for service provision", upon which we propose a value-centric approach to understanding the interactions between the asset and service provision, and suggest a viable systems approach towards reorganising the firm to achieve such a business model. Three case studies of B2B equipment-based service systems were analysed to understand customers' co-creation activities in achieving outcomes, in which we found that the co-creation of complex multi-dimensional value could be delivered through the different value propositions of the firm catering to different aspects (dimensions) of the value to be co-created. The study provides a way for managers to understand the effectiveness (rather than efficiency) of firms in adopting emerging business models that design for value co-creation in what are ultimately complex socio- technical systems.
A survey on data and transaction management in mobile databases
Venue: arXiv cs.DB 2012
Year: 2012

The popularity of the Mobile Database is increasing day by day as people need information even on the move in the fast changing world. This database technology permits employees using mobile devices to connect to their corporate networks, hoard the needed data, work in the disconnected mode and reconnect to the network to synchronize with the corporate database. In this scenario, the data is being moved closer to the applications in order to improve the performance and autonomy. This leads to many interesting problems in mobile database research and Mobile Database has become a fertile land for many researchers. In this paper a survey is presented on data and Transaction management in Mobile Databases from the year 2000 onwards. The survey focuses on the complete study on the various types of Architectures used in Mobile databases and Mobile Transaction Models. It also addresses the data management issues namely Replication and Caching strategies and the transaction management functionalities such as Concurrency Control and Commit protocols, Synchronization, Query Processing, Recovery and Security. It also provides Research Directions in Mobile databases.
On the Composition of Secret Sharing Schemes Related to Codes
Venue: arXiv cs.IT 2012
Year: 2012

In this paper we construct a subclass of the composite access structure introduced by Martínez et al. based on schemes realizing the structure given by the set of codewords of minimal support of linear codes. This class enlarges the iterated threshold class studied in the same paper. Furthermore all the schemes on this paper are ideal (in fact they allow a vector space construction) and we arrived to give a partial answer to a conjecture stated in the above paper. Finally, as a corollary we proof that all the monotone access structures based on all the minimal supports of a code can be realized by a vector space construction.
Prototype for Extended XDB Using Wiki
Venue: arXiv cs.DB 2012
Year: 2012

This paper describes a prototype of extended XDB. XDB is an open-source and extensible database architecture developed by National Aeronautics and Space Administration (NASA) to provide integration of heterogeneous and distributed information resources for scientific and engineering applications. XDB enables an unlimited number of desktops and distributed information sources to be linked seamlessly and efficiently into an information grid using Data Access and Retrieval Composition (DARC) protocol which provides a contextual search and retrieval capability useful for lightweight web applications. This paper shows the usage of XDB on common data management in the enterprise without burdening users and application developers with unnecessary complexity and formal schemas. Supported by NASA Ames Research Center through NASA Exploration System Mission Directorate (ESMD) Higher Education grant, a project team at Fairfield University extended this concept and developed an extended XDB protocol and a prototype providing text-searches for Wiki. The technical specification of the protocol was posted to Source Forge (sourceforge.net) and a prototype providing text-searches for Wiki was developed. The prototype was created for 16 tags of the MediaWiki dialect. As part of future works, the prototype will be further extended to the complete Wiki markups and other dialects of Wiki.
Modeling problems of identity in Little Red Riding Hood
Venue: arXiv cs.AI 2012
Year: 2012

This paper argues that the problem of identity is a critical challenge in agents which are able to reason about stories. The Xapagy architecture has been built from scratch to perform narrative reasoning and relies on a somewhat unusual approach to represent instances and identity. We illustrate the approach by a representation of the story of Little Red Riding Hood in the architecture, with a focus on the problem of identity raised by the narrative.
Cognitive Radio Transmission Strategies for Primary Markovian Channels
Venue: arXiv cs.NI 2012
Year: 2012

A fundamental problem in cognitive radio systems is that the cognitive radio is ignorant of the primary channel state and, hence, of the amount of actual harm it inflicts on the primary license holder. Sensing the primary transmitter does not help in this regard. To tackle this issue, we assume in this paper that the cognitive user can eavesdrop on the ACK/NACK Automatic Repeat reQuest (ARQ) fed back from the primary receiver to the primary transmitter. Assuming a primary channel state that follows a Markov chain, this feedback gives the cognitive radio an indication of the primary link quality. Based on the ACK/NACK received, we devise optimal transmission strategies for the cognitive radio so as to maximize a weighted sum of primary and secondary throughput. The actual weight used during network operation is determined by the degree of protection afforded to the primary link. We begin by formulating the problem for a channel with a general number of states. We then study a two-state model where we characterize a scheme that spans the boundary of the primary-secondary rate region. Moreover, we study a three-state model where we derive the optimal strategy using dynamic programming. We also extend our two-state model to a two-channel case, where the secondary user can decide to transmit on a particular channel or not to transmit at all. We provide numerical results for our optimal strategies and compare them with simple greedy algorithms for a range of primary channel parameters. Finally, we investigate the case where some of the parameters are unknown and are learned using hidden Markov models (HMM).