ppxscal/embedding_network huggingface dataset:
What Works?
Authors: Jim Hearn
Venue: IEEE Security and Privacy (2003)

Perhaps Metcalfe is right: at least most of the time, at least in the US, technology does trump politics. This is because the nature of our socio-economic system has less of a government driven, top-down approach than do most other societies. The UK's pragmatic blend of social commitment and practical implementation is mid-way between the US and EU models. It will be interesting to see which of these three approaches to fostering an Internet-based society can best balance progress in implementing an IT culture with realizing citizens' security and privacy needs. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
The Enhanced Intra Prediction Algorithm for H.264
Authors: Hui Huang, Tie-Yong Cao, Xiong-Wei Zhang
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

When the current block is at the edge of the objects, the prediction accuracy of H.264 intra-frame coding will be decreased. An enhanced intra prediction method is proposed in this paper based on the directional of intra prediction and correlation among adjacent pixels in the current block. The proposed algorithm use the pixels calculated already as the reference pixels to predict the rest pixels in the current block, and then dynamically update the prediction mode order to achieve more most_probable_modes. Experimental results show that the proposed scheme is able to achieve a remarkable reduction of bit rate, meanwhile the peak signal-noise ratio (PSNR) is slightly increased compared with the original H.264 reference software.
Network exception handlers: host-network control in enterprise networks
Authors: Thomas Karagiannis, Richard Mortier, Antony Rowstron
Venue: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (2008)

Enterprise network architecture and management have followed the Internet's design principles despite different requirements and characteristics: enterprise hosts are administered by a single authority, which intrinsically assigns different values to traffic from different business applications. We advocate a new approach where hosts are no longer relegated to the network's periphery, but actively participate in network-related decisions. To enable host participation, network information, such as dynamic network topology and per-link characteristics and costs, is exposed to the hosts, and network administrators specify conditions on the propagated network information that trigger actions to be performed while a condition holds. The combination of a condition and its actions embodies the concept of the network exception handler, defined analogous to a program exception handler. Conceptually, network exception handlers execute on hosts with actions parameterized by network and host state. Network exception handlers allow hosts to participate in network management, traffic engineering and other operational decisions by explicitly controlling host traffic under predefined conditions. This flexibility improves overall performance by allowing efficient use of network resources. We outline several sample network exception handlers, present an architecture to support them, and evaluate them using data collected from our own enterprise network.
Using Cognitive Archetypes and Conceptual Graphs to Model Dynamic Phenomena in Spatial Environments
Authors: Hedi Haddad, Bernard Moulin
Venue: Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications (2007)

In this paper we propose a qualitative model to represent and reason about dynamic phenomena in a geographic space. Our model is based on linguistic cognitive archetypes, ontological definitions of geographic space and Conceptual Graphs (CGs). In a first part, we present the main concepts of the model and how we define them using CGs. In a second part, we present an overview of how this model is applied to the multiagent geosimulation domain in the context of the MAGS-COA project. Our model is original for two main reasons. First we use a linguistic approach to qualitatively model dynamic situations in a geographic environment. Second, we use CGs to represent the knowledge associated with such situations. Using CGs makes our model computationally feasible and useable to carry out spatial qualitative reasoning.
Policy Distribution Using the Publish/Subscribe Paradigm for Managing MANETs
Authors: Vasilis Sourlas, Paris Flegkas, Leandros Tassiulas
Venue: Proceedings of the 11th IFIP/IEEE international conference on Management of Multimedia and Mobile Networks and Services: Management of Converged Multimedia Networks and Services (2008)

Policy management has been an emerging management paradigm that has been extensively studied for the case of fixed networks and limited work has already been done for migrating it to mobile environments. Publish/subscribe has become an important architectural style for designing distributed systems and especially for mobile environments due to the loose coupling of the components involved. In this paper, we present a policy-based management system for Mobile Ad hoc Networks (MANETs) using the publish/subscribe paradigm for distributing policies to the managed nodes. Moreover, we enhance the publish/subscribe system with a novel request/response mechanism for tackling the problem of how newly joined nodes will retrieve previously introduced policies.
Design and Multi-Objective Optimization of Combinational Digital Circuits Using Evolutionary Algorithm with Multi-Layer Chromosomes
Authors: Adam Słowik, Michał Białko
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

