ppxscal/embedding_network huggingface dataset:
Exploring social interactions and attributes of casual multiplayer mobile gaming
Authors: Kevin A. Li, Scott Counts
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

We explored the social and gaming attributes of interactive casual gaming on mobile phones. To do so, we developed a game called MoMENTus, a multiplayer mobile brain teaser game, and deployed it to 43 participants, divided into various multiplayer and team configurations, over the course of one week. Participants generally liked the interactive and mobile aspects of our casual game, while the team concept was unexpectedly less compelling. Our results suggest that mobile multiplayer casual gaming is a promising new direction, with game play fostering a feeling of community among players. Team play was found to be counter to the casual nature of the game, but competition acted as an effective motivator. Additionally, since mobile phones are "always-on-person," casual mobile gaming was successful in filling interstitial time. Findings address aspects of multiplayer mobile casual gaming, such as the role of competition, manner in which these games are played, and the impact of the type of content on such games. Implications for the design of interactive casual games for mobile phones are discussed.
Fuzzy approximately cubic mappings
Authors: Alireza Kamel Mirmostafaee, Mohammad Sal Moslehian
Venue: Information Sciences: an International Journal (2008)

We establish some stability results concerning the cubic functional equationf(2x+y)+f(2x-y)=2f(x+y)+2f(x-y)+12f(x)in fuzzy normed spaces. We discuss the fuzzy continuity of the cubic mappings and show that the existence of a solution for any approximately cubic mapping guarantees the completeness of the fuzzy normed space.
SLACP: A Novel Link-Layer Protocol for Wireless WANs
Authors: Davide Astuti, Aki Nyrhinen, Ilpo Järvinen, Markku Kojo
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In this paper, we discuss the design details of a TCP/IP-friendly link-layer protocol with novel design to improve TCP performance on network paths involving a Wireless Wide-Area Network (WWAN) link. Our link layer protocol utilizes a new hybrid error-recovery mechanism combining Automatic Repeat reQuests (ARQ) and Forward Error Correction (FEC) in a way that keeps the residual packet-error rate at a very low level and minimizes the additional delay due to ARQ at the same time. The protocol supports several QoS classes by implementing several logical channels over a single physical link and by allowing each channel to be configured with QoS parameters and error control strategy that best suit to the IP traffic directed over the channel. We analyze the error recovery behavior of the protocolusing packet traces from our experiments with the real implementation of the protocol and evaluate the protocol performance and the effectiveness of the QoS supportin emulated wireless link environments. The results show significant TCP performance improvement and that the QoS approach supports delay-sensitive traffic effectively.
Trust on the world wide web: a survey
Authors: Jennifer Golbeck
Venue: Foundations and Trends in Web Science (2006)

The success of the Web is based largely on its open, decentralized nature; at the same time, that allows for a wide range of perspectives and intentions. Trust is required to foster successful interactions and to filter the abundance of information. In this review, we present a comprehensive survey of trust on the Web in all its contexts. Three main targets of trust are identified: content, services, and people. Trust in the content on the Web, including webpages, websites, and Semantic Web data is addressed first. Then, we move on to look at services including peer-to-peer environments and Web services. This includes a discussion of Web policy frameworks for access control. People are the final group, where we look at the role of trust in web-based social networks and algorithms for inferring trust relationships. Finally, we review applications that rely on trust and address how they utilize trust to improve functionality and interface.
Geometric Hermite interpolation with circular precision
Authors: Gerald Farin
Venue: Computer-Aided Design (2008)

We present several Hermite-type interpolation methods for rational cubics. In case the input data come from a circular arc, the rational cubic will reproduce it.
A study on an information recommendation system that provides topical information related to user's inquiry for information retrieval
Authors: Ichiro Kobayashi, Mai Saito
Venue: New Generation Computing (2008)

As the Internet has been commonly used in our everyday lives, we have been able to obtain large amount of information from it, whereas we have simultaneously had a problem that it is difficult to find proper information for us from the large amount of information on the Web. Although many information recommendation methods have been proposed in order to solve this problem, most recommendation methods are based on a large amount of user's personal data such as operation log, schedule, etc - which means that we have to manage a large amount of personal data in the system in order to provide proper information to users, and it would be expensive to construct such a system. With this background, in this study, against aiming to construct a sophisticated information recommendation system based on large personal data, we propose a handy and not expensive information recommendation method, working beside a normal search engine, which does not depend on user profile data, but on topical news information.
Interrupt Costs in Embedded System with Short Latency Hardware Accelerators
Authors: Sébastien Lafond, Johan Lilius
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

