ppxscal/embedding_network huggingface dataset:
An Expert Model on Barriers to Implement Mobile Data Services
Authors: Martin Steinert
Venue: Proceedings of the International Conference on Mobile Business (2006)

Mobile Data Service for businesses were, esp. in Europe, not quite as successful as expected or forecasted. Compared to Asian success stories, European mobile data services actually failed the UMTS promise. The reasons, why European companies have refrained from implementing mobile services for themselves and their customers, remain unknown. Thus, this paper empirically describes the creation of a model of barriers factors, which hinder companies to implement mobile data services. After some preliminary model thoughts, an adapted Delphi methodology is presented. 19 European Experts have, between September 1st and November 21st 2005, contributed factors that influence a company's decision to adopt mobile data services, resulting in an "Expert Model on Barriers to Implement Mobile Data Services". This model is then tested using 362 qualitative data sets from 156 Swiss companies via a logistic regression. As a result some factors are identified that influence the usage and investment decision of companies concerning esp. packet switched mobile data services.
Innovative Ideas in Privacy Research (Keynote Talk)
Authors: Bharat Bhargava
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Privacy is fundamental to trusted collaboration and interactions to protect against malicious users and fraudulent activities. It is difficult to even impossible to preserve privacy in peer to peer large distributed system. In such networks, privacy is needed to protect the source of information, the destination (end user) of information, the route of information transmission and dissemination, and information content itself. Privacy is an illusive subject. The semantic of information itself changes with time, context, and interpretation by humans. Exact replica of private information is not available. Even the original source of the information can not present a coherent interpretation if asked to present the information twice. It may be true for numerical data but the context in which the data needs to be used may change with time. It is hard to specify the policies for privacy preservation in a legal, precise, and correct manner. It is even harder to enforce the privacy policies.
Rank-one Projections with Adaptive Margins for Face Recognition
Authors: Dong Xu, Stephen Lin, Shuicheng Yan, Xiaoou Tang
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

In supervised dimensionality reduction, tensor representations of images have recently been employed to enhance classification of high-dimensional data with small training sets. To handle tensor data, this approach has been formulated with tight restrictions on projection directions that, along with convergence issues and the assumption of Gaussian distributed class data, limits its face recognition performance. To overcome these problems, we propose a method of rank-one projections with adaptive margins (RPAM) that gives a provably convergent solution for tensor data over a more general class of projections, while accounting for margins between samples of different classes. In contrast to previous margin based works which determine margin sample pairs within the original high dimensional space, RPAM instead aims to maximize the margins defined in the expected lower dimensional feature subspace by progressive margin refinement after each rank-one projection. In addition to handling tensor data, vector-based variants of RPAM are presented for linear mappings and for nonlinear mappings using kernel tricks. Comprehensive experimental results demonstrate that RPAM brings significant improvement in face recognition over previous subspace learning techniques.
Support-based distributed search: a new approach for multiagent constraint processing
Authors: Peter Harvey, Chee Fon Chang, Aditya Ghose
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Distributed Constraint Satisfaction Problems provide a natural mechanism for multiagent coordination and agreement. To date, algorithms for Distributed Constraint Satisfaction Problems have tended to mirror existing non-distributed global-search or local-search algorithms. Unfortunately, existing distributed global-search algorithms derive from classical backtracking search methods and require a total ordering over agents for completeness. Distributed variants of local-search algorithms (such as distributed breakout) inherit the incompleteness properties of their predecessors, or depend on the creation of new communication links between agents. This paper presents an algorithm in which a global ordering is not required, while avoiding the problems of existing local-search algorithms.
A Discriminative Method For Semi-Automated Tumorous Tissues Segmentation of MR Brain Images
Authors: Yangqiu Song, Changshui Zhang, Jianguo Lee, Fei Wang
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

