ppxscal/embedding_network huggingface dataset:
Creating a topic map query tool for mobile devices using J2ME and XML
Authors: Stefan Seedorf, Axel Korthaus, Markus Aleksy
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

Most of today's enterprises conduct knowledge management initiatives for achieving competitive advantage. Information technology plays a key role in codifying knowledge and distributing it throughout the organization. However, the utilization of mobile technology for supporting knowledge management has been largely overlooked so far. As mobile devices are becoming increasingly powerful and ubiquitous, new possibilities to realize fully integrated knowledge management processes are created. This paper presents a basic architecture that enables mobile workers to retrieve knowledge contained within topic maps and associated information objects. Topic maps enable knowledge structures to be codified and linked with information resources. The paper comprises Java-based mobile tools that run on PDAs as well as mobile phones and exchange XML data with a topic map server. Our prototypical implementation is evaluated and directions for future work are proposed.
High-resolution methods for two-component fluid flow problem with moving interface
Authors: Marek Brandner, Stanislav Mika
Venue: Mathematics and Computers in Simulation (2004)

This work is devoted to the numerical simulation of two--component fluid flow. Projection methods are used for solving the Navier-Stokes equations and high-resolution methods are used for solving the advection equation formulated for a volume fraction describing the location of the interface between the fluid components.
A Slit Scanning Depth of Route Panorama from Stationary Blur
Authors: Min Shi, Jiang Yu Zheng
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This work achieves an efficient acquisition of scenes and their depths along streets. During the movement of a vehicle, a slit in the camera frame is set properly to sample scenes continuously for a route panorama. This paper proposes a novel method of depth estimation by analyzing a new phenomenon named stationary blur in the route panorama. We find its relation with the depth and evaluate its degree at local and global levels. The depth estimation through filtering avoids feature matching and tracking that are error-prone in the scanning of real and complex street scenes. Our method provides reliable results but requires much less data than that of the structure from motion. This keeps the elegance of the route panorama in data representation, and is suitable for real time sensor development. Utilizing the completeness of the route panorama in the scene archiving, we can generate planar models of streets, which will be used in city visualization.
Some studies on uncertainty management in dynamical systems using cybernetic approaches and fuzzy techniques with applications
Authors: Kausik Kumar Majumdar, D. Dutta Majumder
Venue: International Journal of Systems Science (2004)

Uncertain information processing by fuzzy if-then rules has received much attention. Here we have taken a different path to model a system, about which we do not have precise information, namely modelling the system by fuzzy-valued functions without resorting to fuzzy if-then rules. As a result, the phase (state) space of the system becomes a fuzzy set and the underlying fuzzy mapping becomes a fuzzy attainability set mapping. Uncertain or fuzzy dynamical systems have been defined in terms of fuzzy attainability set mappings. Fuzzy differentiable dynamical systems have been discussed with a particular emphasis on fuzzy differential inclusion (FDI) relations. An evolutionary algorithm for solving one-dimensional FDIs has been developed. A model of the creation of a tropical cyclone in the form of a vortex, created by winds coming from different directions and colliding under certain conditions, has been proposed in terms of FDIs. A model has been considered for the highly uncertain system of evolution of a tumour in a human body and an FDI relation model of the whole system has been proposed and simulated. The model of an evolution of turbulence, as a random occurrence of vortices in a three-dimensional dynamic fluid, has been proposed and simulated, where each vortex is modelled by a fuzzy-valued function, where uncertain parameter and variable values are fuzzy numbers. All the systems represented by FDI relations have been simulated with the help of the evolutionary algorithm mentioned above.
Recent advances in visual and infrared face recognition: a review
Authors: Seong G. Kong, Jingu Heo, Besma R. Abidi, Joonki Paik, Mongi A. Abidi
Venue: Computer Vision and Image Understanding (2005)

