ppxscal/embedding_network huggingface dataset:
On programs for prime length FFTs and circular convolution
Authors: C. S. Burrus, I. W. Selesnick
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

Describes a set of programs for circular convolution and prime length FFTs that are short, possess great structure, share many computational procedures, and cover a large variety of lengths. The programs make clear the structure of the algorithms and clearly enumerate independent computational branches that can be performed in parallel. Moreover, each of these independent operations is made up of a sequence of sub-operations which can be implemented as vector/parallel operations. This is in contrast with previously existing programs for prime length FFTs: they consist of straight line code, no code is shared between them, and they cannot be easily adapted for vector/parallel implementations. The authors have also developed a program that automatically generates these programs for prime length FFTs.
Data exchange for machine shop simulation
Authors: Y. Tina Lee, Yan Luo
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Manufacturing simulation systems normally provide interfaces for data import and export using proprietary formats. Dependent data interfaces limit simulation applications in the manufacturing industry. This paper describes a mechanism for transferring data between a traditional database and XML files, which represent a machine shop data model developed at the National Institute of Standards and Technology (NIST). The data model is described by XML (eXtensible Markup Language) and UML (Unified Modeling Language). The data transfer mechanism is based on Document Object Model (DOM), XML Path Language (XPath), and Open Database Connectivity (ODBC) database engines. A prototype implementation is also described in this paper.
The e-Learning Assessment Landscape
Authors: David E. Millard, Christopher Bailey, Hugh C. Davis, Lester Gilbert, Yvonne Howard, Gary Wills
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Assessment is one of the more established areas of e-learning, but it cannot be described as mature due to the disparate nature of the tools and standards available. As part of our efforts within the FREMA project to create a reference model for assessment we have produced a database of existing resources. As a way of presenting that database we have also developed concept maps that describe the domain and place the resources in context. In this paper we present the process concept map and an initial analysis of the resources behind the map in an effort to map the e- Learning Assessment landscape and show where most development effort has been spent.
Research on an information processing system for shakuhachi tablatures
Authors: Masato Noguchi, Satosi Simura, Kuniharu Tsuboi, Toshiaki Matsushima
Venue: Systems and Computers in Japan (2007)

The development of an information processing system for traditional music is very much behind the times. In order to improve this situation, we have researched a system for shakuhachi scores. It is a multimedia system equipped with various functions needed for processing a shakuhachi score, such as handwritten editing, mutual conversion among various schools, and playback with a presentation of the performance method. Furthermore, a method for data expression of a shakuhachi score was newly devised. By using this system, it is possible to create a shakuhachi score effectively and it is also expected that it can be used as a beginner's shakuhachi self-study tool. &copy; 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 38(1): 18&ndash;27, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20553
Application of Voronoi and Delaunay Diagrams in Gravimetric Geoid Determination
Authors: Newton Pereira dos Santos, Iris Pereira Escobar
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

Two approaches based on Voronoi and Delaunay structures are investigated to compute the Stokes integral for geoid determination. In the Voronoi approach, polygonal areas contain the observed gravity anomalies instead of the interpolated ones, and original data is used. In Delaunay approach, gravity anomalies are interpolated into triangular cells whose vertices hold the stations. The geoidal undulations are computed at the barycenters. Both schemes were applied to the geoid determination in Rio de Janeiro and Resende sites. Stokes component was also computed by numerical integration and 1D FFT, and RMS differences did not exceed 0.047 m and 0.053 m, respectively, in Rio de Janeiro and Resende. Relative comparisons with GPS-levelling gave RMS differences smaller than 0.071 m, showing the schemes are adequate to compute high-precision geoid. Since both techniques avoid gridding step, pre-processing and labour are reduced, and the schemes proved to be as efficient as 1D FFT method.
Orthographic Distinctiveness and Semantic Elaboration Provide Separate Contributions to Memory
Authors: Brenda A. Kirchhoff, Melissa L. Schapiro, Randy L. Buckner
Venue: Journal of Cognitive Neuroscience (2005)

