ppxscal/embedding_network huggingface dataset:
Intelligent Information Technologies and Applications
Authors: Vijayan Sugumaran, Vijayan Sugumaran
Venue:  (2007)

With the inundation of emergent online- and Web-centered technologies, there has been an increased focus on intelligent information technologies that are designed to enable users to accomplish complex tasks with relative ease. Intelligent Information Technologies and Applications provides cutting-edge research on the modeling; implementation; and financial, environmental, and organizational implications of this dynamic topic to researchers and practitioners in fields such as information systems, intelligent agents, artificial intelligence, and Web engineering.
Security models for contextual based global processing an architecture and overview
Authors: Gregory Vert, S. S. Iyengar, Vir Phoha
Venue: Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies (2009)

In this paper, we introduce a new paradigm for global computation, one in which the context of collected information drives the type of processing and dissemination the information receives as it is dispersed around the world. The creation of this model has necessitated the development of new types of methods for securing contextual information because the internet itself inherently has not have security mechanisms. Security is typically localized at the nodes on the internet that process information. There are multiple models and methods that are under development to provide security for contexts. This paper presents the basics of a model that allows context consumers to determine the level of security contextual information should have. Security levels have a direct correlation with confidence in the integrity of contextual data and thus application of its processing.
ECMon: exposing cache events for monitoring
Authors: Vijay Nagarajan, Rajiv Gupta
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

The advent of multicores has introduced new challenges for programmers to provide increased performance and software reliability. There has been significant interest in techniques that use software speculation to better utilize the computational power of multicores. At the same time, several recent proposals for ensuring software reliability are not applicable in a multicore setting due to their inability to handle interprocessor shared memory dependences (ISMDs). The demands for performing speculation and ensuring software reliability in a multicore setting, although seemingly different, share a common requirement: the need for monitoring program execution and collecting interprocessor dependence information at low overhead. For example, an important component of speculation is the effcient detection of missspeculation which in turn requires dependence information. Likewise, tasks that help ensure software reliability on multicores, including recording for replay, require ISMD information. In this paper, we propose ECMon: support for exposing cache events to the software. This enables the programmer to catch these events and react to them; in effect, efficiently exposing the ISMDs to the programmer. In the context of speculation, we show how ECMon optimizes the detection of miss-speculation; we use this simple support to speculate past active barriers and achieve a speedup of 12% for the set of parallel programs considered. As an application of ensuring software reliability, we show how ECMon can be used to record shared memory dependences on multicores using no specialized hardware support at only 2.8 fold execution time overhead.
AnySP: anytime anywhere anyway signal processing
Authors: Mark Woh, Sangwon Seo, Scott Mahlke, Trevor Mudge, Chaitali Chakrabarti, Krisztian Flautner
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

In the past decade, the proliferation of mobile devices has increased at a spectacular rate. There are now more than 3.3 billion active cell phones in the world-a device that we now all depend on in our daily lives. The current generation of devices employs a combination of general-purpose processors, digital signal processors, and hardwired accelerators to provide giga-operations-per-second performance on milliWatt power budgets. Such heterogeneous organizations are inefficient to build and maintain, as well as waste silicon area and power. Looking forward to the next generation of mobile computing, computation requirements will increase by one to three orders of magnitude due to higher data rates, increased complexity algorithms, and greater computation diversity but the power requirements will be just as stringent. Scaling of existing approaches will not suffice instead the inherent computational efficiency, programmability, and adaptability of the hardware must change. To overcome these challenges, this paper proposes an example architecture, referred to as AnySP, for the next generation mobile signal processing. AnySP uses a co-design approach where the next generation wireless signal processing and high-definition video algorithms are analyzed to create a domain specific programmable architecture. At the heart of AnySP is a configurable single-instruction multiple-data datapath that is capable of processing wide vectors or multiple narrow vectors simultaneously. In addition, deeper computation subgraphs can be pipelined across the single-instruction multiple-data lanes. These three operating modes provide high throughput across varying application types. Results show that AnySP is capable of sustaining 4G wireless processing and high-definition video throughput rates, and will approach the 1000 Mops/mW efficiency barrier when scaled to 45nm.
From Glossaries to Ontologies: Extracting Semantic Structure from Textual Definitions
Authors: Roberto Navigli, Paola Velardi
Venue: Proceeding of the 2008 conference on Ontology Learning and Population: Bridging the Gap between Text and Knowledge (2008)

