ppxscal/embedding_network huggingface dataset:
Acoustic Direction of Arrival Estimation Based on Spatial Circular Prediction
Authors: He Hongsen, Lu Jing, Gao Yang
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Acoustic source localization is one of the most important applied fields of microphone arrays. Microphone array source localization is to estimate location parameters of the acoustic source following from some microphone array configuration. An acoustic direction of arrival (DOA) estimation algorithm based on parameterized spatial circular prediction is deduced in this paper. Associated with eigen-decomposition of array signals, the spatial covariance matrix is modified to compute broadband spatial spectrum aimed at estimating the acoustic DOA. The spatial circular prediction spectrum is compared in this paper with several broadband spectra, such as multichannel cross correlation coefficient (MCCC) and steered response power (SRP). The simulation results demonstrate that the proposed algorithm is superior to the other several algorithms at low signal-to-noise ratio.
Adaptive Calculation of Division Points for Piecewise Linear Transformation and Application in Image Enhancement
Authors: Junhua Zhang, Gen Yang, Qing Xu, Yongjun Zhao
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 01 (2009)

Piecewise linear transformation is usually used to increase the contrast of image efficiently. It is most important to select division points during the processing course of piecewise linear transformation because these division points can decide the quality and efficiency of image enhancement. But the proper division points are usually selected after several experiments which take a lot of time. In this paper, division points are automatically computed based on Minimum Error Threshold which can increase the efficiency greatly. The whole image is divided into three sections based on the gray level. Different procession methods such as extension, maintenance and compression are carried on to these different sections. Experiments show that piecewise linear transformation is more valid to improve image quality comparing with other methods such as histogram equalization, linear transformation.
Protecting Sensitive Topics in Text Documents with PROTEXTOR
Authors: Chad Cumby
Venue: Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part II (2009)

This is a demonstration of a system for protecting sensitive topics present in text documents. Our system works in a privacy framework where the topic is characterized as a multiclass classification problem in a generative setting. We show how our system helps a user redact a document in a business setting to obscure what company the text pertains to, and show some experimental results on redacting the topic for a standard text classification data set.
Evaluating Usability-Supporting Architecture Patterns: Reactions from Usability Professionals
Authors: Edgardo Luzcando, Davide Bolchini, Anthony Faiola
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

Usability professionals and software engineers approach software design differently, which creates a communication gap that hinders effective usability design discussions. An online survey was conducted to evaluate how usability professionals react to Usability-Supporting Architecture Patterns (USAPs) as a potential way to bridge this gap. Members of the Usability Professionals Association (UPA) participated in a pretest-posttest control group design experiment where they answered questions about USAPs and software design. Results suggest that participants perceived USAPs as useful to account for usability in software architectures, recognizing the importance of the USAPs stated usability benefits. Additionally, results showed a difference in perception of the USAPs stated usability benefits between US and European participants. A better understanding of what the usability community thinks about USAPs can lead to their improvement as well as increased adoption by software engineers, which can lead to better integration of usability and HCI principles into software design.
IBM Z/Os V1r10 Communications Server Tcp/Ip Implementation: Standard Applications
Venue:  (2009)

For more than 40 years, IBM mainframes have supported an extraordinary portion of the world's computing work, providing centralized corporate databases and mission-critical enterprise-wide applications. The IBM System z, the latest generation of the IBM distinguished family of mainframe systems, has come a long way from its IBM System/360 heritage. Likewise, its IBM z/OS operating system is far superior to its predecessors, providing, among many other capabilities, world-class, state-of-the-art, support for the TCP/IP Internet protocol suite. TCP/IP is a large and evolving collection of communication protocols managed by the Internet Engineering Task Force (IETF), an open, volunteer, organization. Because of its openness, the TCP/IP protocol suite has become the foundation for the set of technologies that form the basis of the Internet. The convergence of IBM mainframe capabilities with Internet technology, connectivity, and standards (particularly TCP/IP) is dramatically changing the face of information technology and driving requirements for ever more secure, scalable, and highly available mainframe TCP/IP implementations. The IBM z/OS Communications Server TCP/IP Implementation series provides understandable, step-by-step guidance about how to enable the most commonly used and important functions of z/OS Communications Server TCP/IP. This IBM Redbooks publication provides useful implementation scenarios and configuration recommendations for many of the TCP/IP standard applications that z/OS Communications Server supports. 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
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
Authors: Joël Alwen, Yevgeniy Dodis, Daniel Wichs
Venue: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology (2009)

