ppxscal/embedding_network huggingface dataset:
Toward editable web browser: edit-and-propagate operation for web browsing
Authors: Satoshi Nakamura, Takehiro Yamamoto, Katsumi Tanaka
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

This paper proposes a novel technique of browsing Web pages called "Edit-and-Propagate" operation based browsing, where edit operation is regarded as the third operation for interacting with the WWW after conventional clicking and scrolling towards realizing the Editable Web Browser. Our method enables users to delete/emphasize any portion of a browsed Web page at any time and modifies the page by propagating the edit operation. For example, the user can easily delete almost any uninteresting portion of a Web page merely by deleting an example of an unwanted portion. While browsing a Web search result page, the user can rerank search results by deleting an unwanted term or by emphasizing an important term. In this paper, we describe the concept of "Edit-and-Propagate" based browsing, and the implementation of our prototypes. Then we describe the results of our evaluation, which demonstrate the usefulness of our system.
Robust Iris Localization and Tracking based on Constrained Visual Fitting
Authors: Carlo Colombo, Dario Comanducci, Alberto Del Bimbo
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

A robust iris localization and tracking algorithm based on computer vision is presented. The iris localization algorithm acts as a bootstrap for the tracking algorithm, providing it with a set of multiple hypotheses to restart from in the case of a tracking failure. Tracking is performed with a RANSAC-like robust method for ellipse fitting that incorporates search constraints so as to increase the overall accuracy with respect to the standard RANSAC approach. Experimental results show that the algorithm is fast, accurate and robust enough for applications in the field of human-machine interaction, being particularly suitable for users with severe motor disabilities.
An Efficient Sensor Observation Data Registration based on Asynchronous Service Middleware
Authors: Nengcheng Chen, Zhong Zheng, Zeqiang Chen
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Recent advances in sensor web geospatial data capture, such as high resolution satellite images as well as corresponding web ready data processing and modeling technologies, have led to the generation of large amounts of datasets on real-time or near realtime observation and measurement. The quality of observation data register has become a "bottleneck' of sensor web-based applications. In order to improve the quality of sensor data register, Sensor Observation Service (SOS) register middleware is put forward, which includes geospatial sensor observation service (SOS), geospatial catalogue service based on ebRIM, SOS register mediator service, sensor data granule information extraction service, and sensor data granule record generation service. The content and sequence of SOS observation "synchronous' and "asynchronous' data register strategy based on service middleware is described. The prototype system is designed and implemented by OGC CSW specification and SWE SOS standard. The EO-1 SOS register is tested, including 2420 WCSLayer observation records in a specified time, and the performance is evaluated. The experimental result shows the efficiency of the "asynchronous' strategy proposed in this paper is 0.3- 0.4 times fast than that of the "synchronous'.
Physical, Social, and Experiential Knowledge in Pervasive Computing Environments
Authors: Gillian R. Hayes, Erika Shehan Poole, Giovanni Iachello, Shwetak N. Patel, Andrea Grimes, Gregory D. Abowd, Khai N. Truong
Venue: IEEE Pervasive Computing (2007)

BufferWare is a selective archiving application for recording everyday experiences in an informal space. An evaluation of the system's deployment, combined with analysis of existing research on recording technologies and security and privacy, demonstrates that people use three types of knowledge to determine new technologies' relative utility and safety. Physical knowledge includes design elements that inform people about the technology and how to use it. Social knowledge includes a community's embedded knowledge. Experiential knowledge includes users' past interactions with similar technologies and new technologies. This article is part of a special issue on security and privacy.
Clustering spatial networks for aggregate query processing: A hypergraph approach
Authors: Engin Demir, Cevdet Aykanat, B. Barla Cambazoglu
Venue: Information Systems (2008)

In spatial networks, clustering adjacent data to disk pages is highly likely to reduce the number of disk page accesses made by the aggregate network operations during query processing. For this purpose, different techniques based on the clustering graph model are proposed in the literature. In this work, we show that the state-of-the-art clustering graph model is not able to correctly capture the disk access costs of aggregate network operations. Moreover, we propose a novel clustering hypergraph model that correctly captures the disk access costs of these operations. The proposed model aims to minimize the total number of disk page accesses in aggregate network operations. Based on this model, we further propose two adaptive recursive bipartitioning schemes to reduce the number of allocated disk pages while trying to minimize the number of disk page accesses. We evaluate our clustering hypergraph model and recursive bipartitioning schemes on a wide range of road network datasets. The results of the conducted experiments show that the proposed model is quite effective in reducing the number of disk accesses incurred by the network operations.
SensorFlock: an airborne wireless sensor network of micro-air vehicles
Authors: Jude Allred, Ahmad Bilal Hasan, Saroch Panichsakul, William Pisano, Peter Gray, Jyh Huang, Richard Han, Dale Lawrence, Kamran Mohseni
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

