Determining when the absolute state complexity of a Hermitian code achieves its DLP bound

Let g be the genus of the Hermitian function field H/F(q)2 and let C-L(D,mQ(infinity)) be a typical Hermitian code of length n. In [Des. Codes Cryptogr., to appear], we determined the dimension/length profile (DLP) lower bound on the state complexity of C-L(D,mQ(infinity)). Here we determine when this lower bound is tight and when it is not. For m less than or equal to n-2/2 or m greater than or equal to n-2/2 + 2g, the DLP lower bounds reach Wolf's upper bound on state complexity and thus are trivially tight. We begin by showing that for about half of the remaining values of m the DLP bounds cannot be tight. In these cases, we give a lower bound on the absolute state complexity of C-L(D,mQ(infinity)), which improves the DLP lower bound. Next we give a good coordinate order for C-L(D,mQ(infinity)). With this good order, the state complexity of C-L(D,mQ(infinity)) achieves its DLP bound (whenever this is possible). This coordinate order also provides an upper bound on the absolute state complexity of C-L(D,mQ(infinity)) (for those values of m for which the DLP bounds cannot be tight). Our bounds on absolute state complexity do not meet for some of these values of m, and this leaves open the question whether our coordinate order is best possible in these cases. A straightforward application of these results is that if C-L(D,mQ(infinity)) is self-dual, then its state complexity (with respect to the lexicographic coordinate order) achieves its DLP bound of n /2 - q(2)/4, and, in particular, so does its absolute state complexity.

Dopant extraction from scanning capacitance microscopy measurements of p-n junctions using combined inverse modeling and forward simulation

This article proposes a more accurate approach to dopant extraction using combined inverse modeling and forward simulation of scanning capacitance microscopy (SCM) measurements on p-n junctions. The approach takes into account the essential physics of minority carrier response to the SCM probe tip in the presence of lateral electric fields due to a p-n junction. The effects of oxide fixed charge and interface state densities in the grown oxide layer on the p-n junction samples were considered in the proposed method. The extracted metallurgical and electrical junctions were compared to the apparent electrical junction obtained from SCM measurements. (C) 2002 American Institute of Physics.

Empirical evidence for ultrametric structure in multi-layer perceptron error surfaces

Combinatorial optimization problems share an interesting property with spin glass systems in that their state spaces can exhibit ultrametric structure. We use sampling methods to analyse the error surfaces of feedforward multi-layer perceptron neural networks learning encoder problems. The third order statistics of these points of attraction are examined and found to be arranged in a highly ultrametric way. This is a unique result for a finite, continuous parameter space. The implications of this result are discussed.

The impact of genotyping error on haplotype reconstruction and frequency estimation

The choice of genotyping families vs unrelated individuals is a critical factor in any large-scale linkage disequilibrium (LD) study. The use of unrelated individuals for such studies is promising, but in contrast to family designs, unrelated samples do not facilitate detection of genotyping errors, which have been shown to be of great importance for LD and linkage studies and may be even more important in genotyping collaborations across laboratories. Here we employ some of the most commonly-used analysis methods to examine the relative accuracy of haplotype estimation using families vs unrelateds in the presence of genotyping error. The results suggest that even slight amounts of genotyping error can significantly decrease haplotype frequency and reconstruction accuracy, that the ability to detect such errors in large families is essential when the number/complexity of haplotypes is high (low LD/common alleles). In contrast, in situations of low haplotype complexity (high LD and/or many rare alleles) unrelated individuals offer such a high degree of accuracy that there is little reason for less efficient family designs. Moreover, parent-child trios, which comprise the most popular family design and the most efficient in terms of the number of founder chromosomes per genotype but which contain little information for error detection, offer little or no gain over unrelated samples in nearly all cases, and thus do not seem a useful sampling compromise between unrelated individuals and large families. The implications of these results are discussed in the context of large-scale LD mapping projects such as the proposed genome-wide haplotype map.

Voluntary disclosure of forward-looking earnings forecasts in Australia

This study examines the voluntary disclosure of future earnings information in annual reports for Australian listed companies. We find that most Australian companies in our sample do not provide quantitative earnings, forecasts in their annual reports, although more than half of the sample do disclose forward-looking information relating to earnings, without specifically disclosing point estimates for the future. These companies mostly supply qualitative information with a positive bias, while the remainder of the sample discloses no forward-looking information relating to earnings. Our findings also suggest that larger companies with less volatile earnings tend to provide more future earnings information than smaller companies with relatively volatile earnings.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 2. Residuals analysis and a case study

