ppxscal/embedding_network huggingface dataset:
Detection of Occlusion Edges from the Derivatives of Weather Degraded Images
Authors: Daniel Levesque, Francois Deschenes
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Degradation of images of outdoor scenes caused by varying conditions of visibility can be exploited in order to get information on the scene. We propose two new methods for detecting occlusion edges between textured areas of a scene. These methods are based on the use of partial derivatives of two images acquired under different conditions of visibility. They were validated on images of both synthetic and real scenes.
EUDA: detecting and avoiding unidirectional links in ad hoc networks
Authors: Jun-Beom Lee, Young-Bae Ko, Sung-Ju Lee
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

Although there has been a great amount of research work in ad hoc networks, most of the research assumes the nodes are homogeneous. All the nodes are assumed to have the same or similar radio propagation range, processing capability, battery power, storage, and so forth. In reality however, nodes in ad hoc networks tend to have heterogeneity. In the military scenarios for instance, the troop leader is usually equipped with more powerful networking devices than the soldiers of the troop. Radios installed in the vehicles such as tanks and jeeps have more capabilities than radios the soldiers carry, as vehicles do not have the same size- or power-constraints as the soldiers.
Progressive Distributed Top-k Retrieval in Peer-to-Peer Networks
Authors: Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uwe Thaden
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the database objectsý degree of match for each different query predicate and returning the best matching objects only. In peer-to-peer systems such strategies are even more important, given the potentially large number of peers, which may contribute to the results. Yet current peer-to-peer research has barely started to investigate such approaches. In this paper we will discuss the benefits of best match/top-k queries in the context of distributed peer-to-peer information infrastructures and show how to extend the limited query processing in current peer-to-peer networks by allowing the distributed processing of top-k queries, while maintaining a minimum of data traffic. Relying on a super-peer backbone organized in the HyperCuP topology we will show how to use local indexes for optimizing the necessary query routing and how to process intermediate results in inner network nodes at the earliest possible point in time cutting down the necessary data traffic within the network. Our algorithm is based on dynamically collected query statistics only, no continuous index update processes are necessary, allowing it to scale easily to large numbers of peers, as well as dynamic additions/deletions of peers. We will show our approach to always deliver correct result sets and to be optimal in terms of necessary object accesses and data traffic. Finally, we present simulation results for both static and dynamic network environments.
Stability Analysis of a Simple-Structured Fuzzy Logic Controller
Authors: Byung-Jae Choi, Seong-Woo Kwak, Hua Wang
Venue: Journal of Intelligent and Robotic Systems (2005)

The stability analysis for the fuzzy logic controller (FLC) has widely been reported. Furthermore some researches have been introduced to simplify the design process of FLC's. One of them is to decrease the number of parameters representing the antecedent part of the fuzzy control rule. So we briefly explain a simple-structured fuzzy logic controller (SFLC) which uses only a single variable at the antecedent part of a fuzzy control rule. We analyze that it is absolutely stable based on the sector bounded condition. We expand a nonlinear controlled plant into a Taylor series about a nominal operating point. The fuzzy control system is transformed into a Lure system with nonlinearities. We also show the feasibility of the proposed stability analysis through a numerical example of a mass-damper-spring system.
Structure-oriented Product Versioning
Authors: Tien N. Nguyen, Ethan V. Munson, John T. Boyland, Cheng Thao
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Internal structures of software artifacts, especially program source code, are very important to software engineers in developing a high-quality software. However, many existing version control and configuration management systems often treat program source code as a set of text lines and disregard logical structure. This creates burdensome for developers since the evolution of program structures is not recorded. This makes not only the development but also the maintenance of software systems less efficient. This paper describes a novel approach to fine-grained version control of source code and structured documents, called structureoriented product versioning. The approach enables flexible management of the evolution of fine-grained units at any structural level in a software document.
Toward semantics-based answer pinpointing
Authors: Eduard Hovy, Laurie Gerber, Ulf Hermjakob, Chin-Yew Lin, Deepak Ravichandran
Venue: Proceedings of the first international conference on Human language technology research (2001)

We describe the treatment of questions (Question-Answer Typology, question parsing, and results) in the Weblcopedia question answering system.
Tasking deadlocks in programs with the full Ada 95
Authors: Yasushi Tojo, Sinsuke Nara, Yuichi Goto, Jingde Cheng
Venue: ACM SIGAda Ada Letters (2005)