An airborne wireless sensor network (WSN) composed of bird-sized micro aerial vehicles (MAVs) enables low cost high granularity atmospheric sensing of toxic plume behavior and storm dynamics, and provides a unique three-dimensional vantage for monitoring wildlife and ecological systems. This paper describes a complete implementation of our SensorFlock airborne WSN, spanning the development of our MAV airplane, its avionics, semi-autonomous flight control software, launch system, flock control algorithm, and wireless communication networking between MAVs. We present experimental results from flight tests of flocks of MAVs, and a characterization of wireless RF behavior in air-to-air communication as well as air-to-ground communication.
NDA-MM: A New Adaptive Task Scheduling Algorithm Based on the Non-dedicated Constraint Grid
Authors: Yong Hou, Jiong Yu, Turgun
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Task scheduling is a critical design issue for the service grid system. Decreasing the makespan of service and balancing the workload of the service resources are very important problems to be solved. Considering of the autonomous, heterogeneous, and distributed feature of the service grid system, we propose a novel task scheduling algorithm, called the adaptive Min-Min and Max-Min based on the non-dedicated constraint grid (NDA-MM) algorithm for the service grid. The proposed algorithm is provided with the dedicated property for the service resources and the paid property for the tasks, which is merged the high efficiency of the traditional Min-Min scheduling algorithm and the load balance of the traditional Max-Min scheduling algorithm. The experiments show that the algorithm overweighs traditional algorithms a lot in the makespan and the scalability of the scheduling algorithm.
Interval Arithmetic and Computational Science: Rounding and Truncation Errors in N-Body Methods
Authors: Alistair P. Rendell, Bill Clarke, Pete Janes, Josh Milthorpe, Rui Yang
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

Interval arithmetic is an alternative computational paradigm that enables arithmetic operations to be performed with guarantee error bounds. In this paper interval arithmetic is used to compare the accuracy of various methods for computing the electrostatic energy for a system of point charges. A number of summation approaches that scale as O(N2) are considered, as is an O(N) scaling Fast Multipole Method (FMM). Results are presented for various sizes of water cluster in which each water molecule is described using the popular TIP3P water model. For FMM a subtle balance between the dominance of either rounding or truncation errors is demonstrated
The Proposed IEEE 896 Futurebus?A Solution to the Bus Driving Problem
Authors: R. Balakrishnan
Venue: IEEE Micro (1984)

The Futurebus solves, for the first time, the fundamental problems associated with driving a densely populated backplane?as a result, it provides significant improvements in both speed and data integrity. 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
Forking genetic algorithms: Gas with search space division schemes
Authors: Shigeyoshi Tsutsui, Yoshiji Fujimoto, Ashish Ghosh
Venue: Evolutionary Computation (1997)

In this article, we propose a new type of genetic algorithm (GA), the forking GA (fGA), which divides the whole search space into subspaces, depending on the convergence status of the population and the solutions obtained so far. The fGA is intended to deal with multimodal problems that are difficult to solve using conventional GAs. We use a multi-population scheme that includes one parent population that explores one subspace and one or more child populations exploiting the other subspace. We consider two types of fGAs, depending on the method used to divide the search space. One is the genoqtypic fGA (g-fGA), which defines the search subspace for each subpopulation, depending on the salient schema within the genotypic search space. The other is the phenotypic fGA (p-fGA), which defines a search subspace by a neighborhood hypercube around the current best individual in the phenotypic feature space. Empirical results on complex function optimization problems show that both the g-fGA and the p-GA perform well compared to conventional GAs. Two additional utilities of the p-fGA are also studied briefly.
Yet another MicroArchitectural Attack:: exploiting I-Cache
Authors: Onur Aciiçmez
Venue: Proceedings of the 2007 ACM workshop on Computer security architecture (2007)

MicroArchitectural Attacks (MA), which can be considered as a special form of Side-Channel Analysis, exploit microarchitectural functionalities of processor implementations and can compromise the security of computational environments even in the presence of sophisticated protection mechanisms like virtualization and sandboxing. This newly evolving research area has attracted significant interest due to the broad application range and the potentials of these attacks. Cache Analysis and Branch Prediction Analysis were the only types of MA that had been known publicly. In this paper, we introduce Instruction Cache (I-Cache) as yet another source of MA and present our experimental results which clearly prove the practicality and danger of I-Cache Attacks.
Code growth, explicitly defined introns, and alternative selection schemes
Authors: Peter W. H. Smith, Kim Harries
Venue: Evolutionary Computation (1998)

