ppxscal/embedding_network huggingface dataset:
Fault Diagnosis Method of Rolling Bearing Based on BP Neural Network
Authors: Zhonghua Huang, Ya Xie
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

A fault diagnosis method of rolling bearing based on BP neural network and time domain parameters of vibration signal was proposed to realize fast fault diagnosis. The input vectors of the BP neural network were skewness, kurtosis, peak and margin of vibration signal. The structure of the neural network was determined with simulation research. Gradient descending method was used to train the parameters of BP neural network. Experiment results of fault diagnosis showed that with this method fast diagnosis of rolling bearing faults could be realized effectively.
Teaching Computers to Conduct Spoken Interviews: Breaking the Realtime Barrier with Learning
Authors: Gudny Ragna Jonsdottir, Kristinn R. Thórisson
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

Several challenges remain in the effort to build software capable of conducting realtime dialogue with people. Part of the problem has been a lack of realtime flexibility, especially with regards to turntaking. We have built a system that can adapt its turntaking behavior in natural dialogue, learning to minimize unwanted interruptions and "awkward silences". The system learns this dynamically during the interaction in less than 30 turns, without special training sessions. Here we describe the system and its performance when interacting with people in the role of an interviewer. A prior evaluation of the system included 10 interactions with a single artificial agent (a non-learning version of itself); the new data consists of 10 interaction sessions with 10 different humans. Results show performance to be close to a human's in natural, polite dialogue, with 20% of the turn transitions taking place in under 300 msecs and 60% under 500 msecs. The system works in real-world settings, achieving robust learning in spite of noisy data. The modularity of the architecture gives it significant potential for extensions beyond the interview scenario described here.
A Fragile Watermarking Scheme for Tamper-Proof of Web Pages
Authors: Xianzhong Long, Hong Peng, Changle Zhang, Zheng Pan, Ying Wu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

With the development of the Internet, getting informationthrough browsing web pages has become a popularway. How to protect the integrity of a web page is anurgent problem. As an effective method, a novel fragilewatermarking scheme for tamper-proof of web pages isproposed in this paper for solving the problem. In ourscheme, the watermarks that are related to the content ofthe original web page are generated based on the SHA-1algorithm, and then they are embedded into the embeddinglocations controlled by two secret keys. In the detectionprocedure, whether a web page has been tampered or notcan be judged effectively only by comparing the generatedwatermarks with the extracted watermarks. The experimentshows that the proposed scheme has stronger abilities tolocate the locations of modifications and to identify the typesof modifications.
QoS-Based Data Access on Grid
Authors: Pang Xiong Wen, Bao Su Su
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

A wide variety of applications require access to multiple heterogeneous, distributed data sources on grid. However, the quality of data access is still low such as unpredictable response time, irrelevant results, because existing query optimization techniques do not consider the dynamic properties of data resource in grid environments. In this paper, we present a QoS (Quality of Service)-based data access on grid, this approach integrates QoS requirements into distributed query processing and considers also the dynamic properties of the system. Segmented pipe tree based on pipelined parallelism is also proposed to optimize the multi-join queries, which can not only improve the parallelism but also return the partial results to user as soon as possible. The experimental results confirm that the proposed solution is effective for providing different levels data access for different users.
Clustering and Constraints for Real-time Multicast
Authors: Wei Cheng, Shi Cheng, Chanle Wu, Jun Yue, Gang Ye, Lian He
Venue: Proceedings of the 2009 IEEE International Conference on Networking, Architecture, and Storage (2009)

Real-time multicast is widely applied on Internet. Unfortunately, current systems share the same problem that they are not able to maintain high and stable performance when the scale grows unexpectedly large or the nodes' performance fluctuation drastically. This paper attempts to solve the problem by means of network structure clustering and constraints. We show that the multicast network can achieve much higher optimizing speed through dynamically clustering nodes with similar performance records. We propose a cluster-based multicast model and constraints on it. We further provide Regular-Balanced constraint as the recommended constraint, which is related to higher ability of scale and failure tolerance. We also test our model by contrast experiments with CoolStreaming and NICE.
Forgetting actions in domain descriptions
Authors: Esra Erdem, Paolo Ferraris
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