Learning ontologies requires the acquisition of relevant domain concepts and taxonomic, as well as non-taxonomic, relations. In this chapter, we present a methodology for automatic ontology enrichment and document annotation with concepts and relations of an existing domain core ontology. Natural language definitions from available glossaries in a given domain are processed and regular expressions are applied to identify general-purpose and domain-specific relations. We evaluate the methodology performance in extracting hypernymy and non-taxonomic relations. To this end, we annotated and formalized a relevant fragment of the glossary of Art and Architecture (AAT) with a set of 10 relations (plus the hypernymy relation) defined in the CRM CIDOC cultural heritage core ontology, a recent W3C standard. Finally, we assessed the generality of the approach on a set of web pages from the domains of history and biography.
Piezoresistive coefficients of {110} silicon-on-insulator MOSFETs with 0.135/0.45/10 micrometers channel length with external forces
Authors: W. T. Chang, J. A. Lin
Venue: Microelectronic Engineering (2009)

This paper reports the piezoresistive coefficients of silicon-on-insulator (SOI) n-/p- MOSFETs of 0.135/0.45/10@mm channel length by 10@mm channel width. The dynamic transconductance and normalized saturation current changes were measured with the channels of longitudinal and transverse configurations under maximum stress of 45.7MPa. The coefficients consist of the tendency of other works using bulk Si and Si MOSFETs but shows significant drain/source parasitic resistance effect for the SOI MOSFETs with 0.135@mm channel length.
Combining boundary and region information for perceptual organization
Authors: Song Wang
Venue:  (2008)

Perceptual organization, or grouping, is an important problem in computer vision and image processing that seeks to identify perceptually salient structures in noisy images. As an important step in mid-level computer vision, grouping can provide useful input to many high-level computer-vision applications such as object recognition or content-based image retrieval. To identify a salient structure, a set of tokens is first obtained from the original image, and then a subset of these tokens is grouped that minimizes a cost function (or maximizes saliency). This work introduces a series of new edge grouping methods to detect perceptually salient structures in noisy images, where the grouping tokens are edge segments. Unlike previous edge grouping methods, which base their saliency measures exclusively on boundary properties, the proposed methods incorporate region information into their saliency measure. The use of region information makes these methods more robust to noise in the image, and add capabilities such as targeting structures with specific region characteristics. The first method presented introduces the general problem of incorporating region information into an edge grouping method. The second method targets structures that are a priori known to be convex. The third method uses symmetric trapezoids as its grouping tokens to target structures that are a priori known to have good bilateral symmetry. The fourth method extends the first method with the capability of detecting open boundaries (for structures not completely present within the perimeter of the input image). To find the optimal grouping with the minimum cost, a special graph model is developed in each case and the grouping problems are reduced to finding a special kind of cycle in these graphs. This optimal cycle-finding problem can be solved in polynomial time using a known graph algorithm. The presented methods are tested on both synthetic data and real images, and their performance is compared against previous edge-grouping methods.
An Evaluation of Space Time Cube Representation of Spatiotemporal Patterns
Authors: Per Ola Kristensson, Nils Dahlbäck, Daniel Anundi, Marius Björnstad, Hanna Gillberg, Jonas Haraldsson, Ingrid Mårtensson, Mathias Nordvall, Josefine Ståhl
Venue: IEEE Transactions on Visualization and Computer Graphics (2009)

Space time cube representation is an information visualization technique where spatiotemporal data points are mapped into a cube. Information visualization researchers have previously argued that space time cube representation is beneficial in revealing complex spatiotemporal patterns in a data set to users. The argument is based on the fact that both time and spatial information are displayed simultaneously to users, an effect difficult to achieve in other representations. However, to our knowledge the actual usefulness of space time cube representation in conveying complex spatiotemporal patterns to users has not been empirically validated. To fill this gap, we report on a between-subjects experiment comparing novice users' error rates and response times when answering a set of questions using either space time cube or a baseline 2D representation. For some simple questions, the error rates were lower when using the baseline representation. For complex questions where the participants needed an overall understanding of the spatiotemporal structure of the data set, the space time cube representation resulted in on average twice as fast response times with no difference in error rates compared to the baseline. These results provide an empirical foundation for the hypothesis that space time cube representation benefits users analyzing complex spatiotemporal patterns.
Split variational inference
Authors: Guillaume Bouchard, Onno Zoeter
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We propose a deterministic method to evaluate the integral of a positive function based on soft-binning functions that smoothly cut the integral into smaller integrals that are easier to approximate. In combination with mean-field approximations for each individual sub-part this leads to a tractable algorithm that alternates between the optimization of the bins and the approximation of the local integrals. We introduce suitable choices for the binning functions such that a standard mean field approximation can be extended to a split mean field approximation without the need for extra derivations. The method can be seen as a revival of the ideas underlying the mixture mean field approach. The latter can be obtained as a special case by taking soft-max functions for the binning.
Traffic load and cost analysis for different IPTV architectures
Authors: Skender Rugova, Arianit Maraj
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

