ppxscal/embedding_network huggingface dataset:
Community Created Narrations as Mobile Entertainment
Authors: Marjo Mäenpää, Riikka Kiljunen, Saija Mustaniemi
Venue: Proceedings of the 8th International Conference on Entertainment Computing (2009)

In this paper we describe short mobile video story tests that have been done by using several authors/ users as story composers in the MoViE platform, which enables users to share, communicate and compose short mobile video stories in a networked community. The starting point of our study is the possibility to create an entertaining, dramaturgically intensive and coherent story from various short mobile videos composed by several authors, if there is some structure or storyline that creates the narrative. The idea was to research how separately filmed mobile videos from the same event or experience could form a dramaturgically intensive story when they are loaded into a web based story generator (MoViE). The test hypothesis was that a community --- whether virtual or non virtual --- could create an entertaining experience through a video montage.
Designing an ASIP for Cryptographic Pairings over Barreto-Naehrig Curves
Authors: David Kammler, Diandian Zhang, Peter Schwabe, Hanno Scharwaechter, Markus Langenberg, Dominik Auras, Gerd Ascheid, Rudolf Mathar
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

This paper presents a design-space exploration of an application-specific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barreto-Naehrig curves (BN curves). Cryptographic pairings are based on elliptic curves over finite fields--in the case of BN curves a field $\mathbb{F}_p$ of large prime order p. Efficient arithmetic in these fields is crucial for fast computation of pairings. Moreover, computation of cryptographic pairings is much more complex than elliptic-curve cryptography (ECC) in general. Therefore, we facilitate programming of the proposed ASIP by providing a C compiler.In order to speed up $\mathbb{F}_p$ arithmetic, a RISC core is extended with additional scalable functional units. Because the resulting speedup can be limited by the memory throughput, utilization of multiple data-memory banks is proposed.The presented design needs 15.8 ms for the computation of the Optimal-Ate pairing over a 256-bit BN curve at 338 MHz implemented with a 130 nm standard cell library. The processor core consumes 97 kGates making it suitable for the use in embedded systems.
Night Vision - Reduced Driver Distraction, Improved Safety and Satisfaction
Authors: Klaus Fuchs, Bettina Abendroth, Ralph Bruder
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

Accidents in the dark in non-urban areas result in disproportionately high rates of pedestrians injuries (Hülsen 2003).This paper describes the methods and results of test drives with 39 test persons for the assessment of driver behavior in interacting with different Human-Machine-Interfaces (HMI) for Night Vision systems which inform drivers about the presence of pedestrians.Data of driver eye movements was analyzed to evaluate the different HMI designs of pedestrian alerts, in a passenger vehicle with Head-up-Display (HUD), regarding the ergonomic suitability and safety benefit.All systems were compared in field tests on public roads and on a test track.
Strongly Hamiltonian laceability of the even k-ary n-cube
Authors: Chien-Hung Huang
Venue: Computers and Electrical Engineering (2009)

The interconnection network considered in this paper is the k-ary n-cube that is an attractive variance of the well-known hypercube. Many interconnection networks can be viewed as the subclasses of the k-ary n-cubes include the cycle, the torus and the hypercube. A bipartite graph is Hamiltonian laceable if there exists a Hamiltonian path joining every two vertices which are in distinct partite sets. A bipartite graph G is strongly Hamiltonian laceable if it is Hamiltonian laceable and there exists a path of length N - 2 joining each pair of vertices in the same partite set, where N=|V(G)|. We prove that the k-ary n-cube is strongly Hamiltonian laceable for k is even and n>=2.
Bayesian predictive densities based on superharmonic priors for the 2-dimensional Wishart model
Authors: Fumiyasu Komaki
Venue: Journal of Multivariate Analysis (2009)

Bayesian predictive densities for the 2-dimensional Wishart model are investigated. The performance of predictive densities is evaluated by using the Kullback-Leibler divergence. It is proved that a Bayesian predictive density based on a prior exactly dominates that based on the Jeffreys prior if the prior density satisfies some geometric conditions. An orthogonally invariant prior is introduced and it is shown that the Bayesian predictive density based on the prior is minimax and dominates that based on the right invariant prior with respect to the triangular group.
Evolvable Hardware: From Applications to Implications for the Theory of Computation
Authors: Lukáš Sekanina
Venue: Proceedings of the 8th International Conference on Unconventional Computation (2009)

