ppxscal/embedding_network huggingface dataset:
Role recognition in multiparty recordings using social affiliation networks and discrete distributions
Authors: Sarah Favre, Hugues Salamin, John Dines, Alessandro Vinciarelli
Venue: Proceedings of the 10th international conference on Multimodal interfaces (2008)

This paper presents an approach for the recognition of roles in multiparty recordings. The approach includes two major stages: extraction of Social Affiliation Networks (speaker diarization and representation of people in terms of their social interactions), and role recognition (application of discrete probability distributions to map people into roles). The experiments are performed over several corpora, including broadcast data and meeting recordings, for a total of roughly 90 hours of material. The results are satisfactory for the broadcast data (around 80 percent of the data time correctly labeled in terms of role), while they still must be improved in the case of the meeting recordings (around 45 percent of the data time correctly labeled). In both cases, the approach outperforms significantly chance.
Detecting LTR structures in human genomic sequences using profile hidden Markov models
Authors: Li-Ching Wu, Hsien-Da Huang, Yu-Chung Chang, Ying-Chun Lee, Jorng-Tzong Horng
Venue: Expert Systems with Applications: An International Journal (2009)

More than 45% of human genome has been annotated as transposable elements (TEs). The human genome is expanded by the mobilization of these TEs, which they may increase the plasticity and variation of the genome. Long terminal repeat (LTR) retrotransposons are important components in TEs. LTRs include regulatory sites, which the authors believe could be conserved in evolution. Therefore, these significant motifs in the sequence of LTRs are found and are used to train a Hidden Markov Model. These models are used as fingerprints to detect most of the known LTRs detected by RepeatMasker. LTR instances are classified into families using the predictive models proposed. These LTRs can support evolutionary analysis. A new method of detecting LTR is proposed. Analyzing LTR sequences reveals some specific motifs as LTR fingerprints, which can be built into HMM profiles. Experimental results reveal that the proposed experimental approach not only discovers most of the LTRs found by RepeatMasker, but also detects some novel LTRs. Moreover, the novel LTRs may be structurally incomplete or degenerate.
Controllability of nonlinear algebraic differential systems
Authors: A. A. Shcheglova
Venue: Automation and Remote Control (2008)

We consider a control system of nonlinear ordinary differential equations unsolved for the derivative of the desired vector-function, the system having arbitrarily high index of unsolvability. For such systems the null-controllability by linear approximation is investigated. Conditions of complete controllability are obtained for the linear system with smooth coefficients. It is shown that the complete controllability implies the local null-controllability in the linear case.
Name Disambiguation Boosted by Latent Topics from Web Directories
Authors: Quang Minh Vu, Atsuhiro Takasu, Jun Adachi
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

Search results for personal name queries often contain documents relevant to several people as a personal name is often shared by several people. In order to differentiate people in these search results, it is required to extract contexts relevant to people in documents. However, since web documents are noisy and the texts related to people might be short, it is difficult to extract contexts of people effectively. We propose a new method that uses web directories as additional information in order to recognize topic terms in documents more easily and to extract contexts of people more effectively. First, we apply latent Dirichlet allocation method to extract latent topics in web directories. Then, the extracted topics are used to recognize topics contained in name ambiguity documents so that common context measurements can be calculated more effectively. Our experiments, conducted with documents of real people in the web and several well-known web directories, show that our approach disambiguates personal names better than some other conventional approaches like vector space model approach and named entity recognition approach.
Optimum multichannel random access with retransmission cut-off in OFDMA wireless systems
Authors: Jahangir H. Sarker, Hussein T. Mouftah
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

Orthogonal frequency division multiple access (OFDMA) is considered as the multiple access system for next generation wireless communications and provides multichannel structure. The results of this paper can be divided into two folds. First, the basic equation for multichannel OFDMA slotted ALOHA is devised considering the maximum number of allowed retrials, retransmission probability and the number of users involved in collisions. It is shown that the basic result is independent of retransmission probability as well as the number of users involved in the collision. In the second fold of the paper, we obtained the optimum number of channels with the variation of new packet arrival rate and the maximum allowed number of reattempts, under two conditions. These two conditions are: the system is stable, and provides maximum throughput.
RDF-3X: a RISC-style engine for RDF
Authors: Thomas Neumann, Gerhard Weikum
Venue: Proceedings of the VLDB Endowment (2008)