In Part 1 of this paper a methodology for back-to-back testing of simulation software was described. Residuals with error-dependent geometric properties were generated. A set of potential coding errors was enumerated, along with a corresponding set of feature matrices, which describe the geometric properties imposed on the residuals by each of the errors. In this part of the paper, an algorithm is developed to isolate the coding errors present by analysing the residuals. A set of errors is isolated when the subspace spanned by their combined feature matrices corresponds to that of the residuals. Individual feature matrices are compared to the residuals and classified as 'definite', 'possible' or 'impossible'. The status of 'possible' errors is resolved using a dynamic subset testing algorithm. To demonstrate and validate the testing methodology presented in Part 1 and the isolation algorithm presented in Part 2, a case study is presented using a model for biological wastewater treatment. Both single and simultaneous errors that are deliberately introduced into the simulation code are correctly detected and isolated. Copyright (C) 2003 John Wiley Sons, Ltd.

A formação de educadores e a travessia de cercas invisíveis de acesso/produção de conhecimentos : experiências do MST nas inter-relações com universidades brasileiras /

Este estudo sistematiza e aborda a temática da formação de educadores desenvolvida nas inter-relações entre universidades brasileiras e o Movimento dos Trabalhadores Rurais Sem Terra, especificamente nos cursos de graduação em História na Universidade Federal da Paraíba e de Engenharia Agronômica na Universidade Federal de Sergipe, no período de 2004 a 2008. Tal processo desenvolve-se em um contexto difícil e complexo da luta pela reforma agrária no Brasil, principalmente pelas transformações ocorridas nos últimos anos oriundas da ampliação das lógicas de produção do agronegócio. Esta condição leva o MST a discutir e propor uma nova concepção de reforma agrária que a designa de popular em substituição à proposta de reforma agrária clássica. Por outro lado, apresenta uma visão das universidades brasileiras e dos projetos que são construídos e implementados nos últimos anos, inclusive, observando coincidências com as políticas econômicas gerais para a sociedade. Apresenta uma concepção de formação que vem sendo construída no interior das práticas do MST que também procura as universidades para firmar convênios e desenvolver processos de escolarização/formação de seus militantes educadores. Dentre as dimensões desse processo educativo/formativo, destacam-se: vínculo permanente com os processos orgânicos; a formação como um processo ético, estético, místico que trata das atitudes/comportamentos e como um processo dialógico, crítico e articulado que contempla saberes, experiências, em uma interação que busca superar as monoculturas. Captura por intermédio da pesquisa de campo: estranhamentos, entraves, sentidos da ocupação pedagógica e coletiva, alternativas, legados que permanecem tanto no MST como na universidade e apresenta o resultado do envolvimento e atuação dos egressos de ambos os cursos na atualidade. Aponta também para desafios, possibilidades outras de enfrentar a difícil mas necessária tarefa de formar educadores, militantes capazes de coletivamente levar adiante a luta por um mundo mais justo, solidário e democrático, em que a terra e o conhecimento, juntamente com os demais bens econômicos e culturais sejam profundamente democratizados. Pretende ser uma contribuição para o debate acerca da relevância dessas inter-relações entre universidade e movimentos sociais, em que essas experiências demarcam novas possibilidades de abertura e avanços democráticos e menos elitista da universidade e novos patamares de escolarização/formação para integrantes do Movimento dos Sem Terra.

GUI Inspection from Source Code Analysis

Graphical user interfaces (GUIs) are critical components of todays software. Given their increased relevance, correctness and usability of GUIs are becoming essential. This paper describes the latest results in the development of our tool to reverse engineer the GUI layer of interactive computing systems. We use static analysis techniques to generate models of the user interface behaviour from source code. Models help in graphical user interface inspection by allowing designers to concentrate on its more important aspects. One particularly type of model that the tool is able to generate is state machines. The paper shows how graph theory can be useful when applied to these models. A number of metrics and algorithms are used in the analysis of aspects of the user interface's quality. The ultimate goal of the tool is to enable analysis of interactive system through GUIs source code inspection.

GUI Behavior from Source Code Analysis

When developing interactive applications, considering the correctness of graphical user interfaces (GUIs) code is essential. GUIs are critical components of today's software, and contemporary software tools do not provide enough support for ensuring GUIs' code quality. GUIsurfer, a GUI reverse engineering tool, enables evaluation of behavioral properties of user interfaces. It performs static analysis of GUI code, generating state machines that can help in the evaluation of interactive applications. This paper describes the design, software architecture, and the use of GUIsurfer through an example. The tool is easily re-targetable, and support is available to Java/Swing, and WxHaskell. The paper sets the ground for a generalization effort to consider rich internet applications. It explores the GWT web applications' user interface programming toolkit.

The GUISurfer tool: towards a language independent approach to reverse engineering GUI code

Graphical user interfaces (GUIs) are critical components of today's software. Developers are dedicating a larger portion of code to implementing them. Given their increased importance, correctness of GUIs code is becoming essential. This paper describes the latest results in the development of GUISurfer, a tool to reverse engineer the GUI layer of interactive computing systems. The ultimate goal of the tool is to enable analysis of interactive system from source code.