Щоб переглянути інші типи публікацій з цієї теми, перейдіть за посиланням: Abstract.
Дисертації з теми "Abstract"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 дисертацій для дослідження на тему "Abstract".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте дисертації для різних дисциплін та оформлюйте правильно вашу бібліографію.
1
Frisk, Anders. "On the structure of standardly stratified algebras /." Uppsala, 2004. http://www.math.uu.se/research/pub/Frisk5lic.pdf.
Повний текст джерела
2
Teichmann, Roger. "Abstract entities." Thesis, University of Oxford, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.315954.
Повний текст джерела
3
Kappers, Michael. "VIRTUALLY ABSTRACT." Master's thesis, University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4011.
Повний текст джерелаАнотація:
My most recent body of work frees me from traditional animation and graphic design principles that had become second nature in my creative practice over years of commercial work in industry. I now find myself unconsciously creating shape and form without a preconceived vision of the final outcome. This allows for a free-flowing approach to my canvas. The canvas in which my forms are created is virtual space and can be described as an infinite cube. The first step I take in each of my pieces is creating a cube with the center residing at Cartesian coordinates 0,0,0. From there, I make the decision either to subdivide the cube into sections or extrude faces from the cube. In either case, I begin to see the possibilities in which the form can take. Some forms are organic and rhythmic while others become machined and rigid. At this stage, color and light are not a part of the equation.M.F.A.
Department of Art
Arts and Humanities
Studio Art and the Computer MFA
4
Haller, Leopold Carl Robert. "Abstract satisfaction." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:68f76f3a-485b-4c98-8d02-5e8d6b844b4e.
Повний текст джерелаАнотація:
This dissertation shows that satisfiability procedures are abstract interpreters. This insight provides a unified view of program analysis and satisfiability solving and enables technology transfer between the two fields. The framework underlying these developments provides systematic recipes that show how intuition from satisfiability solvers can be lifted to program analyzers, how approximation techniques from program analyzers can be integrated into satisfiability procedures and how program analyzers and satisfiability solvers can be combined. Based on this work, we have developed new tools for checking program correctness and for solving satisfiability of quantifier-free first-order formulas. These tools outperform existing approaches. We introduce abstract satisfaction, an algebraic framework for applying abstract interpre- tation to obtain sound, but potentially incomplete satisfiability procedures. The framework allows the operation of satisfiability procedures to be understood in terms of fixed point computations involving deduction and abduction transformers on lattices. It also enables satisfiability solving and program correctness to be viewed as the same algebraic problem. Using abstract satisfaction, we show that a number of satisfiability procedures can be understood as abstract interpreters, including Boolean constraint propagation, the dpll and cdcl algorithms, St ̊almarck’s procedure, the dpll(t) framework and solvers based on congruence closure and the Bellman-Ford algorithm. Our work leads to a novel understand- ing of satisfiability architectures as refinement procedures for abstract analyses and allows us to relate these procedures to independent developments in program analysis. We use this perspective to develop Abstract Conflict-Driven Clause Learning (acdcl), a rigorous, lattice-based generalization of cdcl, the central algorithm of modern satisfiability research. The acdcl framework provides a solution to the open problem of lifting cdcl to new prob- lem domains and can be instantiated over many lattices that occur in practice. We provide soundness and completeness arguments for acdcl that apply to all such instantiations. We evaluate the effectiveness of acdcl by investigating two practical instantiations: fp-acdcl, a satisfiability procedure for the first-order theory of floating point arithmetic, and cdfpl, an interval-based program analyzer that uses cdcl-style learning to improve the precision of a program analysis. fp-acdcl is faster than competing approaches in 80% of our benchmarks and it is faster by more than an order of magnitude in 60% of the benchmarks. Out of 33 safe programs, cdfpl proves 16 more programs correct than a mature interval analysis tool and can conclusively determine the presence of errors in 24 unsafe benchmarks. Compared to bounded model checking, cdfpl is on average at least 260 times faster on our benchmark set.
5
Mofleh, Amer Ibrahim. "Abstract payment undertakings : to what extent are they truly abstract?" Thesis, University of Leicester, 2005. http://hdl.handle.net/2381/31087.
Повний текст джерелаАнотація:
This work examines to what extent documentary credits and demand guarantees are, and should, be treated as autonomous or abstract from the underlying contract that leads to their issuance. This question is of vital importance to the commercial parties that utilise these instruments. The answer to it determines many of their duties, liabilities, the risks they undertake and the remedies available to them. While documentary credits and demand guarantees share some characteristics, both instruments serve different commercial functions. As such, the legal principles governing each instrument should be tailored to fit its functions. This point and the relevant legal and commercial issues relating to it will be examined thoroughly in Chapters 1 and 2. Chapters 3 and 4 will critically analyse the different approaches developed by the English courts when dealing with the autonomy of these instruments. It will be demonstrated that the rules they have developed in this area of law are inconsistent, in some instances contradictory, commercially unsound and do not reflect the traders' perceptions of the instruments. This unsatisfactory outcome has resulted from the English courts' (i) failure to distinguish between documentary credits and demand guarantees; (ii) insistence on applying to these instruments particular doctrines which developed outside their context; and (iii) failure to develop any clear framework by which they can abide when dealing with the issue of autonomy. Chapter 5 examines the autonomy principle in demand guarantees and documentary credits where third parties are involved. Finally, Chapter 6 examinees to what extent a documentary credit and a demand guarantee may be affected by illegality in the underlying transaction. In addition, it will analyse whether banks issuing such instruments are entitled to exercise a right of set-off by against the beneficiary of these instruments.
6
Wong, Hong-Yee. "Abstract scene specifications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq21323.pdf.
Повний текст джерела
7
Schneider, Kevin A. "Abstract user interfaces." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ56099.pdf.
Повний текст джерела
8
Desharnais, Jules. "Abstract relational semantics." Thesis, McGill University, 1989. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=75986.
Повний текст джерелаАнотація:
Abstract relational algebra is used to define the semantics of a simple imperative language. In order to carry out this task, various domains are specified by relational axioms. Some specifications define relations on the basic types of the language (Booleans and natural numbers); their presentation stresses the importance of the concept of point. Other specifications construct the relational domains whose relations are used to denote programs. The programming constructs that are defined include expressions, variable declarations, assignment statements, while-program statements and procedures. A particularity of the semantic definitions is that the relations denoting a program fragment depend only on the fragment, and not on its environment (procedure calls excepted). Finally, it is shown how the semantics of a program fragment can be used to prove its correctness relative to a specification. The result is a uniform abstract relational setting for specification, semantics and program derivation.
9
Mathiesen, Erik Arne. "Abstract hoare logic." Thesis, Queen Mary, University of London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497518.
Повний текст джерела
10
Ahmed, Amna Mohamed Abdelgader. "Abstract topological dynamics." Thesis, University of Birmingham, 2012. http://etheses.bham.ac.uk//id/eprint/3503/.
Повний текст джерелаАнотація:
Let \(\char{cmmi10}{0x54}\) : \(\char{cmmi10}{0x58}\) → \(\char{cmmi10}{0x58}\) be a function from a countably infinite set \(\char{cmmi10}{0x58}\) to itself. We consider the following problem: can we put a structure on \(\char{cmmi10}{0x58}\) with respect to which \(\char{cmmi10}{0x54}\) has some meaning? In this thesis, the following questions are addressed: when can we endow \(\char{cmmi10}{0x58}\) with a topology such that \(\char{cmmi10}{0x58}\) is homeomorphic to the rationals \(\char{msbm10}{0x51}\) and with respect to which \(\char{cmmi10}{0x54}\) is continuous? We characterize such functions on the rational world. The other question is: can we put an order on \(\char{cmmi10}{0x58}\) with respect to which \(\char{cmmi10}{0x58}\) is order-isomorphic to the rationals \(\char{msbm10}{0x51}\), naturals \(\char{msbm10}{0x4e}\) or integers \(\char{msbm10}{0x5a}\) with their usual orders and with respect to which \(\char{cmmi10}{0x54}\) is order-preserving (or order-reversing)? We give characterization of such bijections, injections and surjections on the rational world and of arbitrary maps on the naturals and integers in terms of the orbit structure of the map concerned.
11
Fredriksson, Olle. "Distributing abstract machines." Thesis, University of Birmingham, 2015. http://etheses.bham.ac.uk//id/eprint/6196/.
Повний текст джерелаАнотація:
Today's distributed programs are often written using either explicit message passing or Remote Procedure Calls (RPCs) that are not natively integrated in the language. It is difficult to establish the correctness of programs written this way compared to programs written for a single computer. We propose a generalisation of RPCs that are natively integrated in a functional programming language meaning that they have support for higher-order calls across node boundaries. Our focus is on how such languages can be compiled correctly and efficiently. We present four different solutions. Two of them are based on interaction semantics --- the Geometry of Interaction and game semantics --- and two are extensions of conventional abstract machines --- the Krivine machine and the SECD machine. To target as general distributed systems as possible our solutions support RPCs without sending code. We prove the correctness of the abstract machines with respect to their single-node execution, and show their viability for use for compilation by implementing prototype compilers based on them. The conventionally based machines are shown to enable efficient programs. Our intention is that these abstract machines can form the foundation for future programming languages that use the idea of higher-order RPCs.
12
Vandevoorde, Cheyenne(Cheyenne Jacqueline Louis). "Into the abstract." Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/129853.
Повний текст джерелаАнотація:
Thesis: M. Arch., Massachusetts Institute of Technology, Department of Architecture, February, 2020Cataloged from student-submitted thesis.
Includes bibliographical references (pages 108-109).
"Must we not then renounce the object altogether, throw it to the winds and instead lay bare the purely abstract?" - Vasily Kandinsky, 1911 Abstraction is a form of contemplation. It is a means to produce new, while honoring the essential. It advocates for expression and the non-determined. It is about opportunity. As such, abstraction has a prolific history that infiltrates most, if not all, forms of creative expression. The act of abstraction has grappled with the issues of representation, the objective and the narrative for the sake of something new. Either in Malevich's Black Square, Cage's 4'33" or Man Ray's Tears, abstraction has been used as a way to engage the zeitgeist and to radicalize our perception, thus propelling us forward. Through abstraction, form has an opportunity to produce a range of effects and emotional responses freed from semantics. Abstraction, instead of controlling the narrative, provides the chance to harness the power of the most essential aspects of a thing in order to prompt new readings and new expectations from our experience with the created world. Abstraction subverts the conventional method of arriving at the truth in an effort to perceive the truth through new perspectives. Into the Abstract questions the potential of abstraction as a method and its role in architecture. It seeks out to understand what an abstract method might be, how it can be used and what may be produced. This thesis is not about purism, minimalism, or reductivism. It is not about reduction or removal, but rather about "essentializing." This inquiry will take place on the sites of four distinct houses. Each will attempt its own approach to abstraction with results to be determined.
by Cheyenne Vandevoorde.
M. Arch.
M.Arch. Massachusetts Institute of Technology, Department of Architecture
13
Zsidó, Julianna. "Typed abstract syntax." Nice, 2010. http://www.theses.fr/2010NICE4103.
Повний текст джерелаАнотація:
Afin de spécifier le comportement des langages de programmation, de préciser leurs propriétés et de certifier leurs implémentations, on étudie des modèles formels des langages de programmation. L'étude se divise en l'étude de la syntaxe et en celle de la sémantique. La deuxième est basée sur des modèles formels de la syntaxe. Cette thèse de doctorat se situe dans l'étude de la syntaxe et est consacrée principalement à deux approches à la syntaxe abstraite typée avec liaison de variables. Ces deux approches utilisent le langage de la théorie des catégories. La première approche est dans l'esprit de l'approche catégorique aux théories algébriques. La deuxième est basée sur la notion de monade et introduit la notion d'un module sur une monade qui remplace les foncteurs et leurs algèbres. En outre la deuxième approche est adaptée pour une classe plus large de syntaxes typées où les types dépendent des termesIn order to specify the behaviour of programming languages, to investigate their properties and to allow certification of their implementations, one studies formal models of existing programming languages. This study splits into the study of syntax and semantics, where the latter is based on appropriate formal models for the syntax. This PhD thesis is located in the syntactic part and is mainly concerned with two approaches to abstract syntax with variable binding. Both make use of the language of category theory. The first one is in the spirit of the category theoretic approach to algebraic theories. The second one is based on the notion of monads and introduces modules on monads instead of working with functors and their algebras. Furthermore the latter approach is adapted to a larger class of typed syntax with types depending on terms
14
D'Silva, Vijay Victor. "Logical abstract interpretation." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003.
Повний текст джерелаАнотація:
Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning about programs. This dissertation shows that the combination of logic and abstract interpretation enables a unified and simple treatment of several theoretical and practical topics which encompass the model theory of temporal logics, the analysis of satisfiability solvers, and the construction of Craig interpolants. In each case, the combination of logic and abstract interpretation leads to more general results, simpler proofs, and a unification of ideas from seemingly disparate fields. The first contribution of this dissertation is a framework for combining temporal logics and abstraction. Chapter 3 introduces trace algebras, a new lattice-based semantics for linear and branching time logics. A new representation theorem shows that trace algebras precisely capture the standard trace-based semantics of temporal logics. We prove additional representation theorems to show how structures that have been independently discovered in static program analysis, model checking, and algebraic modal logic, can be derived from trace algebras by abstract interpretation. The second contribution of this dissertation is a framework for proving when two lattice-based algebras satisfy the same logical properties. Chapter 5 introduces functions called subsumption and bisubsumption and shows that these functions characterise logical equivalence of two algebras. We also characterise subsumption and bisubsumption using fixed points and finitary logics. We prove a representation theorem and apply it to derive the transition system analogues of subsumption and bisubsumption. These analogues strictly generalise the well studied notions of simulation and bisimulation. Our fixed point characterisations also provide a technique to construct property preserving abstractions. The third contribution of this dissertation is abstract satisfaction, an abstract interpretation framework for the design and analysis of satisfiability procedures. We show that formula satisfiability has several different fixed point characterisations, and that satisfiability procedures can be understood as abstract interpreters. Our main result is that the propagation routine in modern sat solvers is a greatest fixed point computation involving abstract transformers, and that clause learning is an abstract transformer for a form of negation. The final contribution of this dissertation is an abstract interpretation based analysis of algorithms for constructing Craig interpolants. We identify and analyse a lattice of interpolant constructions. Our main result is that existing algorithms are two of three optimal abstractions of this lattice. A second new result we derive in this framework is that the lattice of interpolation algorithms can be ordered by logical strength, so that there is a strongest and a weakest possible construction.
15
Varallo, Patrick Americo. "Abstract symbolic relationships /." Online version of thesis, 1993. http://hdl.handle.net/1850/11758.
Повний текст джерела
16
Janakiraman, Muralidharan. "Abstract Index Interfaces." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5288.
Повний текст джерелаАнотація:
An index in a database system interacts with many of the software modules in the system. For systems supporting a wide range of index structures, interfacing the index code with the rest of the system poses a great problem. The problems are an order of magnitude more for adding new access methods to the system. These problems could be reduced manifold if common interfaces could be specified for different access methods. It would be even better, if these interfaces could be made database-system independent. This thesis addresses the problem of defining generic index interfaces for access methods in database systems. It concentrates on two specific issues: First, specification of a complete set of abstract interfaces that would work for all access methods and for all database systems. Second, optimized query processing for all data types including userdefined data types. An access method in a database system can be considered to be made up of three specific parts: Upper interfaces, lower interfaces, and type interfaces. An access method interacts with a database system through its upper interfaces, lower interfaces and type interfaces. Upper interfaces consist of the functions an index provides to a database system. Lower interfaces are the database-system dependent software modules an index has to interact with, to accomplish any system related functions. Type interfaces consist of the set of functions an index uses, which interpret the data type. These three parts together characterize an access method in a database system. This splitting of an access method makes it possible to define generic interfaces. In this thesis, we will discuss each of these three different interfaces in detail, identify functionalities and design clear interfaces. The design of these interfaces promote development of type-independent and database-system independent access methods.
17
Nanchen, Stanislas. "Verifying abstract state machines /." Zürich : ETH, 2007. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=17489.
Повний текст джерела
18
Karim, Khan Shahid. "Abstract Kernel Management Environment." Thesis, Linköping University, Department of Electrical Engineering, 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-1806.
Повний текст джерелаАнотація:
The Kerngen Module in MATLAB can be used to optimize a filter with regards to an ideal filter; while taking into consideration the weighting function and the spatial mask. To be able to remotely do these optimizations from a standard web browser over a TCP/IP network connection would be of interest. This master’s thesis covers the project of doing such a system; along with an attempt to graphically display three-dimensional filters and also save the optimized filter in XML format. It includes defining an appropriate DTD for the representation of the filter. The result is a working system, with a server and client written in the programming language PIKE.
19
Suhanic, West M. L. "The abstract media model." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape17/PQDD_0014/NQ30651.pdf.
Повний текст джерела
20
Wong, Brian T. (Brian Tak-Ho) 1978. "The Abstract Data Interface." Thesis, Massachusetts Institute of Technology, 2001. http://hdl.handle.net/1721.1/86744.
Повний текст джерелаАнотація:
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2001.Includes bibliographical references (leaves 107-113).
by Brian T. Wong.
M.Eng.
21
De, León Eduardo Enrique. "Medical abstract inference dataset." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/119516.
Повний текст джерелаАнотація:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (page 35).
In this thesis, I built a dataset for predicting clinical outcomes from medical abstracts and their title. Medical Abstract Inference consists of 1,794 data points. Titles were filtered to include the abstract's reported medical intervention and clinical outcome. Data points were annotated with the interventions effect on the outcome. Resulting labels were one of the following: increased, decreased, or had no significant difference on the outcome. In addition, rationale sentences were marked, these sentences supply the necessary supporting evidence for the overall prediction. Preliminary modeling was also done to evaluate the corpus. Preliminary models included top performing Natural Language Inference models as well as Rationale based models and linear classifiers.
by Eduardo Enrique de León.
M. Eng.
22
Mosina, E. O. "Abstract vision in fashion." Thesis, Київський національний університет технологій та дизайну, 2018. https://er.knutd.edu.ua/handle/123456789/11355.
Повний текст джерела
23
Macumu. "Abstract economics for ecology." Thesis, Вид-во СумДУ, 2006. http://essuir.sumdu.edu.ua/handle/123456789/11719.
Повний текст джерела
24
Newton, Michael. "Abstract specification of grammar." Thesis, University of Edinburgh, 1992. http://hdl.handle.net/1842/20062.
Повний текст джерелаАнотація:
In this thesis I explore the use of an algebraic (software) specification language (ASL) in the description and modelling of natural language grammar. I am particularly concerned with the application of methods of loose specification and stepwise refinement, and modularisation and parameterisation. I have some background on the use of specifications in software engineering, and suggest some benefits one might obtain from the use of such disciplines in the description of grammar. I introduce the language ASL and the algebraic concepts underlying it. I consider how we might describe the notion of constituency, independent of concrete styles of grammar, and how this leads to the need for an intensional domain. By enriching this domain, we can deal with matters such as agreement. I sketch abstract specifications of core treatments in PATR-II, LFG, GPSG and HPSG. Some consideration is given to the use of institutions to allow us to work in different (logical or programming) languages. I develop, in tandem, abstract descriptions and parameterised implementations to deal with topicalisation and wh-relatives. Lastly, I consider how loose specification and parameterisation may be employed in developing a cross-linguistic treatment for some phenomenon - in this case, dependent clause order in English, German and Dutch. This involves specification of a grammar in the dependency tradition.
25
Fernandes, Renato da Silva. "Combinatória: dos princípios fundamentais da contagem à álgebra abstrata." Universidade de São Paulo, 2017. http://www.teses.usp.br/teses/disponiveis/55/55136/tde-31012018-161438/.
Повний текст джерелаАнотація:
O objetivo deste trabalho é fazer um estudo amplo e sequencial sobre combinatória. Iniciase com os fundamentos da combinatória enumerativa, tais como permutações, combinações simples, combinações completas e os lemas de Kaplanski. Num segundo momento é apresentado uma abordagem aos problemas de contagem utilizando a teoria de conjuntos; são abordados o princípio da inclusão-exclusão, permutações caóticas e a contagem de funções. No terceiro momento é feito um aprofundamento do conceito de permutação sob a ótica da álgebra abstrata. É explorado o conceito de grupo de permutações e resultados importantes relacionados. Na sequência propõe-se uma relação de ordem completa e estrita para o grupo de permutações. Por fim, investiga-se dois problemas interessantes da combinatória: a determinação do número de caminhos numa malha quadriculada e a contagem de permutações que desconhecem padrões de comprimento três.The objective of this work is to make a broad and sequential study on combinatorics. It begins with the foundations of enumerative combinatorics, such as permutations, simple combinations, complete combinations, and Kaplanskis lemmas. In a second moment an approach is presented to the counting problems using set theory; the principle of inclusion-exclusion, chaotic permutations and the counting of functions are addressed. In the third moment a deepening of the concept of permutation is made from the perspective of abstract algebra. The concept of group of permutations and related important results is explored. A strict total order relation for the permutation group is proposed. Finally, we investigate two interesting combinatorial problems: the determination of the number of paths in a grid and the number of permutations that avoids patterns of length three.
26
Winter, Kirsten. "Model checking abstract state machines." [S.l.] : [s.n.], 2001. http://deposit.ddb.de/cgi-bin/dokserv?idn=963050001.
Повний текст джерела
27
Sablik, Mathieu. "Wavelets in Abstract Hilbert Space." Thesis, Uppsala University, Department of Mathematics, 2000. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-122553.
Повний текст джерела
28
Carbe, Katia. "Spatial coding of abstract concepts." Doctoral thesis, Universite Libre de Bruxelles, 2015. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/219173.
Повний текст джерелаАнотація:
Abstract concepts seem to be related to space dimension. Evidence of this relation refers to the domain of numerical cognition. An example is the SNARC effect (Spatial Numerical Association of Response Codes, Dehaene, Bossini, and Giraux 1993), which consists in the observation that people react faster to small number with the left hand and to large number with the right hand. This number-space interaction has been explained according to the mental number line hypothesis (e.g. Restle 1970; Dehaene, Bossini, and Giraux 1993), which claims that the representation of numbers has the form of a horizontal line upon which numbers are represented from left to right. Recently, an alternative account suggests that the association between numbers and space results from a decision process to categorize numbers as “small” and “large” before being associated with space dimension (e.g. Gevers et al. 2006b, 2010; Van Opstal and Verguts 2013). The first goal of this thesis is investigating the spatial coding of numbers. In a first study, magnitude concepts such as “small” and “large” were observed to be spatially organized like numbers. In a second study, these magnitude concepts were intermixed with numbers in a reversal design (e.g. Notebaert et al. 2006). In this study, responding as incompatible to magnitude concepts with hand or foot was observed to reverse the spatial mapping of numbers, supporting the idea that the congruency between numbers and space results from conceptual coding of magnitude (e.g. Gevers et al. 2006b, 2010; see also Van Opstal and Verguts 2013). Further evidence of association between abstract concepts and space has been provided also in the domain of emotion. On one hand, Casasanto (2009a) demonstrated that people spontaneously associate positive valence with the side of space congruent to the dominant hand. On the other hand, Holmes and Lourenco (2011) observed that emotional expressions are left-to-right spatially organized with increasing in happiness/angriness rather than positive/negative valence. A second aim of this thesis is focused on investigating the spatial coding of emotion. This was meant to understand how general are the spatial mechanisms. In a third study, the reversal paradigm (e.g. Notebaert et al. 2006) was adopted to investigate the processing mechanism underlying spatial coding of numbers and emotional valence concepts. Manipulation of the mapping between valence concepts and lateralized responses did not influence the spatial coding of numbers, suggesting a separate underlying architecture. Finally, in a fourth study, spatial coding of emotion was observed according to both valence and arousal dimensions (Casasanto 2009a; Holmes and Lourenco 2011).Doctorat en Sciences psychologiques et de l'éducation
info:eu-repo/semantics/nonPublished
29
Basalaj, Wojciech. "Proximity visualisation of abstract data." Thesis, University of Cambridge, 2001. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.620911.
Повний текст джерела
30
Dinsdale-Young, Thomas. "Abstract data and local reasoning." Thesis, Imperial College London, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.539276.
Повний текст джерела
31
Merkley, John. "Transitions : multi-media abstract sculpture." Virtual Press, 2004. http://liblink.bsu.edu/uhtbin/catkey/1305451.
Повний текст джерелаАнотація:
The first objective of this creative project was to create seven Non-figurative, abstract, multi-media (wood, metals, clay, concrete, glass) sculptures that attempted to express some of the feelings experienced during transitions in life. The second objective was to explore the continuum of abstract sculptural art: from art being simply aesthetically stimulating compositions to art that emphasizes meaning or purpose first, and being aesthetically pleasing or stimulating second.Department of Art
32
Mansfield, Rachel. "Temporal Abstract Behavioral Representation Model." Honors in the Major Thesis, University of Central Florida, 2007. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/1181.
Повний текст джерелаАнотація:
This item is only available in print in the UCF Libraries. If this is your Honors Thesis, you can help us make it available online for use by researchers around the world by following the instructions on the distribution consent form at http://library.ucf.edu/Systems/DigitalInitiatives/DigitalCollections/InternetDistributionConsentAgreementForm.pdf You may also contact the project coordinator, Kerri Bottorff, at kerri.bottorff@ucf.edu for more information.Bachelors
Engineering and Computer Science
Electrical Engineering
33
Lyttle, R. W. "Notations for abstract data types." Thesis, Queen's University Belfast, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373554.
Повний текст джерела
34
Fisher, M. D. "Temporal logics for abstract semantics." Thesis, University of Manchester, 1987. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.383218.
Повний текст джерела
35
Tye, S. T. "A prototype abstract data store." Thesis, University of Manchester, 1985. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.356583.
Повний текст джерела
36
Rosendahl, Mads. "Abstract interpretation and attribute grammars." Thesis, University of Cambridge, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.239666.
Повний текст джерела
37
Chawdhary, Aziem A. "Proving termination using abstract interpretation." Thesis, Queen Mary, University of London, 2010. http://qmro.qmul.ac.uk/xmlui/handle/123456789/420.
Повний текст джерелаАнотація:
One way to develop more robust software is to use formal program verification. Formal program verification requires the construction of a formal mathematical proof of the programs correctness. In the past ten years or so there has been much progress in the use of automated tools to formally prove properties of programs. However many such tools focus on proving safety properties: that something bad does not happen. Liveness properties, where we try to prove that something good will happen, have received much less attention. Program termination is an example of a liveness property. It has been known for a long time that to prove program termination we need to discover some function which maps program states to a well-founded set. Essentially we need to find one global argument for why the program terminates. Finding such an argument which overapproximates the entire program is very difficult. Recently, Podelski and Rybalchenko discovered a more compositional proof rule to find disjunctive termination arguments. Disjunctive termination arguments requires a series of termination arguments that individually may only cover part of the program but when put together give a reason for why the entire program will terminate. Thus we do not need to search for one overall reason for termination but we can break the problem down and focus on smaller parts of the program. This thesis develops a series of abstract interpreters for proving the termination of imperative programs. We make three contributions, each of which makes use of the Podelski-Rybalchenko result. Firstly we present a technique to re-use domains and operators from abstract interpreters for safety properties to produce termination analysers. This technique produces some very fast termination analysers, but is limited by the underlying safety domain used. We next take the natural step forward: we design an abstract domain for termination. This abstract domain is built from ranking functions: in essence the abstract domain only keeps track of the information necessary to prove program termination. However, the abstract domain is limited to proving termination for language with iteration. In order to handle recursion we use metric spaces to design an abstract domain which can handle recursion over the unit type. We define a framework for designing abstract interpreters for liveness properties such as termination. The use of metric spaces allows us to model the semantics of infinite computations for programs with recursion over the unit type so that we can design an abstract interpreter in a systematic manner. We have to ensure that the abstract interpreter is well-behaved with respect to the metric space semantics, and our framework gives a way to do this.
38
Casasanto, Daniel J. "Perceptual foundations of abstract thought." Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/34129.
Повний текст джерелаАнотація:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Brain and Cognitive Sciences, 2005.Includes bibliographical references (p. 75-78).
How do people think about things they can never see or touch? The ability to invent and reason about domains such as time, ideas, or mathematics is uniquely human, and is arguably the hallmark of human sophistication. Yet, how people mentally represent these abstract domains has remained one of the great mysteries of the mind. This dissertation explores a potential solution: perhaps the mind recruits old structures for new uses. Perhaps sensory and motor representations that result from physical interactions with the world (e.g., representations of physical space) are recycled to support our thinking about abstract phenomena. This hypothesis is motivated, in part, by patterns observed in language: in order to talk about abstract things, speakers often recruit metaphors from more concrete or perceptually rich domains. For example, English speakers often talk about time using spatial language (e.g., a long vacation; a short meeting). Cognitive linguists have argued such expressions reveal that people conceptualize abstract domains like time metaphorically, in terms of space. Although linguistic evidence for this Conceptual Metaphor Theory is abundant, the necessary nonlinguistic evidence has been elusive.
(cont.) In two series of experiments, I investigated whether mental representations that result from physical experience underlie people's more abstract mental representations, using the domains of space and :!I.:e as a testbed. New experimental tools were developed in order to evaluate Conceptual Metaphor Theory as an account of the evolution and structure of abstract concepts, and to explore relations between language and nonlinguistic thought. Hypotheses about the way people represent space and time were based on patterns in metaphorical language, but were tested using simple psychophysical tasks with nonlinguistic stimuli and responses. Results of the first set of experiments showed that English speakers incorporate irrelevant spatial information into their estimates of time (but not vice versa), suggesting that people not only talk about time using spatial language, but also think about time using spatial representations. The second set of experiments showed that (a) speakers of different languages rely on different spatial metaphors for duration, (b) the dominant metaphor in participants' first languages strongly predicts their performance on nonlinguistic time estimation tasks, and (c) training participants to use new spatiotemporal metaphors in language changes the way they estimate time.
(cont.) Together, these results demonstrate that the metaphorical language people use to describe abstract phenomena provides a window on their underlying mental representations, and also shapes those representations. The structure of abstract domains such as time appears to depend, in part, on both linguistic experience and on physical experience in perception and motor action.
by Daniel J. Casasanto.
Ph.D.
39
Greenfield, David. "Semigroup representations : an abstract approach." Thesis, University of Oxford, 1994. http://ora.ox.ac.uk/objects/uuid:ebe5ecaf-e400-41de-bcd2-e168475ac76e.
Повний текст джерелаАнотація:
Chapter One After the definitions and basic results required for the rest of the thesis, a notion of spectrum for semigroup representations is introduced and some relevant examples given. Chapter Two Any semigroup representation by isometries on a Banach space may be dilated to a group representation on a larger Banach space. A new proof of this result is presented here, and a connection is shown to exist between the dilation and the trajectories of the dual representation. The problem of dilating various types of spaces, including partially ordered spaces, C*-algebras, and reflexive spaces, is discussed, and new dilation theorems are given for dual Banach spaces and von Neumann algebras. Chapter Three In this chapter the spectrum of a representation is examined more closely with the aid of methods from Banach algebra theory. In the case where the representation is by isometries it is shown that the spectrum is non-empty, that it is compact if and only if the representation is norm-continuous, and that any isolated point in the unitary spectrum is an eigenvalue. Chapter Four An analytic characterisation is given of the spectral conditions that imply a representation by isometries is invertible. For representations of Z+n this con- dition is shown to be equivalent to polynomial convexity. Some topological conditions on the spectrum are also shown to imply invertibility. Chapter Five The ideas of the previous chapters are applied to problems of asymptotic behaviour. Asymptotic stability is described in terms of the behaviour of the dual of a representation. Finally, the case when the unitary spectrum is countable is discussed in detail.
40
Drape, Stephen. "Obfuscation of abstract data-types." Thesis, University of Oxford, 2004. http://ora.ox.ac.uk/objects/uuid:fa574ce9-4ed2-41f5-86d8-78113828b9ab.
Повний текст джерела
41
Walton, Christopher D. "Abstract machines for dynamic computation." Thesis, University of Edinburgh, 2001. http://hdl.handle.net/1842/372.
Повний текст джерелаАнотація:
In this thesis we address the challenges associated with the provision of dynamic software architectures. These are systems in which programs are constructed from separately compiled units with a facility for the replacement of these units at runtime. Typical examples of applications which will benefit from this dynamic approach are long-lived systems in which downtime is highly undesirable, for example, web-servers, database engines, and equipment controllers. In addition, dynamic software architectures are also gaining popularity with the recent advent of wide-area Internet applications, where it is often impractical to compile a program in its entirety or begin execution in a single step. Our approach to dynamic software architectures differs from earlier attempts in that we guarantee the safety of the replacement operation. This is done by founding our techniques on the rigour of strong typing. In the first half of the thesis we take an existing static software architecture with strong typing facilities and modular program construction, namely the Standard ML platform, and equip it with facilities for separate-compilation and code-replacement of modules. The resulting dynamic software architecture, which we call Dynamic ML, ensures the safety of replacement through an effective use of state-of-the-art advances in the fields of types in compilation and abstract machines. In the latter half of the thesis we extend Dynamic ML with a facility for distributed execution and adapt our code-replacement model accordingly. This will permit the construction of larger dynamic architectures, for example, across a distributed network of workstations. We also perform a mechanical verification of the distributed algorithm by model checking, to gain further confidence in the correctness of our approach. At the end of the thesis we outline an implementation of our techniques for the Java language, demonstrating the portability of our approach.
42
Byers, Patrick. "Computability over abstract data types." Thesis, University of Surrey, 1990. http://epubs.surrey.ac.uk/844617/.
Повний текст джерелаАнотація:
This thesis extends the study of the notion of termination equivalence of abstract structures first proposed by Kfoury. The connection with abstract data types (ADTs) is made by demonstrating that many kinds of equivalence between ADT implementations are in fact instances of termination equivalence between their underlying algebras. The results in the thesis extend the original work in two directions. The first is to consider how the termination equivalence of structures is dependent upon the choice of programming formalism. The termination equivalences for all of the common classes of programs and for some new classes of non-computable schemes are studied, and their relative strengths are established. The other direction is a study of a congruence property of equivalences relative to the join or addition datatype building operation. We decide which of the termination equivalences are congruences for all structures and for all computable structures, and for those equivalences which are not, we characterise those congruences closest to them (both stronger and weaker). These programmes of work involved the use of constructions and properties of structures relating to program termination which are of interest in themselves. These are examined and are used to prove some general results about the relative strengths of termination equivalences.
43
Engström, Alexander. "Inger Ekdahl : Swedish Abstract Expressionism." Thesis, Stockholms universitet, Institutionen för kultur och estetik, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-182385.
Повний текст джерелаАнотація:
Inger Ekdahl was a female painter at the center of Swedish Abstract Expressionism in the fifties. This essay investigates how her art was received in Stockholm and Paris. We conclude that although her type of art dominated the avant-garde in Paris during the late fifties, she was too early for the Swedish avant-garde and did not amass enough support to transform it. The analysis used Actor-Network Theory following Latour.
44
Showers, Patrick J. "Abstract Polytopes from Nested Posets." University of Akron / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=akron1386028871.
Повний текст джерела
45
Colledan, Andrea. "Abstract Machine Semantics for Quipper." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/22835/.
Повний текст джерелаАнотація:
Quipper is a domain-specific programming language for the description of quantum circuits. Because it is implemented as an embedded language in Haskell, Quipper is a very practical functional language. However, for the same reason, it lacks a formal semantics and it is limited by Haskell's type-system. In particular, because Haskell lacks linear types, it is easy to write Quipper programs that violate the non-cloning property of quantum states. In order to formalize relevant fragments of Quipper in a type-safe way, the Proto-Quipper family of research languages has been introduced over the last years. In this thesis we first introduce Quipper and Proto-Quipper-M. Proto-Quipper-M is an instance of the Proto-Quipper family based on a categorical model for quantum circuits, which features a linear type-system that guarantees that the non-cloning property holds at compile time. We then derive a tentative small-step operational semantics from the big-step semantics of Proto-Quipper-M and we prove that the two are equivalent. After proving subject reduction and progress results for the tentative semantics, we build upon it to obtain a truly small-step semantics in the style of an abstract machine, which we eventually prove to be equivalent to the original semantics.
46
Winegar, Matthew Bryston. "Extending the Abstract Data Model." Digital Commons @ East Tennessee State University, 2005. https://dc.etsu.edu/etd/1007.
Повний текст джерелаАнотація:
The Abstract Data Model (ADM) was developed by Sanderson [19] to model and predict semantic loss in data translation between computer languages. In this work, the ADM was applied to eight languages that were not considered as part of the original work. Some of the languages were found to support semantic features, such as the restriction semantics for inheritance found in languages like XML Schemas and Java, which could not be represented in the ADM. A proposal was made to extend the ADM to support these semantic features, and the requirements and implications of implementing that proposal were considered.
47
Juett, Jason Robert. "Some topics in abstract factorization." Diss., University of Iowa, 2013. https://ir.uiowa.edu/etd/2534.
Повний текст джерелаАнотація:
Anderson and Frazier defined a generalization of factorization in integral domains called tau-factorization. If D is an integral domain and tau is a symmetric relation on the nonzero nonunits of D, then a tau-factorization of a nonzero nonunit a in D is an expression a = lambda a_1 ... a_n, where lambda is a unit in D, each a_i is a nonzero nonunit in D, and a_i tau a_j for i != j. If tau = D^# x D^#, where D^# denotes the nonzero nonunits of D, then the tau-factorizations are just the usual factorizations, and with other choices of tau we get interesting variants on standard factorization. For example, if we define a tau_d b if and only if (a, b) = D, then the tau_d-factorizations are the comaximal factorizations introduced by McAdam and Swan. Anderson and Frazier defined tau-factorization analogues of many different factorization concepts and properties, and proved a number of theorems either generalizing standard factorization results or the comaximal factorization results of McAdam and Swan. Some of these concepts include tau-UFD's, tau-atomic domains, the tau-ACCP property, tau-BFD's, tau-FFD's, and tau-HFD's. They showed the implications between these concepts and showed how each of the standard variations implied their tau-factorization counterparts (sometimes assuming certain natural constraints on tau). Later, Ortiz-Albino introduced a new concept called Gamma-factorization that generalized tau-factorization. We will summarize the known theory of tau-factorization and Gamma-factorization as well as introduce several new or improved results.
48
Caldarola, Elisa. "Pictorial Representation and Abstract Pictures." Doctoral thesis, Università degli studi di Padova, 2011. http://hdl.handle.net/11577/3422042.
Повний текст джерелаАнотація:
This work is an investigation into the analytical debate on pictorial representation and the theory of pictorial art. My main concern are a critical exposition of the questions raised by the idea that it is resemblance to depicted objects that explains pictorial representation and the investigation of the phenomenon of abstract painting from an analytical point of view in relation to the debate on depiction.
The first part is dedicated to a survey of the analytical debate on depiction, with special attention to the fortunes and misfortunes of the resemblance theory of depiction. In the first chapter I give an outline of the main contemporary theories on offer, contextualised within an historical background that stretches from Plato to Descartes. I have decided to focus on the theory of resemblance more than on other approaches on depiction, because much of my research is dedicated to an analysis and implementation of one of the theories that have recently sought to re-discover the resemblance paradigm, although with certain important modifications. Namely, the second chapter is dedicated to the exposition of John Hyman’s basic resemblance theory of depiction, to the elucidation of its presuppositions and to the discussion of some criticisms and objections that the theory has raised. The third and the fourth chapter are dedicated to the implementation of Hyman’s theory in relation to the phenomenon of abstract painting.
There are two peculiarities about Hyman’s theory: first, it is in counter-tendency in comparison with all the other accounts of depiction on offer, in that it does not need to conceive of pictorial representation as of representation of particulars or kinds of objects that we can easily identify. Second, it is a theory that gives art a prominent role: Hyman illustrates his claims with many examples taken from the history of figurative art. The second part of my work is inspired by the idea that the basic resemblance theory can be applied to abstract paintings as well.
Developing an analysis of abstract painting from an analytical point of view is a task that very few authors have tried to accomplish so far – as far as I am aware. However, it is evident that the task abstract painters have set themselves is interestingly akin to the task philosophers try to accomplish when arguing about depiction. It is widely agreed that one of the main topics of contemporary art is art itself and that one of the main topics of abstract painting is the art of painting itself, the art of producing pictures, the exploration of its limits and its conventions. With these considerations in mind, I have sought to sketch my proposal for a basic resemblance theory of abstract painting, critically engaging with philosophers such as Richard Wollheim, Kendall Walton, Lambert Wiesing and with art-critics and historians such as Clement Greenberg and Ernst Gombrich.Il mio lavoro si inserisce nell’ambito del dibattito sul concetto di rappresentazione pittorica (RP) e sulla teoria dell’arte pittorica recentemente portato avanti in area analitica. I miei obiettivi principali sono un’esposizione critica dei problemi sollevati dalla tesi secondo cui è la somiglianza agli oggetti dipinti che spiega RP e un’analisi del fenomeno della pittura astratta da un punto di vista analitico. La prima parte è dedicata ad una ricognizione del dibattito analitico su RP, con particolare attenzione ai destini della “teoria della somiglianza”. Nel primo capitolo traccio i contorni delle principali teorie attualmente discusse, nel contesto di un’analisi della letteratura tradizionale sull’argomento, da Platone a Cartesio. La decisione di dare maggiore rilevanza alla teoria della somiglianza rispetto che ad altre teorie su RP è motivata dal fatto che il resto della mia ricerca è dedicato all’analisi e a una proposta di arricchimento di una delle proposte che recentemente hanno riproposto la teoria della somiglianza, benché con alcune importanti modifiche. Si tratta della teoria difesa da John Hyman, che espongo nel secondo capitolo, avendo cura di mostrarne i presupposti e di discutere alcune critiche e obiezioni che le sono state mosse. Il terzo e quarto capitolo sono dedicati all’arricchimento della teoria di Hyman in relazione al fenomeno della pittura astratta. Due sono le peculiarità della teoria di Hyman: primo, è in controtendenza rispetto a tutte le altre attuali proposte sulla RP, perché non ha bisogno di concepire RP come rappresentazione di particolari o di tipi di oggetti che possiamo facilmente identificare; secondo, è una teoria che porta l’arte al centro della discussione filosofica su RP. Hyman, infatti, illustra la sua proposta con numerosi riferimenti alla storia delle arti figurative. La seconda parte di questo lavoro è ispirata dall’idea che la teoria della somiglianza di base di Hyman si possa applicare anche ai dipinti astratti. Lo sviluppo di un’analisi della pittura astratta da un punto di vista analitico è un compito con cui finora si sono misurati pochissimi autori – per quanto ho potuto appurare. Tuttavia, è evidente che gli obiettivi che i pittori di immagini astratte si pongono sono vicini a quelli che si pongono i filosofi quando discutono sulla RP. È opinione diffusa che uno dei temi principali dell’arte contemporanea sia l’arte stessa, e che uno dei temi principali della pittura astratta sia l’arte stessa di dipingere, l’arte di produrre immagini, con i suoi limiti e le sue convenzioni. Motivata da queste considerazioni, ho cercato di dare una prima formulazione alla proposta di una teoria della somiglianza di base della RP applicata ai dipinti astratti. I miei principali riferenti critici sono filosofi come Richard Wollheim, Kendall Walton e Lambert Wiesing, e critici e storici dell’arte come Clement Greenberg ed Ernst Gombrich.
49
Bylund, Johanna, and Josefine Nåvik. "Allt är inte sagt bara för att en lag har talat : En kvalitativ dokumentstudie om hur insiderlagen i praktiken kan ses som en spelregel." Thesis, Mittuniversitetet, Institutionen för ekonomi, geografi, juridik och turism, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-37009.
Повний текст джерелаАнотація:
Reglering av insiderhandel är ett omdebatterat ämne som ofta leder till svarta rubriker i media. Att försöka motverka insiderhandel grundar sig i den asymmetriska information som är vanligt förekommande på värdepappersmarknaden och som tycks vara anledningen till att marknaden kan upplevas som orättvis och omoralisk. Reglering av insiderhandel har således ansetts vara nödvändigt men själva lagen har ifrågasatts när det kommer till dess verkliga funktion och effektivitet. Tidigare forskning visar nämligen på att lagen kanske bäst kan förstås som en spelregel där spelet är amoraliskt. Hur lagen kan liknas vid en spelregel i praktiken verkar däremot saknas i tidigare forskning. En studie som jämför insiderlagen med ekonomiska brott, såsom bedrägeribrott, har således ansetts vara nödvändig för att avgöra på vilka sätt insiderlagen kan liknas vid en amoralisk spelregel. Denna kvalitativa dokumentstudie ämnar således att utifrån ett socialkonstruktionistiskt synsätt analysera och beskriva insiderlagen och på vilka sätt den kan förstås som en spelregel i praktiken. Vikten av att upprätthålla förtroendet för värdepappersmarknaden har vidare framhållits av tillsynsmyndigheterna Ekobrottsmyndigheten och Finansinspektionen, därför ansågs det även vara intressant att studera dokument från deras respektive hemsidor. Dokumenten analyserades utifrån en tematisk analys där resultaten kopplades till värdepappersreglering och insiderlag, förtroende i dess abstrakta form samt insdiderlag och/eller spelregler. Resultaten i denna studie pekar på att insiderlagen i praktiken bäst förstås som en spelregel eftersom insiderhandel är ett offerlöst brott där det tillsynes finns svårigheter att bevisa att ett brott faktiskt har begåtts.Nyckelord: Värdepappersreglering, asymmetrisk information, abstrakta system, abstrakt förtroende, spelregel, spelAbstractInsider trading regulation is a highly-debated topic which often leads to black headlines in the media. Attempts to counteract insider trading is based on the asymmetric information that is common in the securities market and which seems to be the reason why the market can be perceived as unfair and immoral. Insider trading regulation has thus been considered necessary, but the law itself has been questioned when it comes to its real function and efficiency. Earlier research namely shows that the law may be better understood as a game rule where the game is amoral. How the law practically can be better understood as a game rule seems however yet to be lacking in previous research. A study comparing insider law with economic crimes, such as fraud offenses, has thus been considered necessary to determine in which ways the insider law can be compared to an amoral rule of law. This qualitative document-study thus aims to analyze and describe the insider law in a social constructive approach and in what ways it practically can be better understood as a game rule. The importance of maintaining trust in the securities market has also been emphasized by the supervisory authorities Ekobrottsmyndigheten and Finansinspektionen, therefore it was also considered interesting to study documents from their respective websites. The documents were analyzed based on a content analysis where the results were linked to securities regulation and insider law, trust in its abstract form and insiderlaw and/or game rules. The results of this study indicate that the insider law practically should be better understood as a game rule as insider trading is a victimless crime where there are difficulties in proving that a crime actually has been committed.
50
Geer, Andrea. "The non-representational language /." Online version of thesis, 1990. http://hdl.handle.net/1850/11309.
Повний текст джерела