ppxscal/embedding_network huggingface dataset:
Social impact in technologically-mediated communication: An examination of online influence
Authors: Michael D. Miller, C. Cryss Brunner
Venue: Computers in Human Behavior (2008)

This study used Social Impact Theory to explore sources and functions of interpersonal influence in Computer-Mediated Communication. Participants were 43 female and 17 male graduate students ranging from 25 to 60 years of age. In each of five distinct graduate classes (n"1=15, n"2=11, n"3=10, n"4=12, n"5=12) delivered online at a research university, participants engaged in anonymous and computer-mediated discourse and then nominated peers who were directive and/or influential (positive and negative) during the online interaction. High numbers of peer nominations were expected to characterize participants perceived as emanating social impact. Four interpersonal factors were chosen as strength operants in accordance with Social Impact Theory and were, therefore, expected to predict social impact. Of the four, assertiveness and exaggeration were significant, while emotional intensity and sensitivity were not. Two factors, contribution total and word total, were chosen as immediacy operants in accordance with Social Impact Theory. Both factors were found to be significant predictors of social impact. Implications of these findings relative to online learning and interpersonal influence as it occurs in an online context are discussed.
Research on Routing Protocol for Shallow Underwater Acoustic Ad Hoc Network
Authors: En Cheng, Yuan Qi, Bo Sun, Ziming Zhuang, Jie Deng
Venue: Proceedings of the 2008 ISECS International Colloquium on Computing, Communication, Control, and Management - Volume 02 (2008)

As UWA technology develops, ad hoc applied in UWA shows ascending predominance. The physical properties of acoustic channels essentially differ from those of conventional wireless communication channels. Its unknown and complicated channel condition motives research and redesign of existed protocols of wireless networks. This paper based on the investigation of the differences between UWA ad hoc network and normal wireless ad hoc network, and the acquaintance with the functions and characteristics of all kinds of ad hoc routing protocols with focusing on the network layer of ad hoc OSI model. Finally we chose the most suitable ad hoc routing protocol for shallow UWA environment─DSR, then used OPNET to design the model and simulated it in this environment. DSR shows great performance in terms of reliability, routing overhead, and path optimality because of its cache mechanism and source routing mechanism, yet it needs to be improved in throughput and long propagation delays.
Multiple re-watermarking using varying non-stationary mra with parameterized wavelet filters
Authors: Jutta Hämmerle-Uhl, Andreas Uhl, Hartmut Wernisch
Venue: Proceedings of the 10th ACM workshop on Multimedia and security (2008)

Non-stationary Multiresolution Analysis is shown to be a possible means to limit watermark interference in multiple re-watermarking algorithms if employing a different set of wavelet filters for each watermark embedded. It turns out that a significant improvement of watermark detection correlation values may be achieved in such a scenario and a surprisingly high number of watermarks can be embedded using standard wavelet-based embedding strategies.
Visualization of Program Behaviors: Physical Robots Versus Robot Simulators
Authors: Cheng-Chih Wu, I-Chih Tseng, Shih-Lung Huang
Venue: Proceedings of the 3rd international conference on Informatics in Secondary Schools - Evolution and Perspectives: Informatics Education - Supporting Computational Thinking (2008)

This study compared the effects of using physical robots (LEGO Mindstorms) and robot simulators (LEGO Mindstorms Simulator, LMS) in teaching novice programming concepts. A quasi-experiment design was implemented in this study. Four classes of high school students, totaling 151 students, participated in the study. Two classes of 76 students used the physical robots to learn programming, whereas the other two classes of 75 students used LMS. The students' post-experiment achievement tests, replies on questionnaires, and focus group interview data were collected and analyzed. The findings of the study were: (1) no significant difference was found on students' performance between the physical robot group and the simulator group, (2) the physical robot group demonstrated more positive attitudes toward the learning activities, and (3) the physical robot group indicated that they could better imagine the program behaviors.
A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
Authors: Gábor Bergmann, Ákos Horváth, István Ráth, Dániel Varró
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

In graph transformation, the most cost-intensive phase of a transformation execution is pattern matching, where those subgraphs of a model graph are identified and matched which satisfy constraints prescribed by graph patterns. Incremental pattern matching aims to improve the efficiency of this critical step by storing the set of matches of a graph transformation rule and incrementally maintaining it as the model changes, thus eliminating the need of recalculating existing matches of a pattern. In this paper, we propose benchmark examples where incremental pattern matching is expected to have advantageous effect in the application domain of model simulation and model synchronization. Moreover, we compare the incremental graph pattern matching approach of Viatra2 with advanced non-incremental local-search based graph pattern matching approaches (as available in Viatra2 and GrGen).
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Authors: Christian Bachmaier, Wolfgang Brunner
Venue: Proceedings of the 16th annual European symposium on Algorithms (2008)

A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and occur in many areas, e. g., in scheduling problems and program inheritance structures.In this paper we extend level graphs to cyclic level graphs. Such graphs occur as repeating processes in cyclic scheduling, visual data mining, life sciences, and VLSI. We provide a complete study of strongly connected cyclic level graphs. In particular, we present a linear time algorithm for the planarity testing and embedding problem, and we characterize forbidden subgraphs. Our results generalize earlier work on level graphs.
Improve Image Annotation by Combining Multiple Models
Authors: Peng Huang, Jiajun Bu, Chun Chen, Kangmiao Liu, Guang Qiu
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

Automatic image annotation is a promising methodology for image retrieval. However most current annotation models are not yet sophisticated enough to produce high quality annotations. Given an image, some irrelevant keywords to image contents are produced, which are a primary obstacle to getting high-quality image retrieval. In this paper an approach is proposed to improve automatic image annotationin two directions. One is to combine annotation keywords produced by underlying three classic image annotation models of Translation Model, Continuous-space Relevance Model and Multiple Bernoulli Relevance Models, hoping to increase the number of potential correctly annotated keywords. Another is to remove irrelevant keywords to image semantics based on semantic similarity calculation using WordNet. To verify the proposed hybrid annotation model, we carried out the experiments on the widely used Corel Image Data set, and the reported experimental results showed that the proposed approach improved image annotation to some extent.
Automatic Classification Video for Person Indexing
Authors: Jiang Peng, Qin Xiao Lin
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

Person retrieval and indexing in video sequences is a challenging task for many multimedia applications. This paper proposes a new method that index the person based on the similarity. Firstly, the persons in a shot are detected and tracked through face detector and continuously adaptive mean shift algorithm. Then mid-level features such as clothes colors and voice are applied to represent the person. An unsupervised cluster method is performed to cluster the person for further indexing. At last, the cluster is validated and refined by the voice feature. Experimental results of proposed method are presented, and the method has been found to be effective.
Inferring Location Names for Geographic Information Retrieval
Authors: Johannes Leveling, Sven Hartrumpf
Venue: Advances in Multilingual and Multimodal Information Retrieval: 8th Workshop of the Cross-Language Evaluation Forum, CLEF 2007, Budapest, Hungary, September 19-21, 2007, Revised Selected Papers (2008)

For the participation of GIRSA at the GeoCLEF 2007 task, two innovative features were introduced to the geographic information retrieval (GIR) system: identification and normalization of location indicators, i.e. text segments from which a geographic scope can be inferred, and the application of techniques from question answering. In an extension of a previously performed experiment, the latter approach was combined with an approach using semantic networks for geographic retrieval. When using the topic title and description, the best performance was achieved by the combination of approaches (0.196 mean average precision, MAP); adding location names from the narrative part increased MAP to 0.258. Results indicate that 1) employing normalized location indicators improves MAP significantly and increases the number of relevant documents found; 2) additional location names from the narrative increase MAP and recall, and 3) the semantic network approach has a high initial precision and even adds some relevant documents which were previously not found. For the bilingual experiments, English queries were translated into German by the Promt machine translation web service. Performance for these experiments is generally lower. The baseline experiment (0.114 MAP) is clearly outperformed, achieving the best performance for a setup using title, description, and narrative (0.209 MAP).
An Adaptive Multi Pattern Scheme for Fast Block Motion Estimation
Authors: Humaira Nisar, Tae-Sun Choi
Venue: Proceedings of the international conference on Computational Science and Its Applications, Part II (2008)

