ppxscal/embedding_network huggingface dataset:
Gamers' Implicit Knowledge on the Psychological Influence of Game-Playing
Authors: Alexander E. Voiskounsky, Olga V. Mitina, Anastasiya A. Avetisova
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

The paper presents the players' implicit views on psychological aspects of a supposable influence of computer/online/video-games on human beings. And online survey with 74 Likert-type questions were given to adults and older adolescents (16+). The collected replies (N=437) were grouped into an eight-factor model. The key implicit representations include the participants' belief that gaming: (1) leads to positive self-development, (2) affects the players' somatics, i.e. causes tiredness and stresses while gaming and in an after-game period, (3) brings pleasing feelings while gaming, (4) stimulates cognitive processes, and (5) supports players' relaxation and gives pleasure.
Sampling with memoization
Authors: Avi Pfeffer
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

Memoization is a fundamental technique in computer science, providing the basis for dynamic programming. This paper explores using memoization to improve the performance of rejection sampling algorithms. It is shown that reusing values produced in previous samples and stored in a cache is beneficial. The paper goes on to explore the idea of recursive memoization, in which values are aggressively reused from the cache even in the process of computing a value to store in the cache. This leads to the values in the cache becoming dependent on each other, and therefore produces a biased sampler. However in practice this seems to be quite beneficial. Furthermore, we show that the error in the cache tends to zero in the long run. We demonstrate the usefulness of memoized sampling in a duplicate bridge simulation, and in experiments with probabilistic grammars.
From Research to Product: Integrating Treemaps into Enterprise Software
Authors: Joseph H. Goldberg, Jonathan I. Helfman, John Beresniewicz
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)

The difficult journey of introducing a new treemap visualization into enterprise software products is described, highlighting interactions among a research team, product teams, and management. Successful product integration ultimately required multiple iterations of prototyping, review, and redirection, as products were cancelled and modified. Several lessons learned are provided, including the need to build flexible and generic prototypes, cultivate champions, and be tenacious.
Fast Mode Decision Algorithm for H.264/AVC Based on All-Zero Blocks Predetermination
Authors: Haoyang Tang, Haoshan Shi
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

The newly proposed video coding standard H.264/AVC by JVT can achieve much higher efficiency than previous standards. Unfortunately this comes at a cost in greatly increased complexity at the encoder mainly due to Motion estimation (ME) and inter /intra prediction block mode decision. In this paper, we propose a fast mode decision algorithm for H.264/AVC based on all-zero blocks predetermination. According to the characteristics of H.264/AVC integral DCT transform and quantization, we present the adaptive detection thresholds and early termination conditions for the inter/intra prediction mode. Then these thresholds are further applied to the fast mode decision algorithm from various encoding modes, which reduce the search complexity of mode decision. The experimental results show that, compared with other mode decision algorithms, our algorithm achieves approximately 21%-41% computational saving without video-quality degradation and bit-rate increase.
Partial Order Reduction for Probabilistic Systems: A Revision for Distributed Schedulers
Authors: Sergio Giro, Pedro R. D'Argenio, Luis María Ferrer Fioriti
Venue: Proceedings of the 20th International Conference on Concurrency Theory (2009)

The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one persist in the reduced system. This technique extends Peled's original restrictions with a new one specially tailored to deal with probabilities. It has been argued that not all schedulers provide appropriate resolutions of nondeterminism and they yield overly safe answers on systems of distributed nature or that partially hide information. In this setting, maximum and minimum probabilities are obtained considering only the subset of so-called distributed or partial information schedulers. In this article we revise the technique of partial order reduction (POR) for LTL properties applied to probabilistic model checking. Our reduction ensures that distributed schedulers are preserved. We focus on two classes of distributed schedulers and show that Peled's restrictions are valid whenever schedulers use only local information. We show experimental results in which the elimination of the extra restriction leads to significant improvements.
Introduction
Authors: Pedro C. Diniz, Ben Juurlink, Alain Darte, Wolfgang Karl
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

This topic deals with architecture design and compilation for high performance systems. The areas of interest range from microprocessors to large-scale parallel machines; from general-purpose platforms to specialized hardware (e.g., graphic coprocessors, low-power embedded systems); and from hardware design to compiler technology. On the compilation side, topics of interest include programmer productivity issues, concurrent and/or sequential language aspects, program analysis, transformation, automatic discovery and/or management of parallelism at all levels, and the interaction between the compiler and the rest of the system. On the architecture side, the scope spans system architectures, processor micro-architecture, memory hierarchy, and multi-threading, and the impact of emerging trends.
Research on the Simulation of Urban Land Use Change Based on GIS and CA Models - A Case Study of Longgang District, Shenzhen City
Authors: Xue Cao, Ping Luo, Manchun Li, Aihua Long
Venue: Proceedings of the 2009 International Conference on Environmental Science and Information Application Technology - Volume 02 (2009)

