A querela do direito autoral na segunda metade do Oitocentos

Esta dissertação tem como objetivo identificar e analisar os principais debates no contexto histórico que antecedeu a votação da primeira lei de direitos autorais no Brasil, em meados de 1898. Devido à abrangência do tema, a pesquisa debruçou-se sobre o direito autoral literário. Esse debate se processou de forma intermitente, ao longo da segunda metade do século XIX, envolvendo alguns nomes da política e da literatura nacional. Nesse sentido, o pilar central do trabalho pautou-se na análise de projetos de lei e debates registrados em Anais da Câmara dos Deputados, ou seja, de iniciativas e atos de fala formulados sobre autoria e suas circunstâncias morais e econômicas. A fim de contribuir para a contextualização do debate político sobre direitos autorais, foi analisada brevemente a relação entre o escritor de textos literários e o editor. Recorrendo a crônicas, contratos de edição, recibos e processos judiciais, pretendeu-se enriquecer a discussão sobre posicionamentos e práticas dessas duas personagens históricas. O viés interpretativo, embasado na análise dessas fontes, possibilitou pensar a dimensão que a discussão sobre os direitos autorais assumiu no respectivo período. Longe de ter sido um debate restrito ao mundo literário e editorial, ele ganhou o espaço político, trazendo à tona experiências, expectativas e contradições.

Cluster analysis of heterogeneous rank data

Cluster analysis of ranking data, which occurs in consumer questionnaires, voting forms or other inquiries of preferences, attempts to identify typical groups of rank choices. Empirically measured rankings are often incomplete, i.e. different numbers of filled rank positions cause heterogeneity in the data. We propose a mixture approach for clustering of heterogeneous rank data. Rankings of different lengths can be described and compared by means of a single probabilistic model. A maximum entropy approach avoids hidden assumptions about missing rank positions. Parameter estimators and an efficient EM algorithm for unsupervised inference are derived for the ranking mixture model. Experiments on both synthetic data and real-world data demonstrate significantly improved parameter estimates on heterogeneous data when the incomplete rankings are included in the inference process.

A new distance for scale-invariant 3D shape recognition and registration

This paper presents a method for vote-based 3D shape recognition and registration, in particular using mean shift on 3D pose votes in the space of direct similarity transforms for the first time. We introduce a new distance between poses in this spacethe SRT distance. It is left-invariant, unlike Euclidean distance, and has a unique, closed-form mean, in contrast to Riemannian distance, so is fast to compute. We demonstrate improved performance over the state of the art in both recognition and registration on a real and challenging dataset, by comparing our distance with others in a mean shift framework, as well as with the commonly used Hough voting approach. © 2011 IEEE.

Scale-invariant vote-based 3D recognition and registration from point clouds

This chapter presents a method for vote-based 3D shape recognition and registration, in particular using mean shift on 3D pose votes in the space of direct similarity transformations for the first time. We introduce a new distance between poses in this spacethe SRT distance. It is left-invariant, unlike Euclidean distance, and has a unique, closed-form mean, in contrast to Riemannian distance, so is fast to compute. We demonstrate improved performance over the state of the art in both recognition and registration on a (real and) challenging dataset, by comparing our distance with others in a mean shift framework, as well as with the commonly used Hough voting approach. © 2013 Springer-Verlag Berlin Heidelberg.

机器人视觉导航中的实时在线识别算法研究