Face recognition is a rapidly growing research area due to increasing demands for security in commercial and law enforcement applications. This paper provides an up-to-date review of research efforts in face recognition techniques based on two-dimensional (2D) images in the visual and infrared (IR) spectra. Face recognition systems based on visual images have reached a significant level of maturity with some practical success. However, the performance of visual face recognition may degrade under poor illumination conditions or for subjects of various skin colors. IR imagery represents a viable alternative to visible imaging in the search for a robust and practical identification system. While visual face recognition systems perform relatively reliably under controlled illumination conditions, thermal IR face recognition systems are advantageous when there is no control over illumination or for detecting disguised faces. Face recognition using 3D images is another active area of face recognition, which provides robust face recognition with changes in pose. Recent research has also demonstrated that the fusion of different imaging modalities and spectral components can improve the overall performance of face recognition.
Analyzing Message-Passing Programs through Visual Slicing
Authors: Ganesha S. R. Shanmuganathan, Kang Zhang, Eric Wong, Yu Qi
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Program slicing decomposes a large program into smaller sections that contain statements relevant to a computation under study. This paper presents a novel method for visual slicing of message passing programs. Each slice is computed based on predicates and focuses on inter-process messages that influence the predicate. A predicate slice is visualized based on the spacetime diagram and captures some global requirements or suspected error properties of the distributed program. We have implemented the methods in Visper, an MPI-like message-passing environment that supports high level services such as check-pointing and fault tolerance.
Engineering safety-related requirements for software-intensive systems
Authors: Donald G. Firesmith
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Many software-intensive systems have significant safety ramifications and need to have their associated safety-related requirements properly engineered. However, there is little effective interaction and collaboration between the requirements and safety teams on most projects. This tutorial is intended to improve such collaboration by providing clear definitions of the different kinds of safety-related requirements, examples of such requirements, and a generic process for producing them.
Optimizing spatial Min/Max aggregations
Authors: Donghui Zhang, J. Tsotras
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2005)

Aggregate computation over a collection of spatial objects appears in many real-life applications. Aggregates are computed on values (weights) associated with spatial objects, for example, the temperature or rainfall over the area covered by the object. In this paper we concentrate on MIN/MAX aggregations: &#x201c;given a query rectangle, find the minimum/maximum weight among all objects intersecting the query rectangle.&#x201d; Traditionally such queries have been performed as range searches. Assuming that objects are indexed by a spatial access method (SAM), the MIN/MAX is computed while retrieving those objects intersecting the query interval. This requires effort proportional to the number of objects satisfying the query, which may be large. A better approach is to maintain aggregate information among the index nodes of the spatial access method; then various index paths can be eliminated during the range search. Yet another approach is to build a specialized index that maintains the aggregate incrementally. We propose four novel optimizations for improving the performance of MIN/MAX queries when an index structure (traditional or specialized) is present. Moreover, we introduce the MR-tree, an R-tree-like dynamic specialized index that incorporates all four optimizations. Our experiments show that the MR-tree offers drastic performance improvement over previous solutions. As a byproduct of this work we present an optimized version of the MSB-tree, an index that has been proposed for the MIN/MAX computation over 1D interval objects.
The Lowell database research self-assessment
Authors: Serge Abiteboul, Rakesh Agrawal, Phil Bernstein, Mike Carey, Stefano Ceri, Bruce Croft, David DeWitt, Mike Franklin, Hector Garcia Molina, Dieter Gawlick, Jim Gray, Laura Haas, Alon Halevy, Joe Hellerstein, Yannis Ioannidis, Martin Kersten, Michael Pazzani, Mike Lesk, David Maier, Jeff Naughton, Hans Schek, Timos Sellis, Avi Silberschatz, Mike Stonebraker, Rick Snodgrass, Jeff Ullman, Gerhard Weikum, Jennifer Widom, Stan Zdonik
Venue: Communications of the ACM (2005)

Database needs are changing, driven by the Internet and increasing amounts of scientific and sensor data. In this article, the authors propose research into several important new directions for database management systems.
Higher Power Residue Codes and the Leech Lattice
Authors: Mehrdad Ahmadzadeh Raji
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

We shall consider higher power residue codes over the ring Z4. We will briefly introduce these codes over Z4 and then we will find a new construction for the Leech lattice. A similar construction is used to construct some of the other lattices of rank 24.
The algebraic Monge property and path problems
Authors: Wolfgang Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
Venue: Discrete Applied Mathematics (2005)

