ppxscal/embedding_network huggingface dataset:
An Advanced Platform for Managing Complications of Chronic Diseases
Authors: Davide Capozzi, Giordano Lanzola
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

This paper describes a generic platform for telemedicine services aimed at supporting chronic outpatients. The framework comprises a server agent and several cell phones as mobile agents through which patients and caregivers within their families may input data and receive back suggestions and advice. Mobile agents and server are endowed with domain specific knowledge in order to support users in a flexible way structured on multiple levels.
Interpretation of User Evaluation for Emotional Speech Synthesis System
Authors: Ho-Joon Lee, Jong C. Park
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Whether it is for human-robot interaction or for human-computer interaction, there is a growing need for an emotional speech synthesis system that can provide the required information in a more natural and effective manner. In order to identify and understand the characteristics of basic emotions and their effects, we propose a series of user evaluation experiments on an emotional prosody modification system that can express either perceivable or slightly exaggerated emotions classified into anger, joy, and sadness as an independent module for a general purpose speech synthesis system. In this paper, we propose two experiments to evaluate the emotional prosody modification module according to different types of the initial input speech. And we also provide a supplementary experiment to understand the apparently prosody-independent emotion, or joy, by replacing the resynthesized joy speech information with original human voice recorded in the emotional state of joy.
Research on the Transfer Time Reliability of Urban Passenger Hub
Authors: Li Zhao, Zhenzhou Yuan, Yanhong Li, Zhihong Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

The fluctuant demand and the increasing of congestion level within urban passenger transfer hub makes the transfer travel time of pedestrians of great uncertainty, the static criterion such as transfer travel distance can not evaluate the operating state of transfer hub accurately. In this paper, from the perspective of reliability, the concept of transfer time reliability is defined and as well as the elements referring to this concept, i.e. the critical value and the restrictive condition, etc. Using the travel time function for pedestrian facilities, the reliability model of transfer travel time is established and the Monte Carlo simulation is used to estimate the results of reliability. At last, the effect on the transfer reliability caused by the effective width and the length of transfer facilities is studied. It can be proved that transfer time reliability can be used to evaluate the ability of transfer hub objectively, and will contribute to the design of new urban transfer hubs.
An approach to expert assessment in software engineering
Authors: E. M. Lavrischeva, O. A. Slabospickaya
Venue: Cybernetics and Systems Analysis (2009)

An approach is proposed to the solution of formalized problems of assessment of the activity that produces and maintains software systems (SSs). Such assessment is realized by using expertises that form a new assessment process adequate to the activity needs and specifics with an environment common to the expertises. The following mathematical apparatus is elaborated for expertises: a framework (target functions and executing mechanisms), a model and methods (formalisms for improving the quality and reusing the results of expertises) of an assessment process, and tools for integrating the apparatus into software development management processes. The approach is theoretically justified. Prospects of developing the proposed approach are described.
AAL in the Wild --- Lessons Learned
Authors: Edith Maier, Guido Kempter
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

In the EU-funded ALADIN project the prototype of an ambient assistive lighting system was subjected to a three-month test in private households of older people. Despite intensive usability testing in the development phase, field trials pose special challenges including ethical issues such as obtaining informed consent and the need for guidelines for interviewing old people. Besides, real-life settings give rise to particular distortion effects which have to be taken into account in the analysis of the results. Although the findings indicate any overall slight increase in people´s mental and physical fitness, they also suggest how the prototype can be improved in several respects. Above all it has been shown that packaging the technology with social support measures is essential to achieve higher user acceptance. Besides, the article discusses lessons learned related to the organization of user testing in real-life settings.
The GridEcon Platform: A Business Scenario Testbed for Commercial Cloud Services
Authors: Marcel Risch, Jörn Altmann, Li Guo, Alan Fleming, Costas Courcoubetis
Venue: Proceedings of the 6th International Workshop on Grid Economics and Business Models (2009)

Within this paper, we present the GridEcon Platform, a testbed for designing and evaluating economics-aware services in a commercial Cloud computing setting. The Platform is based on the idea that the exact working of such services is difficult to predict in the context of a market and, therefore, an environment for evaluating its behavior in an emulated market is needed. To identify the components of the GridEcon Platform, a number of economics-aware services and their interactions have been envisioned. The two most important components of the platform are the Marketplace and the Workflow Engine. The Workflow Engine allows the simple composition of a market environment by describing the service interactions between economics-aware services. The Marketplace allows trading goods using different market mechanisms. The capabilities of these components of the GridEcon Platform in conjunction with the economics-aware services are described in this paper in detail. The validation of an implemented market mechanism and a capacity planning service using the GridEcon Platform also demonstrated the usefulness of the GridEcon Platform.
Modeling of Product Development Management in Virtual Enterprise Based on Unified Modeling Language
Authors: Rongjun Tu, Weidong Liu
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

