ppxscal/embedding_network huggingface dataset:
Ideal contrast visual cryptography schemes with reversing
Authors: Stelvio Cimato, Alfredo De Santis, Anna Lisa Ferrara, Barbara Masucci
Venue: Information Processing Letters (2005)

A visual cryptography scheme (VCS) for a set of n participants is a method to encode a secret image, consisting of black and white pixels, into n transparencies, one for each participant. Certain qualified subsets of participants can "visually" recover the secret image by stacking their transparencies, whereas, other, forbidden, subsets of participants, cannot gain any information about the secret image.Recently, Viet and Kurosawa proposed a VCS with reversing, which is a VCS where the participants are also allowed to reverse their transparencies, i.e., to change black pixels to white pixels and vice-versa. They showed how to construct VCSs with reversing where the reconstruction of black (white, respectively) pixels is perfect, whereas, the reconstruction of white (black, respectively) pixels is almost perfect. In both their schemes there is a loss of resolution, since the number of pixels in the reconstructed image is greater than that in the original secret image.In this paper we show how to construct VCSs with reversing where reconstruction of both black and white pixels is perfect. In our schemes each participant is required to store a certain number of transparencies, each having the same number of pixels as the original secret image. Moreover, our schemes guarantee no loss of resolution, since the reconstructed image is exactly the same as the original secret image. Finally, compared to the schemes of Viet and Kurosawa, our schemes require each participant to store a smaller amount of information.
A Staged Continuous Tabu Search Algorithm for the Global Optimization and its Applications to the Design of Fiber Bragg Gratings
Authors: R. T. Zheng, N. Q. Ngo, P. Shum, S. C. Tjin, L. N. Binh
Venue: Computational Optimization and Applications (2005)

A novel staged continuous Tabu search (SCTS) algorithm is proposed for solving global optimization problems of multi-minima functions with multi-variables. The proposed method comprises three stages that are based on the continuous Tabu search (CTS) algorithm with different neighbor-search strategies, with each devoting to one task. The method searches for the global optimum thoroughly and efficiently over the space of solutions compared to a single process of CTS. The effectiveness of the proposed SCTS algorithm is evaluated using a set of benchmark multimodal functions whose global and local minima are known. The numerical test results obtained indicate that the proposed method is more efficient than an improved genetic algorithm published previously. The method is also applied to the optimization of fiber grating design for optical communication systems. Compared with two other well-known algorithms, namely, genetic algorithm (GA) and simulated annealing (SA), the proposed method performs better in the optimization of the fiber grating design.
Minimum-cost dynamic flows: The series-parallel case: A preliminary version of this paper appeared in the Proceedings of the 4th International Conference on Integer Programming and Combinatorial Optimization, Springer Lecture Notes in Computer Science 920, 1995, pp. 329&ndash;343
Venue: Networks (2004)

A dynamic network consists of a directed graph with capacities, costs, and integral transit times on the arcs. In the minimum-cost dynamic flow problem &lpar;MCDFP&rpar;, the goal is to compute, for a given dynamic network with source s, sink t, and two integers v and T, a feasible dynamic flow from s to t of value v, obeying the time bound T, and having minimum total cost. MCDFP contains as subproblems the minimum-cost maximum dynamic flow problem, where v is fixed to the maximum amount of flow that can be sent from s to t within time T and the minimum-cost quickest flow problem, where is T is fixed to the minimum time needed for sending v units of flow from s to t. We first prove that both subproblems are NP-hard even on two-terminal series-parallel graphs with unit capacities. As main result, we formulate a greedy algorithm for MCDFP and provide a full characterization via forbidden subgraphs of the class &Gscr; of graphs, for which this greedy algorithm always yields an optimum solution &lpar;for arbitrary choices of problem parameters&rpar;. &Gscr; is a subclass of the class of two-terminal series-parallel graphs. We show that the greedy algorithm solves MCDFP restricted to graphs in &Gscr; in polynomial time. &copy; 2004 Wiley Periodicals, Inc.
A Non-Local Algorithm for Image Denoising
Authors: Antoni Buades, Bartomeu Coll, Jean-Michel Morel
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We propose a new measure, the method noise, to evaluate and compare the performance of digital image denoising methods. We first compute and analyze this method noise for a wide class of denoising algorithms, namely the local smoothing filters. Second, we propose a new algorithm, the non local means (NL-means), based on a non local averaging of all pixels in the image. Finally, we present some experiments comparing the NL-means algorithm and the local smoothing filters.
Interpreting System for Visual Query Language CQL
Authors: Hong Yang, Shiguang Ju, Xinyi Li, Zengjin Qian
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Because a visual language uses basic elements that differ from traditional language, its compiler is differed from traditional ones too. This paper first discusses interpretation flow chart of a visual query sentence. And then analysises the system that easy for interpreting visual query sentence. It is described that the mechanism that is used for pattern recognition and syntax analysis of the visual query sentence.
A Cellular Multi-Objective Genetic Algorithm for Optimal Broadcasting Strategy in Metropolitan MANETs
Authors: E. Alba, B. Dorronsoro, F. Luna, A. J. Nebro, P. Bouvry
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