随着移动机器人应用范围的日益扩展，在动态、非结构化环境下提高其自主导航能力已经成为移动机器人研究领域迫切需要解决的问题。在机器人自主导航关键技术中，识别技术是最难解决、也是最急需解决的问题。视觉作为导航中的重要传感器，与其他传感器相比具有信息量大、重量轻便、功耗低等诸多优势，因此基于视觉的识别技术也被公认为最具潜力的研究方向。 本文以国防基础研究项目和中科院开放实验室基金项目为依托，以沈阳自动化所自主研发的“轮腿复合结构机器人”和“无人机”为实验平台，针对地面自主机器人和无人机自主导航中迫切需要解决的应用问题，有针对性的展开研究，旨在提高移动机器人在动态、非结构化环境下的适应能力。 本论文的主要内容如下： 首先，为了提高复杂环境下地面移动机器人的自主能力，本文提出了一种基于立体视觉的面向室外非结构化环境障碍物检测算法。文中首先给出了一种可以从V视差图(V-disparity image)中有效估计地面主视差（Main Ground Disparity, MGD)的方法。随后，我们利用由粗到精逐步判断的方式，来识别疑似障碍和最终障碍并对障碍进行定位。最后，该方法已在地面自主移动平台得到实际应用。通过在各种场景下的实验，验证了该方法的准确性和快速性。 其次，以无人机天际线识别为背景，提出了一种准确、实时的天际线识别算法，并由此估计姿态角。通过对天际线建立能量泛函模型，利用变分原理推出相应偏微分方程。在实际应用中出于对实时性的考虑，引入分段直线约束对该模型进行简化，然后利用由粗到精的思想识别天际线。具体做法是：首先，对图像预处理并垂直剖分，然后利用简化的水平直线模型对天际线进行粗识别，通过拟合获得天际线粗识别结果，最后在基于梯度和区域混合开曲线模型约束下精确识别天际线，并由此估计无人机滚动和俯仰姿态角。 第三，通过对红外机场跑道的目标特性进行分析，文中设计了一种新的基于1D Haar 小波的并行的红外图像分割算法的；然后，有针对性的对分割区域提取特征；最后，两种常用的识别方法，支持向量机（SVM）和投票法（Voting）被用于对疑似目标区域进行分类和识别。通过对实际视频和红外仿真图片的测试，验证了本文算法的快速性、可靠性和实时性，该算法每帧平均处理时间为30ms。 最后，针对无人机空中巡逻中对人群进行自动监控所遇到的问题，通过将此类问题简化为固定视角下人流密度监测问题，提出了一种全新的基于速度场估计的越线人流计数和区域内人流密度估计算法。 首先，该算法把越线的人流当成运动的流场，给出了一种有效估计1D速度场的运动估计模型；然后，通过对动态人流进行速度估计和积分，将越线人流的拼接成动态区域；最后，对各个动态区域提取面积和边缘信息，利用回归分析实现对人流密度估计。该方法与以往基于场景学习的方法不同，本文是一种基于角度的学习，因此便于实际应用。

混合模式识别系统研究

讨论基于多种分类方法的模块组合实现的混合模式识别系统，它不同于利用多分类器输出结果表决的集成系统．提出两个系统：一个面向印刷体汉字文本识别，另一个面向自由手写体数字识别．利用多种特征和多种分类方法的组合、部分识别信息控制混淆字判别策略以及提出的动态模板库匹配后处理方法，使系统的性能与传统单一分类器系统比较，获得明显改善．实验表明：多方法多策略混合是解决复杂和增强系统鲁棒性的一条途径

Confirmation of Data Mining Based Predictions of Protein Function

King, R. D. and Wise, P. H. and Clare, A. (2004) Confirmation of Data Mining Based Predictions of Protein Function. Bioinformatics 20(7), 1110-1118

Devolution and Electoral Politics in Scotland and Wales

Scully, Roger, and R. Wyn Jones, 'Devolution and Electoral Politics in Scotland and Wales', Publius, (2006) 36(1) pp.115-134 RAE2008

People and Politics in France, 1848-1870

Price, Roger, People and Politics in France, 1848-1870 (Cambridge: Cambridge University Press, 2004), pp.x+477 RAE2008

Ergodicity and Mixing Rate of One-Dimensional Cellular Automata

