ppxscal/embedding_network huggingface dataset:
A data outsourcing architecture combining cryptography and access control
Authors: Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

Data outsourcing is becoming today a successful solution that allows users and organizations to exploit external servers for the distribution of resources. Some of the most challenging issues in such a scenario are the enforcement of authorization policies and the support of policy updates. Since a common approach for protecting the outsourced data consists in encrypting the data themselves, a promising approach for solving these issues is based on the combination of access control with cryptography. This idea is in itself not new, but the problem of applying it in an outsourced architecture introduces several challenges. In this paper, we first illustrate the basic principles on which an architecture for combining access control and cryptography can be built. We then illustrate an approach for enforcing authorization policies and supporting dynamic authorizations, allowing policy changes and data updates at a limited cost in terms of bandwidth and computational power.
Experimental evaluation of TCP protocols for high-speed networks
Authors: Yee-Ting Li, Douglas Leith, Robert N. Shorten
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

In this paper, we present experimental results evaluating the performance of the scalable-TCP, HS-TCP, BIC-TCP, FAST-TCP, and H-TCP proposals in a series of benchmark tests. In summary, we find that both Scalable-TCP and FAST-TCP consistently exhibit substantial unfairness, even when competing flows share identical network path characteristics. Scalable-TCP, HS-TCP, FAST-TCP, and BIC-TCP all exhibit much greater RTT unfairness than does standard TCP, to the extent that long RTT flows may be completely starved of bandwidth. Scalable-TCP, HS-TCP, and BIC-TCP all exhibit slow convergence and sustained unfairness following changes in network conditions such as the start-up of a new flow. FAST-TCP exhibits complex convergence behavior.
Improving the Tolerance of Pipeline Based Circuits to Power Supply or Temperature Variations
Authors: J. Semiao, J. J. Rodriguez-Andina, F. Vargas, M. B. Santos, I. C. Teixeira, J. P. Teixeira
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

A new methodology is proposed to increase the robustness of pipeline-based circuits. The goal is to improve signal integrity in the presence of power-supply voltage (VDD) and/or temperature (T) variations, without degrading circuit performance. In the proposed methodology, we dynamically control the instant of data capture (the clock edge trigger) in key memory cells, according to local VDD and/or T variations. This way, data integrity loss is avoided, and circuit tolerance to power supply and/or temperature variations is enhanced. The methodology is based on a Dynamic Delay Buffer (DDB) block, used to sense VDD/T variations and to induce dynamic clock skews driving a limited subset of memory elements. Experimental results based on SPICE simulations for 2 sequential circuits are used to demonstrate that careful design may lead to improvements on circuit tolerance to VDD and/or T variations.
A Reliable SLA-based Admission Controller for MPLS Networks
Authors: Jian Pu, Kin F. Li, Mostofa Akbar, Gholamali C. Shoja, Eric Manning
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

This paper introduces a reliability conscious admission controller for enterprise level data networks. It builds upon earlier work on adaptive admission controllers designed to optimize utility (often revenue) in a data network. This was generally accomplished by using Service Level Agreements (SLAs) to describe user requirements, and developing techniques for optimally accommodating a subset of all the SLAs requests for admission. Such admission problem can be mapped to a variant of the classic Knapsack problem. The controller introduced here, called the Reliable SLA Optimizer (R-SLAOpt), extends the previous model to make provisions for improved reliability. For instance, an SLA must be allocated to a new path in the event of a link failure. To accomplish this SLA adaptation, alternate paths are pre-calculated and therefore these paths can be quickly selected and activated. This makes R-SLAOpt a far more appropriate model for time critical applications, such as managing multimedia sessions.
Testing Techniques - Are they of any Practical Use?
Authors: Stephen Allott
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

Testing techniques are taught in Universities and on many industrial training courses yet there is evidence to suggest that, in the corporate world, testers often find it difficult to apply the techniques and instead rely on domain knowledge and experience when designing tests. This is a shame as testing techniques are very effective at reducing the cost of testing by providing better coverage with less effort. When applying techniques it is important to be pragmatic and understand where they can add value to your test process. A business focused approach, based on risk, is essential. Commercial strength tools must be considered to support the test process although home grown solutions should not be ruled out in some situations. An appropriate investment in effective testing will yield dividends in the longer term and so further research is required to understand why testing techniques are not much more widely adopted throughout industry.
Advanced methods for two-class pattern recognition problem formulation for minutiae-based fingerprint verification
Authors: Alessandra Lumini, Loris Nanni
Venue: Pattern Recognition Letters (2008)

