ppxscal/embedding_network huggingface dataset:
Research of Remote Sensing Image Data Mining Technique Based on Web
Authors: Du Ping, He YueShun
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 01 (2009)

The web was an information resource with dynamic state, to access and analyze the datum we must study how to integrate heterogeneous architecture datum and choose right techniques to analyze and integrate and manage the datum. In the paper, the datum of remote sensing image was analyzed, they were seriate and typical non-structure, and they had the characteristics with timeliness, spatial relativity, difficult to decompose and combination. A pretty flow and architecture were designed for the data mining of remote sensing image; the idea of the data integrated and transformed and designing data warehouse were advanced, also, an implementation method was presented for the key technology.
Fast Block Clustering Based Optimized Adaptive Mediod Shift
Authors: Zulqarnain Gilani, Naveed Iqbal Rao
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We present an optimal approach to unsupervised color image clustering, suited for high resolution images based on mode seeking by mediod shifts. It is shown that automatic detection of total number of clusters depends upon overall image statistics as well as the bandwidth of the underlying probability density function. An optimized adaptive mode seeking algorithm based on reverse parallel tree traversal is proposed. This work has contribution in three aspects. 1) Adaptive bandwidth for kernel function is proposed based on the overall image statistics; 2) A novel reverse parallel tree traversing approach for mode seeking is presented which drastically reduces number of computational steps as compared to traditional tree traversing. 3) For high resolution images block clustering based optimized Adaptive Mediod Shift (AMS) is proposed where mode seeking is done in blocks and then the local modes are merged globally. The proposed method has made it possible to perform clustering on variety of high resolution images. Experimental results have shown our algorithm time efficient and robust.
Computing term translation probabilities with generalized latent semantic analysis
Authors: Irina Matveeva, Gina-Anne Levow
Venue: Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations (2006)

Term translation probabilities proved an effective method of semantic smoothing in the language modelling approach to information retrieval tasks. In this paper, we use Generalized Latent Semantic Analysis to compute semantically motivated term and document vectors. The normalized cosine similarity between the term vectors is used as term translation probability in the language modelling framework. Our experiments demonstrate that GLSA-based term translation probabilities capture semantic relations between terms and improve performance on document classification.
Superresolution with compound Markov random fields via the variational EM algorithm
Authors: Atsunori Kanemura, Shin-ichi Maeda, Shin Ishii
Venue: Neural Networks (2009)

This study deals with a reconstruction-type superresolution problem and the accompanying image registration problem simultaneously. We propose a Bayesian approach in which the prior is modeled as a compound Gaussian Markov random field (MRF) and marginalization is performed over unknown variables to avoid overfitting. Our algorithm not only avoids overfitting, but also preserves discontinuity in the estimated image, unlike existing single-layer Gaussian MRF models for Bayesian superresolution. Maximum-marginal-likelihood estimation of the registration parameters is carried out using a variational EM algorithm where hidden variables are marginalized out, and the posterior distribution is variationally approximated by a factorized trial distribution. High-resolution image estimates are obtained through the process of posterior computation in the EM algorithm. Experiments show that our Bayesian approach with the two-layer compound model exhibits better performance both in quantitative measures and visual quality than the single-layer model.
Software testing and the naturally occurring data assumption in natural language processing
Authors: K. Bretonnel Cohen, William A. Baumgartner,  Jr., Lawrence Hunter
Venue: Software Engineering, Testing, and Quality Assurance for Natural Language Processing (2008)

It is a widely accepted belief in natural language processing research that naturally occurring data is the best (and perhaps the only appropriate) data for testing text mining systems. This paper compares code coverage using a suite of functional tests and using a large corpus and finds that higher class, line, and branch coverage is achieved with structured tests than with even a very large corpus.
A Study on the Consumers' Brand Cognition and Design Strategy by ZMET
Authors: Chen-Hao Fan
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Part III: Applications and Services (2009)

The research used Means-End Chain as theory basis to combine the consumers' inclinations sense to form the chain-relation as "attributes-result-value", using a new Zaltman Metaphor Elicitation Technique to analyze the high involvement people thoughts and feelings to find out about the consumer's profound concept. Personal interview data was examined in the application of qualitative analysis of Laddering Technique and content analysis method, so as to explore the hierarchical relations of customers' cognitive value, and to build up their mental map and hierarchical value map (HVM). Based on the collected HVM elicited from the study, it has shown that the consumers' ultimate values through 73 components are "pleasure", "commoditization", "agelong power", "free and easy", "exhilaration", "experience of Japanesque life", "progress in personal sense. he results of the research help designer understand precisely the detailed product in accordance' deep thoughts, as well as the factors that affect customers' buying behavior.
Comparison of synchronization indices: behavioral study
Authors: Pierre Dugué, Régine Le Bouquin-Jeannès, Gérard Faucon
Venue: EURASIP Journal on Advances in Signal Processing (2009)