RDF is a data representation format for schema-free structured information that is gaining momentum in the context of Semantic-Web corpora, life sciences, and also Web 2.0 platforms. The "pay-as-you-go" nature of RDF and the flexible pattern-matching capabilities of its query language SPARQL entail efficiency and scalability challenges for complex queries including long join paths. This paper presents the RDF-3X engine, an implementation of SPARQL that achieves excellent performance by pursuing a RISC-style architecture with a streamlined architecture and carefully designed, puristic data structures and operations. The salient points of RDF-3X are: 1) a generic solution for storing and indexing RDF triples that completely eliminates the need for physical-design tuning, 2) a powerful yet simple query processor that leverages fast merge joins to the largest possible extent, and 3) a query optimizer for choosing optimal join orders using a cost model based on statistical synopses for entire join paths. The performance of RDF-3X, in comparison to the previously best state-of-the-art systems, has been measured on several large-scale datasets with more than 50 million RDF triples and benchmark queries that include pattern matching and long join paths in the underlying data graphs.
Hybrid access-specific software cache techniques for the cell BE architecture
Authors: Marc Gonzàlez, Nikola Vujic, Xavier Martorell, Eduard Ayguadé, Alexandre E. Eichenberger, Tong Chen, Zehra Sura, Tao Zhang, Kevin O'Brien, Kathryn O'Brien
Venue: Proceedings of the 17th international conference on Parallel architectures and compilation techniques (2008)

Ease of programming is one of the main impediments for the broad acceptance of multi-core systems with no hardware support for transparent data transfer between local and global memories. Software cache is a robust approach to provide the user with a transparent view of the memory architecture; but this software approach can suffer from poor performance. In this paper, we propose a hierarchical, hybrid software-cache architecture that classifies at compile time memory accesses in two classes, high-locality and irregular. Our approach then steers the memory references toward one of two specific cache structures optimized for their respective access pattern. The specific cache structures are optimized to enable high-level compiler optimizations to aggressively unroll loops, reorder cache references, and/or transform surrounding loops so as to practically eliminate the software cache overhead in the innermost loop. Performance evaluation indicates that improvements due to the optimized software-cache structures combined with the proposed code-optimizations translate into 3.5 to 8.4 speedup factors, compared to a traditional software cache approach. As a result, we demonstrate that the Cell BE processor can be a competitive alternative to a modern server-class multi-core such as the IBM Power5 processor for a set of parallel NAS applications.
An Efficient Design of H.264 Inter Interpolator with Bandwidth Optimization
Authors: Yun-Nan Chang, Ting-Chi Tong
Venue: Journal of Signal Processing Systems (2008)

In this paper, a highly efficient inter-interpolation architecture for the H.264/AVC standard is proposed. Since the placement order of frame pixels in the memory is either row-wise or column-wise which may not be suitable for the sample prediction in particular direction, this paper proposes a novel interpolator design which can dynamically configure the data-path for different predicted modes to perform proper computation schedules suitable for the nature input order of reference samples. The proposed design methodology not only can avoid the additional data transposition buffer, but most importantly the data transfer time spent to fetch the reference samples can be overlapped with the data computation time. Furthermore, by decomposing the chroma interpolation into a series of shift and addition operations, both luma and chroma interpolations can be integrated within the same module. In addition to the data-path design, this paper also proposes a new data-reuse buffer design based on a two-dimensional cache architecture to explore the possible data reuse among the inter and intra partitions. This design can be easily integrated with the H.264 interpolator to reduce the enormous demand of memory access. Our experimental results shows that our saving of memory bandwidth can be 23% more than what the best design can achieve by exploring the intra-partition data reuse only. The proposed design methodology has been implemented, and the result shows that the proposed interpolation architecture is the most compact design among the literatures which can perform the real-time H.264 video decoding with resolution up to 1920×1088 high-definition television standard. The proposed interpolator can be applied to the dedicated H.264 hardware codec design for various consumer devices.
Scalable query result caching for web applications
Authors: Charles Garrod, Amit Manjhi, Anastasia Ailamaki, Bruce Maggs, Todd Mowry, Christopher Olston, Anthony Tomasic
Venue: Proceedings of the VLDB Endowment (2008)

The backend database system is often the performance bottleneck when running web applications. A common approach to scale the database component is query result caching, but it faces the challenge of maintaining a high cache hit rate while efficiently ensuring cache consistency as the database is updated. In this paper we introduce Ferdinand, the first proxy-based cooperative query result cache with fully distributed consistency management. To maintain a high cache hit rate, Ferdinand uses both a local query result cache on each proxy server and a distributed cache. Consistency management is implemented with a highly scalable publish/subscribe system. We implement a fully functioning Ferdinand prototype and evaluate its performance compared to several alternative query-caching approaches, showing that our high cache hit rate and consistency management are both critical for Ferdinand's performance gains over existing systems.
Automatic speech grammar generation during conceptual modelling of virtual environments
Authors: Lode Vanacken, Chris Raymaekers, Karin Coninx
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

