ppxscal/embedding_network huggingface dataset:
Generating useful network-based features for analyzing social networks
Authors: Jun Karamon, Yutaka Matsuo, Mitsuru Ishizuka
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Recently, many Web services such as social networking services, blogs, and collaborative tagging have become widely popular. Many attempts are being made to investigate user interactions by analyzing social networks among users. However, analyzing a social network with attributional data is often not an easy task because numerous ways exist to define features through aggregation of different tables. In this study, we propose an algorithm to identify important network-based features systematically from a given social network to analyze user behavior efficiently and to expand the services. We apply our method for link-based classification and link prediction tasks with two different datasets, i.e., an @cosme (an online viral marketing site) dataset and a Hatena Bookmark (collaborative tagging service) dataset, to demonstrate the usefulness of our algorithm. Our algorithm is general and can provide useful network-based features for social network analyses.
UbiBand: A Framework for Music Composition with BSNs
Authors: Sarit Chantasuban, Surapa Thiemjarus
Venue: Proceedings of the 2009 Sixth International Workshop on Wearable and Implantable Body Sensor Networks (2009)

This paper presents a conceptual framework, as well as a software platform for assisting the development of sensor enabled music generation using Body Sensor Networks (BSNs). It provides a summary of key considerations that should be taken into account during the development of a motion-generated music application and presents the initial software prototype. A set of mapping rules for real-time BSN-based percussion kit has been proposed and used to demonstrate the practical value of the proposed framework design.
Induction of a stem lexicon for two-level morphological analysis
Authors: Erika F. de Lima
Venue: Proceedings of the Joint Conferences on New Methods in Language Processing and Computational Natural Language Learning (1998)

A method is described to automatically acquire from text corpora a Portuguese stem lexicon for two-level morphological analysis. It makes use of a lexical transducer to generate all possible stems for a given unknown inflected word form, and the EM algorithm to rank alternative stems.
Segmentation, Tracking and Characterization of Solar Features from EIT Solar Corona Images
Authors: Vincent Barra, Véronique Delouille, Jean-Francois Hochedez
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

With the multiplication of sensors and instruments, size, amount and quality of solar image data are constantly increasing, and analyzing this data requires defining and implementing accurate and reliable algorithms. In the context of solar features analysis, it is particularly important to accurately delineate their edges and track their motion, to estimate quantitative indices and analyse their evolution through time. Herein, we introduce an image processing pipeline that segment, track and quantify solar features from a set of multispectral solar corona images, taken with eit EIT instrument. We demonstrate the method on the automatic tracking of Active Regions from EIT images, and on the analysis of the spatial distribution of coronal bright points. The method is generic enough to allow the study of any solar feature, provided it can be segmented from EIT images or other sources.
A Study on IOS Innovation, Interfirm Reengineering and Cooperation Performance
Authors: Luchuan Liu, Guopeng Yin
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

The information system transcending enterprise boundaries and shared by two or more enterprises is defined as Inter-Organizational Information System, IOS for short. Interfirm Process Reengineering is a logical extension of the business process innovation inside a firm. The paper presents a model of relationship among IOS Innovation, Interfirm Process Reengineering and cooperation performance. Taking two China's successful IOS cases as study object, The paper investigate interfirm business process innovation made by IOS from four aspect.namely, integration, transfer, elimination and creation of inter-firm business processes. The model has been testified by the fact in the cases.
Development of Portable Robotic Operation Terminals to Achieve Increased Safety and Usability and a Study on the Effectiveness of Wireless Terminals
Authors: Hidetoshi Fukui, Satoshi Yonejima, Masatake Yamano, Masao Dohi, Tomonori Nishiki, Mariko Yamada, Toshihiro Fujita
Venue: Proceedings of the International Conference on Ergonomics and Health Aspects of Work with Computers: Held as Part of HCI International 2009 (2009)

