ppxscal/embedding_network huggingface dataset:
Cross-Channel Customer Mapping
Authors: Jayanta Basak, Sunil Goyal
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In multi-channel setting (for example, web channel and storefront), one often is required to generate an integrated view of customers across channels for making better CRM, marketing and merchandizing decisions. It is essential to identify a customer uniquely across channels to generate an integrated customer view. It is often not feasible to impose a unique identifier on a customer across channels. Moreover, a customer may not provide true demographic information, making it even more difficult to track. In the absence of a unique identifier and correct demographic information, the behavioral signature of a customer can perhaps be used to track customer across channels (cross-channel customer mapping) where behavioral signature comprises of the channel-independent behavioral characteristics. We define certain channel-independent behavioral characteristics that are easily computable and adaptable with incremental information gain. We then provide algorithms to match behavioral signatures across channels. We demonstrate our methodology using 'Safeway' data, where we achieved significant accuracy, for example, over 90% for the high value customers.
An Interactive Video Course Platform with Authoring and Playback Systems
Authors: Han-Bin Chang, Timothy K. Shih, Hui-Huang Hsu, Chun-Chia Wang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Interactive video was developed to enable different video experiences to users. By using the technology, video materials can be augmented to attract students. An interactive video course platform integrated with authoring and playback systems is proposed in this paper. Content providers can produce interactive video courses by using the interactive video authoring tool. Video files will be cut into several smaller segments called scenes as the basic unit in a video course. Interactive objects and multimedia resources can also be inserted to video courses to enhance variety. Users can play interactive video via the proposed playback platform. Interactions, messages and other multimedia objects will be displayed in scenes when users browse video courses. The integrated system was used in class room and received positive feedbacks. Interested readers are welcome to visit our demonstrations at http://member.mine.tku.edu.tw/www/ham/IVEL.wmv.
FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks
Authors: Winnie Louis Lee, Amitava Datta, Rachel Cardell-Oliver
Venue: IEEE Transactions on Parallel and Distributed Systems (2008)

FlexiTP is a novel TDMA protocol that offers a synchronized and loose slot structure. Nodes in the network can build, modify, or extend their scheduled number of slots during execution, based on their local information. Nodes wake up for their scheduled slots, otherwise switch into power-saving sleep mode. This flexible schedule allows FlexiTP to be strongly fault tolerant and highly energy efficient. FlexiTP is scalable for large number of nodes because its depth-first-search schedule minimizes buffering and it allows communication slots to be reused by nodes outside each others' interference range. Hence, the overall scheme of FlexiTP provides end-to-end guarantees on data delivery: throughput, fair access, and robust self-healing, whilst also respecting the severe energy and memory constraints of wireless sensor networks. Simulations in ns-2 show that FlexiTP ensures energy-efficiency and is robust to network dynamics (faults such as dropped packets, nodes joining or leaving the network) under various network configurations (network topology and network density), providing an efficient solution for data gathering applications. Furthermore, under high contention, FlexiTP outperforms Z-MAC in the average packet delay, energy saving and throughput.
List Update Algorithms for Data Compression
Authors: Reza Dorrigiv, Alejandro López-Ortiz, J. Ian Munro
Venue: Proceedings of the Data Compression Conference (2008)

List update algorithms have been widely used as subroutines in compression schemas, most notably as part of Burrows-Wheeler compression. The Burrows-Wheeler transform (BWT), which is the basis of many state-of-the-art general purpose compressors applies a compression algorithm to a permuted version of the original text. List update algorithms are a common choice for this second stage of BWT-based compression. In this paper we perform an experimental comparison of various list update algorithms both as stand alone compression mechanisms and as a second stage of the BWT-based compression. Our experiments showMTF outperforms other list update algorithms in practice after BWT. This is consistent with the intuition that BWT increases locality of reference and the predicted result from the locality of reference model of Angelopoulos et al. [LATIN 2008]. Lastly, we observe that due to an often neglected difference in the cost models, good list update algorithms may be far from optimal for BWT compression and construct an explicit example of this phenomena. This is a fact that had yet to be supported theoretically in the literature.
Adaptive active network control and management system (AANCMS)
Authors: Morteza Mosavi, Mahdi Jalili-Kharaajoo
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

