ppxscal/embedding_network huggingface dataset:
Building query optimizers for information extraction: the SQoUT project
Authors: Alpa Jain, Panagiotis Ipeirotis, Luis Gravano
Venue: ACM SIGMOD Record (2009)

Text documents often embed data that is structured in nature. This structured data is increasingly exposed using information extraction systems, which generate structured relations from documents, introducing an opportunity to process expressive, structured queries over text databases. This paper discusses our SQoUT1 project, which focuses on processing structured queries over relations extracted from text databases. We show how, in our extraction-based scenario, query processing can be decomposed into a sequence of basic steps: retrieving relevant text documents, extracting relations from the documents, and joining extracted relations for queries involving multiple relations. Each of these steps presents different alternatives and together they form a rich space of possible query execution strategies. We identify execution efficiency and output quality as the two critical properties of a query execution, and argue that an optimization approach needs to consider both properties. To this end, we take into account the userspecified requirements for execution efficiency and output quality, and choose an execution strategy for each query based on a principled, cost-based comparison of the alternative execution strategies.
Extensible authentication protocols for IEEE standards 802.11 and 802.16
Authors: David Q. Liu, Mark Coslow
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

In this paper, the challenges involved in authentication over wireless networks including wireless LANs, IEEE 802.11, and WIMAX, IEEE 802.16 are described. Both IEEE 802.11i and 802.16e support EAP (Extensible Authentication Protocol) for authentication, but do not specify the EAP method required for authentication. This paper examines four different categories of EAP methods: legacy methods such as EAP-MD5 and CHAP, certificate-based authentication methods such as EAP-TLS, EAP-TTLS, and PEAP; password-based authentication methods, such as EAP-LEAP and EAP-FAST; and strong password-based authentication methods such as EAP-SPEKE. The EAP methods are examined with respect to their vulnerabilities as well as their convenience of utilization. The legacy methods do not meet the criteria established by RFC 4017 to be used for wireless communication. The conclusion is that although certificate-based authentication methods such as EAP-TLS which is specifically mentioned in 802.16e have the strongest security, these methods are not very convenient to use. Password-based authentication methods, on the other hand, are very convenient to use, but provide the least amount of security. The strong password-based authentication methods may be a good alternative to certificate-based authentication, providing a strong level of security while being convenient to use as well as providing authentication of the user as well as the device.
Harmonic 1-form based skeleton extraction from examples
Authors: Ying He, Xian Xiao, Hock-Soon Seah
Venue: Graphical Models (2009)

This paper presents a method to extract skeletons using examples. Our method is based on the observation that many deformations in real-world applications are isometric or near isometric. By taking advantage of the intrinsic property of harmonic 1-form, i.e., it is determined by the metric and independent of the resolution and embedding, our method can easily find a consistent mapping between the reference and example poses which can be in different resolutions and triangulations. We first construct the skeleton-like Reeb graph of a harmonic function defined on the given poses. Then by examining the changes of mean curvatures, we identify the initial locations of joints. Finally we refine the joint locations by solving a constrained optimization problem. We demonstrate the efficacy of the proposed framework by pose space deformation, skeleton transfer, shape segmentation and pose-invariant shape signature.
The Tinderbox Way, 1st edition
Authors: Mark Bernstein
Venue:  (2007)

Tinderbox is a tool for notes, a personal content management assistant. The Tinderbox Way takes a close look at Tinderbox and its underlying ideas, exploring not just the program's mechanics but also its design and its spirit. From the elements of writing more effective notes to the frontiers of information farming, from the classroom and conference hall to the research laboratory, The Tinderbox Way explores a new approach to working with and representing interlinked ideas.
Link Probability Based Opportunistic Routing Metric in Wireless Network
Authors: Yanhua Li, Yuan-an Liu, Pengkui Luo
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Opportunistic routing is a new design trend of wireless network routing protocol. It takes good advantages of the broadcast nature of wireless network. The source can use multiple potential paths to deliver the packets to the destination. The routing metric used for selecting the forwarder lists is very important for designing the opportunistic routing scheme. In this paper, we propose a novel routing metric STR (successful transmission rate) to choose the forwarder list, which is based on total successful transmission rate. It considers multi-links contribution, instead of one "best" link information used in ETX. We also introduce the fair opportunistic routing with linear coding (FORLC) scheme using our STR metric. The extensive simulation results show that the opportunistic routing with our STR metrics can always outperform ETXbased ExOR scheme. The maximum benefit of the throughput using the STR based FORLC can be 30% more than the ETX based MORE. It also has at most 10 times throughputs than traditional routing protocol.
Pride and Prejudice: (The Vasa)
Authors: George V. Neville-Neil
Venue: Queue (2009)