Previous work on introns and code growth in genetic programming is expanded on and tested experimentally. Explicitly defined introns are introduced to tree-based representations as an aid to measuring and evaluating intron behavior. Although it is shown that introns do create code growth, they are not its only cause. Removing introns merely decreases the growth rate; it does not eliminate it. By systematically negating various forms of intron behavior, a deeper understanding of the causes of code growth is obtained, leading to the development of a system that keeps unnecessary bloat to a minimum. Alternative selection schemes and recombination operators are examined and improvements demonstrated over the standard selection methods in terms of both performance and parsimony.
FSM-based model for spatio-temporal event recognition for HCS
Authors: Wamiq Manzoor Ahmed, Jia Liu, Dominik Lenz, Arif Ghafoor, J. Paul Robinson
Venue: Proceedings of the International Conference on Semantic Computing (2007)

Extraction of quantitative information about spatio-temporal events happening in cells is the key to understanding biological processes. In this paper we present a finite state machine (FSM)-based model for specification and identification of spatio-temporal events at the single-cell level. Cells are modeled as objects with specific attributes such as color, size, shape, etc., and events are modeled in terms of the specific values of attributes of participating objects along with the spatial relationships between these objects. Results for a time-lapse apoptosis screen are presented where the extra information provided by per cell-based analysis is used to compensate for experimental artifacts. The model is general and is applicable to other cell-based studies also.
A Joint Texture Description Method Utilizing Visual and Semantic Features
Authors: Zhengping Liang, Zhen Ji, Zhiqiang Wang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Image texture is an important feature in content-based image retrieval system. To characterize the texture feature of images, we propose an effective texture description combining the visual and semantic features. It captures the visual feature of the texture in a greatly reduced texture spectrum scheme; furthermore, it can describe the semantic feature of texture in natural language thanks to linguistic variable. We also put forward a semantic feature extraction algorithm using neural network. Our experimental results demonstrate that the texture description has excellent performance in catching the visual and semantic content of the image texture. In some extent it can bridge the "semantic gap" between the low-level visual feature and high-level semantic feature in content-based image retrieval.
Exploring TCP Parallelisation for performance improvement in heterogeneous networks
Authors: Qiang Fu, Jadwiga Indulska, Sylvie Perreau, Liren Zhang
Venue: Computer Communications (2007)

TCP Parallelisation uses a set of parallel (modified or standard) TCP connections to transfer data for an application process. With standard TCP connections, TCP Parallelisation has been used to effectively utilise bandwidth for data intensive applications over high bandwidth-delay product (BDP) networks. On the other hand, it has been argued that a single TCP connection with proper modification can emulate and capture the robustness of TCP Parallelisation and thus can well replace TCP Parallelisation. A typical example is HSTCP, which can emulate the behaviour of a set of multiple standard TCP connections. However, through the analysis and the proposed use of TCP Parallelisation in this paper, we found that TCP Parallelisation has its unique merits, which cannot be emulated by a single-connection based approach. As a result, the single-connection based approach (such as HSTCP) may not be able to achieve the same effects as TCP Parallelisation, especially in heterogeneous networks and highly dynamic environments (e.g., high BDP networks combined with wireless access links). In this paper, we demonstrate some of these unique merits of TCP Parallelisation (namely, localisation of disturbances such as Fast Recovery, loss synchronisation between parallel connections and self-healing) over single-connection based approach in the heterogeneous environment.
Sequential Permutation Networks
Authors: K. Harada
Venue: IEEE Transactions on Computers (1972)

Two sequential permutation networks which generate all n! permutations without duplication are presented. Each permutation can be derived from its predecessor autonomously in one clock step. Based on the principle of recursive execution of a product of transpositions, the first network is constructed in multiple cascades of ½(n²-n) switching elements each of which permutes its input pai
Implementing Atomic Section by Using Hybrid Concurrent Control
Authors: Lei Zhao, Yu Zhang
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Atomic section is an important language feather in multithread synchronizing. So far, it can only be implemented by using pessimistic or optimistic concurrent control singly. This paper introduces a flexible hybrid concurrent control system which could harmonize the two modes of concurrent control. Accordingly, a new atomic section is proposed as language level support to open an interface for both manual and compiler-assisted optimization.
Technical Section: On the development of evolutionary artificial artists
Authors: Penousal Machado, Juan Romero, Antonino Santos, Amílcar Cardoso, Alejandro Pazos
Venue: Computers and Graphics (2007)

