ppxscal/embedding_network huggingface dataset:
TOWER: Practical Trust Negotiation Framework for Grids
Authors: Jianxin Li, Jinpeng Huai, Jie Xu, Yanmin Zhu, Wei Xue
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

In order to establish trust relationship between service requesters and providers in an open decentralized environment, we propose a novel trust negotiation framework, TOWER, which integrates distributed trust chain construction of trust management and aims to enhance the grid security infrastructure. Our approach leverages attribute-based credentials to support flexible delegation, and dynamically constructs trust chains. A novel TRust chAin based Negotiation Strategy (TRANS) is proposed to establish trust relationship on the fly by gradually disclosing credentials according to various access control policies. Our approach has been successfully implemented as useful components and fundamental security services in the CROWN Grid, and techniques such as trust tickets and policy caching that can greatly increase service efficiency are used. Finally, we evaluate our approach by comprehensive experiments and the results show that it is feasible.
Fuzzy Rule Based Facial Expression Recognition
Authors: Muid Mufti, Assia Khanam
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)

Facial expressions are a key modality in human communication. Facial expressions occur simultaneously with social interaction and help in interpretation of spoken communication. The understanding of facial expressions is a basic requirement in the development of next generation human computer interaction (HCI) systems. Facial expressions, however, are qualitative in nature and it is very difficult to explain them by a mathematical model. This paper presents a system framework that uses fuzzy logic principles to recognize facial expressions in video sequences. The system uses image processing techniques to detect MPEG4 Facial Animation Parameters (FAPs) in an input video. A fuzzy rule base has been developed to interpret the collective set of FAPs as constituting a particular facial expression.
Building Phase-Type Software Reliability Models
Authors: Hiroyuki Okamura, Tadashi Dohi
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

This paper presents a unified framework for software reliability modeling with non-homogeneous Poisson processes, where each software fault-detection time obeys the phasetype distribution and the initial number of inherent faults is given by a Poisson distributed random variable. However, it is worth noting that the resulting software reliability models, called phase-type software reliability models, generalize the existing models but may involve a number of model parameters in the phase-type software reliability model, so that the usual maximum likelihood estimation based on the Newton's method or quasi-Newton's method does not often function well. In this paper, we develop EM (Expectation- Maximization) algorithms for the phase-type software reliability models with two types of fault data: fault-detection time data and grouped data with arbitrary time intervals. In numerical examples, we compare the EM algorithms with the quasi-Newton's method and illustrate the effectiveness on our unified model and parameter estimation method.
Cosegmentation of Image Pairs by Histogram Matching - Incorporating a Global Constraint into MRFs
Authors: Carsten Rother, Tom Minka, Andrew Blake, Vladimir Kolmogorov
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inference in the model leads to minimizing an energy with an MRF term encoding spatial coherency and a global constraint which attempts to match the appearance histograms of the common parts. This energy has not been proposed previously and its optimization is challenging and NP-hard. For this problem a novel optimization scheme which we call trust region graph cuts is presented. We demonstrate that this framework has the potential to improve a wide range of research: Object driven image retrieval, video tracking and segmentation, and interactive image editing. The power of the framework lies in its generality, the common part can be a rigid/non-rigid object (or scene), observed from different viewpoints or even similar objects of the same class.
A relational account of objects
Authors: Clara Murdaca, C. Barry Jay
Venue: Proceedings of the 29th Australasian Computer Science Conference - Volume 48 (2006)

A relational account of objects provides a single unifying data model for both object-oriented programming languages and relational databases. Type variables used to represent unknown fields in the programming language correspond to discriminators in relations.
Closed Curve Reconstruction from Unorganized Sample Points
Authors: Hisamoto Hiyoshi
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

This paper considers the problem for reconstructing closed curves from unorganized sample points, where the curve to be reconstructed consists of a finite number of pairwise disjoint components of simple closed curves. This paper formulates this problem as a linear integer programming problem, and proposes an algorithm, called ZEROONE, based on it. In addition, two other heuristic algorithms called PASTE and SCISSORS are proposed for reducing computational time. Experimental results show that these algorithms yield exact polygonal reconstruction if the density of the sample points is high enough. In addition, it is shown that SCISSORS can be modified for the reconstruction problem of curves with boundaries.
Visualization and Bayesian Nets to link Business Aims
Authors: Keith Rennolls
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

