ppxscal/embedding_network huggingface dataset:
Detection and segmentation of cervical cell cytoplast and nucleus
Authors: Chuen-Horng Lin, Yung-Kuan Chan, Chun-Chieh Chen
Venue: International Journal of Imaging Systems and Technology (2009)

This article aims to develop a method for the detection and segmentation of a cytoplast and nucleus from a cervix smear image. First, the technique of equalization method with Gaussian filter is adopted to eliminate noise in the image. Second, a new edge enhancement technique is proposed to work out the coarseness of each pixel, which is later used as a determining characteristic of reinforced object images. A two-group object enhancement technique is then used to reinforce this object according to rough pixels. Third, the proposed detector enhances the gradients of the edges of the cytoplast and nucleus while suppressing the noise gradients, and then specifies the pixels with higher gradients as possible edge pixels. Finally, it picks out the two longest closed curves constructed by part of the edge pixels. Detection and segmentation performance of the proposed method is later compared with seed region growing feature extraction and level set method using 10 cervix smear images as example. Besides comparing the contour segment of the cytoplast and nucleus obtained by using different methods, we also compare the quality of the segmentation results. Experimental results show that the proposed detector demonstrates an impressive performance. &copy; 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 260&ndash;270, 2009
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
Authors: Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation. We study in particular max independent set, min vertex cover and min set cover and then extend our results to max clique, max bipartite subgraph and max set packing.
Invisible Two-Dimensional Code Display for Additional Information
Authors: Tomofumi Yamanari, Kunio Sakamoto
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

The authors have researched a support system of the reminiscence and life review activity. This support system consists of an interactive tabletop display and interface system. Many interaction systems are proposed until now. An invisible code is one of the useful technologies for a computer interaction. The invisible codes provide us with an operating environment using a pen-like device. However, this technology is applied to the only paper media. The authors think we want to realize an interaction using the invisible code on an electrical media. In this paper, we propose a method to display invisible codes using LCD panels and to detect a polarized symbol image with a conventional CCD camera.
Attitudinal and Intentional Acceptance of Domestic Robots by Younger and Older Adults
Authors: Neta Ezer, Arthur D. Fisk, Wendy A. Rogers
Venue: Proceedings of the 5th International on ConferenceUniversal Access in Human-Computer Interaction. Part II: Intelligent and Ubiquitous Interaction Environments (2009)

A study was conducted to examine the expectations that younger and older individuals have about domestic robots and how these expectations relate to robot acceptance. In a questionnaire participants were asked to imagine a robot in their home and to indicate how much items representing technology, social partner, and teammate acceptance matched their robot. There were additional questions about how useful and easy to use they thought their robot would be. The dependent variables were attitudinal and intentional acceptance. The analysis of the responses of 117 older adults (aged 65-86) and 60 younger adults (aged 18-25) indicated that individuals thought of robots foremost as performance-directed machines, less so as social devices, and least as unproductive entities. The robustness of the Technology Acceptance Model to robot acceptance was supported. Technology experience accounted for the variance in robot acceptance due to age.
Multi-image Matching Technology and Its Application of Investigation of Traffic Accident
Authors: Rong Liu, Zuxun Zhang, Jianqing Zhang, Yufeng Zhu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

Image matching acts main role on digital image processing and computer vision. Least Squares Matching (LSM) is one of methods of image matching. The paper introduces some approaches of image matching, especially the application of LSM in digital close range photogrammetry. The method of calibration of digital camera is described. Matching procedure and principle of multi-image collinear condition constrained least squares matching are emphasized. Field images data acquisition and indoor data processing of photogrammetric investigation of traffic accidents are presented in detail. Feasibility is proved by traffic accidents. Compare with traditional method, multi-photo collinear condition constrained least squares matching technique has advantages in precision, automation, 3D visualization as well as efficiency and work situation.
8Kbit/s LD-aCELP Speech Coding with Backward Pitch Detection
Authors: Wu Shuhong, Zhang Gang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This paper presents an 8Kbit/s speech coding algorithm whose delay is 2.5ms on the base of G.728 algorithm to reduce coding rate. Adaptive codebook structure is introduced in the proposed algorithm, which is composed of the recent excitation. The algorithm uses double codebook structure which contains adaptive codebook and normalized fixed codebook. In codebook searching, the algorithm detects backward pitch, and then searches the adaptive codebook subtly round the pitch period T. After searching 64 adaptive code words, 8 gains, 256 fixed code words and 8 gains, the best excitation is obtained. Testing with the average segment SNR and Perceptual Evaluation of Speech Quality (PESQ), the improved algorithm is close to G.728 in speech coding quality. And it achieves desirable balance in coding rate, delay time and coding quality.
Active diagnosis by self-organization: an approach by the immune network metaphor
Authors: Yoshiteru Ishida
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

