ppxscal/embedding_network huggingface dataset:
Pro Android, 1st edition
Authors: Sayed Y. Hashimi, Satya Komatineni
Venue:  (2009)

Pro Android is a detailed look at application development on Googles Mobile OS. It uses the development of a sample application to work through all the options you might want to build a flexible mobile application. The focus is on making viable commercial applications work. The book includes detailed coverage of the Android API. Assumes knowledge of basic Java programming principles so that you can follow the code Written in an exampledriven and practically minded style Serves as a tool for hobbyists and professionals who want to create productionquality applications What youll learn Adapt existing applications to a mobile framework. Understand how an Android application functions and communicates with the handset that hosts it. Discover all aspects of developing the mobile features that Android enables including the complexities of timers, services, and multimedia playback. Create and display a rich mix of customrendered screens and tailored Android widgets. Find out all about the Android API and using it to create apps that work across the gamut of wireless devices. Understand how locationbased services, which are becoming more and more important in the mobile world, work. Uutilize Googles powerful Map tool. Understand network connectivity in the mobile world. Who is this book for? This book is for professional software engineers/programmers looking to move their ideas and applications into the mobile space with Android. The author assumes the reader has a passable understanding of Java. The reader should be able to write classes and handle basic inheritance structures. This book also targets hobbyist developers looking to navigate the complex minefield of mobile software. About the Apress Pro Series The Apress Pro series books are practical, professional tutorials to keep you on and moving up the professional ladder. You have gotten the job, now you need to hone your skills in these tough competitive times. The Apress Pro series expands your skills and expertise in exactly the areas you need. Master the content of a Pro book, and you will always be able to get the job done in a professional development project. Written by experts in their field, Pro series books from Apress give you the hardwon solutions to problems you will face in your professional programming career.
Property Exchange Method for Automatic Generation of Computer-Based Learning Games
Authors: Takanobu Umetsu, Tsukasa Hirashima, Akira Takeuchi
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

Learning games are very useful to realize highly motivated learning. Developing effective and high-motivating learning games, embedding learning materials into a game is a promising approach. As a concrete method to embed learning materials into a game, we propose Property Exchange Method in this paper. The method can deal with card games where players manipulate cards following their rules. The rules usually only deal with limited attributes of the cards. Therefore, if the learning materials possess the same attributes, players can manipulate the materials in the same way following the same rules. Since players can play the game with the same rule dealing with the same attributes, it is expected that the game keep the characteristics of the original game. In this paper, we also introduce a system that automatically generates computer-based learning games based on the method. An experiment use of the generator is also reported.
Towards a Context Theory for Context-aware systems
Authors: Richard Dapoigny, Patrick Barlatier
Venue: Proceeding of the 2007 conference on Advances in Ambient Intelligence (2007)

The basic goal of context-aware systems is to make software aware of the environment and to adapt to their changing context. For that purpose, the core problem is to have a powerful context model. While significative formalizations have been proposed, context models are either expressed through logical formalisms or with ontology-based approaches. The major problem with all that approaches is that they suffer from the chronic insufficiency of first-order logic to cope with dynamic change and especially, to solve the frame problem. Therefore, building context-aware software is a complex task due to a lack of appropriate formal models in dynamic environments. In this paper, we propose a model which combines the strengths of both approaches while trying not to carry their specific weaknesses into the resulting formal framework. For this purpose, the formal model relies both on a knowledge representation with ontologies and on a logical reasoning with Dependent Record Types (DRT) based on Intuitionistic Type Theory and the Curry-Howard isomorphism. This logic modelling aims to be applied to any kind of process-based applications.
Attack on digital multi-signature scheme based on elliptic curve cryptosystem
Authors: Duo Liu, Ping Luo, Yi-Qi Dai
Venue: Journal of Computer Science and Technology (2007)

The concept of multisignature, in which multiple signers can cooperate to sign the same message and any verifier can verify the validity of the multi-signature, was first introduced by Itakura and Nakamura. Several multisignature schemes have been proposed since. Chen et al. proposed a new digital multi-signature scheme based on the elliptic curve cryptosystem recently. In this paper, we show that their scheme is insecure, for it is vulnerable to the so-called active attacks, such as the substitution of a "false" public key to a "true" one in a key directory or during transmission. And then the attacker can sign a legal signature which other users have signed and forge a signature himself which can be accepted by the verifier.
Second order systems for filtering and sampling methods
Authors: Mihaela A. Ghelmez, Cristian I. Toma, Adrian M. Dumitrescu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

