ppxscal/embedding_network huggingface dataset:
Protection of Location Privacy using Dummies for Location-based Services
Authors: Hidetoshi Kido, Yutaka Yanagisawa, Tetsuji Satoh
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Recently, highly accurate positioning devices enable us to provide various types of location-based services. On the other hand, because position data obtained by such devices include deeply personal information, protection of location privacy is one of the most significant issues of location-based services. Therefore, we propose a technique to anonymize position data. In our proposed technique, the psrsonal user of a location-based service generates several false position data (dummies) sent to the service provider with the true position data of the user. Because the service provider cannot distinguish the true position data, the user's location privacy is protected. We conducted performance study experiments on our proposed technique using practical trajectory data. As a result of the experiments, we observed that our proposed technique protects the location privacy of users.
Micro analysis & design: Micro Saint Sharp
Authors: Ben Archer
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Micro Saint Sharp: everthing you need in simulation. Micro Saint Sharp is a general purpose, discrete-event simulation software tool. Its intuitive graphical user interface and flow chart approach to modeling make it a tool that can be used by everyone. You can view your models three ways: network diagram, 2D or 3D animation. Come see a demo of the latest enhancements to Micro Saint Sharp! 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
A Fault-Tolerant Group Communication Protocol in Large Scale and Highly Dynamic Mobile Next-Generation Networks
Authors: Jiannong Cao, Guojun Wang, Keith C. C. Chan
Venue: IEEE Transactions on Computers (2007)

In recent years, the integration of mobile and wireless networks with wired ones has gained in popularity. Many new applications have been brought up and there is increasing demand for enhanced services supporting mobile collaborations. However, many challenging issues, such as scalability and reliability, are very difficult to tackle in such an integrated network environment rather than in the wired network environment. In this paper, we address these issues by proposing a RingNet hierarchy of proxies. This hierarchy is a combination of logical rings and logical trees. Therefore, it takes advantages of the simplicity of logical rings and the scalability of logical trees. More importantly, such a combination makes this hierarchy more reliable than the tree-based hierarchy. Based on this hierarchy, we propose a fault-tolerant group communication protocol in large scale and highly dynamic groups. Both theoretical analysis and simulation studies show that this protocol scales very well when the size of the network becomes large and that it is highly resilient to failures when the node failure probability becomes large. This protocol is especially suitable for those service providers and network operators who have deployed their machines in a hierarchical setting, where each machine can be locally configured to know the information about its sibling and parent machines.
Web Services Publishing and Discovery on Peer-to-Peer Overlay
Authors: JianJun Yu, Rui Chen, Hao Su, Shengmin Guo
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Centralized UDDI currently becomes harder to catch up with the need of Internet-scale service publishing and discovery. Peer-to-Peer technology with its advantages of scalability, fault-tolerance and dynamics is suitable for loose-coupled Web services' distribution in nature and prevailing nowadays. In this paper, we present a distributed, collaborative Peer-to-Peer service overlay suitable for service publishing and discovery based on Skip Graph which could be organized by planar model or tree model according to the scale of services. We propose a prefix-ordered clustering mechanism that congregates the keys within a fixed prefix into the same bucket and make the smallest one appeared as the key in the service overlay which would support prefix, range query and semantic matching onWeb services. We then analyze the performance of our proposed with simulation that validates the effectiveness of the service overlay.
Exploring interface options in multimedia educational environments
Authors: Gordon Shippey, Mark Guzdial, Ashwin Ram, Richard Catrambone, Florian Albrecht, Michael Byrne, Janis Roberts, John Stasko
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

Multimedia technology allows information to be organized and represented in a wide variety of ways. For a computer-based educational environment to be effective, the subject matter must be presented in a clear and comprehensible format. Many multimedia applications organize information based on its physical format, i.e., sound clips, still images, text, and so on. However it is also possible to organize information based on the learner's plan to use information. Such "cognitive media types", media organized around cognition rather than physical format, include definitions, examples, worked problems, and problem sets [Recker, Ram, Shikano, Li & Stasko 1995].
Rethinking Network Management Solutions
Authors: Stefan Wallin, Viktor Leijon
Venue: IT Professional (2006)

