ppxscal/embedding_network huggingface dataset:
Easishop: Ambient intelligence assists everyday shopping
Authors: S. Keegan, G. M. P. O'Hare, M. J. O'Grady
Venue: Information Sciences: an International Journal (2008)

E-commerce has been one of the success stories of the last decade. Developments in wireless communications and mobile computing have heralded an era of mobile commerce (m-commerce). Though a number of successful applications and services have been deployed, these are almost invariably inherently static in nature. By augmenting m-commerce with intelligent and autonomous components, the significant benefits of convenience and added value may be realized for the average shopper as they wander their local shopping mall or high street. By a selective and judicious juxtaposition of Ambient Intelligent (AmI) concepts and e-commerce precepts, the foundations for truly ubiquitous commerce (u-commerce) may be constructed. In this paper, the synergy between AmI and e-commerce is explored and developed, resulting in the description of a prototypical application that demonstrates the viability of this approach.
Towards automated provisioning of secure virtualized networks
Authors: Serdar Cabuk, Chris I. Dalton, HariGovind Ramasamy, Matthias Schunter
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We describe a secure network virtualization framework that helps realize the abstraction of Trusted Virtual Domains (TVDs), a security-enhanced variant of virtualized network zones. The framework allows groups of related virtual machines running on separate physical machines to be connected together as though there were on their own separate network fabric and, at the same time, helps enforce cross-group security requirements such as isolation, confidentiality, security, and information flow control. The framework uses existing network virtualization technologies, such as Ethernet encapsulation, VLAN tagging, and VPNs, and combines and orchestrates them appropriately to implement TVDs. Our framework aims at automating the instantiation and deployment of the appropriate security mechanism and network virtualization technologies based on an input security model that specifies the required level of isolation and permitted network flows. We have implemented a prototype of the framework based on the Xen hypervisor. Experimental evaluation of the prototype shows that the performance of our virtual networking extensions is comparable to that of the standard Xen configuration.
Simply Invertible Matrices
Authors: P. V. Sankar
Venue: IEEE Transactions on Computers (1972)

Properties and construction of a class of test matrices, called " simply invertible matrices," are given.
Buffer Size Reduction through Control-Flow Decomposition
Authors: Youngchul Cho, Nacer-Eddine Zergainoh, Ahmed A. Jerraya, Kiyoung Choi
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Software synthesis from a data-flow model has been a very promising technique, especially for multimedia applications with contradicting requirements of high design complexity and fast time-to-market. In a dataflow model, buffer size is pessimistically determined through static analysis, thus results in large memory overhead even with optimization techniques such as buffer sharing and scheduling. So, reducing buffer size is one of the key issues of data-flow models. In this work, we propose a novel software synthesis technique to reduce buffer size through control-flow decomposition. We first traverse the control-flow within each actor of a data-flow graph and decompose it into a set of multiple execution paths. Then we transform the actor such that only one of the paths is executed at one invocation of the actor. The new actor may have to be invoked many times to complete the behavior of the original actor. By proper decomposition, we can make the new actor consume/produce much smaller amount of input/output data for each invocation, thereby reducing the input/output buffer size drastically. We automate the process of transformation and show the efficiency of the proposed approach through experiments with image/video multimedia applications.
Clustering Ensemble based on the Fuzzy KNN Algorithm
Authors: Fangfei Weng, Qingshan Jiang, Lifei Chen, Zhiling Hong
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Compared with the single clustering algorithm, Clustering Ensembles are deemed to be more robust and accurate, with combining multiple partitions of the given data into a single clustering solution of better quality. In this paper, we proposed a new Clustering Ensemble algorithm based on Fuzzy K Nearest Neighbor (FKNNCE) to generate the similarity matrix of data to summarize the ensemble and then use hierarchical clustering algorithm to get the final partition, without specified number of clusters in advance. After discussing some related topics, the paper adopts real data and conducts an Intrusion Detection Model to evaluate the performance of the Clustering Ensemble algorithm, furthermore compare it with other algorithms. Experimental results demonstrate the effectiveness of the proposed algorithm.
A Graph-Based Algorithm for Mining Maximal Frequent Itemsets
Authors: Bo Liu, Jiuhui Pan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Association rule mining is an important research branch of data mining, and computing frequent itemsets is the main problem. The paper is designed to find maximal frequent itemsets only. It presents an algorithm based on a frequent pattern graph, which can find maximal frequent itemsets quickly. A breadth-first-search and a depth-first-search techniques are used to produce all maximal frequent itemsets of a database. The paper also analyzes the complexity of the algorithm, and explains the computation procedure by examples. It has high time efficiency and less space complexity for computing maximal frequent itemsets.
Circular chromatic index of Cartesian products of graphs
Authors: Douglas B. West, Xuding Zhu
Venue: Journal of Graph Theory (2008)