The paper surveys the fundamental principles of evolvable hardware, introduces main problems of the field and briefly describes the most successful applications. Although evolvable hardware is typically interpreted from the point of view of electrical engineering, the paper discusses the implications of evolvable hardware for the theory of computation. In particular, it is shown that it is not always possible to understand the evolved system as a computing mechanism if the evolution is conducted with real hardware in a loop. Moreover, it is impossible to describe a continuously evolving system using the computational scenario of a standard Turing machine.
Designing an Artificial Robotic Interaction Language
Authors: Omar Mubin, Christoph Bartneck, Loe Feijs
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

The project described hereunder focuses on the design and implementation of a "Artificial Robotic Interaction Language", where the research goal is to find a balance between the effort necessary from the user to learn a new language and the resulting benefit of optimized automatic speech recognition for a robot or a machine.
A Scheme of Rössler Chaotic Synchronization under Impulsive Control
Authors: Yingkui Li
Venue: Proceedings of the 2009 IITA International Conference on Services Science, Management and Engineering (2009)

Most properties of Rössler’s chaotic system satisfy with the requirements of secure communication and cryptography. Rössler’s Chaotic synchronization control can be the kernel technology in chaos-based secure commu-nication. In this paper we propose a hybrid Rössler chaotic synchronization control scheme which contains both continuous chaotic system and discrete chaotic system. It is impossible to reconstruct the whole system or estimate Rössler chaotic system‘s parameters. Lastly, we proved that two continuous systems can get synchronized without control signal transmitting.
The CALO Meeting Assistant
Authors: L. Lynn Voss, Patrick Ehlen
Venue: Proceedings of Human Language Technologies: The Annual Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations on XX (2007)

The CALO Meeting Assistant is an integrated, multimodal meeting assistant technology that captures speech, gestures, and multimodal data from multiparty interactions during meetings, and uses machine learning and robust discourse processing to provide a rich, browsable record of a meeting.
An Efficient and Scalable Address Autoconfiguration in Mobile Ad Hoc Networks
Authors: Syed Rafiul Hussain, Subrata Saha, Ashikur Rahman
Venue: Proceedings of the 8th International Conference on Ad-Hoc, Mobile and Wireless Networks (2009)

Several protocols of address autoconfiguration in the mobile ad hoc network (MANET) are present in the current literature. Although some of these protocols perform decently in sparse and small networks, but exhibit poor performance (e.g., single point of failure, storage limitation, large protocol overhead and so on) when the network is either dense or very large. In this paper, we propose an efficient and scalable address autoconfiguration protocol that automatically configures a network by assigning unique IP address to every node with low overhead and minimal cost. Evenly distributed Duplicate-IP Detection Servers are used to ensure the uniqueness of an IP address during IP address assignment session. In contrast to some other solutions, the proposed protocol does not exhibit any problems pertaining to leader election or centralized server-based solutions. Furthermore, grid based hierarchy is also used for efficient geographic forwarding as well as for selecting Duplicate-IP Detection Servers. Through simulation results we demonstrate scalability, robustness, low latency, fault tolerance and some other important aspects of our protocol.
Extracting Related Words from Anchor Text Clusters by Focusing on the Page Designer's Intention
Authors: Jianquan Liu, Hanxiong Chen, Kazutaka Furuse, Nobuo Ohbo
Venue: Proceedings of the 20th International Conference on Database and Expert Systems Applications (2009)

Approaches for extracting related words (terms) by co-occurrence work poorly sometimes. Two words frequently co-occurring in the same documents are considered related. However, they may not relate at all because they would have no common meanings nor similar semantics. We address this problem by considering the page designer's intention and propose a new model to extract related words. Our approach is based on the idea that the web page designers usually make the correlative hyperlinks appear in close zone on the browser. We developed a browser-based crawler to collect "geographically" near hyperlinks, then by clustering these hyperlinks based on their pixel coordinates, we extract related words which can well reflect the designer's intention. Experimental results show that our method can represent the intention of the web page designer in extremely high precision. Moreover, the experiments indicate that our extracting method can obtain related words in a high average precision.
Introducing the Pragmatic Architect
Authors: Frank Buschmann
Venue: IEEE Software (2009)

A clear understanding of the software architect's role is essential to design sustainable architectures. The first installment of the Pragmatic Architect column therefore outlines the software architect's mission and responsibilities, discusses how architects should act in a project, and investigates the skills and capabilities architects need to do their job well.
The Numerical Simulation of Conventional Ground Coalbed Methane Development
Authors: Lin Xiaoying, Liu Guowei, Su Xianbo
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