In this paper we emphasize on the technology research depending on the CA model which have powerful computation function and spatial analysis ability of GIS to simulate and forecast urban land use change in Shenzhen city. We reconstructed and extended conventional CA model from three aspects including model run-time, influencing factors, transforming rules and finally integrate GIS into CA model by AML language. The experimental result shows that the experimental model can better simulate and predict urban land change and the result reached the expectant aim, it can offer service for the administration to institute reasonable urban developmental programming, while it also has directive signification for realizing urban continuable development.
Parallel FFT with Eden Skeletons
Authors: Jost Berthold, Mischa Dieterle, Oleg Lobachev, Rita Loogen
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

The paper investigates and compares skeleton-based Eden implementations of different FFT-algorithms on workstation clusters with distributed memory. Our experiments show that the basic divide-and-conquer versions suffer from an inherent input distribution and result collection problem. Advanced approaches like calculating FFT using a parallel map-and-transpose skeleton provide more flexibility to overcome these problems. Assuming a distributed access to input data and re-organising computation to return results in a distributed way improves the parallel runtime behaviour.
Model Based Analysis of Face Images for Facial Feature Extraction
Authors: Zahid Riaz, Christoph Mayer, Michael Beetz, Bernd Radig
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

This paper describes a comprehensive approach to extract a common feature set from the image sequences. We use simple features which are easily extracted from a 3D wireframe model and efficiently used for different applications on a benchmark database. Features verstality is experimented on facial expressions recognition, face reognition and gender classification. We experiment different combinations of the features and find reasonable results with a combined features approach which contain structural, textural and temporal variations. The idea follows in fitting a model to human face images and extracting shape and texture information. We parametrize these extracted information from the image sequences using active appearance model (AAM) approach. We further compute temporal parameters using optical flow to consider local feature variations. Finally we combine these parameters to form a feature vector for all the images in our database. These features are then experimented with binary decision tree (BDT) and Bayesian Network (BN) for classification. We evaluated our results on image sequences of Cohn Kanade Facial Expression Database (CKFED). The proposed system produced very promising recognition rates for our applications with same set of features and classifiers. The system is also realtime capable and automatic.
Collaborative Multimedia Content Caching Algorithms for Mobile Ad-Hoc Networks
Authors: Y. Abdelmalek, T. Saadawi
Venue: Proceedings of the 2009 First International Conference on Advances in Multimedia (2009)

In this paper, we address the problem of collaborative video caching in mobile ad-hoc networks. We consider network portraying static video server with wired interface to gateway node that is equipped with wireless interfaces, other nodes are requiring access to the video streams that is stored at video server. In order to reduce the average access latency as well as enhance the video accessibility, efficient video caching placement and replacement strategies are crucial at some of the distributed intermediate nodes across the network. Virtual backbone caching nodes will be elected by executing caching placement algorithm after running the routing protocol phase. The simulation results indicate that the proposed collaborative aggregate cache mechanism can significantly improve the video QoS in terms of packet loss and average packet delay.
NoGAP: A Micro Architecture Construction Framework
Authors: Per Karlström, Dake Liu
Venue: Proceedings of the 9th International Workshop on Embedded Computer Systems: Architectures, Modeling, and Simulation (2009)

Flexible Application Specific Instruction set Processors (ASIP) are starting to replace monolithic ASICs in a vide variety of fields. However the design of an ASIP is today a substantial design effort. This paper discusses ${\ensuremath{\mathfrak{NoGap}}}$ (Novel Generator for ASIP) a tool for ASIP designs utilizing hardware multiplexed data paths. One of the main advantages of ${\ensuremath{\mathfrak{NoGap}}}$ compared to other ADL tools is that it does not impose limits on the architecture and thus design freedom. To reach this flexibility ${\ensuremath{\mathfrak{NoGap}}}$ makes heavy use of the compositional design principle and is therefore divided into three parts $\mathfrak{Mage}$, ${\ensuremath{\mathfrak{Mase}}}$, and ${\ensuremath{\mathfrak{Castle}}}$. This paper presents the central concepts of ${\ensuremath{\mathfrak{NoGap}}}$ to show that it is possible to reach this advertised flexibility and still be able to generate HDL code and tools such as simulators and assemblers.
Parsing with Agreement
Authors: Adam Radziszewski
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