This paper introduces a discriminative method for semiautomated segmentation of the tumorous tissues. Due to the large data of 3D MR brain images and the blurry boundary of the pathological tissues, the segmentation is difficult. A non-parametric Bayesian Gaussian process is proposed to be used for the semi-supervised mode. This discriminative method uses both labeled data and a subset of unlabeled data sampling from 2D/3D images to classify the remains, which is called inductive problem. We propose the prior of traditional Gaussian process to be based on graph regularization and develop a new conditional probability named Extended Bernoulli Model to realize the induction. Fast algorithm to speed up the training phase is also implemented. Experimental results show our approach produces satisfactory segmentations corresponding to the manually labeled results by experts.
TRIAS--An Algorithm for Mining Iceberg Tri-Lattices
Authors: Robert Jaschke, Andreas Hotho, Christoph Schmitz, Bernhard Ganter, Gerd Stumme
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folk-sonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution as well as experimental results on a large real-world example.
Towards Adaptive Secure Group Communication: Bridging the Gap between Formal Specification and Network Simulation
Authors: Sebastian Gutierrez-Nolasco, Nalini Venkatasubramanian, Mark-Oliver Stehr, Carolyn Talcott
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

We extend an executable specification of a state-of-theart secure group communication subsystem to explore two dimensions of adaptability, namely security and synchrony under crash-recovery and intermittent connectivity scenarios. In particular, we relax the traditional requirement of virtual synchrony and propose various generic optimizations, while preserving essential security guarantees. In order to evaluate how practical and effective our generic optimizations are, we integrate the specification into ns2, bridging the gap between formal specification and classical network simulation.
PDAs as Input Devices in Brainstorming and Creative Discussions
Authors: Lars Bollen, Guillermo Juarez, Micha Westermann, H. Ulrich Hoppe
Venue: Proceedings of the Fourth IEEE International Workshop on Wireless, Mobile and Ubiquitous Technology in Education (2006)

In this paper we present the use of PDAs as input devices in brainstorming sessions and creative discussions using the Mobile Notes architecture and application. Mobile Notes enables heterogeneous, mobile input devices together with collaborative modelling environments to be used in different discussion scenarios, e.g. classroom discussions, seminars or lectures. Based on the conceptual perspective of assigning specific functionalities to different devices in technology enhanced learning environments, we describe the design, implementation and first experiences with Mobile Notes.
A guided learning strategy for vision based navigation of 4-legged robots
Authors: Ignacio Herrero, Cristina Urdiales, Jose Manuel Peula, Isabel Sanchez-Tato, Francisco Sandoval
Venue: AI Communications (2006)

This paper presents a new approach to building low level navigation behaviors for 4-legged robots through vision based demonstration learning. The main novelty of the approach is that rather than observing other entities and adapting their kinematics to the robot constraints, a supervisor controls the robot to achieve the desired behavior through a proper interface. The guided actions and the relevant input parameters are related via Case Base Reasoning, so that the robot can retrieve them later to work in an unsupervised way. This intuitive acquisition of reactive behaviors allows bottom-up construction of more complex emergent behaviors and avoids low level kinematics analysis and possible associated errors. The system has been successfully tested using a Sony Aibo robot. Experiments have proven that the robot is capable of adopting a variety of reliable behaviors depending on its relative position in relation to a ball through different trainings. Also, being reactive, the system is resistant against punctual errors and occlusions.
Risk Elicitation in Precise and Imprecise Domains - A Comparative Study, Sweden and Brazil
Authors: Ari Riabacke, Mona Pahlman, Tara Baidya
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)

This paper presents a comparative study between two groups from different cultural contexts, Sweden and Brazil, when choosing among risky prospects. The study explores whether there are differences in choice behaviours when the uncertainty in the prospects is expressed as interval estimates instead of the traditional use of point estimates, as well as when prospects are displayed with and without expected monetary values. Both groups display similar choice behaviours when they choose among prospects where uncertainty is expressed as point vs. interval estimates, whereas the Brazilian respondents are more affected by EMV information. The results indicate that the employment of intervals to represent uncertainty can be beneficial and could facilitate the elicitation part in the use and development of decision analytical tools. Furthermore, there is a need for more flexible tools, more adapted to a prescriptive approach, since people from different cultural contexts seem to differ in their choice behaviours.
Peer-to-Peer Platform for Anytime /Anywhere Connectivity in Educational Environments
Authors: Josephine KOHLENBERG, Mahendiran PRATHABAN, Sandoche BALAKRICHENAN
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Institutions are becoming wireless and most of the population are possessing wireless devices since they are becoming less expensive. Providing advanced services such as context aware applications where the personal devices adapt its behavior to the changing environment is challenging. In this paper we propose a P2P platform for a Campus Environment.
Algorithm for Detection with Localization of Multi-targets in Wireless Acoustic Sensor Networks
Authors: Jaechan Lim, Jinseok Lee, Sangjin Hong, Peom Park
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In most multitarget tracking approaches based on Joint Probabilistic Data Association (JPDA), it is difficult to apply the solutions to problems (due to the dimensionality curse of heavy complexity) where the number of target varies dramatically. In this paper, we introduce an Algorithm for Detection of Multitargets in Wireless Acoustic Sensor Networks (ADMAN); we localize detected targets by particle filtering after ADMAN. The purpose of ADMAN is detecting any number of targets (We know the approximate locations of targets during the detection algorithm.) in the field of interest. The advantage of ADMAN is its ability to cope with varying number of targets in time. ADMAN does not have any restrictions on the varying pattern of the target number.
On the design problem of cellular wireless networks
Authors: Steven Chamberland, Samuel Pierre
Venue: Wireless Networks (2005)

