ppxscal/embedding_network huggingface dataset:
Characterizing multiparty voice communication for multiplayer games
Authors: Gabor Papp, Chris GauthierDickey
Venue: Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2008)

Over the last few years, the number of game players using voice communication to talk to each other while playing games has increased dramatically. In fact, many modern games and game consoles have added voice support instead of expecting third-party companies to provide this technology. Unlike traditional voice-over-IP technology, where most conversations are between two people, voice communication in games often has 5 or more people talking together as they play. We present the first measurement study on the characteristics of multiparty voice communications. Over a 3 month period, we measured over 7,000 sessions on an active multi-party voice communication server to quantify the characteristics of communication generated by game players, including overall server traffic, group sizes, sessions characteristics, and speaking (and silence) durations.
International workshop on recommendation and collaboration (ReColl 2008)
Authors: Lawrence Bergman, Jihie Kim, Bamshad Mobasher, Stefan Rueger, Stefan Siersdorfer, Sergej Sizov, Markus Stolze
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

The International Workshop on Recommendation and Collaboration (ReColl 2008) aims to identify emerging trends in recommendation technology and collaborative environments in the context of intelligent user interfaces. We explore these two topics separately and the synergies between them.
Preventing of burst traffic in DSG method
Authors: M. Jahanshahi, M. Kordafshari, M. Gholipour, M. Dehghan
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

In distributed operating systems orphan detection is a key subject. There exist some methods for cope with orphans. One of them is DSG method which overcomes to previous method. In this paper initially we introduce DSG method and then we present its advantages. After it we intended to prevent burst traffic in a special scenario that can be accrued in DSG environment.
Experimental apparatus for vibration analysis in robotics
Authors: Miguel F. M. Lima, J. A. Tenreiro Machado, Manuel Crisóstomo
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

Robotic systems use different types of sensors both in control and in environment perception. Those sensors can be digital encoders, tachometers, accelerometers, force sensors, current sensors and many others. In this paper an experimental setup is presented to study vibrations and impacts. The system acquires data from the sensors, in real time, and, in a second phase, processes it through an analysis package. Several examples with experimental results are carried out showing the functionalities of the developed apparatus.
The localization problem for mobile robots
Authors: J. M. Kleinberg
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

