ppxscal/embedding_network huggingface dataset:
A Formal Method for Analyzing Fair Exchange Protocols
Authors: Xu Wei, Ma Yan, Liu Nan, Wu Dong-ying
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

In the area of formal analyzing of security protocols, more and more attention has been given to analyzing properties of fair exchange protocols such as non-repudiation and fairness. On the basis of analyzing the limitations of existing methods, this paper presents a new method to analyze fairness and non-repudiation, in which PLTL are used to describe non-repudiation and fairness, and the model-check method is combined to analyze the properties. In this way, we can detect out one fairness flaw of fairZG protocol.
Knowledge Management in Distributed Software Development Teams - Does Culture Matter?
Authors: Alexander Boden, Gabriela Avram, Liam Bannon, Volker Wulf
Venue: Proceedings of the 2009 Fourth IEEE International Conference on Global Software Engineering (2009)

Software development requires complex context specific knowledge regarding the particularities of different technologies, the potential of existing software and the needs and expectations of the users. Hence, efficient knowledge management counts amongst the most important challenges for software teams. In international teams, one of the most important issues regarding knowledge sharing is the impact of culture under different aspects: national, organizational and professional. There seem to be very few studies dealing with the issue of culture in regard to knowledge management practices in GSE. We want to contribute to the discussion by presenting case studies of small size software teams dealing with international software development in the context of offshoring. In doing so, we illustrate how cultural and social issues influence the way knowledge exchange is performed by analyzing several knowledge management practices, considering the role of meetings, artifacts and tools, knowledge brokers and mutual visits between sites.
Depth Imaging by Combining Time-of-Flight and On-Demand Stereo
Authors: Uwe Hahne, Marc Alexa
Venue: Proceedings of the DAGM 2009 Workshop on Dynamic 3D Imaging (2009)

In this paper we present a framework for computing depth images at interactive rates. Our approach is based on combining time-of-flight (TOF) range data with stereo vision. We use a per-frame confidence map extracted from the TOF sensor data in two ways for improving the disparity estimation in the stereo part: first, together with the TOF range data for initializing and constraining the disparity range; and, second, together with the color image information for segmenting the data into depth continuous areas, enabling the use of adaptive windows for the disparity search. The resulting depth images are more accurate than from either of the sensors. In an example application we use the depth map to initialize the z-buffer so that virtual objects can be occluded by real objects in an augmented reality scenario.
Proposal of an Initial Route Establishment Method in Wireless Mesh Networks
Authors: Kazunori Ueda, Ken-ichi Baba
Venue: Proceedings of the 2009 Ninth Annual International Symposium on Applications and the Internet (2009)

Hybrid wireless mesh protocol (HWMP) is consists of on demand routing protocol RM-AODV and pro-active routing based on tree-base routing. When a mesh portal exists as a gateway of a wireless mesh network, tree-based routing is very efficient in fixed mesh deployments. However, with the distance vector routing method, all mesh points need route metrics based on the network topology and many packets are consumed to build the topology. To solve these problems, we define a new address space based on the link state and propose an initial route establishment method with greedy forwarding by using addresses as positional information. From simulations results, we confirmed that the proposed routing method can build the routing topology before the entire wireless mesh network is constructed and reduce the number of control packets for routing, and it also has scalability.
HI
Authors: Quan Long, Daniel MacArthur, Zemin Ning, Chris Tyler-Smith
Venue: Bioinformatics (2009)

Summary: We present a program to improve haplotype reconstruction by incorporating information from paired-end reads, and demonstrate its utility on simulated data. We find that given a fixed coverage, longer reads (implying fewer of them) are preferable. Availability: The executable and user manual can be freely downloaded from ftp://ftp.sanger.ac.uk/pub/zn1/HI. Contact: ql2@sanger.ac.uk
A Real-Time Occlusion Aware Hardware Structure for Disparity Map Computation
Authors: Christos Georgoulas, Ioannis Andreadis
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

Many machine vision applications deal with depth estimation in a scene. Disparity map recovery from a stereo image pair has been extensively studied by the computer vision community. Previous methods are mainly restricted to software based techniques on general-purpose architectures, presenting relatively high execution time due to the computationally complex algorithms involved. In this paper a new hardware module suitable for real-time disparity map computation module is realized. This enables a hardware based occlusion-aware parallel-pipelined design, implemented on a single FPGA device with a typical operating frequency of 511 MHz. It provides accurate disparity map computation at a rate of 768 frames per second, given a stereo image pair with a disparity range of 80 pixels and 640x480 pixel spatial resolution. The proposed method allows a fast disparity map computational module to be built, enabling a suitable module for real-time stereo vision applications.
An Empirical Study of Automatic Summarisation: Triangulated Formulaic Measurement and Subjective Impression in Automatic Summarisation
Authors: Shao Fen Liang
Venue:  (2009)