The migration, accumulation, and production of coalbed methane (CBM) are absolutely different from the conventional natural gas. The mechanism of the migration and production of CBM are researched and the geological model of CBM reservoir simulation is presented in this paper. The desorption, diffusion and percolation flow from matrix surface into wellbore are considered. This model introduced the Second Fick Law to consider the absorption and diffusion of CBM, and Darcy Law to consider the percolation flow of CBM. After that, this complex mathematical model is solved by using fully implicit finite difference method. At last, the model is applied for forecasting the gas and water production in the southern Qinshui Basin. The results indicated that the appropriate reduction of well spacing can relatively improve CBM development.
Automatic Extraction of Planetary Image Features
Authors: G. Troglio, J. A. Benediktsson, G. Troglio, G. Moser, S. B. Serpico, J. Le Moigne
Venue: Proceedings of the Third IEEE International Conference on Space Mission Challenges for Information Technology (2009)

With the launch of several Lunar missions such as the Lunar Reconnaissance Orbiter (LRO) and Chandrayaan-1, a large amount of Lunar images will be acquired and will need to be analyzed. Although many automatic feature extraction methods have been proposed and utilized for Earth remote sensing images, these methods are not always applicable to Lunar data that often present low contrast and uneven illumination characteristics. In this paper, we propose a new method for the extraction of features from the Lunar surface, based on the combination of several image processing techniques, including a watershed segmentation and the generalized Hough Transform. The method has many applications, among which image registration, and can be generalized to other planetary images as well.
Two types of nonlinear automata over a finite ring
Authors: V. V. Skobelev
Venue: Cybernetics and Systems Analysis (2009)

The structure of a class of automata is analyzed. These automata are analogs of symmetric chaotic dynamical systems over a finite ring, namely, the Guckenheimer---Holmes cycle and free-running systems. Problems of parametric identification and identification of initial states are solved, and a set of fixed points of automaton mappings is characterized.
A Probabilistic Reputation Algorithm for Decentralized Multi-Agent Environments
Authors: Mozhgan Tavakolifard, Svein J. Knapskog
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

The importance of trust in electronic transactions is well understood. The majority of current trust models consist of a central entity that verifies compliance with the trust requirements, using standardized evaluation methods and criteria. In decentralized environments, the communication scenarios are more complex, and no universally accepted objective requirements or evaluation criteria exist. It should be noted that the situation would get even more complicated when agents are interacting with each other. The goal of this research is to model trust and reputation in decentralized multi-agent systems. To achieve this, we have chosen the Ntropi model, among several other models, as a starting point, The efficiency of the model in such scenarios has been significantly improved by introducing a new probabilistic reputation algorithm for the Ntropi model.
Photodex ProShow: Visual QuickStart Guide, 1st edition
Authors: Jon Canfield
Venue:  (2009)

Photodex ProShow: Visual Quickstart Guide, in full color, leads readers through the process of creating stunning slide shows that can be viewed on computers, televisions, devices, and over the Internet. Whether the reader wants to create a show around their last vacation or professionals needing to create shows for weddings and other events, this task-based tutorial has it all. Both versions of ProShow 4 are covered in-detail: ProShow Gold and ProShow Producer.Photodex ProShow: Visual QuickStart Guide offers:Easy visual approach uses full color pictures to guide you through Photodex ProShow and show you what to do.Concise steps and explanations let you get up and running in no time.Page for page, the best content and value around.Companion Web site at www.proshowbook.com offers sample images, effects, and more.With ProShow users combine photos, videos, and music to create stunning slideshows. Users can create a unique and personalized photo slide show for any occasion whether it's a birthday, anniversary, graduation, holiday, wedding or just showing-off vacation photos. Even professionals use Proshow as it provides an elegant way to present photos and pitch clients. Built-in editing tools and effects make it easy to add borders to photos, crop and edit video and audio clips, pan and zoom, and add transition styles including dissolves, fades, wipes, and shapes. When it's time to output a show, Proshow offers many output options including DVD, Blu-ray, CD, the Web and dozens of devices like the iPod, iPhone, and Blackberry. You can even upload your slide shows directly to YouTube. 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
Learning sparse kernels from 3D surfaces for heart wall motion abnormality detection
Authors: Glenn Fung, Sriram Krishnan, R. Bharat Rao, Hui Chen
Venue: Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3 (2008)