The synchronization of a neuronal response to a given periodic stimulus is usually measured by Goldberg and Brown's vector strength metric. This index does not take omitted spikes into account. This particular limitation has motivated the development of two new indices: the corrected vector strength index and the corrected phase variance index, both including a penalty factor linked to the firing rate. In this paper, a theoretical study on the normalization of the corrected phase variance index is conducted. Both indices are compared to four existing ones using a simulated dataset which considers three desynchronizing disturbances: irregularity in firing, added spikes, and omitted spikes. In the case of unimodal responses, the two new indices are satisfying and appear the more promising in the case of real signals. In the multimodal case, the entropy-based index is better than the others even if this index is not drawback-free.
A domain-independent system for case-based task decomposition without domain theories
Authors: Ke Xu, Hector Muñoz-Avila
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 1 (2005)

We propose using domain-independent task decomposition techniques for situations in which cases are the sole or the main source for domain knowledge. Our work is motivated by project planning domains, where hierarchical cases are readily available, but neither a planning domain theory nor case adaptation knowledge is available. We present DInCaD (Domain-Independent System for Case-Based Task Decomposition), a system that encompasses case retrieval, refinement, and reuse, following from the idea of reusing generalized cases to solve new problems. DInCaD consists of a case refinement procedure that reduces case over-generalization, and a similarity criterion that takes advantage of the refinement to improve case retrieval precision. We will analyze the properties of the system, and present an empirical evaluation.
A distributed, scaleable simplex method
Authors: Gavriel Yarmish, Richard Slyke
Venue: The Journal of Supercomputing (2009)

We present a simple, scaleable, distributed simplex implementation for large linear programs. It is designed for coarse-grained computation, particularly, readily available networks of workstations. Scalability is achieved by using the standard form of the simplex rather than the revised method. Virtually all serious implementations are based on the revised method because it is much faster for sparse LPs, which are most common. However, there are advantages to the standard method as well. First, the standard method is effective for dense problems. Although dense problems are uncommon in general, they occur frequently in some important applications such as wavelet decomposition, digital filter design, text categorization, and image processing. Second, the standard method can be easily and effectively extended to a coarse grained, distributed algorithm. Such an implementation is presented here. The effectiveness of the approach is supported by experiment and analysis.
Key Collisions of the RC4 Stream Cipher
Authors: Mitsuru Matsui
Venue: Fast Software Encryption: 16th International Workshop, FSE 2009 Leuven, Belgium, February 22-25, 2009 Revised Selected Papers (2009)

This paper studies "colliding keys" of RC4 that create the same initial state and hence generate the same pseudo-random byte stream. It is easy to see that RC4 has colliding keys when its key size is very large, but it was unknown whether such key collisions exist for shorter key sizes. We present a new state transition sequence of the key scheduling algorithm for a related key pair of an arbitrary fixed length that can lead to key collisions and show as an example a 24-byte colliding key pair. We also demonstrate that it is very likely that RC4 has a colliding key pair even if its key size is less than 20 bytes. This result is remarkable in that the number of possible initial states of RC4 reaches 256! ≈ 21684. In addition we present a 20-byte near-colliding key pair whose 256-byte initial state arrays differ at only two byte positions.
The Fuzzy Coefficient Game Model and the Effective Algorithm in a Loan
Authors: Jie Su, Chuanliang Jia
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

In view of the uncertainty in the loan, the fuzzy coefficient equilibrium game model in the loan is set up by discussing the behaviors of the borrower and the lender and the relation between them. Next, the fuzzy optimal solution of the game is given by maximizing the minimal satisfactory grades of the borrower and the lender. Furthermore, an effective method is presented to solve the fuzzy coefficient game model.
Delegation Assistance
Authors: Achim D. Brucker, Helmut Petritsch, Andreas Schaad
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

