ppxscal/embedding_network huggingface dataset:
Adaptive Model for Integrating Different Types of Associated Texts for Automated Annotation of Web Images
Authors: Hongtao Xu, Xiangdong Zhou, Lan Lin, Mei Wang, Tat-Seng Chua
Venue: Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling (2009)

A lot of texts are associated with Web images, such as image file name, ALT texts, surrounding texts etc on the corresponding Web pages. It is well known that the semantics of Web images are well correlated with these associated texts, and thus they can be used to infer the semantics of Web images. However, different types of associated texts may play different roles in deriving the semantics of Web contents. Most previous work either regard the associated texts as a whole, or assign fixed weights to different types of associated texts according to some prior knowledge or heuristics. In this paper, we propose a novel linear basic expansion-based approach to automatically annotate Web images based on their associated texts. In particular, we adaptively model the semantic contributions of different types of associated texts by using a piecewise penalty weighted regression model. We also demonstrate that we can leverage the social tagging data of Web images, such as the Flickr's Related Tags, to enhance the performance of Web image annotation. Experiments conducted on a real Web image data set demonstrate that our approach can significantly improve the performance of Web image annotation.
RADCAP: an operational parallel processing facility
Authors: James D. Feldman, Louis C. Fulmer
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

An overview is presented of RADCAP, the operational associative array processor (AP) facility installed at Rome Air Development Center (RADC). Basically, this facility consists of a Goodyear Aerospace STARAN associative array (parallel) processor and various peripheral devices, all interfaced with a Honeywell Information Systems (HIS) 645 sequential computer, which runs under the Multics timeshared operating system. The RADCAP hardware and software are described only briefly here since they are detailed in companion papers presented at this conference. The latter part of this paper dwells on the objectives of the RADCAP facility and plans for its use. The STARAN associative parallel processor is a processor based on an associative or content addressable memory and a related ensemble of bit serial processing elements. STARAN is considered to be the first practical associative processor ever produced. This claim of practicality is based on the fact that the design concept for the associative memory of STARAN allows the use of the same high-volume, standard, large-scale integrated (LSI) circuit memory devices that are in widespread use by the computer industry. In fact, every electronic component used in the STARAN associative parallel processor is-available from your local components distributor. The significance of this fact is that now, for the first time, associative processors enjoy the same cost per bit of storage as does the conventional computer.
Control and Constraint in E-Learning: Choosing When to Choose
Authors: Jon Dron
Venue:  (2007)

Structure influences behavior. Through their structure, e-learning environments (including the people within them) to a greater or lesser degree control how we learn, within a framework bounded by intrinsic and external constraints such as physical and temporal limits, prior knowledge, ability, needs of narrative, conversational conventions, and so on. Control and Constraint in E-Learning: Choosing When to Choose discusses how many conventional technologies can constrain the behavior of the people who use them, and how they can be used to provide the learner with the ability to choose to choose. An invaluable addition to every library collection, this book provides a foundation for developers of software and users of Web 2.0 environments for education and learning, unifying many distance learning theories and match them to the affordances of e-learning in general, but social software in particular.
Effective and Efficient Query Processing for Video Subsequence Identification
Authors: Heng Tao Shen, Jie Shao, Zi Huang, Xiaofang Zhou
Venue: IEEE Transactions on Knowledge and Data Engineering (2009)

Content-based video retrieval has been well investigated. However, despite the importance, few studies on video subsequence identification, which is to find the similar content to a short query clip from a long video sequence, have been published. This paper presents a graph transformation and matching approach to this problem, with extension to identify the occurrence of potentially different ordering, alignment or length due to content editing. With a batch query algorithm to retrieve similar frames, the mapping relationship between the query and the database video is first represented by a bipartite graph. The densely matched parts along the long sequence are then extracted, followed by a filter-and-refine search strategy to prune some irrelevant subsequences. During the filtering stage, Maximum Size Matching (MSM) is deployed for each subgraph constructed by the query and candidate subsequence to obtain a smaller set of candidates. During the refinement stage, Sub-Maximum Similarity Matching (SMSM) is devised to identify the subsequence, according to a robust video similarity model which incorporates visual content, temporal order, frame alignment and length information. The performance studies conducted on a long and diverse video recording validate our approach is promising in terms of both search accuracy and speed.
Robust and scalable transmission of arbitrary 3D models over wireless networks
Authors: Irene Cheng, Lihang Ying, Kostas Daniilidis, Anup Basu
Venue: Journal on Image and Video Processing (2008)

