ppxscal/embedding_network huggingface dataset:
Improving weed pressure assessment using digital images from an experience-based reasoning approach
Authors: Xavier P. Burgos-Artizzu, Angela Ribeiro, Alberto Tellaeche, Gonzalo Pajares, Cesar Fernández-Quintanilla
Venue: Computers and Electronics in Agriculture (2009)

One of the main goals of Precision Agriculture is site-specific crop management to reduce the production of herbicide residues. This paper presents a computer-based image analysis system allowing users to input digital images of a crop field, and to process these by a series of methods to enable the percentages of weeds, crop and soil present in the image to be estimated. The system includes a Case-Based Reasoning (CBR) system that, automatically and in real time, determines which processing method is the best for each image. The main challenge in terms of image analysis is achieving appropriate discrimination between weeds, crop and soil in outdoor field images under varying light, soil background texture and crop damage conditions. The performance of the developed system is shown for a set of images acquired from different fields and under different, uncontrolled conditions, such as different light, crop growth stage and size of weeds, reaching correlation coefficients with real data of almost 80%.
Note: On total domination vertex critical graphs of high connectivity
Authors: Michael A. Henning, Nader Jafari Rad
Venue: Discrete Applied Mathematics (2009)

A graph is called @c-critical if the removal of any vertex from the graph decreases the domination number, while a graph with no isolated vertex is @c"t-critical if the removal of any vertex that is not adjacent to a vertex of degree 1 decreases the total domination number. A @c"t-critical graph that has total domination number k, is called k-@c"t-critical. In this paper, we introduce a class of k-@c"t-critical graphs of high connectivity for each integer k>=3. In particular, we provide a partial answer to the question ''Which graphs are @c-critical and @c"t-critical or one but not the other?'' posed in a recent work [W. Goddard, T.W. Haynes, M.A. Henning, L.C. van der Merwe, The diameter of total domination vertex critical graphs, Discrete Math. 286 (2004) 255-261].
Application research of an LFB management and development model in ForCES router
Authors: Ke Chen, Ligang Dong, Weiming Wang
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The router based on ForCES (Forwarding and Control Element Separation) meets the open, flexible and programmable demands of the next generation networks. It is one important trend of the next generation routers. Our research team is key participants in the ForCES work and authors of the IETF ForCES protocol. A LFB management and development model based on ForCES router software architecture was illustrated. The ForCES router software structure was first discussed. Based on that, the model was presented. Based on that, the architecture of this model was described. The key technologies on how to manage resource library were described, including the method of LFB resource library management and the mechanism of ForCES LFB resource internal storage. In order to testify the feasibility, an implementation of the model was presented, and an example of an IPv6 forwarding service implementation was given.
Using Stemming Algorithms on a Grid Environment
Authors: Valeriana G. Roncero, Myrian C. Costa, Nelson F. Ebecken
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

Stemming algorithms are commonly used in Information Retrieval with the goal of reducing the number of the words which are in the same morpho-logical variant in a common representation. Stemming analysis is one of the tasks of the pre-processing phase on text mining that consumes a lot of time. This study proposes a model of distributed stemming analysis on a grid environment to reduce the stemming processing time; this speeds up the text preparation. This model can be integrated into grid-based text mining tool, helping to improve the overall performance of the text mining process.
Approximate Nearest Neighbor Search under Translation Invariant Hausdorff Distance
Authors: Christian Knauer, Marc Scherfenberg
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

The Hausdorff distance is a measure for the resemblance of two geometric objects. Given a set of n point patterns and a query point pattern Q , the nearest neighbor of Q under the Hausdorff distance is the point pattern which minimizes this distance to Q . An extension of the Hausdorff distance is the translation invariant Hausdorff distance which additionally allows the translation of the point patterns in order to minimize the distance. This paper introduces the first data structure which allows to solve the nearest neighbor problem for the directed Hausdorff distance under translation in sublinear query time in a non-heuristic manner, in the sense that the quality of the results, the performance, and the space bounds are guaranteed. The data structure answers queries for both directions of the directed Hausdorff distance with a $ \sqrt{d(s-1.5)}(1+\epsilon) $-approximation factor in $ O(\log \frac{n}{\epsilon}) $ query time for the nearest neighbor and O(k + logn) query time for the k -th nearest neighbor for any &epsilon;> 0 . (The O -notation of the latter runtime contains terms that are quadratic in &epsilon; -1 .) Furthermore it is shown how to find the exact nearest neighbor under the directed Hausdorff distance without transformation of the point sets within some weaker time and storage bounds.
Realistic Failures in Secure Multi-party Computation
Authors: Vassilis Zikas, Sarah Hauser, Ueli Maurer
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