The circular chromatic index of a graph G, written X'c, is the minimum r permitting a function f : E(G)➝ [0,r) such that 1 &le; |f(e) - f(e')| &le; r - 1 whenever e and e' are incident. Let G = H □ C2m +1, where □ denotes Cartesian product and H is an (s-2)-regular graph of odd order, with s &equiv; 0mod4 (thus, G is s-regular). We prove that X'c&ge;s + [&lambda;(1-1/s]-1, where &lambda; is the minimum, over all bases of the cycle space of H, of the maximum length of a cycle in the basis. When H = C2k +1 and m is large, the lower bound is sharp. In particular, if m &ge; 3k + 1, then X'c(C2k +1 □ C2m+1)= 4 + [3k/2]-1, independent of m. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 57: 718, 2008
Accurate Application-Specific Sandboxing for Win32/Intel Binaries
Authors: Wei Li, Lap-chung Lam, Tzi-cker Chiueh
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Comparing the system call sequence of a network application against a sandboxing policy is a popular approach to detecting control-hijacking attack, in which the attacker exploits such software vulnerabilities as buffer overflow to take over the control of a victim application and possibly the underlying machine. The long-standing technical barrier to the acceptance of this system call monitoring approach is how to derive accurate sandboxing policies for Windows applications whose source code is unavailable. In fact, many commercial computer security companies take advantage of this fact and fashion a business model in which their users have to pay a subscription fee to receive periodic updates on the application sandboxing policies, much like anti-virus signatures. This paper describes the design, implementation and evaluation of a sandboxing system called BASS that can automatically extract a highly accurate application-specific sandboxing policy from a Win32/X86 binary, and enforce the extracted policy at run time with low performance overhead. BASS is built on a binary interpretation and analysis infrastructure called BIRD, which can handle application binaries with dynamically linked libraries, exception handlers and multi-threading, and has been shown to work correctly for a large number of commercially distributed Windowsbased network applications, including IIS and Apache. The throughput and latency penalty of BASS for all the applications we have tested except one is under 8%.
On The Shortest Path Problem: a New Approach with Fuzzy Inference Systems and Conventional Geographic Information Systems
Authors: Gabriel da Silva
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This paper addresses the use of fuzzy logic to synthesize multiple numerical attributes on urban street networks, allowing conventional Geographic Information Systems GIS to deal with the concept of a fuzzy "best path" instead of the classical "shortest path". A new methodology to use fuzzy inference in GIS, implementing fuzzy path planning inside an urban network model is proposed. A computational tool was developed to perform data acquisition, fuzzy inference and GIS database updating in real-time. Practical results of fuzzy path planning are presented and discussed.
Design of Robust Observer for the Switched Discrete-Time Linear System with Time Delays
Authors: Dejun Tang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, an observer applying for switched linear system with delays in state variables is proposed for the control of the system. The reduction of the conservatism is resolved by using of the switched Lyapunov function approach. Some results are also extended to the uncertain system. Several linear matrix inequalities (LMIs) are established to guarantee the asymptotical stability in the system. Numerical examples are described to show the effectiveness of the proposed methods.
Tracking Web spam with HTML style similarities
Authors: Tanguy Urvoy, Emmanuel Chauveau, Pascal Filoche, Thomas Lavergne
Venue: ACM Transactions on the Web (TWEB) (2008)

Automatically generated content is ubiquitous in the web: dynamic sites built using the three-tier paradigm are good examples (e.g., commercial sites, blogs and other sites edited using web authoring software), as well as less legitimate spamdexing attempts (e.g., link farms, faked directories). Those pages built using the same generating method (template or script) share a common &ldquo;look and feel&rdquo; that is not easily detected by common text classification methods, but is more related to stylometry. In this work we study and compare several HTML style similarity measures based on both textual and extra-textual features in HTML source code. We also propose a flexible algorithm to cluster a large collection of documents according to these measures. Since the proposed algorithm is based on locality sensitive hashing (LSH), we first review this technique. We then describe how to use the HTML style similarity clusters to pinpoint dubious pages and enhance the quality of spam classifiers. We present an evaluation of our algorithm on the WEBSPAM-UK2006 dataset.
Extended abstract: evaluation of delay queues for a Ravenscar HW kernel
Authors: G. Naeser, J. Furunas
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

This extended abstract presents work in progress on the evaluation of four delay queues designed for application tailored Ravenscar hardware real-time kernels. The properties of the different queues and optimizations of them are discussed, both for the formal models and for the actual hardware implementations of the queues. Our study of the queues shows that even though parallelism costs much in terms of chip area, there are system configurations where it is the most space conservative.
Delay&#x002F;disruption tolerant mobile ad hoc networks: latest developments: Research Articles
Authors: Zhensheng Zhang, Qian Zhang
Venue: Wireless Communications Mobile Computing (2007)

There is much research activity in the emerging area of delay&#x002F;disruption tolerant networks (DTN) in the past few years. DTNs pose many new challenges, and protocols designed for wired Internet or wireless mobile ad hoc networks do not work properly in DTNs. Routing is one of the key components in DTNs and the message ferry (MF) approach has been drawn a lot of attention to support routing in DTNs. Besides the underlying routing protocols, issues in transport layer are also very important and need to be addressed for DTNs. Recently, many new routing protocols, including unicast using the MF approach, inter-region routing and multicast, have appeared in the literature. There are also a few works addressing issues in the transport layer. This paper provides an overview on recent developments including message ferrying, multicast support, inter-region routing, and transport layer issues. It also points out some open research issues and intends to motivate new research and development in this area. Copyright &copy; 2007 John Wiley & Sons, Ltd.
The Magic VLSI Layout System
Authors: John Ousterhout, Gordon Hamachi, Robert Mayo, Walter Scott, George Taylor
Venue: IEEE Design Test (1985)

Magic is a new IC layout system that includes several facilities traditionally contained in separate batch-processing programs.Magic incorporates expertise about design rules, connectivity, and routing directly into the layout editor and uses this informationto provide several unusual features. They include a continuous design-rule checker that operates in background and maintainsan up-to-date picture of violations; a hierarchical circuit extractor that only re-extracts portions of the circuit that havechanged; an operation called plowing that permits interactive stretching and compaction; and a suite of routing tools thatcan work under and around existing connections in the channels. A design style called logs and a data structure called cornerstitching are used to achieve an efficient implementation of the system.
Semantic Web Services Discovery in P2P Environment
Authors: Bin Xu, Dewei Chen
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Web services are new paradigm of using the Web. One of emerging challenges is to discover Web services efficiently and precisely. Unfortunately, existing systems like UDDI often have the problems of low availability, low accuracy, and bad performance. In this paper, we propose an approach of semantic Web services discovery in P2P environment. Firstly, Web services are published and deployed in same Web server to guarantee the availability. Secondly, Web servers are organized into groups to form a structured P2P network. Thirdly, for improving the query performance of service discovering, we propose a 2- layers searching algorithm. Finally we developed a prototype system, and tested the system in real P2P test bed of Planet-lab. Experimental results show our approach's precision, recall, query time and scalability. By analysis of the performance, we observed that the system has good efficiency and scalability.
Optimization Algorithms for Distributed Queries
Authors: P. M. G. Apers
Venue: IEEE Transactions on Software Engineering (1983)

The efficiency of processing strategies for queries in a distributed database is critical for system performance. Methods are studied to minimize the response time and the total time for distributed queries. A new algorithm (Algorithm GENERAL) is presented to derive processing strategies for arbitrarily complex queries. Three versions of the algorithm are given: one for minimizing response time and two for minimizing total time. The algorithm is shown to provide optimal solutions under certain conditions.
Signature-based Symbolic Algorithm for Optimal Markov Chain Lumping
Authors: Salem Derisavi
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Many approaches to tackle the state-space explosion problem ofMarkov chains are based on the notion of lumpa- bility (a.k.a. probabilistic bisimulation), which allows com- putation of measures using the quotient Markov chain, which, in some cases, has much smaller state space than the original one. We present a new signature-based algorithm for computing the optimal (i.e., smallest possible) quotient Markov chain, prove its correctness, and implement it sym- bolically for Markov chains represented as Multi-Terminal BDDs (MTBDDs). The algorithm is very time-efficient be- cause we translate the core operation of the algorithm, i.e., the computation of the signatures, into symbolic operations. Our experiments on various configurations of three example models with different levels of lumpability show that the al- gorithm (1) handles significantly larger state spaces than an explicit algorithm, (2) outperforms a very efficient explicit algorithm for significantly lumpableMarkov chains while it is not prohibitively slower in the worst case, and (3) out- performs our previous optimal symbolic algorithm [10] in terms of running time although it has higher space require- ment for most of the configurations.
A Dynamic Forwarding Point (DFP) Control Scheme for Fast Handoff
Authors: Chung-Ming Huang, Tz-Heng Hsu, Meng-Shu Chiang
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

The fast handoff scheme tries to reduce handoff delay when a mobile node (MN) roams between different networks. In the fast handoff scheme, a tunnel is established between the original and new networks during handoff. The tunnel-based approach has several problems, such as triangle transmission, long packet delivery time, and ping-pong effects. In this paper, we propose a dynamic forwarding point control scheme (DFP) to resolve the aforementioned problems. In the DFP scheme, a forwarding point is selected to dispatch packets to the MN. During handoff, packets sent from corresponding node (CN) to MN will be intercepted by the FP and then be forwarded to reduce packet delivery time during handoff.
Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence
Authors: John Oliensis, Richard Hartley
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We give the first complete theoretical convergence analysis for the iterative extensions of the Sturm/Triggs algorithm. We show that the simplest extension, SIESTA, converges to nonsense results. Another proposed extension has similar problems, and experiments with “balanced” iterations show that they can fail to converge or become unstable. We present CIESTA, an algorithm which avoids these problems. It is identical to SIESTA except for one simple extra computation. Under weak assumptions, we prove that CIESTA iteratively decreases an error and approaches fixed points. With one more assumption, we prove it converges uniquely. Our results imply that CIESTA gives a reliable way of initializing other algorithms such as bundle adjustment. A descent method such as Gauss–Newton can be used to minimize the CIESTA error, combining quadratic convergence with the advantage of minimizing in the projective depths. Experiments show that CIESTA performs better than other iterations.
Fault Detection of Binary Sequential Machines Using R-Valued Test Machines
Authors: D. A. Sheppard
Venue: IEEE Transactions on Computers (1974)

An improved method for detection of faults in completely specified synchronous sequential machines is described. The technique is algorithmic, based on the concept of embedding the given binary machine into an easily testable R-valued machine. Heuristic optimization of additional permutation inputs is shown to lead to considerable reduction in the length of the fault sequence. A bound on the sequence length is derived, which in most cases is significantly lower than those of comparable methods.
Power-efficient topology control for static wireless networks with switched beam directional antennas
Authors: Vinod Namboodiri, Lixin Gao, Ramakrishna Janaswamy
Venue: Ad Hoc Networks (2008)

Topology control problems are associated with assignment of power levels to nodes of a wireless network so that the resulting graph topology satisfies certain properties. In this paper we consider the problem of power-efficient topology control with switched beam directional antennas taking into account their non-uniform radiation pattern within the beamwidth. Previous work in the area have all assumed a uniform gain model with these antennas which renders antenna orientation insignificant as a parameter in topology control algorithms. We present algorithms that take into account a model of non-uniform gain with the objectives of minimizing the total power and maximum power to keep the network connected. We consider two cases: one where the antenna orientation is assumed given and another where the antenna orientation needs to be derived as well. For the first case, we present optimal and approximation algorithms for constructing power-efficient topologies. For the second case, we prove the problem to be NP-complete and present heuristic solutions along with approximation bounds. Through comparison of the two cases by simulation, significant reductions are shown in the maximum as well as total power required to keep the network connected for the second case, thus demonstrating the benefits of using antenna orientation as parameter in topology construction.
A Hybrid Approach to License Plate Segmentation under Complex Conditions
Authors: Xianchao Zhang, Xinyue Liu, He Jiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A hybrid license plate segmentation approach based on neural network is proposed, which is designed to work under complex acquisition conditions including unrestricted scene and lighting and a wide range of camera-car distances. The approach consists of four stages: preprocessing, candidate regions detecting, real vehicle license plate extracting, and character segmenting. Experiments have proved the robustness and accuracy of the approach. In the experiments databases, which were taken from real scenes, 380 from 400 images were successfully segmented. The average accuracy of segmenting vehicle license plate is 95%.
An Energy Efficient Routing Scheme for Wireless Sensor Networks
Authors: Ki Young Jang, Kyung Tae Kim, Hee Yong Youn
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Since sensor nodes have limited energy, energy efficient routing is very important for wireless sensor network (WSN). In this paper we propose a routing scheme which significantly enhances the performance of existing schemes such as LEACH and LEACH-C. The proposed scheme selects the cluster head not randomly but considering the remaining energy when the energy level drops below 50% of the initial energy. For each node, the cluster head to join is determined by not only the signal power but also the remaining energy of the cluster head. Also, data transmission occurs when the context satisfies the preset condition. NS-2 simulation shows that the proposed scheme outperforms LEACH and LEACH-C by 37% and 30%, respectively, in terms of the lifetime of the sensor network.1