ppxscal/embedding_network huggingface dataset:
Eliminating Redundant and Less-Informative RSS News Articles Based on Word Similarity and a Fuzzy Equivalence Relation
Authors: Ian Garcia, Yiu-Kai Ng
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

The Internet has marked this era as the information age. There is no precedent in the amazing amount of information, especially network news, that can be accessed by Internet users these days. As a result, the problem of seeking information in online news articles is not the lack of them but being overwhelmed by them. This brings huge challenges in processing online news feeds, e.g., how to determine which news article is important, how to determine the quality of each news article, and how to filter irrelevant and redundant information. In this paper, we propose a method for filtering redundant and less-informative RSS news articles that solves the problem of excessive number of news feeds observed in RSS news aggregators. Our filtering approach measures similarity among RSS news entries by using the Fuzzy-Set Information Retrieval model and a fuzzy equivalent relation for computing word/sentence similarity to detect redundant and less-informative news articles.
Lagrangian Numerical Approximations to One-Dimensional Convolution-Diffusion Equations
Authors: Laurent Gosse, Giuseppe Toscani
Venue: SIAM Journal on Scientific Computing (2006)

This work focuses on the numerical analysis of one-dimensional nonlinear diffusion equations involving a convolution product. First, homogeneous friction equations are considered. Algorithms follow recent ideas on mass transportation methods and lead to simple schemes which can be proved to be stable, to decrease entropy, and to converge toward the unique solution of the continuous problem. In particular, for the first time, homogeneous cooling states are displayed numerically. Further, we present results on the more delicate fourth-order thin-film equation for which a nonnegativity-preserving scheme is derived. The dead core phenomenon is presented for the Hele--Shaw cell.
Estimating the global pagerank of web communities
Authors: Jason V. Davis, Inderjit S. Dhillon
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Localized search engines are small-scale systems that index a particular community on the web. They offer several benefits over their large-scale counterparts in that they are relatively inexpensive to build, and can provide more precise and complete search capability over their relevant domains. One disadvantage such systems have over large-scale search engines is the lack of global PageRank values. Such information is needed to assess the value of pages in the localized search domain within the context of the web as a whole. In this paper, we present well-motivated algorithms to estimate the global PageRank values of a local domain. The algorithms are all highly scalable in that, given a local domain of size n, they use O(n) resources that include computation time, bandwidth, and storage. We test our methods across a variety of localized domains, including site-specific domains and topic-specific domains. We demonstrate that by crawling as few as n or 2n additional pages, our methods can give excellent global PageRank estimates.
RLS design of polyphase components for the interpolation of periodically nonuniformly sampled signals
Authors: L. Vandendorpe, B. Maison, L. Cuvelier
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The generalized sampling theorem states that any analogue signal whose spectrum is limited to 1/T can be exactly recovered from N sequences of samples taken at a rate 2/NT and all having a different sampling phase. When N=2, the exact interpolation formula can be derived quite easily. The ideal interpolation filters have infinite impulse responses. This paper addresses the theoretical question of recovering from the 2 initial sequences, any other sequence taken at the some rate 1/T and with a different sampling phase. FIR filters are derived for a least square interpolation error. Moreover, an adaptive implementation is proposed and formulated as a Kalman algorithm. Simulation results obtained for AR processes show the effectiveness of the solution compared to static solutions.
ISPASS-2004 People
Venue: Proceedings of the 2004 IEEE International Symposium on Performance Analysis of Systems and Software (2004)

The following topics are dealt with: performance analysis of systems and software; benchmarking and workload characterization; simulation; architecture and performance evaluation; memory and caches; Java; and power estimation and reduction. 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
Study on simulation credibility metrics
Authors: Fei Liu, Ming Yang, Zicai Wang
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Currently, there appears to be an over-preoccupation with building simulation validity in simulation credibility evaluation. However, today's simulation systems become more complex and larger, the only validity metric can't represent simulation credibility, and there is a need for other credibility metrics. Therefore, we should rethink the basic problem in the simulation community: what are the metrics of simulation credibility. In this paper, credibility metrics are deeply investigated and presented, measurement methods for credibility metrics are discussed, a new approach to synthesis of credibility metrics is presented, and a credibility metrics driven VV&A process is discussed.
The Neurology of Empty Categories: Aphasics' Failure to Detect Ungrammaticality
Authors: Yosef Grodzinsky, Lisa Finkel
Venue: Journal of Cognitive Neuroscience (1998)