What can software engineers learn from shipbuilders?
A platform for virtual museums with personalized content
Authors: B. Bonis, J. Stamos, S. Vosinakis, I. Andreou, T. Panayiotopoulos
Venue: Multimedia Tools and Applications (2009)

Presentation of content is an important aspect of today's virtual reality applications, especially in domains such as virtual museums. The large amount and variety of exhibits in such applications raise a need for adaptation and personalization of the environment. This paper presents a content personalization platform for Virtual Museums, which is based on a semantic description of content and on information implicitly collected about the users through their interactions with the museum. The proposed platform uses stereotypes to initialize user models, adapts user profiles dynamically and clusters users into similar interest groups. A science fiction museum has been set up as a case study for this platform and an evaluation has been carried out.
Application of Ant Colony Algorithm in PID Parameter Optimization for Mining Hoist Direct Torque Control System
Authors: Xian-Min Ma
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

The mining hoist is a key transport equipment to transfer the workers and coal between the mining well and the ground. In the traditional mining hoist direct torque control system, there are some disadvantages such as torque pulsation in the low speed range, which is very dangerous to safety production. In this paper, a novel control strategy using Ant Colony Algorithm (ACA) to optimize the parameters of the speed PID controller is proposed to overcome the shortcomings, the algorithm based on the direct torque control model is obtained to meet real time control requirement, and the ACA optimization steps are described, the speed PID controller parameters are debugged and optimized using ACA. The theory analysis and simulation results indicate that the torque ripple of the system is observably reduced, and the system speed overshoot is small after the parameters of the speed PID controller are optimized with ACA, so the stability of the mining hoist direct torque control system is improved. 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
Determining the fault status of a component and its readiness, with a distributed automotive application
Authors: Jonas Biteus, Mattias Nyberg, Erik Frisk, Jan slund
Venue: Engineering Applications of Artificial Intelligence (2009)

In systems using only single-component tests, the fault status of a component is ready if a test only supervising the component has been evaluated. However, if plausibility tests that supervise multiple components are used, then a component can be ready before all tests supervising the component have been evaluated. Based on test results, this paper contributes with conditions on when a component is ready. The conditions on readiness are given for both centralized and distributed systems and are here applied to the distributed diagnostic system in an automotive vehicle.
Sizing the horizon: the effects of chart size and layering on the graphical perception of time series visualizations
Authors: Jeffrey Heer, Nicholas Kong, Maneesh Agrawala
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

We investigate techniques for visualizing time series data and evaluate their effect in value comparison tasks. We compare line charts with horizon graphs - a space-efficient time series visualization technique - across a range of chart sizes, measuring the speed and accuracy of subjects' estimates of value differences between charts. We identify transition points at which reducing the chart height results in significantly differing drops in estimation accuracy across the compared chart types, and we find optimal positions in the speed-accuracy tradeoff curve at which viewers performed quickly without attendant drops in accuracy. Based on these results, we propose approaches for increasing data density that optimize graphical perception.
A genetic algorithm for the proportionate multiprocessor open shop
Authors: Marie E. Matta
Venue: Computers and Operations Research (2009)

The multiprocessor open shop (MPOS) scheduling problem is NP-complete, a category of hard combinatorial optimization problems that have not received much attention in the literature. In this work, a special MPOS-a proportionate one-is introduced for the first time. Two original mixed integer programming formulations for the proportionate MPOS are developed and their complexity is discussed. Due to the complexity of the MPOS, this paper develops a compu-search methodology (a genetic algorithm (GA)) to schedule the shop with the objective of minimizing the makespan. In this novel GA, a clever chromosome representation of a schedule is developed that succinctly encodes a schedule of jobs across multiple stages. The innovative design of this chromosome enables any permutation of its genes to yield a feasible solution. This simple representation of an otherwise very complex schedule enables the genetic operators of crossover and mutation to easily manipulate a schedule as the algorithm iteratively searches for better schedules. A testbed of difficult instances of the problem are created to evaluate the performance of the GA. The solution for each instance is compared with a derived lower bound. Computational results reveal that the algorithm performs extremely well, demonstrating its potential to efficiently schedule MPOS problems. More importantly, successful experiments on large-scale problem instances suggest the readiness of the GA for industrial use.
Drupal Multimedia, 1st edition
Authors: Aaron Winborn
Venue:  (2008)