This research aimed to improve search engine result summaries to help internet users make quick and accurate relevance judgements. Term Order and Query Term Order(QTO) algorithms were developed in order to produce better search engine result summaries. Six sentence weighting schemes were constructed in different weighting components combinations with the aim of comparing the effectiveness between QTO and Query Term Frequency (QTF). The literature on automatic summarisation evaluation is classified into intrinsically motivated Gold Standard/Baseline and Subjective Scoring evaluations, and extrinsically motivated Task Based evaluation. In order to triangulate evidence of the usefulness of the QTO algorithm, Document Understanding Conference data was used for intrinsic evaluation and online English web data was used for both intrinsic and extrinsic evaluations. The QTO summarisation system was compared against that of Google. Representativeness, Judgeability and Scanning-Speed were the three tasks in the evaluations, and the summary quality was derived from the measurements of the three tasks. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Fast quantum codes based on Pauli block jacket matrices
Authors: Ying Guo, Jun Peng, Moon Ho Lee
Venue: Quantum Information Processing (2009)

Jacket matrices motivated by the center weight Hadamard matrices have played an important role in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a design approach for the Pauli block jacket matrix achieved by substituting some Pauli matrices for all elements of common matrices. Since, the well-known Pauli matrices have been widely utilized for quantum information processing, the large-order Pauli block jacket matrix that contains commutative row operations are investigated in detail. After that some special Abelian groups are elegantly generated from any independent rows of the yielded Pauli block jacket matrix. Finally, we show how the Pauli block jacket matrix can simplify the coding theory of quantum error-correction. The quantum codes we provide do not require the dual-containing constraint necessary for the standard quantum error-correction codes, thus allowing us to construct quantum codes of the large codeword length. The proposed codes can be constructed structurally by using the stabilizer formalism of Abelian groups whose generators are selected from the row operations of the Pauli block jacket matrix, and hence have advantages of being fast constructed with the asymptotically good behaviors.
Laboratory learning: industry and university research as site for situated and distributed cognition
Authors: Wendy Newstetter, Aditya Johri, Volker Wulf
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

In this symposium we present findings from qualitative studies of both university and industrial research laboratories, and their partnerships, to illuminate how learning takes place in these settings. Research laboratories are unique in providing a window on learning of content as well as learning to participate. Both kinds of learning are central to the functioning of the laboratory as an organization and to the growth of individual researchers within the laboratory. We highlight common themes across the different settings and showcase some of the differences that lead to different outcomes. We discuss institutional level as well as microinteractional level issues related to learning. The three studies that make up this session examine biomedical engineering, interactive media research, and applied computer science.
Developing network software and communications protocols towards the internet of things
Authors: Bilhanan Silverajan, Jarmo Harju
Venue: Proceedings of the Fourth International ICST Conference on COMmunication System softWAre and middlewaRE (2009)

One of the most profound changes today is the increase in mobility of portable yet powerful wireless devices capable of communicating via several different kinds of wireless radio networks of varying link-level characteristics. This paper addresses how the design and implementation of future applications and protocols can be facilitated by network programming frameworks. For the Internet of Things, upholding a clean layered network design while explicitly taking into account host capabilities, interfaces, device resources, device associations, multihoming, user policies and context management would impose many challenges for implementation support. The paper then presents a highly interoperable and lightweight event-based framework that serves many of these needs while also modelling, monitoring and handling events intrinsically present in communication architectures.
Rapid Inference of Object Rigidity and Reflectance Using Optic Flow
Authors: Di Zang, Katja Doerschner, Paul R. Schrater
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