This paper presents some invariance properties of differential equations, used for generating truncated test-function (functions which differ from zero only on a certain interval and with only some derivatives f(1), f(2), ..f(n) continuous on the real axis). The functions are used for the multiplication of some received signals, in order to take into account the random variations of the integration period of these signals, the integration being proportional to the mean value of the signal. Such fluctuations are generated by the switching phenomena at the end of the integration. The paper presents also the properties of second order oscillating systems, considered as generating "practical" (i.e. truncated) test functions (PTF), in filtering and sampling procedures.
Evolutionary game-theoretic model for dynamic congestion pricing in multi-class traffic networks
Authors: Loukas Dimitriou, Theodore Tsekeris
Venue: Netnomics (2009)

This paper describes an evolutionary game-theoretic learning model for dynamic congestion pricing in urban road networks, taking into account route choice stochasticity and reliability considerations, and the heterogeneity of users, in terms of their value of travel time and real-time information acquisition. The learning model represents the dynamic adjustments of users to travel cost changes which may take place in the day-to-day as well as the within-day timescales. The implementation into a simplified and a real urban road network signifies the important implications of modeling the dynamic and stochastic learning components of users' behavior for accommodating the efficient deployment of congestion pricing schemes.
PUB-2-SUB: A Content-Based Publish/Subscribe Framework for Cooperative P2P Networks
Authors: Duc A. Tran, Cuong Pham
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

This paper is focused on the content-based publish/subscribe service and our problem is to devise an efficient mechanism that enables this service in any given P2P network of cooperative nodes. Most techniques require some overlay structuralization added on top of the network. We propose a solution called PUB-2-SUB which works with any unstructured network topology. In addition, multiple independent publish/subscribe applications can run simultaneously on a single instance of PUB-2-SUB. We show that this mechanism is efficient in terms of both costs and time. Our theoretical findings are complemented by a simulation-based evaluation.
Character segmentation and recognition algorithm of text region in steel images
Authors: Keunhwi Koo, Jong Pil Yun, SungHoo Choi, JongHyun Choi, Doo Chul Choi, Sang Woo Kim
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

There are many algorithms for character segmentation [1]. Many people have been making researches in segmentation of touching or overlapping character up to now, but most of algorithms cannot apply to the text region of slab management numbers marked on the slab in the steel image. Because the text regions are irregular such as touching character by strong illumination and by trouble of nozzle in marking machine, and loss of character. It is difficult to gain high success rate in all cases This paper proposes a new algorithm for character segmentation using combined profile analysis and recognition based method. Besides the proposed algorithm converts gray image to binary image using method of adjusting brightness and contrast in pre-processing step. The experimental results show high recognition rates of slab management numbers marked on the slab about various text region images.
The Ubiquitous Web
Authors: Dave Raggett
Venue: Proceeding of the 2006 conference on Leading the Web in Concurrent Engineering: Next Generation Concurrent Engineering (2006)

Networked devices are increasingly pervasive, ranging from RFID tags to supercomputers. How can Web technologies simplify the development of distributed Web applications that dynamically adapt to the context, including user preferences, device capabilities and environmental conditions? This talk will introduce the Ubiquitous Web, and its dependence on device coordination, layered application models, and the role of Semantic Web technologies to support resource descriptions, resource discovery, and modeling of trust and identity relationships. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Short Note: Alleviation of cancellation problem of preconditioned Navier-Stokes equations
Authors: Sang-Hyeon Lee
Venue: Journal of Computational Physics (2009)

An approach to alleviate the cancellation problem of preconditioned Navier-Stokes equations is proposed. Adiabatic laminar viscous flows around a circular cylinder are calculated at different Mach numbers. It is shown that a redefinition of total enthalpy to reduce the magnitude of total enthalpy can alleviate the cancellation problem for adiabatic laminar flows at low Mach numbers.
Nonparametric estimation for control engineering
Authors: Piotr Kulczycki
Venue: Proceedings of the 4th WSEAS/IASME international conference on Dynamical systems and control (2008)

The subject of this paper is the application of nonparametric estimation methods - in particular statistical kernel estimators - for control engineering. Such methods allow the useful characterization of probability distributions without arbitrary assumptions regarding their membership to a fixed class. A detailed description of the Bayes parameter estimation with asymmetrical polynomial loss function will be given, as will one for fault detection in dynamical systems as objects of automatic control, in the scope of detection, diagnosis and prognosis of malfunctions. To this aim the basics of data analysis and exploration tasks - identification of outliers, clustering, and classification - solved using uniform mathematical apparatus based on the kernel estimators methodology will also be considered. In every case the final result will be an algorithm ensuring that its practical implementation does not demand of the user detailed knowledge of the theoretical aspects, or laborious research and calculations.
Two-Phase Dynamic Reactive Power Optimization Based on Improved Genetic Algorithm
Authors: Bu-Han Zhang, Kai Wang, Chao Yang, Yan Li, Cheng-Xiong Mao, Xin-Bo Ruan, Yong-Feng Yao, Hong-Xian Hu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

