ppxscal/embedding_network huggingface dataset:
Generalized incidence theorems, homogeneous forms and sum-product estimates in finite fields
Authors: David Covert, Derrick Hart, Alex Iosevich, Doowon Koh, Misha Rudnev
Venue: European Journal of Combinatorics (2010)

In recent years, sum-product estimates in Euclidean space and finite fields have received great attention. They can often be interpreted in terms of Erdos type incidence problems involving the distribution of distances, dot products, areas, and so on, which have been studied quite extensively by way of combinatorial and Fourier analytic techniques. We use both kinds of techniques to obtain sharp or near-sharp results on the distribution of volumes (as examples of d-linear homogeneous forms) determined by sufficiently large subsets of vector spaces over finite fields and the associated arithmetic expressions. Arithmetic-combinatorial techniques turn out to be optimal for dimension d>=4 to this end, while for d=3 they have failed to provide us with a result that follows from the analysis of exponential sums. To obtain the latter result we prove a relatively straightforward function version of an incidence results for points and planes previously established in [D. Hart, A. Iosevich, Sums and products in finite fields: An integral geometric viewpoint, in: Radon Transforms, Geometry, and Wavelets, Contemp. Math. 464 (2008); D. Hart, A. Iosevich, D. Koh, M. Rudnev, Averages over hyperplanes, sum-product theory in vector spaces over finite fields and the Erdos-Falconer distance conjecture, arXiv:math/0711.4427, preprint 2007]. More specifically, we prove that if E=Ax...xA is a product set in F"q^d, d>=4, the d-dimensional vector space over a finite field F"q, such that the size |E| of E exceeds q^d^2 (i.e. the size of the generating set A exceeds q) then the set of volumes of d-dimensional parallelepipeds determined by E covers F"q. This result is sharp as can be seen by taking A=F"p, a prime sub-field of its quadratic extension F"q, with q=p^2. For in three dimensions, however, we are able to establish the same result only if |E|@?q^1^5^8 (i.e., |A|>=Cq^5^8, for some C; in fact, the q^1^5^8 bound can be justified for a slightly wider class of ''Cartesian product-like'' sets), and this uses Fourier methods. Yet we do prove a weaker near-optimal result in three dimensions: that the set of volumes generated by a product set E=AxAxA covers a positive proportion of F"q if |E|>q^3^2 (so |A|>q). Besides, without any assumptions on the structure of E, we show that in three dimensions the set of volumes covers a positive proportion of F"q if |E|>=Cq^2, which is again sharp up to the constant C, as taking E to be a 2-plane through the origin shows.
A multi-granular linguistic model for management decision-making in performance appraisal
Authors: Roc&#x00ed;o de Andr&#x00e9;s, Jos&#x00e9; Luis Garc&#x00ed;a-Lapresta, Luis Mart&#x00ed;nez
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

The performance appraisal is a relevant process to keep and improve the competitiveness of companies in nowadays. In spite of this relevance, the current performance appraisal models are not sufficiently well-defined either designed for the evaluation framework in which they are defined. This paper proposes a performance appraisal model where the assessments are modelled by means of linguistic information provided by different sets of reviewers in order to manage the uncertainty and subjectivity of such assessments. Therefore, the reviewers could express their assessments in different linguistic scales according to their knowledge about the evaluated employees, defining a multi-granular linguistic evaluation framework. Additionally, the proposed model will manage the multi-granular linguistic labels provided by appraisers in order to compute collective assessments about the employees that will be used by the management team to make the final decision about them.
Evaluating an Algorithm for the Generation of Multimodal Referring Expressions in a Virtual World: A Pilot Study
Authors: Werner Breitfuss, Ielka Sluis, Saturnino Luz, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

This paper presents a quest for the most suitable setting and method to assess the naturalness of the output of an existing algorithm for the generation of multimodal referring expressions. For the evaluation of this algorithm a setting in Second Life was built. This paper reports on a pilot study that aimed to assess (1) the suitability of the setting and (2) the design of our evaluation method. Results show that subjects are able to discriminate between different types of referring expressions the algorithm produces. Lessons learnt in designing questionnaires are also reported.
The Research on Frequency-Hopping Signals Analysis Methods Based on Adaptive Optimal Kernel Time-Frequency Representation
Authors: Nan Li, Shuang Dong, Dongmei Yang, Zhonghua Hao
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 01 (2009)

