ppxscal/embedding_network huggingface dataset:
A Method for Selection of Optimal Hand Gesture Vocabularies
Authors: Helman Stern, Juan Wachs, Yael Edan
Venue: Gesture-Based Human-Computer Interaction and Simulation: 7th International Gesture Workshop, GW 2007, Lisbon, Portugal, May 23-25, 2007, Revised Selected Papers (2009)

This work presents an analytical approach to design a gesture vocabulary (GV) using multiobjectives for psycho-physiological and gesture recognition factors. Previous works dealt only with selection of hand gestures vocabularies using rule based or ad-hoc methods. The analytical formulation in our research is a demonstration of the future need defined by previous research. A meta-heuristic approach is taken by decomposing the problem into two sub-problems: (i) finding the subsets of gestures that meet a minimal accuracy requirement, and (ii) matching gestures to commands to maximize the human factors objective. The result is a set of solutions from which a Pareto optimal subset is selected. An example solution from the Pareto set is exhibited using prioritized objectives.
Region-of-Interest Image Coding Based on Perceptually Optimized Bitplane Realignment
Authors: Yan Zhang, Hai-ming Gu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Region-of-interest (ROI) image coding is one of the new features included in the JPEG2000 image coding standard. Two methods are defined in the standard: the Maxshift method and the generic scaling based method. In this paper, a new region-of-interest coding method called Perceptually Optimized Shift (POShift) is proposed. Unlike other proposed methods, the POShift method realigns the bitplanes based on perceptually optimized order, which makes the visually most important bitplanes (in both ROI and BG) to be coded firstly. Experimental results indicate that the proposed method significantly outperforms the previous ROI coding schemes in overall ROI coding performance.
Modelled temperature-dependent excitability behaviour of a single ranvier node for a human peripheral sensory nerve fibre
Authors: Jacoba E. Smit, Tania Hanekom, Johan J. Hanekom
Venue: Biological Cybernetics (2009)

The objective of this study was to determine whether the Hodgkin&#x2013;Huxley model for unmyelinated nerve fibres could be modified to predict excitability behaviour at Ranvier nodes. Only the model parameters were modified to those of human, with the equations left unaltered. A model of a single Ranvier node has been developed as part of a larger model to describe excitation behaviour in a generalised human peripheral sensory nerve fibre. Parameter values describing the ionic and leakage conductances, corresponding equilibrium potentials, resting membrane potential and membrane capacitance of the original Hodgkin&#x2013;Huxley model were modified to reflect the corresponding parameter values for human. Parameter temperature dependence was included. The fast activating potassium current kinetics were slowed down to represent those of a slow activating and deactivating potassium current, which do not inactivate. All calculations were performed in MATLABTM. Action potential shape and amplitude were satisfactorily predicted at 20, 25 and 37&#x00b0;C, and were not influenced by activation or deactivation of the slow potassium current. The calculated chronaxie time constant was 65.5&#x00a0;&#x03bc;s at 37&#x00b0;C. However, chronaxie times were overestimated at temperatures lower than body temperature.
High-available grid services through the use of virtualized clustering
Authors: Javier Alonso, Luis Silva, Artur Andrzejak, Paulo Silva, Jordi Torres
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

Grid applications comprise several components and web-services that make them highly prone to the occurrence of transient software failures and aging problems. This type of failures often incur in undesired performance levels and unexpected partial crashes. In this paper we present a technique that offers high-availability for Grid services based on concepts like virtualization, clustering and software rejuvenation. To show the effectiveness of our approach, we have conducted some experiments with OGSA-DAI middleware. One of the implementations of OGSA-DAI makes use of Apache Axis V1.2.1, a SOAP implementation that suffers from severe memory leaks. Without changing any bit of the middleware layer we have been able to anticipate most of the problems caused by those leaks and to increase the overall availability of the OGSA-DAI Application Server. Although these results are tightly related with this middleware it should be noted that our technique is neutral and can be applied to any other Grid service that is supposed to be high-available.
Integrated Admission Control in Hierarchical Video-on-Demand Systems
Authors: P. Mundur, R. Simon, A. Sood
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

In this paper, we develop a unified model of a hierarchical Video-on-Demand(VoD) system by integrating the storage and network subsystems. Rather than restricting the analysis to an isolated subsystem the performance of the VoD system is analyzed as an end-to-end system. On a system-wide basis, request handling and admission control policies are designed to minimize global performance metrics. Through our simulation, we compare different request handling policies and show that a hierarchical VoD architecture with request handling that allows retrials at more than one resource will minimize overall blocking.
Euler--Mahonian statistics on ordered set partitions (II)
Authors: Anisse Kasraoui, Jiang Zeng
Venue: Journal of Combinatorial Theory Series A (2009)

