ppxscal/embedding_network huggingface dataset:
Distributed Self Fault-Diagnosis for SIP Multimedia Applications
Authors: Kai X. Miao, Henning Schulzrinne, Vishal Kumar Singh, Qianni Deng
Venue: Proceedings of the 10th IFIP/IEEE International Conference on Management of Multimedia and Mobile Networks and Services: Real-Time Mobile Multimedia Services (2008)

IP real-time multimedia applications present a challenging environment for network and service management, which requires a new approach. DYSWIS (Do You See What I See), proposed in this paper, is peer-to-peer distributed management architecture for multimedia network and service management, characteristic of active fault probing and identification based on protocol and functional scripting and rules.
Numerical investigation by means of polynomial regression method for determining the temperature fields in a medium with phase transition
Authors: Diana Enescu, Henri George Coanda, Elena Otilia Virjoghe, Ion Caciula
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The complexity of the icing/thawing processes, in case of interference of the temperature fields, generated by multiple pipes, is very difficult to be reproduced in the established conditions within the laboratory. The data processing can be approached by numerical methods in order to solve the complex problem of the heat transfer in mediums with mobile boundaries and the phase transition. Such major preoccupations are often met to the aquifer soil excavation consolidated by water freezing from soil, namely, to subway construction, construction of the water supply networks, sewer systems, etc. Based on the real experimental data, the numerical computation was made by means of the application entitled ADITP, which was also presented in other papers, where some methods like: linear interpolation, Spline interpolation and Lagrange interpolation were studied. These approximation methods were chosen in order to generate the simple or complex analytical functions, which have small errors of approximation. In this paper, the authors present the obtained results using a better approximation, in this case being polynomial regression, which represents a very good evaluation of all processes. Our software application analyses the temperature fields which are generated for two structures of phenomena using the data acquisitioned by an acquisition board and for the first time an approach in the Visual C# program.
A generalization of Talbot's theorem about King Arthur and his Knights of the Round Table
Authors: A. J. W. Hilton, C. L. Spencer
Venue: Journal of Combinatorial Theory Series A (2009)

Let G be a graph consisting of powers of disjoint cycles and let A be an intersecting family of independent r-sets of vertices. Provided that G satisfies a further condition related to the clique numbers of the powers of the cycles, then |A| will be as large as possible if it consists of all independent r-sets containing one vertex from a specified cycle. Here r can take any value, 1=
Dynamic modeling and robust control of a 3-PRC translational parallel kinematic machine
Authors: Yangmin Li, Qingsong Xu
Venue: Robotics and Computer-Integrated Manufacturing (2009)

The dynamic modeling and robust control for a three-prismatic-revolute-cylindrical (3-PRC) parallel kinematic machine (PKM) with translational motion have been investigated in this paper. By introducing a mass distribution factor, the simplified dynamic equations have been derived via the virtual work principle and validated on a virtual prototype with the ADAMS software package. Based upon the established model, three dynamics controllers have been attempted on the 3-PRC PKM. The intuitive co-simulations with the combination of MATLAB/Simulink and ADAMS show that the control performance of neither inverse dynamics control nor robust inverse dynamics control is satisfactory in the presence of parametric uncertainties in PKM dynamics. On the contrary, the controller based on the passivity-based robust control scheme is more suitable for tracking control of the PKM in terms of both control performances and controller design procedures. The results presented in the paper provide a sound base for both the mechanical system design and control system design of a 3-PRC PKM.
Making a library catalogue part of the semantic web
Authors: Martin Malmsten
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Library catalogues contain an enormous amount of structured, high-quality data, however, this data is generally not made available to semantic web applications. In this paper we describe the tools and techniques used to make the Swedish Union Catalogue (LIBRIS) part of the Semantic Web and Linked Data. The focus is on links to and between resources and the mechanisms used to make data available, rather than perfect description of the individual resources. We also present a method of creating links between records of the same work.
Challenges for wireless sensor networks deployment
Authors: Zoran Bojkovic, Bojan Bakmaz
Venue: Proceedings of the 8th WSEAS international conference on Distance learning and web engineering (2008)