A simple, adaptive, computationally efficient and robust scheme for multi pattern block motion estimation has been proposed. A combination of spatial and temporal predictors has been used for multiple initial search center prediction, determination of magnitude of motion and multiple search pattern selection. The multiple initial predictors help to identify the absolute zero motion blocks and true location of global minimum based on the characteristic of unimodal error surfaces. Hence the final predictive search center selected is closer to the global minimum thus decreases the effect of monotonic error surface assumption and its impact on the motion field. This also increases the computation speed. Further computational speed up has been obtained by considering half stop technique and threshold for minimum distortion point. The computational complexity of the proposed algorithm is drastically decreased (average speedup ~ 43%) whereas the image quality measured in terms of PSNR also shows results close to Full Search algorithm.
Learning Rational Stochastic Tree Languages
Authors: François Denis, Amaury Habrard
Venue: Proceedings of the 18th international conference on Algorithmic Learning Theory (2007)

We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees $T({\cal F})$, from a sample of trees independently drawn according to an unknown target P. We consider the case where the target is a rational stochastic tree language, i.e. it can be computed by a rational tree series or, equivalently, by a multiplicity tree automaton. In this paper, we provide two contributions. First, we show that rational tree series admit a canonical representation with parameters that can be efficiently estimated from samples. Then, we give an inference algorithm that identifies the class of rational stochastic tree languages in the limit with probability one.
Integrating Action Calculi and Description Logics
Authors: Conrad Drescher, Michael Thielscher
Venue: Proceedings of the 30th annual German conference on Advances in Artificial Intelligence (2007)