We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject only to the constraint that the overall amount of such information is bounded by some parameter ¿. We construct a variety of leakage-resilient public-key systems including the first known identification schemes (ID), signature schemes and authenticated key agreement protocols (AKA). Our main result is an efficient three-round AKA in the Random-Oracle Model, which is resilient to key-leakage attacks that can occur prior-to and after a protocol execution. Our AKA protocol can be used as an interactive encryption scheme with qualitatively stronger privacy guarantees than non-interactive encryption schemes (constructed in prior and concurrent works), which are inherently insecure if the adversary can perform leakage attacks after seing a ciphertext.Moreover, our schemes can be flexibly extended to the Bounded-Retrieval Model, allowing us to tolerate very large absolute amount of adversarial leakage ¿ (potentially many gigabytes of information), only by increasing the size of the secret key and without any other loss of efficiency in communication or computation. Concretely, given any leakage parameter ¿, security parameter ¿, and any desired fraction 0 < ¿ ≤ 1, our schemes have the following properties: Secret key size is ¿(1 + ¿) + O(¿). Public key size is O(¿), and independent of ¿. Communication complexity is O(¿/¿), and independent of ¿. Computation reads O(¿/¿ 2) locations of the secret key, independent of ¿. Lastly, we show that our schemes allow for repeated "invisible updates" of the secret key, allowing us to tolerate up to ¿ bits of leakage in between any two updates, and an unlimited amount of leakage overall. These updates require that the parties can securely store a short "master update key" (e.g. on a separate secure device protected against leakage), which is only used for updates and not during protocol execution. The updates are invisible in the sense that a party can update its secret key at any point in time, without modifying the public key or notifying the other users.
Mathematical Models of Experience-Based and Dynamic Experience-Based Fuzzy Classification
Authors: Wenyi Chen, Cunchen Gao, Junyu Dong, Wenbin Liu
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

This paper presents novel mathematical models to decide similarity functions for experience-based and dynamic experience-based fuzzy classification. By extending crisp partition to fuzzy partition and introducing statistical approach, we firstly establish models for experience-based fuzzy classification. Based on these models, we propose a new mathematical model for dynamic experience-based fuzzy classification. The new model is more practical than previous ones. We illustrate how to utilize the new model with an example of classifying engineering materials.
Improving the User Experience of Our Own UX Ideas
Authors: Joel Eden
Venue: Proceedings of the Symposium on Human Interface 2009 on ConferenceUniversal Access in Human-Computer Interaction. Part I: Held as Part of HCI International 2009 (2009)

Systems thinking is a perspective that focuses on looking at interdependent relationships between entities in an organization, making visible otherwise hard to see leverage points. Evaluation is an inherent part of designly thinking, even though many practicing UX professionals view evaluation as something that follows "design." These two views are discussed related to understanding how to get more traction for our UX ideas in the existing design processes within our organizations.
Extracting propositions from trained neural networks
Authors: Hiroshi Tsukimoto
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

This paper presents an algorithm for extracting propositions from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural network whose output function is monotone such as sigmoid function. Therefore, the algorithm can be applied to multi-layer neural networks, recurrent neural networks and so on. The algorithm does not depend on training methods. The algorithm is polynomial in computational complexity. The basic idea is that the units of neural networks are approximated by Boolean functions. But the computational complexity of the approximation is exponential, so a polynomial algorithm is presented. The authors have applied the algorithm to several problems to extract understandable and accurate propositions. This paper shows the results for votes data and mushroom data. The algorithm is extended to the continuous domain, where extracted propositions are continuous Boolean functions. Roughly speaking, the representation by continuous Boolean functions means the representation using conjunction, disjunction, direct proportion and reverse proportion. This paper shows the results for iris data.
On the Hardness and Approximability of Planar Biconnectivity Augmentation
Authors: Carsten Gutwenger, Petra Mutzel, Bernd Zey
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

Given a planar graph G = (V,E), the planar biconnectivity augmentation problem (PBA) asks for an edge set E¿ ¿ V×V such that G + E¿ is planar and biconnected. This problem is known to be $\mathcal{NP}$-hard in general; see [1]. We show that PBA is already $\mathcal{NP}$-hard if all cutvertices of G belong to a common biconnected component B *, and even remains $\mathcal{NP}$-hard if the SPQR-tree of B * (excluding Q-nodes) has a diameter of at most two. For the latter case, we present a new 5/3-approximation algorithm with runtime ${\mathcal{O}}(|V|^{2.5})$.Though a 5/3-approximation of PBA has already been presented [12], we give a family of counter-examples showing that this algorithm cannot achieve an approximation ratio better than 2, thus the best known approximation ratio for PBA is 2.
Parametric representation of human breast shapes
Authors: Giovanni Gallo, Giuseppe Claudio Guarnera, Francesco Milanese, Davide Modica, Giuseppe Catanuto, Francesco Pane
Venue: Proceedings of the 2009 IEEE International Workshop on Medical Measurements and Applications (2009)