In this paper, the general architecture of adaptive control and management in active networks is presented. The proposed Adaptive Active Network Control and Management System (AANCMS) merges technology from network management and distributed simulation to provide a unified paradigm for assessing, controlling and designing active networks. AANCMS introduces a framework to assist in managing the substantial complexities of software reuse and scalability in active network environments. Specifically, AANCMS provides an extensible approach to the dynamic integration, management, and runtime assessment of various network protocols in live network operations.
Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation
Authors: Ondřej Lhoták, Laurie Hendren
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2008)

We present Paddle, a framework of BDD-based context-sensitive points-to and call graph analyses for Java, as well as client analyses that use their results. Paddle supports several variations of context-sensitive analyses, including call site strings and object sensitivity, and context-sensitively specializes both pointer variables and the heap abstraction. We empirically evaluate the precision of these context-sensitive analyses on significant Java programs. We find that that object-sensitive analyses are more precise than comparable variations of the other approaches, and that specializing the heap abstraction improves precision more than extending the length of context strings.
On the use of metatypes for safe embedded operating system extension
Authors: Gilles Grimaud, Yann Hodique, Isabelle Simplot-Ryl
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

We present in this paper an extensible system for small secure embedded devices. We advocate the use of a typed intermediate language as a transformation of various high level languages. We present an extensible type system that unifies in a unique hierarchy some type systems from various source languages and ensures integrity and confidentility. To increase execution efficiency and use flexibility, we propose a dynamic binding mechanism that allows the programmer to describe the bindings of his code without breaking the type system. We also design the whole type system so that future addition of new kinds of objects has as little impact as possible.
Formal Verification of Websites
Authors: Sonia Flores, Salvador Lucas, Alicia Villanueva
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

In this paper, a model for websites is presented. The model is well-suited for the formal verification of dynamic as well as static properties of the system. A website is defined as a collection of web pages which are semantically connected in some way. External web pages (which are related pages not belonging to the website) are treated as the environment of the system. We also present the logic which is used to specify properties of websites, and illustrate the kinds of properties that can be specified and verified by using a model-checking tool on the system. In this setting, we discuss some interesting properties which often need to be checked when designing websites. We have encoded the model using the specification language Maude which allows us to use the Maude model-checking tool.
Long-Term CPU Load Prediction System for Scheduling of Distributed Processes and its Implementation
Authors: Yoshihiro Sugaya, Hiroshi Tatsumi, Mitiharu Kobayashi, Hirotomo Aso
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

There exist distributed processing environments composed of many heterogeneous computers. It is required to schedule distributed parallel processes in an appropriate manner.For the scheduling, prediction of execution load of a process is effective to exploit resources of environments. We propose long-term load prediction methods with references of properties of processes and of runtime predictions. Since an appropriate prediction method is different according to the situation, we propose a prediction module selection to select an appropriate prediction method according to a state of changing CPU load using a neural network. We also discuss about the implementation of a long-term CPU load prediction system, which provides information including prediction of load for schedulers, system administrators and users.
Gap between advertisers and designers: Results of visualizing messages
Authors: Yukio Ohsawa, Madoka Ishii
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

We analyzed the data on the thoughts of designers and people surrounding designers. Qualitative approach using Pictorial KeyGraph was applied for analysis, for comparing these people, in face of the gaps of vocabularies. The results are implying that the designers concepts tend to be hidden to other sections in the company, and to people out side. However, the resented results also show the concepts shared by designers correspond to the essential common context of the products made from the company, i.e, the brand identity.
Preprocessing Position Data of Mobile Objects
Authors: Nicola Hönle, Matthias Grossmann, Daniela Nicklas, Bernhard Mitschang
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

We present the design and implementation of a component for the preprocessing of position data taken from moving objects. The movement of mobile objects is represented by piecewise functions over time that approximate the real object movement and significantly reduce the initial data volume such that effcient storage and analysis of object trajectories can be achieved. The maximal acceptable deviation - an input parameter of our algorithms - of the approximations also includes the uncertainty of the position sensor measurements. We analyze and compare five different lossy preprocessing methods. Our results clearly indicate that even with simple approaches, a more than sufficient overall performance can be achieved.
An expected-utility based approach to variation aware VLSI optimization under scarce information
Authors: Upavan Gupta, Nagarajan Ranganathan
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