Coronary heart disease (CHD) is a global epidemic that is the leading cause of death worldwide. CHD can be detected by measuring and scoring the regional and global motion of the left ventricle (LV) of the heart. This project describes a novel automatic technique which can detect the regional wall motion abnormalitie, of the LV from echocardiograms. Given a sequence of endocardial contours extracted from LV ultrasound images, the sequence of contours moving through time can be interpreted as a three-dimensional (3D) surface. From the 3D surfaces, we compute several geometry-based features (shape-index values, curvedness, surface normals, etc.) to obtain histograms-based similarity functions that are optimally combined using a mathematical programming approach to learn a kernel function designed to classify normal vs. abnormal heart wall motion. In contrast with other state-of-the-art methods, our formulation also generates sparse kernels. Kernel sparsity is directly related to the computational cost of the kernel evaluation, which is an important factor when designing classifiers that are part of a real-time system. Experimental results on a set of echocardiograms collected in routine clinical practice at one hospital demonstrate the potential of the proposed approach.
Exploring the process of convergent adaptation in technology-based science curriculum construction
Authors: Susan A. Yoon, Lei Liu, Sao-Ee Goh
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

As a core complex systems process, understanding the dynamics of individual or group adaptation can provide valuable information for constructing professional development strategies that can increase chances of instructional success. This paper reports on an exploratory study that identifies indicators of convergent vs. non-convergent adaptation between two cases of teachers working together on a technology-based curriculum construction activity and explores the relationship between group characteristics and adaptation processes. We have used the complex systems concept of adaptation as a lens for understanding how and why some teachers are better able to adapt to the educational program requirements. The results show that processes of convergence and nonconvergence influenced adaptive outcomes, and that the more similar the teaching characteristic index (TCI) number was between group members, the more likely it was that group dynamics would result in convergent adaptive outcomes.
Grounding with bounds
Authors: Johan Wittocx, Maarten Mariën, Marc Denecker
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 1 (2008)

Grounding is the task of reducing a first-order theory to an equivalent propositional one. Typical grounders work on a sentence-by-sentence level, substituting variables by domain elements and simplifying where possible. In this work, we propose a method for reasoning on the first-order theory as a whole to optimize the grounding process. Concretely, we develop an algorithm that computes bounds for subformulas. Such bounds indicate for which tuples the subformulas are certainly true and for which they are certainly false. These bounds can then be used by standard grounding algorithms to substantially reduce grounding sizes, and consequently also grounding times. We have implemented the method, and demonstrate its practical applicability.
Fusion Color Information for Image Thresholding Based Wavelet Transform
Authors: Zhi-Kai Huang, De-Hui Liu, Xing-Wang Zhang, Ling-Ying Hou
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

This paper presents a new global thresholding method based on wavelet fusion of color image sub-bands that we used for image segmentation. At first, a color image has been decomposed three sub-bands that R(red), G(green), B(blue) channel. Second, each sub-bands channel has been decomposed by discrete wavelet transform (DWT) to the same resolution. Third, fusion operation is performed on the transformed images according to some rule. Then all the decomposed sub-bands images are fused that becoming a simple 2-D image. Finally, Ostu’s thresholding methods applied for this 2-D image. Experimental results show that the proposed algorithm yields significantly superior image quality when it is compared to the other well-known algorithms.
A Novel Approach for Hardware Based Sound Classification
Authors: Mauricio Kugler, Victor Alberto Benso, Susumu Kuroyanagi, Akira Iwata
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

Several applications would emerge from the development of efficient and robust sound classification systems able to identify the nature of non-speech sound sources. This paper proposes a novel approach that combines a simple feature generation procedure, a supervised learning process and fewer parameters in order to obtain an efficient sound classification system solution in hardware. The system is based on the signal processing modules of a previously proposed sound processing system, which convert the input signal in spike trains. The feature generation method creates simple binary features vectors, used as the training data of a standard LVQ neural network. An output temporal layer uses the time information of the sound signals in order to eliminate the misclassifications of the classifier. The result is a robust, hardware friendly model for sound classification, presenting high accuracy for the eight sound source signals used on the experiments, while requiring small FPGA logic and memory resources.
Proceedings of the 2004 ACL Workshop on Discourse Annotation
Authors: Bonnie Webber, Donna Byron
Venue: ACL Workshops (2004)

This volume contains the papers accepted for presentation at the 2004 Workshop on Discourse Annotation, held in Barcelona, Spain, July 25 and 26, in conjunction with the International and the European Conferences of the ACL. Out of 24 papers submitted for review, 16 were selected for inclusion in the workshop proceedings.