ppxscal/embedding_network huggingface dataset:
Multi-Policy Access control considering Privacy in Ubiquitous Environment
Authors: Kyu-il Kim, Hyun-Sik Hwang, Hyuk-Jin Ko, Hae-Kyung Lee, Ung-mo Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In ubiquitous environment, the connected devices can be aware the status of users and provide the information to users automatically in anytime, anywhere. However, it requires more security technologies to protect private information. In this paper, we propose it allows automatically a user be aware the information what he wants. The proposed mechanism defines extended Context Roles from current RBAC. It controls the accesses to privacy in ubiquitous environment. It employs Multi-Policy to constrain privacy and role-data objects. Hence, when there is an access to one of them, the mechanism refers to the current context and determines whether accept it or not. We also provide advanced security authorization and analysis of our model and show how we preserve safety properties in spite of dynamic changes to access control permissions.
Information-theoretic approaches to branching in search
Authors: Andrew Gilpin, Tuomas Sandholm
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Deciding what to branch on at each node is a key element of search algorithms. We present four families of methods for selecting what question to branch on. They are all information-theoretically motivated to reduce uncertainty in remaining subproblems. In the first family, a good variable to branch on is selected based on lookahead. In real-world procurement optimization, this entropic branching method outperforms default CPLEX and strong branching. The second family combines this idea with strong branching. The third family does not use lookahead, but instead exploits features of the underlying structure of the problem. Experiments show that this family significantly outperforms the state-of-the-art branching strategy when the problem includes indicator variables as the key driver of complexity. The fourth family is about branching using carefully constructed linear inequality constraints over sets of variables.
Silver Bullet Speaks with Dan Geer
Authors: Gary McGraw
Venue: IEEE Security and Privacy (2006)

Dan Geer discusses his work in Project Athena and his thoughts on data security.
Using cocitation information to estimate political orientation in web documents
Authors: Miles Efron
Venue: Knowledge and Information Systems (2006)

This paper introduces a simple method for estimating cultural orientation, the affiliation of online entities in a polarized field of discourse. In particular, cocitation information is used to estimate the political orientation of hypertext documents. A type of cultural orientation, the political orientation of a document is the degree to which it participates in traditionally left- or fight-wing beliefs. Estimating documents' political orientation is of interest for personalized information retrieval and recommender systems. In its application to politics, the method uses a simple probabilistic model to estimate the strength of association between a document and left- and right-wing communities. The model estimates the likelihood of cocitation between a document of interest and a small number of documents of known orientation. The model is tested on three sets of data, 695 partisan web documents, 162 political weblogs, and 198 nonpartisan documents. Accuracy above 90% is obtained from the cocitation model, outperforming lexically based classifiers at statistically significant levels.
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
Authors: Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

We present an optimal real-time scheduling algorithm for multiprocessors -- one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed based on a novel abstraction for reasoning about task execution behavior on multiprocessors: the Time and Local Execution Time Domain Plane (or TL plane). LLREF is based on the fluid scheduling model and the fairness notion, and uses the T-L plane to describe fluid schedules without using time quanta, unlike the optimal Pfair algorithm (which uses time quanta). We show that scheduling for multiprocessors can be viewed as repeatedly occurring T-L planes, and feasibly scheduling on a single T-L plane results in the optimal schedule. We analytically establish the optimality of LLREF. Further, we establish that the algorithm has bounded overhead, and this bound is independent of time quanta (unlike Pfair). Our simulation results validate our analysis on the algorithm overhead.
Quality assessment of individual classifications in machine learning and data mining
Authors: Matjaž Kukar
Venue: Knowledge and Information Systems (2006)

