ppxscal/embedding_network huggingface dataset:
Macro-Based Cross Assemblers
Authors: K. R. Tavernier
Venue: IEEE Transactions on Software Engineering (1980)

The problem of implementing cross assemblers by means of a macro expansion technique is addressed. Various problems caused by the implementation technique proper, as well as the target machine instruction set, are identified.
Direct type-specific conic fitting and eigenvalue bias correction
Authors: Matthew Harker, Paul O'Leary, Paul Zsombor-Murray
Venue: Image and Vision Computing (2008)

A new method to fit specific types of conics to scattered data points is introduced. Direct, specific fitting of ellipses and hyperbolae is achieved by imposing a quadratic constraint on the conic coefficients, whereby an improved partitioning of the design matrix is devised so as to improve computational efficiency and numerical stability by eliminating redundant aspects of the fitting procedure. Fitting of parabolas is achieved by determining an orthogonal basis vector set in the Grassmannian space of the quadratic terms' coefficients. The linear combination of the basis vectors that fulfills the parabolic condition and has a minimum residual norm is determined using Lagrange multipliers. This is the first known direct solution for parabola specific fitting. Furthermore, the inherent bias of a linear conic fit is addressed. We propose a linear method of correcting this bias, producing better geometric fits which are still constrained to specific conic type.
Ray Tracing Free-Form B-Spline Surfaces
Authors: Michael Sweeney, Richard Bartels
Venue: IEEE Computer Graphics and Applications (1986)

We present a method for using ray tracing to render spline surfaces¿one that is suitable for any object generated from control vertices via tensor-product B-splines. The method derives from kajiya's work on ray tracing procedurally defined surfaces1 and makes use of two preprocessing steps. One involves the controlvertex refinement recurrences due to Riesenfeld et. al.2, and the second generates a tree of nested bounding boxes. Intersection testing involves running Kajiya's algorithm on the tree, followed by two to three (on the average) iterations of Newton's method.
Discovering during-temporal patterns (DTPs) in large temporal databases
Authors: Li Zhang, Guoqing Chen, Tom Brijs, Xing Zhang
Venue: Expert Systems with Applications: An International Journal (2008)

Large temporal databases (TDBs) usually contain a wealth of data about temporal events. Aimed at discovering temporal patterns with during relationship (during-temporal patterns, DTPs), which is deemed common and potentially valuable in real-world applications, this paper presents an approach to finding such DTPs by investigating some of their properties and incorporating them as desirable pruning strategies into the corresponding algorithm, so as to optimize the mining process. Results from synthetic reveal that the algorithm is efficient and linearly scalable with regard to the number of temporal events. Finally, we apply the algorithm into the weather forecast field and obtain effective results.
Fourier analysis and large independent sets in powers of complete graphs
Authors: Mahya Ghandehari, Hamed Hatami
Venue: Journal of Combinatorial Theory Series B (2008)

For constant r and arbitrary n, it was known that in the graph K"r^n any independent set of size close to the maximum is close to some independent set of maximum size. We prove that this statement holds for arbitrary r and n.
Conference Report: 1978 Summer Computer Simulation Conference
Authors: W. Myers
Venue: Computer (1978)

Simulation is a tool that is being used to extend the limits of the human mind in more and more professions. The expanding range of difficult icult problems to which it is ingow be- applied is suggested by the Table 1 classification of papers presented at the 1978 Summer Computer Simulation Conference, held June 24-26 in Newport Beach, California. Even so, the entire range is not fully represented by the summer conference because it focuses on the simulation of continuous processes. The Winter Simulation Conference, which is also sponsored by the Society for- Computer Simulation, emphasizess- discrete processes. 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
There's Nothing Like a Good Argument ...
Authors: Simon Buckingham Shum
Venue: IEEE Software (2007)

Much effort has gone into tools for mapping design information and arguments since the early hypertext prototypes. We do have well-documented, industrial-scale success stories. However, perhaps unsurprisingly, migrating from the lab to the workplace has proven more complex than envisaged, demonstrating the need for greater attention to the sociotechnical embedding of tools.
Analysis of Sensitivity to the Kernel Parameter Choice: Comparing the Performance Profiles Exhibited by Standard andLeast-Squares SVM Classifiers
Authors: Clodoaldo A. M. Lima, Andre L. V. Coelho, Fernando Von Zuben
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Support vector machines (SVMs) have established themselves as a state-of-the-art technique for coping with non-trivial machine learning problems. Among the SVM variants, least-squares SVMs have gained increased attention recently due to the computational benefits they usually entail. Although considered as high-performance models, it is consensual that the applicability of these vector machines depends very much on a proper choice of some control parameters. In this paper, we present a sensitivity analysis study contrasting the performance profiles exhibited by standard and least-squares SVM classifiers with respect to the calibration of the kernel parameter value alone. The results achieved with simulations involving seven datasets indicate that the performance profiles are usually qualitatively similar for the two types of vector machines, both presenting kernel parameter values clearly associated with a better performance, and that the choice of the kernel function seems to be more critical than that of its parameter value.
Federal aviation administration and ada
Authors: Jeff O'Leary
Venue: Proceedings of the 2007 ACM international conference on SIGAda annual international conference (2007)