The dimension of control variables in dynamic reactive power optimization would increase rapidly with the enlargement of power system. A two-phase optimization method was proposed in this paper to confine the regulation times of control equipments. In the first phase, a static optimal model solved by the improved genetic algorithm was established for each time-interval to find several optimal states for the second phase optimization. In the second phase, dynamic programming and genetic algorithm were used to determine the shortest transition path of states to meet the restrictions of regulation times. Furthermore, this method can implement parallel computing easily to be suitable for online applications. The results of test system show the proposed method has a good performance in convergence speed and global optimization.
A Built-in-Self-Test Σ-Δ ADC Prototype
Authors: Hao-Chiao Hong, Sheng-Chuan Liang, Hong-Chin Song
Venue: Journal of Electronic Testing: Theory and Applications (2009)

This paper presents a built-in-self-test (BIST) Σ-Δ ADC prototype. The BIST circuity uses the proposed modified controlled sine wave fitting (CSWF) procedure to calculate the signal power and the total-harmonic-distortion-and-noise power in time domain separately. Compared with conventional Fast Fourier Transform (FFT) analysis, neither complex CPU/DSP nor bulky memory is required. The added BIST circuitry is purely digital and the hardware overhead is as low as 11.9 K gates. A prototype comprising the second-order design-for-digital-testability Σ-Δ modulator chip and an FPGA board which implements the digital functions is used to demonstrate the effectiveness of the BIST design. Measurement results show that the SNDR difference between conventional FFT analysis and the proposed BIST design of the standard &minus;&thinsp;6 dBFS, 1 KHz tone test is only 0.3 dB. Furthermore, the tested dynamic range values by both methods are the same. The proposed BIST implementation achieves the advantages of compact hardware, high test accuracy, and the flexibility of adjusting the stimuli which are important features for BIST applications.
From Specification to High-Volume Production
Authors: Manuel d'Abreu
Venue: IEEE Design Test (2009)

Editor's note:In order to meet the ever shrinking market window, the ability to ramp up chip volume production has become a significant challenge. This is due to simultaneous changes in technology, functionality, schedule, cost, etc. This article presents a set of requirements and a unique design flow developed by SanDisk to help meet on-time volume production.&#x2014;Yervant Zorian, Virage Logic
Numeric simulation of faults in electrical networks
Authors: Toader Dumitru, Haragus Stefan, Blaj Constantin
Venue: Proceedings of the 10th WSEAS international conference on Fuzzy systems (2009)

In the paper is presented a virtual simulator for three-phased medium voltage electric circuits. The simulator allows analyzing transient regimes caused by the faults produced in electric distribution networks (simple grounding, double grounding, broken and grounded conductor). There are analyzed the dependence of the transient regimes on the initial phase of the voltage at the faulty place, the dependence on the grounding resistance at the faulty place and on the method used for grounding the neutral point of the electric network.
Towards Ontology-Based Formal Verification Methods for Context Aware Systems
Authors: Hedda R. Schmidtke, Woontack Woo
Venue: Proceedings of the 7th International Conference on Pervasive Computing (2009)

Pervasive computing systems work within, and rely on, a model of the environment they operate in. In this respect, pervasive computing systems differ from other distributed and mobile computing systems, and require new verification methods. A range of methods and tools exist for verifying distributed and mobile concurrent systems, and for checking consistency of ontology-based context models. As a tool for verifying current pervasive computing systems both are not optimal, since the former cover mainly tree-based location models, whereas the latter are not able to address the dynamic aspects of computing systems. We propose to formally describe pervasive computing systems as distributed concurrent systems operating on the background of a mereotopological context model.
Near Infrared Face Based Biometric Key Binding
Authors: Meng Ao, Stan Z. Li
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

Biometric encryption is the basis for biometric template protection and information security. While existing methods are based on iris or fingerprint modality, face has so far been considered not reliable enough to meet the requirement for error correcting ability. In this paper, we present a novel biometric key binding method based on near infrared (NIR) face biometric. An enhanced BioHash algorithm is developed by imposing an NXOR mask onto the input to the subsequent error correcting code (ECC). This way, when combined with ECC and NIR face features, it enables reliable binding of face biometric features and the biometric key. Its ability for template protection and information cryptography is guarantied by the theory of encryption. The security level of NIR face recognition system is thereby improved. Experimental results show that the security benefit is gained with a sacrifice of 1-2% drop in the recognition performance.
A macro-cell statistical location estimation method for TD-SCDMA networks
Authors: Hong Tang, Ting Li, Tianshuang Qiu, Yongwan Park
Venue: Signal Processing (2009)