This paper proposes a novel technique to describe the shapes of women breasts in a low dimensional parameter space. The parameterization is obtained applying Principal Component Analysis (PCA) to a data set of about 40 Nuclear Magnetic Resonances of female breasts taken in a prone position. The resulting principal modes may be used as clinical indicator and have a direct medical interpretation.
Understanding the Opinion Forming Processes of Experts and Customers During Evaluations of Automotive Sounds
Authors: Louise Humphreys, Sebastiano Giudice, Paul Jennings, Rebecca Cain, Garry Dunne, Mark Allman-Ward
Venue: Proceedings of the 8th International Conference on Engineering Psychology and Cognitive Ergonomics: Held as Part of HCI International 2009 (2009)

A challenge in automotive engineering is to understand the subjective reactions of individuals to vehicle sounds; this is necessary in order to improve decision making during product design. We can use "structured evaluations" to achieve this, but we need to ensure that 1) we understand the reasons behind such evaluations i.e. the opinion forming process and 2) that such evaluations are analogous to appraisals of vehicles on the road. Hence for structured evaluations to be effective, it is important that we understand the opinion forming process in real-life situations. Since there is a lack of knowledge on how people form perceptions aboutvehicles in reality, an appraisals framework is described in this paper. Moreover, this paper discusses a pilot study that investigated how experts assess vehicle sounds on-road, as well as planned future studies to examine how customers evaluate automotive sounds.
User Innovation Networks and Research Challenges
Authors: Niki Lambropoulos, Pan Kampylis, Aneesha Bakharia
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

User Innovation Networks (UIN) has been considered the open innovation model for this century as it functions entirely independently of manufacturers. This paper discusses two UIN cases, Daz3D, as well as Linux Dell and IBM cooperation as regards research challenges about the community of practice and interface used. It concludes that current technology only now started touching global and extreme collaboration for creativity and innovation.
Recommendation Retrieval in Reputation Assessment for Peer-to-Peer Systems
Authors: Farag Azzedin, Ahmad Ridha
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Recommendation-based reputation assessment in peer-to-peer systems relies on recommendations in predicting the reputation of peers. In this paper, we discuss the effectiveness and cost metrics in the recommendation retrieval. We evaluate the following retrieval methods: flooding, recommendation tree, and the storage peer. The simulation results show that overlay network construction significantly contributes to the performance of recommendation retrieval in terms of effectiveness and cost. Storage peer approach in structured network outperforms the other two approaches as long as the network is stable.
Research of LUCC for Industrial Zone Based on the Landsat TM Image
Authors: Ju Wang, Na LI, He Meng, Chun-Sheng Fang
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 03 (2009)

At present, LUCC research becomes a hot problem. The research in our country focuses on the hot spots, fragile ecological environment and typical areas. In this paper, two remote sensing image respectively in 2000 and 2005 are used to analyze and assess the LUCC of the industrial zone by using the 3S technique means. The result is taken to support the data for the EIA and EM.
Reed-Solomon Codes for Satellite Communications
Authors: Yongmei Liu, Yong Guan, Jie Zhang, Guohui Wang, Yan Zhang
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

In the fields of mobile phone and satellite communications, the quality of data transmission is required highly. In view of the hard space environment of high radiation for satellite, the hardening of anti-radiation must be considered during satellite communications for avoiding the phenomenon which influences communication or error, such as the SEU. Response to the request of the Consultative committee for Space Data Systems (CCSDS) which adopts the approach of Reed-Solomon channel coding which has a strong ability of signal error correction, the encoding form of RS (255,223) codes is analyzed and the error-correcting capabilities of RS (255,223) is simulated. Experimental results show that RS (255,223) code can correct the 16 error characters synchronously.
Determination of Glycan Structure from Tandem Mass Spectra
Authors: Sebastian Böcker, Birte Kehr, Florian Rasche
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