Shallow parsing has been proposed as a means of arriving at practically useful structures while avoiding the difficulties of full syntactic analysis. According to Abney's principles, it is preferred to leave an ambiguity pending than to make a likely wrong decision. We show that continuous phrase chunking as well as shallow constituency parsing display evident drawbacks when faced with freer word order languages. Those drawbacks may lead to unnecessary data loss as a result of decisions forced by the formalism and therefore diminish practical value of shallow parsers for Slavic languages.We present an alternate approach to shallow parsing of noun phrases for Slavic languages which follows the original Abney's principles. The proposed approach to parsing is decomposed into several stages, some of which allow for marking discontinuous phrases. 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
Automatic Approach of Provable Security and its Application for OAEP+
Authors: Gu Chun-Xiang, Guang Yan, Chen Nan, Zhu Yue-Fei
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Probable security is an important criteria for analyzing the security of cryptographic protocols. However, writing and verifying proofs by hand are prone to errors. This paper introduces the game-based approach of writing security proofs and its automatic technique. It advocates the automatic security proof approach based on process calculus, and presents the initial game and observational equivalences of OAEP+.
A Novel Fast Anisotropic High Pass Filtering Algorithm Based on Improved Step Angle Searching
Authors: Pan Qing, Weng Weibiao, Yan Guoping, Tian Nili
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 03 (2009)

This paper put forward a novel fast anisotropic high pass filtering algorithm based on the Improved Step Angle Searching (ISAS). The Step Angle Searching (SAS) algorithm obtains the excellent performance at the cost of the real time performance reduction. Fortunately, the Improved Gray Gradient Orientation (IGGO) algorithm can provide not only the more optimized initial angle but also the confirmation of the searching direction which are the key factors in the SAS algorithm. Thus, combined with the IGGO algorithm and the SAS one, the real time performance can be improved. The experiments indicate that the new algorithm proposed can bring out the great improvement on real time performance while containing the excellent filtering performance of the SAS.
Streaming Embeddings with Slack
Authors: Christiane Lammersen, Anastasios Sidiropoulos, Christian Sohler
Venue: Proceedings of the 11th International Symposium on Algorithms and Data Structures (2009)

We study the problem of computing low-distortion embeddings in the streaming model. We present streaming algorithms that, given an n-point metric space M, compute an embedding of M into an n-point metric space M¿ that preserves a (1 ¿ ¿)-fraction of the distances with small distortion (¿ is called the slack). Our algorithms use space polylogarithmic in n and the spread of the metric. Within such space limitations, it is impossible to store the embedding explicitly. We bypass this obstacle by computing a compact representation of M¿, without storing the actual bijection from M into M¿.
Research and Implementation of DCT-Based Image Digital Watermarking Algorithm
Authors: Gengming Zhu, Shaobo Zhang
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

This paper presents a novel scheme to embed binary image watermarking in gray image based on DCT domain, and a detailed implementation of the method is presented. The method is proved effective in the anti-scaling, resample, anti-noise and anti-cuts capabilities.
The Development of Robust Control to AGC Systems of Cold Rolling Mill
Authors: Teng Zi, Meng Xin, Yue GuangXue
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

Gives a new control method, which is used in the AGC systems of cold rolling mill. TO the shortage of control method which is used now, analyses and synthesize dynamic mathematical model of AGC, presents a new method: method. Simulations of experiment indicate that the control method has good system performance and robust stability performance.
Resource-Constrained Multi-project Management with Activity Weights in Software Engineering
Authors: LePing Chen, Kewen Li
Venue: Proceedings of the 2009 IITA International Conference on Control, Automation and Systems Engineering (case 2009) (2009)

Resource-constrained multi-project management is of vital importance in software engineering as it has more uncertainties must be considered. Based on the detailed analyses to popular and significant approaches, such as CPM, PERT, CCPM, and the dynamic characteristics of software multi-project management, this paper argues a dynamic model with project and activity weights to solve the scheduling problem on resource-constrained multi-project, and analyzes an example in detail. The method can also be suitable for similar complicated project management in other domains.
Search engines evaluation for P2P based digital libraries
Authors: Marco Fernandes, Joaquim A. Martins, Joaquim S. Pinto, Pedro Almeida
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