This article presents some examples of tasking deadlocks concerning tasking synchronization waiting relations defined in Ada 95's Real-Time Systems Annex.
Participatory design of an orientation aid for amnesics
Authors: Mike Wu, Ron Baecker, Brian Richards
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We present the participatory design and evaluation of an orientation aid for individuals who have anterograde amnesia. Our design team included six amnesics who have extreme difficulty storing new memories. We describe the methods we used to enable the participation of individuals with such severe cognitive impairments. Through this process, we have conceived, designed, and developed the OrientingTool, a software application for Personal Digital Assistants that can be used by amnesics to orient themselves when feeling lost or disoriented. Two complementary studies were conducted to evaluate the effectiveness of this tool in ecologically valid contexts. Our findings suggest that the OrientingTool can improve an amnesic's independence and confidence in managing situations when disoriented, and that participatory design may be productively used with participants who have significant cognitive disabilities.
Enforcing Secure Service Composition
Authors: Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari
Venue: Proceedings of the 18th IEEE workshop on Computer Security Foundations (2005)

A static approach is proposed to study secure composition of software.We extend the ë-calculuswith primitives for invoking services that respect given security requirements. Security-critical code is enclosed in policy framings with a possibly nested, local scope. Policy framings enforce safety and liveness properties of execution histories. The actual histories that can occur at runtime are over-approximated by a type and effect system. These approximations aremodel-checked to verify policy framings within their scopes. This allows for removing any runtime execution monitor, and for selecting those services that match the security requirements.
DSI: A Fully Distributed Spatial Index for Location-Based Wireless Broadcast Services
Authors: Wang-Chien Lee, Baihua Zheng
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Recent announcement of the MSN Direct Service has demonstrated the feasibility and industrial interest in utilizing wireless broadcast for pervasive information services. To support location-based services in wireless data broadcast systems, a distributed spatial index (called DSI) is proposed in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that facilitates multiple search paths to be naturally mixed together by sharing links. Moreover, DSI is very resilient in error-prone wireless communication environments. Search algorithms for two classical location-based queries, window queries and kNN queries, based on DSI are presented. Performance evaluation of DSI shows that DSI significantly outperforms R-tree and Hilbert Curve Index, two state-of-the-art spatial indexing techniques for wireless data broadcast.
Registration of point cloud data from a geometric optimization perspective
Authors: Niloy J. Mitra, Natasha Gelfand, Helmut Pottmann, Leonidas Guibas
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

We propose a framework for pairwise registration of shapes represented by point cloud data (PCD). We assume that the points are sampled from a surface and formulate the problem of aligning two PCDs as a minimization of the squared distance between the underlying surfaces. Local quadratic approximants of the squared distance function are used to develop a linear system whose solution gives the best aligning rigid transform for the given pair of point clouds. The rigid transform is applied and the linear system corresponding to the new orientation is build. This process is iterated until it converges. The point-to-point and the point-to-plane Iterated Closest Point (ICP) algorithms can be treated as special cases in this framework. Our algorithm can align PCDs even when they are placed far apart, and is experimentally found to be more stable than point-to-plane ICP. We analyze the convergence behavior of our algorithm and of point-to-point and point-to-plane ICP under our proposed framework, and derive bounds on their rate of convergence. We compare the stability and convergence properties of our algorithm with other registration algorithms on a variety of scanned data.
Transformation of UML Models for Service-Oriented Software Architectures
Authors: Ricardo J. Machado, Joao M. Fernandes, Paula Monteiro, Helena Rodrigues
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