We describe transmission of 3D objects represented by texture and mesh over unreliable networks, extending our earlier work for regular mesh structure to arbitrary meshes and considering linear versus cubic interpolation. Our approach to arbitrary meshes considers stripification of the mesh and distributing nearby vertices into different packets, combined with a strategy that does not need texture or mesh packets to be retransmitted. Only the valence (connectivity) packets need to be retransmitted; however, storage of valence information requires only 10% space compared to vertices and even less compared to photorealistic texture. Thus, less than 5% of the packets may need to be retransmitted in the worst case to allow our algorithm to successfully reconstruct an acceptable object under severe packet loss. Even though packet loss during transmission has received limited research attention in the past, this topic is important for improving quality under lossy conditions created by shadowing and interference. Results showing the implementation of the proposed approach using linear, cubic, and Laplacian interpolation are described, and the mesh reconstruction strategy is compared with other methods.
Semantic Processing in Pānini's Kāraka System
Authors: Girish Nath Jha, Sudhir K. Mishra
Venue: Sanskrit Computational Linguistics: First and Second International Symposia Rocquencourt, France, October 29-31, 2007 Providence, RI, USA, May 15-17, 2008 Revised Selected and Invited Papers (2009)

Pānini's grammar is widely known for its formal treatment of the Sanskrit language. Many scholars Jha 2004 have earlier taken a systemic view of Pānini and have argued that Pānini's system is easily implementable. However, on a closer look, several complications arise, especially in Pānini's recourse to semantics in many of the vidhi and saṁj&ntilde;ā. rules. This seems to happen more in the kāraka prakaraa than in other components. The authors of this paper have highlighted the challenges in implementing some of the semantic aspects of Pānini's kāraka system. For example, the semantic conditions of being most desired by the agent (karturīpsitatamam) and of being most effective (sādhakatamam) are difficult to formalize in the rules specifying the semantic conditions for an object's being termed karman and karana respectively. Likewise, the semantic conditions of being that which the agent approaches with the direct object (karmanā yamabhipraiti), and being the one pleased in relation to verbs of pleasing (rucyarthānā m prīyamā nah) are difficult to formalize in rules specifying semantic conditions for an object's being termed sampradāna. The paper also looks at possible strategies to handle such situations, and presents pseudo-code like translations of some kāraka rules.
Simulation of Lévy-driven Ornstein-Uhlenbeck processes with given marginal distribution
Authors: Emanuele Taufer, Nikolai Leonenko
Venue: Computational Statistics Data Analysis (2009)

A simulation procedure for obtaining discretely observed values of Ornstein-Uhlenbeck processes with given (self-decomposable) marginal distribution is provided. The method proposed, based on inversion of the characteristic function, completely circumvents the problems encountered when trying to reproduce small jumps of Levy processes. Error bounds for the proposed procedure are provided and its performance is numerically assessed.
R for SAS and SPSS Users, 1st edition
Authors: Robert A. Muenchen
Venue:  (2008)

R is a powerful and free software system for data analysis and graphics, with over 1,200 add-on packages available. This book introduces R using SAS and SPSS terms with which you are already familiar. It demonstrates which of the add-on packages are most like SAS and SPSS and compares them to Rs built-in functions. It steps through over 30 programs written in all three packages, comparing and contrasting the packages differing approaches. The programs and practice datasets are available for download. The glossary defines over 50 R terms using SAS/SPSS jargon and again using R jargon. The table of contents and the index allow you to find equivalent R functions by looking up both SAS statements and SPSS commands. When finished, you will be able to import data, manage and transform it, create publication quality graphics, and perform basic statistical analyses. "This is a really great book. It is easy to read, quite comprehensive, and would be extremely valuable to both regular R users and users of SAS and SPSS who wish to switch to or learn about RAn invaluable reference." - David Hitchcock, University of South Carolina "Thanks for writing R for SAS and SPSS Users--it is a comprehensible and clever document. The graphics chapter is superb!" - Tony N. Brown, Vanderbilt University "This is a Rosetta Stone for SPSS and SAS users to start learning R quickly and effectively." - Ralph O'Brien, ASA Fellow "I am a professional SAS and SPSS programmer and found this bookextremely useful." - Tony Chu, Public Policy Research Data Analyst
Greedy Construction of 2-Approximation Minimum Manhattan Network
Authors: Zeyu Guo, He Sun, Hong Zhu
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

Given a set T of n points in ℝ2, a Manhattan Network G is a network with all its edges horizontal or vertical segments, such that for all p,q &epsilon; T, in G there exists a path (named a Manhattan path) of the length exactly the Manhattan distance between p and q. The Minimum Manhattan Network problem is to find a Manhattan network of the minimum length, i.e., the total length of the segments of the network is to be minimized. In this paper we present a 2-approximation algorithm with time complexity O(nlogn), which improves the 2-approximation algorithm with time complexity O(n2). Moreover, compared with other 2-approximation algorithms employing linear programming or dynamic programming technique, it was first discovered that only greedy strategy suffices to get 2-approximation network.
How accurate are the extremely small P-values used in genomic research: An evaluation of numerical libraries
Authors: Sai Santosh Bangalore, Jelai Wang, David B. Allison
Venue: Computational Statistics Data Analysis (2009)