General action languages, like e.g. the Situation Calculus, use full classical logic to represent knowledge of actions and their effects in dynamic domains. Description Logics, on the other hand, have been developed to represent static knowledge with the help of decidable subsets of first order logic. In this paper, we show how to use Description Logic as the basis for a decidable yet still expressive action formalism. To this end, we use ABoxes as decidable state descriptions in the basic Fluent Calculus. As a second contribution, we thus obtain an independent semantics --- based on a general action formalism --- for a recent method for ABox-Update.
Hybrid Adaptative System of Gas Concentration Prediction in Hard-Coal Mines
Authors: Marek Sikora, Zdzislaw Krzystanek, Bozena Bojko, Karol Spiechowicz
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

Hybrid and adaptative system of gas concentration prediction in hard-coal mines is presented in the paper. The system widens functionality of the SMP-NT system which monitors gas concentration in mining excavations based on data collected from sensors. The SMP-NT system has also ability to automatic cut off electric energy in the case of explosion risk identification. A task of the prediction system described in the paper is to anticipate hazards due time in advance. A first part of the prediction system uses linear and nonlinear prediction methods. Moreover it makes use of a solution of metalearning type which negotiates the system final forecast between linear and nonlinear methods. A second part of the system uses knowledge base of typical situations that lead to explosion or fire risk increase. Thanks to Dynamic Time Warping methodology, continuous monitoring of methane and other gases concentration time series is conducted from the current time series similarity to dangerous situations point of view.
A Procedure Ontology for Advanced Diagnosis of Process Systems
Authors: Katalin M. Hangos, Erzsébet Németh, Rozália Lakner
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

An ontology for representing operation, safety and control procedures is proposed in this paper that supports diagnosis based on following these procedures and combining observed malfunctions with Failure Mode and Effects Analysis (FMEA) information. The procedure ontology is defined within interconnected components of the process plant, diagnostic analysis (where the FMEA is described) and procedures. The proposed method is illustrated on a simple operating procedure.
Intelligent FDI system for an aircraft execution element
Authors: Octavian Grigore-Müler
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The appearance of faults in a complex control system is unavoidable, especially for the systems onboard aircraft intended to perform a quick detection, identification and diagnosis of failures in order to avoid disasters. In this paper a fuzzy FDI system for an execution element of a B747 longitudinal flight control system (LFCS) is illustrated.
The empirical quest for π
Authors: Terence Tai-Leung Chong
Venue: Computers Mathematics with Applications (2008)

