ppxscal/embedding_network huggingface dataset:
Trust Architecture in Dynamic Systems
Authors: Guo Yajun, Yu Zhongqiang, Chen Hao, Dong Huihui
Venue: International Journal of Distributed Sensor Networks (2009)

Trust is the key for an information system to make security decisions. There does not exist in an aforehand trust relationship among principals in dynamic systems. To secure transaction, trust relationship must be established in principals. However, the existing trust architectures are flat, so they cannot embody well the dynamic characteristic of trust and do not take on well operability. In this paper, a two-layer trust architecture for dynamic systems is presented. Trust in this model is composed of a basic trust layer and a dynamic trust layer. Basic trust depends on the attributes of a principal, recommendation, or experience, while dynamic trust relies on the application context. This trust structure can reduce the complexity of making a decision in dynamic system. In dynamic systems, there are many factors to form trust, such as principal experience, attribute, recommendation, and context. In these trust factors, the context trust factor is different from the others, which it changes when close with the current context. We classify these trust factors into two groups. The first group includes experience, attribute, and recommendation to form this basic trust, while the second group involves current context to form dynamic trust. The trust value in this two-layer trust architecture was expressed as T = (Ta, Tc). Where Ta is the combination trust value of the attribute trust, experience, and recommendation trust, and Tc is the context trust value. Obviously, the relationship among trust values is a partial ordering. Experience usually associates with events. Positive trust events can increase the experience value, and negative trust events will reduce the experience. Because the importance of events is different, each event is assigned a weight. The larger the weight is, the more important the event is. Experience evaluation strategy provides the evaluation method for the occurred event. The attribute trust is the evaluation of the credibility, reliability, and security ability of the trusted principal according to the attributes of the trusted principal. The context trust is the trust evaluation of principals in a special context. Trust strategy is different in the different application context. For example, the trust strategy of a printer may be “medium” when the printer is free and the principal is in the offices, and may be “low” when the principal is not in the office, or when the printer is busy. The context trust value is the function of the context information: Tc = h(C), C is the context information.
A language-independent programmer's interface
Authors: Robert M. Balzer
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

This paper addresses the general problem of creating a suitable on-line environment for programming. The amount of software, and the effort required to produce it, to support such an on-line environment is very large relative to that needed to produce a programming language, and is largely responsible for the scarcity of such programming environments. The size of this effort was largely responsible for the scrapping of a major language (QA4) as a separate entity and its inclusion instead as a set of extensions in a LISP environment. The few systems which do exist (e.g., LISP, APL, BASIC, and PL/I) have greatly benefited their users and have strongly contributed to the widespread acceptance of the associated language.
Some Recommendations for Performance Testing Using TTCN-3
Authors: Hao Lou, Huaxin Zeng
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

The testing and test control notation (TTCN-3) is a new test specification and test implementation language that supports all kinds of black-box testing of distributed system. Typical areas of application are protocol testing, service testing, module testing, testing of CORBA based platform, APIs, etc. However, some deficiencies have been discovered when using TTCN-3 to describe and implement real-time testing and performance testing. In this paper we present the limitations of the following concepts in current TTCN-3 standard for performance testing including test verdict type, timer, synchronization mechanism, etc. Then some recommendations are proposed which will help to minimize the inaccuracies and support better performance testing. The methodology for TTCN-3 based performance testing presented in this paper is from three aspects, including performance extension to current TTCN-3 standard, performance evaluation of the test system itself and redesign of original external function. The proposed methodology has now been used in performance testing for IP routers sponsored by Sichuan Network Communication Technology Key Laboratory with the financial support from National Natural Science Foundation of China.
Dynamic Bayesian Networks for Acquisition Pattern Analysis: A Financial-Services Cross-Sell Application
Authors: Anita Prinzie, Dirk Poel
Venue: New Frontiers in Applied Data Mining: PAKDD 2008 International Workshops, Osaka, Japan, May 20-23, 2008. Revised Selected Papers (2009)