It is inevitable to be interfered by cross-term interference when frequency-hopping signal parameters are estimated using time-frequency distribution, how to curb cross-term signal interference has become a main problem of time-frequency analysis. Based on studying of adaptive optimal kernel time-frequency representation（AOK TFR）, a new time-frequency method is put forward. This kind of AOK TFR can tune its kernel ambiguity function shape by two-dimensional optimization procedure according to the characteristics of the analyzed signal. A frequency-hopping signal is analyzed with four time-frequency analysis methods, and simulation results used AOK TFR shows that better time-frequency and adaptability are obtained, and anti-noise and cross-term interference are represented
Multiple word alignment with profile hidden Markov models
Authors: Aditya Bhargava, Grzegorz Kondrak
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium (2009)

Profile hidden Markov models (Profile HMMs) are specific types of hidden Markov models used in biological sequence analysis. We propose the use of Profile HMMs for word-related tasks. We test their applicability to the tasks of multiple cognate alignment and cognate set matching, and find that they work well in general for both tasks. On the latter task, the Profile HMM method outperforms average and minimum edit distance. Given the success for these two tasks, we further discuss the potential applications of Profile HMMs to any task where consideration of a set of words is necessary.
A model of two-thumb chording on a phone keypad
Authors: Nirmal Patel, James Clawson, Thad Starner
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