We present a new method for minutiae-based fingerprint verification that approaches the problem as a two-class pattern recognition problem. In our knowledge, this is one of the first works that uses as features for fingerprint verification the response of a minutiae matcher between two fingerprint. The feature vector obtained by the minutiae matching is classified into ''genuine'' or ''impostor'' by support vector machines. Results from FVC2002 are presented, yielding remarkable performance improvement with respect to other state-of-the-art approaches.
Using traceability to support model-based regression testing
Authors: Leila Naslavsky, Debra J. Richardson
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Model-driven development is leading to increased use of models in conjunction with source code in software testing. Model-based testing, however, introduces new challenges for testing activities, which include creation and maintenance of traceability information among test-related artifacts. Traceability is required to support activities such as selective regression testing. In fact, most model-based testing automated approaches often concentrate on the test generation and execution activities, while support to other activities is limited (e.g. model-based selective regression testing, coverage analysis and behavioral result evaluation) To address this problem, we propose a solution that uses model transformation to create a traceable infrastructure of test-related artifacts. We use this infrastructure to support model-based selective regression testing.
Guest Editors' Introduction: Security & Privacy
Authors: Jason Hong, Mahadev Satyanarayanan, George Cybenko
Venue: IEEE Pervasive Computing (2007)

Security and privacy concerns touch on all aspects of pervasive computing, including hardware, operating systems, networks, databases, user interfaces, and applications. The seven articles selected for this special issue draw on ideas from many of these fields and provide a flavor of the kinds of security and privacy challenges and opportunities in pervasive computing. This article is part of a special issue on security and privacy.
Introduction Multiple-Valued Logic
Authors: J. C. Muzio
Venue: IEEE Transactions on Computers (1986)

MULTIPLE-valued logic has been the object of much research over the last fifteen years. Since 1971, there has been an annual symposium devoted exclusively to the subject and, during that time, nearly 600 papers have appeared in its Proceedings. In addition, a large number of technical papers have appeared elsewhere together with a number of survey articles [1]-[4] and a number of textbooks [5]-[7]. Much of the older work was of a purely theoretical nature concerned with the functional completeness of sets of operators, functional minimization, and similar problems from switching theory and logic design. Work on the hardware implementation of multiple-valued devices has been more recent (see [8] for an early discussion).
Shakespearean karaoke
Authors: Lauren Cairco, Sabarish Babu, Amy Ulinski, Catherine Zanbaka, Larry F. Hodges
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Traditionally, students study plays by reading from a book. However, reading dialogue on paper does not always communicate the various emotions and actions that help people understand the significance of the person-to-person interactions that are represented.
Early profile pruning on XML-aware publish-subscribe systems
Authors: Mirella M. Moro, Petko Bakalov, Vassilis J. Tsotras
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Publish-subscribe applications are an important class of content-based dissemination systems where the message transmission is defined by the message content, rather than its destination IP address. With the increasing use of XML as the standard format on many Internet-based applications, XML aware pub-sub applications become necessary. In such systems, the messages (generated by publishers) are encoded as XML documents, and the profiles (defined by subscribers) as XML query statements. As the number of documents and query requests grow, the performance and scalability of the matching phase (i.e. matching of queries to incoming documents) become vital. Current solutions have limited or no flexibility to prune out queries in advance. In this paper, we overcome such limitation by proposing a novel early pruning approach called Bounding-based XML Filtering or BoXFilter. The BoXFilter is based on a new tree-like indexing structure that organizes the queries based on their similarity and provides lower and upper bound estimations needed to prune queries not related to the incoming documents. Our experimental evaluation shows that the early profile pruning approach offers drastic performance improvements over the current state-of-the-art in XML filtering.
New Mutations for Evaluation of Specification and Implementation Levels of Adequacy in Testing of Statecharts Models
Authors: Mark Trakhtenbrot
Venue: Proceedings of the Testing: Academic and Industrial Conference Practice and Research Techniques - MUTATION (2007)

In model-based development of embedded real-time systems, statecharts are widely used for formal specification of their behavior, providing a sound basis for test generation and for detection of faults early in the development process. The paper presents a variety of new mutations for adequacy evaluation of tests used in validation of statecharts-based models. These mutations focus on key features of statecharts used in modeling of embedded systems: hierarchy, orthogonality and time expressions. We distinguish between two levels of tests adequacy. In the first, test results are expected to strictly follow the statecharts semantics. The second one takes into account possible deviations from this semantics based on typical implementation oriented decisions, e.g. mapping of orthogonal components into separate tasks executed concurrently. The considered mutations address both types of adequacy. In particular, we consider interleaving enforcing mutations, for testing of alternatives to the canonical "maximum parallelism" execution of statecharts.
The Future of Social Networks on the Internet: The Need for Semantics
Authors: John Breslin, Stefan Decker
Venue: IEEE Internet Computing (2007)