Among numerous challenges faced while designing wireless sensor networks (WSNs) and protocols, maintaining connectivity and maximizing the network lifetime stand out as critical considerations. Mobile platforms equipped with communications devices can be leveraged to overcome these problems. Approaches developed to query sensor-actuator networks (SANETs) are either application-specific or generic. Application-specific SANETs provide limited reusability, are net cost effective and may require extensive programming efforts to make the network able to serve new applications. A wireless sensor networks should be able to operate for long time with little or no external management. The sensor nodes must be able to configurate themselves in the presence of adverse situations. In this work, dealing with challenges for WSNs deployment, we start with mobility-based communication in WSNs. Then, we introduce service-oriented SANETs (SOSANETs) as an approach to build customizable SANETs. In the second part, we describe localization systems and analyze self configurability, situation awareness and intrusion detection system. In the third part, we present wireless sensor network for distributed detection as well as a model for wireless sensor network simulation. Finally, conclusions and proposals for future research are given.
Non-universal usability?: a survey of how usability is understood by Chinese and Danish users
Authors: Olaf Frandsen-Thorlacius, Kasper Hornbæk, Morten Hertzum, Torkil Clemmensen
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Most research assumes that usability is understood similarly by users in different cultures, implying that the notion of usability, its aspects, and their interrelations are constant across cultures. The present study shows that this is not the case for a sample of 412 users from China and Denmark, who differ in how they understand and prioritize different aspects of usability. Chinese users appear to be more concerned with visual appearance, satisfaction, and fun than Danish users; Danish users prioritize effectiveness, efficiency, and lack of frustration higher than Chinese users. The results suggest that culture influences perceptions of usability. We discuss implications for usability research and for usability practice.
Simulation of a L&eacute;vy process by PCA sampling to reduce the effective dimension
Authors: Pierre L'Ecuyer, Jean-Sébastien Parent-Chartier, Maxime Dion
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

We consider a L&eacute;vy process monitored at s (fixed) observation times. The goal is to estimate the expected value of some function of these s observations by (randomized) quasi-Monte Carlo. For the case where the process is a Brownian motion, clever techniques such as Brownian bridge sampling and PCA sampling have been proposed to reduce the effective dimension of the problem. The PCA method uses an eigen-decomposition of the covariance matrix of the vector of observations so that a larger fraction of the variance depends on the first few (quasi)random numbers that are generated. We show how this method can be applied to other L&eacute;vy processes, and we examine its effectiveness in improving the quasi-Monte Carlo efficiency on some examples. The basic idea is to simulate a Brownian motion at s observation points using PCA, transform its increments into independent uniforms over (0, 1), then transform these uniforms again by applying the inverse distribution function of the increments of the L&eacute;vy process. This PCA sampling technique is quite effective in improving the quasi-Monte Carlo performance when the sampled increments of the L&eacute;vy process have a distribution that is not too far from normal, which typically happens when the process is observed at a large time scale, but may turn out to be ineffective in cases where the increments are far from normal.
Letters: The role of inhibition in central pattern generators: A simulation study
Authors: M. Anzinger, F. Rattay
Venue: Neurocomputing (2009)

This simulation study shows that with a simple network model the background function of a central pattern generator (CPG) network can be understood easily. The network model connects units consisting of two excitatory and one inhibitory population. An example of the lamprey demonstrates that a sufficient inhibition activity is necessary to produce CPG like patterns.
Numerical Modelling of Cellular Immune Response to Virus
Authors: Mikhail K. Kolev
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

We present a mathematical model of cellular immune response to viral infection. The model is a bilinear system of integro-differential equations of Boltzmann type. Results of numerical experiments are presented.
Background of the Aṣṭādhyāyī
Authors: S. D. Joshi
Venue: Proceedings of the 3rd International Symposium on Sanskrit Computational Linguistics (2008)