The creation and the evaluation of aesthetic artifacts are tasks related to design, music and art, which are highly interesting from the computational point of view. Nowadays, Artificial Intelligence systems face the challenge of performing tasks that are typically human, highly subjective, and eventually social. The present paper introduces an architecture which is capable of evaluating aesthetic characteristics of artifacts and of creating artifacts that obey certain aesthetic properties. The development methodology and motivation, as well as the results achieved by the various components of the architecture, are described. The potential contributions of this type of systems in the context of digital art are also considered.
Everything over IP -- an overview of the strategic change in voice and data networks
Authors: S. A. Karim, P. Hovell
Venue: BT Technology Journal (2007)

This paper investigates the changes that are required in networking technology for `everything over IP' to become a reality. Initially the changes that are taking place in the telecommunications industry are reviewed. This review ranges from a discussion about the companies installing massive global IP networks to the emergence of novel routeing technologies, e.g. multi-protocol label switching (MPLS) and terabit router technologies. The role of existing telecommunications operators is then discussed, along with the reasons why they are developing interworking and intelligence layers based on distributed computing principles to support all their networks -- mobile, fixed, broadband and IP.
Convergence of Optimal Solutions about Approximation Scheme for Fuzzy Programming with Minimum-Risk Criteria
Authors: Yan-Kui Liu, Miao Tian
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Two-stage fuzzy minimum-risk problems (FMRPs) in- clude fuzzy variable parameters defined through a possi- bility distribution, they are inherently infinite-dimensional optimization problems that can rarely be solved directly. Therefore, algorithms to solve such optimization problems must rely on intelligent computing as well as approximating scheme, which results in approximating finite-dimensional FMRPs. The purpose of this paper is to establish condi- tions under which the optimal objective value and optimal solution of such approximating two-stage FMRP converges to the optimal objective value and optimal solution of the original two-stage FMRP, respectively.
Exploring design concepts for sharing experiences through digital photography
Authors: Heekyoung Jung, Kay Connelly
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

In this research, we aim to explore meaningful design directions for future photography applications with a focus on the experiences around sharing. We review a wide-rage of photo-related applications, extracting emerging patterns of different photo-related interactions to inform a framework for their discussion. We extract two themes from the first stage of our analysis: contextual annotation and tangible representation, and then examine interesting application ideas around those themes. We categorize design ideas into four groups: augmentation of photo taking, editing as creating new memories, building new social networks through photo sharing, and tangible representation to mediate intimacy. Finally, we present user reactions to our design ideas. In addition to providing a framework for describing different photography applications, this work provides an example of an integrative approach to designing new sharing experiences through digital photography.
Comparing reliability and security: Concepts, requirements, and techniques
Authors: Robert S. Hanmer, Donald T. McBride, Veena B. Mendiratta
Venue: Bell Labs Technical Journal (2007)

Design of highly secure systems is increasingly important. This paper explores the relationship between reliability engineering and security engineering for software products. Our work has indicated that designing for reliability and designing for security share many common ideas and, more importantly, techniques that can be leveraged in product development. Security failures are one aspect of product dependability, and while security failures are qualitatively different from other reliability failures in some ways, the two classes of failures have a great deal in common. International Telecommunication Union, Telecommunications Standardization Sector (ITU-T) Recommendation X.805 suggests that availability has a specific meaning for security, namely, that it &ldquo;ensures that there is no denial of authorized access to network elements, stored information, information flows, services and applications due to events impacting the network.&rdquo; This definition is very similar to the definition of availability that reliability engineers use in describing functionality. This paper explores the similarities and differences in approaches taken within the communications domain for reliability and security. The three areas that are discussed are terminology, requirements, and common techniques. &copy; 2007 Alcatel-Lucent.
A BIST TPG for low power dissipation and high fault coverage
Authors: Seongmoon Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper presents a low hardware overhead test pattern generator (TPG) for scan-based built-in self-test (BIST) that can reduce switching activity in circuits under test (CUTs) during BIST and also achieve very high fault coverage with reasonable lengths of test sequences. The proposed BIST TPG decreases transitions that occur at scan inputs during scan shift operations and hence reduces switching activity in the CUT. The proposed BIST is comprised of two TPGs: LT-RTPG and 3-weight WRBIST. Test patterns generated by the LT-RTPG detect easy-to-detect faults and test patterns generated by the 3-weight WRBIST detect faults that remain undetected after LT-RTPG patterns are applied. The proposed BIST TPG does not require modification of mission logics, which can lead to performance degradation. Experimental results for ISCAS'89 benchmark circuits demonstrate that the proposed BIST can significantly reduce switching activity during BIST while achieving 100% fault coverage for all ISCAS'89 benchmark circuits. Larger reduction in switching activity is achieved in large circuits. Experimental results also show that the proposed BIST can be implemented with low area overhead.