If the full CRISP DM life-cycle is to be implemented then there needs to be a means by which business logic, understanding and aims can be directly related to the DM and KDD modelling process, and then onto deployment. Several graphical ways of representing data and models are considered: the E-R diagram, linked data and model ontologies, and graphicalmodel/ Bayesian-net dependency diagrams. It is suggested that the provision of graphical tools for the domain expert to express their prior knowledge, understanding and aims is the best way of linking these to the DM & KDD process and subsequent deployment of discovered knowledge.
Adaptive Error Resilience Tools for Improving the Quality of MPEG-4 Video Streams over Wireless Channels
Authors: Angela Belda, Juan Carlos Guerri, Ana Pajares
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

The transmission of encoded video streams over heterogeneous networks, characterized by congestion losses in wired links and high bit error rate in the wireless channel, is under consideration in this paper. First of all, it is necessary to make a distinction between the different kinfs of losses to achieve a high channel utilization. Then, when dealing with wireless losses, the robustness of the encoded stream has to be improved. This article shows an easy way of implementing a global adaptive algorithm for wireless networks. It proposes a new algorithm to adequate the parameters of video error resilience tools to the changing characteristics of the wireless channel. The aim of this algorithm is guaranteing the quality of the video; Simplicity is the key, as the receiver of the video stream will be a handheld device (i.e. PDA, mobile phone, etc.) with limited processing capacity.
Model Reference Adaptive Control on Glucose for the Treatment of Diabetes Mellitus
Authors: A. Wahab, Y. K. Kong, C. Quek
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Diabetes mellitus is one of the top five killer among both man and woman world wide. Type I diabetes is caused by the failure to produce sufficient insulin which leads to an uncontrolled increase in blood glucose. Prolong elevated glucose level of above 150- 160mg/dl poses significant health risk with possible long lasting effect. Human assisted insulin injection through compartmental model schedules are basically open loop system. This paper attempts to close the loop by employing model reference adaptive control on a controller to adaptively control the glucose level of the patient via an infusion pump. Simulation results show the potential of using fuzzy type controllers for finer regulation and its practical applications.
The role of structural assurances for the personal computer in e-commerce consumer trust building and intention to make online transactions
Authors: Raymond Panko
Venue:  (2006)

Trust is an important element in business relationships. For e-commerce consumers, lack of trust has been identified as a major impediment to purchase intentions. This research replicates and extends Gefen, Karahanna and Straub's (2003a) article, "Trust and TAM in Online Shopping: An Integrated Model." Gefen et al. (2003a) combined the Technology Acceptance Model (TAM) described by Davis (1989) with trust in an attempt at modeling factors that influence consumer e-commerce intentions. In their study, trust was theorized to be influenced by four distinct trust antecedents: calculative based, structural assurances, situational normality, and familiarity. The main objectives of the present study are to extend the use of structural assurances to include the consumer's personal computer, and to increase the understanding of trust within an e-commerce context. Structural assurance is defined as the perception of success a person has in a situation based upon safety nets, guarantees, and other regulations that exist within that situation. Structural assurances have been shown to build trust levels in individuals (McKnight, Cummings and Chervany, 1998; Shapiro, 1987; Zucker, 1986). While many studies have shown the effectiveness of structural assurances used by web vendors, no studies have examined the importance of structural assurances on the consumer's personal computer. This research aims to make several important practical and theoretical contributions. Practically, this study demonstrates that structural assurances have a greater role in determining trust, and that they can be used to assure all the parts of an e-commerce system with which consumers have uncertainty. Knowing this, web merchants and other third party software providers can start providing a wider variety of assurances to build consumer trust in e-commerce. Theoretical contributions include extending Gefen et al. (2003a) in several areas. First, a greater understanding of trust and its antecedents is gained by including e-commerce system aspects. Second, the variable perceived risk is introduced into the model as a mediator between trust and behavior intention. This research provides a more thorough understanding of the variables a consumer faces in an e-commerce transaction.
Integrated visualization for geometry PIG data
Authors: Bok Dong Kim, Sang Ok Koo, Hyok Don Kwon, Seong Dae Jung, Soon Ki Jung, Minho Lee, YongWoo Rho, SungJa Koo
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