Fundamental problems with today's social networking services block their potential to access the full range of available content and networked people online. A possible solution is to build semantic social networking into the fabric of the next-generation Internet itself, interconnecting both content and people in meaningful ways. The authors argue that, rather than building a separate social networking layer into tools, information space and application architects need to fold it into the technology stacks of clients (the desktop) and the Internet.
A Study of Neighborhood Competing Models Based Verification Method
Authors: Chengli Sun, Gang Liu, Jun Guo
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Utterance verification (UV) is an important portion in an intelligent speech recognition system, which role is determine if the input speech actual includes the word sound(s). In this study, we address the UV problem in the model neighborhood information viewpoint. We present a new robust verification method which can enhance the capability of UV in noise or other mismatch conditions by using the neighboring competing models information. Comparing with tradition likelihood ratio test (LRT) and online garbage model methods, experimental results show, the performance of proposed method is comparable to the LRT method in clean speech conditions, but explicitly outperforms other verification approaches in the noise speech conditions.
A Logical Formulation of Probabilistic Spatial Databases
Authors: Austin Parker, V. S. Subrahmanian, John Grant
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

There are numerous applications where there isuncertainty over space and time. Examples of such uncertaintyarise in vehicle tracking systems where we are not always surewhere a vehicle is now (or may be in the future), cell and satellitephone applications where we are not sure exactly where a phonemay be, and so on. In this paper, we propose the concept of aSpatial PrObabilistic Temporal (SPOT ) database which containsstatements of the form "Object O is in spatial region R at sometime t with some probability in the interval [L, U]." We definethe syntax and a declarative semantics for SPOT databasesbased on a mix of logic and linear programming, as well asquery algebra. We show alternative implementations of some ofthese query algebra operators when the SPOT database has adisjointness property. Though the declarative semantics of SPOTdatabases is rooted in linear programming, we have found veryefficient algorithms that do not use linear programming methods.We report on experiments we have conducted that show that thesystem scales to large numbers of SPOT atoms as well as tofairly fine temporal and spatial granularity.
Building a Privacy-Preserving Benchmarking Enterprise System
Authors: Florian Kerschbaum
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Benchmarking is the process of comparing one's own performance to the statistics of a group of competitors, named peer group. It is a common and important process in the business world for many important business metrics, called key performance indicators (KPI). Privacy is of the utmost importance, since these KPIs allow the inference of sensitive information. Therefore several secure multi- party computation (SMC) protocols for securely and pri- vately computing statistics of KPIs have recently been de- veloped. These protocols are the basic building block for a privacy-preserving benchmarking system, but in order to complete an enterprise system that offers a benchmarking service to its customers more problems need to be solved. This paper addresses two remaining problems: peer group formation and protocol orchestration. We first analyze how peer group participation impacts privacy and vice-versa. Given current network perfor- mance limitations we conclude that in order for KPIs to re- main private one subscriber can participate in at most one peer group. Peer group formation is the process of forming sensible peer groups out of the set of subscribers. A sensible peer group is one that is useful for benchmarking, i.e. a group of similar companies, under the constraint that one subscriber can participate in at most one peer group. We characterize subscribers by a set of discrete criteria and therefore view the automatic peer group formation as a data clustering problem. A data clustering algorithm customized for au- tomatic peer group formation is required to build clusters whose size does not fall below a minimum threshold. We present a high-performance modification of k-means clus- tering that takes the minimum cluster size as an additional parameter which might be of independent interest. In a sim- ulation we evaluate its practical applicability to automatic peer group formation. Our final approach is the first au- tomatic peer group formation algorithm for an enterprise benchmarking system. Polling-based protocol orchestration allows the sub- scribers to remain passive clients, i.e. require no inbound connection, e.g. through a company firewall. We show through simulation that such a polling-based orchestration can be expected to complete within one polling interval.
Top-k subgraph matching query in a large graph
Authors: Lei Zou, Lei Chen, Yansheng Lu
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