Mobile Ad-hoc Networks (MANETs) are composed of a set of communicating devices which are able to spontaneously interconnect without any pre-existing infrastructure. In such scenario, broadcasting becomes an operation of capital importance for the own existence and operation of the network. Optimizing a broadcast strategy in MANETs is a multi-objective problem accounting for three goals: reaching as many stations as possible, minimizing the network utilization, and reducing the makespan. In this paper, we study the fine-tuning of broadcast strategies by using a cellular multi-objective genetic algorithm (cMOGA) that computes a Pareto front of the solutions to empower a human designer with the ability of choosing the preferred configuration for the network. We define two formulations of the problem, one with three objectives and another one with two objectives plus a constraint. Our experiments using a complex and realistic MANET simulator reveal that using cMOGA is a promising approach to solve the optimum broadcast problem.
Design and analysis of delimiters for selection-action pen gesture phrases in scriboli
Authors: Ken Hinckley, Patrick Baudisch, Gonzalo Ramos, Francois Guimbretiere
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present a quantitative analysis of delimiters for pen gestures. A delimiter is "something different" in the input stream that a computer can use to determine the structure of input phrases. We study four techniques for delimiting a selection-action gesture phrase consisting of lasso selection plus marking-menu-based command activation. Pigtail is a new technique that uses a small loop to delimit lasso selection from marking (Fig. 1). Handle adds a box to the end of the lasso, from which the user makes a second stroke for marking. Timeout uses dwelling with the pen to delimit the lasso from the mark. Button uses a button press to signal when to delimit the gesture. We describe the role of delimiters in our Scriboli pen interaction testbed, and show how Pigtail supports scope selection, command activation, and direct manipulation all in a single fluid pen gesture.
SEWeP: a web mining system supporting semantic personalization
Authors: Stratos Paulakis, Charalampos Lampos, Magdalini Eirinaki, Michalis Vazirgiannis
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

We present SEWeP, a Web Personalization prototype system that integrates usage data with content semantics, expressed in taxonomy terms, in order to produce a broader yet semantically focused set of recommendations.
Experimental Analysis of Practically Efficient Algorithms for Bounded-Hop Accumulation in Ad-Hoc Wireless Networks
Authors: Andrea E. F. Clementi, Miriam Di Ianni, Angelo Monti, Gianluca Rossi, Riccardo Silvestri
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 12 - Volume 13 (2005)

The paper studies the problem of computing a minimal energy-cost range assignment in an ad-hoc wireless network which allows a set S of stations located in the 2-dimensional Euclidean space to perform accumulation (all-to-one) operations towards some root station b in at most h hops (2-Dim Min h-Accumulation Range Assignment problem). We experimentally investigate the behavior of fast and easy-to-implement heuristics for the 2-Dim Min h-Accumulation Range Assignment problem on instances obtained by choosing at random n points in a square of side length L. We compare the performance of an easy-to-implement, very fast heuristic with those of three simple heuristics based on classical greedy algorithms (Prim's and Kruskal's ones) defined for the Minimum Spanning Tree problem. The comparison is carried out over thousands of random instances in several different situations depending on: the distribution of the stations in the plane, their density, the energy cost function.
Rehabilitation Engineering Research Center (RERC) for the advancement of cognitive technologies
Authors: Cathy Bodine, Clayton Lewis
Venue: Issue 80 (September 2004) (2004)

Individuals with cognitive disabilities have long been marginalized by society's unwillingness to include them - within their local communities, educational systems and workplaces - in short, into the very fabric of society. While technology undoubtedly can play a vital role in decreasing this marginalization, there have been very few attempts to date to produce a coherent and sustained approach to identifying and ameliorating barriers for persons with significant cognitive disabilities through the use of technology.
Using Mobile Communications to Assert Privacy from Video Surveillance
Authors: Jack Brassil
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 17 - Volume 18 (2005)

We propose a novel use of mobile communications to permit individuals to assert a preference for privacy from video surveillance. Our system, called Cloak, grants an individual the right to prohibit others from distributing video containing their image. We present our system architecture and operation, and demonstrate how the system enhances privacy while requiring no change to existing surveillance technology. We use analysis and simulation to show that an individual's video privacy can be protected even in the presence of the many sources of error (e.g., unsynchronized clocks, unreliable communications, location error) we anticipate in a deployed system, and argue that there are no insurmountable technical barriers to Cloak's large-scale deployment. Given the threat to privacy posed by the rapid and widespread deployment of camera-phones, we maintain that today's surveillance systems must be urgently augmented with privacy enhancing technology.
Design, implementation and maintenance of a model organism database for Arabidopsis thaliana: Reviews
Authors: Danforth Weems, Neil Miller, Margarita Garcia-Hernandez, Eva Huala, Seung Y. Rhee
Venue: Comparative and Functional Genomics (2004)