In the fields of genomics and high-dimensional biology (HDB), massive multiple testing prompts the use of extremely small significance levels. Because tail areas of statistical distributions are needed for hypothesis testing, the accuracy of these areas is important to confidently make scientific judgments. Previous work on accuracy was primarily focused on evaluating professionally written statistical software, like SAS, on the Statistical Reference Datasets (StRD) provided by the National Institute of Standards and Technology (NIST) and on the accuracy of tail areas in statistical distributions. The goal of this paper is to provide guidance to investigators, who are developing their own custom scientific software built upon numerical libraries written by others. Specifically, we evaluate the accuracy of small tail areas from cumulative distribution functions (CDF) of the Chi-square and t-distribution by comparing several open-source, free, or commercially licensed numerical libraries in Java, C, and R to widely accepted standards of comparison like ELV and DCDFLIB. In our evaluation, the C libraries and R functions are consistently accurate up to six significant digits. Amongst the evaluated Java libraries, Colt is the most accurate. These languages and libraries are popular choices among programmers developing scientific software, so the results herein can be useful to programmers in choosing libraries for CDF accuracy.
Design, Tuning and Evaluation of Parallel Multilevel ILU Preconditioners
Authors: José I. Aliaga, Matthias Bollhöfer, Alberto F. Martín, Enrique S. Quintana-Ortí
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

In this paper, we present a parallel multilevel ILU preconditioner implemented with OpenMP. We employ METIS partitioning algorithms to decompose the computation into concurrent tasks, which are then scheduled to threads. Concretely, we combine decompositions which obtain significantly more tasks than processors, and the use of dynamic scheduling strategies in order to reduce the thread's idle time, which it is shown to be the main source of overhead in our parallel algorithm. Experimental results on a shared-memory platform consisting of 16 processors report remarkable performance for our approach.
Scrivener: providing incentives in cooperative content distribution systems
Authors: Animesh Nandi, Tsuen-Wan "Johnny" Ngan, Atul Singh, Peter Druschel, Dan S. Wallach
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Cooperative peer-to-peer (p2p) applications are designed to share the resources of participating computers for the common good of all users. However, users do not necessarily have an incentive to donate resources to the system if they can use the system's services for free. In this paper, we describe Scrivener, a fully decentralized system that ensures fair sharing of bandwidth in cooperative content distribution networks. We show how participating nodes, tracking only first-hand observed behavior of their peers, can detect when their peers are behaving selfishly and refuse to provide them service. Simulation results show that our mechanisms effectively limit the quality of service received by a user to a level that is proportional to the amount of resources contributed by that user, while incurring modest overhead.
Mobile agents, DSM, coordination, and self-migrating threads: a Common Framework
Authors: Lubomir F. Bic, Michael B. Dillencourt
Venue: Proceedings of the 7th conference on Data networks, communications, computers (2008)

We compare four paradigms that have recently been the subject of considerable attention: mobile agents, distributed shared memory (DSM), coordination paradigms, and self-migrating threads. We place these paradigms in a common framework consisting of three layers--the computational model, its implementation on a physical architecture, and the interface to the system's environment--to demonstrate that self-migrating threads subsume the other three paradigms in terms of their capabilities to organize and coordinate computation, map the concurrent activities onto a multicomputer architecture, and provide an interface for interaction with their environments on the underlying host computers.
Secrecy of cryptographic protocols under equational theory
Authors: H. Houmani, M. Mejri, H. Fujita
Venue: Knowledge-Based Systems (2009)

This paper gives a novel approach to verify the secrecy property of cryptographic protocols under equational theories. Indeed, by using the notion of interpretation functions, this paper presents some sufficient and practical conditions allowing to guarantee the secrecy property of cryptographic protocols under any equational theory. An interpretation function is a safe means by which an agent can estimate the security level of message components that he receives so that he can handle them correctly. Also, this paper proves that polynomials help a lot with the construction of an interpretation function and gives a guideline on how to construct such functions together with an example and how to use it to analyse a cryptographic protocol.
The Research on Responding Time and Precision of Centralized Controlled Cricket Indoor Location System
Authors: Hong-Peng Wang, Gang Han
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, a semi-centralized controlled architecture based on Cricket is presented; it can reduce the interference to obtain a shorter responding time (it’s better than decentralized architecture). A simplified method to be proposed to measure the distance between listeners and beacons, their merits and shortages are discussed.
Research of the Synthesis Control of Force and Position in Electro-Hydraulic Servo System
Authors: Yadong Meng, Changchun Li, Hao Yan, Xiaodong Liu
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