Input from network operators reveals that current solutions are based on faulty principles. Highly automated service-centric solutions are needed.
Therapeutic Tool for Develop Child Nonverbal Communication Skills through Interactive Game
Authors: P. Ravindra De Silva, Ajith P. Madurapperuma, Stephen G. Lambacher, Minetada Osano
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In this paper, an interactive multi-agent based system that recognizes child's emotions and the intensity of emotions to build systems for therapeutic purposes (developed child's non-verbal communication skills) is presented. It introduces the development of an arousal perception agent that uses a novel emotion intensity estimation model. The arousal perception agent uses cognitive and non-cognitive factors to estimate a child's intensity of emotions in real time. Flexible and a novel adaptation model based on emotional intensity is developed for the proposed situational control agent. The situational control agent tries to adjust the intensity of negative and positive emotions by changing the status of the game to encourage children to express natural emotions. This situational control agent reacts as therapy (adjusting motivational and encouragement support) for developing children's emotional expression through affective body gestures. An animated pedagogical agent gives motivational help with instructions (like therapy) as a means of encouragement to naturally express emotions by adapting the system in an interactive manner.
Density Estimation Technique for Data Stream Classification
Authors: Nittaya Kerdprasop, Kittisak Kerdprasop
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Density estimation is an important pre-processing step in the problem of data stream classification in which the number of data is overwhelming and the exact data distribution is unknown. We simplify the problem by employing a statistical sampling technique to obtain an approximate solution. With the proposed method, an unbounded large data set can be sampled in a number of random configurations, and that data can be used to describe the data set as a whole. The efficiency of the method depends largely on the ability to draw samples effectively which in turn depends on how close we can estimate the target density. We use finite mixture models to represent the probability density functions of the data stream. Then, we apply the EM algorithm twice to learn the model parameters. The efficiency of our estimation technique has been shown in the experimental results.
A FPGA-Based Systolic Array Prototype Implementing the Quadrant Interlocking Factorization Method
Authors: M. Ch. Karra, M. P. Bekakos
Venue: The Journal of Supercomputing (2006)

The systolic processing offers the possibility of solving a large number of standard problems on multicellular computing devices with autonomous cells (Processing Elements--PEs). The resulting systolic arrays exploit the underlying parallelism of many computationally intensive problems and offer a vital and effective way of handling them. Advances in technology and especially in VLSI and FPGA have an ongoing contribution to the evolution of systolic arrays. Herein, a FPGA-based Systolic array prototype implementing the Factorization stage of the Quadrant Interlocking Factorization--QIF (Butterfly) method is presented and the corresponding time-complexities achieved are discussed.
Learning Distance Metrics with Contextual Constraints for Image Retrieval
Authors: Steven C. H. Hoi, Wei Liu, Michael R. Lyu, Wei-Ying Ma
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Relevant Component Analysis (RCA) has been proposed for learning distance metrics with contextual constraints for image retrieval. However, RCA has two important disadvantages. One is the lack of exploiting negative constraints which can also be informative, and the other is its incapability of capturing complex nonlinear relationships between data instances with the contextual information. In this paper, we propose two algorithms to overcome these two disadvantages, i.e., Discriminative Component Analysis (DCA) and Kernel DCA. Compared with other complicated methods for distance metric learning, our algorithms are rather simple to understand and very easy to solve. We evaluate the performance of our algorithms on image retrieval in which experimental results show that our algorithms are effective and promising in learning good quality distance metrics for image retrieval.
Multi-user Video Streaming over Multi-hop Wireless Networks: A Cross-Layer Priority Queuing Scheme
Authors: Hsien-Po Shiang, Mihaela van der Schaar
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, we propose a distributed, end-to-end, integrated cross-layer scheme to maximize the decoded video quality of multiple users engaged in simultaneous real-time streaming sessions over a multi-hop wireless network. Our algorithm explicitly considers the distortion impact and delay constraints in assigning priorities to the various packets and then relies on priority queuing to drive the optimization of the various users' transmission strategies across the multi-hop network. The proposed solution is enabled by the scalable coding of the video content and the design of cross-layer optimization strategies including a dynamic routing algorithm, which allow priority-based adaptation to varying channel conditions. Our proposed delay-driven, packet-based transmission is superior in terms of both network scalability and video quality to previous static flow-based solutions based on predetermined paths and rate requirements.
Entrepreneurship in mobile application development
Authors: Ankur Tarnacha, Carleen F. Maitland
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