The Arabidopsis Information Resource (TAIR) is a web-based community database for the model plant Arabidopsis thaliana. It provides an integrated view of genes, sequences, proteins, germplasms, clones, metabolic pathways, gene expression, ecotypes, polymorphisms, publications, maps and community information. TAIR is developed and maintained by collaboration between software developers and biologists. Biologists provide specification and use cases for the system, acquire, analyse and curate data, interact with users and test the software. Software developers design, implement and test the database and software. In this review, we briefly describe how TAIR was built and is being maintained. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Reflections on challenges to the goal of invisible computing
Authors: Arun Kumar Tripathi
Venue: Ubiquity (2005)

"Technology becomes subordinate to values through economics, government, or the professions. Our biggest problem is learning to recognize that we do have options, albeit often limited ones. Our tendency is to just create more technology rather than ask why." (Carl Mitcham, as he articulates the thesis of Albert Borgmann on the relationship between contemporary technologies and human values)
Tornado, twisters: secondary currents within the atmosphere
Authors: Sh. A. Yershin, A. K. Yershina
Venue: Mathematics and Computers in Simulation (2004)

In the present work we try to reveal the potential activating mechanism of such threatening meteor like twister and tornado. Secondary (circulating) currents within absolute liquid (gas) currents, named as Taylor-Gertler's free vortexes have been discovered and studied.
Proof of the oval conjecture for proper planar partition surfaces
Authors: Dieter Betten, Rainer Löwen
Venue: European Journal of Combinatorics (2005)

We prove the 'oval conjecture' for planar partition functions, which says that the shift plane and the translation plane defined by a planar partition function form an oval pair of planes in the sense that each non-vertical line of one plane defines a topological oval in the projective closure of the other. The proof uses covering space techniques, and we have to assume that the generating function is proper in order to make those techniques available. As an application, we give a natural geometric construction of a homeomorphism between the Cartesian square of the shift line and its tangent bundle.
Minimum-cost single-source 2-splittable flow
Authors: Stavros G. Kolliopoulos
Venue: Information Processing Letters (2005)

In the single-source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain sinks in a given directed graph with edge capacities and costs. The demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover the cost of the solution should not exceed a given budget. An important open question is whether a simultaneous (2, 1)-approximation can be achieved for minimizing congestion and cost, i.e., the budget constraint should not be violated. In this note we show that this is possible for the case of 2-splittable flows, i.e., flows where the demand of each commodity is routed along at most two paths. Our result holds under the "no-bottleneck" assumption, i.e., the maximum demand does not exceed the minimum capacity.
A basis for complexity measurement?
Authors: A. J. Payne
Venue: Issue 82 (October 1982) (1982)

This paper shows how OR techniques of the Mean Path Theorem can lead to some interesting results for measures of complexity. We have found that we can develop formulae for the best strategy of search. Using this formula we can show that we need to search an area the number of times that we expect to find separate targets and that the value of a measure for the best strategy is unity when we need to find 6.4 targets.
Book review: Natural Language and Voice Processing by Terri C. Walker and Richard K. Miller (SEAI Technical Publications)
Venue: Issue 103 (Jan., 1988) (1988)

This 250 page looseleaf book is an assessment of the technology and the applications of natural language and voice processing. Although there is no indication of the goal of the book, it seems designed for manager-level people who are interested in acquiring natural language and voice processing technology. The book contains the following chapters:
A framework for the assessment of operating systems for small computers
Authors: Hossein Saiedian, Munib Siddiqi
Venue: ACM SIGICE Bulletin (1996)

A number of high performance operating systems are now available for small computers on different hardware platforms. These operating systems offer many advanced features formerly reserved for their workstation and minicomputer counterparts. This article surveys the most widely used of such operating systems, namely OS/2, Windows NT, Linux and Macintosh System 7.5. It provides an account on the history, design objectives and evolution of these operating systems and discusses their key features, design concepts and implementation issues. An assessment and comparison of features, and capabilities is also provided. The assessment and comparison is based primarily on key features, such as memory management, multitasking capabilities, file system architecture, I/O support (such as asynchronous I/O, multimedia capabilities, plug and play devices, and on-demand load drivers), and networking capabilities (e.g., support for widely used protocols such as TCP/IP, SLIP/PPP, NetBIOS, NSF mounting, etc.).
A note on the Lyapunov stability of periodic discrete-time systems
Authors: M. Sadkane, L. Grammont
Venue: Journal of Computational and Applied Mathematics (2005)