Information for Drupal administrators and site developers on all aspects of multimedia in Drupal. This book will provide information for administrators and professional site developers who are required to embed multimedia into a Drupal site. The reader needs basic knowledge of Drupal operation, but no experience of how Drupal handles multimedia items is expected.
Guarding curvilinear art galleries with vertex or point guards
Authors: Menelaos I. Karavelas, Csaba D. Tóth, Elias P. Tsigaridas
Venue: Computational Geometry: Theory and Applications (2009)

We study a variant of the classical art gallery problem, where an art gallery is modeled by a polygon with curvilinear sides. We focus on piecewise-convex and piecewise-concave polygons, which are polygons whose sides are convex and concave arcs, respectively. It is shown that for monitoring a piecewise-convex polygon with n>=2 vertices, @?2n3@? vertex guards are always sufficient and sometimes necessary. We also present an algorithm for computing at most @?2n3@? vertex guards in O(nlogn) time and O(n) space. For the number of point guards that can be stationed at any point in the polygon, our upper bound @?2n3@? carries over and we prove a lower bound of @?n2@?. For monitoring a piecewise-concave polygon with n>=3 vertices, 2n-4 point guards are always sufficient and sometimes necessary, whereas there are piecewise-concave polygons where some points in the interior are hidden from all vertices, hence they cannot be monitored by vertex guards. We conclude with bounds for some special types of curvilinear polygons.
A Latent Semantic Analysis Based Method of Getting the Category Attribute of Words
Authors: Zongli Jiang, Changdong Lu
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Current search engines have two problems, losing useful information and including useless information. These two problems are aroused by the keyword matching retrieval model, which is adopted by almost all search engines. We introduce the conception of category attribute of a word. According to the category attribute of a word, the useless results can be removed from the search results and the retrieval efficiency will be improved. A latent semantic analysis based method of getting the category attribute of the word is presented in this paper, which is proved to be effective by experiment. Latent semantic analysis is a method that can discover the underlying semantic relation between words and documents. Singular value decomposition is used in latent semantic analysis to analyze the words and documents and get the semantic relation finally.
An Open Framework for Integrating Widely Distributed Hypermedia Resources
Venue: Proceedings of the 1996 International Conference on Multimedia Computing and Systems (1996)

The success of the WWW has served as an illustration of how hypermedia can enhance access to large repositories of distributed information. However, current distributed hypermedia systems offer limited hypermedia functionality which cannot easily be augmented or simply applied to existing applications and data formats. This paper describes a model and prototype, based on the Microcosm system, of a reflexive and extensible distributed hypermedia framework for managing hypermedia application development, sharing and re-use.
Cross-layer optimized wireless multicast for layered media
Authors: Ákos Kovács, István Gódor
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

This paper discusses the maximization of user-perceived quality of layered media in wireless networks. We present a system model and an optimization framework for such networks assuming: (i) the data rates are nested, (ii) the media is multicast, (iii) layered and (iv) the media layer information is available in lower network layers based on cross-layer information. In order to show the general applicability of the proposal, different maximization targets and algorithmic solutions are presented.
Argos, an extensible personal application server
Authors: Arne Munch-Ellingsen, Dan Peder Eriksen, Anders Andersen
Venue: Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware (2007)

