ppxscal/embedding_network huggingface dataset:
Administrative Usage Control Model for Secure Interoperability
Authors: Fan Hong, Yongquan Cui
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The secure interaction between two or more administrative domains is a major concern. IRBAC2000 is a model that quickly establishes a flexible policy for dynamic role translation from foreign domains to local. A-IRBAC2000 mode utilizes RBAC to manage dynamic role translation between foreign and local domains. We will see that these mechanisms have significant shortcomings. We propose an improved Administrative Usage Control model named AUCON to overcome the weakness of previous models. AUCON provides administrates userrole assignment for local and foreign domain with unified method. It provides flexible enough mechanism to distinguish users of foreign and local domain and can enforce more strict control for foreign user. While retaining the advantage of traditional RBAC model, AUCON model is being implemented in experiment system.
Moving From Traditional Computer Engineering Learning with Toys, Virtual Machines, Embedded Systems and Ubiquitous Computing
Authors: Milton Villegas Lemus
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Microcontrollers offer very attractive issues to study computer organization or computer architecture concepts, especially in developing countries: low cost, a lot of information available, a complete computer system in a chip, built in functions that make it easier to build hands on projects with programmable devices. Even more, they offer a chance to understand applications of ubiquitous computing paradigm. This paper presents a brief look at the successful process of introducing microcontrollers using a toy car project (overhauling it) in a computer architecture undergraduate computer science course. Description of hardware and software and some interesting and valuable experiences are commented.
Multi-user support and motion planning of humans and humans driven vehicles in interactive 3D material flow simulations
Authors: Matthias Fischer, Bengt Mueck, Kiran Mahajan, Michael Kortenjan, Christoph Laroque, Wilhelm Dangelmaier
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The visualization of simulated production processes is used for their analysis. Huge plants are normally planned by a team. So a solution for many users who are modeling and interacting with a running model in an immersive 3D environment is required. We discuss an approach where several users work cooperatively on one simulation model. To optimize their work, the users need some guidance. For this we suggest small maps and arrows to guide the user to significant objects (machines). In many production scenarios, objects (forklifts, workers) are moving in an unguided fashion. In actual implementations these paths have to be modeled manually. In spite of taking these efforts, we are presenting an automated approach which is based on the 3D layout of the plant. If the user as part of the simulation is standing in the way of the object, the object stops in our approach (as hopefully in reality).
Mobile Advertising in Capacitated Wireless Networks
Authors: Arvind K. Tripathi, Suresh K. Nair
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

The growing number of mobile subscribers has attracted firms to invent newer strategies to reach prospective customers in innovative but nonintrusive ways. While customer mobility creates an opportunity to reach them at desired times and locations, in practice, real-time ad deliveries are difficult due to the size of the ad-delivery decision problem. This research aims at analyzing and developing a decision policy for delivering ads on mobile devices such as cell phones. We look at the ad delivery problem from the perspective of an advertising firm, which delivers ads on behalf of its clients (merchants) to mobile customer using a wireless carrier's infrastructure. We formulate the mobile ad delivery problem as a Markov decision process (MDP) model. The ad delivery policy depends on the customer's desire and willingness to receive ads, their real-time locations, historical mobility patterns, available network capacity, and fee structure agreed upon for ad deliveries. We also develop a fast heuristic to solve larger size problems. We test our heuristic against an upper bound we developed and analyze performance using simulation.
Gamers' Cognitive Process on Gameplay in Massively Multi-player Online Role-Playing Game: Towards World of Warcrafts Players' the Difference
Authors: Seungkeun Song, Joohyeon Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The objective of this study is to explore the differences according to gamers' expertise: experts, intermediate gamers, and novices. To this end, this study proposes an analytic framework that focuses on the gamers' cognitive process. An empirical experiment within the domain of MMORPG game was conducted where verbal protocols and action protocols were collected. The results of the study reveal that the different behavior patterns result from standardizing of their actions for experts and forming the specific patterns of action for intermediate game players. The gameplay pattern was elucidated by much more time and steps in the game for novices than for intermediate gamers. While there was an intensive distribution in the early stage of the game for experts, the novices' behavior pattern appeared in a divergent distribution in the whole gameplay. This study is concluded with key implications to support game design to improve the quality of game product.
Towards Effective Usage-Based Learning Applications: Track and Learn from User Experience(s)
Authors: Jehad Najjar, Erik Duval, Martin Wolpers
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper we propose a schema and framework for recording and managing attention metadata. This framework is intended to capture, manage, and re-use data about attention users give to learning objects in different applications. Capturing attention allows us to track what objects people use and how they use them.
A Contribution to Automatic Design of Image Processing Systems--Breeding Optimized Non-Linear and Oriented Kernels for Texture Analysis
Authors: Stefanie Peters, Andreas Koenig
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