Sequence analysis has been employed for the analysis of longitudinal consumer behavior with the aim to support marketing decision making. One of the most popular applications involves Acquisition Pattern Analysis exploiting the existence of typical acquisition patterns to predict customer's most likely next purchase. Typically, these cross-sell models are restricted to the prediction of acquisitions for a limited number of products or within product categories. After all, most authors represent the acquisition process by an extensional, unidimensional sequence taking values from a symbolic alphabet. This sequential information is then modeled by (hidden) Markov models suffering from the state-space explosion problem. This paper advocates the use of intensional state representations exploiting structure and consequently allowing to model complex sequential phenomena like acquisition behavior. Dynamic Bayesian Networks (DBNs) represent the state of the environment (e.g. customer) by a set of variables and model the probabilistic dependencies of the variables within and between time steps. The advantages of this intensional state space representation are demonstrated on a cross-sell application for a financial-services provider. The DBN models multidimensional customer behavior as represented by acquisition, product ownership and covariate sequences. In addition to the ability to model structured multidimensional, potentially coupled, sequences, the DBN exhibits adequate predictive performance to support the financial-services provider's cross-sell strategy.
Detecting privacy violations in database publishing using disjoint queries
Authors: Millist W. Vincent, Mukesh Mohania, Mizuho Iwaihara
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

We present a new method of detecting privacy violations in the context of database publishing. Our method defines a published view V to preserve the privacy of a secret query Q if V and Q return no tuples in common, over all possible database instances. We then establish necessary and sufficient conditions that characterize when V preserves the privacy of Q in terms of the projected inequalities in the queries, both for conjunctive queries and queries with negation. We also show that integrity constraints have an effect on privacy, and derive a test for ensuring privacy preservation in the presence of FD constraints. The issue of privacy preservation in the presence of multiple views is investigated, and we show that it can reduced to the single view case for a suitably chosen view.
Universally Composable Multiparty Computation with Partially Isolated Parties
Authors: Ivan Damgård, Jesper Buus Nielsen, Daniel Wichs
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

It is well known that universally composable multiparty computation cannot, in general, be achieved in the standard model without setup assumptions when the adversary can corrupt an arbitrary number of players. One way to get around this problem is by having a trusted third party generate some global setup such as a common reference string (CRS) or a public key infrastructure (PKI). The recent work of Katz shows that we may instead rely on physical assumptions, and in particular tamper-proof hardware tokens. In this paper, we consider a similar but strictly weaker physical assumption. We assume that a player (Alice) can partially isolate another player (Bob) for a brief portion of the computation and prevent Bob from communicating more than some limited number of bits with the environment. For example, isolation might be achieved by asking Bob to put his functionality on a tamper-proof hardware token and assuming that Alice can prevent this token from communicating to the outside world. Alternatively, Alice may interact with Bob directly but in a special office which she administers and where there are no high-bandwidth communication channels to the outside world. We show that, under standard cryptographic assumptions, such physical setup can be used to UC-realize any two party and multiparty computation in the presence of an active and adaptive adversary corrupting any number of players. We also consider an alternative scenario, in which there are some trusted third parties but no single such party is trusted by all of the players. This compromise allows us to significantly limit the use of the physical set-up and hence might be preferred in practice.
A hybrid genetic algorithm for machine-part grouping
Authors: Adnan Tariq, Iftikhar Hussain, Abdul Ghafoor
Venue: Computers and Industrial Engineering (2009)

Cellular manufacturing (CM), which incorporates the flexibility of job shops and high production rate of flow lines, has been seen as a promising alternative for batch type production. Although CM provides great benefits, the design of CM is quite complex for real world problems. The main problem in the design of a CM is the formation of machine groups and corresponding part families. This paper aims at developing an approach that combines a local search heuristic (LSH) with genetic algorithm (GA). The approach has been tested on a number of problems from the literature. The results show that new approach not only converges to the best solution in the earlier generations but also produces solutions that are as accurate as any of the results reported, so far, in literature. Also, in certain cases the results produced by this technique are even better than the previously reported results.
Low-Power Circuit Techniques for Low-Voltage Pipelined ADCs Based on Switched-Opamp Architecture
Authors: Hsin-Hung Ou, Soon-Jyh Chang, Bin-Da Liu
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This paper proposes useful circuit structures for achieving a low-voltage/low-power pipelined ADC based on switched-opamp architecture. First, a novel unity-feedback-factor sample-and-hold which manipulates the features of switched-opamp technique is presented. Second, opamp-sharing is merged into switched-opamp structure with a proposed dual-output opamp configuration. A 0.8-V, 9-bit, 10-Msample/s pipelined ADC is designed to verify the proposed circuit. Simulation results using a 0.18-μm CMOS 1P6M process demonstrate the figure-of-merit of this pipelined ADC is only 0.71 pJ/step.
Approximating the Crossing Number of Apex Graphs
Authors: Markus Chimani, Petr Hliněný, Petra Mutzel
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

