ppxscal/embedding_network huggingface dataset:
A Power Peer-Based Reputation Scheme for Mobile P2P Systems
Authors: Xu Wu, Jingsha He, Chia-Hu Chang, Fei Xu
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Lack of trust between peers is one of the most serious drawbacks that obstruct the wide adoption of mobile p2p systems. Since current reputation schemes developed mainly for the fixed wired networks are not fit in such a scenario, new trust solutions are eagerly in demand. This paper presents a power peer-based reputation scheme, where peers are classified into two groups, power peers and mobile peers and a power peer has zero or more mobile peers. We design two ways of selecting power peers, greedy method and maximal independent set method. The proposed scheme establishes a trusted mobile environment for mobile p2p systems. It effectively avoids the communication overhead in global trust computation because each power peer maintains the appropriate reputation information of its mobile peers. The simulation results show that our scheme is highly robust and scalable in the dynamic environment of mobile networks.
Research on Numerical Module Identification Approaches
Authors: Quan Shan, Yan Chen
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Point to product module identification, a new numerical optimization is proposed in this paper. This approach combines the improved particle swarm optimization (IPSO) algorithm with the synthesis design structure matrix (DSM), in which a series of property correlations facing the product lifecycle are divided into functional, geometrical, physical and auxiliary ones to obtain the synthesis DSM. An optimization function for module identification, based on the axiomatic design theory, is established. The numerical optimization process is given by particular analysis. The optimization approach using IPSO is tested several times with an example and compared with other classical algorithms, such as PSO, simulated annealing algorithm (SAA) and genetic algorithm (GA). The result demonstrates the feasibility of the proposed approaches.
The Application of Improved Algorithm for Fuzzy Comprehensive Evaluation on the QoS of Web Service
Authors: Qi Zhao, Yanliao Tan
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

Quality evaluation becomes more and more important in Web Service life cycle on Service Selection, real-time monitoring, management, accounting and other stages. And fuzzy theory has been applied to this field. In this paper, the algorithm of fuzzy comprehensive evaluation is ameliorated on differentiating redundancy membership degree. It eliminates redundant data in membership degrees of index which are useless for objective classification. Then it realizes the conversion of membership degrees without redundant data. It can be used in the evaluation on the QoS of Web Service.
Geospatial Crime Scene Investigation --- From Hotspot Analysis to Interactive 3D Visualization
Authors: Markus Wolff, Hartmut Asche
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

This contribution presents an approach to combine geospatial crime scene analysis with three-dimensional geovisualization methods. Crime scene analysis carried out in this paper focuses on GIS-based hotspot identification of robbery scenes. Furthermore, methods are presented to extract those individual spatial properties of hotspot regions that might help to understand observed density patterns. Against this background in-depth analysis tries to reveal certain correlations between urban features and robbery offences. Therefore further analysis links robbery scenes to pedestrian frequencies and to certain urban facilities as, for instance, to schools, banks, clubs and many more. Spatio-temporal analysis of hotspot patterns finalises the presented set of spatial crime scene analysis. However, to facilitate an instant grasp of such complex spatial phenomena, respective results of crime scene analysis are visualized using a three-dimensional geovirtual environment. This combined approach contributes to an intuitive comprehension of complex geospatial information for decision makers in security agencies as well as for authorities related to urban planning.
Robust Facial Expression Recognition Using Selected Wavelet Moment Invariants
Authors: Ruicong Zhi, Qiuqi Ruan
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

This paper proposes a novel facial expression recognition method by extracting the wavelet moment invariants of the images as feature vectors, and using AdaBoost to select effective features. Wavelet moment invariants can present the facial expressions effectively and invariant under translation, scaling and rotation. To reduce the dimensions and eliminate the redundancy of feature vectors, we utilize modified AdaBoost algorithm to select the combination of the effective features that best classify the samples. Experimental results indicate that the proposed method outperforms conventional methods, such as Gabor and Zernike moments.
On the importance of pivot language selection for statistical machine translation
Authors: Michael Paul, Hirofumi Yamamoto, Eiichiro Sumita, Satoshi Nakamura
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Short Papers (2009)

Recent research on multilingual statistical machine translation focuses on the usage of pivot languages in order to overcome resource limitations for certain language pairs. Due to the richness of available language resources, English is in general the pivot language of choice. In this paper, we investigate the appropriateness of languages other than English as pivot languages. Experimental results using state-of-the-art statistical machine translation techniques to translate between twelve languages revealed that the translation quality of 61 out of 110 language pairs improved when a non-English pivot language was chosen.
Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes
Authors: Olaf Beyersdorff, Zenon Sadowski
Venue: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications (2009)