The current trend for handheld device is to provide the users various embedded multimedia applications. These new applications constrain architecture developers to embed dedicated hardware accelerators in order to meet the application timing requirements. However the use of dedicated monolithic hardware accelerators is onerous to achieve due to physical and economical constraints. When the multimedia applications share common functionalities, monolithic hardware accelerators could be split into smaller accelerators in order to cut down redundancy in hardware implemented functionalities and save silicon area. Nevertheless lowering the granularity of accelerator will increase synchronization calls between the main processor and the accelerators. This paper presents a methodology for analyzing the impact of short latency hardware accelerators on a typical embedded system. We show that hardware accelerator granularity has a direct effect on the system performance in terms of cache misses, execution time and thus energy consumption.
Prototype machine translation system from text-to-Indian sign language
Authors: Tirthankar Dasgupta, Anupam Basu
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

This paper presents a prototype Text-To-Indian Sign Language (ISL) translation system. The system will help dissemination of information to the deaf people in India. This paper also presents the SL-dictionary tool, which can be used to create bilingual ISL dictionary and can store ISL phonological information.
Expressing a fraction of two determinants as a determinant
Authors: Erich Kaltofen, Pascal Koiran
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

Suppose the polynomials f and g in K[x1,...,xr] over the field K are determinants of non-singular m x m and n x n matrices, respectively, whose entries are in K ∪ x1,...,xr. Furthermore, suppose h = f/g is a polynomial in K[x1,..., xr]. We construct an s x s matrix C whose entries are in K ∪ x1,...,xr, such that h = det(C) and s = γ (m+n)6, where γ = O(1) if K is an infinite field or if for the finite field K = F{q} with q elements we have m = O(q), and where γ = (logq m)1+o(1) if q = o(m). Our construction utilizes the notion of skew circuits by Toda and WSK circuits by Malod and Portier. Our problem was motivated by resultant formulas derived from Chow forms. Additionally, we show that divisions can be removed from formulas that compute polynomials in the input variables over a sufficiently large field within polynomial formula size growth.
Distributed Detection in Wireless Sensor Networks
Authors: Sheng-Tzong Cheng, Szu-Yun Li, Chia-Mei Chen
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Wireless sensor networks (WSNs) usually are applied in military systems, surveillance systems, etc. Since WSNs always are deployed in open environments, the security mechanisms in WSNs are very important. Although there are many security mechanisms in WSNs, such as intrusion detection and fault tolerant system, few of them are proposed to detect compromised sensors. In this paper, we propose an application-independent detection model, distributed cross-layer detection model (DCD), making use of a distributed mechanism and the information of each layer in the communication protocol to detect which sensors were already compromised. Due to the characteristics of low power, low computation ability, low storage space, simplicity and high-efficiency is our design goal. Only when compromised sensors can be detected, the WSNs could be safer in practice.
MPEG-4 AVC Video Traffic Smoothing for Broadband Cable Networks
Authors: Benny Bing
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

This paper presents a new rate-limited traffic smoothing algorithm for MPEG-4 AVC video traffic suitable for switched digital video cable deployments. It will be shown that the algorithm reduces bit rate variability and offers high buffer utilization. Such a smoothing algorithm can also minimize packet losses due to buffer overflows at the STB.
Solving partial differential equations on irregular domains with moving interfaces, with applications to superconformal electrodeposition in semiconductor manufacturing
Authors: J. A. Sethian, Ying Shan
Venue: Journal of Computational Physics (2008)

We present a numerical algorithm for solving partial differential equations on irregular domains with moving interfaces. Instead of the typical approach of solving in a larger rectangular domain, our approach performs most calculations only in the desired domain. To do so efficiently, we have developed a one-sided multigrid method to solve the corresponding large sparse linear systems. Our focus is on the simulation of the electrodeposition process in semiconductor manufacturing in both two and three dimensions. Our goal is to track the position of the interface between the metal and the electrolyte as the features are filled and to determine which initial configurations and physical parameters lead to superfilling. We begin by motivating the set of equations which model the electrodeposition process. Building on existing models for superconformal electrodeposition, we develop a model which naturally arises from a conservation law form of surface additive evolution. We then introduce several numerical algorithms, including a conservative material transport level set method and our multigrid method for one-sided diffusion equations. We then analyze the accuracy of our numerical methods. Finally, we compare our result with experiment over a wide range of physical parameters.
Deploying on the Grid with DeployWare
Authors: Areski Flissi, Jérémy Dubus, Nicolas Dolet, Philippe Merle
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

