Extending Implicit Computational Complexity and Abstract Machines to Languages with Control

The Curry-Howard isomorphism is the idea that proofs in natural deduction can be put in correspondence with lambda terms in such a way that this correspondence is preserved by normalization. The concept can be extended from Intuitionistic Logic to other systems, such as Linear Logic. One of the nice conseguences of this isomorphism is that we can reason about functional programs with formal tools which are typical of proof systems: such analysis can also include quantitative qualities of programs, such as the number of steps it takes to terminate. Another is the possiblity to describe the execution of these programs in terms of abstract machines. In 1990 Griffin proved that the correspondence can be extended to Classical Logic and control operators. That is, Classical Logic adds the possiblity to manipulate continuations. In this thesis we see how the things we described above work in this larger context.

Isomorfismo tra alberi: algoritmi e complessità computazionale

La trattazione è volta all'esposizione dell'algoritmo di Lindell per determinare in logspazio se due alberi sono isomorfi. Un'ampia parte introduttiva richiama i prerequisiti teorici necessari alla comprensione della parte di esposizione dell'algoritmo.

Applied Graph Theory in Computer Vision and Pattern Recognition

This book will serve as a foundation for a variety of useful applications of graph theory to computer vision, pattern recognition, and related areas. It covers a representative set of novel graph-theoretic methods for complex computer vision and pattern recognition tasks. The first part of the book presents the application of graph theory to low-level processing of digital images such as a new method for partitioning a given image into a hierarchy of homogeneous areas using graph pyramids, or a study of the relationship between graph theory and digital topology. Part II presents graph-theoretic learning algorithms for high-level computer vision and pattern recognition applications, including a survey of graph based methodologies for pattern recognition and computer vision, a presentation of a series of computationally efficient algorithms for testing graph isomorphism and related graph matching tasks in pattern recognition and a new graph distance measure to be used for solving graph matching problems. Finally, Part III provides detailed descriptions of several applications of graph-based methods to real-world pattern recognition tasks. It includes a critical review of the main graph-based and structural methods for fingerprint classification, a new method to visualize time series of graphs, and potential applications in computer network monitoring and abnormal event detection.

Evaluating Family Preservation in Nevada: A University-State Agency Collaboration

In this paper, concepts from the emerging family-centered paradigm in child welfare and mental health are applied to evaluative research in family preservation: the ecological perspective, enhancement of competence, a consumer orientation, and collaborative relationships. The experience of family preservation research collaborators from the School of Social Work at the University of Nevada, Reno and the Nevada Division of Child and Family Services illustrate these concepts. The researchers apply the theory of isomorphism to the research endeavor to produce eight principles of effective research partnerships derived from family-centered concepts and their own experiences.

Suitability of artificial neural networks for designing LoC circuits

he simulation of complex LoC (Lab-on-a-Chip) devices is a process that requires solving computationally expensive partial differential equations. An interesting alternative uses artificial neural networks for creating computationally feasible models based on MOR techniques. This paper proposes an approach that uses artificial neural networks for designing LoC components considering the artificial neural network topology as an isomorphism of the LoC device topology. The parameters of the trained neural networks are based on equations for modeling microfluidic circuits, analogous to electronic circuits. The neural networks have been trained to behave like AND, OR, Inverter gates. The parameters of the trained neural networks represent the features of LoC devices that behave as the aforementioned gates. This would mean that LoC devices universally compute.

Evolución de los niveles de éxito en la resolución de problemas de estructura multiplicativa en Educación Primaria

Este estudio se centra en examinar la evolución en los niveles de éxito en la resolución de problemas de estructura multiplicativa por estudiantes de Educación Primaria (desde 1º a 6º curso, alumnos de 6 a 12 años). Los resultados indican que, en función de las categorías, los problemas de producto de medida fueron los más difíciles en todos los cursos y los problemas de isomorfismos de medida los más fáciles, mientras que los de comparación multiplicativa se mantuvieron entre ambos. Por el contrario, la evolución de los niveles de éxito en función de la clase de problema, no fue uniforme a lo largo de la educación primaria para los problemas de isomorfismo de medida pero sí en las otras dos categorías.

Results on singularities of pairs

Thesis (Ph.D.)--University of Washington, 2016-06

Solution of the dual reflection equation for A(n-1)((1)) solid-on-solid model

We obtain a diagonal solution of the dual reflection equation for the elliptic A(n-1)((1)) solid-on-solid model. The isomorphism between the solutions of the reflection equation and its dual is studied. (C) 2004 American Institute of Physics.

Experimenting with infinite groups, I