Today's IT systems typically comprise a fine-grained accesscontrol mechanism based on complex policies. The strict enforcementof these policies, at runtime, always contains the risk of hinderingpeople in their regular work.An efficient support for assisted delegation can help in resolvingthe conflict between too tight access control and the required flexibilityas well as support the resolution of conflicts.Here, assisteddelegation means that, additional to denying the access, a user isinformed about a list of users that could either grant him access tothe requested resource or which could execute this task in behalf ofthe user.In this paper, we present an approach for determining a set of users which are able to resolve an access control conflict. This set isbased on various information sources and are ordered with respect todifferent distance functions. We show that one distance functioncan be used to serve different types of contextual input, e.g., rolehierarchies, geospatial information as well as shared businessobject structure data or social network graphs.
A Network Security Dynamic Situation Forecasting Method
Authors: Li Juan, Li Tao, Liang Gang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

This paper proposes a network security dynamic situation forecasting method (Unbiased Gray Markov Forecasting Method: UGM_HM), which based on the Unbiased Grey system theory and Markov Forecasting theory. UGM_HM combines advantages of Unbiased Grey system theory and Markov Forecasting theory. UGM_HM takes the complex network environment as a Grey system and takes the dynamic risk value of network as a Grey value. The long-term network security situation is reflected by the Unbiased GM (1, 1) and the state transition probabilities are identified by Markov chain theory. The above mentioned dynamic risk value of network, which based on the artificial immune can reflect the network real-time state. The conclusions of experiment prove that UGM_HM compares with Unbiased GM (1, 1) has high precision in the forecasting of the network security dynamic situation.
Design of an Efficient Multicast Scheme for Vehicular Telematics Networks
Authors: Junghoon Lee, In-Hye Shin, Hye-Jin Kim, Min-Jae Kang, Sang Joon Kim
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part II (2009)

This paper proposes and measures the performance of an error control scheme for reliable message multicast on vehicular telematics networks, aiming at improving successful delivery ratio for the safety applications. Periodically triggered by an access point on the mobile gateway, the error recovery procedure collects the error reports from the reachable vehicles and decides the packet to retransmit considering available network bandwidth. The control scheme basically selects the message vehicles have missed most, giving additional precedence to messages belonging to a vehicle that is about to leave the gateway. The performance measurement result obtained via simulation using a discrete event scheduler shows that the proposed scheme can enhance the number of recovered messages by up to 12 % compared with the maximum selection scheme, showing better recovery ratio almost all ranges of given parameters.
Authenticated names
Authors: Stanley Chow, Christophe Gustave, Dmitri Vinokurov
Venue: Proceedings of the 2007 Workshop on New Security Paradigms (2008)

Currently, most means of communication include some form of identification of the sender/originator, but none of these identifications are securely authenticated (at least not conveniently or in wide use). Legitimate business entities can be misrepresented by their name, and this creates opportunities for various scams known as phishing. We propose a new end-to-end authentication scheme that can be used to authenticate companies over many means of communication including telephony, email, web, and Instant Messaging. The framework is flexible and gives concerned legitimate institutions the ability to delegate their authenticated names to employees outside the office as well as outsourcing companies.
Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Venue: European Chapter Meeting of the ACL (2006)

On behalf of the Programme Committee, we are pleased to present the proceedings of the Student Research Workshop held at the Eleventh Conference of the European Chapter of the Association for Computational Linguistics. Following the tradition of providing a forum for student researchers and the success of the previous workshops held in Bergen (1999), Toulouse (2001) and Budapest (2003), a panel of senior researchers will take part in the presentation of the papers, providing detailed comments on the work of the authors. The Student Workshop will run as three parallel sessions, during which 9 papers will be presented. These high standard papers were carefully chosen from a total of 33 submissions coming from about 15 countries.
Position Location Techniques and Applications
Authors: David Munoz, Frantz Bouchereau Lara, Cesar Vargas, Rogerio Enriquez-Caldera
Venue:  (2009)

This book is the definitive guide to the techniques and applications of position location, covering both terrestrial and satellite systems. It gives all the techniques, theoretical models and algorithms that an engineer needs to improve their current location schemes and to develop future location algorithms and systems. Comprehensive coverage is given to system design trade-offs, complexity issues, and the design of efficient positioning algorithms, enabling the creation of high-performance location positioning systems. Traditional methods are also re-examined in the context of the challenges posed by reconfigurable and multi-hop networks. Applications discussed include wireless networks (WiFi, ZigBee, UMTS and DVB networks), cognitive radio and sensor and multi-hop networks. . Contains a complete guide to models, techniques and applications of position location. Includes applications to wireless networks (WiFi, ZigBee, DVB networks), cognitive radio, sensor networks and reconfigurable and multi-hop networks, demonstrating the relevance of location positioning to these 'hot' areas in research and development. Covers system design trade-offs, and the design of efficient positioning algorithms enables the creation of future location positioning systems. Provides a theoretical underpinning for understanding current position location algorithms, giving researchers a foundation to develop future algorithms
Variable Structure GA Based Motion Planning of a Three-Limbed Robot
Authors: Ming Pang, ZhiYuan Liu, ShouChen Cai, Zongwei Ren, Yanhe Zhu
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