We characterize the stability of discrete-time Lyapunov equations with periodic coefficients. The characterization can be seen as the analog of the classical stability theorem of Lyapunov equations with constant coefficients. It involves quantities readily computable with good accuracy.
Optimizing anti-terrorism resource allocation: Research Articles
Authors: Steven R. Haynes, Thomas George Kannampallil, Lawrence L. Larson, Nitesh Garg
Venue: Journal of the American Society for Information Science and Technology (2005)

Since spring of 2002 we have been working on a methodology, decision model, and cognitive support system to aid with effective allocation of anti-terrorism (AT) resources at Marine Corps installations. The work has so far been focused on the military domain, but the model and the software tools developed to implement it are generalizable to a range of commercial and public-sector settings including industrial parks, corporate campuses, and civic facilities. The approach suggests that anti-terrorism decision makers determine mitigation project allocations using measures of facility priority and mitigation project utility as inputs to the allocation algorithm. The three-part hybrid resource allocation model presented here uses multi-criteria decision-making techniques to assess facility (e.g., building, hangar) priorities, a utility function to calculate anti-terrorism project mitigation values (e.g., protective glazing, wall coatings, and stand-off barriers) and optimization techniques to determine resource allocations across multiple, competing AT mitigation projects. The model has been realized in a cognitive support system developed as a set of loosely coupled Web services. The approach, model, and cognitive support system have been evaluated using the cognitive walkthrough method with prospective system users in the field. In this paper we describe the domain, the problem space, the decision model, the cognitive support system and summary results of early model and system evaluations. &copy; 2005 Wiley Periodicals, Inc.
Methodology and architecture of JIVE
Authors: Paul Gestwicki, Bharat Jayaraman
Venue: Proceedings of the 2005 ACM symposium on Software visualization (2005)

A novel approach to the runtime visualization and analysis of object-oriented programs is presented and illustrated through a prototype system called JIVE: Java Interactive Visualization Environment. The main contributions of JIVE are: multiple concurrent representations of program state and execution history; support for forward and reverse execution; and graphical queries over program execution. This model facilitates program understanding and interactive debugging. Our visualization of runtime states clarifies the important point that objects are environments of execution. The history of object interaction is displayed via sequence diagrams, and in this way we help close the loop between design-time and run-time representations. Interactive execution is made possible by maintaining a runtime history database, which may be queried for information on variable behavior, method executions, and object interactions. We illustrate the capabilities of this system through examples. JIVE is implemented using the Java Platform Debugger Architecture and supports the Java language and libraries, including multithreaded and GUI applications.
Expected, sensed, and desired: A framework for designing sensing-based interaction
Authors: Steve Benford, Holger Schnädelbach, Boriana Koleva, Rob Anastasi, Chris Greenhalgh, Tom Rodden, Jonathan Green, Ahmed Ghali, Tony Pridmore, Bill Gaver, Andy Boucher, Brendan Walker, Sarah Pennington, Albrecht Schmidt, Hans Gellersen, Anthony Steed
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2005)

Movements of interfaces can be analyzed in terms of whether they are expected, sensed, and desired. Expected movements are those that users naturally perform; sensed are those that can be measured by a computer; and desired movements are those that are required by a given application. We show how a systematic comparison of expected, sensed, and desired movements, especially with regard to how they do not precisely overlap, can reveal potential problems with an interface and also inspire new features. We describe how this approach has been applied to the design of three interfaces: pointing flashlights at walls and posters in order to play sounds; the Augurscope II, a mobile augmented reality interface for outdoors; and the Drift Table, an item of furniture that uses load sensing to control the display of aerial photographs. We propose that this approach can help to build a bridge between the analytic and inspirational approaches to design and can help designers meet the challenges raised by a diversification of sensing technologies and interface forms, increased mobility, and an emerging focus on technologies for everyday life.
ParADE: An OpenMP Programming Environment for SMP Cluster Systems
Authors: Yang-Suk Kee, Jin-Soo Kim, Soonhoi Ha
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Demand for programming environments to exploit clusters of symmetric multiprocessors (SMPs) is increasing. In this paper, we present a new programming environment, called ParADE, to enable easy, portable, and high-performance programming on SMP clusters. It is an OpenMP programming environment on top of a multi-threaded software distributed shared memory (SDSM) system with a variant of home-based lazy release consistency protocol. To boost performance, the runtime system provides explicit message-passing primitives to make it a hybrid-programming environment. Collective communication primitives are used for the synchronization and work-sharing directives associated with small data structures, lessening the synchronization overhead and avoiding the implicit barriers of work-sharing directives. The OpenMP translator bridges the gap between the OpenMP abstraction and the hybrid programming interfaces of the runtime system. The experiments with several NAS benchmarks and applications on a Linux-based cluster show promising results that ParADE overcomes the performance problem of the conventional SDSM-based OpenMP environment.