Manufacturing enterprises are seeking more advanced and more effective manufacture method and management mode in order to meet the requirements of market. Virtual Enterprise as the important framework of agile manufacturing system has become the main evolvement goal of manufacturing enterprises. Virtual Enterprise comprises several member enterprises, so Virtual Enterprise can eliminate the restriction of technology and resources in the independent enterprise. Manufacture efficiency and quality of product can be enhanced. Obviously, the product development management is a very important task of Virtual Enterprise. Authors put forward applying the Unified Modeling Language to establishing the visual model of product development management in Virtual Enterprise. Moreover, authors set forth the detailed modeling methods and processes of Use Case Diagram, Activity Diagram, Sequence Diagram and Collaboration Diagram. Then the visual model can be integrated with the Diagrams. According to the visual model, the product development management in Virtual Enterprise can be arranged rationally, and then the manufacture efficiency can be enhanced markedly.
Context-information support for B2B collaboration
Authors: P. S. Tan, A. E. S. Goh, S. S. G. Lee
Venue: International Journal of Web Engineering and Technology (2009)

Context information is pervasive and is being tapped by many spheres of human endeavour to enhance decision making. Examples include location-based advertisements and user personalisation. Context-aware computing to facilitate Business-to-Business (B2B) collaboration is largely unexplored. Short-term and dynamic B2B collaboration can benefit from context awareness, as the context of collaboration is often changing and such collaborations must be formed in a short time and with ease (i.e., with as little human intervention as possible). This paper focuses on a specific aspect of such collaborations, namely, partner selection, to support pervasive B2B connectivity in supply chains. It is a key ingredient for dynamic B2B collaboration. Such collaborations are expected to take place on the internet, leveraging prevalent web and context-aware technologies. The aim of this paper is to review existing literature to gather an understanding of context and how the various elements of context are modelled, and investigate how such context models can be adapted to support partner selection in B2B collaboration. The review confirms that context information has indeed not been used in supporting B2B collaboration, though some context aspects from existing context-aware applications can be adapted. As such, a more holistic approach towards the formulation of the B2B Context Model is taken, with a review of supplier selection criteria as an additional foundation for the model.
An Engine for Computing Well-Founded Models
Authors: Terrance Swift
Venue: Proceedings of the 25th International Conference on Logic Programming (2009)

The seemingly simple choice of whether to use call variance or call subsumption in a tabled evaluation deeply affects an evaluation's properties. Most tabling implementations have supported only call variance or, in the case of XSB Prolog, supported call subsumption only for stratified programs. However, call subsumption has proven critical for (sub-)model generation as required for some kinds of program analysis (e.g. type analysis) and for semantic web applications such as RDF inference. At the same time, the lack of well-founded negation has prevented the use of call subsumption in producing residual programs, and has limited its use in semantic web applications that require negation (e.g. evaluation of OWL ontologies). This paper describes an engine for evaluating normal programs under the well-founded semantics (WFS) in which the evaluation method can be based on a mixture of call subsumption and call variance, chosen at the predicate level. The implementation has been thoroughly tested for both local and batched evaluation and is available in version 3.2 of XSB.
BSCP: Buckup Scheduling Mecanism for Coverage Perserving in WSNs
Authors: Manel Chenait, Bahia Zebbane, Nadjib Badache, Houda Zeghilet
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Coverage is one fundamental problem in wireless sensor networks, it reflects how well an area is monitored or surveyed by sensors. Some applications require a high degree of coverage as it would want a region to be monitored by multiple nodes simultaneously. Nevertheless, the failure of one or several sensors, can paralysis the area coverage unless it was before completely covered.In this paper we will investigate the restoration of the area coverage under unexpected node failure with reduce energy consumption. In fact, we adopt new recovery mechanism where every active node selects a subset of its neighbors (backup cover) and schedules them to periodically wake up according to some optimization parameters.
Attacks against Two Provably Secure Certificateless Signature Schemes
Authors: Hu Guozheng, Hong Fan
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Certificateless cryptography, first introduced by Al-Riyami and Paterson in 2003, can solve the key escrow problem which is inherent in identity-based (ID-based) cryptography and eliminate the use of certificates as in the conventional Public Key Infrastructure (PKI). Recently, Xu et al. proposed a certificateless signature scheme and Yang et al. presented a mediated certificateless signature scheme .They all claimed that their schemes are secure and efficient and gave security proofs of the schemes. In this paper, we analyze the two certificateless signature schemes and show that the two schemes are insecure against key replacement attacks and ma-licious KGC(Key Generation Centre) attacks.
On the tractability of linear tensor product problems in the worst case
Authors: Anargyros Papageorgiou, Iasonas Petras
Venue: Journal of Complexity (2009)