In the paper an application of evolutionary algorithm with multi-layer chromosomes to the design and multi-objective optimization of combinational digital circuits is presented. The optimization criterions are minimizations of: number of gates, number of transistors in the circuit, and circuit propagation time. Four combinational circuits, chosen from literature, are designed, and optimized using proposed method. Results obtained using this method are compared with results obtained by other methods. The results obtained using this method are in many cases better than those obtained using other methods.
Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis
Authors: Anne Condon, Ján Maňuch, Chris Thachuk
Venue: Proceedings of the 14th annual international conference on Computing and Combinatorics (2008)

Artificial synthesis of long genes and entire genomes is achieved by self-assembly of DNA oligo fragments - fragments which are short enough to be generated using a DNA synthesizer. Given a description of the duplex to be synthesized, a computational challenge is to select the short oligos so that, once synthesized, they will self-assemble without error. In this paper, we show that a natural abstraction of this problem, the collision-aware string partition problem, is NP-complete.
Bias artifact suppression on MR volumes
Authors: E. Ardizzone, R. Pirrone, O. Gambino
Venue: Computer Methods and Programs in Biomedicine (2008)

RF-inhomogeneity correction is a relevant research topic in the field of magnetic resonance imaging (MRI). A volume corrupted by this artifact exhibits nonuniform illumination both inside a single slice and between adjacent ones. In this work a bias correction technique is presented, which suppresses this artifact on MR volumes scanned from different body parts without any a priori hypothesis on the artifact model. Theoretical foundations of the method are reported together with experimental results and a comparison is presented with both the 2D version of the algorithm and other techniques that are widely used in MRI literature.
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
Authors: James Luedtke, Shabbir Ahmed, George Nemhauser
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

Linear programs with joint probabilistic constraints (PCLP) are known to be highly intractable due to the non-convexity of the feasible region. We consider a special case of PCLP in which only the right-hand side is random and this random vector has a finite distribution. We present a mixed integer programming formulation and study the relaxation corresponding to a single row of the probabilistic constraint, yielding two strengthened formulations. As a byproduct of this analysis, we obtain new results for the previously studied mixing set, subject to an additional knapsack inequality. We present computational results that indicate that by using our strengthened formulations, large scale instances can be solved to optimality.
A Theory of Scope
Authors: Lars Marius Garshol
Venue: Scaling Topic Maps: Third International Conference on Topic Maps Research and Applications, TMRA 2007 Leipzig, Germany, October 11-12, 2007 Revised Selected Papers (2008)

This paper describes an interpretation of scope based on the past few years of research on the subject. Based on this it defines two mathematical operators for scope filtering which correspond to common use cases for scope.
Catch-up: a data aggregation scheme for vanets
Authors: Bo Yu, Jiayu Gong, Cheng-Zhong Xu
Venue: Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking (2008)

In-network data aggregation is a useful technique to reduce redundant data and improve communication efficiency. One challenge in data aggregation is how reports can be routed to the same node so that the reports can be merged. Most of existing approaches rely on maintaining a routing structure to achieve this purpose. However, these approaches are not applicable to the mobile environment of Vehicular Ad hoc Networks (VANETs). In this paper, we design a cooperative model to facilitate the aggregation of adjacent traffic reports. The basic idea behind this work is that we can adaptively change the forwarding delay of individual reports in a manner that a report can have a better chance to meet other reports. The decision is made distributedly by each vehicle based on local observations. Actually, our scheme is also a tradeoff between communication overhead and propagation delay. Simulation results based on realistic map data and traffic models demonstrate that our scheme can effectively reduce communication overhead with acceptable delay.
Facial Shape Spaces from Surface Normals
Authors: Simone Ceolin, William A. Smith, Edwin Hancock
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

In this paper, we draw on ideas from the field of statistical shape analysis to construct shape-spaces that span facial expressions and gender, and use the resulting shape-model to perform face recognition under varying expression and gender. Our novel contribution is to show how to construct shape-spaces over fields of surface normals rather than Cartesian landmark points. According to this model face needle-maps (or fields of surface normals) are points in a high-dimensional manifold referred to as a shape-space. We compute geodesic distances to compare the similarity between faces and gender difference.
Symbolic Model Checking of Logics with Actions
Authors: Charles Pecheur, Franco Raimondi
Venue: Model Checking and Artificial Intelligence: 4th Workshop, MoChArt IV, Riva del Garda, Italy, August 29, 2006, Revised Selected and Invited Papers (2007)