We propose a concept of active diagnosis that differs from the conventional passive (i.e. event-driven) diagnosis in temporal (diagnosis is carried out by always monitoring normal condition as opposed to identifying faulty only when abnormal condition is detected) sense as well as spatial (diagnosis is carried out by agents distributed in the sensor network) sense. As one way of realizing active diagnosis, we present immunity-based agents approach based on the self creating, monitoring, and maintaining feature of immune systems. We apply the approach to process diagnosis where the agents are defined on the sensor network. Each agent corresponding to sensor or process constraint evaluates a kind of reliability by communicating other agents. System level recognition of sensor/process fault can be attained by continuously and mutually monitoring and maintaining consistency among sensor values and process constraints.
Exploiting the structure of hierarchical plans in temporal constraint propagation
Authors: Neil Yorke-Smith
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 3 (2005)

Quantitative temporal constraints are an essential requirement for many planning domains. The HTN planning paradigm has proven to be better suited than other approaches to many applications. To date, however, efficiently integrating temporal reasoning with HTN planning has been little explored. This paper describes a means to exploit the structure of a HTN plan in performing temporal propagation on an associated Simple Temporal Network. By exploiting the natural restriction on permitted temporal constraints, the time complexity of propagation can be sharply reduced, while completeness of the inference is maintained. Empirical results indicate an order of magnitude improvement on real-world plans.
Study on Private Equity Investment Risk Avoiding Base on Option
Authors: Xubo Zhang, Chengbo Zhang
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This paper uses the approaches and models of option theory to analyze two-stage private equity investment decision-making under uncertainty. Mathematics expressions of this two-stage private equity investment decision-making are presented. An option value model about two-stage private equity investment decision-making base on options pricing theory under the uncertainty is presented. Get the solution of option pricing model which we present.
Groupthink and Peer Pressure: Social Influence in Online Social Network Groups
Authors: Pan Hui, Sonja Buchegger
Venue: Proceedings of the 2009 International Conference on Advances in Social Network Analysis and Mining (2009)

In this paper, we present a horizontal view of social influence, more specifically a quantitative study of the influence of neighbours on the probability of a particular node to join a group, on four popular Online Social Networks (OSNs), namely Orkut, YouTube, LiveJournal, and Flickr. Neighbours in OSNs have a mutually acknowledged relation, most often defined as friendship, and they are directly connected on a graph of a social network. Users in OSNs can also join groups of users. These groups represent common areas of interest.We present a simple social influence model to describe and explain the group joining process of users on OSNs. To this end, we extract the social influence from data sets ofOSNs of a million sample nodes. One of our findings is that a set of neighbours in the OSN is about $100$ times more powerful in influencing a user to join a group than the same number of strangers.
An Extended Comparison of Six Approaches to Discretization - A Rough Set Approach
Authors: Piotr Blajdo, Zdzislaw S. Hippe, Teresa Mroczek, Jerzy W. Grzymala-Busse, Maksymilian Knap, Lukasz Piatek
Venue: Fundamenta Informaticae (2009)

We present results of extensive experiments performed on nine data sets with numerical attributes using six promising discretization methods. For every method and every data set 30 experiments of ten-fold cross validation were conducted and then means and sample standard deviations were computed. Our results show that for a specific data set it is essential to choose an appropriate discretization method since performance of discretization methods differ significantly. However, in general, among all of these discretization methods there is no statistically significant worst or best method. Thus, in practice, for a given data set the best discretization method should be selected individually.
Performance tuning and analysis of future vector processors based on the roofline model
Authors: Yoshiei Sato, Ryuichi Nagaoka, Akihiro Musa, Ryusuke Egawa, Hiroyuki Takizawa, Koki Okabe, Hiroaki Kobayashi
Venue: Proceedings of the 10th MEDEA workshop on MEmory performance: DEaling with Applications, systems and architecture (2009)