The US Federal Aviation Administration (FAA) depends upon large, complex and highly available software systems to manage the vast commercial and civil aviation network and to carry out the agency's mission of ensuring high capacity, efficient and extremely safe air travel for the flying public. The FAA's Tower domain provides air traffic control services in the airport environment. There are more than 500 FAA managed Towers. The Terminal Radar Approach Control (TRACON) domain provides air traffic control services in the terminal environment where aircraft are climbing or descending. There are 197 TRACONs. The En Route domain provides air traffic control services typically above 10,000 feet between departure and arrival domains where aircraft achieve their optimal cruise altitude. There are only 21 En Route centers, so each must provide coverage to very large areas. Ada has become a strategic technology in developing and sustaining systems that require high availability and high reliability. The FAA Air Traffic Organization's (ATO) major recent initiative, the En-Route Automation Modernization (ERAM) program goes a long way to reintegrating many disparate system components into a modern composite architecture. This program leverages and significantly expands upon previous Ada based systems, so the FAA has a vital interest in Ada language technology now and for the foreseeable future. Mr. O'Leary will present a federal customer's perspective on systems development and quality, with emphasis on higher reliability, security, and safety. Ada is exceptionally well positioned to support these characteristics, and that is why many current large FAA ATC systems are largely or significantly Ada based. He will touch on past Ada based systems that FAA fielded, the current major ERAM effort, and also where FAA is going in the future with the Next Generation Air Transportation System (NextGen). He will give some insights on what the language and development technologies can contribute towards facilitating the vision of our future. FAA accepts use of DO-278 as a means of assuring systems integrity for Communications, Navigation, Surveillance, and Air Traffic Management (CNS/ATM) software. Ada has also performed well in DO-278.
The disappearing screen: scenarios for audible interfaces
Authors: Daniel Michelis, Florian Resatsch, Thomas Nicolai, Thomas Schildhauer
Venue: Personal and Ubiquitous Computing (2008)

The world of ubiquitous computing, which by definition includes mobile devices of every kind, leads us to an era of small computer devices, usable in everyday situations. Computers are becoming smaller and operate discreetly in the background. This paper deals with the disappearance of the screen that is described and specified according to Lev Manovich. In doing research on radio frequency identification, this paper shows one possible way to interact with ubiquitous computers--primarily exploring suitability and scenarios for audible interfaces. The paper describes a research project of the University of Arts Berlin and the University of St. Gallen and proposes future research questions.
Relevant Information Sources for Successful Technology Transfer: A Survey Using Inspections as an Example
Authors: Andreas Jedlitschka, Marcus Ciolkowski, Christian Denger, Bernd Freimut, Andreas Schlichting
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

A systematic approach to decision making in software engineering is required, for instance, if an organization aims at achieving CMMI level three. Rational decision making regarding the selection and introduction of SE technologies requires adequate information about their suitability for the intended organizational context. Research is often unable to provide such information, and this could be one reason why promising techniques are sometimes not adopted in practice. From a research point of view, successful technology transfer requires knowing which information decision makers in industry need, and where they actually look for it. With this knowledge, empirical research can strive to produce the needed information in order to increase the likelihood of successful technology adoption. To address these questions, we conducted an online survey among German software industry decision makers. To focus the survey, we used inspections as an exemplary technology. We invited 9653 companies to participate, from which we received 92 fully completed questionnaires. Our main findings are that information regarding the impact of technologies on product quality, cost, and development time, as well as on technology cost-benefit ratio is considered most important among decision makers. The preferred sources of information are colleagues, textbooks, and industry workshops.
Diagnosing at-speed scan BIST circuits using a low speed and low memory tester
Authors: Yoshiyuki Nakamura, Thomas Clouqueur, Kewal K. Saluja, Hideo Fujiwara
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Numerous solutions have been proposed to reduce test data volume and test application time during manufacturing testing of digital devices. However, time to market challenge also requires a very efficient debug phase. Error identification in the test responses can become impractically slow in the debug phase due to large debug data, slow tester speed, and limited memory of the tester. In this paper, we investigate the problems and solutions related to using a relatively slow and limited memory tester to observe the at-speed behavior of fast circuits. Our method can identify all errors in at-speed scan BIST environment without any aliasing and using only little extra overhead by way of a multiplexer and masking circuit for diagnosis. Our solution takes into account the relatively slower speed of the tester and the reload time of the expected data to the tester memory due to limited tester memory while reducing the test/debug cost. Experimental results show that the test application time by our method can be reduced by a factor of 10 with very little hardware overhead to achieve such advantage.
Improved FPT algorithm for feedback vertex set problem in bipartite tournament
Authors: Prashant Sasatte
Venue: Information Processing Letters (2008)