In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP ¿ coNP, UP, BPP, disjoint NP-pairs etc.), these questions have been intensively studied during the last years, and a number of characterizations have been obtained. Here we provide new characterizations for Q1 and Q2 that apply to almost all promise classes C and languages L, thus creating a unifying framework for the study of these practically relevant questions.While questions Q1 and Q2 are left open by our results, we show that they receive affirmative answers when a small amount on advice is available in the underlying machine model. This continues a recent line of research on proof systems with advice started by Cook and Krají¿ek [6].
Triphone Statistics for Polish Language
Authors: Bartosz Ziółko, Jakub Gałka, Suresh Manandhar, Richard C. Wilson, Mariusz Ziółko
Venue: Human Language Technology. Challenges of the Information Society: Third Language and Technology Conference, LTC 2007, Poznan, Poland, October 5-7, 2007, Revised Selected Papers (2009)

The Polish text corpus was analysed to find information about phoneme statistics. We were especially interested in triphones as they are commonly used in many speech processing applications like HTK speech recogniser. An attempt to create the full list of triphones for Polish language is presented. A vast amount of phonetically transcribed text was analysed to obtain the frequency of triphone occurrences. A distibution of frequency of triphones occuring and other phenomena are presented. The standard phonetic alphabet for Polish and methods of providing phonetic transcriptions are described.
Debugging GPU stream programs through automatic dataflow recording and visualization
Authors: Qiming Hou, Kun Zhou, Baining Guo
Venue: ACM SIGGRAPH Asia 2009 papers (2009)

We present a novel framework for debugging GPU stream programs through automatic dataflow recording and visualization. Our debugging system can help programmers locate errors that are common in general purpose stream programs but very difficult to debug with existing tools. A stream program is first compiled into an instrumented program using a compiler. This instrumenting compiler automatically adds to the original program dataflow recording code that saves the information of all GPU memory operations into log files. The resulting stream program is then executed on the GPU. With dataflow recording, our debugger automatically detects common memory errors such as out-of-bound access, uninitialized data access, and race conditions -- these errors are extremely difficult to debug with existing tools. When the instrumented program terminates, either normally or due to an error, a dataflow visualizer is launched and it allows the user to examine the memory operation history of all threads and values in all streams. Thus the user can analyze error sources by tracing through relevant threads and streams using the recorded dataflow. A key ingredient of our debugging framework is the GPU interrupt, a novel mechanism that we introduce to support CPU function calls from inside GPU code. We enable interrupts on the GPU by designing a specialized compilation algorithm that translates these interrupts into GPU kernels and CPU management code. Dataflow recording involving disk I/O operations can thus be implemented as interrupt handlers. The GPU interrupt mechanism also allows the programmer to discover errors in more active ways by developing customized debugging functions that can be directly used in GPU code. As examples we show two such functions: assert for data verification and watch for visualizing intermediate results.
On Insertion Grammars with Maximum Parallel Derivation
Authors: Liviu P. Dinu
Venue: Fundamenta Informaticae (2009)

In this paper we investigate insertion grammars and explore their capacity to generate words parallelly by introducing parallel derivation (where more than one rule can be applied to the string in parallel) and maximum parallel derivation (where as many rules as possible are applied to the string in parallel). We compare the generative power of these grammars with context sensitive and context free grammars and with different variants of contextual grammars. We apply these grammars to syllabification in Romanian and provide arguments that they can also be used in a cognitive perspective.
Culture, Politeness and Directive Compliance
Authors: Christopher A. Miller, Peggy Wu, Vanessa Vakili, Tammy Ott, Kip Smith
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

We argue that traditional cultural factors models (from Hofstede, Nisbett, etc.) are too abstract to provide good predictions of important human performance behaviors such as directive compliance. Instead, we focus on culture-specific social interaction behaviors (i.e., "etiquette") as a bridge between abstract cultural factors and human performance. We describe a computational model of etiquette and politeness perception, called CECAEDA (Computational Effects of Cultural Attributes and Etiquette on Directive Adherence). CECAEDA consists of four parts: (1) a culturally universal model of politeness perceptions, their causes and effects, (2) a culturally universal cognitive model compliance decision making and behaviors, (3) a set of hypotheses about how politeness perceptions alter directive compliance, and (4) a set of hypotheses about how cultural factors (specifically, those proposed by Hofstede [1]) affect etiquette perceptions and, thus, directive compliance in culture-specific ways. Each component is discussed in detail, followed by a brief presentation of our research test bed and paradigm for evaluating CECAEDA.
Performance Analysis of IEEE 802.11 DCF in Multi-hop Ad Hoc Networks
Authors: Liying Xie, Gang Wei, Hongjiang Wang, Zaijin Xie
Venue: Proceedings of the 2009 Eigth IEEE/ACIS International Conference on Computer and Information Science (2009)