In this paper, we deal with the problem of how to design cellular networks in a cost-effective way. We first propose an optimization model that deals with selecting the location of the base station controllers (BSCs) and mobile service switching centers (MSCs), selecting their types, designing the network topology and selecting the link types. In order to find a "good" solution, we propose a tabu search algorithm. Numerical results show that the tabu search algorithm produces solutions close to a proposed lower bound.
Temporal rate-distortion based optimal video summary generation
Authors: Zhu Li, K. Katsaggelos, B. Gandhi
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Video summary work originates from a viewing time constraint. A shorter version of the original video sequence is desirable in some applications. Clearly, a shorter version is necessary in applications where storage or bandwidth is limited. Our work is based on visual significance analysis of frames in a video sequence and a video temporal rate-distortion optimization framework. Temporal rate defines the number of frames allowable into the video summary, while temporal distortion is computed based on MPEG-7 metrics between mismatched frames. Several one-pass and two-pass algorithms are proposed along with discussions on experimental results.
Curating Digital Media-Next Generation of Japanese Media Art & Exhibition
Authors: Tomoe Moriyama
Venue: Proceedings of the conference on Information Visualization (2006)

In 1960s, Japanese Digital Artists were already introduced internationally by their pioneering works. In 2002, Digital/Media Art became the required course of junior-high/high school art classes, and digital art expressions including computer graphics have been in the ascendant to show the broader diversity than ever. Like other Asian countries, government has started supporting the Media Art contents and today's Japanese art students, whose works have been highly evaluated even overseas, to enter a new phase. I would like to report on the current situations of media art education and support system for Media Art in Japan and consider the future of upcoming talents, by examining examples; Japan Media Arts Festival and also quote the experience of many exhibitions on media art for over ten years, at the Images & technology Gallery in Tokyo Metropolitan Museum of Photography, which founded as a public institution of image media..
Effects of Left Inferior Prefrontal Stimulation on Episodic Memory Formation: A Two-Stage fMRI&ndash;rTMS Study
Authors: Stefan Köhler, Tomáš Paus, Randy L. Buckner, Brenda Milner
Venue: Journal of Cognitive Neuroscience (2004)

Successful recovery of words from episodic memory relies strongly on semantic processes at the time of encoding. Evidence from several functional magnetic resonance imaging (fMRI) studies has shown that changes in neural activity in the left inferior prefrontal cortex (LIPFC) during semantic encoding predict subsequent memory performance. This evidence has been taken to suggest that LIPFC plays a critical role in memory formation. Functional neuroimaging findings, however, do not establish a causal brain-behavior relationship. To determine whether there is a causal link between LIPFC involvement at encoding and subsequent success in memory performance, we conducted a two-part study in which we first used fMRI to localize encoding-related activation in LIPFC and then employed repetitive transcranial magnetic stimulation (rTMS) to manipulate neural processes in LIPFC during semantic encoding. To demonstrate the neuroanatomical specificity of any observed effect and to control for nonspecific rTMS side effects, we also stimulated neural processes in two control sites. Using frameless stereotaxy, we positioned the stimulation coil to target (1) the LIPF region that was activated during fMRI (mean xyz = -48 35 5); (2) the homologous right-hemisphere region; and (3) an additional left parietal control site. At each site, "stimulated" items (600 msec of 7-Hz rTMS with Cadwell Round Coil) were intermixed with items presented without concurrent stimulation. Subsequently, subjects performed a recognition memory task for the words encountered. We found support for the predicted causal brain-behavior relationship, which was specific to LIPFC. When comparing recognition scores for stimulated items, normalized for variations in performance on nonstimulated trials, we found that words encoded under LIPFC stimulation were subsequently recognized with higher accuracy than words encoded under stimulation in the two cortical control sites. By contrast, no performance difference emerged when the two control sites were compared with each other. Based on additional analyses of the rTMS effects observed directly at the time of encoding (i.e., on semantic-decision performance), we suggest that LIPFC stimulation may have produced its effect on recognition memory, at least in part, through the triggering of more extensive processing of the stimulated items and an ensuing gain in item distinctiveness. Physiological processes of facilitation probably also contributed to the observed memory benefit. Together, these findings suggest that LIPFC does play a causal role in episodic memory formation.
Testing and Verifying an IPv6 Based Multicast Network
Authors: Vilmos Bilicki
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