Rigidity and reflectance are key object properties, important in their own rights, and they are key properties that stratify motion reconstruction algorithms. However, the inference of rigidity and reflectance are both difficult without additional information about the object's shape, the environment, or lighting. For humans, relative motions of object and observer provides rich information about object shape, rigidity, and reflectivity. We show that it is possible to detect rigid object motion for both specular and diffuse reflective surfaces using only optic flow, and that flow can distinguish specular and diffuse motion for rigid objects. Unlike nonrigid objects, optic flow fields for rigid moving surfaces are constrained by a global transformation, which can be detected using an optic flow matching procedure across time. In addition, using a Procrustes analysis of structure from motion reconstructed 3D points, we show how to classify specular from diffuse surfaces.
Implementing voting constraints with finite state transducers
Authors: Kemal Oflazer, Gökhan Tür
Venue: Proceedings of the International Workshop on Finite State Methods in Natural Language Processing (1998)

We describe a constraint-based morphological disambiguation system in which individual constraint rules vote on matching morphological parses followed by its implementation using finite state transducers. Voting constraint rules have a number of desirable properties: The outcome of the disambiguation is independent of the order of application of the local contextual constraint rules. Thus the rule developer is relieved from worrying about conflicting rule sequencing. The approach can also combine statistically and manually obtained constraints, and incorporate negative constraints that rule out certain patterns. The transducer implementation has a number of desirable properties compared to other finite state tagging and light parsing approaches, implemented with automata intersection. The most important of these is that since constraints do not remove parses there is no risk of an overzealous constraint "killing a sentence" by removing all parses of a token during intersection. After a description of our approach we present preliminary results from tagging the Wall Street Journal Corpus with this approach. With about 400 statistically derived constraints and about 570 manual constraints, we can attain an accuracy of 97.82% on the training corpus and 97.29% on the test corpus. We then describe a finite state implementation of our approach and discuss various related issues.
Non-stationary power signal classification using local linear radial basis function neural networks
Authors: B. Biswal, P. K. Dash, S. Mishra
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2009)

Our work provides an effective feature based method for analyzing both steady state and short duration non-stationary power signal disturbances using a Local Linear Radial Basis Function Neural Network (LLRBFNN). In contrast to the normalized probabilistic neural network (PNN), the proposed LLRBFNN is an excellent approximation network, which performs the classification task with minimal amount of computational power than probabilistic neural network (PNN). The difference of the LLRBFNN with conventional Radial Basis Function Neural Network (RBFNN) is that a local linear model replaces the connection of weights between the hidden layer and output layer of conventional RBFNN. Both normalized time domain and frequency domain features are used for the training purpose. It is noticed that spectral entropy is an effective frequency domain feature for non-stationary power signal classification. Moreover the local linear model provides a robust model for network learning, which is not prone to local linear points. This is supported by the observation that both the LLRBFNN model and the global search optimization techniques like Genetic algorithm provide similar results.
SnapCDP: A CDP System Based on LVM
Authors: Xiaoguang Liu, Gang Wang, Feng Wang, Yongzhi Song
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

Continuous Data Protection (CDP) is a kind of data protections technology with continuous recovery time points. It can resume data to the historical states as quickly as possible. Compared with traditional technologies, CDP can supply more flexible Recovery Point Objectives (RPO) and more actual Recovery Time Objectives (RTO).In this paper, a CDP system, named SnapCDP, is presented. SnapCDP embeds the continuous data protection mechanism into the Logical Volume Manager (LVM). The cycle-replace strategy for time point and meta data is used in SnapCDP. The experimental results show that SnapCDP can recovery the data to any time point which users set in advance with low storage space.
The process of digital formalization in sociotechnical learning communities: needed or overloaded?
Authors: Isa Jahnke
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

The Web 2.0 is often characterized by an informal participation, which means a free cooperation of as many as possible without any restraints from organizations, processes, or technical platforms. In contrast to public communities, an official organization like a company consists of rather formal structures which define what a member should do and how to fulfill a task by assigning a role. If such a formal organization supports a community, does the balance between informal and formal structures will change? This short paper presents the results of a field study about a socio-technical community called 'InPUD' which is part of a faculty. The main conclusion is that a specific degree of digital formalization in online groups is needed for successful online structures and sustainability. By using new media like Web 2.0, the balance between informal and formal structures in institutions will be changed.
Machine learning for automatic mapping of planetary surfaces
Authors: Tomasz F. Stepinski, Soumya Ghosh, Ricardo Vilalta
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