Although in the past machine learning algorithms have been successfully used in many problems, their serious practical use is affected by the fact that often they cannot produce reliable and unbiased assessments of their predictions' quality. In last few years, several approaches for estimating reliability or confidence of individual classifiers have emerged, many of them building upon the algorithmic theory of randomness, such as (historically ordered) transduction-based confidence estimation, typicalness-based confidence estimation, and transductive reliability estimation. Unfortunately, they all have weaknesses: either they are tightly bound with particular learning algorithms, or the interpretation of reliability estimations is not always consistent with statistical confidence levels. In the paper we describe typicalness and transductive reliability estimation frameworks and propose a joint approach that compensates the above-mentioned weaknesses by integrating typicalness-based confidence estimation and transductive reliability estimation into a joint confidence machine. The resulting confidence machine produces confidence values in the statistical sense. We perform series of tests with several different machine learning algorithms in several problem domains. We compare our results with that of a proprietary method as well as with kernel density estimation. We show that the proposed method performs as well as proprietary methods and significantly outperforms density estimation methods.
An Optical System for Guidance of Terrain Following in UAVs
Authors: Mandyam V. Srinivasan, Saul Thurrowgood, Dean Soccol
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

There is considerable interest in designing guidance systems for UAVs that use passive sensing (such as vision), rather than active sensing which can be bulky, expensive and stealth-compromising. Here we describe an optical sensor, based partly on principles of insect vision and optic flow analysis, for measurement and control of height above the ground. A video camera is used in conjunction with a specially shaped reflective surface to simplify the computation of optic flow, and extend the range of aircraft speeds over which accurate data can be obtained. The imaging system also provides a useful geometrical remapping of the environment, which facilitates obstacle avoidance and computation of 3-D terrain maps.
Mining Text with Pimiento
Authors: J. J. García Adeva, R. Calvo
Venue: IEEE Internet Computing (2006)

Information systems are using an increasing amount of unstructured information in the form of text. This situation has spawned a need to improve the text-mining technologies needed for information retrieval, filtering, and classification. This article compares some of the options available and how they can provide textual data-mining functionalities to software applications. In particular, the authors focus on Pimiento, a new object-oriented application framework for text mining. This framework allows developers to easily create distributed applications that use machine learning and statistical techniques to automatically process documents.
Formal Specification-based Online Monitoring
Authors: Hui Liang, Jin Song Dong, Jing Sun, Roger Duke, Rudolph E. Seviora
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

With current trends towards more complex software system and use of higher level languages, a monitoring technique is of increasing importance for the areas such as performance enhancement, dependability, correctness checking and so on. In this paper, we present a formal specification-based online monitoring technique. The key idea of our technique is to build a linking system, which connects a specification animator and a program debugger. The required information about dynamic behaviors of the formal specification and concrete implementation of a target system is obtained from the animator and the debugger. Based on those information, the judgement on the consistency of the concrete implementation with the formal specification will be provided. Not embedding any instrumentation code into the target system, our monitoring technique will not alter the dynamic behavior of the target system. Animating the formal specification, rather than annotating the target system with extra formal specifications, our monitoring technique separates the implementation-dependent description of the monitored objects and the formal requirement specification of them.
Transitional Architectures for Enterprise Evolution
Authors: Murat Erder, Pierre Pureur
Venue: IT Professional (2006)

To transform your IT architecture, consider implementing discrete plateaus to provide stability and manage change while you move gradually closer to your goal.
Mobile Parallel Computing
Authors: Daniel C. Doolan, Sabin Tabirca, Laurence T. Yang
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

This paper outlines how the Mobile Message Passing Interface (MMPI) may be used for parallel computation. MMPI allows parallel programming of mobile devices over a Bluetooth network. This paper gives an overview of the MMPI library, and demonstrates that mobile devices are capable of parallel computation. An example of Matrix Multiplication O(n^3 ) is used to show this.
Complete instrumentation requirements for performance analysis of Web based technologies
Authors: D. Carrera, J. Guitart, J. Torres, E. Ayguade, J. Labarta
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

In this paper we present the eDragon environment, a research platform created to perform complete performance analysis of new Web-based technologies. eDragon enables the understanding of how application servers work in both sequential and parallel platforms offering a new insight in the usage of system resources. The environment is composed of a set of instrumentation modules, a performance analysis and visualization tool and a set of experimental methodologies to perform complete performance analysis of Web-based technologies. This paper describes the design and implementation of this research platform and highlights some of its main functionalities. We will also show how a detailed analytical view can be obtained through the application of a bottom-up strategy, starting with a group of system events and advancing to more complex performance metrics using a continuous derivation process.
Digital Entertainment: Media Technologies for the Future
Authors: Karlheinz Brandenburg
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