Orthographic distinctiveness and semantic elaboration both enhance memory. The present behavioral and functional magnetic resonance imaging (fMRI) studies examined the relationship between the influences of orthographic distinctiveness and semantic elaboration on memory, and explored whether they make independent contributions. As is typical for manipulations of processing levels, words studied during semantic encoding were better remembered than words studied during nonsemantic encoding. Notably, orthographically distinct words were better recalled and received more remember responses on recognition memory tests than orthographically common words regardless of encoding task, suggesting that orthographic distinctiveness has an additive effect to that of semantic elaboration on memory. In the fMRI study, orthographic distinctiveness and semantic elaboration engaged separate networks of brain regions. Semantic elaboration modulated activity in left inferior prefrontal and lateral temporal regions. In contrast, orthographic distinctiveness modulated activity in distinct bilateral inferior prefrontal, extrastriate, and parietal regions. Orthographic distinctiveness and semantic elaboration appear to have separate behavioral and functional&ndash;anatomic contributions to memory.
Neural Site of the Redundant Target Effect: Electrophysiological Evidence
Authors: C. Miniussi, M. Girelli, C. A. Marzi
Venue: Journal of Cognitive Neuroscience (1998)

The present study represents an attempt to find an electrophysiological correlate of the redundant targets effect, or RTE (i.e., the speeding up of reaction time, or RT,for redundant vs. single targets). Subjects made a speeded response either to one small checkerboard presented to the left or right of fixation or to a pair of identical checkerboards presented simultaneously to both hemifields.Both single and double targets could appear either in the upper or lower visual hemifield.The task required detection but not discrimination of the stimuli. During task performance, we recorded the event-related potentials (ERPs) elicited by the checkerboard targets. As in previous studies, we found that manual RTs to bilateral stimuli were faster than those to unilateral stimuli. This effect was more marked for lower- than for upper-field stimuli and could not be ascribed to probability summation. In addition, we found that the P1 and N1 components of the visual ERP had a shorter latency for bilateral than for summed unilateral stimuli presented to the two hemifields. In parallel with the behavioral findings, the latency values for the above components showed a larger RTE for lower-field stimuli. These findings indicate that the RTE occurs at the level of early visual processing, probably in the extrastriate visual cortex, rather than at late decisional or pre-motor stages.
A statistical model of skewed-associativity
Authors: P. Michaud
Venue: Proceedings of the 2003 IEEE International Symposium on Performance Analysis of Systems and Software (2003)

This paper presents a statistical model for explaining why skewed-associativity removes conflicts better than set-associativity. We show that, with a high probability, 2-way skewed associativity emulates full associativity for working-sets up to half the cache size, and we show that 3-way skewed-associativity is almost equivalent to full associativity.
Supporting the vision for space with discrete event simulation
Authors: Grant R. Cates, Mansooreh Mollaghasemi
Venue: Proceedings of the 37th conference on Winter simulation (2005)

On January 14, 2004 President George W. Bush announced a new Vision for Space Exploration. This vision called for NASA to complete the assembly of the International Space Station by 2010 and retire the Space Shuttle immediately thereafter. A discrete event simulation (DES) based tool has been built to assess the viability of NASA accomplishing all of the Space Shuttle missions required to assemble the Space Station by the end of the decade. This paper describes this DES tool i.e. the Manifest Assessment Simulation Tool (MAST).
A Model-Based Frequency Constraint for Mining Associations from Transaction Data
Authors: Michael Hahsler
Venue: Data Mining and Knowledge Discovery (2006)

Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an association, is used as the primary indicator of the associations's significance. A single, user-specified support threshold is used to decided if associations should be further investigated. Support has some known problems with rare items, favors shorter itemsets and sometimes produces misleading associations.In this paper we develop a novel model-based frequency constraint as an alternative to a single, user-specified minimum support. The constraint utilizes knowledge of the process generating transaction data by applying a simple stochastic mixture model (the NB model) which allows for transaction data's typically highly skewed item frequency distribution. A user-specified precision threshold is used together with the model to find local frequency thresholds for groups of itemsets. Based on the constraint we develop the notion of NB-frequent itemsets and adapt a mining algorithm to find all NB-frequent itemsets in a database. In experiments with publicly available transaction databases we show that the new constraint provides improvements over a single minimum support threshold and that the precision threshold is more robust and easier to set and interpret by the user.
A platform for mobile 3D map navigation development
Authors: Antti Nurminen
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

