ppxscal/embedding_network huggingface dataset:
Path Planning and Following Algorithms in an Indoor Navigation Model for Visually Impaired
Authors: Hua Wu, Alan Marshall, Wai Yu
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

This paper describes, path planning and following algorithms for use in indoor navigation for the blind and visually impaired. Providing indoor navigational assistance for this type of users presents additional challenges not faced by conventional guidance systems, due to the personal nature of the interactions. The algorithms are part of an overall Indoor Navigation Model that is used to provide assistance and guidance in unfamiliar indoor environments. Path planning uses the A* and Dijkstra's shortest path algorithms, to operate on an "Intelligent Map, that is based on a new data structure termed "cactus tree which is predicated on the relationships between the different objects that represent an indoor environment. The paths produced are termed "virtual hand rails, which can be used to dynamically plan a path for a user within a region. The path following algorithm is based on dead reckoning, but incorporates human factors as well as information about the flooring and furnishing structures along the intended planned path. Experimental and simulating results show that the guiding/navigation problem becomes a divergent mathematical problem if the positional information offered by the positioning and tracking systems does not reach a certain requirement. This research explores the potential to design an application for the visually impaired even when todate "positioning and tracking' system cannot offer reliable position information that highly required by this type of application.
Identifying the User in Healthcare Information Systems Resear
Authors: Alexander J. Jr McLeod, Jan Guynes Clark
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Applying IS research to the healthcare context is an important endeavor. However, IS researchers must be cautious about identifying individual roles, the context of the setting, and postulating generalizability [1-4]. Much of IS theory is rooted within the organization, its business processes, and stakeholders. IS researchers need to understand the healthcare setting before they can appropriately apply IS theory. Hospitals, emergency rooms, and laboratories are very different from the normal "business" environment, and "healthcare users" vary considerably in the role they play. Obviously, if we are studying the wrong person, or group of people, we cannot expect to get relevant results. In order to alleviate confusion regarding who is the user in healthcare IS research, we provide examples of several healthcare scenarios, perform a simplified stakeholder analysis in each scenario, and identify the stakeholder and/or user in each scenario.
Program evolvability under environmental variations and neutrality
Authors: Tina Yu
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Biological organisms employ various mechanisms to cope with the dynamic environments they live in. One recent research reported that depending on the rates of environmental variation, populations evolve toward genotypes in different regions of the neutral networks to adapt to the changes. Inspired by that work, we used a genetic programming system to study the evolution of computer programs under environmental variation. Similar to biological evolution, the genetic programming populations exploit neutrality to cope with environmental fluctuations and evolve evolvability. We hope this work sheds new light on the design of open-ended evolutionary systems which are able to provide consistent evolvability under variable conditions.
One Mesh Model Simplification Method Based on Shape Transform of Triangles
Authors: Jia-xin Chen, Hai-he Hu
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Mesh simplification is an efficient method of processing complex models by computer. In this paper, we have emphatically analyzed and researched the problem of the sharp changes of visual features because of not fully considering the visual effect during the process of simplification, and the problem of easily and wrongly choosing the collapse edge caused by the error accumulation of the simplification algorithm, the paper has proposed a mesh simplification algorithm based on the shape transform of triangles. In the algorithm, we make the length of the edge and the difference between the internal angles of the newly created triangle and equilateral triangle's as weight genes when computing the edge collapse cost, and consider the factor of area of triangles around the vertex when computing the quadric error metrics of the vertex, and find the average value of quadric error metrics for each vertex as the vertex's error metrics. The algorithm resolves the above problems effectively, avoiding the problems of causing narrow triangles and producing holes on the surface of the model which are made by premature simplification of too large area of triangles around the vertex. By experiment validating and analyzing contrastively, it proves the validity of the algorithm.
Automatic Web Page Categorization using Principal Component Analysis
Authors: Richong Zhang, Michael Shepherd, Jack Duffy, Carolyn Watters
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Today's search engines retrieve tens of thousands of web pages in response to fairly simple query articulations. These pages are retrieved on the basis of the query terms occurring in the web pages and the popularity of the web pages as per the link structure of the web. However, these search engines do not take into account the broader information need of the user, such as the task in which the user is involved. This research investigates the automatic categorization of web pages using Principal Component Analysis. The research focuses on user tasks that involve searching for web pages containing health information, education information or shopping information. Initial results are encouraging with recall and precision values slightly in excess of 80%.
Ontology-based crowd simulation for normal life situations
Authors: D. C. de Paiva, R. Vieira, S. R. Musse
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper presents the urban environment model (UEM), a novel approach through which a large number of virtual humans can populate a urban space by considering normal life situations. Using this model, the semantic is included in the virtual space considering normal life actions according to different agent profiles distributed in time and space. For instance, children going to the school and adults going to work at usual times. Leisure and shopping activities are also considered. Agent profiles and their actions are also described using UEM. Besides presenting the details of the model, we present its integration into a crowd simulator whose main goal is to provide realistic and coherent population behaviors into urban environments. The results show that urban environments can be populated in a more realistic way by using UEM, escaping from the normal impression we have in such kind of system that virtual people are walking in a random way by predefined paths in the virtual space.
Performing a literature review
Authors: L. E. Reed
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