Because of a recent steep drop in the ratio of memory bandwidth to computational performance (B/F) of vector processors, their advantage against scalar ones regarding relatively high sustained performance is decaying. To cover the insufficient B/F rate, an on-chip vector cache mechanism is promising for the vector processors. Although the effectiveness of the vector cache has been evaluated, cache-conscious tuning of vector codes and the analysis of the obtained performance have not been discussed yet. Under this situation, the purpose of this paper is to establish a strategy for performance tuning of a vector processor with a cache to exploit its potential. To analyze its sustained performance, this paper uses the roofline model. Several optimization techniques are applied to real scientific and engineering applications, and their effects are assessed with the model. We confirm that the model can guide users to effective tuning so as to maximize its gain. We also discuss the energy efficiency of the on-chip vector cache.
The Construction and Operation of Digital Library Service Based on Grid Technology
Authors: ChunNian Liu, Hua Xiao
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

Studies on digital library service and grid technology have both recently witnessed significant progress while still remains some open problems on how to integrated grid technology into modern library enterprise. Therefore there is an indisputable value in analyze the construction and operation of digital library service based on grid technology. This paper introduces the interrelated grid technology, the concise theory and the construction and operation of digital library service based on grid technology. These infrastructures allow building specialized digital libraries capable to support the knowledge production and consumption life-cycle by using shared computing, storage, content, and application resources. The study demonstrates that the grid technology provides solutions for dealing with huge amounts of data and technical support for library services. At the same time, it creates a harmonious ecological environment for digital library service.
A Finite Element Mesh Generation Algorithm and Application to Human Head Modeling
Authors: Jun Liu, Jiexian Zeng
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The finite element method (FEM) geometry modeling of realistic head volume conductor plays an important role in FEM-based EEG/MEG forward and inverse problems. In this paper, a tetrahedron mesh generation method was developed for finite element modeling of human head. By using this method, a finite element model of human head is obtained from segmented medical images, and tested in application to the FEM-based EEG forward problem.
ODMRP-LR: ODMRP with Link Failure Detection and Local Recovery Mechanism
Authors: Marjan Naderan-Tahan, Amir Darehshoorzadeh, Mehdi Dehghan
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

On Demand Multicast Routing Protocol (ODMRP) was designed formerly for multicast routing in ad hoc networks. Despite good delivery ratio in several scenarios, ODMRP relies on a periodic refresh mechanism for sending the JOIN QUERY message to maintain mesh robustness. Choosing the appropriate value for refresh interval of this message is of great concern. In addition when mobility speed is high, link failures occur more causing delivery ratio to decrease. In this paper we address the problems of detecting link breakages and local recovery procedure in ODMRP. We introduce a new join message for nodes intending to join the multicast group and nodes detecting link breakage. Through this message, receivers have no delay and no loss in receiving data packets. Furthermore we propose the concept of minimum number of neighbors in ODMRP mesh for detecting links failure based on data packets with no control overhead. Simulation results show that with these improvements packet delivery ratio increases while end-to-end delay remains the same as ODMRP.
A Multiple Hypothesis Tracking Method with Fragmentation Handling
Authors: Atousa Torabi, Guillaume-Alexandre Bilodeau
Venue: Proceedings of the 2009 Canadian Conference on Computer and Robot Vision (2009)

In this paper, we present a new multiple hypothesestracking (MHT) approach. Our tracking method is suitablefor online applications, because it labels objects at everyframe and estimates the best computed trajectories up tothe current frame. In this work we address the problems ofobject merging and splitting (occlusions) and object fragmentations.Object fragmentation resulting from imperfectbackground subtraction can easily be confused with splittingobjects in a scene, especially in close range surveillanceapplications. This subject is not addressed in mostMHT methods. In this work, we propose a framework forMHT which distinguishes fragmentation and splitting usingtheir spatial and temporal characteristics and by generatinghypotheses only for splitting cases using observation inlater frames. This approach results in a more accurate dataassociation and a reduced size of the hypothesis graph. Ourtracking method is evaluated with various indoor videos.
Generic Entity Resolution in Relational Databases
Authors: Csaba István Sidló
Venue: Proceedings of the 13th East European Conference on Advances in Databases and Information Systems (2009)

Entity Resolution (ER) covers the problem of identifying distinct representations of real-world entities in heterogeneous databases. We consider the generic formulation of ER problems (GER) with exact outcome. In practice, input data usually resides in relational databases and can grow to huge volumes. Yet, typical solutions described in the literature employ standalone memory resident algorithms. In this paper we utilize facilities of standard, unmodified relational database management systems (RDBMS) to enhance the efficiency of GER algorithms. We study and revise the problem formulation, and propose practical and efficient algorithms optimized for RDBMS external memory processing. We outline a real-world scenario and demonstrate the advantage of algorithms by performing experiments on insurance customer data. 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
Specification and Verification for Grid Component-Based Applications: From Models to Tools
Authors: Antonio Cansado, Eric Madelaine
Venue: Formal Methods for Components and Objects: 7th International Symposium, FMCO 2008, Sophia Antipolis, France, October 21-23, 2008, Revised Lectures (2009)