[E. Steingrimsson, Statistics on ordered partitions of sets, arXiv: math.CO/0605670] introduced several hard statistics on ordered set partitions and conjectured that their generating functions are related to the q-Stirling numbers of the second kind. In a previous paper, half of these conjectures have been proved by Ishikawa, Kasraoui and Zeng using the transfer-matrix method. In this paper, we shall give bijective proofs of all the conjectures of Steingrimsson. Our basic idea is to encode ordered set partitions by a kind of path diagrams and explore the rich combinatorial properties of the latter structure. As a bonus of our approach, we derive two new @s-partition interpretations of the p,q-Stirling numbers of the second kind introduced by Wachs and White. We also discuss the connections with MacMahon's theorem on the equidistribution of the inversion number and major index on words and give a partition version of his result.
New Directions in Electronic Disease Surveillance: Detection of Infectious Diseases during the Incubation Period
Authors: Taxiarchis Botsis, Johan Gustav Bellika, Gunnar Hartvigsen
Venue: Proceedings of the 2009 International Conference on eHealth, Telemedicine, and Social Medicine (2009)

The main objective of this paper is to assess the development of electronic disease surveillance systems for detecting infections at the first stages of disease progression (incubation period). This is important not only for the general population but also for vulnerable population groups with special physical needs, defined in this paper as Sensitive Population Groups. Detecting an infection during the incubation period may be critical and could be accomplished by monitoring certain physiology indicators including blood glucose levels, as demonstrated in a recent diabetics' case study. White blood cell count is another indicator of infections that can be easily measured. The bottom-up approach can subsequently be applied for the detection of an outbreak threat. Dedicated electronic disease surveillance systems raise conceptual, organizational, architectural and technological issues that are also highlighted in this paper.
Programmable temporal isolation in real-time and embedded execution environments
Authors: Silviu S. Craciunas, Christoph M. Kirsch, Hannes Payer, Harald Röck, Ana Sokolova
Venue: Proceedings of the Second Workshop on Isolation and Integration in Embedded Systems (2009)

We begin this paper with a wish list of features that we feel a modern real-time and embedded execution environment should offer. We then look at some of the key weaknesses of conventional real-time operating systems (RTOS) and limitations of virtual execution environments (VEE), which typically offer some of the features but not all in one system. We propose to remedy the problem by carefully combining, in a single virtualized execution environment, well-known operating systems and virtualization techniques with an efficient real-time scheduler, which we have recently developed. The scheduler enables temporal isolation of concurrently executing processes and allows to change guaranteed process execution speeds efficiently at any time during execution. We also report on preliminary experiments with a prototypical bare-metal implementation.
A Study towards Design of an English to Sanskrit Machine Translation System
Authors: Pawan Goyal, R. Mahesh Sinha
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

We are experimenting to examine how AnglaBharati system designed to translate English to Indian languages could be adapted for translation to Sanskrit. The main contribution of our work is demonstration of machine translation of English to Sanskrit for simple sentences based on PLIL generated by AnglaBharati and A¿¿¿dhy¿yī rules. Presently our translation system caters to affirmative, negative, interrogative, imperative, active and passive voice sentences. In our study, we have selected a set of nouns and verbs that represent different semantic categories besides a few adverbs and adjectives. We anticipate using a number of Sanskrit resources on A¿¿¿dhy¿yī and morphological synthesis [2].
Novel SLM Scheme with Low-Complexity for PAPR Reduction in OFDM System
Authors: Chua-Yun Hsu, Hsin-Chieh Chao
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

Orthogonal frequency-division multiplexing (OFDM) is an attractive transmission technique for high-bit-rate communication systems. One major drawback of OFDM is the high peak-to-average power ratio (PAPR) of the transmitted signal. This study introduces a low-complexity selected mapping (SLM) OFDM scheme based on discrete Fourier transform (DFT) constellation-shaping. The DFT-based constellation-shaping algorithm applied with conventional SLM scheme usually requires a bank of DFT-shaping matrices to generate low-correlation constellation sequences and a bank of inverse fast Fourier transforms (IFFTs) to generate a set of candidate transmission signals, and this process usually results in high computational complexity. Therefore, a sparse matrix algorithm with low-complexity is proposed to replace the IFFT blocks and the DFT-shaping blocks in the proposed DFT constellation-shaping SLM scheme. By using the proposed sparse matrix, the candidate transmission signal with the lowest PAPR can be achieved with lower complexity than that of the conventional SLM scheme. The complexity analysis of the proposed algorithm shows great an improvement in the reduction of the number of multiplications. Moreover, this new low-complexity technique offers a PAPR that is significantly lower than that of the conventional SLM without any loss in terms of energy and spectral efficiency.
Anonymity Authentication and Measure in Ubiquitous Computing
Authors: Guo Yajun, Yan Huifang, Li Rong
Venue: International Journal of Distributed Sensor Networks (2009)