The rapid development in image processing technology allows the tackling of application of increasing complexity. For efficient design of application specific systems design automation techniques are required. This paper reports on activities for texture classification employing non-linear oriented kernels configured by evolutionary optimization techniques. Our approach was tested with benchmark and application data from leather inspection and found viable and competitive in both cases.
A generalised exemplar approach to modeling perception action coupling
Authors: Liam Ellis, Richard Bowden
Venue: Proceedings of the Tenth IEEE International Conference on Computer Vision Workshops (2005)

We present a framework for autonomous behaviour in vision based artificial cognitive systems by imitation through coupled percept-action (stimulus and response) exemplars. Attributed Relational Graphs (ARGs) are used as a symbolic representation of scene information (percepts). A measure of similarity between ARGs is implemented with the use of a graph isomorphism algorithm and is used to hierarchically group the percepts. By hierarchically grouping percept exemplars into progressively more general models coupled to progressively more general Gaussian action models, we attempt to model the percept space and create a direct mapping to associated actions. The system is built on a simulated shape sorter puzzle that represents a robust vision system. Spatio temporal hypothesis exploration is performed ef- ficiently in a Bayesian framework using a particle filter to propagate game play over time.
Lightweight Service Architectures for Space Missions
Authors: Leo Hartman, Louis Hoebel
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

Service architectures provide mechanisms for transactions and for the aggregation and composition of services, including monitoring and self-actuation within the architecture. In this paper we present an architecture appropriate for the computationally limited environment of space missions. We address the ever-increasing time and cost of developing and operating the information systems that space missions embody through the composition of services in this lightweight architecture. A lightweight, Service-Oriented Architecture (SOA) can simplify system design and can support advanced computing concepts such as autonomic logistics and autonomic computing [1]. The unifying idea in a Light Weight Service Architecture (LWSA) is to abstract away idiosyncrasies of development, connection and use. Computational nodes in such an architecture are loosely coupled and inherit the advantages associated with networks in general including fault tolerance, reusability, scalability, performance and cost.
Analyzing Requirements for and Designing a Collaborative Tool based on Functional and User Input
Authors: Christopher Curtis, Vaughan Whited, David Kancler, Christopher Burneka
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

In flightline maintenance, collaboration is an important factor in the maintainer's quest to complete a difficult or unusual repair. Technology provides a multitude of potential collaborative tools and techniques, and this must be balanced against the requirement to leverage and/or support maintainers' existing interaction skills, rather than requiring them to adapt to the technology. This paper discusses the definition of collaboration, a high-level classification of collaboration types, followed by a discussion of the strategy used by the Aircraft Maintenance Intuitive Troubleshooting (AMIT) research project design team to determine the appropriate collaboration tools for the AMIT job aide. In general, this strategy utilized a blend of research and user feedback, balanced by end use environment constraints and requirements, to create a usable and useful collaboration capability for the Air Force maintenance technician.
Realistic Rendering and Animation of a Multi-Layered Human Body Model
Authors: Mehmet Sahin Yesil, Ugur Gudukbay
Venue: Proceedings of the conference on Information Visualization (2006)

A framework for realistic rendering of a multi-layered human body model is proposed in this paper. The human model is composed of three layers: skeleton, muscle, and skin. The skeleton layer, represented by a set of joints and bones, controls the animation of the human body using inverse kinematics. Muscles are represented with action lines that are defined by a set of control points. An action line applies the force produced by a muscle on the bones and on the skin mesh. The skin layer is modeled as a 3D mesh and deformed during animation by binding the skin layer to both the skeleton and muscle layers. The skin is deformed by a two-step algorithm according to the current state of the skeleton and muscle layers. Performance experiments show that it is possible to obtain real-time frame rates for a moderately complex human model containing approximately 33,000 triangles on the skin layer.
From Small to Gargantuan
Authors: Grady Booch
Venue: IEEE Software (2006)