One-and two-dimensional cellular automata which are known to be fault-tolerant are very complex. On the other hand, only very simple cellular automata have actually been proven to lack fault-tolerance, i.e., to be mixing. The latter either have large noise probability ε or belong to the small family of two-state nearest-neighbor monotonic rules which includes local majority voting. For a certain simple automaton L called the soldiers rule, this problem has intrigued researchers for the last two decades since L is clearly more robust than local voting: in the absence of noise, L eliminates any finite island of perturbation from an initial configuration of all 0's or all 1's. The same holds for a 4-state monotonic variant of L, K, called two-line voting. We will prove that the probabilistic cellular automata Kε and Lε asymptotically lose all information about their initial state when subject to small, strongly biased noise. The mixing property trivially implies that the systems are ergodic. The finite-time information-retaining quality of a mixing system can be represented by its relaxation time Relax(⋅), which measures the time before the onset of significant information loss. This is known to grow as (1/ε)^c for noisy local voting. The impressive error-correction ability of L has prompted some researchers to conjecture that Relax(Lε) = 2^(c/ε). We prove the tight bound 2^(c1log^21/ε) ＜ Relax(Lε) ＜ 2^(c2log^21/ε) for a biased error model. The same holds for Kε. Moreover, the lower bound is independent of the bias assumption. The strong bias assumption makes it possible to apply sparsity/renormalization techniques, the main tools of our investigation, used earlier in the opposite context of proving fault-tolerance.

On the Relationship Between the Generalized Equality Classifier and ART 2 Neural Networks

In this paper, we introduce the Generalized Equality Classifier (GEC) for use as an unsupervised clustering algorithm in categorizing analog data. GEC is based on a formal definition of inexact equality originally developed for voting in fault tolerant software applications. GEC is defined using a metric space framework. The only parameter in GEC is a scalar threshold which defines the approximate equality of two patterns. Here, we compare the characteristics of GEC to the ART2-A algorithm (Carpenter, Grossberg, and Rosen, 1991). In particular, we show that GEC with the Hamming distance performs the same optimization as ART2. Moreover, GEC has lower computational requirements than AR12 on serial machines.

Fuzzy ART

Adaptive Resonance Theory (ART) models are real-time neural networks for category learning, pattern recognition, and prediction. Unsupervised fuzzy ART and supervised fuzzy ARTMAP synthesize fuzzy logic and ART networks by exploiting the formal similarity between the computations of fuzzy subsethood and the dynamics of ART category choice, search, and learning. Fuzzy ART self-organizes stable recognition categories in response to arbitrary sequences of analog or binary input patterns. It generalizes the binary ART 1 model, replacing the set-theoretic: intersection (∩) with the fuzzy intersection (∧), or component-wise minimum. A normalization procedure called complement coding leads to a symmetric: theory in which the fuzzy inter:>ec:tion and the fuzzy union (∨), or component-wise maximum, play complementary roles. Complement coding preserves individual feature amplitudes while normalizing the input vector, and prevents a potential category proliferation problem. Adaptive weights :otart equal to one and can only decrease in time. A geometric interpretation of fuzzy AHT represents each category as a box that increases in size as weights decrease. A matching criterion controls search, determining how close an input and a learned representation must be for a category to accept the input as a new exemplar. A vigilance parameter (p) sets the matching criterion and determines how finely or coarsely an ART system will partition inputs. High vigilance creates fine categories, represented by small boxes. Learning stops when boxes cover the input space. With fast learning, fixed vigilance, and an arbitrary input set, learning stabilizes after just one presentation of each input. A fast-commit slow-recode option allows rapid learning of rare events yet buffers memories against recoding by noisy inputs. Fuzzy ARTMAP unites two fuzzy ART networks to solve supervised learning and prediction problems. A Minimax Learning Rule controls ARTMAP category structure, conjointly minimizing predictive error and maximizing code compression. Low vigilance maximizes compression but may therefore cause very different inputs to make the same prediction. When this coarse grouping strategy causes a predictive error, an internal match tracking control process increases vigilance just enough to correct the error. ARTMAP automatically constructs a minimal number of recognition categories, or "hidden units," to meet accuracy criteria. An ARTMAP voting strategy improves prediction by training the system several times using different orderings of the input set. Voting assigns confidence estimates to competing predictions given small, noisy, or incomplete training sets. ARPA benchmark simulations illustrate fuzzy ARTMAP dynamics. The chapter also compares fuzzy ARTMAP to Salzberg's Nested Generalized Exemplar (NGE) and to Simpson's Fuzzy Min-Max Classifier (FMMC); and concludes with a summary of ART and ARTMAP applications.