Analytic model is proposed to evaluate the packet delay, the delay jitter and the packet loss probability of IEEE 802.11 Distributed Coordination Function (DCF) in multi-hop Ad Hoc Networks. This model can also be easily extended to analyze the Enhanced Distributed Channel Access (EDCA). By modeling each node as a discrete time G/G/1 queue, the closed form expressions of the delay, the delay jitter and the packet loss probability in 802.11 DCF heterogeneous circumstances are derived. Simulation results agreed quite well with the analytical results. Based on this model, the impact of the maximum retransmission number and the minimum contention window on the performance of DCF is discussed. Analytical results suggest that the increase of the maximum retransmission number of one node decreases its packet loss probability dramatically, but has little influence on its delay and delay jitter and the performance of other nodes. Besides, the delay, the delay jitter and the packet loss probability of the tagged node increase and the packet loss probabilities of other nodes decrease slightly with the increase of the minimum contention window of the tagged node, but there is rare influence on the delay and the delay jitter of other nodes.
On deducing conditional independence from d-separation in causal graphs with feedback
Authors: Radford M. Neal
Venue: Journal of Artificial Intelligence Research (2000)

Pearl and Dechter (1996) claimed that the d-separation criterion for conditional independence in acyclic causal networks also applies to networks of discrete variables that have feedback cycles, provided that the variables of the system are uniquely determined by the random disturbances. I show by example that this is not true in general. Some condition stronger than uniqueness is needed, such as the existence of a causal dynamics guaranteed to lead to the unique solution.
A practice scaffolding interactive platform
Authors: Jeppe Bundsgaard
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

A Practice Scaffolding Interactive Platform (PracSIP) is a social learning platform which supports students in collaborative project based learning by simulating a professional practice. A PracSIP puts the core tools of the simulated practice at the students' disposal, it organizes collaboration, structures the students' activity, and interactively supports subject learning. A PracSIP facilitates students' development of complex competencies, and at the same time it supports the students' development of skills defined in the curriculum. The paper introduces the concept, presents the theoretical foundations, and gives an example of a PracSIP.
Boat Speed Monitoring Using Artificial Vision
Authors: Alberto Broggi, Pietro Cerri, Paolo Grisleri, Marco Paterlini
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

This paper describes a method to detect, measure the speed, and extract statistics of boats moving on a wide water surface using a single image stream taken from grayscale camera. The approach is based on a background subtraction technique combined with classification and tracking to improve robustness; it provides a stable detection even with sea waves and strong light reflections. The method returns correct speed values within the range ±5% in the 97% of use cases. The algorithm has been integrated in a speed warning prototype system on the Burano island in Venice, monitoring a 250 m wide channel slice. Images are captured by a high resolution camera and processed on site in real-time. Processing results can be accessed remotely for monitoring purposes. The system has been up and running for more than two years.
Improving a plan library for real-time systems using nearly orthogonal Latin hypercube sampling
Authors: Robert Holder
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 3 (2008)

Computing solutions to intractable planning problems is particularly problematic within real-time domains. One approach to this challenge includes off-line computation, such as precomputing a plan library. However, because complex domains preclude creating a comprehensive library, a system must choose a subset of all possible plans to include in the library. Strategic selections will reduce the probability that a system encounters a situation for which it does not have an appropriate plan in the library to either apply directly or adapt. Choosing variable values using Latin hypercubes is a technique used to reduce the number of test cases required in order to validate complex systems. Here we discuss the application of a variation of this technique, nearly orthogonal Latin hypercubes, to planning spaces in order reduce the number of plans a system must cache in its library.
A Combinatorial Test Suite Generator for Gray-Box Testing
Authors: Anthony Barrett, Daniel Dvorak
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