This paper proposes a statistical method to obtain the value of @p from empirical economic and financial data. It is the first study ever to link @p to human behavior. It is shown that virtually any economic time series, such as stock indices, exchange rates and the GDP data can be used to retrieve the value of @p.
Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)
Authors: David Hartvigsen, Yanjun Li
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

A simple 2-matching in an edge-weighted graph is a subgraph all of whose vertices have degree 1 or 2. We consider the problem of finding a maximum weight simple 2-matching that contains no triangles, which is closely related to a class of relaxations of the TSP. Our main results are, for graphs with maximum degree 3, a complete description of the convex hull of incidence vectors of triangle-free simple 2-matchings and a strongly polynomial time algorithm for the above problem. Our system requires the use of a type of comb inequality (introduced by Grötschel and Padberg for the TSP polytope) that has {0,1,2}-coefficients and hence is more general than the well-known blossom inequality used in Edmonds' characterization of the simple 2-matching polytope.
Modeling, Learning and Simulating Biological Cells with Entity Grammar
Authors: Yun Wang, Rao Zheng, Yan-Jiang Qiao
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In recent years, whole cell modeling approaches, which combine existing knowledge and machine learning results, have received considerable attention. These approaches are potentially very efficient for simulating and analyzing physiological function of cells. In this work, entity grammar system is proposed as formalism for knowledge representation and multistratgy learning techniques in systems biology. Modeling biological cells with entity grammar starts from the simple grammatical models. Integrating the simple models into a cooperating entity grammar of cell facilitates real-time model learning and updating. This makes a difference with many other formalisms to build preset models. The scheme of such a platform is described in the paper and the possible applications are discussed. The proposed formalism method is open to all reasoning paradigm and can be used for studying biological complex systems.
Plenary lecture I: an agent and virtual reality based online course delivery system
Authors: M. Nasseh Tabrizi
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

The Virtual Reality (VR) technology used in this project comprise an emerging medium demonstrated in many areas already familiar to today's students, such as computer games, entertainment systems, and visualization. We believe that existing online course delivery systems are not capable of giving high-quality interactive lecture content, and that existing systems are quite labor-intensive for the faculty member, a true barrier to DE development. Tabrizi's Agent and Virtual Reality (AVR) system is designed to provide the instructor an environment to teach in the virtual setting similar to the face-to-face classroom. The instructor teaches using the uniquely designed whiteboard and PowerPoint slide presentation both integrated in the VR environment. The virtual classroom's message board allows student/instructor interaction and communication to take place. The students observe the online lecture in VR class resembling a face-to-face classroom. The students can (individually) look around, can observe the lecture, and adjust the environment to suit their personality. Moreover, the students can use the message board (integrated within the classroom) to interact with others participants in our virtual classroom. The VR system's strengths are: • The students' interface will enable re-generation of the 3D environment resembling real face-to-face classroom. The bandwidth requirement is reduced significantly, ensuring the functionality of the system in areas with slow network infrastructure. Students can interrupt the teacher and ask questions in a manner that mimics the traditional classroom. The lectures and discussion can be archived for students to reference in the future. The technology goals for this project include implementation and evaluation of non-traditional systems that redefine the role of technology in learning. Delivering lectures using the AVR system will result in the creation of a virtual world to enhance and enrich the learning experience of distance education students by creating real-time lecture and class discussion. This will further be deliverable in low-bandwidth rural areas of the country.
Optimal Placements in Ring Network for Data Replicas in Distributed Database with Majority Voting Protocol
Authors: Zhao Zhang, Weili Wu, Shashi Shekhar
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

In a distributed database system, data replicas are placed at different locations to achieve high data availability in the presence of link failures. With majority voting protocol, a location is survived for read/write operations if and only if it is accessible to more than half of the replicas. The problem is to find out the optimal placements for a given number of data replicas in a ring network. When the number of replicas is odd, it was conjectured by Hu et al. that every uniform placement is optimal, which is proved by Shekhar and Wu later. However, when the number of replicas is even, it was pointed out by Hu et al. that uniform placements are not optimal and the optimal placement problem may be very complicated. In this paper, we study the optimal placement problem in a ring network with majority voting protocol and even number of replicas, and give a complete characterization of optimal placements when the number of replicas is not too large compared with the number of locations.