Digital media are changing the entertainment world. We see the departure of both analog broadcasting and already the first generation of digital entertainment media (the CD) and the advent of new systems. For the new world of digital media, we need to be able to search for media, to organize them. The presentation includes general ideas on future entertainment media, introduces rich media management including our work on music recognition (MPEG-7 compatible) and touch on immersive media including our IOSONO Wave Field Synthesis work. The text below gives just a short summary of the topics covered in the talk.
The security flaws in some authentication watermarking schemes
Authors: Yongdong Wu, Feng Bao, ChangSheng Xu
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Watermarking technology was originally proposed for copyright protection. Recently it has been applied to media authentication so that a proof of authenticity is inserted into the media instead of being appended to the media as a separated attachment. However, security requirements of the authentication are overlooked in some authentication watermark schemes. In this paper we analyze three authentication watermarking schemes and point out their security flaws. The first scheme is the color authentication scheme in [S.C. Byun et al., 2002]. The scheme is not secure in the sense that as long as an attacker obtains one authenticated image, he is able to forge authentic images without the secret key. The second scheme [Ping Wah Wing, et al., 2001] is an authentication scheme but it is extended for ownership incorrectly. The third one, the robust invertible watermarking scheme [J. Friedrich et al., 2002], employs a multiple of secret random sequences to produce a watermark. However these sequences are independent of the original images, i.e., they remain invariable for different images. An adversary, having sufficient number of original images, can reconstruct the secret sequences by solving simultaneous equations. With these reconstructed sequences, the attacker can forge authentic image freely. The attack can be thwarted with content related sequences generated from both the secret key and the original image.
Benefits of Knowledge-Based Interactive Learning Environments: A Case in Combinatorics
Authors: Helene Giroire, Francoise Le Calvez, Gerard Tisseau
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Solving combinatorics exercises is a difficult task for students because the modeling activity involved is not usual. To help students to train themselves, we have built an AI based computer assisted learning system that gives them a specific framework to solve exercises and teaches them a general problem solving method. In this article we present the benefits of using such a system in a learning process, in relation to standard teaching (as in the classroom).
Performance Evaluation of JXTA Based P2P Distributed Computing System
Authors: Zhiming Dai, Zhiyi Fang, Xiao Han, Fengyuan Xu, Hongjun Yang
Venue: Proceedings of the 15th International Conference on Computing (2006)

In this paper, we introduce the condition of distributed computing at present firstly. On this foundation, according to the analysis of particular case of distributed computing network, we implement a distributed network environment of p2p whose bottom layer frame is based on JXTA. It improves issuing method of message based on pipeline decomposition mechanism of task based on usage ratio of processor and distributed mechanism of object based on serialization. We build an improved distributed computing network platform on the platform of Linux and Windows and simulate a distributed computing environment. The simulated experiment proves the feasibility and the validity of the distributed Network computing platform that is constructed in this paper.
Efficient multidimensional data representations based on multiple correspondence analysis
Authors: Riadh Ben Messaoud, Omar Boussaid, Sabine Loudcher Rabaséda
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

In the On Line Analytical Processing (OLAP) context, exploration of huge and sparse data cubes is a tedious task which does not always lead to efficient results. In this paper, we couple OLAP with the Multiple Correspondence Analysis (MCA) in order to enhance visual representations of data cubes and thus, facilitate their interpretations and analysis. We also provide a quality criterion to measure the relevance of obtained representations. The criterion is based on a geometric neighborhood concept and a similarity metric between cells of a data cube. Experimental results on real data proved the interest and the efficiency of our approach.
Parallel discrete event simulation of space shuttle operations
Authors: Luis Rabelo, Jose Sepulveda, Mario Marin, Amith Paruchuri, Amit Wasadikar, Karthik Nayaranan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This paper describes the application of parallel simulation techniques to represent structured functional parallelism present within the Space Shuttle Operations Flow, utilizing the Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES), an object-oriented multicomputing architecture. SPEEDES is a unified parallel simulation environment, which allocates events over multiple processors to get simulation speed up. Its optimistic processing capability minimizes simulation lag time behind wall clock time, or multiples of real-time. SPEEDES accommodates increases in processes complexity with additional parallel computing nodes to allow sharing of processing loads. This papers focuses on the whole process of translating a model of Space Shuttle Operations Flow represented in a process-driven approach to object oriented design, verification, validation, and implementation.
Contents and Development Trends of GHBIMS
Authors: Feng Ding, Xue Hua Wang, Yan Zhang Wang
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This thesis describes presently the main business application of the network of government at all levels in China, introducing the relationship among systems after the integration, sharing some experience of system construction and also analyzing the development trends of Government Horizon Business Integration Management System(GHBIMS).
Assignment and Integration of Distributed Transport Services in Agent-Based Architecture
Authors: Hayfa Zgaya, Slim Hammadi
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