This report is intended as a guide for teachers and engineering students when conducting research is part of course-work requirements. Discussion includes a description of a literature search, the purpose of a literature review finding sources (especially for engineering) and a general strategy to help conduct an efficient and productive literature search. Using tools such as this report, students can become more pro-active about their research projects. Teachers can use this report, among other tools, to begin dialog with their students about expectations for research assignments. Two key steps in a literature search are: (i) finding sources; and (ii) synthesizing information. Each of these is addressed in two of the major sections in this report, as well as how the literature search relates to the entire research process. Then pertinent information is repeated in the summary section for convenience. An annotated reference list is included for ease in finding other useful guidance. 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
Tor: the second-generation onion router
Authors: Roger Dingledine, Nick Mathewson, Paul Syverson
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

We present Tor, a circuit-based low-latency anonymous communication service. This second-generation Onion Routing system addresses limitations in the original design by adding perfect forward secrecy, congestion control, directory servers, integrity checking, configurable exit policies, and a practical design for location-hidden services via rendezvous points. Tor works on the real-world Internet, requires no special privileges or kernel modifications, requires little synchronization or coordination between nodes, and provides a reasonable tradeoff between anonymity, usability, and efficiency. We briefly describe our experiences with an international network of more than 30 nodes. We close with a list of open problems in anonymous communication.
Interactive presentation: A decoupled architecture of processors with scratch-pad memory hierarchy
Authors: A. Milidonis, N. Alachiotis, V. Porpodas, H. Michail, A. P. Kakarountas, C. E. Goutis
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We present a decoupled architecture of processors with a memory hierarchy of only scratch-pad memories, and a main memory. The decoupled architecture also exploits the parallelism between address computation and processing the application data. The application code is split in two programs the first for computing the addresses of the data in the memory hierarchy and the second for processing the application data. The first program is executed by one of the decoupled processors called Access which uses compiler methods for placing data in the memory hierarchy. In parallel, the second program is executed by the other processor called Execute. The synchronization of the memory hierarchy and the Execute processor is achieved through simple handshake protocol. The Access processor requires strong communication with the memory hierarchy which strongly differentiates it from traditional uniprocessors. The architecture is compared in performance with the MIPS IV architecture of SimpleScalar and with the existing decoupled architectures showing its higher normalized performance. Experimental results show that the performance is increased up to 3.7 times. Compared with MIPS IV the proposed architecture achieves the above performance with insignificant overheads in terms of area.
Adaptive Index Utilization in Memory-Resident Structural Joins
Authors: Bingsheng He, Qiong Luo, Byron Choi
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