We present a platform for developing mobile 3D map navigation interfaces in highly occluded urban environments. The platform enables use of realistically textured city models in mobile devices such as PDA's and smart phones without 3D hardware, being able to render entire city centers at interactive rates. The platform supports network-distributed annotation of the environment with location-based information. Texture resolution can be varied per building. Maneuvering is not restricted, allowing implementation of any navigation metaphor. Efficient collision avoidance is provided. Key optimization methods, the overall system and supported features are presented along with guidelines for efficient modeling. Generic feedback from a focused field experiment is discussed.
Blind Haze Separation
Authors: Sarit Shwartz, Einav Namer, Yoav Y. Schechner
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Outdoor imaging is plagued by poor visibility conditions due to atmospheric scattering, particularly in haze. A major problem is spatially-varying reduction of contrast by stray radiance (airlight), which is scattered by the haze particles towards the camera. Recent computer vision methods have shown that images can be compensated for haze, and even yield a depth map of the scene. A key step in such a scene recovery is subtraction of the airlight. In particular, this can be achieved by analyzing polarization-filtered images. However, the recovery requires parameters of the airlight. These parameters were estimated in past studies by measuring pixels in sky areas. This paper derives an approach for blindly recovering the parameter needed for separating the airlight from the measurements, thus recovering contrast, with neither user interaction nor existence of the sky in the frame. This eases the interaction and conditions needed for image dehazing, which also requires compensation for attenuation. The approach has proved successful in experiments, some of which are shown here.
Interlacing and oscillation for Sturm-Liouville problems with separated and coupled boundary conditions
Authors: P. A. Binding, H. Volkmer
Venue: Journal of Computational and Applied Mathematics (2006)

