Search results for "Computation"
showing 10 items of 7362 documents
The Mediation of Politics through Twitter: An Analysis of Messages posted during the Campaign for the German Federal Election 2013
2015
Patterns found in digital trace data are increasingly used as evidence of social phenomena. Still, the role of digital services not as mirrors but instead as mediators of social reality has been neglected. We identify characteristics of this mediation process by analyzing Twitter messages referring to politics during the campaign for the German federal election 2013 and comparing the thus emerging image of political reality with established measurements of political reality. We focus on the relationship between temporal dynamics in politically relevant Twitter messages and crucial campaign events, comparing dominant topics in politically relevant tweets with topics prominent in surveys and …
An optimized mass storage FFT for vector computers
1995
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.
Detecting Emotions in Comments on Forums
2014
The paper presents one of the most important issues in Natural Language Processing (NLP), emotion identification and classification to implement a computational technology based on existing resources, open-source or freely available for research purposes. Furthermore, we are interested to use it for establishing Gold standards in sentiment analysis area, such as SentiWordNet. In this sense, we propose to recognize and classify the emotions (sentiments) of the public consumer from the written texts which appeared on the various Forums. We analyse the writing style which refers to how consumers construct sentences together when they write comments to indicate their passion about an entity (pe…
Pretraining and Fine-Tuning Strategies for Sentiment Analysis of Latvian Tweets
2020
In this paper, we present various pre-training strategies that aid in im-proving the accuracy of the sentiment classification task. We, at first, pre-trainlanguage representation models using these strategies and then fine-tune them onthe downstream task. Experimental results on a time-balanced tweet evaluation setshow the improvement over the previous technique. We achieve 76% accuracy forsentiment analysis on Latvian tweets, which is a substantial improvement over pre-vious work
New separation between $s(f)$ and $bs(f)$
2011
In this note we give a new separation between sensitivity and block sensitivity of Boolean functions: $bs(f)=(2/3)s(f)^2-(1/3)s(f)$.
A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
2014
Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy, is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity. Previously the best known lower bound was $C_1(f)\geq \frac{bs_0(f)}{2 s_0(f)}$, achieved by Kenyon and Kutin. We improve this to $C_1(f)\geq \frac{3 bs_0(f)}{2 s_0(f)}$. While this improvement is only by a constant factor, this is quite important, as it precludes achi…
MultivariateApart: Generalized partial fractions
2021
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied to terms of a sum separately. The package is designed to work in Mathematica, but also provides interfaces to the Form and Singular computer algebra systems.
Introduction to the GiNaC Framework for Symbolic Computation within the C++ Programming Language
2002
AbstractThe traditional split into a low level language and a high level language in the design of computer algebra systems may become obsolete with the advent of more versatile computer languages. We describe GiNaC, a special-purpose system that deliberately denies the need for such a distinction. It is entirely written in C++and the user can interact with it directly in that language. It was designed to provide efficient handling of multivariate polynomials, algebras and special functions that are needed for loop calculations in theoretical quantum field theory. It also bears some potential to become a more general purpose symbolic package.
Una Aportación A La Lingüística: Los Sonidos Del Habla Y Su Organización Funcional
2007
The aim of this paper is to make a contribution to the study of the functional organization of phonological units, by assuming the theoretical and methodological perspective of mathematical Chaos Theory. Indexes of structuration and redundancy of the systems that contain these kinds of units are defined and a sample of languages is analyzed following this criterion. The treatment of the data in statistical terms, i.e. the number of phonological units of a language, indexes of structuration and the relationship between the number of phonological units and indexes of structuration, reveals a meaningful distance to normal distribution. The treatment of the data by means of Lyapunov test permit…
Collusion constrained equilibrium
2018
We study collusion within groups in non-cooperative games. The primitives are the preferences of the players, their assignment to non-overlapping groups and the goals of the groups. Our notion of collusion is that a group coordinates the play of its members among different incentive compatible plans to best achieve its goals. Unfortunately, equilibria that meet this requirement need not exist. We instead introduce the weaker notion of collusion constrained equilibrium. This allows groups to put positive probability on alternatives that are suboptimal for the group in certain razor's edge cases where the set of incentive compatible plans changes discontinuously. These collusion constrained e…