In this research, we propose a novel approach for simultaneous optimization of power, crosstalk noise and delay via gate sizing, in the presence of scarce information about the distribution of the variations. The methodology uses the concepts of utility theory and risk minimization to identify a deterministic equivalent model of the stochastic problem, ensuring high levels of expected utilities of constraints, and significant speedup in the optimization process for large circuits. A comparative study with an existing gate sizing methodology shows that our method is multi-fold faster as well as comparable in terms of the optimization.
A multi-issue negotiation protocol among agents with nonlinear utility functions
Authors: Takayuki Ito, Mark Klein, Hiromitsu Hattori
Venue: Multiagent and Grid Systems (2008)

Multi-Issue Negotiation protocols have been studied very widely and represent a promising field since most of negotiation problems in the real-world are complex ones including multiple issues. In particular, in reality issues are constrained each other. This makes agents' utilities nonlinear. There have been a lot of work on multi-issue negotiations. However, there have been very few work that focus on nonlinear utility spaces. In this paper, we assume agents have nonlinear utility spaces. For the linear utility domain, agents can aggregate the utilities of the issue-values by simple linear summation. In the real world, such aggregations are unrealistic. For example, we cannot just add up the value of car's tires and the value of car's engine when engineers design a car. In this paper, we propose an auction-based multiple-issue negotiation protocol among nonlinear utility agents. Our negotiation protocol employs several techniques, i.e., adjusting sampling, auction-based maximization of social welfare. Our experimental results show that our method can outperform the existing simple methods in particular in the huge utility space that can be often found in the real-world. Further, theoretically, our negotiation protocol can guarantee the completeness if some conditions are satisfied.
Fear-type emotion recognition for future audio-based surveillance systems
Authors: C. Clavel, I. Vasilescu, L. Devillers, G. Richard, T. Ehrette
Venue: Speech Communication (2008)

This paper addresses the issue of automatic emotion recognition in speech. We focus on a type of emotional manifestation which has been rarely studied in speech processing: fear-type emotions occurring during abnormal situations (here, unplanned events where human life is threatened). This study is dedicated to a new application in emotion recognition - public safety. The starting point of this work is the definition and the collection of data illustrating extreme emotional manifestations in threatening situations. For this purpose we develop the SAFE corpus (situation analysis in a fictional and emotional corpus) based on fiction movies. It consists of 7h of recordings organized into 400 audiovisual sequences. The corpus contains recordings of both normal and abnormal situations and provides a large scope of contexts and therefore a large scope of emotional manifestations. In this way, not only it addresses the issue of the lack of corpora illustrating strong emotions, but also it forms an interesting support to study a high variety of emotional manifestations. We define a task-dependent annotation strategy which has the particularity to describe simultaneously the emotion and the situation evolution in context. The emotion recognition system is based on these data and must handle a large scope of unknown speakers and situations in noisy sound environments. It consists of a fear vs. neutral classification. The novelty of our approach relies on dissociated acoustic models of the voiced and unvoiced contents of speech. The two are then merged at the decision step of the classification system. The results are quite promising given the complexity and the diversity of the data: the error rate is about 30%.
Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2n)
Authors: Kenli Li, Shuting Zou, Jin Xu
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

The analogs based on elliptic curve over finite fields of public-key cryptosystems are algorithms that converts input data to an unrecognizable encryption and converts the unrecognizable data back into its original decryption form. The security of the Elliptic Curve public-key cryptosystem is based on the difficulty of the discrete logarithm problem on elliptic curve, especially over GF(2n), + Z n . This paper demonstrates to find the discrete logarithm on elliptic curve, and is a breakthrough in basic biological operations using a molecular computer. In order to achieve this, we propose three DNA-based algorithms for parallel adder, parallel multiplier, and parallel getting inverse over GF(2n). The biological operation time of these algorithms are all polynomial with respect to n. This work indicates that the cryptosystems using public-key are perhaps insecure and also presents clear evidence of the ability of molecular computing to perform complicated mathematical operations.
An Empirical Study of Evolution of Inheritance in Java OSS
Authors: E. Nasseri, S. Counsell, M. Shepperd
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Previous studies of Object-Oriented (OO) software have reported avoidance of the inheritance mechanism and cast doubt on the wisdom of ‘deep’ inheritance levels. From an evolutionary perspective, the picture is unclear - we still know relatively little about how, over time, changes tend to be applied by developers. Our conjecture is that an inheritance hierarchy will tend to grow ‘breadth-wise’ rather than ‘depth-wise’. This claim is made on the basis that developers will avoid extending depth in favour of breadth because of the inherent complexity of having to understand the functionality of superclasses. Thus the goal of our study is to investigate this empirically. We conduct an empirical study of seven Java Open-Source Systems (OSSs) over a series of releases to observe the nature and location of changes within the inheritance hierarchies. Results showed a strong tendency for classes to be added at levels one and two of the hierarchy (rather than anywhere else). Over 96% of classes added over the course of the versions of all systems were at level 1 or level 2. The results suggest that changes cluster in the shallow levels of a hierarchy; this is relevant for developers since it indicates where remedial activities such as refactoring should be focused.
Translating Service Level Objectives to lower level policies for multi-tier services
Authors: Yuan Chen, Subu Iyer, Xue Liu, Dejan Milojicic, Akhil Sahai
Venue: Cluster Computing (2008)