The main aim of this paper is to present how to transform user requirements models into a software architecture for mobile applications. The technique (called "4SRS") is essentially based on the mapping of UML use case diagrams into UML object diagrams. UML sequence, activity, and state diagrams and other artifacts can also be considered within the transformation decisions. The applicability of this technique is illustrated by presenting some results from an e-government mobile application. The development of mobile applications typically follow a service-oriented approach. A service is a software entity running on one or more machines and providing a particular type of function to a priori unknown clients. These services must communicate with each other, whose combination makes up a service-oriented architecture. The communication can involve either simple data passing or it could involve two or more services coordinating some activity. Some means of connecting services to each other is needed, so workflow is a critical part of making services effective. When those services react to changes on user context, application are context-aware. For mobile applications, the definition of the underlying service-oriented software architecture must consider the services themselves as user requirements, as well as the mobile operators entry-points and the final clients interfaces, and use them to characterize the platform.
Driver State Monitor from DELPHI
Authors: N. Edenborough, R. Hammoud, A. Harbach, A. Ingold, B. Kisacanin, P. Malawey, T. Newman, G. Scharenbroch, S. Skiver, M. Smith, A. Wilhelm, G. Witt, E. Yoder, H. Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present an automotive-grade, real-time, vision-based Driver State Monitor. Upon detecting and tracking the driverýs facial features, the system analyzes eye-closures and head pose to infer his/her fatigue or distraction. This information is used to warn the driver and to modulate the actions of other safety systems. The purpose of this monitor is to increase road safety by preventing drivers from falling asleep or from being overly distracted, and to improve the effectiveness of other safety systems.
An Econometric Analysis of Inventory Turnover Performance in Retail Services
Authors: Vishal Gaur, Marshall L. Fisher, Ananth Raman
Venue: Management Science (2005)

Inventory turnover varies widely across retailers and over time. This variation undermines the usefulness of inventory turnover in performance analysis, benchmarking, and working capital management. We develop an empirical model using financial data for 311 publicly listed retail firms for the years 1987-2000 to investigate the correlation of inventory turnover with gross margin, capital intensity, and sales surprise (the ratio of actual sales to expected sales for the year). The model explains 66.7% of the within-firm variation and 97.2% of the total variation (across and within firms) in inventory turnover. It yields an alternative metric of inventory productivity, adjusted inventory turnover, which empirically adjusts inventory turnover for changes in gross margin, capital intensity, and sales surprise, and can be applied in performance analysis and managerial decision making. We also compute time trends in inventory turnover and adjusted inventory turnover, and find that both have declined in retailing during the 1987-2000 period.
An annotation system for enhancing quality of natural language processing
Authors: Hideo Watanabe, Katashi Nagao, Michael C. McCord, Arendse Bernth
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Natural language processing (NLP) programs are confronted with various difficulties in processing HTML and XML documents, and have the potential to produce better results if linguistic information is annotated in the source texts. We have therefore developed the Linguistic Annotation Language (or LAL), which is an XML-compliant tag set for assisting natural language processing programs, and NLP tools such as parsers and machine translation programs which can accept LAL-annotated input. In addition, we have developed a LAL-annotation editor which allows users to annotate documents graphically without seeing tags. Further, we have conducted an experiment to check the translation quality improvement by using LAL annotation.
Usage patterns of FriendZone: mobile location-based community services
Authors: Asaf Burak, Taly Sharon
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

How do users accept, and use, for a long period of time, location based services (LBS) on their mobile handsets? FriendZone, a suite of mobile Location-based Community Services has been launched. The services included Instant Messaging and Locator (IM&L), Location-based Chat, and Anonymous Instant Messaging (AIM), with supporting Privacy Management.A 21 month usage survey of more than 47,000 users, most of them young adults, followed by user interviews, is reported herein. The results indicate that AIM is the most popular and used service, more than IM&L, with lower use of Chat. The interviews showed that young adults are interested in immediate stimulations and therefore use AIM, which could lead them to face-to-face meetings. In addition, IM&L is limited to one carrier and hence is less attractive. Lastly, young adults using this service are more interested in sharing their location than in their privacy.
Algorithm 840: computation of grid points, quadrature weights and derivatives for spectral element methods using prolate spheroidal wave functions---prolate elements
Authors: John P. Boyd
Venue: ACM Transactions on Mathematical Software (TOMS) (2005)

High order domain decomposition methods using a basis of Legendre polynomials, known variously as &ldquo;spectral elements&rdquo; or &ldquo;p-type finite elements,&rdquo; have become very popular. Recent studies suggest that accuracy and efficiency can be improved by replacing Legendre polynomials by prolate spheroidal wave functions of zeroth order. In this article, we explain the practicalities of computing all the numbers needed to switch bases: the grid points xj, the quadrature weights wj, and the values of the prolate functions and their derivatives at the grid points. The prolate functions themselves are computed by a Legendre-Galerkin discretization of the prolate differential equation; this yields a symmetric tridiagonal matrix. The prolate functions are then defined by Legendre series whose coefficients are the eigenfunctions of the matrix eigenproblem. The grid points and weights are found simultaneously through a Newton iteration. For large N and c, the iteration diverges from a first guess of the Legendre-Lobatto points and weights. Fortunately, the variations of the xj and wj with c are well-approximated by a symmetric parabola over the whole range of interest. This makes it possible to bypass the continuation procedures of earlier authors.
Could Enough Samples be more Important than Better Designs for Computer Experiments?
Authors: Longjun Liu
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