Software development is ultimately an engineering activity, whose primary activity is to deliver executable artifacts in a manner that balances the forces on that system. The forces that swirl around a software-intensive system include not only its purely functional requirements but also a multitude of nonfunctional ones, such as reliability, portability, and scalability (often called a system's -ilities). Each of these forces is resolved systemically, meaning that no single part of a system can be responsible for responding to a force. Rather, the system as a whole, with its parts working in an architected union, must confront these forces. Indeed, the fact that these forces are dynamic and might change radically over a system's lifetime contributes to making software-intensive systems so complex.
Reuse Interaction Protocols to Develop Interactive Agents
Authors: Tarek Jarraya, Zahia Guessoum
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper addresses the problem of reusability of interaction protocols. Existing FIPA interaction protocols are first analyzed to define the required agent behaviors and the needed parameters to automatically adopt and execute interaction protocols. It then introduces an interactive agent framework, named INAF, to facilitate the development of interactive agents. To illustrate INAF, we give the implementation of timetable management benchmark.
Distributed Utilization Control for Real-Time Clusters with Load Balancing
Authors: Yong Fu, Hongan Wang, Chenyang Lu, Ramu Sharat Chandra
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Recent years have seen rapid growth of online services that rely on large-scale server clusters to handle high volume of requests. Such clusters must adaptively control the CPU utilizations of many processors in order to maintain desired soft real-time performance and prevent system overload in face of unpredictable workloads. This paper presents DUC-LB, a novel distributed utilization control algorithm for cluster-based soft real-time applications. Compared to earlier works on utilization control, a distinguishing feature of DUC-LB is its capability to handle system dynamics caused by load balancing, which is a common and essential component of most clusters today. Simulation results and control-theoretic analysis demonstrate that DUCLB can provide robust utilization control and effective load balancing in large-scale clusters.
Text retrieval with more realistic concept matching and reinforcement learning
Authors: Rohana K. Rajapakse, Michael Denham
Venue: Information Processing and Management: an International Journal (2006)

This paper reports our experimental investigation into the use of more realistic concepts as opposed to simple keywords for document retrieval, and reinforcement learning for improving document representations to help the retrieval of useful documents for relevant queries. The framework used for achieving this was based on the theory of Formal Concept Analysis (FCA) and Lattice Theory. Features or concepts of each document (and query), formulated according to FCA, are represented in a separate concept lattice and are weighted separately with respect to the individual documents they present. The document retrieval process is viewed as a continuous conversation between queries and documents, during which documents are allowed to learn a set of significant concepts to help their retrieval. The learning strategy used was based on relevance feedback information that makes the similarity of relevant documents stronger and non-relevant documents weaker. Test results obtained on the Cranfield collection show a significant increase in average precisions as the system learns from experience.
Optimum two level fractional factorial plans for model identification and discrimination
Authors: Subir Ghosh, Ying Tian
Venue: Journal of Multivariate Analysis (2006)

Model identification and discrimination are two major statistical challenges. In this paper we consider a set of models Mk for factorial experiments with the parameters representing the general mean, main effects, and only k out of all two-factor interactions. We consider the class D of all fractional factorial plans with the same number of runs having the ability to identify all the models in Mk, i.e., the full estimation capacity.The fractional factorial plans in D with the full estimation capacity for k ≥ 2 are able to discriminate between models in Mu for u ≤ k*, where k* = (k/2) when k is even, k* = ((k - 1)/2) when k is odd. We obtain fractional factorial plans in D satisfying the six optimality criterion functions AD, AT, AMCR, GD, GT, and GMCR for 2m factorial experiments when m = 4 and 5. Both single stage and multi-stage (hierarchical) designs are given. Some results on estimation capacity of a fractional factorial plan for identifying models in MK are also given. Our designs D4.1 and D10 stand out in their performances relative to the designs given in Li and Nachtsheim [Model-robust factorial designs, Technometrics 42(4) (2000) 345-352.] for m = 4 and 5 with respect to the criterion functions AD, AT, AMCR, GD, GT, and GMCR. Our design D4.2 stands out in its performance relative the Li-Nachtsheim design for m = 4 with respect to the four criterion functions AT, AMCR, GT, and GMCR. However, the Li-Nachtsheim design for m = 4 stands out in its performance relative to our design D4.2 with respect to the criterion functions AD and GD. Our design D14 does have the full estimation capacity for k = 5 but the twelve run Li-Nachtsheim design does not have the full estimation capacity for k = 5.
Fair service for mice in the presence of elephants
Authors: Seth Voorhies, Hyunyoung Lee, Andreas Klappenecker
Venue: Information Processing Letters (2006)

We show how randomized caches can be used in resource-poor partial-state routers to provide a fair share of bandwidth to short-lived flows that are known as mice when long-lived flows known as elephants are present.
RLM: A New Method of Encoding Weights in DNA Strands
Authors: Aili Han
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

How to encode weights in DNA computing is an important but challenging problem because many practical applications in the real world involve weights. In order to efficiently encode weights in DNA strands, we firstly proposed two definitions, the order number of weight and the relative length graph. And then, by means of the two definitions, we have devised a new method of encoding weights in DNA strands for a weighted graph G=(V,E,W), referred to relative length method (RLM). The RLM method can directly deal with weights of either real numbers or integers, even very small and very big positive weights, and the solution obtained in the RLM method isn't proportional to the length of DNA strand. The RLM method was applied to solve the traveling salesman problem, and it can be expanded to solve other numerical optimization problems.
jUDDI+: A SemanticWeb Services Registry enabling Semantic Discovery and Composition
Authors: Francesco Colasuonno, Stefano Coppi, Azzurra Ragone, Luca L. Scorcia
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

We propose an extended version of a UDDI registry for semantic-based automated Web service discovery and composition, compliant with Semantic Web technologies. The approach exploits non-standard inference services in a fragment of OWL DL to perform semantic matchmaking and covering. The proposed approach also deals with effect duplication and non-exact solutions, computing an approximate composition and providing an explanation of which part of the request is not covered by the composite web service.
Personalization in Context: Does Context Matter When Building Personalized Customer Models?
Authors: M. Gorgoglione, C. Palmisano, A. Tuzhilin
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

The idea that context is important when predicting customer behavior has been maintained by scholars in marketing and data mining. However, no systematic study measuring how much the contextual information really matters in building customer models in personalization applications have been done before. In this paper, we address this problem. To this aim, we collected data containing rich contextual information by developing a special-purpose browser to help users to navigate a well-known e-commerce retail portal and purchase products on its site. The experimental results show that context does matter for the case of modeling behavior of individual customers. The granularity of contextual information also matters, and the effect of contextual information gets diluted during the process of aggregating customers' data.
Shape Particle Guided Tissue Classification
Authors: Marleen de Bruijne
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In many cases, the accuracy of statistical pixel classification can be improved by applying a spatially varying prior that can be derived from a shape model. We propose to represent the prior knowledge on the spatial distribution of tissue classes by a distribution of shape particles, each representing one possible distribution of tissue classes. Classification and shape can then be optimized jointly by alternating a particle filtering step, in which the shape particle distribution is evolved under the influence of the current classification, with an update of the classification estimate using the shape distribution. Since a large number of shape hypotheses is used this method does not easily get trapped in local maxima. By applying shape models that are conditional on other, more easily discernible, objects in the image one can perform shape guided classification even if the shapes themselves are hardly visible. The method is demonstrated on the task of detecting aortic calcifications in X-ray images, in which calcifications can only be present inside the aorta - mainly on the aortic wall - but the aorta itself is not visible.
Semi-supervised Data Organization for Interactive Anomaly Analysis.
Authors: Javed Aslam, Sergey Bratus, Virgil Pavlu
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

We consider the problem of interactive iterative analysis of datasets that consist of a large number of records represented as feature vectors. The record set is known to contain a number of anomalous records that the analyst desires to locate and describe in a short and comprehensive manner. The nature of the anomaly is not known in advance (in particular, it is not known, which features or feature values identify the anomalous records, and which are irrelevant to the search), and becomes clear only in the process of analysis, as the description of the target subset is gradually refined. This situation is common in computer intrusion analysis, when a forensic analyst browses the logs to locate traces of an intrusion of unknown nature and origin, and extends to other tasks and data sets. To facilitate such "browsing for anomalies", we propose an unsupervised data organization technique for initial summarization and representation of data sets, and a semi-supervised learning technique for iterative modifications of the latter representation. Our approach is based on information content and Jensen-Shannon divergence and is related to information bottleneck methods. We have implemented it as a part of the Kerf log analysis toolkit.