A direct investigation into the grammatical abilities of Broca's and Wernicke's aphasics sought to obtain critical evidence for a revised model of the functional neuroanatomy of language. We examined aphasics' ability to make grammaticality judgments on a set of theoretically selected, highly complex syntactic structures that involve, most prominently, fine violations of constraints on syntactic movement. Although both groups have been thought to possess intact abilities in this domain, we discovered severe deficits: Broca's and Wernicke's aphasics (whose performances differed) exhibited clear, delineated, and grammatically characterizable deficits - they follow from the Trace-Deletion Hypothesis, which is motivated by independent comprehension results. These conclusions have both linguistic and neurological implications: Linguistically, they show that the aphasic deficit interacts with more than one module of the grammar.Namely, it manifests not only when the thematic module is called for in interpretive tasks but also when constraints on syntactic movement are tapped in a study of judgment. Neurologically, the results support a view of receptive grammatical mechanisms in the left cortex, which is functionally more restrictive than currently assumed; neuroanatomically, however, it is more distributed.
Analytical evaluation of throughput for a bluetooth piconet with MAC level link adaptation
Authors: Gianni Pasolini, Roberto Verdone
Venue: Mobile Networks and Applications (2005)

In this paper a MAC level Link Adaptation (LA) strategy to be implemented in a Bluetooth piconet is investigated: the performance level that can be achieved in terms of throughput is derived and the comparison with the case of no LA is performed.Suitable definitions of the performance figures related to throughput are given and, starting from the knowledge of the physical level performance obtained via simulation, their analytical evaluation is performed in both the cases of LA and no LA.All aspects related to the propagation characteristics of the environment, the modulation/demodulation and coding/decoding techniques, and the multiple access strategy are taken into account in an integrated way; moreover a reference scenario analytically characterized along with a realistic scenario have been considered for the performance level assessment.The analytical results have been compared with simulation outcomes which confirm the validity of the approach adopted.
Minimal bricks
Authors: Serguei Norine, Robin Thomas
Venue: Journal of Combinatorial Theory Series B (2006)

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n ≥ 5, every minimal brick on 2n vertices has at most 5n - 7 edges, and (2) every minimal brick has at least three vertices of degree three.
A New Dynamic Bandwidth Re-Allocation Technique in Optically Interconnected High-Performance Computing Systems
Authors: Avinash Karanth Kodi, Ahmed Louri
Venue: Proceedings of the 14th IEEE Symposium on High-Performance Interconnects (2006)

As bit rates increase, optical interconnects based high-performance computing (HPC) systems improve performance by increasing the available bandwidth (using wavelength-division multiplexing (WDM) and spacedivision multiplexing (SDM)) and decreasing power dissipation as compared to traditional electrical interconnects. While static allocation of wavelengths (channels) in optical interconnects provide every node with equal opportunity for communication, it can lead to network congestion for non-uniform traffic patterns. In this paper, we propose an opto-electronic interconnect for designing a flexible, highbandwidth, low-latency, dynamically reconfigurable architecture for scalable HPC systems. Reconfigurability is realized by monitoring traffic intensities, and implementing dynamic bandwidth re-allocation (DBR) technique that adapts to changes in communication patterns. We propose a DBR technique - Lock-Step (LS) that balances the load on each communication channel based on past utilization. Simulation results indicate that the reconfigured architecture shows 40% increased throughput and and 20% reduced network latency as compared to HPC electrical networks.
Symbol Grounding for Semantic Image Interpretation: From Image Data to Semantics
Authors: Celine Hudelot, Nicolas Maillot, Monique Thonnat
Venue: Proceedings of the Tenth IEEE International Conference on Computer Vision Workshops (2005)

This paper presents an original approach for the symbol grounding problem involved in semantic image interpretation, i.e. the problem of the mapping between image data and semantic data. Our approach involves the following aspects of cognitive vision : knowledge acquisition and knowledge representation, reasoning and machine learning. The symbol grounding problem is considered as a problem as such and we propose an independent cognitive system dedicated to symbol grounding. This symbol grounding system introduces an intermediate layer between the semantic interpretation problem (reasoning in the semantic level) and the image processing problem. An important aspect of the work concerns the use of two ontologies to make easier the communication between the different layers : a visual concept ontology and an image processing ontology. We use two approaches to solve the symbol grounding problem: a machine learning approach and an a priori knowledge based approach.
Research on Manufacturing Resource Discovery Based on Ontology and QoS in Manufacturing Grid
Authors: He Yu'an, Yu Tao, Liu Lilan, Sun Haiyang
Venue: Proceedings of the 2006 International Conference on Cyberworlds (2006)