In this paper, we present DeployWare to address the deployment of distributed and heterogeneous software systems on large scale infrastructures such as grids. Deployment of software systems on grids raises many challenges like 1) the complexity to take into account orchestration of all the deployment tasks and management of software dependencies, 2) the heterogeneity of both physical infrastructures and software composing the system to deploy, 3) the validation to early detect errors before concrete deployments and 4) scalability to tackle thousands of nodes. To address these challenges, DeployWare provides a metamodel that abstracts concepts of the deployment, a virtual machine that executes deployment processes on grids from DeployWare descriptions, and a graphical console that allows to manage deployed systems, at runtime. To validate our approach, we have experimented DeployWare with a lot of software technologies, such as CORBA and SOA-based systems, on one thousand of nodes of Grid'5000, the french experimental grid infrastructure.
Applying Semantic Web Services to Web-Based IS and Applications
Authors: Ranjit Bose
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Semantic Web and Web Services are emerging Web-based technologies, each having its niche contribution within the context of developing Web-based information systems and applications. Their combination, called Semantic Web Services (SWS), provides several potential opportunities and challenges to all individual stakeholders of e-business. This study aims to bring awareness and discussion of important issues related to the impact SWS would likely have on the design, development, and utilization of e-business systems. Additionally, the research sheds some light for IS researchers and practitioners by identifying several research areas for further advancement of SWS technology applications within e-business.
SGDs with doubly transitive automorphism group
Authors: Peter J. Cameron
Venue: Journal of Graph Theory (1999)

Symmetric graph designs, or SGDs, were defined by Gronau et al. as a common generalization of symmetric BIBDs and orthogonal double covers. This note gives a classification of SGDs admitting a 2-transitive automorphism group. There are too many for a complete determination, but in some special cases the determination can be completed, such as those that admit a 3-transitive group, and those with &lambda; = 1. The latter case includes the determination of all near 1-factorizations of Kn (partitions of the edge set into subsets each of which consists of disjoint edges covering all but one point), which admit 2-transitive groups. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 32: 229233, 1999
Dynamic taint propagation: Finding vulnerabilities without attacking
Authors: Brian Chess, Jacob West
Venue: Information Security Tech. Report (2008)

We apply dynamic taint propagation to find input validation bugs using less effort than typical security testing. We monitor a target program as it executes in order to track untrusted user input. Our system works in conjunction with normal functional testing, so effort devoted to functional testing can be directly leveraged to uncover vulnerabilities. The result is that we achieve higher test coverage (and therefore find more bugs) than typical security testing techniques and make it practical for quality assurance organizations with no security experience to test the security of the software they examine.
Constraint-driven floorplan repair
Authors: Michael D. Moffitt, Jarrod A. Roy, Igor L. Markov, Martha E. Pollack
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2008)

In this work, we propose a new and efficient approach to the floorplan repair problem, where violated design constraints are satisfied by applying small changes to an existing rough floorplan. Such a floorplan can be produced by a human designer, a scalable placement algorithm, or result from engineering adjustments to an existing floorplan. In such cases, overlapping modules must be separated, and others may need to be repositioned to satisfy additional requirements. Our algorithmic framework uses an expressive graph-based encoding of constraints which can reflect fixed-outline, region, proximity and alignment constraints. By tracking the implications of existing constraints, we resolve violations by imposing gradual modifications to the floorplan, in an attempt to preserve the characteristics of its initial design. Empirically, our approach is effective at removing overlaps and repairing violations that may occur when design constraints are acquired and imposed dynamically.
Using formal models to objectively judge quality of multi-threaded programs in empirical studies
Authors: Laura K. Dillon, R. E. K. Stirewalt, Eileen Kraemer, Shaohua Xie, Scott D. Fleming
Venue: Proceedings of the 2008 international workshop on Models in software engineering (2008)