An extension is given to the known inequalities which interlace the eigenvalues corresponding to separated and coupled boundary conditions for the problem -(py')' + qy = λry on [a, b], assuming 1/p,q and r ∈ L1 ([a, b]). The key is a new interlacing principle for intervals of eigenvalues corresponding to one parameter sets of boundary conditions. Application is given to eigenfunction oscillation.
Web-Based Virtual Research Environments (VRE): Support Collaboration in e-Science
Authors: Xiaobo Yang, Rob Allan
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Interdisciplinary challenges in research today require increasingly cooperation among researchers. The demand for building up Virtual Research Environments (VRE) becomes more and more urgent than ever before. Built on top of web, VRE systems aim at supporting research activities with much more efficient methods for sharing data and knowledge bases. In this paper, we present our recent work on development of a general-purpose VRE system by extending Sakai, an advanced collaboration and learning platform, with tools for accessing Microsoft Exchange Server through WebDAV, integrating existing grid tools to access remote computing and data grid resources via Web Services for Remote Portlets (WSRP), and managing documents to help organising workshops and conferences
Developing effective test sets and metrics for evaluating automated media analysis systems
Authors: J. W. Mateer
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper first looks at current methods of evaluating automated content-based media analysis systems. Several key deficiencies are identified, particularly with regard to test set creation and metric design. A new framework is proposed that better reflects real-world conditions and end-user requirements. This is based on the author's experience as a professional filmmaker and researcher in this domain. Specific approaches for data set selection, including the importance of understanding the physical, production and aesthetic attributes of footage, are presented. A discussion of related evaluation methods and means of effective assessment follow. It is hoped the suggestions proposed will facilitate more effective analysis of these systems. 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
Intelligent Icons: Integrating Lite-Weight Data Mining and Visualization into GUI Operating Systems
Authors: Eamonn Keogh, Li Wei, Xiaopeng Xi, Stefano Lonardi, Jin Shieh, Scott Sirowy
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

The vast majority of visualization tools introduced so far are specialized pieces of software that run explicitly on a particular dataset at a particular time for a particular purpose. In this work we introduce a novel framework for allowing visualization to take place in the background of normal day-to-day operation of any GUI based operation system. Our system works by replacing the standard file icons with automatically created icons that reflect the contents of the files in a principled way. We call such icons INTELLIGENT ICONS. The utility of Intelligent Icons is further enhanced by arranging them in a way that reflects their similarity/differences. We demonstrate the utility of our approach on diverse applications.
Dynamic Standby Prediction for Leakage Tolerant Microprocessor Functional Units
Authors: Ahmed Youssef, Mohab Anis, Mohamed Elmasry
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Leakage power is projected to comprise approximately 50% of the processor's power for sub 65nm technologies. Much of this power is consumed in the processor's functional units. Accordingly, leakage control techniques are employed to reduce leakage in these functional units. Many of these techniques are dynamic and are based on an input sleep signal to initiate a low leakage mode. However, since most of these leakage control techniques are based on circuit level schemes, such techniques inherently lack information about the operational profile of the functional units they manage. This limitation is usually handled statically by using a fixed length counter that generates the sleep signal when the functional unit is idle for a specified number of cycles. In this paper, the limitations of the static sleep signal generation approach are identified, and the use of a dynamic alternative that is capable of adopting the counter length to the running application is proposed. In order to assess the accuracy of the proposed dynamic sleep signal generator, the length of the sleep period following the sleep signal generation is used as a metric to identify the usefulness of utilizing the dynamic approach. Experimental results for the dynamic alternative shows up to 98% accuracy in predicting the length of the standby period compared to an average of 40 . 60% in the static case, which translates into increased leakage savings. This is achieved while consuming 360 ìW of overhead power at 1 GHz.
When does management matter in a dog-eat-dog world: An "Interaction Value Analysis" model of organizational climate
Authors: Walid F. Nasrallah
Venue: Computational Mathematical Organization Theory (2006)

Interaction Value Interaction Value Analysis (I.V.A.) models a network of rational actors who generate value by interacting with each other. This model can be used to understand human organizations. Since people form organizations to facilitate interactions between productive individuals, the value added by interaction is the contribution of the organization. This paper examines the result of varying the queuing discipline used in selecting among back-logged interaction requests. Previously developed I.V.A. models assumed a First-in-first-out (FIFO) discipline, but using other disciplines can better represent the "Climate" of an organization.I.V.A. identifies circumstances under which organizations that control members' interaction choices outperform organizations where individuals choose their own interaction partners. Management can be said to "matter" when individual choices converge to a point where interactions generate a lower than optimal value. In previous I.V.A. models, relinquishing central control of interaction choices reduced the aggregate value by anything from 0% to 12%, depending on circumstances. This paper finds the difference between the two modes of organization to go as high as 47% if actors display preferences between interaction partners instead of treating all equally. A politically divided, dog-eat-dog, "Capitalist" climate follows one queuing discipline, which is found to generally increase the value that a strong control structure can add. A chummy, in-bred "Fraternal" climate gains from control in some circumstances (low interdependence or low differentiation), but not in others (high or medium interdependence and differentiation under low diversity, for example). These are compared to the previous version of I.V.A., in which the queuing discipline was FIFO and the climate deemed "Disciplined". Previously published findings on Organizational Climate are duplicated and extended with a higher level of detail. Priority queuing in an I.V.A. model is thus a useful proxy for Organizational Climate, open to future validation because its detailed predictions can be confirmed or falsified by observation.
A resource support toolkit (R-IDE): supporting the DECIDE framework
Authors: Elizabeth Kemp, D. T. Setungamudalige
Venue: Proceedings of the 7th ACM SIGCHI New Zealand chapter's international conference on Computer-human interaction: design centered HCI (2006)

A central activity involved in the user-centred design process is usability evaluation. Cost-effective evaluation tools to fully support usability evaluations however, are still limited. The aim of this work is to introduce a web-based, resource-supported, interactive evaluation toolkit called R-IDE, which guides evaluation planners through the various activities involved in planning and conducting usability evaluations. The IDE stages of the DECIDE framework provide the basis for the design of this toolkit, which currently supports two evaluation methods: heuristic evaluation for websites and standard questionnaires. This paper describes the design, development, evaluation and future potential of this toolkit.
mBAR: A Materialized Bitmap Based Association Rule Algorithm
Authors: Woon-Hak Kang, Dong-Hyun Kim, Sang-Won Lee
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

With the rapid progress in information technology, the data mining technique has been exploited in various applications. The association rule(hereafter, AR) mining, one of the most popular data mining techniques, is to find the frequent itemsets which occur commonly in transaction database. Of the various AR algorithms, the Apriori is most popular, and it has been continuously improved during the past decade. Even with recent version, however, it is very time consuming for the Apriori-based algorithms to count frequent itemset since, basically for each k-size item set, we need to compute its support on-the-fly.
Concepts for an Ontology-centric Technology Risk Management Architecture in the Banking Industry
Authors: Colin Atkinson, Christian Cuske, Tilo Dickopp
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Due to the increasing impact of technology on the banking industry, the resulting risks play a vital role in bank-wide risk management. Additional gain in attention can be ascribed to the recent Basel II regulatory framework covering operational risk. To deliver adequate support for the process of technology risk management, flexible and seamlessly integrated software architectures are required. Based upon ontology-driven information systems the concept of an ontology-centric technology risk management architecture is explored. As a basis, the conceptual role of ontologies in information systems is portrayed and the technology risk environment in the banking domain summarized. The proposed architecture then is constructed around two essential concepts: The modeling of domain knowledge within an ontology as well as the integration of multiple, special-purpose software components into one architecture.