The growth of mobile commerce will require development of both demand and supply sides of the market. On the supply side, the development of mobile applications (e.g. games, calendars, search engines) via cellular technologies will occur in a context partially defined by technical development dependencies that arise from the layered nature of mobile hardware and software technologies. This research finds that these technical application development dependencies shape both the strategies employed by entrepreneurs as well as the evolution of the mobile market. In particular, entrepreneurs are faced with technology choices and device uncertainties, while the market experiences fragmentation, intermediation and distribution integration. These results explain, in part, the slow development of mobile commerce in general, provide a basis for understanding future market developments, and are further evidence of the complex interdependency between technological and market evolution.
Non-normative Behaviour in Multi-agent System: Some Experiments in Traffic Simulation
Authors: Arnaud Doniec, Stephane Espie, Rene Mandiau, Sylvain Piechowiak
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Most of the works related to norms and multi-agent systems focus on the design of normative agents systems making the assumption that agents always respect norms. Our aims in this article are (i) to discuss the relevance of this assumption in some specific contexts and to highlight some benefits of designing non-normative behaviour agents, (ii) to expound the methodology followed in a concrete application which consists in traffic simulation at junction. In particular, based on statistical traffic results, we show how non-normative behaviours contribute to improving the realism of simulation.
A deferred cleansing method for RFID data analytics
Authors: Jun Rao, Sangeeta Doraiswamy, Hetal Thakkar, Latha S. Colby
Venue: Proceedings of the 32nd international conference on Very large data bases (2006)

Radio Frequency Identification is gaining broader adoption in many areas. One of the challenges in implementing an RFID-based system is dealing with anomalies in RFID reads. A small number of anomalies can translate into large errors in analytical results. Conventional "eager" approaches cleanse all data upfront and then apply queries on cleaned data. However, this approach is not feasible when several applications define anomalies and corrections on the same data set differently and not all anomalies can be defined beforehand. This necessitates anomaly handling at query time. We introduce a deferred approach for detecting and correcting RFID data anomalies. Each application specifies the detection and the correction of relevant anomalies using declarative sequence-based rules. An application query is then automatically rewritten based on the cleansing rules that the application has specified, to provide answers over cleaned data. We show that a naive approach to deferred cleansing that applies rules without leveraging query information can be prohibitive. We develop two novel rewrite methods, both of which reduce the amount of data to be cleaned, by exploiting predicates in application queries while guaranteeing correct answers. We leverage standardized SQL/OLAP functionality to implement rules specified in a declarative sequence-based language. This allows efficient evaluation of cleansing rules using existing query processing capabilities of a DBMS. Our experimental results show that deferred cleansing is affordable for typical analytic queries over RFID data.
Identity-Differentiating Widgets for Multiuser Interactive Surfaces
Authors: Kathy Ryall, Alan Esenther, Clifton Forlines, Chia Shen, Sam Shipman, Meredith Ringel Morris, Katherine Everitt, Frederic D. Vernier
Venue: IEEE Computer Graphics and Applications (2006)

By applying the iDwidgets concept, the authors supplement traditional widgets with identity differentiation that supports widget reuse, dynamic widget customization, clutter reduction, and novel multiuser widget type creation. This article introduces a conceptual framework for iDwidgets, describing four axes that application can customize by exploiting identity differentiation: function, content, appearance, and group input.
On Using Simplification and Correction Tables for Integrity Maintenance in Integrated Databases
Authors: Henning Christiansen, Davide Martinenghi
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

When a database is defined as views over autonomous sources, inconsistencies with respect to global integrity constraints are to be expected. This paper investigates the possibility of using simplification techniques for integrity constraints in order to maintain, in an incremental way, a correction table of virtual updates which, if executed, would restore consistency; access can be made through auxiliary views that take the table into account. The approach employs assumptions about local source consistency as well as cross-source constraints whenever possible.
A study on a receiver-based management scheme of access link resources for QoS-controllable TCP connections: Research Articles
Authors: Kazuhiro Azuma, Go Hasegawa, Masayuki Murata
Venue: International Journal of Communication Systems (2006)