Speech interfaces are becoming more and more popular as a means to interact with virtual environments but the development and integration of these interfaces is usually still ad hoc, especially the speech grammar creation of the speech interface is a process commonly performed by hand. In this paper, we introduce an approach to automatically generate a speech grammar which is generated using semantic information. The semantic information is represented through ontologies and gathered from the conceptual modelling phase of the virtual environment application. The utterances of the user will be resolved using queries onto these ontologies such that the meaning of the utterance can be resolved. For validation purposes we augmented a city park designer with our approach. Informal tests validate our approach, because they reveal that users mainly use words represented in the semantic data, and therefore also words which are incorporated in the automatically generated speech grammar.
Combining opportunistic and size-based scheduling in wireless systems
Authors: Pasi Lassila, Samuli Aalto
Venue: Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems (2008)

HSDPA/HDR systems allow the use of sophisticated opportunistic schedulers that can utilize information on instantaneous channel conditions. On the other hand, for elastic data traffic the size of the files can be used in size-dependent scheduling methods, e.g., the well known SRPT scheduler, to minimize the flow delays. In this paper, we consider the optimal use of both size and channel information for minimizing the flow delay. We derive several heuristics which utilize both types of information. In a static setting with two flows and two rates, the optimal policy can be constructed via dynamic programming and can be compared against the policies using exact size knowledge. In the dynamic setting (stochastically arriving flows with random sizes), extensive simulations have been performed to evaluate the performance of the schedulers under heavy traffic. In the symmetric setting, the differences between the schedulers are clearly visible, while in the asymmetric setting the dynamics are more complex. The results still show that significant gains can be achieved with additionally using size information.
Cough localization for the detection of respiratory diseases in pig houses
Authors: M. Silva, S. Ferrari, A. Costa, J. -M. Aerts, M. Guarino, D. Berckmans
Venue: Computers and Electronics in Agriculture (2008)

In this paper, an algorithm is proposed for localizing cough sounds by using the difference in arrival time of a sound signal between different microphones. To assess the accuracy of the proposed method, estimated positions of a reference sound were compared with real positions in various microphone configurations. All the configurations showed a good position estimation, with mean error between 1.5 and 0m, and a maximum standard deviation on the error of 0.4m. The algorithm was also applied on the localization of coughing pigs in a stable in field condition. Using this method it was possible to localize cough attacks of pigs. During a 3h recording trial, sound was recorded using seven microphones in which 179 coughs were collected, originating from 19 cough attacks. After mapping the locations in the stable, three hazard zones could be identified. This information can be used for visualizing the spread of respiratory diseases and eventually contribute to the reduction of the use of antibiotics by means of selective and early treatment of single pens in stead of the whole compartment.
Computational design of synthetic gene circuits with composable parts
Authors: M.A. Marchisio, J. Stelling
Venue: Bioinformatics (2008)

Motivation: In principle, novel genetic circuits can be engineered using standard parts with well-understood functionalities. However, no model based on the simple composition of these parts has become a standard, mainly because it is difficult to define signal exchanges between biological units as unambiguously as in electrical engineering. Corresponding concepts and computational tools for easy circuit design in biology are missing. Results: Taking inspiration from (and slightly modifying) ideas in the ‘MIT Registry of Standard Biological Parts’, we developed a method for the design of genetic circuits with composable parts. Gene expression requires four kinds of signal carriers: RNA polymerases, ribosomes, transcription factors and environmental ‘messages’ (inducers or corepressors). The flux of each of these types of molecules is a quantifiable biological signal exchanged between parts. Here, each part is modeled independently by the ordinary differential equations (ODE) formalism and integrated into the software ProMoT (Process Modeling Tool). In this way, we realized a ‘drag and drop’ tool, where genetic circuits are built just by placing biological parts on a canvas and by connecting them through ‘wires’ that enable flow of signal carriers, as it happens in electrical engineering. Our simulations of well-known synthetic circuits agree well with published computational and experimental results. Availability: The code is available on request from the authors. Contact: mario.marchisio@bsse.ethz.ch Supplementary information: Supplementary data are available at Bioinformatics online.
Straightening out softening up: response to Carroll and Campbell
Authors: Allen Newell, Stuart Card
Venue: Human-computer interaction (1986)

Carroll and Campbell have exercised themselves over a straw man not subscribed to by us. In the process, our position has not been accurately represented. In reply, we restate as clearly as we can the position for which we actually did and do argue. The underlying issue seems to concern the advantages of using technical psychological theories to identify underlying mechanisms in human-computer interaction. We argue that such theories are an important part of a science of human-computer interaction. We argue further that technical theories must be considered in the context of the uses to which they are put. The use of a theory helps determine what is a good approximation, the degree of formalization that is justified, and the appropriate commingling of qualitative and quantitative techniques. Technical theories encourage cumulative progress by abetting the classical scientific heuristic of divide and conquer.
SNAP predicts effect of mutations on protein function
Authors: Yana Bromberg, Guy Yachdav, Burkhard Rost
Venue: Bioinformatics (2008)

