ppxscal/embedding_network huggingface dataset:
Using context and preferences to implement self-adapting pervasive computing applications: Experiences with Auto-adaptive and Reconfigurable Systems
Authors: Karen Henricksen, Jadwiga Indulska, Andry Rakotonirainy
Venue: Software&mdash;Practice Experience (2006)

Applications that exploit contextual information in order to adapt their behaviour to dynamically changing operating environments and user requirements are increasingly being explored as part of the vision of pervasive or ubiquitous computing. Despite recent advances in infrastructure to support these applications through the acquisition, interpretation and dissemination of context data from sensors, they remain prohibitively difficult to develop and have made little penetration beyond the laboratory. This situation persists largely due to a lack of appropriately high-level abstractions for describing, reasoning about and exploiting context information as a basis for adaptation. In this paper, we present our efforts to address this challenge, focusing on our novel approach involving the use of preference information as a basis for making flexible adaptation decisions. We also discuss our experiences in applying our conceptual and software frameworks for context and preference modelling to a case study involving the development of an adaptive communication application. Copyright &copy; 2006 John Wiley & Sons, Ltd.
An Auto Configuration System for the GMSEC Architecture and API
Authors: Arturo Mayorga
Venue: Proceedings of the 2nd IEEE International Conference on Space Mission Challenges for Information Technology (2006)

GMSEC is a conglomeration of tasks built around a message bus architecture established in 2001 to coordinate ground and flight data systems development and services at GSFC. The auto configuration system provides ubiquitous configuration management for all components running on a mission operation center. This is accomplished by creating a set of GMSEC compliant Configuration Management Agent (CMA) tools, extensions to the GMSEC API as well a self configuring middleware (GMSEC Message Bus). Automatic configuration is part of the autonomic computing model being developed for net generation missions at GSFC.
Ontologies for supply chain simulation modeling
Authors: Mohamed Fayez, Luis Rabelo, Mansooreh Mollaghasemi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Simulation might be an effective decision support tool in supply chain management. The review of supply chain simulation modeling methodologies revealed some issues one of which is the practicability of simulation in the supply chain environment. The supply chain environment is dynamic, information intensive, geographically dispersed, and heterogeneous. In order to develop usable supply chain simulation models, the models should be feasibly applicable in the supply chain environment. Distributed simulation models have been used by several researchers, however, their complexity and usability hindered their continuation. In this paper, a new approach is proposed. The approach is based on Ontologies to integrate several supply chain views and models, which captures the required distributed knowledge to build simulation models. The Ontology core is based on the SCOR model as the widely shared supply chain concepts. The ontology can define any supply chain and help the user to build the required simulation models.
Real-time image on QoS Web
Authors: Hong Liu
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

Digital images have become a dominant information source on the Web. Emerging Web-enabled applications, such as global collaboration in environmental studies, point and click manufacturing, and electronic commerce, to name a few, push for timely processing and transmission of images. This real-time imaging is much more than variations on image processing without regard to time. Its performance requirement on networking is beyond the capability of the current Internet, which provides a best-effort service model compromised with end-system traffic management. For the Web to support real-time images, we need to understand real-time image features, design a new Web service model, and convert a user's application requirement into a system service agreement. This paper presents a Web architecture that provides predictable and different service levels for specific quality of service (QoS) requirements, called QoS Web. We examine the Web image features in depth, which leads to a generic formula describing a user's preferences for image quality and timing constraints. It then maps onto the QoS requirements as resource parameters expected from the Web. The influence of the QoS settings on the perceived image performance is analyzed in theory and tested with experimental simulation. We present a procedure for users to specify their requirements to the QoS Web for real-time image transfer. In addition, an inverse mapping mechanism is included for re-negotiation when there is a shortage of network resources or the user's requirements change.
Research on an Improved Gray Gradient Orientation Algorithm in Anisotropic High-Pass Filtering
Authors: Qing Pan, Guoping Yan, Yukuan Zhang, Nili Tian
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

The edge's orientation obtained with the method of gray gradient orientation may be quite different from the real edge's orientation, leading to deterioration of the high-pass filtering performance. In this paper, an original scheme of the improved algorithm on the method of the gray gradient orientation is proposed. Making full use of the pixels in the region to obtain the estimated angle, which is much closer to that of the real edge's orientation. The experimental result shows that using the algorithm put forward in this paper, we can obtain the more ideal filtering performance in highpass filtering.
An empirical comparison between pair development and software inspection in Thailand
Authors: Monvorath Phongpaibul, Barry Boehm
Venue: Proceedings of the 2006 ACM/IEEE international symposium on Empirical software engineering (2006)