Service providers and their customers agree on certain quality of service guarantees through Service Level Agreements (SLA). An SLA contains one or more Service Level Objectives (SLO)s that describe the agreed-upon quality requirements at the service level. Translating these SLOs into lower-level policies that can then be used for design and monitoring purposes is a difficult problem. Usually domain experts are involved in this translation that often necessitates application of domain knowledge to this problem. In this article, we propose an approach that combines performance modeling with regression analysis to solve this problem. We demonstrate that our approach is practical and that it can be applied to different n-tier services. Our experiments show that for a typical 3-tier e-commerce application in a virtualized environment, the SLA can be met while improving CPU utilization by up to 3 times.
Optimizing active ranges for consistent dynamic map labeling
Authors: Ken Been, Martin Nöllenburg, Sheung-Hung Poon, Alexander Wolff
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

Map labeling encounters unique issues in the context of dynamic maps with continuous zooming and panning-an application with increasing practical importance. In consistent dynamic map labeling, distracting behavior such as popping and jumping is avoided. In the model for consistent dynamic labeling that we use, a label becomes a 3d-solid, with scale as the third dimension. Each solid can be truncated to a single scale interval, called its active range, corresponding to the scales at which the label will be selected. The active range optimization (ARO) problem is to select active ranges so that no two truncated solids overlap and the sum of the heights of the active ranges is maximized. The simple ARO problem is a variant in which the active ranges are restricted so that a label is never deselected when zooming in. We investigate both the general and simple variants, for 1d- as well as 2d-maps. The 1d-problem can be seen as a scheduling problem with geometric constraints, and is also closely related to geometric maximum independent set problems. Different label shapes define different ARO variants. We show that 2d-ARO and general 1d-ARO are NP-complete, even for quite simple shapes. We solve simple 1d-ARO optimally with dynamic programming, and present a toolbox of algorithms that yield constant-factor approximations for a number of 1d- and 2d-variants.
Evaluating the Effects of Mobile Technology on an Outdoor Experiential Learning
Authors: Fei Ching Chen, Chih Hung Lai, Jie Chi Yang, Jing San Liang, Tak-Wai Chan
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

The aim of this study is to evaluate the effects of mobile technology on an outdoor experiential learning. We developed a mobile learning system with a learning flow to support an outdoor activity and then analyzed how PDA devices were incorporated and implemented in two classes of primary school students. The results indicate that knowledge creation was more effective in the class with PDAs than in the one without them. However, using activity theory as an analytical framework, we further discovered that underlying tensions provided rich insights into system dynamics and that technological affordances could be limited by a mismatch between the tools as such, and the way in which they were used by learners or were arranged by the instructor. The subtle human factors present in the use of technologies should be carefully considered. The influence of mobile devices on learner experiences in experiential learning is also thoroughly discussed.
Fabrication of nanoimprint template in Si with high etch rate by non-switch DRIE process
Authors: Xudi Wang, Yifang Chen, Ling Wang, Zheng Cui
Venue: Microelectronic Engineering (2008)

A non-switch deep reactive ion etching (DRIE) process for rapid fabrication of nanoimprint templates has been developed. High etch rate without the scalloping effect has been achieved using inductive coupling plasma (ICP) with gas mixture of SF"6, C"4F"8, O"2 and Ar. The dependences of etch rate, selectivity, and etch profile on chamber pressure, platen power, and the ratio of different gases in the gas mixture were investigated and optimized process conditions were established. Silicon line pattern of 100nm wide with the aspect ratio of 10:1 have been fabricated with the non-switch DRIE process. The fabricated template was used to imprint UV cured SU-8 photoresist.