A group is termed parafree if it is residually nilpotent and has the same nilpotent quotients as a given free group. Since free groups are residually nilpotent, they are parafree. Nonfree parafree groups abound and they all have many properties in common with free groups. Finitely presented parafree groups have solvable word problems, but little is known about the conjugacy and isomorphism problems. The conjugacy problem plays an important part in determining whether an automorphism is inner, which we term the inner automorphism problem. We will attack these and other problems about parafree groups experimentally, in a series of papers, of which this is the first and which is concerned with the isomorphism problem. The approach that we take here is to distinguish some parafree groups by computing the number of epimorphisms onto selected finite groups. It turns out, rather unexpectedly, that an understanding of the quotients of certain groups leads to some new results about equations in free and relatively free groups. We touch on this only lightly here but will discuss this in more depth in a future paper.

On the spectrum of non-Denniston maximal arcs in PG(2,2h)

In 1969, Denniston gave a construction of maximal arcs of degree n in Desarguesian projective planes of even order q, for all n dividing q. Recently, Mathon gave a construction method that generalized that of Denniston. In this paper we use that method to give maximal arcs that are not of Dermiston type for all n dividing q, 4 < n < q/2, q even. It is then shown that there are a large number of isomorphism classes of such maximal arcs when n is approximately rootq. (C) 2003 Elsevier Ltd. All rights reserved.

Low density parity check codes: a statistical physics perspective

The modem digital communication systems are made transmission reliable by employing error correction technique for the redundancies. Codes in the low-density parity-check work along the principles of Hamming code, and the parity-check matrix is very sparse, and multiple errors can be corrected. The sparseness of the matrix allows for the decoding process to be carried out by probability propagation methods similar to those employed in Turbo codes. The relation between spin systems in statistical physics and digital error correcting codes is based on the existence of a simple isomorphism between the additive Boolean group and the multiplicative binary group. Shannon proved general results on the natural limits of compression and error-correction by setting up the framework known as information theory. Error-correction codes are based on mapping the original space of words onto a higher dimensional space in such a way that the typical distance between encoded words increases.

An exploratory study of management accounting and control systems in a developing country

This thesis reports on the results of case studies in four commercial banks in Nigeria. The study focuses how management accounting and control systems (MCS) operate in the four banks. The study is motivated by the dearth of literature on management accounting practices in the developing world in general and in Nigeria in specific. The case study approach adopted in conducting the research was useful in exploring the dynamics of the MCS in the organisations. Data was gathered from two sources. First, semi-structured interviews were conducted with managers at the head office, regional office and branches of each bank. The participants were selected from different backgrounds and managerial levels to provide broader understanding of the operations of the MCS. Second, various internal and external documents were reviewed to provide supporting evidence for the interview results. New institutional sociology (NIS) provided the theoretical framework to understand the results. NIS provided explanations for how the MCS in the four banks were shaped by diverse external and internal factors. The key factors identified as shaping the operations of the MCS were the need to comply with the regulatory environment (coercive isomorphism), the need to maintain social and cultural support (normative isomorphism) and the need to imitate successful organisations in order to appear legitimate (mimetic isomorphism). The study also examines the interplay between the institutional forces, market forces and infra-organisational power relations. This analysis is necessary to overcome the criticism of NIS that it downplays the role of market forces, agency and intra-organisational relations. The findings of the study have implications for understanding the operations of MCS in the developing world.

What is Q-extension?

In this paper we present a developed software in the area of Coding Theory. Using it, codes with given properties can be classified. A part of this software can be used also for investigations (isomorphisms, automorphism groups) of other discrete structures-combinatorial designs, Hadamard matrices, bipartite graphs etc.

Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.

Corporate governance and compliance with International Financial Reporting Standards (IFRSs):evidence from two MENA stock exchanges

This study examines the influence of corporate governance structures on the levels of compliance with IFRSs disclosure requirements by companies listed on the stock exchanges of two leading MENA (Middle East and North Africa) countries, Egypt and Jordan. This study employs a cross-sectional analysis of a sample of non-financial companies listed on the two stock exchanges for the fiscal year 2007. Using an unweighted disclosure index, the study measures the levels of compliance by companies listed on the two stock exchanges investigated.Univariate and multivariate regression analyses are used to estimate the relationships proposed in the hypotheses. In addition, the study uses semi-structured interviews in order to supplement the interpretation of the findings of the quantitative analyses. An innovative theoretical foundation is deployed, in which compliance is interpretable through three lenses - institutional isomorphism theory, secrecy versus transparency (one of Gray’s accounting sub-cultural values), and financial economics theories. The study extends the financial reporting literature, cross-national comparative financial disclosure literature, and the emerging markets disclosure literature by carrying out one of the first comparative studies of the above mentioned stock exchanges. Results provide evidence of a lack of de facto compliance (i.e., actual compliance) with IFRSs disclosure requirements in the scrutinised MENA countries. The impact of corporate governance mechanisms for best practice on enhancing the extent of compliance with mandatory IFRSs is absent in the stock exchanges in question. The limited impact of corporate governance best practice is mainly attributed to the novelty of corporate governance in the region, a finding which lends support to the applicability of the proposed theoretical foundation to the MENA context. Finally, the study provides recommendations for improving de facto compliance with IFRSs disclosure requirements and corporate governance best practice in the MENA region and suggests areas for future research.