We give algorithmic results for combinatorial problems with cost arrays possessing certain algebraic Monge properties. We extend Monge-array results for two shortest path problems to a general algebraic setting, with values in an ordered commutative semigroup, if the semigroup operator is strictly compatible with the order relation.We show how our algorithms can be modified to solve bottleneck shortest path problems, even though strict compatibility does not hold in that case. For example, we give a linear time algorithm for the unrestricted shortest path bottleneck problem on n nodes, also O(kn) and O(n3/2 log5/2 n) time algorithms for the k-shortest path bottleneck problem.
Glimpse: a novel input model for multi-level devices
Authors: Clifton Forlines, Chia Shen, Bill Buxton
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We describe a technique that supports the previewing of navigation, exploration, and editing operations by providing convenient Undo for unsuccessful and/or undesirable actions on multi-level input devices such as touch screens and pen-based computers. By adding a Glimpse state to traditional three-state pressure sensitive input devices, users are able to preview the effects of their editing without committing to them. From this Glimpse state, users can undo their action as easily as they can commit to it, making Glimpse most appropriate for systems in which the user is likely to try out many variations of an edit before finding the right one. Exploration is encouraged as the cumbersome returning to a menu or keyboard to issue an Undo command is eliminated. Glimpse has the added benefits that the negative effects of inconsistencies in the Undo feature within an application are reduced.
Conditions for output invariance of linear systems
Authors: V. N. Bukov, A. M. Bronnikov
Venue: Automation and Remote Control (2005)

For the linear stationary dynamic systems, the necessary and sufficient conditions for output invariance to arbitrary external perturbations were substantiated by solving the matrix equations with the help of the canonization method. The conditions obtained were used to design controllers maintaining this invariance. The results were extended to the problem of parametric invariance. The paper was confined to the linear stationary systems without delays and constraints on control. An illustrating example was presented.
Convergence of the least-squares method with a polynomial regularizer for the infinite-dimensional autoregression equation
Authors: A. E. Barabanov, Yu. R. Gel'
Venue: Automation and Remote Control (2005)

Consideration was given to the estimation of the unknown parameters of a stable infinite-dimensional autoregressive model from the observations of a random time series. The class of such models includes an autoregressive moving-average equation with a stable moving-average part. A modified procedure of the least-squares method was used to identify the unknown parameters. For the infinite-dimensional case, the estimates of the least-squares method were proved to be strong consistent. In addition, presented was a fact on convergence of the semimartingales that is of independent interest.
Efficient detection of a class of stable properties
Authors: Keith Marzullo, Laura S. Sabel
Venue: Distributed Computing (1994)

We present a general protocol for detecting whether a property holds in a distributed system, where the property is a member of a class of stable properties we call the locally stable properties. Our protocol is based on a decentralized method for constructing a maximal subset of the local states that are mutually consistent, which in turn is based on a weakened version of vector time stamps. The structure of our protocol lends itself to refinement, and we demonstrate its utility by deriving some specialized property-detection protocols, including two previously-known protocols that are known to be efficient.
Modeling and assessing inference exposure in encrypted databases
Authors: Alberto Ceselli, Ernesto Damiani, Sabrina De Capitani Di Vimercati, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Venue: ACM Transactions on Information and System Security (TISSEC) (2005)

The scope and character of today's computing environments are progressively shifting from traditional, one-on-one client-server interaction to the new cooperative paradigm. It then becomes of primary importance to provide means of protecting the secrecy of the information, while guaranteeing its availability to legitimate clients. Operating online querying services securely on open networks is very difficult; therefore many enterprises outsource their data center operations to external application service providers. A promising direction toward prevention of unauthorized access to outsourced data is represented by encryption. However, data encryption is often supported for the sole purpose of protecting the data in storage while allowing access to plaintext values by the server, which decrypts data for query execution. In this paper, we present a simple yet robust single-server solution for remote querying of encrypted databases on external servers. Our approach is based on the use of indexing information attached to the encrypted database, which can be used by the server to select the data to be returned in response to a query without the need of accessing the plaintext database content. Our indexes balance the trade-off between efficiency requirements in query execution and protection requirements due to possible inference attacks exploiting indexing information. We investigate quantitative measures to model inference exposure and provide some related experimental results.
Shape Regularized Active Contour Using Iterative Global Search and Local Optimization
Authors: Tianli Yu, Jiebo Luo, Narendra Ahuja
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that incorporates existing nonlinear shape models into the classical active contour approach. ShRAC uses a discrete representation of the contour to allow efficient combinatorial search. The search for optimal contour is performed by a coarse-to-fine algorithm that iterates between combinatorial search and gradient-based local optimization. First, Multi-Solution Dynamic Programming (MSDP) is used to generate initial candidates by minimizing only the image energy. In the second step, a combination of image energy and shape energy determined by a given prior shape model is minimized for the initial candidates using a local optimization method and the best one is selected. To have diverse initial candidates, we employ a Clustered Solution Pruning procedure in the MSDP search space. Finally, Local Shape Regularization is used to feed shape constraints back into the new MSDP search space of the next iteration. Our search strategy combines the advantages of global combinatorial search and local optimization, and has shown excellent robustness to local minima caused by distracting suboptimal segmentations. Experimental results on segmentation of different anatomical structures using ShRAC are provided.
Query association surrogates for Web search: Research Articles
Authors: Falk Scholer, Hugh E. Williams, Andrew Turpin
Venue: Journal of the American Society for Information Science and Technology (2004)