The core of Manufacturing Grid (MG) is Manufacturing Resource (MR) sharing and collaboration, so the efficient discovery of sharable MRs is the precondition and basis that the resource sharing, collaborative design and manufacturing can be realized successfully in MG. Aiming at the problem that semantic information is represented insufficiently when MRs are searched in MG, we propose an ontology-based MR discovery architecture which is based on semantic web technology. Then from the point of view based on semantics and QoS (Quality of Service), the main framework of resource matchmaking is constructed, in which three processes are included: task modeling, resource modeling, semantic modeling and resource matchmaking. On the basis of resource representation model and manufacturing featuresoriented task representation model, combining with the research results of semantic web, some pivotal concepts are defined about the matchmaking resources. Finally, by means of a functional semantic extending method based on the ontology and QoS, the MR matchmaking algorithm is constructed.
Towards pervasive learning: WeLearn.Mobile. A CPS package viewer for handhelds
Authors: Susanne Loidl
Venue: Journal of Network and Computer Applications (2006)

Smart applications are influencing our life more and more. This paper presents an application where pervasive computing is used in the context of e-Learning. First a short introduction to the ongoing changes concerning pervasive computing and particularly e-Learning is given, followed by a report on an e-Learning framework used in schools, universities and the area of continuing adult education. This framework is the basis for the viewer application, which provides the possibility to present CPS (Content Packaging Specification) packages on handhelds (namely Pocket PCs). The paper concludes with an account of possible extensions and prospective future work.
Problem distributions in a CS1 course
Authors: Anthony Robins, Patricia Haden, Sandy Garner
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

In this paper we describe an ongoing study of novice programmers in an introductory programming course. Building on previously published results from the study we explore the distributions of different kinds of language related (rather than general or design related) problems over the sequence of laboratory exercises in the course. Data collected from student cohorts in 2003 and 2004 are compared, and the consistency of the effects observed gives us considerably confidence in the reliability and validity of the mechanisms of the study. While great care must be taken in the interpretation of the problem distributions, we suggest that they are useful for diagnosing aspects of course design and delivery, and that they may contribute to our general understanding of the process of teaching and learning a first programming language.
A probabilistic classifier system and its application in data mining
Authors: Jorge Muruzábal
Venue: Evolutionary Computation (2006)

The article is about a new Classifier System framework for classification tasks called BYP_CS (for BaYesian Predictive Classifier System). The proposed CS approach abandons the focus on high accuracy and addresses a well-posed Data Mining goal, namely, that of uncovering the low-uncertainty patterns of dependence that manifest often in the data. To attain this goal, BYP_CS uses a fair amount of probabilistic machinery, which brings its representation language closer to other related methods of interest in statistics and machine learning. On the practical side, the new algorithm is seen to yield stable learning of compact populations, and these still maintain a respectable amount of predictive power. Furthermore, the emerging rules self-organize in interesting ways, sometimes providing unexpected solutions to certain benchmark problems.
Neural Correlates of Letter-String Length and Lexicality during Reading in a Regular Orthography
Authors: T. N. Wydell, T. Vuorinen, P. Helenius, R. Salmelin
Venue: Journal of Cognitive Neuroscience (2003)

Behavioral studies have shown that short letter strings are read faster than long letter-strings and words are read faster than nonwords. Here, we describe the dynamics of letter-string length and lexicality effects at the cortical level, using magnetoencephalography, during a reading task in Finnish with long (eight-letter) and short (four-letter) word/nonword stimuli. Length effects were observed in two spatially and temporally distinct cortical activations: (1) in the occipital cortex at about 100 msec by the strength of activation, regardless of the lexical status of the stimuli, and (2) in the left superior temporal cortex between 200 and 600 msec by the duration of activation, with words showing a smaller effect than nonwords. A significant lexicality effect was also evident in this later activation, with stronger activation and longer duration for nonwords than words. There seem to be no distinct cortical areas for reading words and nonwords. The early length effect is likely to be due to the low-level visual analysis common to all stimulus letter-strings. The later lexicality and length effects apparently reflect converging lexico-semantic and phonological influences, and are discussed in terms of dual-route and single-route connectionist models of reading.
Incorporating large unlabeled data to enhance EM classification
Authors: Xintao Wu
Venue: Journal of Intelligent Information Systems (2006)