Today we are witnessing the widespread introduction of the Triple Play Service. The main Television Broadcasting companies start, or plan to start, their IPTV services. The current data network infrastructure and the unicast communication paradigm are not effective for providing such services. The multicast data communication paradigm is as old as the World Wide Web but, even so, it has no wide acceptance or deployment. With IPTV this situation may change. Due to the small address space IPv4 cannot provide the necessary support for multicast communication. It may happen that multicast will be the main driving force behind the widespread use of the IPv6 protocol. With the IPv6 multicast network there will be many new protocols and implementations. The testing of these implementations is not easy without protocol validation tools and, unfortunately, we were not able to find a freely available framework on the net for protocol validation. Testing an already deployed network can provide valuable information about future situations and services. System administrators need a framework that can also supply them with traffic orchestration and measurement data. We were not able to find a framework that was easy to use and would allow us to create a distributed orchestrated testing procedure for an arbitrary network with arbitrary protocols. These were some of the reasons for setting up our NetSpotter project. Here we will show the architecture and the services our framework currently offers. Then we will also present our measurements of a Linux IPv6 PIM-SM implementation called MRD6.
Box Their SOXes Off
Authors: John Bostick
Venue: Queue (2006)

Data is a precious resource for any large organization. The larger the organization, the more likely it will rely to some degree on third-party vendors and partners to help it manage and monitor its mission-critical data. In the wake of new regulations for public companies, such as Section 404 of SOX (Sarbanes-Oxley Act of 2002), the folks who run IT departments for Fortune 1000 companies have an ever-increasing need to know that when it comes to the 24/7/365 monitoring of their critical data transactions, they have business partners with well-planned and well-documented procedures.
SeaStar Interconnect: Balanced Bandwidth for Scalable Performance
Authors: Ron Brightwell, Kevin T. Pedretti, Keith D. Underwood, Trammell Hudson
Venue: IEEE Micro (2006)

The SeaStar, a new ASIC from Cray, is a full system-on-chip design that integrates high-speed serial links, a 3D router, and traditional network interface functionality, including an embedded processor in a single chip.
Pairs of codes with prescribed Hamming distances and coincidences
Authors: Vince Grolmusz
Venue: Designs, Codes and Cryptography (2006)

The main problem of coding theory is to construct codes with large Hamming-distances between the code-words. In this work we describe a fast algorithm for generating pairs of q-ary codes with prescribed pairwise Hamming-distances and coincidences (for a letter s ¿ {0,1,...,q ¿ 1}, the number of s-coincidences between codewords a and b is the number of letters s in the same positions both in a and b). The method is a generalization of a method for constructing set-systems with prescribed intersection sizes (Grolmusz (2002) Constructing set-systems with prescribed intersection sizes. J Algorithms 44:321---337), where only the case q = 2 and s = 1 was examined. As an application, we show that the modular version of the classical Delsarte-inequality does not hold for odd, non-prime power composite moduli.
A wavelet packet image coding algorithm based on quadtree classification and UTCQ
Authors: Xingsong Hou, Guizhong Liu
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this paper, we present a wavelet packet image coding algorithm based on quadtree classification and UTCQ. It is composed of four parts: (1) wavelet packet decomposition and best basis selection based on a new cost function, (2) a quadtree classification procedure, used to classify the wavelet packet coefficients into two sets: a significant one and an insignificant one, (3) the universal trellis coded quantization, used to code the significant coefficients sets, (4) the entropy coder, used to code the indices of the universal trellis coded quantizer output. The image coding results, calculated from actual file sizes and images reconstructed by the decoding algorithm are either comparable to or surpass previous results for texture-rich images.