Indexing and searching services play a critical role in digital libraries. They are responsible for maintaining an index of the existing resources and responding to search queries. Traditional systems store these indexes using a centralized approach, but recent distributed computing paradigms bring new challenges to the storage of information and query processing. In this paper, we will discuss the new trends in the area of P2P based digital libraries and which challenges they place for these services. In the second part of the paper, we evaluate different engines according to defined objectives and propose changes accordingly.
Coupling and Correlation Reduction in Compact Arrays for WSN Nodes via Pre-fractal Defected Ground Plane
Authors: Constantine G. Kakoyiannis, Philip Constantinou
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

We studied compact printed arrays built with sinusoidal monopoles. The antennas were designed at 2-3 GHz according to the size and bandwidth constraints of broadband sensor networks. Their performance was characterized in terms of VSWR bandwidth, broadband radiation efficiency, mutual coupling and broadband envelope correlation. Results show that densely-packed compact arrays feature controllable element detuning, whereas envelope correlation stays below 0.5 even for lambda 0/10 spacing. Finally, if coupling and correlation suppression is needed, we describe a simple yet effective technique that offers multi-decibel gains. It is based on disturbance of the ground currents by insertion of a defect.
Performance evaluation of an autonomic network-aware metascheduler for Grids
Authors: A. Caminero, O. Rana, B. Caminero, C. Carrión
Venue: Concurrency and Computation: Practice Experience (2009)

Grid technologies have enabled the aggregation of geographically distributed resources in the context of a particular application. The network remains an important requirement for any Grid application, as entities involved in a Grid system (such as users, services, and data) need to communicate with each other over a network. The performance of the network must therefore be considered when carrying out tasks such as scheduling, migration or monitoring of jobs. Surprisingly, many existing quality of service efforts ignore the network and focus instead on processor workload and disk access time. Making use of the network in an efficient and fault-tolerant manner is challenging. In a previous contribution, we proposed an autonomic network-aware scheduling architecture that is capable of adapting its behavior to the current status of the environment. Now, we present a performance evaluation in which our proposal is compared with a conventional scheduling strategy. We present simulation results that show the benefits of our approach. Copyright &copy; 2009 John Wiley & Sons, Ltd.
Explaining User Performance in Information Retrieval: Challenges to IR Evaluation
Authors: Kalervo Järvelin
Venue: Proceedings of the 2nd International Conference on Theory of Information Retrieval: Advances in Information Retrieval Theory (2009)

The paper makes three points of significance for IR research: (1) The Cranfield paradigm of IR evaluation seems to lose power when one looks at human instead of system performance. (2) Searchers using IR systems in real-life use rather short queries, which individually often have poor performance. However, when used in sessions, they may be surprisingly effective. The searcher's strategies have not been sufficiently described and cannot therefore be properly understood, supported nor evaluated. (3) Searchers in real-life seek to optimize the entire information access process, not just result quality. Evaluation of output alone is insufficient to explain searcher behavior.
A meta-learning approach for selecting between response automation strategies in a help-desk domain
Authors: Yuval Marom, Ingrid Zukerman, Nathalie Japkowicz
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 1 (2007)

We present a corpus-based approach for the automation of help-desk responses to users' email requests. Automation is performed on the basis of the similarity between a request and previous requests, which affects both the content included in a response and the strategy used to produce it. The latter is the focus of this paper, which introduces a meta-learning mechanism that selects between different information-gathering strategies, such as document retrieval and multidocument summarization. Our results show that this mechanism outperforms a random strategy-selection policy, and performs competitively with a gold baseline that always selects the best strategy.
Mass Detection in Digital Mammograms Using Twin Support Vector Machine-Based CAD System
Authors: Xiong Si, Lu Jing
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Abstract—Mass in mammogram can be an indicator of breast cancer. In this work we propose a new approach using Twin Support Vector Machine (TWSVM) for automated detection of mass in digital mammograms. This algorithm finds two hyperplanes to classify data points into different classes according to the relevance between a given point and either plane. It works much faster than original SVM classifier. The proposed scheme is evaluated by a data set of 100 clinical mammograms from DDSM. Experimental results demonstrate that the proposed TWSVM-based CAD system offers a very satisfactory performance for mass detection in digitizing mammograms. Compare with previous SVM-based classifier, it provides higher classification accuracy and computational speed.