Although pair programming and software inspection have the common aim of minimizing the defects of the software product, each practice has its strengths and weaknesses. We need to understand their costs and benefits under given conditions to be able to select a practice to execute in a development project. The objective of this study is to compare the commonalities and differences between pair development and software inspection as verification techniques in Thailand. One classroom experiment and one industry experiment were conducted. The development effort and effect of quality were investigated with some additional calendar time comparisons. The classroom results showed that average development effort of the pair development group was 24% less than inspection group with the improved product quality. The industry experiment showed pair development to have about 4% more effort but about 40% fewer major defects. In addition, the impacts of cultural differences to the adoption of pair programming or software inspection in Thailand are discussed.
Communications, navigation, and surveillance events simulation for the national airspace system
Authors: Paul T. R. Wang, Leonard A. Wojcik, Scott B. Mayer
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The National Airspace System (NAS) is a large and complex system encompassing a wide-range of resources to enable safe and efficient air transportation. To effectively manage the NAS, it is very important to be able to reliably assess current and future demand for communications, navigation, and surveillance (CNS) resources as they are triggered by air traffic control (ATC) events. The authors present an integrated model that is capable of relating NAS ATC events to NAS CNS demand. Model validation with a subset of recorded ETMS CNS statistics will be presented. Combining such a model with NAS future demand predictors such as Terminal Area Forecasts (TAF) and Future Aviation Timetable Estimator (FATE), it becomes possible to estimate the increase in CNS demand and future requirements for CNS capacity, for resource planning purposes. The model presented in this paper includes tracking of radar-related messages and sector workload.
Policy enforcement via program monitoring
Authors: David P. Walker
Venue:  (2006)

One way to guarantee that software behaves securely is to monitor programs at run time and check that they dynamically adhere to constraints specified by a security policy. Whenever a program monitor detects that untrusted software is attempting to execute a dangerous action, it takes remedial steps to ensure that only safe code actually gets executed. This thesis considers the space of policies enforceable by monitoring the run-time behaviors of programs and develops a practical language for specifying monitors' policies. In order to delineate the space of policies that monitors can enforce, we first have to define exactly what it means for a monitor to enforce a policy. We therefore begin by building a formal framework for analyzing policy enforcement; we precisely define policies, monitors, and enforcement. Having this framework allows us to consider the enforcement powers of program monitors and prove that they enforce an interesting set of policies that we define and call the infinite renewal properties. We show how, when given any reasonable infinite renewal property, to construct a program monitor that provably enforces that policy. In practice, the security policies enforced by program monitors grow more complex both as the monitored software is given new capabilities and as policies are refined in response to attacks and user feedback. We propose dealing with policy complexity by organizing policies in such a way as to make them composeable, so that complex policies can be specified more simply as compositions of smaller spicily modules. We present a fully implemented language and system called Polymer that allows security engineers to specify and enforce composeable policies on Java applications. We also formalize the central workings of Polymer by defining an unambiguous semantics for our language.
Perceptual Expertise Effects Are Not All or None: Spatially Limited Perceptual Expertise for Faces in a Case of Prosopagnosia
Authors: Cindy M. Bukach, Daniel N. Bub, Isabel Gauthier, Michael J. Tarr
Venue: Journal of Cognitive Neuroscience (2006)

We document a seemingly unique case of severe prosopagnosia, L. R., who suffered damage to his anterior and inferior right temporal lobe as a result of a motor vehicle accident. We systematically investigated each of three factors associated with expert face recognition: fine-level discrimination, holistic processing, and configural processing (Experiments 1&ndash;3). Surprisingly, L. R. shows preservation of all three of these processes; that is, his performance in these experiments is comparable to that of normal controls. However, L. R. is only able to apply these processes over a limited spatial extent to the fine-level detail within faces. Thus, when the location of a given change is unpredictable (Experiment 3), L. R. exhibits normal detection of features and spatial configurations only for the lower half of each face. Similarly, when required to divide his attention over multiple face features, L. R. is able to determine the identity of only a single feature (Experiment 4). We discuss these results in the context of forming a better understanding of prosopagnosia and the mechanisms used in face recognition and visual expertise. We conclude that these mechanisms are not "all-or-none," but rather can be impaired incrementally, such that they may remain functional over a restricted spatial area. This conclusion is consistent with previous research suggesting that perceptual expertise is acquired in a spatially incremental manner [Gauthier, I., & Tarr, M. J. Unraveling mechanisms for expert object recognition: Bridging brain activity and behavior. Journal of Experimental Psychology: Human Perception & Performance, 28, 431&ndash;446, 2002].
Effect of Time Strategies on the Profit of Agents Using Adaptive Bid Softness Determination in Continuous Double Auctions with a Fixed Deadline
Authors: Huiye Ma, Ho-fung Leung
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)