When designing a text entry system for mobile phone keypads, a designer needs to overcome the ambiguity that arises from mapping the 26 letters of the roman alphabet to only 12 keys (0--9, *, #). In this paper, we present a novel two-thumb chording system for text entry on a standard 12-key mobile phone keypad and introduce a performance model based on Fitts' Law for an expert user. The model provides a behavioral description of the user and predicts a text entry rate of 55.02 wpm.
Embodied Interaction or Context-Aware Computing? An Integrated Approach to Design
Authors: Johan Eliasson, Teresa Cerratto Pargman, Robert Ramberg
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This paper revisits the notion of context from an interaction design perspective. Since the emergence of the research fields of Computer supported cooperative work and Ubiquitous computing, the notion of context has been discussed from different theoretical approaches and in different research traditions. One of these approaches is Embodied Interaction. This theoretical approach has in particular contributed to (i) challenge the view that user context can be meaningfully represented by a computer system, (ii) discuss the notion of context as interaction through the idea that users are always embodied in their interaction with computer systems. We believe that the particular view on users context that the approach of Embodied Interaction suggests needs to be further elaborated in terms of design. As a contribution we suggest an integrated approach where the interactional view of Embodied Interaction is interrelated with the representational view of Context-aware computing.
A geo-location based opportunistic data dissemination approach for MANETs
Authors: Harald Meyer, Karin Anna Hummel
Venue: Proceedings of the 4th ACM workshop on Challenged networks (2009)

In mobile scenarios, location dependent data can be provided by an infrastructure, or, in case an infrastructure is not available or feasible, by opportunistic networking among mobile devices populating the region of interest. Caused by node mobility, data availability within the region of interest relies on replication and forwarding techniques. Our approach associates data with a geo-address describing the Point of Interest (POI) of the data and proposes a decentralized algorithm for data dissemination. Mobile devices replicate data to increase data availability within a circular area around the POI. To avoid unnecessary communication overhead, the distributed algorithm Sector Heads Aided Flooding Technique (SHAFT) restricts the number of mobile nodes that forward data by arranging data placement geometrically in the area. Hereby, each mobile node decides whether to become a forwarding node based on its geolocation and the known scheme for data arrangement. Additionally, the algorithm adapts to the locally measured density of mobile devices in range. By applying the approach to a cooperative parking lot management system based on theManhattan mobility model we demonstrate its usefulness. Simulation results are provided showing that SHAFT reaches similar data availability as flooding by reducing the number of packets transferred by a factor of up to 92.3% for newly created data and by up to 81.1% for data updates in scenarios of high node density.
Morphological analysis for statistical machine translation
Authors: Young-Suk Lee
Venue: Proceedings of HLT-NAACL 2004: Short Papers on XX (2004)

We present a novel morphological analysis technique which induces a morphological and syntactic symmetry between two languages with highly asymmetrical morphological structures to improve statistical machine translation qualities. The technique pre-supposes fine-grained segmentation of a word in the morphologically rich language into the sequence of prefix(es)-stem-suffix(es) and part-of-speech tagging of the parallel corpus. The algorithm identifies morphemes to be merged or deleted in the morphologically rich language to induce the desired morphological and syntactic symmetry. The technique improves Arabic-to-English translation qualities significantly when applied to IBM Model 1 and Phrase Translation Models trained on the training corpus size ranging from 3,500 to 3.3 million sentence pairs.
A Fast and Flexible Sorting Algorithm with CUDA
Authors: Shifu Chen, Jing Qin, Yongming Xie, Junping Zhao, Pheng-Ann Heng
Venue: Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing (2009)

In this paper, we propose a fast and flexible sorting algorithm with CUDA. The proposed algorithm is much more practical than the previous GPU-based sorting algorithms, as it is able to handle the sorting of elements represented by integers, floats and structures. Meanwhile, our algorithm is optimized for the modern GPU architecture to obtain high performance. We use different strategies for sorting disorderly list and nearly-sorted list to make it adaptive. Extensive experiments demon- strate our algorithm has higher performance than previous GPU-based sorting algorithms and can support real-time applications.
On the Issues of Innovation in Computer Education
Authors: Wang Lanbo, Hou Bing, Zhai Tianxi
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

This paper does some superficial discussion, focuses on the innovative computer education. It relates that computer education is imparting knowledge or skills training, discussing some issues such as which way shall take on education, spoon-fed or attract the students' interest, content or competency etc. This paper introduces one practice-oriented education mode in detail: it is guided for interesting, focus on capacity-building, it also points out that the key computer education innovation lies in the people.
Towards the Merging of Multiple Clinical Protocols and Guidelines via Ontology-Driven Modeling
Authors: Samina Raza Abidi, Syed Sibte Abidi
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Decision support systems based on computerized Clinical Protocols (CP) and Clinical Practice Guidelines (CPG) fall short when dealing with patient co-morbidites, as this demands the concurrent merging of multiple CP/CPG. We present an ontology-based approach for the merging of CPG and CP at two levels---i.e. knowledge modeling level and knowledge execution level. We have developed specialized ontological modeling constructs to facilitate merging of CPG and CP. We demonstrate the merging of multiple location-specific CP and disease-specific CPG.
Reasoning about plans
Authors: Witold Lukaszewicz, Ewa Madalinska-Bugaj
Venue: Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2 (1997)

In classical planning we are faced with the following formal task: Given a set A of permissible actions, a description a of initial states and a description β of final states, determine a plan II, i.e. a finite sequence of actions from A, such that execution of II begun in any state satisfying α is guaranteed to terminate in a state satisfying β. In this paper we extend the classical model of planning by admitting plans that are not assured to succeed. We address two basic problems connected with such plans: (1) How to determine whether a given plan is valid (i.e. always succeeds), admissible (i.e. may succeed or fail) or inadmissible (i.e. never succeeds). (2) Given an admissible plan, determine a minimal set of observations that are to be made in the initial state (or in some intermediate state, if the plan is in progress) to validate or falsify the plan.
SMOTE: synthetic minority over-sampling technique
Authors: Nitesh V. Chawla, Kevin W. Bowyer, Lawrence O. Hall, W. Philip Kegelmeyer
Venue: Journal of Artificial Intelligence Research (2002)

An approach to the construction of classifiers from imbalanced datasets is described. A dataset is imbalanced if the classification categories are not approximately equally represented. Often real-world data sets are predominately composed of "normal" examples with only a small percentage of "abnormal" or "interesting" examples. It is also the case that the cost of misclassifying an abnormal (interesting) example as a normal example is often much higher than the cost of the reverse error. Under-sampling of the majority (normal) class has been proposed as a good means of increasing the sensitivity of a classifier to the minority class. This paper shows that a combination of our method of oversampling the minority (abnormal)cla ss and under-sampling the majority (normal) class can achieve better classifier performance (in ROC space)tha n only under-sampling the majority class. This paper also shows that a combination of our method of over-sampling the minority class and under-sampling the majority class can achieve better classifier performance (in ROC space)t han varying the loss ratios in Ripper or class priors in Naive Bayes. Our method of over-sampling the minority class involves creating synthetic minority class examples. Experiments are performed using C4.5, Ripper and a Naive Bayes classifier. The method is evaluated using the area under the Receiver Operating Characteristic curve (AUC)and the ROC convex hull strategy.
Arab Children's Reading Preference for Different Online Fonts
Authors: Asmaa Alsumait, Asma Al-Osaimi, Hadlaa Alfedaghi
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part IV: Interacting in Various Application Domains (2009)

E-learning education plays an important role in the educational process in the Arab region. There is more demand to provide Arab students with electronic resources for knowledge now than before. The readability of such electronic resources needs to be taken into consideration. Following design guidelines in the e-learning programs' design process improves both the reading performance and satisfaction. However, English script design guidelines cannot be directly applied to Arabic script mainly because of difference in the letters occupation and writing direction. Thus, this paper aimed to build a set of design guidelines for Arabic e-learning programs designed for seven-to-nine years old children. An electronic story is designed to achieve this goal. It is used to gather children's reading preferences, for example, font type/size combination, screen line length, and tutoring sound characters. Results indicated that Arab students preferred the use of Simplified Arabic with 14-point font size to ease and speed the reading process. Further, 2/3 screen line length helped children in reading faster. Finally, most of children preferred to listen to a female adult tutoring sound.
An interval-based representation of temporal knowledge
Authors: James F. Allen
Venue: Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1 (1981)

This paper describes a method for maintaining the relationships between temporal intervals in a hierarchical manner using constraint propagation techniques. The representation includes a notion of the present moment (i.e., "now"), and allows one to represent intervals that may extend indefinitely into the past/future. This research was supported in part by the National Science Foundation under Grant Number IST-80-12418, and in part by the Office of Naval Research under Grant Number N00014-80-O0197.
Electrical properties of Pt interconnects for passive crossbar memory arrays
Authors: R. Rosezin, C. Nauenheim, S. Trellenkamp, C. Kügeler, R. Waser
Venue: Microelectronic Engineering (2009)

We report on the fabrication and the electrical characterization of platinum interconnects for novel non-volatile memory technologies. These nanowires present an important and essential contribution to the deep nanometer scaling of alternative architectures beyond CMOS, e.g. nanocrossbar arrays with resistance switching junctions. The nanowires, which have a thickness of 25nm and a width ranging from 200nm down to 40nm, were patterned using electron beam direct writing. They were deposited by UHV electron beam evaporation in combination with a lift-off process. The electrical characteristic is increasingly affected by the contribution of surface effects like scattering at grain boundaries and scattering at the surfaces as the wire dimensions become smaller. With decreasing width of the platinum wire an increasing resistivity was observed, which is consistent with the theories of Fuchs-Sondheimer and Mayadas-Shatzkes. Our studies have shown that the investigated structures possess a high stability concerning the operational current densities up to 4x10^7A/cm^2, and an additional annealing step results in an improvement of the electrical wire properties, which is explained by a higher quality of the grain boundaries and side walls.
Discourse topic and gestural form
Authors: Jacob Eisenstein, Regina Barzilay, Randall Davis
Venue: Proceedings of the 23rd national conference on Artificial intelligence - Volume 2 (2008)

Coverbal gesture provides a channel for the visual expression of ideas. While some gestural emblems have culturally predefined forms (e.g., "thumbs up"), the relationship between gesture and meaning is, in general, not conventionalized. It is natural to ask whether such gestures can be interpreted in a speaker-independent way, or whether gestural form is determined by the speaker's idiosyncratic view of the discourse topic. We address this question using an audiovisual dataset across multiple speakers and topics. Our analysis employs a hierarchical Bayesian author-topic model, in which gestural patterns are stochastically generated by a mixture of speaker-specific and topic-specific priors. These gestural patterns are characterized using automatically-extracted visual features, based on spatio-temporal interest points. This framework detects significant cross-speaker patterns in gesture that are governed by the discourse topic, suggesting that even unstructured gesticulation can be interpreted across speakers. In addition, the success of this approach shows that the semantic characteristics of gesture can be detected via a low-level, interest point representation.
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
Authors: Georg Gottlob, Gianluigi Greco, Bruno Marnette
Venue: Graph Theory, Computational Intelligence and Thought: Essays Dedicated to Martin Charles Golumbic on the Occasion of His 60th Birthday (2009)

Generalized hypertree width (short: ghw) is a concept that leads to a large class of efficiently solvable CSP instances, whose associated recognition problem (of checking whether the ghw of a CSP is bounded by a constant k) is however known to be NP-hard. An elegant way to circumvent this intractability has recently been proposed in the literature, by means of a "no-promise" approach solving CSPs of bounded ghw without the need of actually computing a generalized hypertree decomposition. In fact, despite the conceptual relevance of this approach, its computational issues have not yet been investigated and, indeed, precise bounds on the running time of the no-promise algorithm are missing.The first contribution of this paper is precisely to fill this gap. Indeed, the computational complexity of the no-promise approach is analyzed, by exploiting an intuitive characterization relying on the notion of hyperconsistency width. It turns out that, in the basic formulation, the approach is hardly suited for practical applications mainly because of its bad scaling in the size of the constraint database. Motivated by these news and based on a variant of hyperconsistency width, a different and more efficient method to decide whether CSPs of bounded ghw admit solutions is then provided. Importantly, the improved method exhibits the same scaling as current evaluation algorithms for instances of bounded hypertree width, nonetheless allowing to isolate a larger class of queries. Finally, to give a complete picture of the complexity issues of the no-promise approach, the problems of computing one solution and of enumerating all the solutions are also studied.