Transport users require relevant, interactive and instantaneous information during their travels. A Transport Multimodal Information System (TMIS) can offer a support tool to response to their demands. Such a system has to take into account the exponential growth of services and information available on intended large networks like the internet. In this context and even if many researchers have longer discussed its benefits, mobile agent paradigm might be very efficient compared to the classical client server one if it is used through an optimization approach. In this paper, we propose an efficient model based on a multi-agent system, using the mobile agent paradigm, in order to optimize the services research and composition in transport business.
Toward a general student model: accounting for individual learner differences across multiple learning environments
Authors: Garrett W. Smith
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

A framework is presented for allowing computer-based learning environments to share student information. Such a framework would enable a learning environment to obtain previous data collected on a specific student in order to enhance the system's student model, and in turn become better able to assist the student in learning. The motivation for this framework, its technical implementation, and its potential benefits are discussed.
Data Based Application Partitioning and Workload Balance in Distributed Environment
Authors: Xiaohu Yang, Ming Mao, Xinyu Wang
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

Many application partitioning methods have been proposed based on different functional modules in distributed environment to gain efficient use of resources, improved performance and high scalability. This paper introduces popular application partitioning architectures, and presents a different partitioning method and an on-line workload balance algorithm from a new perspective: runtime data, called data based application partitioning. This architecture benefits applications with higher performance, scalability and dynamic workload balancing. A financial trading system reengineered from J2EE standalone environment into data partitioning distributed environment gives a nice proof.
Efficient architectural design of high performance microprocessors
Authors: L. Eeckhout
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

Summary form only given. Designing a high performance microprocessor is extremely time-consuming taking at least several years. An important part of this design effort is architectural simulation which defines the microarchitecture or the organization of the microprocessor. The reason why these simulations are so time-consuming is fourfold: (i) the architectural design space is huge; (ii) the number of benchmarks the microarchitecture needs to be evaluated with, is large; (iii) the number of instructions that need to be simulated per benchmark is huge as well; and (iv) simulators are becoming relatively slower due to the increasingly complex designs of current high performance microprocessors. In this tutorial, we discuss these issues and propose a solution for each of them. As such, we present an architectural simulation framework for designing high performance microprocessors which reduces the total simulation time by several orders of magnitude without sacrificing accuracy. This is done by combining several recently proposed techniques, such as statistical simulation, representative workload design using statistical data analysis techniques, trace sampling and reduced input sets.
Fully Automatic Registration of 3D Point Clouds
Authors: Ameesh Makadia, Alexander IV Patterson, Kostas Daniilidis
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We propose a novel technique for the registration of 3D point clouds which makes very few assumptions: we avoid any manual rough alignment or the use of landmarks, displacement can be arbitrarily large, and the two point sets can have very little overlap. Crude alignment is achieved by estimation of the 3D-rotation from two Extended Gaussian Images even when the data sets inducing them have partial overlap. The technique is based on the correlation of the two EGIs in the Fourier domain and makes use of the spherical and rotational harmonic transforms. For pairs with low overlap which fail a critical verification step, the rotational alignment can be obtained by the alignment of constellation images generated from the EGIs. Rotationally aligned sets are matched by correlation using the Fourier transform of volumetric functions. A fine alignment is acquired in the final step by running Iterative Closest Points with just few iterations.