In this paper, we consider continuous double auctions (CDAs) with a fixed deadline. The protocol allows the specification of a deadline since in real world trading, it is often essential to conclude a transaction among agents under a fixed deadline. Time strategies of agents are defined for buyers and sellers. The effect of different time strategies on the profit of agents submitting soft asks and soft bids is evaluated by experiments. It turns out that when it is easy for the agent to trade all his good, he should wait some time before getting involved in the trading process and utilize a large value of submission time in the time strategy. On the contrary, he should make a quicker decision by adopting a small value of submission time in the time strategy. Based on these results, an adaptive mechanism is designed to guide agents employing various bidding strategies to consider the effect of time. Fuzzy concepts are applied in the mechanism. Experimental results demonstrate that agents with the adaptive mechanism perform better than agents without the adaptive mechanism.
Consistency of location and gradient judgments of visually-interpolated contours
Authors: Jacqueline M. Fulvio, Manish Singh, Laurence T. Maloney
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We report two experiments assessing how observers interpolate partly-occluded contours induced by pairs of line segments that disappeared behind an occluder. On each trial observers iteratively adjusted the location and orientation of a short line probe that could be moved vertically within the region of occlusion. They were instructed to set the line probe to be tangent to the occluded contour. The line probe could appear at one of six horizontal offsets and the inducer pairs on some trials were relatable (the inducers could be joined by a smooth curve without a point of inflection) and on other trials non-relatable. We interpreted the settings as estimates of the location and gradient (slope) of the contour in the region of occlusion. We tested whether the resulting visual estimates of location and gradient were consistent with any single smooth contour. When inducers were relatable, estimates of location and gradient were mutually consistent for all observers and could be modeled as polynomials of 5^th or lower degree. When the inducers were non-relatable, the consistency of location and gradient settings deteriorated, indicating that there can be no single smooth curve that accounts for observers' judgments. We discuss the implication of these results for models of human visual interpolation.
On the analysis of interacting pushdown systems
Authors: Vineet Kahlon, Aarti Gupta
Venue: Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2007)

Pushdown Systems (PDSs) have become an important paradigm for program analysis. Indeed, recent work has shown a deep connection between inter-procedural dataflow analysis for sequential programs and the model checking problem for PDSs. A natural extension of this framework to the concurrent domain hinges on the, somewhat less studied, problem of model checking Interacting Pushdown Systems. In this paper, we therefore focus on the model checking of Interacting Pushdown Systems synchronizing via the standard primitives - locks, rendezvous and broadcasts, for rich classes of temporal properties - both linear and branching time. We formulate new algorithms for model checking interacting PDSs for important fragments of LTL and the Mu-Calculus. Additionally, we also delineate precisely the decidability boundary for each of the standard synchronization primitives.
Novel Cursive Character Recognition System
Authors: Karina Toscano, Gabriel Sanchez, Mariko Nakano, Hector Perez, Makoto Yasuhara
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

During the last two decade, numerous handwriting character recognition systems have been proposed. Many of them presented their limitation when the handwriting character is cursive type and it has some deformation. However this type of cursive character is easily recognized by the human being. In this paper we research its human ability and apply it to the dynamic handwriting character recognition. In the proposed system, significant knots of each character are extracted using natural Spline function named SLALOM and their position is optimized with Steepest Descent Method. Using a training set consisting of the sequence of optimal knots, each character model will be constructed. Finally the unknown input character will be compared with each model of all characters to get the similarity scores. The character model with higher similarity score will be considered as the recognized character of the input data. The recognition stage consists in two-steps: classification using global feature and classification using local feature. The global recognition rate of the proposed system is approximately 96%.
Particle Video: Long-Range Motion Estimation using Point Trajectories
Authors: Peter Sand, Seth Teller
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