Service providers worldwide are looking for ways to deliver new broadband services. IPTV is one of the broadband services all operators tend to offer to the customers. This paper presents a detailed comparison between different architectures supporting IPTV services. There are a lot of architectures offering IPTV, but two of the most important architectures taken into consideration in this paper are: centralized and distributed architecture. It is well known that bandwidth requirements are very low for voice and data services, but for delivering Broadcast TV and Video on Demand (VoD) a high bandwidth is required. The more attractive service for the customer is VoD which requires highest volume of bandwidth because it is unicast. The main objective of this paper is to address the core network design in support of IPTV services, considering the traffic load and cost analysis for both abovementioned architectures offering voice, data, broadcast TV and VoD services.
A multiple flux boundary element method applied to the description of surface water waves
Authors: C. H. Hague, C. Swan
Venue: Journal of Computational Physics (2009)

This paper concerns a two dimensional numerical model based on a high-order boundary element method with fully nonlinear free surface boundary conditions. Multiple fluxes are applied as a method of removing the so-called ''corner problem'', whereby the direction of the outward normal at geometric discontinuities is ill-defined. In the present method, both fluxes associated with differing directions of the outward normal at a corner are considered, allowing a single node to be placed at that position. This prevents any loss of information at what can be an important part of the boundary, especially if considering simulations of wave reflection and wave run-up. The method is compared to both the double node approach and the use of discontinuous elements and is shown to be a more accurate technique. The success of the method is further demonstrated by its ability to accurately simulate various problems involving wave transmission and wave-structure interactions at domain corners; the results being achieved without the need for filtering, smoothing or re-gridding of any kind.
Line Enhancement and Completion via Linear Left Invariant Scale Spaces on SE(2)
Authors: Remco Duits, Erik Franken
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

From an image we construct an invertible orientation score, which provides an overview of local orientations in an image. This orientation score is a function on the group SE(2) of both positions and orientations. It allows us to diffuse along multiple local line segments in an image. The transformation from image to orientation score amounts to convolutions with an oriented kernel rotated at multiple angles. Under conditions on the oriented kernel the transform between image and orientation score is unitary. This allows us to relate operators on images to operators on orientation scores in a robust way such that we can deal with crossing lines and orientation uncertainty. To obtain reasonable Euclidean invariant image processing the operator on the orientation score must be both left invariant and non-linear. Therefore we consider non-linear operators on orientation scores which amount to direct products of linear left-invariant scale spaces on SE(2). These linear left-invariant scale spaces correspond to well-known stochastic processes on SE(2) for line completion and line enhancement and are given by group convolution with the corresponding Green's functions. We provide the exact Green's functions and approximations, which we use together with invertible orientation scores for automatic line enhancement and completion.
iWoz: Computer Geek to Cult Icon How I Invented the Personal Computer, Co-Founded Apple, and Had Fun Doing It
Authors: Steve Wozniak
Venue:  (2007)

The Woz built the first [personal computer]by hand, by himself.USA Today Before slim laptops that fit into briefcases, computers looked like strange vending machines, with cryptic switches and pages of encoded output. But in 1977 Steve Wozniak revolutionized the computer industry with his invention of the first personal computer. As the sole inventor of the Apple I and II computers, Wozniak has enjoyed wealth, fame, and the most coveted awards an engineer can receive, and he tells his story here for the first time.
Function factorization using warped Gaussian processes
Authors: Mikkel N. Schmidt
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We introduce a new approach to non-linear regression called function factorization, that is suitable for problems where an output variable can reasonably be modeled by a number of multiplicative interaction terms between non-linear functions of the inputs. The idea is to approximate a complicated function on a high-dimensional space by the sum of products of simpler functions on lower-dimensional subspaces. Function factorization can be seen as a generalization of matrix and tensor factorization methods, in which the data are approximated by the sum of outer products of vectors. We present a non-parametric Bayesian approach to function factorization where the priors over the factorizing functions are warped Gaussian processes, and we do inference using Hamiltonian Markov chain Monte Carlo. We demonstrate the superior predictive performance of the method on a food science data set compared to Gaussian process regression and tensor factorization using PARAFAC and GEMANOVA models.
CALCMIN – an EXCEL™ Visual Basic application for calculating mineral structural formulae from electron microprobe analyses
Authors: Andreas Brandelik
Venue: Computers Geosciences (2009)