Reasoning about agents and modalities such as knowledge and belief leads to models where different relations over states co-exist, or equivalently, where information (labels, actions) is associated to state transitions. This paper discusses how to augment classical CTL symbolic model-checking to support logics with actions such as A-CTL (action-CTL), and how this can be implemented using BDDs in tools such as the SMV/NuSMV package. Considering general action-state structures, we first propose a natural extension of CTL to actions, called Action-Restricted CTL (ARCTL) and adapt classical results from CTL to express model checking based on three functions eax, eau and eag. On these grounds, we present two different implementations of symbolic model checking with actions. The first approach encodes action-state models and logics into pure state-based models and logics, that can be checked with existing model-checkers. The second approach consists in a native implementation of the three extended operators. We report on our prototype implementation of both approaches based on NuSMV and give an overview of how this is used to model-check the temporal epistemic logic CTLK.
When Is Reachability Intrinsically Decidable?
Authors: Barbara F. Csima, Bakhadyr Khoussainov
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

A graph $\mathcal{H}$ is computable if there is a graph $\mathcal{G}=(V,E)$ isomorphic to $\mathcal{H}$ where the set V of vertices and the edge relation E are both computable. In this case $\mathcal{G}$ is called a computable copy of $\mathcal{H}$. The reachability problem for $\mathcal{H}$ in $\mathcal{G}$ is, given u,w ¿ V, to decide whether there is a path from u to w. If the reachability problem for $\mathcal{H}$ is decidable in all computable copies of $\mathcal{H}$ then the problem is intrinsically decidable. This paper provides syntactic-logical characterizations of certain classes of graphs with intrinsically decidable reachability relations.
Concept Level Web Search Via Semantic Clustering
Authors: Nian Yan, Deepak Khazanchi
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Internet search engine techniques have evolved from simple web searching using categorization (e.g., Yahoo) to advanced page ranking algorithms (e.g., Google). However, the challenge for the next generation of search algorithms is not the quantity of search results, but identifying the most relevant pages based on a semantic understanding of user requirements. This notion of relevance is closely tied to the semantics associated with the term being searched. The ideal situation would be to represent results in an intuitive way that allows the user to view their search results in terms of concepts related to their search word or phrase rather than a list of ranked web pages. In this paper, we propose a semantic clustering approach that can be used to build a conceptual search engine.
Instruction Scheduling Across Control Flow
Authors: Martin Charles Golumbic, Vladimir Rainish
Venue: Scientific Programming (1993)

Instruction scheduling algorithms are used in compilers to reduce run-time delays for the compiled code by the reordering or transformation of program statements, usually at the intermediate language or assembly code level. Considerable research has been carried out on scheduling code within the scope of basic blocks, i.e., straight line sections of code, and very effective basic block schedulers are now included in most modern compilers and especially for pipeline processors. In previous work Golumbic and Rainis: IBM J. Res. Dev., Vol. 34, pp.93-97, 1990, we presented code replication techniques for scheduling beyond the scope of basic blocks that provide reasonable improvements of running time of the compiled code, but which still leaves room for further improvement. In this article we present a new method for scheduling beyond basic blocks called SHACOOF. This new technique takes advantage of a conventional, high quality basic block scheduler by first suppressing selected subsequences of instructions and then scheduling the modified sequence of instructions using the basic block scheduler. A candidate subsequence for suppression can be found by identifying a region of a program control flow graph, called an S-region, which has a unique entry and a unique exit and meets predetermined criteria. This enables scheduling of a sequence of instructions beyond basic block boundaries, with only minimal changes to an existing compiler, by identifying beneficial opportunities to cover delays that would otherwise have been beyond its scope.
Advances in clustering and visualization of time series using GTM through time
Authors: Iván Olier, Alfredo Vellido
Venue: Neural Networks (2008)

Most of the existing research on multivariate time series concerns supervised forecasting problems. In comparison, little research has been devoted to their exploration through unsupervised clustering and visualization. In this paper, the capabilities of Generative Topographic Mapping Through Time, a model with foundations in probability theory, that performs simultaneous time series clustering and visualization, are assessed in detail. Focus is placed on the visualization of the evolution of signal regimes and the exploration of sudden transitions, for which a novel identification index is defined. The interpretability of time series clustering results may become extremely difficult, even in exploratory visualization, for high dimensional datasets. Here, we define and test an unsupervised time series relevance determination method, fully integrated in the Generative Topographic Mapping Through Time model, that can be used as a basis for time series selection. This method should ease the interpretation of time series clustering results.
Fixed Point Computation and Equilibrium
Authors: Xiaotie Deng
Venue: Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics (2008)