We present an O(3^kn^2+n^3) time FPT algorithm for the feedback vertex set problem in a bipartite tournament on n vertices with integral weights. This improves the previously best known O(3.12^kn^4) time FPT algorithm for the problem.
Optimization of Self Checking FIR filters by means of Fault Injection Analysis
Authors: S. Pontarelli, L. Sterpone, G. C. Cardarilli, M. Re, M. Sonza Reorda, A. Salsano, M. Violante
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

In this paper the design of a FIR filter with self checking capabilities based on the residue checking is analyzed. Usually the set of residues used to check the consistency of the results of the FIR filter are based of theoretic considerations about the dynamic range available with a chosen set of residues, the arithmetic characteristics of the errors caused by a fault and on the characteristic of the filter implementation. This analysis is often difficult to perform and, to obtain an acceptable fault coverage the set of chosen residues is overestimated. obtained result a and therefore requires that Instead, in this paper we show how using an exhaustive fault injection campaigns allows to efficiently select the best set of residues. Experimental results coming from fault injection campaigns on a 16 taps FIR filter demonstrated that by observing the occurred errors and the detection modules corresponding to different residue has been possible to reduce the number of detection module, while paying a small reduction of the percentage of SEUs that can be detected.
Finding the Core Point in a Fingerprint
Authors: C. V. Kameswara Rao
Venue: IEEE Transactions on Computers (1978)

A procedure for finding the core point in a fingerprint is presented. The search for the core point is done in steps with increasing resolution, each step indicating for the next step in which subarea of the print to search for the core. This results in a sequence of diminishing areas where the core can be found. The present implementation uses three levels.
Over-encryption: management of access control evolution on outsourced data
Authors: Sabrina De Capitani di Vimercati, Sara Foresti, Sushil Jajodia, Stefano Paraboschi, Pierangela Samarati
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Data outsourcing is emerging today as a successful paradigm allowing users and organizations to exploit external services for the distribution of resources. A crucial problem to be addressed in this context concerns the enforcement of selective authorization policies and the support of policy updates in dynamic scenarios. In this paper, we present a novel solution to the enforcement of access control and the management of its evolution. Our proposal is based on the application of selective encryption as a means to enforce authorizations. Two layers of encryption are imposed on data: the inner layer is imposed by the owner for providing initial protection, the outer layer is imposed by the server to reflect policy modifications. The combination of the two layers provides an efficient and robust solution. The paper presents a model, an algorithm for the management of the two layers, and an analysis to identify and therefore counteract possible information exposure risks.
A Sequential Decision Model for Selecting Feature Subsets in Pattern Recognition
Authors: Yi-Tzuu Chien
Venue: IEEE Transactions on Computers (1971)

This paper deals with a sequential decision model for selecting feature subsets in pattern recognition. Based upon this model, a number of selection strategies are proposed and their properties are investigated. The basic criterion of these selection strategies, which depend only on the last r (r finite) recognition samples, is to maximize the long-run proportion of correct recognition, the maximization being overall possible feature subsets. The sequential model is particularly suitable for the implementation of on-line selection processes often required in pattern recognition. A character recognition experiment has been simulated on a digital computer to demonstrate the feasibility of this approach.
Smooth manifold reconstruction from noisy and non-uniform approximation with guarantees
Authors: Frédéric Chazal, André Lieutier
Venue: Computational Geometry: Theory and Applications (2008)

Given a smooth compact codimension one submanifold S of R^k and a compact approximation K of S, we prove that it is possible to reconstruct S and to approximate the medial axis of S with topological guarantees using unions of balls centered on K. We consider two notions of noisy-approximation that generalize sampling conditions introduced by Amenta et al. and Dey et al. The first one generalizes uniform sampling based on the minimum value of the local feature size. The second one generalizes non-uniform sampling based on the local feature size function of S. The density and noise of the approximation are bounded by a constant times the local feature size function. This constant does not depend on the surface S. Our results are based upon critical point theory for distance functions. For the two approximation conditions, we prove that the connected components of the boundary of unions of balls centered on K are isotopic to S. We consider using both balls of uniform radius and also balls whose radii vary with the local level of detail of the manifold. For the first approximation condition, we prove that a subset (known as the @l-medial axis) of the medial axis of R^k@?K is homotopy equivalent to the medial axis of S. Our results generalize to smooth compact submanifolds S of R^k of any codimension.
A Black-White Representation of a Gray-Scale Picture
Authors: T. H. Morrin
Venue: IEEE Transactions on Computers (1974)