Fuzzy ARTMAP: A Neural Network Architecture for Incremental Supervised Learning of Analog Multidimensional Maps

A new neural network architecture is introduced for incremental supervised learning of recognition categories and multidimensional maps in response to arbitrary sequences of analog or binary input vectors. The architecture, called Fuzzy ARTMAP, achieves a synthesis of fuzzy logic and Adaptive Resonance Theory (ART) neural networks by exploiting a close formal similarity between the computations of fuzzy subsethood and ART category choice, resonance, and learning. Fuzzy ARTMAP also realizes a new Minimax Learning Rule that conjointly minimizes predictive error and maximizes code compression, or generalization. This is achieved by a match tracking process that increases the ART vigilance parameter by the minimum amount needed to correct a predictive error. As a result, the system automatically learns a minimal number of recognition categories, or "hidden units", to met accuracy criteria. Category proliferation is prevented by normalizing input vectors at a preprocessing stage. A normalization procedure called complement coding leads to a symmetric theory in which the MIN operator (Λ) and the MAX operator (v) of fuzzy logic play complementary roles. Complement coding uses on-cells and off-cells to represent the input pattern, and preserves individual feature amplitudes while normalizing the total on-cell/off-cell vector. Learning is stable because all adaptive weights can only decrease in time. Decreasing weights correspond to increasing sizes of category "boxes". Smaller vigilance values lead to larger category boxes. Improved prediction is achieved by training the system several times using different orderings of the input set. This voting strategy can also be used to assign probability estimates to competing predictions given small, noisy, or incomplete training sets. Four classes of simulations illustrate Fuzzy ARTMAP performance as compared to benchmark back propagation and genetic algorithm systems. These simulations include (i) finding points inside vs. outside a circle; (ii) learning to tell two spirals apart; (iii) incremental approximation of a piecewise continuous function; and (iv) a letter recognition database. The Fuzzy ARTMAP system is also compared to Salzberg's NGE system and to Simpson's FMMC system.

Comparative Performance Measures of Fuzzy ARTMAP, Learned Vector Quantization, and Back Propagation for Handwritten Character Recognition

This article compares the performance of Fuzzy ARTMAP with that of Learned Vector Quantization and Back Propagation on a handwritten character recognition task. Training with Fuzzy ARTMAP to a fixed criterion used many fewer epochs. Voting with Fuzzy ARTMAP yielded the highest recognition rates.

An analysis of political efficacy socialisation among threshold voters in the Republic of Ireland

The spread of democracy in the latter part of the twenty first century has been accompanied by an increasing focus on its perceived performance in established western democracies. Recent literature has expressed concern about a critical outlook among younger cohorts which threatens their political support and engagement. Political efficacy, referring to the feeling of political effectiveness, is considered to be a key indicator of the performance of democratic politics; as it refers to the empowerment of citizens, and relates to their willingness to engage in political matters. The aim of this thesis is to analyse the socialisation of political efficacy among those on the threshold of political adulthood; i.e., 'threshold voters'. The long-term significance of attitudes developed by time of entry to adulthood for political engagement during adulthood has been emphasised in recent literature. By capturing the effect of non-political and political learning among threshold voters, the study advances existing research frames which focus on childhood and early adolescent socialisation. The theoretical and methodological framework applied herein recognises the distinction between internal and external political efficacy, which has not been consistently operationalized in existing research on efficacy socialisation. This research involves a case study of 'threshold voters' in the Republic of Ireland, and employs a quantitative methodology. A study on Irish threshold voters is timely as the parliament and government have recently proposed a lowering of the voting age and an expansion of formal political education to this age group. A project-specific survey instrument was developed and administered to a systematic stratified sample of 1,042 post-primary students in the Cork area. Interpretation of the results of statistical analysis leads to findings on the divergent influence of family, school, associational, and political agents/environments on threshold voter internal and external political efficacy.