Empirical studies are important for understanding how well current design methods and notations support development of multi-threaded programs. Unfortunately, concurrency exacerbates an already difficult problem in drawing conclusions from such studies: How to objectively measure the quality of candidate solutions produced by participants in the studies. This paper explores the use of formal modeling and analysis for this purpose. We describe initial findings of a small pilot study to determine if we can objectively differentiate sample candidate solutions with respect to their use of synchronization primitives. To do so, we faithfully model these candidate solutions and various synchronization-related properties in the Finite State Processes (FSP) notation and use the Labeled Transition System Analyzer (LTSA) to analyze the solution models against the properties.
Information Security Policy Development and Implementation
Authors: Avinash W. Kadam
Venue: Information Systems Security (2007)

Development of the information security policy is a critical activity. Credibility of the entire information security program of an organization depends upon a well-drafted information security policy. Most of the stakeholders do not have time or inclination to wade through a lengthy policy document. This article tries to formulate an approach to the information security policy development that will make the policy document capture the essentials of information security as applicable to a business. The document will also convey the urgency and importance of implementing the policy, not only in letter but also in spirit.
Readers' choice awards 2008
Authors: James Gray
Venue: Linux Journal (2008)

The results of the 2008 Readers' Choice Awards are in! How do your preferences compare with those of the larger reader community? Get ready for some surprises!
Advantages of flow bindings: an embedded mobile network use case
Authors: Antoine Boutet, Benoit Le Texier, Julien Montavont, Nicolas Montavont, Guillaume Schreiner
Venue: Proceedings of the 4th International Conference on Testbeds and research infrastructures for the development of networks & communities (2008)

This paper reports a demonstration of embedded communication systems on bicycles, and shows the advantages of Flow Bindings associated with the Network Mobility Basic Support (NEMO BS) protocol to distribute traffic along various paths. In June 2007 we demonstrated a new E-bike system by using the ANEMONE Mobile IPv6 testbed. In practice, three bicycles equipped with user terminals evolved on the university campus named Beaulieu in Rennes, France. All user terminals were connected to the IPv6 Internet via a mobile and multi-interfaced router with Network Mobility Basic Support protocol. This protocol included for the first time the Flow Bindings support in order to optimize the different network accesses. In this paper, we show why it is important to install flow policies on an embedded mobile network in order to distribute and filter applications according to the connectivity of the mobile network.
On the asymmetric complexity of the group-intersection problem
Authors: Takunari Miyazaki
Venue: Information Processing Letters (2008)

Motivated by the question of determining the difference in complexity between the graph-isomorphism and graph-automorphism problems, we study the relationship between the coset-intersection (C-INT) and group-intersection (G-INT) problems in permutation groups. We prove that G-INT is related to C-INT asymmetrically under Ogiwara and Watanabe's notions of left and right sets. This asymmetry suggests that, for given two permutation groups that intersect nontrivially, finding the least nonidentity element in the intersection is likely to be easier than finding the largest nonidentity element in the intersection under any lexicographic ordering. Also as a consequence, unless C-INT (resp., G-INT) @?P, C-INT (resp., G-INT) is not many-one reducible in polynomial time to any sparse set.
Ksensor: Multithreaded kernel-level probe for passive QoS monitoring
Authors: Alejandro Munoz, Armando Ferro, Fidel Liberal, Javier Lopez
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Traffic monitoring is an increasingly important discipline for nowadays networking, as Accounting, Security and Traffic Engineering lay on it. Besides, traffic bandwidth has increased exponentially in the last few years, and high-speed network monitoring has become a challenging task. Performance requirements are highly relevant for passive QoS monitoring systems. A low-level study of the capturing and processing stages on a traffic analysis system (TAS) has shown room for improvement. We provide an architecture able to cope with high-speed traffic monitoring using commodity hardware. Our system is intended to exploit the parallelism available in up-to-date workstations, which also introduces constraints for multithreaded QoS analysis. This paper presents a kernel-level framework (ksensor) that, keeping the previous requirements, removes some issues from user-level processing and effectively integrates QoS algorithms, improving the overall performance.
Erdős--Ko--Rado theorems for permutations and set partitions
Authors: Cheng Yeaw Ku, David Renshaw
Venue: Journal of Combinatorial Theory Series A (2008)

Let Sym([n]) denote the collection of all permutations of [n]={1,...,n}. Suppose A@?Sym([n]) is a family of permutations such that any two of its elements (when written in its cycle decomposition) have at least t cycles in common. We prove that for sufficiently large n, |A|=
Is It Finally Time to Worry about Mobile Malware?
Authors: George Lawton
Venue: Computer (2008)

With smart-phone use growing rapidly and devices gaining more capabilities that create possible vulnerabilities, experts think mobile malware finally might be about to become an important issue.