Summary: Many non-synonymous single nucleotide polymor-phisms (nsSNPs) in humans are suspected to impact protein function. Here, we present a publicly available server implementation of the method SNAP (screening for non-acceptable polymorphisms) that predicts the functional effects of single amino acid substitutions. SNAP identifies over 80% of the non-neutral mutations at 77% accuracy and over 76% of the neutral mutations at 80% accuracy at its default threshold. Each prediction is associated with a reliability index that correlates with accuracy and thereby enables experimentalists to zoom into the most promising predictions. Availability: Web-server: http://www.rostlab.org/services/SNAP; downloadable program available upon request. Contact: bromberg@rostlab.org Supplementary information:Supplementary data are available at Bioinformatics online.
Improved throughput bit-serial multiplier for GF(2m) fields
Authors: George N. Selimis, Apostolos P. Fournaris, Harris E. Michail, Odysseas Koufopavlou
Venue: Integration, the VLSI Journal (2009)

High throughput is a crucial factor in bit-serial GF(2^m) fields multiplication for a variety of different applications including cryptography, error coding detection and computer algebra. The throughput of a multiplier is dependent on the required number of clock cycles to reach a result and its critical path delay. However, most bit-serial GF(2^m) multipliers do not manage to reduce the required number of clock cycles below the threshold of m clock cycles without increasing dramatically their critical path delay. This increase is more evident if a multiplier is designed to be versatile. In this article, a new versatile bit-serial MSB multiplier for GF(2^m) fields is proposed that achieves a 50% increase on average in throughput when compared to other designs, with a very small increase in its critical path delay. This is achieved by an average 33.4% reduction in the required number of clock cycles below m. The proposed design can handle arbitrary bit-lengths upper bounded by m and is suitable for applications where the field order may vary.
Matching and Ranking with Hidden Topics towards Online Contextual Advertising
Authors: Dieu-Thu Le, Cam-Tu Nguyen, Quang-Thuy Ha, Xuan-Hieu Phan, Susumu Horiguchi
Venue: Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01 (2008)

In online contextual advertising, ad messages are displayed related to the content of the target Web page. It leads to the problem in information retrieval community: how to select the most relevant ad messages given the content of a page. To deal with this problem, we propose a framework that takes advantage of large scale external datasets. This framework provides a mechanism to discover the semantic relations between Web pages and ad messages by analyzing topics for them. This helps overcome the problem of mismatch due to unimportant words and the difference in vocabularies between Web pages and ad messages. The framework has been evaluated through a number of experiments. It shows a significant improvement in accuracy over word/lexicon-based matching and ranking methods.
A Process for Human Centered Modelling of Incident Scenarios
Authors: Claudia V. Guerrero, M. Fatima Vieira, Jean-Marc Mercantini, Charles Santoni
Venue: Proceedings of the 4th Symposium of the Workgroup Human-Computer Interaction and Usability Engineering of the Austrian Computer Society on HCI and Usability for Education and Work (2008)

This paper presents the process of building a conceptual model of incident scenarios caused by human error. The process was conceived to be human centered and was validated through a case study in the context of the electricity generation sector. The corpus of study was extracted from an electricity distribution and transmission company in Brazil. The resulting conceptual model forms the basis of an incident scenario simulator built to study user behavior when dealing with safety critical situations. This work is within the context of conceiving ergonomic human interfaces for industrial systems. The objective is to conceive interfaces that facilitate the operation of these systems, particularly during critical situations when the human error is considered one of the main causes of accidents.
A multi-language service-oriented architecture using an enterprise service bus
Authors: Ricky E. Sward, Kelly J. Whitacre
Venue: Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference (2008)

An Enterprise Service Bus (ESB) provides developers a platform for the straightforward development of a multi-language Service-Oriented Architecture (SOA). Mule, an open source ESB, is presented as one such ESB that easily provides a multi-language SOA integration solution. This paper offers a Mule 1.4 ESB configuration allowing the communication between web services written in Java and Ada running on the Ada Web Server as an example. Additionally, the example demonstrates the use of SOAP and REST style messages within the SOA environment.
Vulnerabilities and security strategy for the next generation bandwidth elastic PON
Authors: Stamatios V. Kartalopoulos, Di Jin
Venue: WSEAS TRANSACTIONS on COMMUNICATIONS (2007)

The next generation WDM/TDM-PON is scalable and delivers elastically ultra-high data rates to many thousands of end-users, and therefore network security becomes of particular importance. We identify different levels of security and responsibilities in the communications network, we identify vulnerabilities in the optical access network and we describe the security features, monitoring and detecting of the next generation PON network.