The rise of the Internet has created a surge of human activities that make computation, communication and optimization of participating agents accessible at micro-economic levels. Fundamental equilibrium problems of games and markets, including algorithms and complexity as well as applications have become active topics for complexity studies. Algorithmic Game Theory has emerged as one of the highly interdisciplinary fields, in response to (and sometimes anticipating) the need of this great revolution, intersecting Economics, Mathematics, Operations Research, Numerical Analysis, and Computer Science.The mathematical model underlying various forms of equilibrium is the fixed point concept. The discovery, and applications, of the close relationship between the fixed point and equilibrium concepts has played a major role in shaping Mathematical Economics. In computation, it continues to influence our understanding of complexity and algorithmic design for equilibrium problems. In this talk, I will discuss some recent development in fixed point computation, together with application problems, such as sponsored search auctions and envy-free cake cuttings.
Virtual Spaces: From the Past to the Future
Authors: Shi Kuo Chang
Venue: Proceedings of the 10th international conference on Visual Information Systems: Web-Based Visual Information Search and Management (2008)

Space can be seen in many different ways. When an architect and a computer scientist look at Space they see very different things and yet sometimes they make surprisingly similar discoveries. As a computer scientist with strong research interests in visual languages I learned many things from the theory and practice of architecture. This talk on virtual spaces begins by discussing the origins of architectural pleasure and how the space of a dwelling can be divided into refuge and prospect according to Grant Hildebrand. This decomposition of space leads us naturally to consider spatial relations and patterns. On the pragmatic side we illustrate patterns by the works of Frank Lloyd Wright. On the theoretical side we consider Christopher Alexander's theory of patterns and its relationship to the theory of visual languages. After a discussion of William Mitchell's e-topia as an example of the V-topia, the virtual cities of the past, the present and the future are surveyed. An important ingredient of the virtual city is the interactive map. We can make an interactive map even more powerful by introducing the concept of the sentient map.
On Improving Quality of the Decision Making Process in a Federated Learning System
Authors: Sylvia Encheva, Sharil Tumin
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

A lot of work has been done for the development and distribution of reusable learning objects. Once available these objects need to be considered with respect to quality and degrees to which they can contribute to the improvement of students' learning. In this paper we propose application of many-valued logic for facilitating decision making process in a federated learning system employing reusable learning objects.
Fractional Supervised Orthogonal Local Linear Projection
Authors: Ruicong Zhi, Qiuqi Ruan
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 2 - Volume 02 (2008)

In this paper, a subspace analysis method called the orthogonal local linear projection (OLLP) is proposed. OLLP is an unsupervised linear dimensionality reduction method with orthogonal basis functions. OLLP aims to find the projective map that optimally preserves the local structure of the data set. It shares many of the data representation properties of nonlinear techniques and resolves the out-of-sample problem. Furthermore, a fractional supervised variation on OLLP is also proposed by utilizing the class label information. Experimental results show that the proposed methods are effective for linear dimensionality reduction and achieve high recognition accuracy in facial expression recognition.
Minimum Cost Homomorphism Dichotomy for Oriented Cycles
Authors: Gregory Gutin, Arash Rafiey, Anders Yeo
Venue: Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management (2008)

For digraphs D and H, a mapping f: V(D) ¿V(H) is a homomorphism of D to H if uv ¿ A(D) implies f(u)f(v) ¿ A(H). If, moreover, each vertex u ¿ V(D) is associated with costs c i (u), i ¿ V(H), then the cost of the homomorphism f is ¿ u ¿ V(D) c f(u)(u). For each fixed digraph H, we have the minimum cost homomorphism problem for H (abbreviated MinHOM(H)). In this discrete optimization problem, we are to decide, for an input graph D with costs c i (u), u ¿ V(D), i ¿ V(H), whether there exists a homomorphism of D to H and, if one exists, to find one of minimum cost. We obtain a dichotomy classification for the time complexity of MinHOM(H) when H is an oriented cycle. We conjecture a dichotomy classification for all digraphs with possible loops.