In secure multi-party computation, the different ways in which the adversary can control the corrupted players are described by different corruption types. The three most common corruption types are active corruption (the adversary has full control over the corrupted player), passive corruption (the adversary sees what the corrupted player sees) and fail-corruption (the adversary can force the corrupted player to crash irrevocably). Because fail-corruption is inadequate for modeling recoverable failures, the so-called omission corruption was proposed and studied mainly in the context of Byzantine Agreement (BA). It allows the adversary to selectively block messages sent from and to the corrupted player, but without actually seeing the message.In this paper we propose a modular study of omission failures in MPC, by introducing the notions of send-omission (the adversary can selectively block outgoing messages) and receive-omission (the adversary can selectively block incoming messages) corruption. We provide security definitions for protocols tolerating a threshold adversary who can actively, receive-omission, and send-omission corrupt up to t a , t ρ , and t ¿ players, respectively. We show that the condition 3t a + t ρ + t ¿ < n is necessary and sufficient for perfectly secure MPC tolerating such an adversary. Along the way we provide perfectly secure protocols for BA under the same bound. As an implication of our results, we show that an adversary who actively corrupts up to t a players and omission corrupts (according to the already existing notion) up to t ¿ players can be tolerated for perfectly secure MPC if 3t a + 2t ¿ < n. This significantly improves a result by Koo in TCC 2006.
Coordinated concurrent memory accesses on a reconfigurable multimedia accelerator
Authors: Samar Yazdani, Joël Cambonie, Bernard Pottier
Venue: Microprocessors Microsystems (2009)

Reconfigurable fabrics are designed by tiling operators and memory banks. In the context of system on chip, the inclusion of multiple local memories is critical for algorithmic performance, as they provide concurrent data accesses for configured compute processes. This paper considers a practical case where internal fabric buses and connectivity give a shared memory characteristic to the architecture. This relies on static reconfigurability and high-level programming techniques to render automated memory access scheduling feasible in a deterministic manner. A complete flow has been developed starting from the programming model down to micro-code enabling task synchronization on memory resources. Compile time analysis is achieved by observing the sequence of operations in the concurrent processes, and by synthesizing a controller program to support the best schedule of operations favoring high throughput. The hardware target is a reconfigurable fabric designed at STMicroelectronics in 65nm. This hardware/software solution is scalable, flexible and provides high throughput on shared memory.
Incremental learning to rank with partially-labeled data
Authors: Kye-Hyeon Kim, Seungjin Choi
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

In this paper we present a semi-supervised learning method for a problem of learning to rank where we exploit Markov random walks and graph regularization in order to incorporate not only "labeled" web pages but also plenty of "un-labeled" web pages (click logs of which are not given) into learning a ranking function. In order to cope with scalability which existing semi-supervised learning methods suffer from, we develop a scalable and incremental method for semi-supervised learning to rank. In the graph regularization framework, we first determine features which well reflects data manifold and then make use of them to train a linear ranking function. We introduce a matrix-fee technique where we compute the eigenvectors of a huge similarity matrix without constructing the matrix itself. Then we present an incremental algorithm to learn a linear ranking function using features determined by projecting data onto the eigenvectors of the similarity matrix, which can be applied to a task of web-scale ranking. We evaluate our method on Live Search query log, showing that search performance is much improved when Live Search yields unsatisfactory search results.
One Size Does Not Fit All---A Contingency Approach to Data Governance
Authors: Kristin Weber, Boris Otto, Hubert Österle
Venue: Journal of Data and Information Quality (JDIQ) (2009)