We show that the crossing number of an apex graph, i.e. a graph G from which only one vertex v has to be removed to make it planar, can be approximated up to a factor of &Delta;(G&thinsp;&minus;&thinsp;v)&middot;d(v)/2 by solving the vertex inserting problem, i.e. inserting a vertex plus incident edges into an optimally chosen planar embedding of a planar graph. Due to a recently developed polynomial algorithm for the latter problem, this establishes the first polynomial fixed-constant approximation algorithm for the crossing number problem of apex graphs with bounded degree.
Using formal models to design user interfaces: a case study
Authors: Judy Bowen, Steve Reeves
Venue: Proceedings of the 21st British CHI Group Annual Conference on HCI 2007: People and Computers XXI: HCI...but not as we know it - Volume 1 (2007)

The use of formal models for user interface design can provide a number of benefits. It can help to ensure consistency across designs for multiple platforms, prove properties such as reachability and completeness and, perhaps most importantly, can help incorporate the user interface design process into a larger, formally-based, software development process. Often, descriptions of such models and examples are presented in isolation from real-world practice in order to focus on particular benefits, small focused examples or the general methodology. This paper presents a case study of developing the user interface to a new software application using a particular pair of formal models, presentation models and presentation interaction models. The aim of this study was to practically apply the use of formal models to the design process of a UI for a new software application. We wanted to determine how easy it would be to integrate such models into our usual development process and to find out what the benefits, and difficulties, of using such models were. We will show how we used the formal models within a user-centred design process, discuss what effect they had on this process and explain what benefits we perceived from their use.
Spatially aware handhelds for high-precision tangible interaction with large displays
Authors: Alex Olwal, Steven Feiner
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

While touch-screen displays are becoming increasingly popular, many factors affect user experience and performance. Surface quality, parallax, input resolution, and robustness, for instance, can vary with sensing technology, hardware configurations, and environmental conditions. We have developed a framework for exploring how we could overcome some of these dependencies, by leveraging the higher visual and input resolution of small, coarsely tracked mobile devices for direct, precise, and rapid interaction on large digital displays. The results from a formal user study show no significant differences in performance when comparing four techniques we developed for a tracked mobile device, where two existing touch-screen techniques served as baselines. The mobile techniques, however, had more consistent performance and smaller variations among participants, and an overall higher user preference in our setup. Our results show the potential of spatially aware handhelds as an interesting complement or substitute for direct touch-interaction on large displays.
Biosurveillance of emerging biothreats using scalable genotype clustering
Authors: Blanca Gallego, Vitali Sintchenko, Qinning Wang, Lester Hiley, Gwendolyn L. Gilbert, Enrico Coiera
Venue: Journal of Biomedical Informatics (2009)

Developments in molecular fingerprinting of pathogens with epidemic potential have offered new opportunities for improving detection and monitoring of biothreats. However, the lack of scalable definitions for infectious disease clustering presents a barrier for effective use and evaluation of new data types for early warning systems. A novel working definition of an outbreak based on temporal and spatial clustering of molecular genotypes is introduced in this paper. It provides an unambiguous way of clustering of causative pathogens and is adjustable to local disease prevalence and availability of public health resources. The performance of this definition in prospective surveillance is assessed in the context of community outbreaks of food-borne salmonellosis. Molecular fingerprinting augmented with the scalable clustering allows the detection of more than 50% of the potential outbreaks before they reach the midpoint of the cluster duration. Clustering in time by imposing restrictions on intervals between collection dates results in a smaller number of outbreaks but does not significantly affect the timeliness of detection. Clustering in space and time by imposing restrictions on the spatial and temporal distance between cases results in a further reduction in the number of outbreaks and decreases the overall efficiency of prospective detection. Innovative bacterial genotyping technologies can enhance early warning systems for public health by aiding the detection of moderate and small epidemics.
Efficient long-term quality-of-inference (QoINF)-aware context determination in pervasive care environments
Authors: Nirmalya Roy, Archan Misra, Sajal K. Das
Venue: Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments (2008)

Energy-efficient determination of an individual's context (both physiological and activity) is an important technical challenge for assisted living environments. Given the expected availability of multiple sensors, context determination may be viewed as an estimation problem over multiple sensor data streams. This paper develops a formal, and practically applicable, model to capture the tradeoff between the accuracy of context estimation and the communication overheads of sensing. In particular, we propose the use of tolerance ranges to reduce an individual sensor's reporting frequency, while ensuring acceptable accuracy of the derived context. In our vision, applications specify their minimally acceptable value for a Quality-of Inference (QoINF) metric. We introduce an optimization technique allowing the Context Service to compute both the best set of sensors, and their associated tolerance values, that satisfy the QoINF target at minimum communication cost. Early experimental results with SunSPOT sensors are presented to attest to the promise of this approach.
MEMMU: Memory expansion for MMU-less embedded systems
Authors: Lan S. Bai, Lei Yang, Robert P. Dick
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2009)