Authentication and anonymity usually are inconsistent. To obtain services, a user must be authenticated. Much of the sensitive information of the user will be exposed to service providers. In order to protect privacy, users must communicate with service providers in an anonymous way. But if the user does not show his true identity, how can the service provider believe that the user is true. This paper presents a secure anonymity authentication protocol for ubiquitous computing which allows service providers to authenticate anonymous users. Anonymity is achieved by separating the linkability of the user's identity information and the action of the user. By finding out objects linkability relationship, we also address an anonymity measure to analyze anonymity and detect the concealing security exposure. Anonymity Authentication There exist three principals in the anonymity authentication protocol: the user, the service discoverer, and the service provider. The anonymity authentication protocol contains two authentication stages. First, the authentication between the user and the service discoverer which determines the user whether he has the right to access the requested resource. And then the service discoverer makes use of blind signature on the user's public key as a ticket. Second, the service provider authenticates the user, in which the service provider judges the user whether is the genuine user. Anonymity Measure Linkability is the relation between objects (such as subjects, events, actions etc.) in a system before and after an action occurs. Unlinkability is the sufficient condition of anonymity. Definition 1 (function decision) Let R denote the object set, X and Y be subsets of R, and X≠Y. If Y can be known from X with probability p, then say X function decision Y, recorded as: X→Y(p). Definition 2 (function decision set) To the object set R, the function decision set is the set F of function decisions among the objects known by attackers. Definition 3 (function decision implication) If F is the function decision set known by attackers, let R denote the object set, X and Y be subsets of R, and X≠Y. If X→Y(p) can be deduced from F, then say F implication X→Y(p). Definition 4 (function decision closure) All the function decision sets implicated by F are called the closure of F, written as F+. Whether user anonymity is protected can be judged by seeing if there are relations between users' location/actions and users' identity in F+.
Byte code level cross-compilation for developing web applications
Authors: Arno Puder, Sascha Häberling
Venue: Science of Computer Programming (2009)

JavaScript provides the technological foundation of Web 2.0 applications. AJAX (Asynchronous JavaScript And XML) applications have received wide-spread attention as a new way to develop highly interactive web applications. Breaking with the complete-page-reload paradigm of traditional web applications, AJAX applications rival desktop applications in their look-and-feel. But AJAX places a high burden on a web developer requiring extensive JavaScript knowledge as well as other advanced client-side technologies. In this paper, we introduce a technique that allows a developer to implement an application in Java or any.NET language and then automatically cross-compile it to an AJAX-enabled web application.
Heuristics for the bi-objective path dissimilarity problem
Authors: Rafael Martí, José Luis González Velarde, Abraham Duarte
Venue: Computers and Operations Research (2009)

In this paper the path dissimilarity problem is considered. The problem has previously been studied within several contexts, the most popular of which is motivated by the need to select transportation routes for hazardous materials. The aim of this paper is to formally introduce the problem as a bi-objective optimization problem, in which a single solution consists of a set of p different paths, and two conflicting objectives arise, on one hand the average length of the paths must be kept low, and on the other hand the dissimilarity among the paths in the set should be kept high. Previous methods are reviewed and adapted to this bi-objective problem, thus we can compare the methods using the standard measures in multi-objective optimization. A new GRASP procedure is proposed and tested against the revised methods, and we show that it is able to create better approximations of efficient frontiers than existing methods.
Dynamic load balancing in distributed content-based publish/subscribe
Authors: Alex King Yeung Cheung, Hans-Arno Jacobsen
Venue: Proceedings of the ACM/IFIP/USENIX 2006 International Conference on Middleware (2006)