Enterprizes need Data Quality Management (DQM) to respond to strategic and operational challenges demanding high-quality corporate data. Hitherto, companies have mostly assigned accountabilities for DQM to Information Technology (IT) departments. They have thereby neglected the organizational issues critical to successful DQM. With data governance, however, companies may implement corporate-wide accountabilities for DQM that encompass professionals from business and IT departments. This research aims at starting a scientific discussion on data governance by transferring concepts from IT governance and organizational theory to the previously largely ignored field of data governance. The article presents the first results of a community action research project on data governance comprising six international companies from various industries. It outlines a data governance model that consists of three components (data quality roles, decision areas, and responsibilities), which together form a responsibility assignment matrix. The data governance model documents data quality roles and their type of interaction with DQM activities. In addition, the article describes a data governance contingency model and demonstrates the influence of performance strategy, diversification breadth, organization structure, competitive strategy, degree of process harmonization, degree of market regulation, and decision-making style on data governance. Based on these findings, companies can structure their specific data governance model.
Application of Distributed Three-Dimension Visualization Technology in Civil Air-Defence Battle Simulation System
Authors: Li Yong, Yang Yang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Civil air-defense is the measure and action to mobilize and organize people to guard against air-attack of enemy and eliminate aftereffect of air-attack. Application of distributed three-dimension visualization technology is a most important content of Battle Simulation. The paper first presents the status of distributed three-dimension visualization research in China, and then discussed and studied several key techniques of distributed three-dimension visualization. Finally, the creation of a simulation system is described.
Application of genetic algorithms to robot kinematics calibration
Authors: Kesheng Wang
Venue: International Journal of Systems Science (2009)

Position and orientation accuracy of an end-effector is affected by the precision of kinematics parameters of the robot manipulator. Thus, good precision requires good knowledge of robot physical parameter values. However, this condition can be difficult to meet in practice. Hence, calibration techniques can be devised in order to improve the robot accuracy through estimation of these particular parameters. In this article, the genetic algorithm is used to calibrate the robot kinematics accuracy. A kinematics model is formulated and conducted as an optimisation problem for ABB Irb 6000 robot manipulator. The objective is to analyse and evaluate the performance of the GA in optimising such robot kinematics accuracy. In this algorithm, small changes in the kinematics parameters values represent the parent and offspring population and the end-effector error represents the fitness functions. A numerical example has been used to demonstrate the convergence and effectiveness of the given model.
User-aided data authentication
Authors: Sven Laur, Sylvain Pasini
Venue: International Journal of Security and Networks (2009)

All classical authentication protocols are based on pre-shared authentic information such as long-term secret keys or a public key infrastructure. However, there are many practical settings, where participants can additionally employ authentic Out-Of-Band (OOB) communication, e.g., manual message transfer. In this paper, we study the corresponding user-aided message authentication and key agreement protocols. In particular, we give a unified treatment of many previous results and outline common design principles. We also show that certain properties of user-aided protocols simplify the security analysis in complex environments compared to the standard authentication protocols.
Marble mosaic tiling automation with a four degrees of freedom Cartesian robot
Authors: Ali Oral, Esra Pınar Inal
Venue: Robotics and Computer-Integrated Manufacturing (2009)

The art of mosaic has arisen thousands of years ago. Despite all those years and all the attention it has received till today, mosaic tiling is still being carried out manually and mosaic tiling processes have never been changed except the tool and material developments. In this paper; history of the mosaic art, the ancient and today's mosaic tiling processes are mentioned briefly. A Cartesian robot with four degrees of freedom is designed and manufactured for mosaic tiling automation. An algorithm for mosaic tiling and the control of robot, named ''MOSTIL'' is developed. The control software interprets a pattern file that is prepared using an existing two-dimensional (2D) CAD package and computes the pieces' locations of the pattern and guides the robotic arm. As a result of this work, some experimental applications for several mosaic patterns which are designed using a 2D CAD software and saved as ''dxf'' format, are carried out by the robot automatically.
Interface design strategies for computer-assisted speech transcription
Authors: Saturnino Luz, Masood Masoodian, Bill Rogers, Chris Deering
Venue: Proceedings of the 20th Australasian Conference on Computer-Human Interaction: Designing for Habitus and Habitat (2008)

A set of user interface design techniques for computer-assisted speech transcription are presented and evaluated with respect to task performance and usability. These techniques include error-correction mechanisms which originated in dictation systems and audio editors as well as new techniques developed by us which exploit specific characteristics of existing speech recognition technologies in order to facilitate transcription in settings that typically yield considerable recognition inaccuracy, such as when the speech to be transcribed was produced by different speakers. In particular, we describe a mechanism for dynamic propagation of user feedback which progressively adapts the system to different speakers and lexical contexts. Results of usability and performance evaluation trials indicate that feedback propagation, menu-based correction coupled with keyboard interaction and text-driven audio playback are positively perceived by users and result in improved transcript accuracy.
Monitoring the Full Range of ω-Regular Properties of Stochastic Systems
Authors: Kalpana Gondi, Yogeshkumar Patel, A. Prasad Sistla
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