Random access memory (RAM) is tightly constrained in the least expensive, lowest-power embedded systems such as sensor network nodes and portable consumer electronics. The most widely used sensor network nodes have only 4 to 10KB of RAM and do not contain memory management units (MMUs). It is difficult to implement complex applications under such tight memory constraints. Nonetheless, price and power-consumption constraints make it unlikely that increases in RAM in these systems will keep pace with the increasing memory requirements of applications. We propose the use of automated compile-time and runtime techniques to increase the amount of usable memory in MMU-less embedded systems. The proposed techniques do not increase hardware cost, and require few or no changes to existing applications. We have developed runtime library routines and compiler transformations to control and optimize the automatic migration of application data between compressed and uncompressed memory regions, as well as a fast compression algorithm well suited to this application. These techniques were experimentally evaluated on Crossbow TelosB sensor network nodes running a number of data-collection and signal-processing applications. Our results indicate that available memory can be increased by up to 50&percnt; with less than 10&percnt; performance degradation for most benchmarks.
Integer Linear Programming in Designing Universal Arrays with Multiplexed Applications
Authors: Atif Rahman, Mahmuda Naznin, Masud Hasan
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Single Nucleotide Polymorphisms (SNPs) are variations in a single nucleotide within a generally conserved genomic sequence across the population. SNPs can be genotyped using a universal DNA tag array. But cross-hybridization involving assay-specific components disrupts this process. The problem of identifying the most economic experimental con-figuration of the assay specific components that avoids cross hybridization can be formulated as an optimization problem. More specifically, the problem translates into the problem of covering the vertices of one side of a bipartite graph by a minimum number of balanced subgraphs of maximum degree one. The problem was shown to be NP-complete by Ben-Dor et.al. [1]. In this paper, we give integer linear programming formulation of this problem. We also provide an integer linear programming formulation of a mathematically related problem.
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
Authors: Martin Dietzfelbinger, Ulf Schellbach
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T 1 and T 2 each of which has m cells of capacity 1 such that constant access time is guaranteed. For m&thinsp;&ge;&thinsp;(1&thinsp;+&thinsp;&epsilon;)n and hash functions h 1, h 2 that are c logn-wise independent, Pagh [11] showed that the keys of an arbitrary set S can be stored using h 1 and h 2 with a probability of 1&thinsp;&minus;&thinsp;O(1/n). Here we prove that a family of simple hash functions that can be evaluated fast is not sufficient to guarantee this behavior, namely there exists a &ldquo;bad&rdquo; set S of size &asymp;&thinsp;(7/8) &middot;m for which the probability that the keys of S cannot be stored using h 1 and h 2 is &Omega;(1). Experiments indicate that the bad sets cause the cuckoo scheme to fail with a probability much larger than formally proved in our main theorem. Our result shows that care must be taken when using cuckoo hashing in combination with very simple hash classes, if a small failure probability is essential since frequent rehashing cannot be tolerated.
Use of particle swarm optimization for machinery fault detection
Authors: B. Samanta, C. Nataraj
Venue: Engineering Applications of Artificial Intelligence (2009)

A study is presented on the application of particle swarm optimization (PSO) combined with other computational intelligence (CI) techniques for bearing fault detection in machines. The performance of two CI based classifiers, namely, artificial neural networks (ANNs) and support vector machines (SVMs) are compared. The time domain vibration signals of a rotating machine with normal and defective bearings are processed for feature extraction. The extracted features from original and preprocessed signals are used as inputs to the classifiers for detection of machine condition. The classifier parameters, e.g., the number of nodes in the hidden layer for ANNs and the kernel parameters for SVMs are selected along with input features using PSO algorithms. The classifiers are trained with a subset of the experimental data for known machine conditions and are tested using the remaining set of data. The procedure is illustrated using the experimental vibration data of a rotating machine. The roles of the number of features, PSO parameters and CI classifiers on the detection success are investigated. Results are compared with other techniques such as genetic algorithm (GA) and principal component analysis (PCA). The PSO based approach gave a test classification success rate of 98.6-100% which were comparable with GA and much better than with PCA. The results show the effectiveness of the selected features and the classifiers in the detection of the machine condition.