Although the bandwidth of access networks is rapidly increasing with the latest techniques such as DSL and FTTH, the access link bandwidth remains a bottleneck, especially when users activate multiple network applications simultaneously. Furthermore, since the throughput of a standard TCP connection is dependent on various network parameters, including round-trip time and packet loss ratio, the access link bandwidth is not shared among the network applications according to the user's demands. In this thesis, we present a new management scheme of access link resources for effective utilization of the access link bandwidth and control of the TCP connection's throughput. Our proposed scheme adjusts the total amount of the receive socket buffer assigned to TCP connections to avoid congestion at the access network, and assigns it to each TCP connection according to characteristics in consideration of QoS. The control objectives of our scheme are (1) to protect short-lived TCP connections from the bandwidth occupation by long-lived TCP connections, and (2) to differentiate the throughput of the long-lived TCP connections according to the upper-layer application's demands. One of the results obtained from the simulation experiments is that our proposed scheme can reduce the delay of short-lived document transfer perceived by the receiver host by up to about 90&percnt;, while a high utilization of access link bandwidth is maintained. Copyright &copy; 2006 John Wiley & Sons, Ltd.
The JTRS Program: Software-Defined Radios as a Software Product Line
Authors: Eric Koski, Charles Linn
Venue: Proceedings of the 10th International on Software Product Line Conference (2006)

The Joint Tactical Radio System (JTRS) program of the US Department of Defense is an ambitious multiyear initiative aimed at developing a new family of highly capable software programmable radio systems designed around a common Software Communications Architecture (SCA). The procurement and development approaches of the JTRS initiative make it an interesting application of a software product line strategy.
Mining Maximum Length Frequent Itemsets: A Summary of Results
Authors: Tianming Hu, Qian Fu, Xiaonan Wang, Sam Yuan Sung
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often sufficient to mine a small representative subset of frequent itemsets with low computational cost. To that end, in this paper, we define a new problem of finding the frequent itemsets with a maximum length and present a novel algorithm to solve this problem. Indeed, maximum length frequent itemsets can be efficiently identified in very large data sets and are useful in many application domains. Our algorithm generates the maximum length frequent itemsets by adapting a pattern fragment growth methodology based on the FP-tree structure. Also, a number of optimization techniques have been exploited to prune the search space. Our experimental results show that our algorithm is very efficient and scalable.
Knowing Where Things Are in the Second Year of Life: Implications for Hippocampal Development
Authors: Julia Sluzenski, Nora S. Newcombe, Eric Satlow
Venue: Journal of Cognitive Neuroscience (2004)

Prior data have revealed striking contrasts between 18- and 24-month-old children in place learning, an ability known to depend on the hippocampus (Newcombe, Huttenlocher, Drummey, & Wiley, 1998). The current research examined the development of three other basic abilities of mature spatial competence: the representation of multiple locations, the learning of relations among objects, and the recall of a single location after a substantial filled delay. Results indicated a transition from 18 to 24 months in all three abilities. This evidence supports a general transition in spatial representation that occurs towards the end of infancy. Existing neurobehavioral data suggest that a corresponding change in hippocampal functioning underlies this development.
Toward a dialogic theory of learning: Bakhtin's contribution to understanding learning in settings of collaboration
Authors: Timothy Koschmann
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

I propose here a new theoretical framework for understanding learning as a socially-grounded phenomenon based the writings of the Russian philologist, M. M. Bakhtin. Bakhtin's writings on the dialogic nature of all texts provide the basis for a new view of language, knowledge, and learning. From this perspective, learning is seen as the process of multiple voices coming into contact, both within and across speaker-produced utterances. Examples are provided of two types of studies based on such a theory of learning: studies of the appropriation of a social language and studies of speech genres. I conclude by recounting the potential advantages of adopting dialogicality as a conceptual basis for ongoing work in CSCL.
Hand-off performance of the integrated cellular and ad hoc relaying (iCAR) system
Authors: Hongyi Wu, Swades De, Chunming Qiao, Evsen Yanmaz, Ozan K. Tonguz
Venue: Wireless Networks (2005)

In this paper, we study the hand-off performance of a wireless system with heterogeneous technologies called iCAR (Integrated Cellular and Ad hoc Relaying). In iCAR, hand-offs can occur not only from a Base Transceiver Station (BTS) to another BTS, but also from a BTS to a so-called Ad hoc Relaying Station (ARS) in the form of relaying, as well as from an ARS back to a BTS. The latter two types of tland-offs effectively increase the hand-off buffer time and thus reduce the call dropping probability. We develop an analytical model for the hand-off performance in iCAR. In addition, we verify the analytical model via simulations and quantify the hand-off performance benefits of the iCAR system over conventional cellular systems. It is anticipated that the analytical and simulation models reported in this paper will serve as a guideline to other researches on the inter-system hand-off involving heterogenous wireless technologies.