The geometry PIG is a system that can inspect the inside of a pipeline. The amount of pigging data is usually considerable because the system records multi-channel sensor values for a long distance inspection. Therefore, the efficient visualization of geometry PIG data is essential for the operator to analyze the amount of sensor data and to assess the pipeline features and conditions within a few hours.In this paper, we develop a geometry PIG software, which is a powerful and highly user friendly diagnostic tool. It allows the user to visualize the sensor data with various views such as fisheye, histogram and wave views to distinguish particular type of features. Furthermore, an integrated GUI with synchronized multiple views is very effective managing and navigating the multi-channel data. As a result, our system contributes to the high precision of the analysis results as well as in reducing the time to take to analyse the geometry PIG data.
Sensitivity Analysis for Fixed-Priority Real-Time Systems
Authors: Enrico Bini, Marco Di Natale, Giorgio Buttazzo
Venue: Proceedings of the 18th Euromicro Conference on Real-Time Systems (2006)

At early stages in the design of real-time embedded applications, the timing attributes of the computational activities are often incompletely specified or subject to changes. Later in the development cycle, schedulability analysis can be used to check the feasibility of the task set. However, the knowledge of the worst-case response times of tasks is often not sufficient to precisely determine the actions that would correct a non-schedulable design. In these situations, sensitivity analysis provides useful information for changing the implementation, by giving a measure of those computation times that must be reduced to achieve feasibility, or those that can be increased in case of a product extension, or providing the range of feasible periods for selecting the proper task activation rates. In this work, we exploit the concept of feasibility region to propose a faster and more concise solution to the sensitivity analysis problem with respect to existing techniques based on binary search. Furthermore, we show how the formalization of other problems in the feasibility domain, such as managing overloads through elastic scheduling, can be extended to the exact analysis.
Integrating User Feedback Log into Relevance Feedback by Coupled SVM for Content-Based Image Retrieval
Authors: Steven C. H. Hoi, Michael R. Lyu, Rong Jin
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Relevance feedback has been shown as an important tool to boost the retrieval performance in content-based image retrieval. In the past decade, various algorithms have been proposed to formulate relevance feedback in contentbased image retrieval. Traditional relevance feedback techniques mainly carry out the learning tasks by focusing lowlevel visual features of image content with little consideration on log information of user feedback. However, from a long-term learning perspective, the user feedback log is one of the most important resources to bridge the semantic gap problem in image retrieval. In this paper we propose a novel technique to integrate the log information of user feedback into relevance feedback for image retrieval. Our algorithm's construction is based on a coupled support vector machine which learns consistently with the two types of information: the low-level image content and the user feedback log. We present a mathematical formulation of the problem and develop a practical algorithm to solve the problem effectively. Experimental results show that our proposed scheme is effective and promising.
Low-cost communication for rural internet kiosks using mechanical backhaul
Authors: A. Seth, D. Kroeker, M. Zaharia, S. Guo, S. Keshav
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

Rural kiosks in developing countries provide a variety of services such as birth, marriage, and death certificates, electricity bill collection, land records, email services, and consulting on medical and agricultural problems. Fundamental to a kiosk's operation is its connection to the Internet. Network connectivity today is primarily provided by dialup telephone, although Very Small Aperture Terminals (VSAT) or long-distance wireless links are also being deployed. These solutions tend to be both expensive and failure prone. Instead, we propose the use of buses and cars as "mechanical backhaul" devices to carry data to and from a village and an internet gateway. Building on the pioneering lead of Daknet [15], and extending the Delay Tolerant Networking Research Group architecture [24], we describe a comprehensive solution, encompassing naming, addressing, forwarding, routing, identity management, application support, and security. We believe that this architecture not only meets the top-level goals of low cost and robustness, but also exposes fundamental architectural principles necessary for any such design. We also describe our experiences in implementing a prototype of this architecture.
Press play: designing an epistemic game engine for journalism
Authors: David Hatfield, David Williamson Shaffer
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Epistemic games are one approach to creating educational games that give players skills that transfer beyond the game world by helping young people become fluent in valuable social practices. Epistemic games are immersive, technology-enhanced, role-playing games where players learn to become---and thus to think like---doctors, lawyers, engineers, architects, and other members of important practices and professions. In what follows we look at the design of Byline, an epistemic game engine behind science.net, an epistemic game of science journalism. In particular, we argue that rather than simply recreating the technological conditions of the profession, an epistemic game engine like Byline can encode key elements of a professional practicum and thus help young people learn through participation in simulations of the training practices of socially valued professions such as science journalism.
A New Web Search Result Clustering based on True Common Phrase Label Discovery
Authors: Jongkol Janruang, Worapoj Kreesuradej
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)

