ppxscal/embedding_network huggingface dataset:
Probabilistic spherical Marcinkiewicz-Zygmund inequalities
Authors: Albrecht Böttcher, Stefan Kunis, Daniel Potts
Venue: Journal of Approximation Theory (2009)

Recently, norm equivalences between spherical polynomials and their sample values at scattered sites have been proved. These so-called Marcinkiewicz-Zygmund inequalities involve a parameter that characterizes the density of the sampling set and they are applicable to all polynomials whose degree does not exceed an upper bound that is determined by the density parameter. We show that if one is satisfied by norm equivalences that hold with prescribed probability only, then the upper bound for the degree of the admissible polynomials can be enlarged significantly and that then, moreover, there exist fixed sampling sets which work for polynomials of all degrees.
Complexity of Bezout&#x2019;s Theorem VII: Distance Estimates in the Condition Metric
Authors: Carlos Beltr&#x00e1;n, Michael Shub
Venue: Foundations of Computational Mathematics (2009)

We study geometric properties of the solution variety for the problem of approximating solutions of systems of polynomial equations. We prove that given the two pairs (f i ,&#x03b6; i ), i=1,2, there exist a short path joining them such that the complexity of following the path is bounded by the logarithm of the condition number of the problems.
Accurate system-level performance modeling and workload characterization for mobile internet devices
Authors: Mitchell Hayenga, Chander Sudanthi, Mrinmoy Ghosh, Prakash Ramrakhyani, Nigel Paver
Venue: Proceedings of the 9th workshop on MEmory performance: DEaling with Applications, systems and architecture (2008)

As mobile applications and devices become ubiquitous, consumer demands for performance, power efficiency, and connectivity are increasing. The software framework existing on mobile internet devices is a complex interaction of real-time tasks, non-real-time applications, and operating system management routines. Traditional simulation approaches are poorly suited to modeling the overall performance characteristics of such systems. Additionally, many traditional benchmark suites used in academia and industry for microprocessor benchmarking and design have been found to be unrepresentative of mobile workloads. This paper presents multiple frameworks utilized for accurately modeling system-level performance of embedded systems used for mobile applications. Furthermore, this paper provides an in-depth workload characterization and memory-level analysis of internet and media-centric applications. All workload characterization is performed running full operating systems and software stacks. For comparison purposes, the system-level analysis is performed at three distinct levels: Full RTL emulation with device peripherals, software-level emulation, and through performance counters on real-world devices. The same mobile workload and operating system is run across all of these platforms.
Expander flows, geometric embeddings and graph partitioning
Authors: Sanjeev Arora, Satish Rao, Umesh Vazirani
Venue: Journal of the ACM (JACM) (2009)

We give a O(&sqrt;log n)-approximation algorithm for the sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leighton and Rao (1988). We use a well-known semidefinite relaxation with triangle inequality constraints. Central to our analysis is a geometric theorem about projections of point sets in Rd, whose proof makes essential use of a phenomenon called measure concentration. We also describe an interesting and natural &ldquo;approximate certificate&rdquo; for a graph's expansion, which involves embedding an n-node expander in it with appropriate dilation and congestion. We call this an expander flow.
Neural-Net Based Modeling of Velocity and Concentration Fields
Authors: I. Kimura, A. Yoke, A. Kaga, Y. Kuroe
Venue: Journal of Visualization (2009)

This paper proposes a novel algorithm using an artificial neural network for modeling simultaneously both a 3-D flow velocity vector and a concentration field. The neural network is trained so that four outputted values of the network, three components of a 3-D velocity vector and a concentration of substances such as air pollutants or bacilli, agree with measured ones and additionally the continuity and diffusion equations are satisfied in the flow field. An approximate model for the velocity and concentration field can be constructed in the neural network from sparsely measured data. When any 3-D position, (x, y, z), is inputted to the neural network model, it outputs a 3-D velocity vector and a concentration at the position. The entire 3-D velocity vector and concentration field, therefore, can be easily estimated using the model. To validate the algorithm, the smoke concentration distribution estimated from a very limited set of measured data is compared with the measured one in which most of the data is unused for the modeling. Even from sparsely measured velocity vectors and smoke concentrations, the novel algorithm gives the entire concentration distribution whose flow characteristics are almost similar to the experimental result.
A user-friendly CAD tool for the rigorous and efficient analysis of planar waveguiding structures for millimetre applications
Authors: Alicia Casanueva, Óscar González, Ana Grande, Naima Amar Touhami, Ma Isabel Zamanillo
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper we present the computation of the Planar Waveguiding Structures using the Transverse Resonance method and Spectral Domain Analysis suitable for the design of microwave and millimeter-wave integrated circuits. However, this powerful method has one drawback when many hybrid modes are required because the above technique is used to yield a homogeneous system of equations to determine the propagation constants. In this work and in order to avoid this difficulty, once the equations are written in terms of the transverse components of the fields in the spectral domain, Galerkin's method is used to yield a homogeneous system of equations to determine the propagation constants, but due to the new approach formulation the equations can be rewritten as a linear matrix eigenvalue system for the propagation constant when the eigenvectors of an auxiliary problem are used to expand the modes of the original problem. The key issue of the present study is to use an expanding set of modes at cutoff as auxiliary eigenvectors First, we have obtained the Hybrid and Complex Spectrum of various finlines configurations. This analysis includes the characteristic impedance, attenuation due to dielectric and conductor losses, and the effect of finite metallization thickness. Secondly, configurations of the field components were also studied. We also present a software package; all examples are developed for numerical computation using MATLAB. Comparison with previously accurate published data was performed to confirm the accuracy of our procedure.
Indexing of Spatio-Temporal Telemetric Data Based on Adaptive Multi-Dimensional Bucket Index
Authors: Marcin Gorawski, Adam Dyga
Venue: Fundamenta Informaticae (2009)

This paper describes the idea of a multi-dimensional bucket index designed for efficient indexing of telemetric readings. This data structure answers spatio-temporal range queries concerning utility usage within user selected region and time. In addition, it has a capability to adjust to incoming data and therefore is suitable to process data of highly dynamic nature. The paper also presents a stochastic prediction method to estimate utility usage in the near future.
Combining Features for Shape and Motion Trajectory of Video Objects for Efficient Content Based Video Retrieval
Authors: A. Dyana, M. P. Subramanian, Sukhendu Das
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper proposes a system for content based video retrieval based on shape and motion features of the video object. We have used Curvature scale space for shape representation and Polynomial curve fitting for trajectory representation and retrieval. The shape representation is invariant to translation, rotation and scaling and robust with respect to noise. Trajectory matching incorporates visual distance, velocity dissimilarity and size dissimilarity for retrieval. The cost of matching two video objects is based on shape and motion features, to retrieve similar video shots. We have tested our system on standard synthetic databases. We have also tested our system on real world databases. Experimental results have shown good performance.
Note: Compressed depth sequences
Authors: Travis Gagie
Venue: Theoretical Computer Science (2009)

We show how, given a probability distribution P over a set of size n, in O(n) time we can construct an efficient data structure that stores a code with less than 3 bits redundancy, and takes o(n) bits of space when P consists of o(n/logn) runs of nearly equal probabilities.
Medical Informatics: A Model Developed for Diabetes Education Via Telemedicine
Authors: Elif Derya Übeyli
Venue: Journal of Medical Systems (2009)

Fast developments in information and communication technology (ICT) have made it possible to develop new services for people. One of the most interesting areas is health care. Medical informatics is the discipline concerned with the systematic processing of data, information and knowledge in medicine and health care. Information services, medical decision support systems and telemedicine are becoming important tools for medical professionals and also people who are interested in health related information. Medical decision support aims at providing health care professionals with therapy guidelines directly at the point of care. Telemedicine is the use of modern telecommunications and information technologies (IT) for the provision of clinical care to individuals at a distance and transmission of information to provide that care. In the present study, usage of IT in medicine, medical decision support systems, computerized medical measurements, patient education and network connectivity were described. A model for risk evaluation, data collection and education of undiagnosed diabetes using the world wide web (www) was presented.
Image Retrieval Using the Longest Approximate Common Subsequences
Authors: Wen-Chen Hu, Mark S. Schmalz, Gerhard X. Ritter
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

Accurate and fast retrieval as well as efficient storage are two principal needs in an image database. Image search methods are the crucial factors in fulfilling these requirements. The longest common subsequence search method is mostly used in string-based image databases. However, a longest common subsequence does not always reveal the degree of difference between two strings. This research proposes a new image matching method, i.e., finding a longest approximate common subsequence of two strings. The experimental results show any image in the system can be precisely retrieved as long as each image has a unique image string, where accuracy of image retrieval depends on the level of query detail.
Reformulation in mathematical programming: An application to quantum chemistry
Authors: Leo Liberti, Carlile Lavor, Nelson Maculan, Marco Antonio Chaer Nascimento
Venue: Discrete Applied Mathematics (2009)

This paper concerns the application of reformulation techniques in mathematical programming to a specific problem arising in quantum chemistry, namely the solution of Hartree-Fock systems of equations, which describe atomic and molecular electronic wave functions based on the minimization of a functional of the energy. Their traditional solution method does not provide a guarantee of global optimality and its output depends on a provided initial starting point. We formulate this problem as a multi-extremal nonconvex polynomial programming problem, and solve it with a spatial Branch-and-Bound algorithm for global optimization. The lower bounds at each node are provided by reformulating the problem in such a way that its convex relaxation is tight. The validity of the proposed approach was established by successfully computing the ground-state of the helium and beryllium atoms.
Novel Conventional Standard Linear Element Based Complete Passive Equivalent Circuit Models of the Practical OTA-Based Inductors
Authors: Rawid Banchuin, Boonruk Chipipop, Boonchareon Sirinaovakul
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In this research, the practical OTA-based inductors of all structures have been studied and their complete passive equivalent circuit models, where the effects of both parasitic elements and finite opened-loop bandwidth have been taken into account, also contain only the conventional standard linear elements i.e. the ordinary resistor, inductor and capacitor, without any infeasible high order element e.g. super inductor etc., have been proposed. The resulting models have been found to be excellently accurate, excellently straight forward, far superior to the previously proposed ones and completely realizable by the passive elements. Hence, the proposed passive equivalent circuit models have been found to be the convenience and versatile tools for the implementation of any analog and mixed signal processing circuits and systems.
Writing less code: an approachable ideal
Authors: Naomi Lee Bloom
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

We are being inundated by a sea of unsatisfied user expectations. This growing, and sometimes frightening, backlog of application development requests has been much discussed but little reduced. One almost universal approach to reducing this backlog has been to try to improve the productivity of our scarce technical resources (programmers, systems analysts, etc.). A more promising approach to meeting user application needs may be to substantially reduce the amount of new code needed to satisfy these needs. It takes no great insight to become convinced that, other things being equal, the less code written to achieve a specific level of systems support, the less risk, cost, elapsed time, and frustration must be accepted by the organization. This paper presents a brief survey of some common, and some less obvious, applications-enabling techniques. Two of the most promising techniques, foundation software and adaptable application packages, are more fully described in separate papers.
Improved HDR image reconstruction method
Authors: András Rövid, Péter Várlaki
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Recently, the importance of information enhancement methods in digital image processing has increased significantly. A large amount of research has been focused on information retrieval and image understanding. High dynamic range (HDR) of illumination may cause serious distortions and other problems in viewing and further processing of digital images. This paper describes a new algorithm for HDR image creation based on merging images taken with different exposure time.
Dynamic hybrid automatic repeat request (DHARQ) for WiMAX - Mobile multihop relay using adaptive power control
Authors: Rashid A. Saeed, Hafizal Mohamad, Borhanuddin Mohd. Ali
Venue: Computer Communications (2009)

Wireless multihop network is currently attracting much attention as a new wireless broadband access technology due to numerous benefits. This work proposes a power control scheme for WiMAX multihop relay system. In contrast to existing power control and optimization approaches, our proposed method uses an adaptive Channel Quality Measurement for a relay station to reduce interferences to other mobile station (MS) or relay station (RS) within the same cell and hence increase the number of hops per link and consequently maximize the spatial reuse. The proposed power control is applied to a new dynamic HARQ algorithm for adaptive channel quality enhancement. Simulation results have indicated that the proposed approach achieves superior BER/PER performance enhancement in comparison to previous related works.
CoLoSS: The Coalgebraic Logic Satisfiability Solver
Authors: Georgel Calin, Rob Myers, Dirk Pattinson, Lutz Schröder
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

CoLoSS, the Coalgebraic Logic Satisfiability Solver, decides satisfiability of modal formulas in a generic and compositional way. It implements a uniform polynomial space algorithm to decide satisfiability for modal logics that are amenable to coalgebraic semantics. This includes e.g. the logics K, KD, Pauly's coalition logic, graded modal logic, and probabilistic modal logic. Logics are easily integrated into CoLoSS by providing a complete axiomatisation of their coalgebraic semantics in a specific format. Moreover, CoLoSS is compositional: it synthesises decision procedures for modular combinations of logics that include the fusion of two modal logics as a special case. One thus automatically obtains reasoning support e.g. for logics interpreted over probabilistic automata that combine non-determinism and probabilities in different ways.
Segmentation and supervised classification of image objects in Epo doping-control
Authors: Ivan Bajla, Franti&#x0161;ek Rubl&#x00ed;k, Barbora Arendack&#x00e1;, Igor Farka&#x0161;, Kl&#x00e1;ra Horni&#x0161;ov&#x00e1;, Svorad &#x0160;tolc, Viktor Witkovsk&#x00fd;
Venue: Machine Vision and Applications (2009)

A software system Gel Analysis System for Epo (GASepo) has been developed within an international WADA project. As recent WADA criteria of rEpo positivity are based on identification of each relevant object (band) in Epo images, development of suitable methods of image segmentation and object classification were needed for the GASepo system. In the paper we address two particular problems: segmentation of disrupted bands and classification of the segmented objects into three or two classes. A novel band projection operator is based on convenient object merging measures and their discrimination analysis using specifically generated training set of segmented objects. A weighted ranks classification method is proposed, which is new in the field of image classification. It is based on ranks of the values of a specific criterial function. The weighted ranks classifiers proposed in our paper have been evaluated on real samples of segmented objects of Epo images and compared to three selected well-known classifiers: Fisher linear classifier, Support Vector Machine, and Multilayer Perceptron.
Ant Colony Optimization and the Minimum Spanning Tree Problem
Authors: Frank Neumann, Carsten Witt
Venue: Learning and Intelligent Optimization: Second International Conference, LION 2007 II, Trento, Italy, December 8-12, 2007. Selected Papers (2008)

Ant Colony Optimization (ACO) is a kind of metaheuristic that has become very popular for solving problems from combinatorial optimization. Solutions for a given problem are constructed by a random walk on a so-called construction graph. This random walk can be influenced by heuristic information about the problem. In contrast to many successful applications, the theoretical foundation of this kind of metaheuristic is rather weak. Theoretical investigations with respect to the runtime behavior of ACO algorithms have been started only recently for the optimization of pseudo-Boolean functions.We present the first comprehensive rigorous analysis of a simple ACO algorithm for a combinatorial optimization problem. In our investigations, we consider the minimum spanning tree problem and examine the effect of two construction graphs with respect to the runtime behavior. The choice of the construction graph in an ACO algorithm seems to be crucial for the success of such an algorithm. First, we take the input graph itself as the construction graph and analyze the use of a construction procedure that is similar to Broder's algorithm for choosing a spanning tree uniformly at random. After that, a more incremental construction procedure is analyzed. It turns out that this procedure is superior to the Broder-based algorithm and produces additionally in a constant number of iterations a minimum spanning tree if the influence of the heuristic information is large enough.
MNCM: a critical node matching approach to scheduling for input buffered switches with no speedup
Authors: Vahid Tabatabaee, Leandros Tassiulas
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

In this paper, we use fluid model techniques to es-tablish new results for the throughput of input-buffered switches. Dai and Prabhakar have shown that any maximal size matching algorithm with speedup of 2 achieves 100% throughput. We introduce the maximum node containing matching (MNCM), which is a new class of matching algorithms that achieve 100% throughput with no speedup. The only assumption on the arrival processes is they satisfy the strong law of large numbers (SLLN). The MNCM policies only need to include ports whose weight (backlog) are above a threshold in the matching rather than finding a matching with maximum total weight. This simplified requirement enables us to introduce a new matching algorithm, maximum first matching (MFM), with O(N2.5) complexity. We show that MFM is a low-complexity algorithm with good delay performance. We also provide a deterministic upper bound for the buffering requirement of a switch with an MNCM scheduler, when the ports incoming traffic are admissible and (σ, ρ) regulated.
Engagement: gaming throughout the curriculum
Authors: Briana B. Morrison, Jon A. Preston
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper considers how gaming has been infused into the computing curriculum of institutions in the United States. To increase motivation of students and improve retention, many programs have begun using gaming in their introductory courses, as upper level electives, or as separate degree programs. The authors review the current use of gaming within curricula and analyze the content of game development degree programs. Finally, the authors describe plans at their institution to incorporate gaming throughout the computing curriculum and present initial results.
Discrete elastic rods
Authors: Miklós Bergou, Max Wardetzky, Stephen Robinson, Basile Audoly, Eitan Grinspun
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

We present a discrete treatment of adapted framed curves, parallel transport, and holonomy, thus establishing the language for a discrete geometric model of thin flexible rods with arbitrary cross section and undeformed configuration. Our approach differs from existing simulation techniques in the graphics and mechanics literature both in the kinematic description---we represent the material frame by its angular deviation from the natural Bishop frame---as well as in the dynamical treatment---we treat the centerline as dynamic and the material frame as quasistatic. Additionally, we describe a manifold projection method for coupling rods to rigid-bodies and simultaneously enforcing rod inextensibility. The use of quasistatics and constraints provides an efficient treatment for stiff twisting and stretching modes; at the same time, we retain the dynamic bending of the centerline and accurately reproduce the coupling between bending and twisting modes. We validate the discrete rod model via quantitative buckling, stability, and coupled-mode experiments, and via qualitative knot-tying comparisons.