Forgetting irrelevant/problematic actions in a domain description can be useful in solving reasoning problems, such as query answering, planning, conftict resolution, prediction, postdiction, etc.. Motivated by such applications, we study what forgetting is, how forgetting can be done, and for which applications forgetting can be useful and how, in the context of reasoning about actions. We study these questions in the action language C (a formalism based on causal explanations), and relate it to forgetting in classical logic and logic programming.
Each 3-strong Tournament Contains 3 Vertices Whose Out-arcs Are Pancyclic
Authors: Jinfeng Feng
Venue: Graphs and Combinatorics (2009)

An arc in a tournament T with n &#x2265;&#x00a0;3 vertices is called pancyclic, if it is in a cycle of length k for all 3 &#x2264;&#x00a0;k &#x2264;&#x00a0;n. Yeo (Journal of Graph Theory, 50 (2005), 212&#x2013;219) proved that every 3-strong tournament contains two distinct vertices whose all out-arcs are pancyclic, and conjectured that each 2-strong tournament contains 3 such vertices. In this paper, we confirm Yeo&#x2019;s conjecture for 3-strong tournaments.
Mining Spatial Co-location Patterns with Dynamic Neighborhood Constraint
Authors: Feng Qian, Qinming He, Jiangfeng He
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

Spatial co-location pattern mining is an interesting and important issue in spatial data mining area which discovers the subsets of features whose events are frequently located together in geographic space. However, previous research literatures for mining co-location patterns assume a static neighborhood constraint that apparently introduces many drawbacks. In this paper, we conclude the preferences that algorithms rely on when making decisions for mining co-location patterns with dynamic neighborhood constraint. Based on this, we define the mining task as an optimization problem and propose a greedy algorithm for mining co-location patterns with dynamic neighborhood constraint. The experimental evaluation on a real world data set shows that our algorithm has a better capability than the previous approach on finding co-location patterns together with the consideration of the distribution of data set.
An Effective Approach to Verbose Queries Using a Limited Dependencies Language Model
Authors: Eduard Hoenkamp, Peter Bruza, Dawei Song, Qiang Huang
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