A novel progressive genetic algorithm was developed for motion planning of a three-limbed robot. The proposed motion planning method can be used to find a optimal joints trajectory from the initial to the final position and orientation. On the basis of the genetic algorithm a kind of variable structure genetic algorithm was proposed to solve the problem of motion planning of the three-limbed in dynamic environments. The variable structure genetic algorithm changes the original structure by abandoning Elitist Model, expectation selection, reproducing population and changing the probability of crossover and mutation. Experiments results show that the former algorithm is effective in static environments and the latter algorithm is adapted to dynamic environments.
Face-Based Access Control and Invigilation Tool for E-learning Systems
Authors: C. M. Althaff Irfan, Syusaku Nomura, Karim Ouzzane, Yoshimi Fukumura
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

Knowledge is a key factor to the personal success. Further, the certifications are the instant tools that are commonly available to assess the personal success. In an e-Learning environment, where the learning projects are delivered with the aim to provide a professional or an academic certification, it is integral that the Learning Management Systems provide security features that will ensure the credibility of the assessment and the certification. In a conventional examination environment, there will be invigilators to overlook the candidates, on the contrary, in an on-line examination environment; it is a mandatory requirement that an invigilation mechanism is implemented to ensure the integrity of the examination. In this paper, we present a face recognition based invigilation tool for online e-Learning systems
Computation of Decimal Transcendental Functions Using the CORDIC Algorithm
Authors: Álvaro Vazquez, Julio Villalba, Elisardo Antelo
Venue: Proceedings of the 2009 19th IEEE Symposium on Computer Arithmetic (2009)

In this work we propose new decimal floating-point CORDIC algorithms for transcendental function evaluation. We show how these algorithms are mapped to a state of the art Decimal Floating-Point Unit (DFPU), both considering the use of a carry--propagate adder or a carry--save redundant adder. We compared with previous decimal CORDIC proposals and with table-driven algorithms, and we concluded that our approach have significant potential advantages for transcendental function evaluation in state of the art DFPUs with minor modifications of the hardware.
A Survey on the State of the Practice in Distributed Software Development: Criteria for Task Allocation
Authors: Ansgar Lamersdorf, Jürgen Munch, Dieter Rombach
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

The allocation of tasks can be seen as a success-critical management activity in distributed development projects. However, such task allocation is still one of the major challenges in global software development due to an insufficient understanding of the criteria that influence task allocation decisions. This article presents a qualitative study aimed at identifying and understanding such criteria that are used in practice. Based on interviews with managers from selected software development organizations, criteria currently applied in industry are identified. One important result is, for instance, that the sourcing strategy and the type of software to be developed have a significant effect on the applied criteria. The article presents the goals, design, and results of the study as well as an overview of related and future work.
The Effectiveness of and Issues Relating to Remote Non-Face-to-Face Lessons on Singing with Simultaneous Piano Self-Accompaniment
Authors: Katsuko T. Nakahira, Miki Akahane, Yukiko Fukami
Venue: Proceedings of the 2009 International Conference on Biometrics and Kansei Engineering (2009)

Some 20 students were taught to sing and simultaneously accompany themselves on the piano using remote non-face to-face lessons assisted by the use of model performances recorded on DVDs. The performances of each student before and after the lessons were compared and analyzed. The analysis indicated that improvements were made in many aspects of performance on which the instructor had given advice. It also revealed that those students who had developed a good appreciation of their own performance, from the combination of the instructor’s advice and study of the model performances, had made dramatic progress.However, it was also found that in certain respects these remote non-face-to-face lessons were not fully effective. We concluded that, to ensure the quality of the learning of simultaneous piano playing and singing, it is necessary to: improve the non-face-to-face instruction method; to complement it with some face-to-face lessons; to help students develop their performance image and develop a better appreciation of music from the model performances of music in the e-learning educational material; to help them check their fingering from e-learning material, which includes annotated musical scores; and to update the e-learning material periodically.