Web search results clustering are navigator for users to search results. Therefore the correct cluster label is important which has been index the set of web document. Suffix Tree Clustering (STC) is fast automatically clustering and labeling. However, STC is inadequate since they generate interrupted cluster label due to using n-gram technique. In this paper, we propose an approach for web search results clustering and labeling based on a new suffix tree data structure, a new base cluster combining algorithm with a new partial phase join operation. The algorithm for constructing the data structure is an incremental and a linear time algorithm. Thus, the proposed approach is suitable for on-the-fly the web search results clustering and labeling cluster. The proposed approach provides more readable and true common phrase of web document cluster than conventional web search result clustering. Experimental results also show that the proposed approach has better performance than that of conventional web search result clustering.
Cryptographically Sound Theorem Proving
Authors: Christoph Sprenger, Michael Backes, David Basin, Birgit Pfitzmann, Michael Waidner
Venue: Proceedings of the 19th IEEE workshop on Computer Security Foundations (2006)

We describe a faithful embedding of the Dolev-Yao model of Backes, Pfitzmann, and Waidner (CCS 2003) in the theorem prover Isabelle/HOL. This model is cryptographically sound in the strong sense of blackbox reactive simulatability/ UC, which essentially entails the preservation of arbitrary security properties under active attacks and in arbitrary protocol environments. The main challenge in designing a practical formalization of this model is to cope with the complexity of providing such strong soundness guarantees. We reduce this complexity by abstracting the model into a sound, light-weight formalization that enables both concise property specifications and efficient application of our proof strategies and their supporting proof tools. This yields the first tool-supported framework for symbolically verifying security protocols that enjoys the strong cryptographic soundness guarantees provided by reactive simulatability/ UC. As a proof of concept, we have proved the security of the Needham-Schroeder-Lowe protocol using our framework.
Lessons in business model development from early mobile Internet services in Japan
Authors: Toshihiko Yamakami
Venue: Proceedings of the International Conference on Mobile Business (2006)

The author summarizes the lessons learned in the 6-year evolution in the mobile Internet business development in Japan. The lessons about telephony/Internet service development characteristics, a spiral service evolution pattern, and mobile content business model development are studied from a retrospective view on the mobile business evolution. Based on the basic mobile interaction model, the author describes implications for the future mobile business model development.
Dissociation of Habit-Learning in Parkinson's and Cerebellar Disease
Authors: K. Witt, A. Nuhsman, G. Deuschl
Venue: Journal of Cognitive Neuroscience (2002)

Damage to the medial-temporal region is known to result in declarative (explicit) memory deficits but nondeclarative (implicit) memory is largely unaffected by such lesions. Earlier studies have shown that some forms of implicit learning depend on cerebellar circuits but remain preserved following affections of the basal ganglia circuits. It is unknown which forms of implicit learning persist in patients with cerebellar pathology but are affected after basal ganglia lesions. Therefore, we determined if a test sensitive for habit-learning (probabilistic classification task) resulted in normal values for patients with cerebellar disease but resulted in affected results in patients with Parkinson's disease (PD). To this end, 23 patients with PD, 16 patients with familial or idiopathic cerebellar degeneration (CD), and 20 controls were tested for habit-learning. There was no impairment of patients with CD for the early learning period but there was abnormal learning in the PD group. For a later learning period, the patients with the PD showed improved performance. We conclude that the probabilistic learning task is an implicit, nonmotor learning task which is sensitive for basal ganglia pathology but remains unaffected in the case of cerebellar pathology. Such a test may be of special interest for the detection and possible neurobehavioral treatment of cognitive and motor deficits.
ROC graphs with instance-varying costs
Authors: Tom Fawcett
Venue: Pattern Recognition Letters (2006)

Receiver operating characteristics (ROC) graphs are useful for organizing classifiers and visualizing their performance. ROC graphs have been used in cost-sensitive learning because of the ease with which class skew and error cost information can be applied to them to yield cost-sensitive decisions. However, they have been criticized because of their inability to handle instance-varying costs; that is, domains in which error costs vary from one instance to another. This paper presents and investigates a technique for adapting ROC graphs for use with domains in which misclassification costs vary within the instance population. pulation.