We consider adaptive index utilization as a fine-grained problem in autonomic databases in which an existing index is dynamically determined to be used or not in query processing. As a special case, we study this problem for structural joins, the core operator in XML query processing, in the main memory. We find that index utilization is beneficial for structural joins only under certain join selectivity and distribution of matching elements. Therefore, we propose adaptive algorithms to decide whether to use an index probe or a data scan for each step of matching during the processing of a structural join operator. Our adaptive algorithms are based on the history, the look-ahead information, or both. We have developed a cost model to facilitate this adaptation and have conducted experiments with both synthetic and real-world data sets. Our results show that adaptively utilizing indexes in a structural join improves the performance by taking advantage of both sequential scans and index probes.
Development of rules for controlling the HLsyn speech synthesizer
Authors: H. M. Hanson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In this paper we describe the development of rules to drive a quasi-articulatory speech synthesizer, HLsyn. HLsyn has 13 parameters, which are mapped to the parameters of a formant synthesizer. Its small number of parameters combined with the computational simplicity of a formant synthesizer make it a good basis for a text-to-speech system. An overview of the rule-driven system, called VHLsyn, is presented. The system assumes a phonetic string as input, and produces HLsyn parameter tracks as output. These parameter tracks are then used by HLsyn to produce synthesized speech. Previous work to improve the synthesis of consonants and suprasegmental effects is described, and is shown to improve the quality of the output speech. The improvements include refinement of release characteristics of stop consonants, methods for control of vocal-fold parameters for voiced and voiceless consonants, and rules for timing and intonation.
Back-off method for n-gram smoothing based on binomial posteriori distribution
Authors: T. Kawabata, M. Tamoto
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The n-gram language model is powerful for treating natural spoken language, however it requires large amounts of spoken language corpus to estimate reliable model parameters. To estimate n-gram probabilities from sparse data, Katz's (1987) back-off smoothing method is promising. However, this approach is sometimes unstable because it uses singleton heuristics based on Turing's formula. This paper proposes a new back-off method based on binomial posteriori distribution of n-gram probabilities, which achieves stable and more effective n-gram smoothing using a sophisticated calculation formula with no heuristics.
The Erd&#x0151;s&#x2013;P&#x00f3;sa Property For Long Circuits
Authors: Etienne Birmel&#x00e9;, J. Adrian Bondy, Bruce A. Reed
Venue: Combinatorica (2007)

We show that, for every l, the family $$\mathcal{F}_{l}$$ of circuits of length at least l satisfies the Erd&#x0151;s&#x2013;P&#x00f3;sa property, with f(k)=13l(k&#x2212;1)(k&#x2212;2)+(2l+3)(k&#x2212;1), thereby sharpening a result of C. Thomassen. We obtain as a corollary that graphs without k disjoint circuits of length l or more have tree-width O(lk2).
A hierarchical video coder with cache motion information
Authors: K. K. Truong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper presents a new video coder that operates below 16 kbps and other rates below 64 kbps. The coder uses a quadtree-based hierarchical structure and a distortion measure that controls which levels of the hierarchy are selected. This paper also introduces a cache motion predictor that is based on the principles of designing cache memory. The motion cache can significantly reduce the bit-rate in coding motion vectors while also reducing the computational complexity when compared to the full-search block matching algorithm. The 10 frame/sec QCIF color Miss America sequence was coded with an average Y-PSNR of 35.52 dB at 16 kbps.
Tork: A Variable-Hop Overlay for Heterogeneous Networks
Authors: Alan Brown, John Buford, Mario Kolberg
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We present a new variable-hop peer-to-peer overlay that combines active stabilization and opportunistic maintenance to provide overlay nodes with a large range of hop-count versus peer bandwidth capabilities. Because of the variable-hop design, Tork is suitable for use in large-scale heterogeneous peer-to-peer networks where peers have a range of bandwidth capacities. For high-bandwidth peers Tork has O(1)-hop performance, and for low-bandwidth, most likely mobile peers, Tork has multi-hop performance. We further show that mapping overlay messaging to multi-destination routing in the underlay reduces Tork message overhead by up to 35%.
Warped Document Image Restoration Using Shape-from-Shading and Physically-Based Modeling
Authors: Li Zhang, Chew-Lim Tan
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

With the pervasive use of handheld digital devices such as camera phones and PDAs, people have started to capture images as a way of recording information. However, due to the non-planar geometric shapes of some documents such as thick bound book pages, rolled scripts, etc, the captured images are often warped. This causes problems for many document analysis and retrieval tasks. This paper proposes a de-warping approach that first reconstructs the surface using a Shape-from-Shading (SFS) technique and then flattens the warped surface using a physically-based deformable model. The SFS method is based on the viscosity framework and considers perspective projection under oblique light source. The recovered surface is represented as a triangular mesh and is restored to its planar state through a numerical integration process. We have tested the proposed approach on both synthetic and real images. The synthetic images are mainly used to evaluate the SFS method and the results are compared with those of a prior SFS method. The reconstructed surfaces of real document images are also compared with the actual shapes captured using a 3D scanner and the restored images are evaluated with those obtained from range-scanned surface shapes.
On the use of non-causal filters for wideband adaptive sensor array processing
Authors: P. C. E. Bennett
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Wideband multi-sensor systems require frequency selective weights, as opposed to complex multipliers, on each channel. The number of computations and the system performance are dependent on the FIR filter length necessitating efficient beamforming strategies. In this paper data is presented which suggests that an extension of Van Trees' (1968) work on non-causal filter-and-delay structures to a multi-sensor environment offers performance improvements over the use of purely causal filters of identical length.
Fast and effective kernels for relational learning from texts
Authors: Alessandro Moschitti, Fabio Massimo Zanzotto
Venue: Proceedings of the 24th international conference on Machine learning (2007)