Recently, due to its wide applications, subgraph search has attracted a lot of attention from database and data mining community. Sub-graph search is defined as follows: given a query graph Q, we report all data graphs containing Q in the database. However, there is little work about sub-graph search in a single large graph, which has been used in many applications, such as biological network and social network. In this paper, we address top-k sub-graph matching query problem, which is defined as follows: given a query graph Q, we locate top-k matchings of Q in a large data graph G according to a score function. The score function is defined as the sum of the pairwise similarity between a vertex in Q and its matching vertex in G. Specifically, we first design a balanced tree (that is G-Tree) to index the large data graph. Then, based on G-Tree, we propose an efficient query algorithm (that is Ranked Matching algorithm). Our extensive experiment results show that, due to efficiency of pruning strategy, given a query with up to 20 vertices, we can locate the top-100 matchings in less than 10 seconds in a large data graph with 100K vertices. Furthermore, our approach outperforms the alternative method by orders of magnitude.
SMART And FAST: Test Generation for VLSI Scan-Design Circuits
Authors: M. Abramovici, J. J. Kulikowski, P. R. Menon, D. T. Miller
Venue: IEEE Design Test (1986)

This article describes new concepts and algorithms used to generate tests for VLSI scan-design circuits. The new algorithmsinclude: 1. a low-cost fault-independent algorithm (SMART), 2. a fault-oriented algorithm (FAST), and 3. an algorithm fordynamic test set compaction. The fault-oriented algorithm is guided by new controllability/observability cost functions whoseobjective is to minimize the amount of search done in test generation.
An Algorithm for Optimal NAND Cascade Logic Synthesis
Authors: C. A. Papachristou
Venue: IEEE Transactions on Computers (1978)

This paper is concerned with optimal synthesis of switching logic by a limited depth tree-like network, the NAND cascade. This cascade consists of a number of complete three-level, fan-in restricted NAND trees feeding a NAND collector. The goal of the proposed synthesis is to minimize the number of NAND trees of the cascade, which in turn will minimize its overall depth, i.e., the delay time of the cascade.
Code Compressor and Decompressor for Ultra Large Instruction Width Coarse-Grain Reconfigurable Systems
Authors: Nazish Aslam, Mark Milward, Ioannis Nousias, Tughrul Arslan, Ahmet Erdogan
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper presents a code compression and on-the-fly decompression scheme suitable for coarse-grain reconfigurable technologies. A novel unit-grouping dictionary based compression technique utilizing special control bits to increase the effective storage capacity of the dictionaries is implemented and compared against an existing suitable technique for an example reconfigurable system. Compressions ratios in the range of 40%-59% are recorded with new scheme.
A Novel Regressive Algorithm Based on Relevance Vector Machine
Authors: Er-rui Ding, Ping Zeng, Yong Yao
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

To improve the prediction accuracy and running efficiency, a novel sparse Bayesian learning algorithm for regression is proposed. Based on relevance vector machine, the algorithm firstly increases the prediction accuracy by adopting multiple kernels which are constructed from the angles of complete and over- complete bases. To lessen the training time caused by multiple kernels, the algorithm has two reduced steps involving a preliminary model and an eventual model. The improved locality preserving projections is used to reduce the column dimension of the input matrix, which forms the preliminary model. To further relieve the time pressure for a larger training sample set, the eventual model generates a pruned training sample set by pruning the old sample set with the preliminary model based on the cluster centers. Experimental results indicate the proposed algorithm is superior, in both prediction accuracy and robustness, to relevance vector machine while having less training time.
An XML interchange format for Wiki Creole 1.0
Authors: Martin Junghans, Dirk Riehle, Umit Yalcinalp
Venue: ACM SIGWEB Newsletter (2007)

Wikis have become an important application on the web and in the enterprise, yet there are no interoperability standards between different wiki engines. We present the first complete XML representation format of Wiki Creole 1.0. Wiki Creole is a community standard for wiki markup, the language used to write wiki pages. This report presents the complete XML representation format using a validating XML schema. In addition we present XSLT definitions for transforming the XML representations to XHTML on the one hand and for transforming the XML representations to Wiki Creole markup on the other hand. Our work shows how using XML technologies we can make wiki interchange, wiki upgrading, and wiki conversion independent from a specific wiki engine implementation.
A New Trajectory Search Algorithm Based on Spatio-temporal Similarity on Spatial Network
Authors: Jae-Woo Chang, Rabindra Bista, Ji-Hee Kim, Young-Chang Kim
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper, we define a new measure to compute spatio-temporal similarity between two trajectories of moving objects on road networks, which is known as spatio-temporal distance (STDist). In addition, we propose a new spatio-temporal similar trajectory search algorithm to retrieve similar trajectories based on the spatio-temporal distance, a combination of both spatial and temporal properties with respect to the motion of a given query trajectory. To support fast trajectories retrieval, we use a signature file method in which we generate signatures for segments of a trajectory. Our performance analysis shows that our algorithm outperforms the existing method in terms of searching similar trajectories of moving objects on road network.