In factory automation (FA) industry, it is essential for the working environment using industrial robots to be provided with measures that assure operator's safety and good usability of machines. We have studied the operator's safety and usability of portable robotic operation terminals, and have developed the standardized terminals for one-hand operation suitable to many types of applications. The find`ings and knowledge we obtained through the development materialized recently as the new two-hand portable robotic operation terminal which is designed ergonomically. In this paper, we report on the new operation terminal which provides excellent operational safety and usability, and also a study on the effectiveness of wireless terminals for improving the usability of entire system.
WIT: web people search disambiguation using random walks
Authors: José Iria, Lei Xia, Ziqi Zhang
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper, we describe our work on a random walks-based approach to disambiguating people in web search results, and the implementation of a system that supports such approach, which we used to participate at Semeval'07 Web People Search task.
Probability of Random Correspondence for Fingerprints
Authors: Chang Su, Sargur N. Srihari
Venue: Proceedings of the 3rd International Workshop on Computational Forensics (2009)

Individuality of fingerprints can be quantified by computing the probabilistic metrics for measuring the degree of fingerprint individuality. In this paper, we present a novel individuality evaluation approach to estimate the probability of random correspondence (PRC). Three generative models are developed respectively to represent the distribution of fingerprint features: ridge flow, minutiae and minutiae together with ridge points. A mathematical model that computes the PRCs are derived based on the generative models. Three metrics are discussed in this paper: (i) PRC of two samples, (ii) PRC among a random set of n samples (nPRC) and (iii) PRC between a specific sample among n others (specific nPRC). Experimental results show that the theoretical estimates of fingerprint individuality using our model consistently follow the empirical values based on the NIST4 database.
Assigning Blame: Mapping Performance to High Level Parallel Programming Abstractions
Authors: Nick Rutar, Jeffrey K. Hollingsworth
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

Parallel programs are increasingly being written using programming frameworks and other environments that allow parallel constructs to be programmed with greater ease. The data structures used allow the modeling of complex mathematical structures like linear systems and partial differential equations using high-level programming abstractions. While this allows programmers to model complex systems in a more intuitive way, it also makes the debugging and profiling of these systems more difficult due to the complexity of mapping these high level abstractions down to the low level parallel programming constructs. This work discusses mapping mechanisms, called variable blame, for creating these mappings and using them to assist in the profiling and debugging of programs created using advanced parallel programming techniques. We also include an example of a prototype implementation of the system profiling three programs.
Exploiting Unix File-System Races via Algorithmic Complexity Attacks
Authors: Xiang Cai, Yuwei Gui, Rob Johnson
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

We defeat two proposed Unix file-system race condition defense mechanisms. First, we attack the probabilistic defense mechanism of Tsafrir, et al., published at USENIX FAST 2008. We then show that the same attack breaks the kernel-based dynamic race detector of Tsyrklevich and Yee, published at USENIX Security 2003. We then argue that all kernel-based dynamic race detectors must have a model of the programs they protect or provide imperfect protection. The techniques we develop for performing these attacks work on multiple Unix operating systems, on uni- and multi-processors, and are useful for exploiting most Unix file-system races. We conclude that programmers should use provably-secure methods for avoiding race conditions when accessing the file-system.
Weighted DFT Based Blur Invariants for Pattern Recognition
Authors: Ville Ojansivu, Janne Heikkilä
Venue: Proceedings of the 16th Scandinavian Conference on Image Analysis (2009)

Recognition of patterns in blurred images can be achieved without deblurring of the images by using image features that are invariant to blur. All known blur invariants are based either on image moments or Fourier phase. In this paper, we introduce a method that improves the results obtained by existing state of the art blur invariant Fourier domain features. In this method, the invariants are weighted according to their reliability, which is proportional to their estimated signal-to-noise ratio. Because the invariants are non-linear functions of the image data, we apply a linearization scheme to estimate their noise covariance matrix, which is used for computation of the weighted distance between the images in classification. We applied similar weighting scheme to blur and blur-translation invariant features in the Fourier domain. For illustration we did experiments also with other Fourier and spatial domain features with and without weighting. In the experiments, the classification accuracy of the Fourier domain invariants was increased by up to 20 % through the use of weighting.
Automatic Super Finish Characterizations on Screw Surfaces
Authors: P. S. Pa
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

An effectively automotive control system of super finish module that employs an electrode connecting with a nonconductive grinding-tool as a finish-tool to execute the automatic continuity finish processes of grinding and pulsed electrofinishing (GPE) following thread cutting is developed in the current study. Through simple equipment attachment, the continuity finish processes can follow the cutting on the same machine and chuck. The results show that using an adequate rotational speed of the workpiece along with a high rotational speed of the finish-tool is advantageous to the finish effect. Pulsed direct current with a longer off-time can slightly improve the finish effect for its dregs discharge mobility. The design change of the finish-tool, from a full circumstance borer tip on the leading edge of the cylinder to a thin plate form on one side of the borer tip, causes the products’ finish and heat brought away from the product to increase more rapidly and gives the best finish performance in the current investigation.
A dependency-based word subsequence kernel
Authors: Rohit J. Kate
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very efficient algorithm to compute it. This kernel is also an improvement over the word subsequence kernel because it only counts linguistically meaningful word subsequences which are based on word dependencies. It overcomes some of the difficulties encountered by syntactic tree kernels as well. Experimental results demonstrate the advantage of this kernel over word subsequence and syntactic tree kernels.
Dot-Size Variant Visual Cryptography
Authors: Jonathan Weir, Wei-Qi Yan
Venue: Proceedings of the 8th International Workshop on Digital Watermarking (2009)

In this paper, we propose a scheme by which a secure random share can be generated using a dot-size variant form of visual cryptography (VC). We generate two extended style VC shares, when the share is viewed, it appears as a normal random visual cryptography share. However, this scheme is designed with spatial filtering in mind, this is the dot-size variant part of the scheme. Dot-size variant means that instead of having single black and white dots which make up a VC share, we use a cluster of smaller dots to represent these black and white pixels. This means that after printing, if the share is scanned or photocopied or even viewed with a mobile phone or digital camera, the smallest dots in the scheme are filtered. This loss of information during the copying process allows the original share to have additional security in that accurate copies cannot be created, as well as the fact that due to this loss, the copied share looks totally different from the original. This technique can be used to detect possible counterfeit shares and copies as they will be noticeably different from the original. One major advantage of our scheme is that it works with traditional print techniques and required no special materials. We present our results within this paper.
Only-knowing: taking it beyond autoepistemic reasoning
Authors: Gerhard Lakemeyer, Hector J. Levesque
Venue: Proceedings of the 20th national conference on Artificial intelligence - Volume 2 (2005)

The idea of only-knowing a collection of sentences has been previously shown to have a close connection with autoepistemic logic. Here we propose a more general account of only-knowing that captures not only autoepistemic logic but default logic as well. This allows us not only to study the properties of default logic in terms of an underlying model of belief, but also the relationship among different forms of nonmonotonic reasoning, all within a classical monotonic logic characterized semantically in terms of possible worlds.
Reversible sound-to-letter/letter-to-sound modeling based on syllable structure
Authors: Stephanie Seneff
Venue: Human Language Technologies 2007: The Conference of the North American Chapter of the Association for Computational Linguistics; Companion Volume, Short Papers on XX (2007)

This paper describes a new grapheme-to-phoneme framework, based on a combination of formal linguistic and statistical methods. A context-free grammar is used to parse words into their underlying syllable structure, and a set of sub-word "spellneme" units encoding both phonemic and graphemic information can be automatically derived from the parsed words. A statistical n-gram model can then be trained on a large lexicon of words represented in terms of these linguistically motivated subword units. The framework has potential applications in modeling unknown words and in linking spoken spellings with spoken pronunciations for fully automatic new-word acquisition via dialogue interaction. Results are reported on sound-to-letter experiments for the nouns in the Phonebook corpus.
A generative programming approach to developing pervasive computing systems
Authors: Damien Cassou, Benjamin Bertran, Nicolas Loriant, Charles Consel
Venue: Proceedings of the eighth international conference on Generative programming and component engineering (2009)

Developing pervasive computing applications is a difficult task because it requires to deal with a wide range of issues: heterogeneous devices, entity distribution, entity coordination, low-level hardware knowledge. . . Besides requiring various areas of expertise, programming such applications involves writing a lot of administrative code to glue technologies together and to interface with both hardware and software components. This paper proposes a generative programming approach to providing programming, execution and simulation support dedicated to the pervasive computing domain. This approach relies on a domain-specific language, named DiaSpec, dedicated to the description of pervasive computing systems. Our generative approach factors out features of distributed systems technologies, making DiaSpec-specified software systems portable. The DiaSpec compiler is implemented and has been used to generate dedicated programming frameworks for a variety of pervasive computing applications, including detailed ones to manage the building of an engineering school.
Pulse-Type Hardware Neural Network with Two Time Windows in STDP
Authors: Katsutoshi Saeki, Ryo Shimizu, Yoshifumi Sekine
Venue: Advances in Neuro-Information Processing: 15th International Conference, ICONIP 2008, Auckland, New Zealand, November 25-28, 2008, Revised Selected Papers, Part II (2009)

In recent years, synaptic plasticity, which is dependent on the order and time interval of pre- and post-synaptic spikes, has been observed by physiological experiments. There are two types of STDP which are characterized by an asymmetric time window and a symmetric time window (mexican hat type window). A symmetric time window especially depends on the influence of an inhibitory neuron. In this paper, we investigate the synaptic circuit and the synaptic weight control circuit using STDP by inhibitory interneuron input or no input. As a result, we show that the synaptic circuit using STDP with the time windows of these two types could be constructed with a simple circuit configuration considering an inhibitory interneuron by using the circuit simulator PSpice. Furthermore, we show the characteristic of reinforcement and suppression.
Automatic Sentence Modality Recognition in Children's Speech, and Its Usage Potential in the Speech Therapy
Authors: Dávid Sztahó, Katalin Nagy, Klára Vicsi
Venue: Cross-Modal Analysis of Speech, Gestures, Gaze and Facial Expressions: COST Action 2102 International Conference Prague, Czech Republic, October 15-18, 2008 Revised Selected and Invited Papers (2009)

In the Laboratory of Speech Acoustics prosody recognition experiments have been prepared, in which, among the others, we were searching for the possibilities of the recognition of sentence modalities. Due to our promising results in the sentence modality recognition, we adopted the method for children modality recognition, and looked for the possibility, how it can be used as an automatic feedback in an audio - visual pronunciation teaching and training system. Our goal was to develop a sentence intonation teaching and training system for speech handicapped children, helping them to learn the correct prosodic pronunciation of sentences. In the experiment basic sentence modality models have been developed and used. For the training of these models, we have recorded a speech prosody database with correctly speaking children, processed and segmented according to the types of modalities. At the recording of this database, 59 children read a text of one word sentences, simple and complex sentences. HMM models of modality types were built by training the recognizer with this correctly speaking children database. The result of the children sentence modality recognition was not adequate enough for the purpose of automatic feedback in case of pronunciation training. Thus another way of classification was prepared. This time the recordings of the children were sorted rigorously by the type of the intonation curves of sentences, which were different in many cases from the sentence modality classes. With the new classes, further tests were carried out. The trained HMM models were used, not for the recognition of the modality of sentences, but checking the correctness of the intonation of sentences pronounced by speech handicapped children. Therefore, an initial database, consisting of the recordings of the voices of two speech handicapped children had been prepared, similar to the database of healthy children.
Dynamic electrothermal simulation of integrated resistors at device level
Authors: B. Vermeersch, G. De Mey
Venue: Microelectronics Journal (2009)

This paper presents the dynamic electrothermal simulation of a rectangular resistor integrated on a semi-conductor substrate. Due to the temperature dependence of the electrical conductivity of the resistive sheet, self-heating provokes a coupling between the electrical and thermal problem and gives rise to nonlinear phenomena. We introduce a time stepping iterative method to perform the calculations. The electrical and thermal solvers are based on FEM and Green's functions techniques, respectively. An extensive dynamic analysis of the device will be presented. The results include heating and cooling curves, Nyquist plot (complex locus) of the thermal impedance, time constant spectrum and structure function. Comparisons with the linear case, i.e. a temperature independent resistor, are made and accompanied by analytical approximations if possible. One key observation is that the nonlinearity may easily be overlooked: its detection is only possible in particular characteristics.
On Smoothed Analysis of Quicksort and Hoare's Find
Authors: Mahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

We provide a smoothed analysis of Hoare's find algorithm and we revisit the smoothed analysis of quicksort. Hoare's find algorithm --- often called quickselect --- is an easy-to-implement algorithm for finding the k-th smallest element of a sequence. While the worst-case number of comparisons that Hoare's find needs is ¿(n 2), the average-case number is ¿(n). We analyze what happens between these two extremes by providing a smoothed analysis of the algorithm in terms of two different perturbation models: additive noise and partial permutations.In the first model, an adversary specifies a sequence of n numbers of [0,1], and then each number is perturbed by adding a random number drawn from the interval [0,d]. We prove that Hoare's find needs $\Theta(\frac{n}{d+1} \sqrt{n/d} + n)$ comparisons in expectation if the adversary may also specify the element that we would like to find. Furthermore, we show that Hoare's find needs fewer comparisons for finding the median.In the second model, each element is marked with probability p and then a random permutation is applied to the marked elements. We prove that the expected number of comparisons to find the median is in $\Omega\big((1\,{-}\,p) \frac np \log n\big)$, which is again tight.Finally, we provide lower bounds for the smoothed number of comparisons of quicksort and Hoare's find for the median-of-three pivot rule, which usually yields faster algorithms than always selecting the first element: The pivot is the median of the first, middle, and last element of the sequence. We show that median-of-three does not yield a significant improvement over the classic rule: the lower bounds for the classic rule carry over to median-of-three.