Argos is a microkernel based, small-scale or personal middleware container that is extendible through deployment of system services. System services to support development of end user applications in sensor network, pervasive, context-aware and mobile setting have been developed and used to easily allow for application development of user application in this domain. Argos also gives enterprise container type support to user-centric application development, without the complexity and limitations enforced by enterprise containers. Annotations, notifications, reflection, dependency injection and hot deployment are together used to create the Arogs run-time extensible and adaptable personal container.
Highlight Ranking for Broadcast Tennis Video Based on Multi-modality Analysis and Relevance Feedback
Authors: Guangyu Zhu, Qingming Huang, Yihong Gong
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Most of existing work on sports video analysis concentrates on highlight extraction. Few efforts devoted to the important issue as how to organize the extracted highlights which is adapt for the user preference. In this paper, we propose a novel approach to rank the highlights extracted from broadcast tennis video based on multi-modality analysis and relevance feedback. Firstly, visual and auditory features are employed to construct the mid-level representations for the content of broadcast tennis video. Then, the affective features are extracted from mid-level representations and the multiple ranking models are built using nonlinear regression algorithm. Finally, the ranking models are linearly combined to generate the final highlight ranking results. The relevance feedback technique is employed to effectively capture the user interest in visual and auditory attention spaces to adjust the ranking results being suitable to the user preference. The experimental results are encouraging and demonstrate that our approach is effective.
Automatic visual inspection
Authors: Wesley E. Snyder
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The growing popularity of automatic inspection techniques was evidenced by the attendance at a conference on automatic inspection and quality control in Chicago last October. At that conference, several reasons were presented to justify the development and implementation of automatic industrial quality control systems. These include: (1) releasing workers from tedious or repetitive tasks, (2) enabling precise and continuous inspection in inaccessible environments or under hazardous conditions, such as measuring the thickness of hot steel, (3) improving inspection system reliability, and (4) improving inspection system predictability.
An approach on distributed and shared dynamic cache partition
Authors: Lan Dong, Yang Yang
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

In multithreaded processor, many threads compete for the cache resource. Distributed partition method is not adaptive for the situation when cache requirement is greatly fluctuant. Shared dynamic partition need more cost than distributed method. In this paper a hybrid method is proposed which combines the distributed and shared cache partition method. Experiment shows the method leads to high hit rate.
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
Authors: Stanisław Jarecki, Xiaomin Liu
Venue: Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography (2009)

An Oblivious Pseudorandom Function (OPRF) [15] is a two-party protocol between sender S and receiver R for securely computing a pseudorandom function f k (·) on key k contributed by S and input x contributed by R, in such a way that receiver R learns only the value f k (x) while sender S learns nothing from the interaction. In other words, an OPRF protocol for PRF f k (·) is a secure computation for functionality $\mathcal F_{\mathsf{OPRF}}:(k,x)\rightarrow(\perp,f_k(x))$.We propose an OPRF protocol on committed inputs which requires only O(1) modular exponentiations, and has a constant number of communication rounds (two in ROM). Our protocol is secure in the CRS model under the Composite Decisional Residuosity (CDR) assumption, while the PRF itself is secure on a polynomially-sized domain under the Decisional q-Diffie-Hellman Inversion assumption on a group of composite order, where q is the size of the PRF domain, and it has a useful feature that f k is an injection for every k.practical OPRF protocol for an injective PRF, even limited to a polynomially-sized domain, is a versatile tool with many uses in secure protocol design. We show that our OPRF implies a new practical fully-simulatable adaptive (and committed) OT protocol secure without ROM. In another example, this oblivious PRF construction implies the first secure computation protocol of set intersection on committed data with computational cost of O(N) exponentiations where N is the maximum size of both data sets.
Query by example
Authors: Moshé M. Zloof
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

In the last few years we have witnessed a trend to appeal to the non-professional user who has little or virtually no computer or mathematical background.
A new filtering method for chirp spread spectrum
Authors: Yeong-Sam Kim, Jong-Wha Chong
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

In this paper, we propose a new filtering method for performance enhancement of chirp spread spectrum (CSS) in the IEEE 802.15.4a standard. The CSS signals are composed of low- and high-band signals which are alternatively transmitted in time-domain. A new dual-band filtering method proposed in this paper is based on two filters which are designed to be suitable for alternatively received CSS signals and it excludes undesired neighboring band noise. Simulation result shows that the proposed method has better bit error rate (BER) performance than the conventional one.
Why Neighbor-Joining Works
Authors: Radu Mihaescu, Dan Levy, Lior Pachter
Venue: Algorithmica (2009)

We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson&#x2019;s optimal radius bound as a special case and explains many cases where neighbor-joining is successful even when Atteson&#x2019;s criterion is not satisfied. We also provide a proof for Atteson&#x2019;s conjecture on the optimal edge radius of the neighbor-joining algorithm. The strong performance guarantees we provide also hold for the quadratic time fast neighbor-joining algorithm, thus providing a theoretical basis for inferring very large phylogenies with neighbor-joining.