122,189 research outputs found
A nonlinear least squares solution of a minimax estimation problem for stationary time series
No full text
Robust estimation for stationary ARMA time series
No full textRapporti di Ricerca del Dipartimento Metodi Quantitativi, Università degli Studi di Brescia, Quaderno n. 29
Stime minimax per serie storiche stazionarie
No full textRapporti di Ricerca del Dipartimento Metodi Quantitativi, Università degli Studi di Brescia, Quaderno n. 258
Variable Data Rate Architectures in Optical LEO Direct-to-Earth Links: Design Aspects and System Analysis
No full textIn the frame of ongoing efforts between space agencies to define an on-off-keying-based optical low-Earth-orbit (LEO) direct-to-Earth (DTE) waveform, this paper offers an in-depth analysis of the Variable Data Rate (VDR) technique. VDR, in contrast to the currently adopted Constant Data Rate (CDR) approach, enables the optimization of the average throughput during a LEO pass over the optical ground station (OGS). The analysis addresses both critical link level aspects, such as receiver (time, frame, and amplitude) synchronization, as well as demonstrates the benefits stemming from employing VDR at system level
Minimax estimation based on a L1-metric loss function for stationary time series
No full textRapporti di Ricerca del Dipartimento Metodi Quantitativi, Università degli Studi di Brescia, Quaderno n. 27
A Multi-Language Comparison of Influences on Author Verification using Character N-Grams
No full textWe create a new multi-language corpus for author verification based on Wikipedia talkpages, and evaluate the influence that differences in topic and time have on character n-gram author profiles. Topic alignment between two texts is found to increase author verification precision, and an authors writing style is found to change over time, but not more significantly after 3 years than after 1 year.Information ArchitectureWISElectrical Engineering, Mathematics and Computer Scienc
Appropriate Similarity Measures for Author Cocitation Analysis
No full textWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
The vanishing author in computer-generated works: a critical analysis of recent Australian case law
No full textAbstract
The use of software is ubiquitous in the creation of many copyright works, yet the requirement in copyright law that every work have a human author who engages in independent intellectual effort means that its use may prevent copyright subsistence. Several recent Australian cases have refocused attention on authorship as an essential criterion of copyright subsistence, and these cases suggest that much computer-produced output may be authorless and thus lack copyright protection. This article, the first in a two-part series, analyses how each case deals with the question of authorship of computer-produced works and why the use of software diminishes copyright protection for a significant number of computer-generated works. The article critiques the application of conventional notions of human authorship developed in the pre-computer age to modern productions and suggests alternative approaches to authorship that satisfy both the major objectives of copyright policy and the need to adapt to the computer age. The article argues that, without a broader judicial approach to authorship of computer-generated works, Parliament must remedy the lacuna in protection for these ‘authorless’ works. Possible solutions for reform are suggested. In a forthcoming article, the author comprehensively examines those reform proposals
Distributed Î2-Assignment on graphs?
No full textConsider a set of items and a set of m colors, where each item is associated to one color. Consider also n computational agents connected by an arbitrary graph. Each agent initially holds a subset of the items. We analyze the problem of distributively assigning colors to agents in such a way that (a) each color is assigned to one agent only and (b) the number of different colors assigned to each agent is minimum (c) the number of items initially assigned to agents that are not consistent with the assignment of colors is minimum. This problem, known in the centralized setting as a matching problem, has been introduced in the distributed setting in [3] for the simple ring topology. Here, we generalize the problem to arbitrary graphs, by solving it with a distributed algorithm which is eficient both in terms of time complexity and message complexity for a large class of graphs. Namely, our results can be outlined as follows. We prove a lower bound on the message complexity ofÏ (m/n D2), where D is the diameter of the graph. We give a distributed deterministic algorithm with time complexity O(maxn2;Dlog qg) and message complexity O (n/log n) (log q+mlogm) , where q is the maximum number of items of a given color held by an agent. It can be noticed that for a large class of instances of practical interest, namely for m O(nc), for some constant c, and q ⬠O(mm), our algorithm exhibits a message complexity of O(m n), which turns out to be optimal, in view of our lower bound, for graphs with diameter linear in the number of nodes. We finally show that the cost of our solution for arbitrary graphs is at most three times the optimal cost (found by a centralized algorithm)
- …