In this paper, we define a family of syntactic kernels for automatic relational learning from pairs of natural language sentences. We provide an efficient computation of such models by optimizing the dynamic programming algorithm of the kernel evaluation. Experiments with Support Vector Machines and the above kernels show the effectiveness and efficiency of our approach on two very important natural language tasks, Textual Entailment Recognition and Question Answering.
Scaling and Continuous Availability in Database Server Clusters through Multiversion Replication
Authors: Kaloian Manassiev, Cristiana Amza
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

In this paper, we study replication techniques for scaling and continuous operation for a dynamic content server. Our focus is on supporting transparent and fast reconfiguration of its database tier in case of overload or failures. We show that the data persistence aspects can be decoupled from reconfiguration of the database CPU. A lightweight in-memory middleware tier captures the typically heavyweight read-only requests to ensure fle xible database CPU scaling and fail-over. At the same time, updates are handled by an on-disk database back-end that is in charge of making them persistent. Our measurements show instantaneous, seamless reconfiguration in the case of single node failures within the fle xible in-memory tier for a web site running the most common, shopping, workload mix of the industry-standard ecommerce TPC-W benchmark. At the same time, a 9-node in-memory tier improves performance during normal operation over a stand-alone InnoDB on-disk database backend. Throughput scales by factors of 14.6, 17.6 and 6.5 for the browsing, shopping and ordering mixes of the TPC-W benchmark, respectively.
A Simplification to Support Vector Machine for the Second Training
Authors: Jinglong Fang, Shuo Chen, Zhigeng Pan, Yigang Wang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

For complicated recognition problem, the number of support vectors is large and recognition speed is low, because some sample were divided into section by error this time. To solve this problem, a method is bought to simplify the support vector machines based the minimal misestimate margin idea. Experiments show that this new support vector machine not only reduces the number of support vectors and recognition time but also has the same accuracy as (even better than) traditional support vector machine.
MulVAL: a logic-based network security analyzer
Authors: Xinming Ou, Sudhakar Govindavajhala, Andrew W. Appel
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

To determine the security impact software vulnerabilities have on a particular network, one must consider interactions among multiple network elements. For a vulnerability analysis tool to be useful in practice, two features are crucial. First, the model used in the analysis must be able to automatically integrate formal vulnerability specifications from the bug-reporting community. Second, the analysis must be able to scale to networks with thousands of machines. We show how to achieve these two goals by presenting MulVAL, an end-to-end framework and reasoning system that conducts multihost, multistage vulnerability analysis on a network. MulVAL adopts Datalog as the modeling language for the elements in the analysis (bug specification, configuration description, reasoning rules, operating-system permission and privilege model, etc.). We easily leverage existing vulnerability-database and scanning tools by expressing their output in Datalog and feeding it to our MulVAL reasoning engine. Once the information is collected, the analysis can be performed in seconds for networks with thousands of machines. We implemented our framework on the Red Hat Linux platform. Our framework can reason about 84% of the Red Hat bugs reported in OVAL, a formal vulnerability definition language. We tested our tool on a real network with hundreds of users. The tool detected a policy violation caused by software vulnerabilities and the system administrators took remediation measures.
At-speed test for path delay faults using practical techniques
Authors: Wangqi Qiu, Jing Wang, Xiang Lu
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

To detect the smallest delay faults at a fault site, the longest path(s) through it must be tested at full speed. Most existing test generation tools are either inefficient in automatically identifying the longest testable paths due to the high computational complexity or do not support at-speed test using existing practical design-for-testability structures, such as scan design. In this work a test generation methodology for scan-based synchronous sequential circuits is presented, under two at-speed test strategies used in industry. The two strategies are compared and the test generation efficiency is evaluated on the ISCAS89 benchmark circuits.