The synthesis control of force and position in electro-hydraulic servo system has been applied to some special occasions. Analyzed a typical system which adopted this kind of control algorithm. Applying unchanged structure theory, the compensated transfer function has been deduced, the compensated state-space model is presented. Considering the synthesis control should meet the requirement to force and position at the same time , introduced the linear quadratic performance fonctionelle, the optimized control formula of the synthesis control of force and position on total state feedback has been deduced. The simulation results proved that the compensated state-space model has more superior performance.
Automata theory based on complete residuated lattice-valued logic: Pushdown automata
Authors: Hongyan Xing, Daowen Qiu, Fuchun Liu
Venue: Fuzzy Sets and Systems (2009)

Automata theory based on complete residuated lattice-valued logic, called L-valued automata, has been proposed by Qiu [Automata theory based on complete residuated latticed-valued logic, Sci. China (Ser. F) 44 (6) (2001) 419-429; Automata theory based on complete residuated latticed-valued logic (II), Sci. China (Ser. F) 45 (6) (2002) 442-452]. In this paper, we discuss some properties of L-valued context-free grammars, languages, and pushdown automata. We show that, for such grammars, Chomsky and Greibach Normal Forms can be equivalently constructed, and we also prove that the languages accepted by final states and by empty stack in L-valued pushdown automata are equivalent. In particular, we prove the equivalence between L-valued context-free grammars and L-valued pushdown automata.
Automated classification of metaphase chromosomes: Optimization of an adaptive computerized scheme
Authors: Xingwei Wang, Bin Zheng, Shibo Li, John J. Mulvihill, Marc C. Wood, Hong Liu
Venue: Journal of Biomedical Informatics (2009)

We developed and tested a new automated chromosome karyotyping scheme using a two-layer classification platform. Our hypothesis is that by selecting most effective feature sets and adaptively optimizing classifiers for the different groups of chromosomes with similar image characteristics, we can reduce the complexity of automated karyotyping scheme and improve its performance and robustness. For this purpose, we assembled an image database involving 6900 chromosomes and implemented a genetic algorithm to optimize the topology of multi-feature based artificial neural networks (ANN). In the first layer of the scheme, a single ANN was employed to classify 24 chromosomes into seven classes. In the second layer, seven ANNs were adaptively optimized for seven classes to identify individual chromosomes. The scheme was optimized and evaluated using a ''training-testing-validation'' method. In the first layer, the classification accuracy for the validation dataset was 92.9%. In the second layer, classification accuracy of seven ANNs ranged from 67.5% to 97.5%, in which six ANNs achieved accuracy above 93.7% and only one had lessened performance. The maximum difference of classification accuracy between the testing and validation datasets is
Fault-tolerant middleware and the magical 1%
Authors: Tudor Dumitraş, Priya Narasimhan
Venue: Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware (2005)

Through an extensive experimental analysis of over 900 possible configurations of a fault-tolerant middleware system, we present empirical evidence that the unpredictability inherent in such systems arises from merely 1% of the remote invocations. The occurrence of very high latencies cannot be regulated through parameters such as the number of clients, the replication style and degree or the request rates. However, by selectively filtering out a "magical 1%" of the raw observations of various metrics, we show that performance, in terms of measured end-to-end latency and throughput, can be bounded, easy to understand and control. This simple statistical technique enables us to guarantee, with some level of confidence, bounds for percentile-based quality of service (QoS) metrics, which dramatically increase our ability to tune and control a middleware system in a predictable manner.
Feedback scheduling of priority-driven control networks
Authors: Feng Xia, Youxian Sun, Yu-Chu Tian
Venue: Computer Standards Interfaces (2009)

With traditional open-loop scheduling of network resources, the quality-of-control (QoC) of networked control systems (NCSs) may degrade significantly in the presence of limited bandwidth and variable workload. The goal of this work is to maximize the overall QoC of NCSs through dynamically allocating available network bandwidth. Based on codesign of control and scheduling, an integrated feedback scheduler is developed to enable flexible QoC management in dynamic environments. It encompasses a cascaded feedback scheduling module for sampling period adjustment and a direct feedback scheduling module for priority modification. The inherent characteristics of priority-driven control networks make it feasible to implement the proposed feedback scheduler in real-world systems. Extensive simulations show that the proposed approach leads to significant QoC improvement over the traditional open-loop scheduling scheme under both underloaded and overloaded network conditions.