I have hesitated in accepting the invitation extended to me by Amba Kulkarni on September 9. The main reason was that I am not acquainted with what is called Sanskrit Computational Linguistics, or with theories of Machine Translation, or with information theory. In fact, I know nothing about these subjects. So what can I tell you? In view of my deeply regretted lack of knowledge regarding the subjects mentioned, I have decided to deliver a talk on a subject of which I have some experience, namely, P&iquest;&iquest;ini's linguistic analysis as shown in his method of analysis, in the development of theoretical concepts and in the composition of the Aṣṭādhyāyī. Clearly, Pānini, in applying his linguistic analysis of the spoken Sanskrit of his days, has developed a number of theoretical concepts which can be used for the analysis of other languages also. That is an elementary insight which proved to be fruitful already in the 19th century when linguistics and especially comparative linguistics were developed as separate branches of science in Germany and France. Reading statements about information coding in which Pānini is hailed as an early language code information scientist, I am reminded of the situation in the early sixties, after Chomsky had published his book on Syntactic Structures in 1957. Here Chomsky introduced a type of grammar called transformational generative grammar. It earned him a great of applause, globally, I may say. Then it dawned on linguists that Pānini had also composed a generative grammar. So Pānini was hailed as the fore-runner of generative grammar. That earned him a lot of interest among linguists. Many linguists, foreign as well as Indian, joined the bandwagon, and posed as experts in Pāninian grammar on Chomskyan terms. Somewhat later, after Chomsky had drastically revised his ideas, and after the enthusiasm for Chomsky had subsided, it became clear that the idea of transformation is alien to Pānini, and that the Aṣṭādhyāyī is not a generative grammar in the Chomskyan sense. Now a new type of linguistics has come up, called Sanskrit Computational Linguistics with three capital letters. Although Chomsky is out, Pānini is still there, ready to be acclaimed as the fore-runner of Sanskrit Computational Linguistics. I am, of course, grateful for the interest shown in Pānini. 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
SLAP widgets: bridging the gap between virtual and physical controls on tabletops
Authors: Malte Weiss, Julie Wagner, Yvonne Jansen, Roger Jennings, Ramsin Khoshabeh, James D. Hollan, Jan Borchers
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We present Silicone iLluminated Active Peripherals (SLAP), a system of tangible, translucent widgets for use on multitouch tabletops. SLAP Widgets are cast from silicone or made of acrylic, and include sliders, knobs, keyboards, and buttons. They add tactile feedback to multi-touch tables, improving input accuracy. Using rear projection, SLAP Widgets can be relabeled dynamically, providing inexpensive, battery-free, and untethered augmentations. Furthermore, SLAP combines the flexibility of virtual objects with physical affordances. We evaluate how SLAP Widgets influence the user experience on tabletops compared to virtual controls. Empirical studies show that SLAPWidgets are easy to use and outperform virtual controls significantly in terms of accuracy and overall interaction time.
Timing is everything?: the effects of timing and placement of online privacy indicators
Authors: Serge Egelman, Janice Tsai, Lorrie Faith Cranor, Alessandro Acquisti
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Many commerce websites post privacy policies to address Internet shoppers' privacy concerns. However, few users read or understand them. Iconic privacy indicators may make privacy policies more accessible and easier for users to understand: in this paper, we examine whether the timing and placement of online privacy indicators impact Internet users' browsing and purchasing decisions. We conducted a laboratory study where we controlled the placement of privacy information, the timing of its appearance, the privacy level of each website, and the price and items being purchased. We found that the timing of privacy information had a significant impact on how much of a premium users were willing to pay for privacy. We also found that timing had less impact when users were willing to examine multiple websites. Finally, we found that users paid more attention to privacy indicators when purchasing privacy-sensitive items than when purchasing items that raised minimal privacy concerns.
Equilibria of Graphical Games with Symmetries
Authors: Felix Brandt, Felix Fischer, Markus Holzer
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study graphical games where the payoff function of each player satisfies one of four types of symmetry in the actions of his neighbors. We establish that deciding the existence of a pure Nash equilibrium is NP-hard in general for all four types. Using a characterization of games with pure equilibria in terms of even cycles in the neighborhood graph, as well as a connection to a generalized satisfiability problem, we identify tractable subclasses of the games satisfying the most restrictive type of symmetry. Hardness for a different subclass is obtained via a satisfiability problem that remains NP-hard in the presence of a matching, a result that may be of independent interest. Finally, games with symmetries of two of the four types are shown to possess a symmetric mixed equilibrium which can be computed in polynomial time. We thus obtain a class of games where the pure equilibrium problem is computationally harder than the mixed equilibrium problem, unless P=NP.
Application-Specific Integrated Circuits, 1st edition
Authors: Michael John Sebastian Smith
Venue: Vlsi Systems Series (2008)

Addressing the trend in industry away from fully custom chip design to semi-custom technology, this book provides the first comprehensive introduction to Application Specific Integrated Circuits (ASICs).
Analysis of emotions in Mexican Spanish speech
Authors: Fabiola Martínez-Licona, Orlando Muñoz-Texzocotetla, Alma Martíz-Licona, John Goddard
Venue: Proceedings of the 8th conference on Signal, Speech and image processing (2008)

Classification of emotions was conducted for Mexican Spanish. Four different sets of features were used to find the best differentiation of eight emotions taken from the recordings of three poems spoken by a professional announcer. The sets of features included statistics of the fundamental frequency and the first four formants of the speech signal, the duration of pauses and the time frame intensity. The classification was made using an unsupervised neural network architecture based on a self-organized map. By considering each set of features separately, the 30ms time frame intensity was that which presented the best results splitting similar emotions like sadness, contempt, and melancholy from other kinds of emotional states like happiness, anger and derision. The results were improved by adding the mean value of the fundamental frequency to the time frame intensity; results in each poem showed the eight emotional states, including an emotion defined as normal, but the performance drops when integrating all the data into one set.
Optimal Bandwidth-Buffer Trade-off for VBR Media Transmission over Multiple Relay-Servers
Authors: R. I. Chang, M. C. Chen, M. T. Ko, J. M. Ho
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Given a client buffer, the minimum bandwidth required to transmit a pre-recorded VBR media can be computed in O(n) (n is the frame number). As n is usually very large, this resource management procedure is not suitable for online computation. We have proposed an O(nlogn) algorithm to characterize the bandwidth-buffer tradeoff for the optimal resource manage-ment. However, it can not be applied to a general multimedia network with multiple relay-servers. In this paper, we extend our problem model to consider relay-servers. In each relay-server, an O(nlogn) algorithm is proposed to decide the optimal bandwidth-buffer trade-off. With these pre-computed tradeoff functions, an O(m) QoS control procedure is designed to allo-cate the suitable bandwidth for the available buffer, where m is the number of relay-servers in the assigned transmission path.
Quantitative relationships between key performance indicators for supporting decision-making processes
Authors: Raul Rodriguez Rodriguez, Juan José Alfaro Saiz, Angel Ortiz Bas
Venue: Computers in Industry (2009)