A hardware-implemented algorithm combining dynamic thresholding and edge detection allows black-white representation of gray-scale images for computer storage. The output resembles a highly detailed sketch, with resolution and contrast superior to a halftone representation. The same algorithm can be applied to text and line drawings, so that all three types of images can be stored using the same compression algorithm.
A Study of a Bi-symmetric Electro-mechanical System through Umbra-Lagrangian Generated by Bondgraphs, and Noether's Theorem
Authors: Amalendu Mukherjee, Vikas Rastogi, Anirvan Dasgupta
Venue: Simulation (2007)

This paper presents a dynamic analysis of an electro-mechanical system through the umbra-Lagrange's equation proposed in a previous paper, which includes dissipative and non-potential fields in a compact Lagrangian form. An eXtended Noether's theorem along with an umbra-Hamiltonian is employed to get invariants of motion, or possible invariant trajectories. The umbra-Lagrangian of this electro-mechanical system is obtained through an eXtended Karnopp's algorithm. The major contribution of this paper is the dynamic analysis eXploiting the symmetries of an electromechanical system comprising an eXternally and internally damped, symmetric, elastic rotor driven by a two-phase induction motor. For such a system the umbra-Lagrangian remains unchanged under two families of continuous transformations. The behavior of the limiting dynamics is obtained and validated through simulations. The stability issue of this system is also eXamined. Similar analysis is also eXtended to an identical rotor driven by a three-phase induction motor. As SO (2) symmetries are not obvious in this case due to the presence of three stator inertances, the three-phase induction motor is reduced to an equivalent SO (2) symmetric two-phase induction motor, to which the analysis is applied.
Generation of Right-Linear Grammars from Regular Expressions
Authors: A. R. Patel
Venue: IEEE Transactions on Computers (1971)

A finite state language can be represented by a regular expression or a right-linear grammar. An algorithm to generate a right-linear grammar for regular expression is presented. The algorithm can be implemented on computers. A Snobol 4 program for this algorithm was written for the IBM 360/65 with success.
Transform Coding for Hardware-accelerated Volume Rendering
Authors: Nathaniel Fout, Kwan-Liu Ma
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Hardware-accelerated volume rendering using the GPU is now the standard approach for real-time volume rendering, although limited graphics memory can present a problem when rendering large volume data sets. Volumetric compression in which the decompression is coupled to rendering has been shown to be an effective solution to this problem; however, most existing techniques were developed in the context of software volume rendering, and all but the simplest approaches are prohibitive in a real-time hardware-accelerated volume rendering context. In this paper we present a novel block-based transform coding scheme designed specifically with real-time volume rendering in mind, such that the decompression is fast without sacrificing compression quality. This is made possible by consolidating the inverse transform with dequantization in such a way as to allow most of the reprojection to be precomputed. Furthermore, we take advantage of the freedom afforded by off-line compression in order to optimize the encoding as much as possible while hiding this complexity from the decoder. In this context we develop a new block classification scheme which allows us to preserve perceptually important features in the compression. The result of this work is an asymmetric transform coding scheme that allows very large volumes to be compressed and then decompressed in real-time while rendering on the GPU.
Wagging Wikipedia's long tail
Authors: Shane Greenstein
Venue: IEEE Micro (2007)

In 2005, Wikipedia surpassed Encarta as the Internet's most popular reference site. Wikipedia calls itself "the free encyclopedia that anyone can edit," and it has grown rapidly since its founding in 2001. As an educator and parent, Greenstein finds himself struggling to come to terms with the economics of Wikipedia, which have shaped a resource that is at times very good, but occasionally poor. The inconsistency is a result of Wikipedia's long tail, a characteristic that requires some explanation. And thereby hangs a tale.
Parsing Silhouettes without Boundary Curvature
Authors: Ralf Juengling, Lakshman Prasad
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

We describe a new decomposition algorithm for two-dimensional, polygonal shapes. The algorithm first finds a set of overlapping ribbon-like subshapes ("ribbons") by grouping skeleton fragments into long smooth spines. The parts are then obtained by cutting the ribbons along lines of mutual intersection. With this approach we find part cuts that obey heuristic rules of early vision [17] without using boundary curvature.