Collection sizes, query rates, and the number of users of Web search engines are increasing. Therefore, there is continued demand for innovation in providing search services that meet user information needs. In this article, we propose new techniques to add additional terms to documents with the goal of providing more accurate searches. Our techniques are based on query association, where queries are stored with documents that are highly similar statistically. We show that adding query associations to documents improves the accuracy of Web topic finding searches by up to 7&percnt;, and provides an excellent complement to existing supplement techniques for site finding. We conclude that using document surrogates derived from query association is a valuable new technique for accurate Web searching. &copy; 2005 Wiley Periodicals, Inc.
Hongkong International Terminals Gains Elastic Capacity Using a Data-Intensive Decision-Support System
Authors: Katta G. Murty, Yat-wah Wan, Jiyin Liu, Mitchell M. Tseng, Edmond Leung, Kam-Keung Lai, Herman W. C. Chiu
Venue: Interfaces (2005)

As the flagship of Hutchison Port Holdings (HPH), Hongkong International Terminals (HIT) is the busiest container terminal on the planet. HIT receives over 10,000 trucks and 15 vessels a day, about six million twenty-foot equivalent units (TEUs) a year. HIT makes hundreds of operational decisions a minute. HIT's terminal management system, the productivity plus program (3P), optimizes resources throughout the container yard using operations research/management science (OR/MS) techniques and algorithms. It manages such interrelated decisions as how to route container trucks in the yard, where to store arriving containers, how many quay cranes to use for each vessel, how many trucks to assign to each crane, how many yard cranes to assign to each container storage block, and when to schedule incoming trucks for container pickup. As the number of container terminals in Asia grows, competition has become price driven and service driven. HIT realized its future rests not only with moving boxes but with mastering the associated information. This meant developing a decision-support system (DSS) to provide superior and differentiated services by generating optimal decisions, one that is very robust under uncertain arrival times of trucks and vessels. In its 10 years of operation, the implementation of the DSS through 3P has helped HIT to become the world's most efficient and flexible terminal operator. HIT alone saves US$100 million per year. By optimizing internal truck use at its sister terminals, the HPH group saves an additional US$54 million per year.
A novel interaction between AI and philosophy
Authors: Giuseppe Trautteur
Venue: Issue 83 (January 1983) (1983)

Most philosophical ideas and systems can be regarded as purportedly veridical descriptions of the status quo of some particular aspect of reality or of reality in toto.
Computing the branchwidth of interval graphs
Authors: Ton Kloks, Jan Kratochvíl, Haiko Müller
Venue: Discrete Applied Mathematics (2005)

Branchwidth is a graph invariant closely related to treewidth, but exhibiting remarkable distinctions. E.g., branchwidth is known to be computable in polynomial time for planar graphs. Our results concern the computational complexity of determining the branchwidth of graphs in several classes. We give an algorithm computing the branchwidth of interval graphs in time O(n3 log n). This method generalizes to permutation graphs and, more generally, to trapezoid graphs. In contrast, we show that computing branchwidth is NP-complete for splitgraphs and for bipartite graphs.
Taking Account of Correlations Between Streams in Queueing Network Approximations
Authors: Sunkyo Kim, Ravi Muralidharan, Colm A. O'Cinneide
Venue: Queueing Systems: Theory and Applications (2005)

In this paper we describe a new variation on QNA, the Queueing Network Analyzer (Whitt [38]). QNA calculates approximate congestion measures for a network of queues. The variant proposed here allows us to relax QNA's assumption that certain counts of events in the network are uncorrelated. Following QNA, the network is approximated in terms of three basic operations on streams, namely, queueing, splitting and superposition, and random quantities of interest are characterized approximately by two moments. The approach differs from QNA in that instead of expressing the network operations as transformations applied to two-moment characterizations of the inputs, it expresses these operations as regression relations between counts in the output streams and the input streams. In essence, we substitute approximate regression relationships between random variables for QNA's approximate moment relationships. This device allows us to enhance QNA's moment relationships with information about correlations between the streams. We compare the performance of the proposed approach with QNA on a simple feed-forward network to demonstrate the need for taking account of correlation. We also discuss some of the limitations of this approach, particularly its difficulty in handling feedback, and give some ideas to improve accuracy.