In black-box testing, the system being tested is typically characterized as a number of inputs, where each input can take one of a number of values. Thus each test is a vector of input settings, and the set of possible tests is an N dimensional space, where N is the number of inputs. For example, an instance of a simulation of a Crew Exploration Vehicle’s (CEV) launch pad abort scenario can have 76 floating-point inputs. Unfortunately, for such a large number of inputs only a small percentage of the test space can be actually tested. This paper characterizes levels of partial test space coverage and presents Testgen, a tool for generating a suite of tests that guarantees a level of test space coverage, which a user can adapt to take advantage of knowledge of system internals. This ability to adapt coverage makes Testgen a gray-box testing tool.
A Quick Classification for Area Environmental Audio Data Based on Local Search Tree
Authors: Ying Li
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

In area environment, various forms of life can exhale different kinds of audio signals, and these audio signals are closely related to a variety of organisms living environment and human activities. For analyzing these audio data automatically, local search data structure is proposed in this paper, that it is local search tree (LS-Tree), to classify audio data in the natural environment rapidly. Firstly, a technology for classification is brought forward in this paper using effective segment length of audio data (ESLOAD), frequency component of maximum harmonic weight (FCOMHW) and first order difference Mel-frequency cepstral coefficients matrix (D-MFCCM) in a segment. Secondly, a LS-Tree is pro- posed in this paper. ESLOAD and FCOMHW in segment are chose as main and second key for the LS-Tree respectively. Classification parameters are classified and managed through the LS-tree. Finally, through experiment of nine categories totally 107 normal audio data, it is indicated that the technique is effective to classify many kinds of audio data in the natural environment.
Blind identification of multiuser nonlinear channels using tensor decomposition and precoding
Authors: Carlos Alexandre Fernandes, Gérard Favier, João Cesar M. Mota
Venue: Signal Processing (2009)

This paper presents two blind identification methods for nonlinear memoryless channels in multiuser communication systems. These methods are based on the parallel factor (PARAFAC) decomposition of a tensor composed of channel output covariances. Such a decomposition is possible owing to a new precoding scheme developed for phase-shift keying (PSK) signals modeled as Markov chains. Some conditions on the transition probability matrices (TPM) of the Markov chains are established to introduce temporal correlation and satisfy statistical correlation constraints inducing the PARAFAC decomposition of the considered tensor. The proposed blind channel estimation algorithms are evaluated by means of computer simulations.
Automatic Testing and Measurement of QoE in IPTV Using Image and Video Comparison
Authors: José Valerdi, Antonio Gonzalez, Francisco J. Garrido
Venue: Proceedings of the 2009 Fourth International Conference on Digital Telecommunications (2009)

Orange Labs Spain, has developed a proof ofconcept aimed at exploring the possibility of automating the testsrequired by new evolutions of the IPTV service, and thusshortening the lifecycle and reducing the overall developmentcosts. It‘s based on an automaton that interacts with the set-top boxjust by emulating a human being (or tester): sending IR remotecontrol commands and analyzing the video output, as a set ofimage comparisons against a valid reference. The analysis unveileda future applicability of the same concept in objectively measuringthe QoE (Quality of Experience). Although there are techniquesand measuring equipment in the industry, they often mix QoS(Quality of Services) with QoE, and causes with effects. In ouranalysis, we propose to clearly separate QoE (as an effect) fromQoS (as possible causes), and also to split the contributions to QoEin those that occur in the preparation of the content (such as theencoding of VoDs (Video on Demand) in backoffice), and thosethat take place at the moment of content delivery itself. Finally, weconsider that the customer enviroment, , is an element that needs tobe considered as a critical part the loop of quality.. As aconclusion, we consider that managing and control the QoE is thefuture to improve the Customer Experience
Generation of referring expression with an individual imprint
Authors: Bernd Bohnet
Venue: Proceedings of the 12th European Workshop on Natural Language Generation (2009)

A major outcome of the last Shared Tasks for Referring Expressions Generation was that each human prefers distinct properties, syntax and lexical units for building referring expressions. One of the reasons for this seems to be that entities might be identified faster since the conversation partner has already some knowledge about how his conversation partner builds referring expressions. Therefore, artificial referring expressions should provide such individual preferences as well so that they become human like. With this contribution to the shared task, we follow this idea again. For the development set, we got a very good DICE score of 0.88 for the furniture domain and of 0.79 for the people domain.
BlenX Static and Dynamic Semantics
Authors: Corrado Priami, Paola Quaglia, Alessandro Romanel
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

We introduce a new programming language called BlenX. It is strongly inspired to process calculi and it is an evolution of Beta-binders. It has been specifically designed and implemented to model and simulate biological systems, but it is general enough to handle core computer science problems as well.