This paper investigates the problem of augmenting labeled data with unlabeled data to improve classification accuracy. This is significant for many applications such as image classification where obtaining classification labels is expensive, while large unlabeled examples are easily available. We investigate an Expectation Maximization (EM) algorithm for learning from labeled and unlabeled data. The reason why unlabeled data boosts learning accuracy is because it provides the information about the joint probability distribution. A theoretical argument shows that the more unlabeled examples are combined in learning, the more accurate the result. We then introduce B-EM algorithm, based on the combination of EM with bootstrap method, to exploit the large unlabeled data while avoiding prohibitive I/O cost. Experimental results over both synthetic and real data sets show that the proposed approach has a satisfactory performance.
Experimental Software Engineering: A New Conference
Authors: Karl Reed
Venue: IEEE Software (2006)

An interesting issue facing software engineering relates to the evidence for adopting new techniques, tools, languages methodologies, and so on. We shouldn't always reject new models based on pure argument and logic, but ideally, we should subject such developments to some form of validation. The software engineering community has addressed this issue in part by the establishment of specialist conferences. Two of these are merging, and the Technical Council on Software Engineering thought you would like to know why.
Author index
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 2 (2003)

At complete deleting of a part of high or low speech frequencies 100% intelligibility of speech is saved. Research of speech perception with mosaic deleting of frequency bands is more interesting. It gives possibility to estimate redundancy of a speech from the point of view of the spectral contents. We divided speech spectrum on the frequency bands with separate summation of with even and odd bands:1) width of even and odd bands was identical; 2) we simulated speech perceived by the cochlear implanted patients; 3) at a constant odd bands width we increased width of even bands so long as the speech intelligibility did not decrease from 100%; and 4) research is conducted in relation of comfortable loudness of speech with different parameters of comb filter. We found that redundancy of speech achieves 95%. Comfortable loudness of comb filtered speech depends on test bands width and period of the filter. The problem of speech perception of cochlear implanted patients and in noise background is discussed. 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
Estimation of the position of electrocortical generators via subspace techniques
Authors: D. Klimovski, A. A. Sergejew, A. L. Cricenti, G. K. Egan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

There are a number of approaches to the application of subspace techniques for solving spectral estimation problems. These approaches are derived from the covariance matrix which is constructed from incoming data. The covariance matrix can be broken down through the use of appropriate matrix properties and eigen-decomposition techniques into two subspaces. The performance of three traditional algorithms which incorporate subspace techniques in direction of arrival are evaluated under both white and 1/f noise conditions. 1/f noise is chosen because it is typical of the EEG signals. Simulation results suggest that the Johnson and DeGraaf (1982) direction finding algorithm performs best under both noise environments. A typical sample of EEG data was used to evaluate the performance of the three algorithms. The Johnson and DeGraaf algorithm gives estimates for the direction of the signal which approximately agree with the anatomical locations of possible electrocortical generators.
Analysis of the combined effects of finite samples and model errors on array processing performance
Authors: M. Viberg, A. L. Swindlehurst
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors consider the performance of the class of signal subspace fitting algorithms for signal parameter estimation using narrowband sensor array data. The principle sources of estimation error in such applications are the finite sample effects of additive noise and imprecise models for the antenna array and spatial noise statistics. The covariance matrix of the estimation error when all of these error sources are present is found to be the sum of the individual contributions from each component separately. This simplifying fact allows for the derivation of an overall optimal subspace weighting for a particular array and noise covariance error model. In fact, the resulting algorithm yields the lowest possible asymptotic estimation error variance of any method for the model in question.
Derandomization of Wireless Channel Access using Automata in Sensor Networks
Authors: James Kay, Jeff Frolik
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Low cost radio transceivers have enabled the deployment of wireless sensor networks (WSNs) using inexpensive and energy constrained nodes. Real time monitoring and control systems using WSNs often seek to maintain a given, but possibly varying spatial and/or temporal, sensing resolution. This control typically consists of both node participation and communication channel access (MAC). This paper proposes integrating both functions into a simple automaton achieving three benefits. First, control of the desired number of transmitting sensors in a given time period is maintained with small variance around the desired mean. Second, channel efficiency (60%) exceeds slotted-ALOHA without explicit synchronization of or idle listening by nodes. Third, the technique implicitly limits the channel load at the maximum supported level with no increase in collisions, and no additional overhead when the desired number of transmitting sensors exceeds the supported capacity.