We present highly accurate deterministic, probabilistic and hybrid methods for monitoring the full range of &omega;-regular properties, specified as Streett automata, of stochastic systems modeled as Hidden Markov Chains. The deterministic algorithms employ timeouts that are set dynamically to achieve desired accuracy. The probabilistic algorithms employ coin tossing and can give highly accurate monitors when the system behavior is not known. The hybrid algorithms combine both these techniques. The monitoring algorithms have been implemented as a tool. The tool takes a high level description of an application with probabilities and also a Streett automaton that specifies the property to be monitored. It generates a monitor for monitoring computations of the application. Experimental results comparing the effectiveness of the different algorithms are presented.
The role of open source in Graymatter's autonomous vehicle systems
Authors: Carl Schneider, Paul G. Trepagnier
Venue: Journal of Computing Sciences in Colleges (2009)

Open Source software played an integral part in the creation and success of GrayMatter's Team Gray and their autonomous vehicles that participated in DARPA's Grand and Urban Challenges. From those auspicious beginnings a new technology company was formed that today manufactures hardware and software designed to operate vehicles without any human interaction. This presentation will discuss both the history and the future of the company, an overview of its technologies, and the role open source plays in these initiatives. The current vehicle and its suite of sensors, hardware and software will also be on display.
Semantic Annotation and Search for Deep Web Services
Authors: Soon Ae Chun, Janice Warner
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

In this paper, we recognize the shortcomings of the current search engines that do not index and search the Deep Web. We present requirements of a Deep Web Service search engine, that will lead to the query objects in the deep data sources. In order to realize the DWS search engine, we propose semantic metadata and annotation of Deep Web Services (DWS), a reasoning component to assess the relevance of DWS for searching the Deep Web contents, using likelihood of occurrence of data sources that contain the query terms, and present a method of ranking the DWSs. The Deep Web Service annotation considers not only the service descriptions like any Web services, but also has the frequency distribution, clustering and semantic prediction functions that may guide the search for DWSs.
The heterogeneous world of proprietary and open-source software
Authors: Stacy Avery Baird
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Understanding the evolution of a complex, competitive environment is always easier in hindsight, but today's CIOs and government policymakers don't have the luxury of retrospection when it comes to the volatile world of enterprise software. High-caliber decisions require a clear-sighted, non-dogmatic grasp of the contexts in which government enterprises today deploy both proprietary and open-source software in heterogeneous IT environments. This article addresses the topic, and describes ways in which proprietary and open-source software developers are drawing upon each other's development, licensing and business models. The article illustrates how today's IT world is no longer an "either/or" world in which customers and vendors chose to be either proprietary or open source. Instead, it is an attractive world of "both/and" as the lines between proprietary and open source have, making interoperable deployments almost inevitable in many if not most cases.
On new design of Kalman filter with entry-wise updating
Authors: Evgenia Suzdaleva
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The paper deals with a factorized version of Kalman filter. Via factorization of a state-space model such the filter provides the state estimates of individual state vector entries in the factorized form and allows to update them entry-wise. The paper continues a series of research in the field of the factorized filtering and proposes the novel modified algorithm, including the simultaneous entry-wise organized fulfillment of data and time updating steps. A motivation of the research is a preparation of the universal algorithm for the joint filtering of variables of a mixed (continuous and discrete-valued) type. The illustrative example and comparison of computational complexity with other versions of Kalman filtering are presented.
Fuzzy production control with limited resources and response delay
Authors: Arif Suhail, Zahid A. Khan
Venue: Computers and Industrial Engineering (2009)

This paper attempts to study the possibility of using fuzzy control in production-inventory systems that contain variable processes with fixed capacity. The average processing rate that builds up the inventory is equal to the average delivery rate that consumes the inventory so that the system needs no-control action on the basis of averages. However, the inherent randomness in both consumption and replenishment of inventory gives rise to random variations in inventory level that needs to be controlled. Attempt is thus made to develop a fuzzy control system (FCS) to control the effects of randomness in such production systems. Effects of various parameters of the FCS on various performance measures are investigated so that a FCS may be developed for specific situations. It is shown how limited resources on production capacity and the delay due to processing time frustrate the efforts of designing an effective FCS although some benefits can still be achieved. The question of how frequently the fuzzy inference engine (FIE) should observe the system and process the inputs is also studied. Finally it is shown how a little extra production capacity makes the FCS very effective. The investigations provide an understanding and methodology that can be used to design FCS for any situation and, although we have considered two products, it can easily be extended to more than two products.