A study was conducted to compare fifteen approaches to improve Latin hypercube designs for computer experiments, based on simulation tests and statistical analyses ANOVA. Kriging models were employed to approximate twenty test functions. Validation at 5000 or 10,000 points was conducted to find prediction errors. The results show that there are statistically significant differences between the approximatin results of employing different designs, but more often the difference is not significant. In most cases, the number of runs or the sample size has stronger impact on the accuracy than do different designs. When the dimension is low, a small size increment can often reduce more error than do "better designs." To get the desired precision by one-stage method, enough samples may be needed regardless what design is used. Sample size determination may need much more attention for computer experiments.
L2(H1 Norm A PosterioriError Estimation for Discontinuous Galerkin Approximations of Reactive Transport Problems
Authors: Shuyu Sun, Mary F. Wheeler
Venue: Journal of Scientific Computing (2005)

Explicita posteriori residual type error estimators in L2(H1) norm are derived for discontinuous Galerkin (DG) methods applied to transport in porous media with general kinetic reactions. They are flexible and apply to all the four primal DG schemes, namely, Oden--Babu¿ka--Baumann DG (OBB-DG), non-symmetric interior penalty Galerkin (NIPG), symmetric interior penalty Galerkin (SIPG) and incomplete interior penalty Galerkin (IIPG). The error estimators use directly all the available information from the numerical solution and can be computed efficiently. Numerical examples are presented to demonstrate the efficiency and the effectivity of these theoretical estimators.
Towards usable Web privacy and security
Authors: Lorrie Faith Cranor
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

Internet users now rely on a whole arsenal of tools to protect their security and privacy. Experts recommend that computer users install personal firewalls, anti-virus software, spyware blockers, spam filters, cookie managers, and a variety of other tools to keep themselves safe. Users are told to pick hard-to-guess passwords, use a different password at every Web site, and not to write any of their passwords down. They are told to read privacy policies before providing personal information to Web sites, look for lock icons before typing in a credit card number, refrain from opening email attachments from people they don't know, and even to think twice about opening email attachments from people they do know. With so many do's and don'ts, it is not surprising that much of this advice is ignored. In this talk I will highlight usability problems that make it difficult for people to protect their privacy and security on the Web, and I will discuss a number of approaches to addressing these problems.
Book review: Theoretical Aspects of Reasoning about Knowledge
Venue: Issue 102 (October 1987) (1987)

This volume is a collection of 25 papers and four abstracts presented at an interdisciplinary conference held at Monterery, California in March, 1986. To their credit, the conference organizers selected high quality papers that cover a range of topics affected by knowledge reasoning. The fields represented at the conference included philosophy, linguistics, artificial intelligence (Al), economics, and theoretical computer science.
Research in computational linguistics: New York University
Authors: Sager, Grishman
Venue: Issue 79 (January 1982) (1982)

The Linguistic String Project and Computer Science Department of New York University are engaged in a long-term program of basic and applied research in computational linguistics, aimed at the automated retrieval and processing of information in natural language scientific and technical texts. Over the past fifteen years we have developed a large array of resources, including a broad-coverage English grammar, dictionaries, a program for parsing and transformational analysis, and various utilities for managing grammar, dictionary, and text files. The grammar and parsing program have been incorporated into two main application systems, one for the information formatting of natural language medical texts, the other for natural language data base retrieval.
SELECTED AI-RELATED DISSERTATIONS
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 100 (April 1987) (1987)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.The online file includes abstracts, which are not published in this listing, but the citations below do include the DAI reference for finding the abstract in the published DAI. Other elements of the citation are author; university, degree, and, if available, number of pages; title; UM order number and year-month of DAI; and DAI subject category chosen by the author of the dissertation. References are sorted first by the initial DAI subject category and second by the author. In addition the database includes masters abstracts, denoted by MAI (Masters Abstracts International) instead of DAI as the reference to the abstract in the published MAI.