We describe an application of machine learning to the problem of geomorphic mapping of planetary surfaces. Mapping landforms on planetary surfaces is an important task and the first step to deepen our understanding of many geologic processes. Until now such maps have heen manually drawn by a domain expert. We describe a framework to automate the mapping process by meam of segmentation and classification of landscape datasets. We propose and implement a number of extensions to the existing methodology with particular emphasis on the incorporation of machine learning techniques. These extensions result in a robust and practical mapping system that we apply on six sites on Mars. Support Vector Machines show the best mapping results with an accuracy rate of ∼ 91%. The resultant maps reflect the geomorphology of the sites and have appearance reminiscent of traditional, manually drawn maps. The system is capable of mapping numerous sites using a limited training set. Immediate and eventual applications of this automated mapping system are discussed in the context of planetary science and other domains.
Symmetric Laplace transform and its application to parametric identification of linear systems
Authors: B. O. Kachanov
Venue: Automation and Remote Control (2009)

Properties of bilateral symmetric integral transform, which possesses useful features for identification of linear systems, are investigated. Relationships for covariance functions of stochastic stationary processes of measurement errors and disturbances are determined. The optimal solution is proposed to the identification problem for linear multivariable system with measured state coordinates in the transformation parameter domain, with account for restricted bandwidth of dynamic processes in the system at hand. The problem is solved for unknown initial state of the system and complex measurement errors including correlated noise, constant errors and linear trends.
Predicting risk from financial reports with regression
Authors: Shimon Kogan, Dimitry Levin, Bryan R. Routledge, Jacob S. Sagi, Noah A. Smith
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We address a text regression problem: given a piece of text, predict a real-world continuous quantity associated with the text's meaning. In this work, the text is an SEC-mandated financial report published annually by a publicly-traded company, and the quantity to be predicted is volatility of stock returns, an empirical measure of financial risk. We apply well-known regression techniques to a large corpus of freely available financial reports, constructing regression models of volatility for the period following a report. Our models rival past volatility (a strong baseline) in predicting the target variable, and a single model that uses both can significantly outperform past volatility. Interestingly, our approach is more accurate for reports after the passage of the Sarbanes-Oxley Act of 2002, giving some evidence for the success of that legislation in making financial reports more informative.
Usability-Engineering-Requirements as a Basis for the Integration with Software Engineering
Authors: Karsten Nebe, Volker Paelke
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Usability is growing to become an integral quality aspect of software development, but it is not an exclusive attribute of the generated product; it is also a fundamental attribute for the development process itself. The question is how to adapt software engineering processes (or models) in such a way that they can ensure the development of usable solutions. In this paper, the authors present an integration approach pursuing this goal. It draws on so called `Compliancy and Key Requirements' that can be used for the definition of software processes (or process models) and thereby support the integration of both disciplines. The requirements are based upon representative standards (DIN ISO 13407 and ISO/PAS 18152) but were enhanced by the results of an expert based survey using interviews and questionnaires. Additionally the requirements have been verified by experts and represent an evaluated knowledge base for the development of usable products.
Fostering Students' Participation in Face-to-Face Interactions and Deepening Their Understanding by Integrating Personal and Shared Spaces
Authors: Etsuji Yamaguchi, Shigenori Inagaki, Masanori Sugimoto, Fusako Kusunoki, Akiko Deguchi, Yuichiro Takeuchi, Takao Seki, Sanae Tachibana, Tomokazu Yamamoto
Venue: Transactions on Edutainment II (2009)

In this research, we introduced CarettaKids into the social context of a classroom environment to evaluate whether integration of personal and shared spaces can help promote students' participation in synchronous/co-located interactions in the classroom and deepen their understanding of subject matter. Analysis of videotaped interactions and pre- and posttests clarified the following three points. (1) Students who used CarettaKids presented the simulation results and rules for object arrangement they worked out individually in their respective personal space, by using CarettaKids' function of projecting object arrangements and simulation results from a personal digital assistant onto a sensing board. (2) Many of the students who used CarettaKids examined individually generated ideas collaboratively in the shared space. The patterns of collaborative examination are: (a) Induce a rule for object arrangement from object arrangements devised in personal spaces; (b) Deduce a new object arrangement from the rules discovered in the personal spaces; and (c) Refine the rules discovered in the personal spaces through group discussion. (3) Students who used CarettaKids not only considered all of the three factors, i.e. residential area, industrial area and forest area, but also understood relations between these factors, thereby deepening their understanding of city planning that takes environmental and financial aspects into consideration. We suggest that the degree to which students deepen their understanding is affected by the presence or absence of collaborative examination of individually generated ideas in the shared space.