Computer Grids offer large-scale infrastructures for computer intensive applications, as well as for new service-oriented paradigms. Programming such applications brings a number of difficulties due to asynchrony and dynamicity, and require specific verification methods. We define a behavioural model called pNets for describing the semantics of distributed component systems. pNets (for parameterized networks of synchronised automatas) are hierarchical assemblies of labelled transition systems, with data parameters expressing both value-passing and parameterized topology. We use pNets for building models for Fractal (hierarchical) and GCM (distributed) components. We present the VerCors platform, that implements these model generation procedures, but also abstraction mechanisms and connections with the model-checking engines of the CADP toolset.
Web Service Systems for Cooperative Work Support in Knowledge Creation Processes
Authors: Hiroyuki Kojima, Kentaro Funaki, Tsuyoshi Inoue
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

The emergence of Web service results from the business needs as mentioned below. Web service as the evolution of software engineering is also required to explore the possibility of adapting to cooperative work support with knowledge management. Web service technology is becoming the focus of interest as an open standard for web software, because of its service-oriented architecture. Web service facilitates Internet commerce, or e-commerce, because it enables the execution of inter-organization in a typical business application or logic area such as dynamic supply chain composition. Web service technology is successful in the above business with a fixed procedure. It is therefore desirable to adopt an atypical task requiring a wide variety of task procedures. This research focuses on a method of applying Web service to atypical tasks with a non-fixed procedure, such as a knowledge creation task, to improve the task performance in a cooperative work. The results presented in this paper are expected to validate the performance of Web service in carrying out a dynamic search for a document from various information resources.
Known---Plaintext---Only Attack on RSA---CRT with Montgomery Multiplication
Authors: Martin Hlaváč
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

The paper describes a new attack on RSA---CRT employing Montgomery exponentiation. Given the amount of so-called final subtractions during the exponentiation of a known message (not chosen, just known), it creates an instance of the well known Hidden Number Problem (HNP, [2]). Solving the problem reveals the factorization of RSA modulus, i.e. breaks the scheme.The main advantage of the approach compared to other attacks [14,17] is the lack of the chosen plaintext condition. The existing attacks, for instance, cannot harm so-called Active Authentication (AA) mechanism of the recently deployed electronic passports. Here, the challenge, i.e. the plaintext, is jointly chosen by both parties, the passport and the terminal, thus it can not be conveniently chosen by the attacker. The attack described here deals well with such a situation and it is able to solve the HNP instance with 150 measurements filtered from app. 7000. Once the secret key used by the passport during AA is available to the attacker, he can create a fully functional copy of the RFID chip in the passport he observes.A possible way to obtain the side information needed for the attack within the electromagnetic traces is sketched in the paper. Having no access to high precision measurement equipment, its existence has not been experimentally verified, yet. The attack, however, should be taken into account by the laboratories testing the resilience of (not only) electronic passports to the side channel attacks.
Coexistence Issues of 2.4GHz Sensor Networks with Other RF Devices at Home
Authors: Hongwei Huo, Youzhi Xu, Celal Can Bilen, Hongke Zhang
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

The IEEE 802.15.4 as one of the facto low layer communication standards for PANs and WSNs may be interfered by other wireless devices in the ISM frequency bands, especially at home, such as devices of IEEE 802.11b, Bluetooth, Cordless telephone, and microwave oven. This paper examines the mutual interference effects of 2.4 GHz devices which are widely deployed at home, via both theoretical analysis and real-life experiment. In the paper an analytical model is proposed to estimate the Packet Error Rate (PER), the collision probability and the active-rate of the interference networks. The model is verified through a series of experiments. The Experimental results also show that Bluetooth has little impact of interference on 802.15.4 networks, whereas microwave oven and 802.11b wireless networks can cause problems to 802.15.4; however the effects can be significantly reduced by a proper channel selection.
11,001 new features for statistical machine translation
Authors: David Chiang, Kevin Knight, Wei Wang
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We use the Margin Infused Relaxed Algorithm of Crammer et al. to add a large number of new features to two machine translation systems: the Hiero hierarchical phrase-based translation system and our syntax-based translation system. On a large-scale Chinese-English translation task, we obtain statistically significant improvements of +1.5 Bleu and + 1.1 Bleu, respectively. We analyze the impact of the new features and the performance of the learning algorithm.