A fundamental task for an autonomous mobile robot is that of localization-determining its location in a known environment. This problem arises in settings that range from the computer analysis of aerial photographs to the design of autonomous Mars rovers. L. Guibas et al. ((1992) have given geometric algorithms for the problem of enumerating locations for a robot consistent with a given view of the environment. We provide an on-line algorithm for a robot to move within its environment so as to uniquely determine its location. The algorithm improves asymptotically on strategies based purely on the "spiral search" technique of R. Baeza-Yates et al. (1993); an interesting feature of our approach is the way in which the robot is able to identify "critical directions" in the environment which allow it to perform late stages of the search more efficiently.
Dynamic image filter selection using partially reconfigurable FPGAs for imaging operations
Authors: V. Tadigotla, S. Commuri
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Real time image processing requires the selection of appropriate image filters. Static implementations of filter circuitry can be optimized if the image type is known at the time of reception. However, if the type of the incoming image is unknown, then improper selection of the filters could severely impact the quality of the received image. In this paper, an effective technique to select an imaging filter at run-time using dynamically reconfigurable Field Programmable Gate Arrays (FPGAs) is presented. Hardware - software co-design and hardware reconfiguration is utilized to design flexible and reliable image filtering applications. This approach is validated through a case-study where an appropriate filter is dynamically implemented in Virtex-II Pro FPGA and the resulting improvement in the image quality is demonstrated.
Qr-model based testing
Authors: Harald Brandl, Gordon Fraser, Franz Wotawa
Venue: Proceedings of the 3rd international workshop on Automation of software test (2008)

As reactive and embedded systems continuously interact with their environment, it is important to test as many as possible interactions. The use of qualitative models of the environment and hardware has the potential to provide test cases that might not be considered with traditional testing methods. We present an approach that derives abstract test cases from such models using qualitative reasoning, which is a well known artificial intelligence technique to represent and reason about physical behavior. For this purpose we introduce the underlying concepts of qualitative reasoning, show the test case generation process, and provide the results of a case study.
The Role of Business Process Modelling in ERP Implementation Projects
Authors: Mojca Indihar temberger, Andrej Kovacic
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Companies and other organisations use ERP systems more and more extensively. The problem is that many projects of this type are unsuccessful, mostly due to their complexity being underestimated. The purpose of the paper is to analyse the challenges of ERP implementation projects and to propose a framework based on a composite approach to ERP systems implementation. A special emphasis is given to business process modelling, because the key to a successful choice, implementation and usage of an ERP system is fit of planned processes in an organisation with processes implemented in the solution. The paper also presents some results of empirical investigation in the field of ERP implementation.
Enhancing web page classification through image-block importance analysis
Authors: E. Fersini, E. Messina, F. Archetti
Venue: Information Processing and Management: an International Journal (2008)

We present a term weighting approach for improving web page classification, based on the assumption that the images of a web page are those elements which mainly attract the attention of the user. This assumption implies that the text contained in the visual block in which an image is located, called image-block, should contain significant information about the page contents. In this paper we propose a new metric, called the Inverse Term Importance Metric, aimed at assigning higher weights to important terms contained into important image-blocks identified by performing a visual layout analysis. We propose different methods to estimate the visual image-blocks importance, to smooth the term weight according to the importance of the blocks in which the term is located. The traditional TFxIDF model is modified accordingly and used in the classification task. The effectiveness of this new metric and the proposed block evaluation methods have been validated using different classification algorithms.
A Method of Project Member Arrangement of Using SOM for a Web Community
Authors: Shingo Kawamura, Shinya Touji, Minoru Uehara, Hideki Mori
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The process of open source software (OSS) development may be the same the formation of wisdom in crowds. In this paper, we propose a web community to support the development OSS. They include the 4 factors in wisdom of crowds - diversity of opinion, independence, decentralization, and aggregation. Also, this system invites light users without software skills development to explore different approaches and opinions.We propose a method by which keep the diverse of opinions the group is organized to include variety of different opinions using self-organizing maps (SOM). Further, while organizing then using SOM analyses, the performance of this method can be evaluated.
Growing Hierarchical Self-Organizing Map for Filtering Intrusion Detection Alarms
Authors: Maya Shehab, Nashat Mansour, Ahmad Faour
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

A Network Intrusion Detection System (NIDS) monitors all network actions and generates alarms when it detects suspicious attempts. We present a data mining technique to assist network administrators to analyze and reduce false positive alarms that are produced by a NIDS. Our data mining technique is based on a Growing Hierarchical Self-Organizing Map (GHSOM) that adjusts its architecture during an unsupervised training process according to the characteristics of the input alarm data. GHSOM clusters these alarms in a way that supports network administrators in making decisions about true and false alarms. Our empirical results show that our technique is useful for real-world intrusion data.
A New Neighbour Selection Strategy for Group-Based Wireless Sensor Networks
Authors: Miguel Garcia, Diana Bri, Fernando Boronat, Jaime Lloret
Venue: Proceedings of the Fourth International Conference on Networking and Services (2008)

In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select its neighbours.
The pattern matrix method for lower bounds on quantum communication
Authors: Alexander A. Sherstov
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

In a breakthrough result, Razborov (2003) gave optimal lower bounds on the communication complexity of every function f of the form f(x,y)=D(|x AND y|) for some D:{0,1,...,n}->{0,1}, in the bounded-error quantum model with and without prior entanglement. This was proved by the multidimensional discrepancy method. We give an entirely different proof of Razborov's result, using the original, one-dimensional discrepancy method. This refutes the commonly held intuition (Razborov 2003) that the original discrepancy method fails for functions such as DISJOINTNESS. More importantly, our communication lower bounds hold for a much broader class of functions for which no methods were available. Namely, fix an arbitrary function f:{0,1}n/4->{0,1} and let A be the Boolean matrix whose columns are each an application of f to some subset of the variables x1,x2,...,xn. We prove that the communication complexity of A in the bounded-error quantum model with and without prior entanglement is Omega(d), where d is the approximate degree of f. From this result, Razborov's lower bounds follow easily. Our result also establishes a large new class of total Boolean functions whose quantum communication complexity (regardless of prior entanglement) is at best polynomially smaller than their classical complexity. Our proof method is a novel combination of two ingredients. The first is a certain equivalence of approximation and orthogonality in Euclidean n-space, which follows by linear-programming duality. The second is a new construction of suitably structured matrices with low spectral norm, the pattern matrices, which we realize using matrix analysis and the Fourier transform over (Z2)n. The method of this paper has recently inspired important progress in multiparty communication complexity.
Resources
Venue: IT Professional (2008)

IT professionals can turn to these books, conferences, and Web sites to hone skills and expand horizons.
A pseudo-penalization method for high Reynolds number unsteady flows
Authors: R. Pasquetti, R. Bwemba, L. Cousin
Venue: Applied Numerical Mathematics (2008)

A pseudo-penalization method, i.e., an implicit formulation of the standard volume penalization method, is introduced and validated by considering the 2D wake of a cylinder at Reynolds number Re=200.
An automated technique for risk-based test case generation and prioritization
Authors: Heiko Stallbaum, Andreas Metzger, Klaus Pohl
Venue: Proceedings of the 3rd international workshop on Automation of software test (2008)

In practice, available testing budgets limit the number of test cases that can be executed. Thus, a representative subset of all possible test cases must be chosen to guarantee adequate coverage of a test object. In risk-based testing, the probability of a fault and the damage that this fault can cause when leading to a failure is considered for test case prioritization. Existing approaches for risk-based testing provide guidelines for deriving test cases. However, those guidelines lack the level of detail and precision needed for automation. In this contribution, we introduce the risk-based testing technique RiteDAP, which automatically generates system test cases from activity diagrams and prioritizes those test cases based on risk. The results of applying the technique to a practical example are presented and the ability of different prioritization strategies to uncover faults is evaluated.
Comparisons between Circle and Structural Models in Lung Ventilation Reconstruction by Electrical Impedance Tomography
Authors: Xiaoyan Chen, Huanxiang Wang, Xiaolei Shi, Li Hu
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, a set of electrical impedance tomography (EIT) system, EIT_TJU II system is presented. A physical model regarding the prior information of human thorax has been illustrated, and the sensitivities distribution comparing with the circle model is analyzed. By numerical analyzing the uniformity and the nonlinearity of the structural model are improved. The lung ventilation experiments are undertaken on the different models. The visualization results of lung ventilation indicate that EIT incorporating prior information is a promising technique which has the potential to be applied in future clinical diagnoses and monitoring.
Randomness with Respect to the Signed-Digit Representation
Authors: Margaret Archibald, Vasco Brattka, Clemens Heuberger
Venue: Fundamenta Informaticae (2008)

The ordinary notion of algorithmic randomness of reals can be characterised as Martin-L&ouml;f randomness with respect to the Lebesgue measure or as Kolmogorov randomness with respect to the binary representation. In this paper we study the question of how the notion of algorithmic randomness induced by the signed-digit representation of the real numbers is related to the ordinary notion of algorithmic randomness. We first consider the image measure on real numbers induced by the signed-digit representation. We call this measure the signed-digit measure and using the Fourier transform of this measure and the Riemann-Lebesgue Lemma we prove that this measure is not absolutely continuous with respect to the Lebesgue measure. We also show that the signed-digit measure can be obtained as a weakly convergent convolution of discrete measures and therefore, by the classical Theorem of Jessen and Wintner the Lebesgue measure is not absolutely continuous with respect to the signed-digitmeasure. Finally, we provide an invariance theoremwhich shows that if a computable map preserves Martin-L&ouml;f randomness, then its induced image measure has to be absolutely continuous with respect to the target space measure. This theorem can be considered as a loose analog for randomness of the Banach-Mazur theorem for computability. Using this Invariance Theorem we conclude that the notion of randomness induced by the signed-digit representation is incomparable with the ordinary notion of randomness.
Abstractness, specificity, and complexity in software design
Authors: Stefan Wagner, Florian Deissenboeck
Venue: Proceedings of the 2nd international workshop on The role of abstraction in software engineering (2008)

Abstraction is one of the fundamental concepts of software design. Consequently, the determination of an appropriate abstraction level for the multitude of artefacts that form a software system is an integral part of software engineering. However, the very nature of abstraction in software design and particularly its interrelation with equally important concepts like complexity, specificity or genericity are not fully understood today. As a step towards a better understanding of the trade-offs involved, this paper proposes a distinction of abstraction into two types that have different effects on the specificity and the complexity of artefacts. We discuss the roles of the two types of abstraction in software design and explain the interrelations between abstractness, specificity, and complexity. Furthermore, we illustrate the benefit of the proposed distinction with multiple examples and describe consequences of our findings for software design activities.
A Research on Predicting the Operation Function for the Workflow-Based Knowledge Management Software
Authors: Kota Tsubouchi, Kazuo Hiekata, Hiroyuki Yamato
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes Predicting the Operation Function (POF) for the workflow-based knowledge management software. POF is a function of the system that can estimate the documents which software users want to see and provides the users not only with proper documents, but also unexpected knowledge which another users operation reflected. The system stores the log data of operation and judges which documents are needed from the viewpoint of the present user’s characteristics and everyone’s behavior. The simulation experiment with real data concerning the On-Demand Bus project shows that users’ behavior is strongly related with the previous actions and the POF can improve the usability of the knowledge management software.
Circular chromatic index of graphs of maximum degree 3
Authors: Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu
Venue: Journal of Graph Theory (2005)

This paper proves that if G is a graph (parallel edges allowed) of maximum degree 3, then &chi;&prime;c(G)&thinsp;&le;&thinsp;11-3 provided that G does not contain H1 or H2 as a subgraph, where H1 and H2 are obtained by subdividing one edge of K <stack>23</stack> (the graph with three parallel edges between two vertices) and K4, respectively. As &chi;&prime;c(H1)&thinsp;=&thinsp;&chi;&prime;c(H2)&thinsp;=&thinsp;4, our result implies that there is no graph G with 11-3&thinsp;<&thinsp;&chi;&prime;c(G)&thinsp;<&thinsp;4. It also implies that if G is a 2-edge connected cubic graph, then &chi;&prime;c(G)&thinsp;&le;&thinsp;11-3. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 325&ndash;335, 2005
Dynamically computing the maxima of decomposable functions, with applications
Authors: D. Dobkin
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The authors present a general technique for updating the maximum (minimum) value of a decomposable function as elements are inserted into and deleted from the set S. Applications of this technique include efficient algorithms for dynamically computing the diameter or closest pair of a set of points, minimum separation among a set of rectangles, smallest distance between a set of points and a set of hyperplanes, and largest or smallest area (perimeter) rectangles determined by a set of points. The main appeal of the approach lies in its generality. Several research directions suggested by the work are noted.
Certificates of Positivity in the Bernstein Basis
Authors: Fatima Boudaoud, Fabrizio Caruso, Marie-Fran&#x00e7;oise Roy
Venue: Discrete Computational Geometry (2008)

Let $P\in\mathbb{Z[X]}$ be a polynomial of degree p with coefficients in the monomial basis of bit-size bounded by &#x03c4;. If P is positive on [&#x2212;1,1], we obtain a certificate of positivity (i.e., a description of P making obvious that it is positive) of bit-size O(p 4(&#x03c4;+log&#x2009;2 p)). Previous comparable results had a bit-size complexity exponential in p and &#x03c4; (Powers and Reznick in Trans. Am. Math. Soc. 352(10):4677&#x2013;4692, 2000; Powers and Reznick in J. Pure Appl. Algebra 164:221&#x2013;229, 2001).
Learning to sportscast: a test of grounded language acquisition
Authors: David L. Chen, Raymond J. Mooney
Venue: Proceedings of the 25th international conference on Machine learning (2008)

We present a novel commentator system that learns language from sportscasts of simulated soccer games. The system learns to parse and generate commentaries without any engineered knowledge about the English language. Training is done using only ambiguous supervision in the form of textual human commentaries and simulation states of the soccer games. The system simultaneously tries to establish correspondences between the commentaries and the simulation states as well as build a translation model. We also present a novel algorithm, Iterative Generation Strategy Learning (IGSL), for deciding which events to comment on. Human evaluations of the generated commentaries indicate they are of reasonable quality compared to human commentaries.
Pipelined Bus-Invert Coding for FPGAs Driving High-Speed DDR-Channels
Authors: Guenter Knittel
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

We present designs for high-speed bus-invert coding on FPGAs. The purpose is to reduce switching activities on off-chip buses driven through dual-data-rate outputs. For bus-invert coding, the performance-limiting unit is the majority voter circuit. In order to support very high data rates, we use both pipelined and approximate solutions for this unit. The approximate solution is optimized for LUT-based FPGAs and achieves high performance at lower hardware costs, at an only slightly decreased efficiency. We give performance figures for the algorithms and the circuitry.