This paper describes a new approach to motion estimation in video. We represent video motion using a set of particles. Each particle is an image point sample with a longduration trajectory and other properties. To optimize these particles, we measure point-based matching along the particle trajectories and distortion between the particles. The resulting motion representation is useful for a variety of applications and cannot be directly obtained using existing methods such as optical flow or feature tracking. We demonstrate the algorithm on challenging real-world videos that include complex scene geometry, multiple types of occlusion, regions with low texture, and non-rigid deformations.
Improving Personalization Solutions through Optimal Segmentation of Customer Bases
Authors: Tianyi Jiang, Alexander Tuzhilin
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

On the Web, where the search costs are low and the competition is just a mouse click away, it is crucial to segment the customers intelligently in order to offer more targeted and personalized products and services to them. Traditionally, customer segmentation is achieved using statistics-based methods that compute a set of statistics from the customer data and group customers into segments by applying distance-based clustering algorithms in the space of these statistics. In this paper, we present a direct grouping based approach to computing customer segments that groups customers not based on computed statistics, but in terms of optimally combining transactional data of several customers to build a data mining model of customer behavior for each group. Then building customer segments becomes a combinatorial optimization problem of finding the best partitioning of the customer base into disjoint groups. The paper shows that finding an optimal customer partition is NP-hard, proposes a suboptimal direct grouping segmentation method and empirically compares it against traditional statistics-based segmentation and 1-to-1 methods across multiple experimental conditions. We show that the direct grouping method significantly dominates the statistics-based and 1-to-1 approaches across all the experimental conditions, while still being computationally tractable. We also show that there are very few size-one customer segments generated by the best direct grouping method and that micro-segmentation provides the best approach to personalization.
The use of a pharmacophore model for identification of novel ligands for the benzodiazepine binding site of the GABAA receptor
Authors: Pia Kahnberg, Michael H. Howard, Tommy Liljefors, Mogens Nielsen, Elsebet Østergaard Nielsen, Olov Sterner, Ingrid Pettersson
Venue: Journal of Molecular Graphics (2004)

A Catalyst pharmacophore model has been developed for the benzodiazepine site within the GABAA receptor complex. The model is based on a pharmacophore model originally proposed by Cook and co-workers (Drug Des. Discovery 1995, 12, 193-248) and further developed by Kahnberg et al. (J. Med. Chem. 2002, 45, 4188-4201). The Catalyst pharmacophore model has been validated by using a series of flavonoids with varying affinities for the benzodiazepine receptor and has then been used as a search query in database searching with the aim of finding novel structures which have the possibility to be modified into novel lead compounds. Five of the hits from the database searching were purchased and their affinities for the benzodiazepine site of the GABAA receptor were determined. Two of the compounds displayed Kivalues below 10 µM. The substance showing highest potency in-vitro displayed an affinity of 121 nM making it an interesting compound for optimization. The false positive compounds (Ki values > 10 µM affinities) have been analysed in terms of conformational energy penalties and possibilities for hydrogen bond interactions. The analysis clearly demonstrates the need for post processing of Catalyst hits.
Description of bad-signatures for network intrusion detection
Authors: Michael Hilker, Christoph Schommer
Venue: Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54 (2006)

Today, a computer network is under constant assault from attacks. In Computer Science, NIDS are used in order to protect a computer network against these intrusions. These systems normally use stochastic approaches or a rule-based system to detect intrusions and to describe the known intrusions. These systems have some disadvantages which we solve with a new approach called ANIMA. ANIMA stores bad-signatures of intrusions in directed and weighted graphs as well as returns for each checked-packet a value how malicious the packet is. The primary advantages of ANIMA are the online-system, adaptation, easy administration and storage-saving. In this article, we discuss the approach ANIMA for intrusion detection, the advantages and disadvantages, the implementation as well as the results occurred out of the simulations that ANIMA for intrusion detection works well in bad-packet-identification as well as the implementation substantiates the theoretical advantages.
Word order and discontinuities in dependency grammar
Authors: C. Bartha, T. Spiegelhauer, R. Dormeyer, I. Fischer
Venue: Acta Cybernetica (2006)

Natural languages are always difficult to parse. Two phenomena that constantly pose problems for different formalisms are word order--what part of a sentence has to be placed where--and discontinuities--words that belong together but are not placed into the same phrase. Dependency grammar, a linguistic formalism based on binary relations between words, is very adequate for handling both problems. A parser for dependency grammar together with its grammar writing formalism is described in this paper. Word order and discontinuities in Hungarian are handled based on this formalism.