TD-SCDMA is an innovative wireless radio standard for a physical layer 3G air interface, approved as one 3GPP standards by ITU in May 2000. Based on the unique advantages of the physical layer, this paper investigates network-based methods to obtain the angle of arrival (AOA) and time of arrival (TOA) via subspace tracking and channel impulsive estimation. By incorporating the spatial-temporal channel of radio propagation, this paper proposes a unified objective function to extract mobile location information from the statistical distribution of AOA and TOA data in a TD-SCDMA cellular network. The proposed method may estimate mobile position even using one base station. The location performances are analyzed in detail in macro-cell scenarios. This method can be easily extended to other networks except TD-SCDMA, provided that the statistical information of the local radio propagation channel is available as pre-knowledge. Simulation comparing several hybrid location methods in two macro-cell scenarios show that the proposed method has a high accuracy; but it has a relatively high complexity.
Distance Sensor Data Integration and Prediction
Authors: Zoe Falomir, M. Teresa Escrig, Juan Carlos Peris, Vicente Castelló
Venue: Proceeding of the 2007 conference on Artificial Intelligence Research and Development (2007)

In this paper we describe an approach to sensor data integration in order to obtain a qualitative and robust interpretation of the robot environment, which could be used as input in the qualitative robot navigation algorithms developed by our group. This approach consists of: obtaining patterns of distance zones from the sensor readings; comparing statically these patterns in order to detect non-working sensors; integrating the patterns obtained by each kind of sensor in order to obtain a final pattern which detects obstacles of any sort; predicting how the distance pattern will be influenced by robot motion and comparing this prediction with reality in order to detect incoherent sensorimotor situations. This approach has been applied to a real Pioneer 2 robot and promising results are obtained.
On the tradeoff between privacy and utility in data publishing
Authors: Tiancheng Li, Ninghui Li
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

In data publishing, anonymization techniques such as generalization and bucketization have been designed to provide privacy protection. In the meanwhile, they reduce the utility of the data. It is important to consider the tradeoff between privacy and utility. In a paper that appeared in KDD 2008, Brickell and Shmatikov proposed an evaluation methodology by comparing privacy gain with utility gain resulted from anonymizing the data, and concluded that "even modest privacy gains require almost complete destruction of the data-mining utility". This conclusion seems to undermine existing work on data anonymization. In this paper, we analyze the fundamental characteristics of privacy and utility, and show that it is inappropriate to directly compare privacy with utility. We then observe that the privacy-utility tradeoff in data publishing is similar to the risk-return tradeoff in financial investment, and propose an integrated framework for considering privacy-utility tradeoff, borrowing concepts from the Modern Portfolio Theory for financial investment. Finally, we evaluate our methodology on the Adult dataset from the UCI machine learning repository. Our results clarify several common misconceptions about data utility and provide data publishers useful guidelines on choosing the right tradeoff between privacy and utility.
Synthesis and Composition of Web Services
Authors: Annapaola Marconi, Marco Pistore
Venue: Formal Methods for Web Services: 9th International School on Formal Methods for the Design of Computer, Communication, and Software Systems, SFM 2009, Bertinoro, Italy, June 1-6, 2009, Advanced Lectures (2009)

One of the key ideas underlying Web services is that of allowing the combination of existing services published on the Web into a new service that achieves some higher-level functionality and satisfies some business goals. As the manual development of the new composite service is recognized as a difficult and error-prone task, the automated synthesis of the composition is considered one of the key challenges in the field of Web services.In this paper, we will present a survey of existing approaches for the synthesis of Web service compositions. We will then focus on a specific approach, the ASTRO approach, which has been shown to support complex composition requirements and to be applicable in real domains. In the paper, we will present the formal framework behind the ASTRO approach; we will present the implementation of the framework and its integration within a commercial toolkit for developing Web services; we will finally evaluate the approach on a real-world composition domain.
Experiences with scheduling and mapping games for adaptive distributed systems: summary
Authors: Bin Lin, Peter A. Dinda
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

We apply the concept of "games with a purpose" to NP- complete mapping and scheduling problems in distributed systems and report our experiences. The particular context is a scheduling and mapping problem that emerges when running parallel applications in a distributed virtualized computing environment, specifically BSP applications in our Virtuoso system. We describe the design and implementation of an interface that presents the problem as a game, and a user study we undertook to evaluate the interface. The results show that there is promise -- at least at small scales, most of our naive users are able to find solutions that are reasonable.