Performance measurement systems (PMS) are tools widely used by enterprises for managing and making strategy-based decisions. A PMS defines a group of strategic objectives and associated performance indicators (KPIs) that provide information as to whether the upstream objectives are being reached or not, but with no further information about the causes. Up to now, if an objective is not being reached managers do not have further information regarding the causes; in terms of accurate information they are limited to the associated KPI. However, regarding the decisions to be made: What would they be based on? How and where to dig to find cause-effect relationships? And, even more difficult: How to make it objective? This study presents a unique proposal able to objectively - not based neither on experience nor subjective judgments - identify and quantify relationships between performance elements defined within a PMS, offering additional information to managers to make cross-enterprise decisions. Finally, the paper presents the main results obtained from applying the proposal to a real world enterprise and future research lines.
Field trial for simultaneous teleoperation of mobile social robots
Authors: Dylan F. Glas, Takayuki Kanda, Hiroshi Ishiguro, Norihiro Hagita
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

Simultaneous teleoperation of mobile, social robots presents unique challenges, combining the real-time demands of conversation with the prioritized scheduling of navigational tasks. We have developed a system in which a single operator can effectively control four mobile robots performing both conversation and navigation. We compare the teleoperation requirements for mobile, social robots with those of traditional robot systems, and we identify metrics for evaluating task difficulty and operator performance for teleoperation of mobile social robots. As a proof of concept, we present an integrated priority model combining real-time conversational demands and non-real-time navigational demands for operator attention, and in a pioneering study, we apply the model and metrics in a demonstration of our multi-robot system through real-world field trials in a shopping arcade.
Empirical performance evaluation of IETF mobile IPv6 and proxy mobile IPv6
Authors: Seung-Il Hyeon, Youn-Hee Han, Hyo-Beom Lee, Hyun-young Choi
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

With the rapid growth in the number of mobile subscribers and mobile devices, the demand high-speed Internet access is becoming a primary concern in our lives. Not long ago, the most stable and well known solution of IP-based mobility management is Mobile IPv6 (MIPv6). Even if MIPv6 is a well-known mature standard for IPv6 mobility management support, however, it has revealed some problems such as handover latency, packet loss, and signaling overhead. Thus, a new IPv6 mobility management protocol called Proxy Mobile IPv6 (PMIPv6) is being actively standardized by the IETF NETLMM Working Group. Unlike the various host-based protocols such as MIPv6, a network-based approach such as PMIPv6 has salient features and is expected to expedite the real deployment of IP-based mobility management. In this paper, we present an experimental evaluation of MIPv6 and PMIPv6, and give qualitative and quantitative analysis which highlights the main desirable features and key strengths of PMIPv6.
Study on the Remote Maintenance and Testing for EPON System
Authors: Chen Wei, Jing Xiuzhi
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This paper discusses the requirements of remote testing and maintenance for EPON. Based on the detailed analysis of related parts in IEEE802.3-2005, the paper introduces a solution of remote testing and maintenance. The extended protocol of OAM sublayer is proposed to meet the needs of maintenance and testing.
Bottleneck flows in unit capacity networks
Authors: Abraham P. Punnen, Ruonan Zhang
Venue: Information Processing Letters (2009)

The bottleneck network flow problem (BNFP) is a generalization of several well-studied bottleneck problems such as the bottleneck transportation problem (BTP), bottleneck assignment problem (BAP), bottleneck path problem (BPP), and so on. The BNFP can easily be solved as a sequence of O(logn) maximum flow problems on almost unit capacity networks. We observe that this algorithm runs in O(min{m^3^/^2,n^2^/^3m}logn) time by showing that the maximum flow problem on an almost unit capacity graph can be solved in O(min{m^3^/^2,n^2^/^3m}) time. We then propose a faster algorithm to solve the unit capacity BNFP in O(min{m(nlogn)^2^/^3,m^3^/^2logn}) time, an improvement by a factor of at least logn3. For dense graphs, the improvement is by a factor of logn. On unit capacity simple graphs, we show that BNFP can be solved in O(mnlogn) time, an improvement by a factor of logn. As a consequence we have an O(mnlogn) algorithm for the BTP with unit arc capacities.