Glycans are molecules made from simple sugars that form complex tree structures. Glycans constitute one of the most important protein modifications, and identification of glycans remains a pressing problem in biology. Unfortunately, the structure of glycans is hard to predict from the genome sequence of an organism.We consider the problem of deriving the topology of a glycan solely from tandem mass spectrometry data. We want to generate glycan tree candidates that sufficiently match the sample mass spectrum. Unfortunately, the resulting problem is known to be computationally hard. We present an efficient exact algorithm for this problem based on fixed-parameter algorithmics, that can process a spectrum in a matter of seconds. We also report some preliminary results of our method on experimental data. We show that our approach is fast enough in applications, and that we can reach very good de novo identification results. Finally, we show how to compute the number of glycan topologies of a given size.
Backbone extraction and pruning for speeding up a deep parser for dialogue systems
Authors: Myroslava O. Dzikovska, Carolyn P. Rosé
Venue: Proceedings of the Third Workshop on Scalable Natural Language Understanding (2006)

In this paper we discuss issues related to speeding up parsing with wide-coverage unification grammars. We demonstrate that state-of-the-art optimisation techniques based on backbone parsing before unification do not provide a general solution, because they depend on specific properties of the grammar formalism that do not hold for all unification based grammars. As an alternative, we describe an optimisation technique that combines ambiguity packing at the constituent structure level with pruning based on local features.
Control-flow integrity principles, implementations, and applications
Authors: Martín Abadi, Mihai Budiu, Úlfar Erlingsson, Jay Ligatti
Venue: ACM Transactions on Information and System Security (TISSEC) (2009)

Current software attacks often build on exploits that subvert machine-code execution. The enforcement of a basic safety property, control-flow integrity (CFI), can prevent such attacks from arbitrarily controlling program behavior. CFI enforcement is simple and its guarantees can be established formally, even with respect to powerful adversaries. Moreover, CFI enforcement is practical: It is compatible with existing software and can be done efficiently using software rewriting in commodity systems. Finally, CFI provides a useful foundation for enforcing further security policies, as we demonstrate with efficient software implementations of a protected shadow call stack and of access control for memory regions.
Usability Evaluation of Multimodal Interfaces: Is the Whole the Sum of Its Parts?
Authors: Ina Wechsung, Klaus-Peter Engelbrecht, Stefan Schaffer, Julia Seebode, Florian Metze, Sebastian Möller
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part II: Novel Interaction Methods and Techniques (2009)

Usability evaluation of multimodal systems is a complex issue. Multimodal systems provide multiple channels to communicate with the system. Thus, the single modalities as well as their combination have to be taken into account. This paper aims to investigate how ratings of single modalities relate to the ratings of their combination. Therefore a usability evaluation study was conducted testing an information system in two unimodal versions and one multimodal version. Multiple linear regression showed that for overall and global judgments ratings of the single modalities are very good predictors for the ratings of the multimodal system. For separate usability aspects (e.g. hedonic qualities) the prediction was less accurate.
Job Offer Management: How Improve the Ranking of Candidates
Authors: Rémy Kessler, Nicolas Béchet, Juan-Manuel Torres-Moreno, Mathieu Roche, Marc El-Bèze
Venue: Proceedings of the 18th International Symposium on Foundations of Intelligent Systems (2009)

The market of online job search sites grows exponentially. This implies volumes of information (mostly in the form of free text) become manually impossible to process. An analysis and assisted categorization seems relevant to address this issue. We present E-Gen, a system which aims to perform assisted analysis and categorization of job offers and of the responses of candidates. This paper presents several strategies based on vectorial and probabilistic models to solve the problem of profiling applications according to a specific job offer. Our objective is a system capable of reproducing the judgement of the recruitment consultant. We have evaluated a range of measures of similarity to rank candidatures by using ROC curves. Relevance feedback approach allows to surpass our previous results on this task, difficult, diverse and higly subjective.
Cognitive and psychological predictors of the negative outcomes associated with playing MMOGs (massively multiplayer online games)
Authors: Ming Liu, Wei Peng
Venue: Computers in Human Behavior (2009)

This study integrates research on problematic Internet use to explore the cognitive and psychological predictors of negative consequences associated with playing massively multiplayer online games (MMOGs). Participants recruited from online discussion boards completed self-report measures on their online game-related cognitions and psychological condition, social skills, psychological well-being, and negative life outcomes associated with game playing. The results demonstrated the important roles that psychological dependency and deficient self-regulation play in negative consequences associated with online gaming. The results also indicated that psychological dependency on MMOGs was predicted by cognitive preference for a virtual life-a construct that is negatively related to social control skills.