Intuitively, any `bag of words' approach in IR should benefit from taking term dependencies into account. Unfortunately, for years the results of exploiting such dependencies have been mixed or inconclusive. To improve the situation, this paper shows how the natural language properties of the target documents can be used to transform and enrich the term dependencies to more useful statistics. This is done in three steps. The term co-occurrence statistics of queries and documents are each represented by a Markov chain. The paper proves that such a chain is ergodic, and therefore its asymptotic behavior is unique, stationary, and independent of the initial state. Next, the stationary distribution is taken to model queries and documents, rather than their initial distributions. Finally, ranking is achieved following the customary language modeling paradigm. The main contribution of this paper is to argue why the asymptotic behavior of the document model is a better representation then just the document's initial distribution. A secondary contribution is to investigate the practical application of this representation in case the queries become increasingly verbose. In the experiments (based on Lemur's search engine substrate) the default query model was replaced by the stable distribution of the query. Just modeling the query this way already resulted in significant improvements over a standard language model baseline. The results were on a par or better than more sophisticated algorithms that use fine-tuned parameters or extensive training. Moreover, the more verbose the query, the more effective the approach seems to become.
Integrated Controlling Technology on Regional Agriculture Water Resources
Authors: Xu Zhenghe, Wang Xiuru
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

With the severe shortage of agricultural water resources, the model of integrated controlling surface water and ground water has been designed based on the greatest economic benefit. In terms of the crop subsystem, the dynamic planning model was designed in the condition of single crop irrigated inadequately, based on the function between crops and water irrigation. As for the whole region, linear planning model was designed between different kinds of crops on the water allocation. This model was verified by Chinese national programs for high technology research and development (national 863 project) demonstration area in Weihai, Shandong province.
DRAMMS: Deformable Registration via Attribute Matching and Mutual-Saliency Weighting
Authors: Yangming Ou, Christos Davatzikos
Venue: Proceedings of the 21st International Conference on Information Processing in Medical Imaging (2009)

A general-purpose deformable registration algorithm referred to as "DRAMMS" is presented in this paper. DRAMMS adds to the literature of registration methods that bridge between the traditional voxel-wise methods and landmark/feature-based methods. In particular, DRAMMS extracts Gabor attributes at each voxel and selects the optimal components, so that they form a highly distinctive morphological signature reflecting the anatomical context around each voxel in a multi-scale and multi-resolution fashion. Compared with intensity or mutual-information based methods, the high-dimensional optimal Gabor attributes render different anatomical regions relatively distinctively identifiable and therefore help establish more accurate and reliable correspondence. Moreover, the optimal Gabor attribute vector is constructed in a way that generalizes well, i.e., it can be applied to different registration tasks, regardless of the image contents under registration. A second characteristic of DRAMMS is that it is based on a cost function that weights different voxel pairs according to a metric referred to as "mutual-saliency", which reflects the uniqueness (reliability) of anatomical correspondences implied by the tentative transformation. As a result, image voxels do not contribute equally to the optimization process, as in most voxel-wise methods, or in a binary selection fashion, as in most landmark/feature-based methods. Instead, they contribute according to a continuously-valued mutual-saliency map, which is dynamically updated during the algorithm's evolution. The general applicability and accuracy of DRAMMS are demonstrated by experiments in simulated images, inter-subject images, single-/multi-modality images, and longitudinal images, from human and mouse brains, breast, heart, and prostate.
Efficient Parsing of Romanian Language for Text-to-Speech Purposes
Authors: Andrei Şaupe, Lucian Radu Teodorescu, Mihai Alexandru Ordean, Răzvan Boldizsar, Mihaela Ordean, Gheorghe Cosmin Silaghi
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

This paper presents the design of the text analysis component of a TTS system for the Romanian language. Our text analysis is performed in two steps: document structure detection and text normalization. The output is a tree-based representation of the processed data. Parsing is made efficient with the help of the Boost Spirit LL parser [1], the usage of this tool allowing for a greater flexibility in the source code and in the output representation.
Detecting parser errors using web-based semantic filters
Authors: Alexander Yates, Stefan Schoenmackers, Oren Etzioni
Venue: Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (2006)

NLP systems for tasks such as question answering and information extraction typically rely on statistical parsers. But the efficacy of such parsers can be surprisingly low, particularly for sentences drawn from heterogeneous corpora such as the Web. We have observed that incorrect parses often result in wildly implausible semantic interpretations of sentences, which can be detected automatically using semantic information obtained from the Web. Based on this observation, we introduce Web-based semantic filtering---a novel, domain-independent method for automatically detecting and discarding incorrect parses. We measure the effectiveness of our filtering system, called Woodward, on two test collections. On a set of TREC questions, it reduces error by 67%. On a set of more complex Penn Treebank sentences, the reduction in error rate was 20%.
A likelihood based framework for assessing network evolution models tested on real network data
Authors: Richard G. Clegg, Raul Landa, Miguel Rio, Uli Harder
Venue: Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners (2009)

This paper presents a statistically sound method for using likelihood to assess potential models of network evolution. The method is tested on data from five real networks. Data from the internet autonomous system network, from two photo sharing sites and from a co-authorship network are tested using this framework.
Quality Assessment of the MPEG-4 Scalable Video CODEC
Authors: Florian Niedermeier, Michael Niedermeier, Harald Kosch
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

In this paper, the performance of the emerging MPEG-4 SVC CODEC is evaluated. In the first part, a brief introduction on the subject of quality assessment and the development of the MPEG-4 SVC CODEC is given. After that, the used test methodologies are described in detail, followed by an explanation of the actual test scenarios. The main part of this work concentrates on the performance analysis of the MPEG-4 SVC CODEC - both objective and subjective. Please note that this document is only a shortened version of the assessment. Further experimental results can be found in the extended version available at the Computing Research Repository (CoRR).
A Retransmission Cut-Off Random Access Protocol with Multi-packet Reception Capability for Wireless Networks
Authors: Jahangir H. Sarker, Hussein T. Mouftah
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

A retransmission cut-off algorithm for Slotted ALOHA random access protocol is studied in terms of the new packet generation rate, the number of retransmission trials and the Multi-packet Reception capacity. The retransmission cut-off is not needed for a stable operation of Slotted ALOHA if the new packet generation rate is below a critical limit. The values of these critical limits increase almost linearly with the increase of MPR capability. The throughput never reaches its maximum value if the new packet generation rate is less than the corresponding critical limits irrespective of the number of retransmission trials. The maximum throughput is attained by adjusting the number of retransmission trials, pertaining to the new packet generation rate exceeding the corresponding critical limits. A complete analysis for the new packet generation rate with the proper adjustment of the number of retransmission trials and the Multi-packet Reception capability that maximizes the channel throughput and stable operation is found. The stable and unstable operating regions in terms of the new packet generation rate, the number of retransmission trials and the Multi-packet Reception capability is devised. The throughput and packet rejection probability of retransmission cut-off Slotted ALOHA with Multi-packet Reception capability are also provided.
A Study on Effective Tactile Feeling of Control Panels for Electrical Appliances
Authors: Miwa Nakanishi, Yusaku Okada, Sakae Yamamoto
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

This study focuses on the fact that tactile factors, compared to visual factors, have not been effectively applied to enhance the usability of control panels. It also evaluates the effectiveness of allocating a rough/smooth feeling to the surface of each button in a control panel according to its operational function. The first experiment reveals relationships between some of the impressions concerning the operation of electrical appliances and the rough/smooth feeling when touching the surface of buttons. Moreover, it provides specific information on what degree of roughness/smoothness should be applied to what types of functional buttons. The second experiment demonstrates that the usability of control panels can be enhanced by providing a rough/smooth feeling to each button, considering suitability with respect to operation impressions. In addition, results indicate that users may feel discomfort when the rough/smooth feeling does not correspond to operation impressions.
Internal Component Layout Optimization Method for Aircraft Safety Design
Authors: Pei Yang, Bifeng Song
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

Traditionally, aircraft vulnerability reductions are considered by fire or explosion prevention of fuel tank, redundant approach, and armor material design, et.al.. This paper proposes a concept of internal component layout optimization to reduce the aircraft vulnerability, so as to achieve the low vulnerability by the natural location shielding or masking among components. In this optimization model, the location coordinates and orientations of the given components are used as the design variables, and the minimum equivalent vulnerability index is used as the design objective, considering the constrains of aircraft mass center, component working and non-overlapping conditions. The initial layouts are built by random method, in which, some bad solutions are replaced by knowledge solutions through vulnerability importance measure analysis. The component interference detection is conducted by the octree traversal and transformation operation method. The low vulnerability layout optimization problem is solved by a hybrid self-adaptive sequential quadratic program and genetic algorism. The proposed low vulnerability layout optimization concept may be regarded as a supplement to commonly used vulnerability reduction methods, and is useful for enhancing aircraft safety.
The Computational Geometry of Comparing Shapes
Authors: Helmut Alt
Venue: Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of His 60th Birthday (2009)

This article is a survey on methods from computational geometry for comparing shapes that we developed within our work group at Freie Universität Berlin. In particular, we will present the ideas and complexity considerations for the computation of two distance measures, the Hausdorff distance and the Fréchet distance. Whereas the former is easier to compute, the latter better captures the similarity of shapes as perceived by human observers. We will consider shapes modelled by curves in the plane as well as surfaces in three-dimensional space. Especially, the Fréchet distance of surfaces seems computationally intractable and is of yet not even known to be computable. At least the decision problem is shown to be recursively enumerable.
A Management System for Visual Communication Design at Film Studio
Authors: Hong-Sheng Chen
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)

This research aims to propose a design management system for helping designer to make arrangement of the furniture in a film shooting studio. The main issue is that furniture has its own characters, and it matches to other furniture in different degree. Therefore, designer need help to calculate the appropriateness. The appropriateness comes from items' color, texture and its image to audience. This management system help designer to visualize the result of combination by simulation.
An Image Based Algorithm for Watermarking Relational Databases
Authors: Zhongyan Hu, Zaihui Cao, Jianhua Sun
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

As a tool for interests in both storing and managing data, relational database is widely used in many information systems. This paper studies an improved algorithm to watermark numeric attributes in relational databases for copyright protection. We propose a novel watermarking method, which embeds an image watermark into relational results verify the effectiveness of the database. Experimental results show that the proposed scheme is robust against various forms of attacks.
Supporting Negotiations over Influence Diagrams
Authors: Jesus Rios, David Rios Insua
Venue: Decision Analysis (2009)

We deal with issues concerning negotiation support for group decisions over influence diagrams, when the group members disagree about utility and probability assessments. We base our discussion on a modification of the balanced increment solution, which guarantees a final negotiated Pareto optimal alternative. As in standard decision analysis textbooks, we deal first with negotiation tables, then with negotiation trees, and finally with negotiation influence diagrams. We show through an example that a naive application of the balanced increment method at each joint decision node in a dynamic decision-making problem, and, more generally, of any standard negotiation approach guaranteeing Pareto optimality, may lead to an inferior solution. Therefore, our strategy proposes computing first the set of nondominated alternatives followed by negotiating over that set.