CALCMIN, an open source Visual Basic program, was implemented in EXCEL(TM). The program was primarily developed to support geoscientists in their routine task of calculating structural formulae of minerals on the basis of chemical analysis mainly obtained by electron microprobe (EMP) techniques. Calculation programs for various minerals are already included in the form of sub-routines. These routines are arranged in separate modules containing a minimum of code. The architecture of CALCMIN allows the user to easily develop new calculation routines or modify existing routines with little knowledge of programming techniques. By means of a simple mouse-click, the program automatically generates a rudimentary framework of code using the object model of the Visual Basic Editor (VBE). Within this framework simple commands and functions, which are provided by the program, can be used, for example, to perform various normalization procedures or to output the results of the computations. For the clarity of the code, element symbols are used as variables initialized by the program automatically. CALCMIN does not set any boundaries in complexity of the code used, resulting in a wide range of possible applications. Thus, matrix and optimization methods can be included, for instance, to determine end member contents for subsequent thermodynamic calculations. Diverse input procedures are provided, such as the automated read-in of output files created by the EMP. Furthermore, a subsequent filter routine enables the user to extract specific analyses in order to use them for a corresponding calculation routine. An event-driven, interactive operating mode was selected for easy application of the program. CALCMIN leads the user from the beginning to the end of the calculation process.
Finsler Geometry on Higher Order Tensor Fields and Applications to High Angular Resolution Diffusion Imaging
Authors: Laura Astola, Luc Florack
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We study three dimensional volumes of higher order tensors, using Finsler geometry. The application considered here is in medical image analysis, specifically High Angular Resolution Diffusion Imaging (HARDI) [1] of the brain. We want to find robust ways to reveal the architecture of the neural fibers in brain white matter. In Diffusion Tensor Imaging (DTI), the diffusion of water is modeled with a symmetric positive definite second order tensor, based on the assumption that there exists one dominant direction of fibers restricting the thermal motion of water molecules, leading naturally to a Riemannian framework. HARDI may potentially overcome the shortcomings of DTI by allowing multiple relevant directions, but invalidates the Riemannian approach. Instead Finsler geometry provides the natural geometric generalization appropriate for multi-fiber analysis. In this paper we provide the exact criterion to determine whether a field of spherical functions has a Finsler structure. We also show a fiber tracking method in Finsler setting. Our model also incorporates a scale parameter, which is beneficial in view of the noisy nature of the data. We demonstrate our methods on analytic as well as real HARDI data.
Forest FIRE and FIRE Wood: Tools for Tree Automata and Tree Algorithms
Authors: Loek Cleophas
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

Pattern matching, acceptance, and parsing algorithms on node-labeled, ordered, ranked trees ('tree algorithms') are important for applications such as instruction selection and tree transformation/term rewriting. Many such algorithms have been developed. They often are based on results from such algorithms on words or generalizations thereof using finite (tree) automata. Regrettably no coherent, extensive toolkit of such algorithms and automata existed, complicating their use. Our toolkit FOREST FIRE contains many such algorithms and automata constructions. It is accompanied by the graphical user interface (GUI) FIRE WOOD. The toolkit and GUI provide a useful environment for experimenting with and comparing the algorithms. In this tool paper we give an overview of the toolkit and GUI, their context and design rationale, and mention some results obtained with them.
Complexity of Normal Form Properties and Reductions for Term Rewriting Problems Complexity of Normal Form Properties and Reductions for Term Rewriting Problems
Authors: Rakesh Verma
Venue: Fundamenta Informaticae (2009)

We present several new and some significantly improved polynomial-time reductions between basic decision problems of term rewriting systems. We prove two theorems that imply tighter upper bounds for deciding the uniqueness of normal forms (UN$^{=}$) and unique normalization (UN$^{&rarr;}$) properties under certain conditions. From these theorems we derive a new and simpler polynomial-time algorithm for the UN$^{=}$ property of ground rewrite systems, and explicit upper bounds for both UN$^{=}$ and UN$^{&rarr;}$ properties of left-linear right-ground systems. We also show that both properties are undecidable for right-ground systems. It was already known that these properties are undecidable for linear systems. Hence, in a sense the decidability results are "close" to optimal.