Distributed content-based publish/subscribe systems to date suffer from performance degradation and poor scalability caused by uneven load distributions typical in real-world applications. The reason for this shortcoming is due to the lack of a load balancing solution, which have rarely been studied in the context of publish/subscribe. This paper proposes a load balancing solution specific to distributed content-based publish/subscribe systems that is distributed, dynamic, adaptive, transparent, and accommodates heterogeneity. The solution consists of three key contributions: a load balancing framework, a novel load estimation algorithm, and three offload strategies. Experimental results show that the proposed load balancing solution is efficient with less than 1.5% overhead, effective with at least 91% load estimation accuracy, and capable of distributing all of the system's load originating from an edge point of the network.
Handwritten Numeral Databases of Indian Scripts and Multistage Recognition of Mixed Numerals
Authors: Ujjwal Bhattacharya, B. B. Chaudhuri
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

This article primarily concerns the problem of isolated handwritten numeral recognition of major Indian scripts. The principal contributions presented here are (a) pioneering development of two databases for handwritten numerals of two most popular Indian scripts, (b) a multistage cascaded recognition scheme using wavelet based multiresolution representations and multilayer perceptron classifiers and (c) application of (b) for the recognition of mixed handwritten numerals of three Indian scripts Devanagari, Bangla and English. The present databases include respectively 22,556 and 23,392 handwritten isolated numeral samples of Devanagari and Bangla collected from real-life situations and these can be made available free of cost to researchers of other academic Institutions. In the proposed scheme, a numeral is subjected to three multilayer perceptron classifiers corresponding to three coarse-to-fine resolution levels in a cascaded manner. If rejection occurred even at the highest resolution, another multilayer perceptron is used as the final attempt to recognize the input numeral by combining the outputs of three classifiers of the previous stages. This scheme has been extended to the situation when the script of a document is not known a priori or the numerals written on a document belong to different scripts. Handwritten numerals in mixed scripts are frequently found in Indian postal mails and table-form documents.
A key management protocol with robust continuity for sensor networks
Authors: Mi Wen, Yan-Fei Zheng, Wen-jun Ye, Ke-Fei Chen, Wei-Dong Qiu
Venue: Computer Standards Interfaces (2009)

Robust continuity should be paid much more attention in sensor network key management protocols, especially in privacy-vital environment. However, to our best of knowledge, few papers on key management have addressed the robust continuity in sensor networks. Therefore, in this paper, we present a new key management protocol with robust continuity for sensor networks. The purpose is to minimize the key management redesign effort as well as to make the node flexible and adaptable to many different applications. Compared to existing key management protocols, our proposed protocol has the following merits: First, our protocol addresses the continuity between the pairwise key and group key, it can establish the pairwise key and group key with the same pre-distributed secrets. Second, our protocol can deal with the continuity of the pairwise key and the group key themselves; it can update both of them to support the changes in the size of the network.
Real-time exploration and photorealistic reconstruction of large natural environments
Authors: Nikos Komodakis, Georgios Tziritas
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

This paper presents a hybrid (geometry- and image-based) framework suitable for providing photorealistic walkthroughs of large, complex outdoor scenes, based only on a small set of real images from the scene. To this end, a novel data representation of a 3D scene is proposed, which is called morphable 3D panoramas. Motion is assumed to be taking place along a predefined path of the 3D environment and the input to the system is a sparse set of stereoscopic views at certain positions (key positions) along that path (one view per position). An approximate local 3D model is constructed from each view, capable of capturing the photometric and geometric properties of the scene only locally. Then, during the rendering process, a continuous morphing (both photometric as well as geometric) takes place between successive local 3D models, using what we call a &#x2018;morphable 3D model&#x2019;. For the estimation of the photometric morphing, a robust algorithm capable of extracting a dense field of 2D correspondences between wide-baseline images is used, whereas, for the geometric morphing, a novel method of computing 3D correspondences between local models is proposed. In this way, a physically valid morphing is always produced, which is thus kept transparent from the user. Moreover, a highly optimized rendering path is used during morphing. Thanks to the use of appropriate pixel and vertex shaders, this rendering path can be run fully in 3D graphics hardware and thus allows for high frame rates. Our system can be extended to handle multiple stereoscopic views (and therefore multiple local models) per key position of the path (related by a camera rotation). In this case, one local 3D panorama (per key position) is constructed, comprising all local 3D models therein, and so a &#x2018;morphable 3D panorama&#x2019; is now used during the rendering process. For handling the geometric consistency of each 3D panorama, a technique which is based on solving a partial differential equation is adopted. The effectiveness of our framework is demonstrated by using it for the 3D visual reconstruction of the Samaria Gorge in Crete.