It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem to be weakly tractable in the worst case. The complexity of linear tensor product problems in the worst case depends on the eigenvalues {@l"i}"i"@?"N of a certain operator. It is known that if @l"1=1 and @l"2@?(0,1) then @l"n=o((lnn)^-^2), as n->~, is a necessary condition for a problem to be weakly tractable. We show that this is a sufficient condition as well.
Developing a Legal Framework for Remote Electronic Voting
Authors: Axel Schmidt, Dennis Heinson, Lucie Langer, Zoi Opitz-Talidou, Philipp Richter, Melanie Volkamer, Johannes Buchmann
Venue: Proceedings of the 2nd International Conference on E-Voting and Identity (2009)

This paper describes how to legally regulate remote electronic elections. Electronic voting systems have to respect the constitutional election principles. For technological solutions, this translates into security requirements that have to be fulfilled by the operational environment in which the voting takes place. Therefore [26] introduced the concept of providing the technical and organizational implementation of a remote electronic election by a qualified trustworthy third party. This paper adds legal regulation to support this concept. The legal framework addresses the secure operation of remote electronic voting services as well as their accreditation and supervision by an official authority.
Constructing Brambles
Authors: Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca
Venue: Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009 (2009)

Given an arbitrary graph G and a number k, it is well-known by a result of Seymour and Thomas [22] that G has treewidth strictly larger than k if and only if it has a bramble of order k + 2. Brambles are used in combinatorics as certificates proving that the treewidth of a graph is large. From an algorithmic point of view there are several algorithms computing tree-decompositions of G of width at most k, if such decompositions exist and the running time is polynomial for constant k. Nevertheless, when the treewidth of the input graph is larger than k, to our knowledge there is no algorithm constructing a bramble of order k + 2. We give here such an algorithm, running in ${\mathcal O}(n^{k+4})$ time. For classes of graphs with polynomial number of minimal separators, we define a notion of compact brambles and show how to compute compact brambles of order k + 2 in polynomial time, not depending on k.
Completing codes in a sofic shift
Authors: Marie-Pierre Béal, Dominique Perrin
Venue: Theoretical Computer Science (2009)

We define a code in a sofic shift as a set of blocks of symbols of the shift such that any block of the shift has at most one decomposition into code words. It is maximal if it is not strictly included in another one. Such a code is complete in the sofic shift if any block of the shift occurs within some concatenation of code words. We prove that a maximal code in an irreducible sofic shift is complete in this shift. We give an explicit construction of a regular completion of a regular code in a sofic shift. This extends the well known result of Ehrenfeucht and Rozenberg to the case of codes in sofic systems. We also give a combinatorial proof of a result concerning the polynomial of a code in a sofic shift.
Estimate the Number of Endmembers for Hyperspectral Imagery
Authors: Wei Chen, Xu-chu Yu, He Wang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In practice, the determination of the number of endmembers for hyperspectral images of the areas without priori knowledge is highly difficult. This article brings forward an automatic method, which can estimate the number of endmembers for hyperspectral imagery without priori knowledge of the area, according to the theory of Orthogonal subspace projection (OSP). The paper carries out the experiments by synthetic hyperspectral data and real hyperspectral image collected by PHI, and the result of the experiment is satisfying.
Leveraging PKI in SAML 2.0 Federation for Enhanced Discovery Service
Authors: Toshiyuki Kataoka, Takeshi Nishimura, Masaki Shimaoka, Kazutsuna Yamaji, Motonori Nakamura, Noboru Sonehara, Yasuo Okabe
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

The University Public Key Infrastructure (UPKI) project in Japan is developing a national academic inter-institution authentication and authorization infrastructure based on the Public Key Infrastructure (PKI), and it is carrying out a feasibility study on SAML 2.0 federation by building a Shibboleth2.x test-bed called UPKI-Fed with about thirty university participants. Federation usually provides a discovery service (DS, previously called WAYF) to a user since he/she needs to select his/her identity provider (IdP). This IdP selection becomes a serious problem as the number of IdP grows. We solved this problem for a user using client certificate authentication by developing a DS plug-in called DS-PKI Plug-In to leverage securely stored information in a PKI certificate.
Computational Heuristics for Simplifying a Biological Model
Authors: Ion Petre, Andrzej Mizera, Ralph-Johan Back
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Computational biomodelers adopt either of the following approaches: build rich, as complete as possible models in an effort to obtain very realistic models, or on the contrary, build as simple as possible models focusing only on the core aspects of the process, in an effort to obtain a model that is easier to analyze, fit, and validate. When the latter strategy is adopted, the aspects that are left outside the models are very often up to the subjective options of the modeler. We discuss in this paper a heuristic method to simplify an already fit model in such a way that the numerical fit to the experimental data is not lost. We focus in particular on eliminating some of the variables of the model and the reactions they take part in, while also modifying some of the remaining reactions. We illustrate the method on a computational model for the eukaryotic heat shock response. We also discuss the limitations of this method.
Automatic Generation of Non-verbal Behavior for Agents in Virtual Worlds: A System for Supporting Multimodal Conversations of Bots and Avatars
Authors: Werner Breitfuss, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

This paper presents a system capable of automatically adding gestures to an embodied virtual character processing information from a simple text input. Gestures are generated based on the analysis of linguistic and contextual information of the input text. The system is embedded in the virtual world called second life and consists of an in world object and an off world server component that handles the analysis. Either a user controlled avatar or a non user controlled character can be used to display the gestures, that are timed with speech output from an Text-to-Speech system, and so show non verbal behavior without pushing the user to manually select it.
Discrete-Continuous Optimization for Optical Flow Estimation
Authors: Stefan Roth, Victor Lempitsky, Carsten Rother
Venue: Statistical and Geometrical Approaches to Visual Motion Analysis: International Dagstuhl Seminar, Dagstuhl Castle, Germany, July 13-18, 2008. Revised Papers (2009)

The accurate estimation of optical flow is a challenging task, which is often posed as an energy minimization problem. Most top-performing methods approach this using continuous optimization algorithms. In many cases, the employed models are assumed to be convex to ensure tractability of the optimization problem. This is in contrast to the related problem of narrow-baseline stereo matching, where the top-performing methods employ powerful discrete optimization algorithms such as graph cuts and message-passing to optimize highly non-convex energies.In this chapter, we demonstrate how similar non-convex energies can be formulated and optimized in the context of optical flow estimation using a combination of discrete and continuous techniques. Starting with a set of candidate solutions that are produced by either fast continuous flow estimation algorithms or sparse feature matching, the proposed method iteratively fuses these candidate solutions by the computation of minimum cuts on graphs. The obtained continuous-valued result is then further improved using local gradient descent. Experimentally, we demonstrate that the proposed energy is an accurate model and that the proposed discrete-continuous optimization scheme not only finds lower energy solutions than traditional discrete or continuous optimization techniques, but also leads to very accurate flow estimates.
Realization of ternary sigma-delta modulated arithmetic processing modules
Authors: Amin Z. Sadik, Peter J. O'Shea
Venue: EURASIP Journal on Advances in Signal Processing (2009)

Sigma-delta modulated systems have a number of very appealing properties and are, therefore, heavily used in analog to digital converters, amplifiers, and modulators. This paper presents new results which indicate that they may also have significant potential for general purpose arithmetic processing. The paper introduces new arithmetic processing structures for ternary (i.e., +1, 0, or -1) sigma-delta modulated signals. Simulations show that these new structures can be implemented very efficiently and have relatively good accuracy.
Subquadratic Space Complexity Multiplier for a Class of Binary Fields Using Toeplitz Matrix Approach
Authors: M. A. Hasan, C. Negre
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

In the recent past, subquadratic space complexity multipliers have been proposed for binary fields defined by irreducible trinomials and some specific pentanomials. For such multipliers, alternative irreducible polynomials can also be used, in particular, nearly all one polynomials (NAOPs) seem to be better than pentanomials (see (Katti Brennan IEEE TC 2003). For improved efficiency, multiplication modulo an NAOP is performed via modulo a quadrinomial whose degree is one more than that of the original NAOP. In this paper, we present a Toeplitz matrix-vector product based approach for multiplication modulo a quadrinomial. We obtain a fully parallel (non-sequential) multiplier with a subquadratic space complexity, which has the same order of space complexity as that of Fan and Hasan (IEEE TC 2007).