Summary: This thesis builds on current research about image schema PATH in Czech language. After a theoretical introduction of the cognitive-linguistic theory of conceptual, or image schemas and about iconic and iconic-metaphorical (double) mapping of sign language existing theoretical and methodological knowledge is compared with language material that captures expressions schema PATH in the Czech sign language. For these purposes a corpus of signs of Czech sign language that make use of the schema of PATH was acquired. Analyzed signs are categorized by target areas (semantic circuits) and also according to the criteria of phonological structure. Key words: cognitive linguistics, Czech sign language, metaphor, iconic mapping, iconic-metaphoric (double) mapping, image schema, image schema PATH

<p>Paralelan i nezavisan rad vi&scaron;e projektanata na različitim modulima (podsistemima) nekog informacionog sistema, identifikovanim saglasno početnoj funkcionalnoj dekompoziciji realnog sistema, nužno dovodi do međusobno nekonzistentnih re&scaron;enja &scaron;ema modula baze podataka. Rad se bavi pitanjima identifikacije i razre&scaron;avanja problema, vezanih za automatsko otkrivanje kolizija, koje nastaju pri paralelnom projektovanju različitih &scaron;ema modula i problema vezanih za integraciju &scaron;ema modula u jedinstvenu &scaron;emu baze podataka informacionog sistema.</p><p>Identifikovani su mogući tipovi kolizija &scaron;ema modula, formulisan je i dokazan potreban i dovoljan uslov stroge i intenzionalne kompatibilnosti &scaron;ema modula, &scaron;to je omogućilo da se, u formi algoritama, prikažu postupci za ispitivanje&nbsp;stroge i intenzionalne kompatibilnosti &scaron;ema modula. Formalizovan je i postupak integracije kompatibilnih &scaron;ema u jedinstvenu (strogo pokrivajuću) &scaron;emu baze podataka. Dat je, takođe, prikaz metodologije primene algoritama za testiranje kompatibilnosti i integraciju &scaron;ema modula u jedinstvenu &scaron;emu baze podataka informacionog sistema.</p> / <p>Parallel and independent work of a number of designers on different information system modules (i.e. subsystems), identified by the initial real system functional decomposition, necessarily leads to mutually inconsistent database (db) module schemas. The thesis considers the problems concerning automatic detection of collisions, that can appear during the simultaneous design of different db module schemas, and integration of db module schemas into the unique information system db schema.</p><p>All possible types of db module schema collisions have been identified. Necessary and sufficient condition of strong and intensional db module schema compatibility has been formu-lated and proved. It has enabled to formalize the process of&nbsp;db module schema strong and intensional compatibility checking and to construct the appropriate algorithms. The integration process of the unique (strong covering) db schema, on the basis of compatible db module schemas, is formalized, as well. The methodology of applying the algorithms for compatibility checking and unique db schema integration is also presented.</p>

Entity augmentation is a query type in which, given a set of entities and a large corpus of possible data sources, the values of a missing attribute are to be retrieved. State of the art methods return a single result that, to cover all queried entities, is fused from a potentially large set of data sources. We argue that queries on large corpora of heterogeneous sources using information retrieval and automatic schema matching methods can not easily return a single result that the user can trust, especially if the result is composed from a large number of sources that user has to verify manually. We therefore propose to process these queries in a Top-k fashion, in which the system produces multiple minimal consistent solutions from which the user can choose to resolve the uncertainty of the data sources and methods used. In this paper, we introduce and formalize the problem of consistent, multi-solution set covering, and present algorithms based on a greedy and a genetic optimization approach. We then apply these algorithms to Web table-based entity augmentation. The publication further includes a Web table corpus with 100M tables, and a Web table retrieval and matching system in which these algorithms are implemented. Our experiments show that the consistency and minimality of the augmentation results can be improved using our set covering approach, without loss of precision or coverage and while producing multiple alternative query results.

In what ways and under what circumstances can a movie be a resource for individuals and their thoughts about existential matters? This central research question has been investigated using a both quantitative and qualitative approach. First, a questionnaire was distributed amongst 179 Swedish students to provide a preliminary overview of film habits. The questionnaire was also used as a tool for selecting respondents to individual interviews. Second, thirteen interviews were conducted, with viewers choosing their favourite movie of all time. In the study socio-cognitive theory and a schema-based theoretical tool is adopted to analyze how different viewers make use of movies as cultural products in an interplay between culture and cognition in three contexts; a socio-historic process, a socio-cultural interaction with the world and inner psychological processes. Summarizing the interviews some existential matters dominated. Matters of immanent orientation were in the foreground. Transcendental questions received much less attention. Summarizing the schema-based theoretical question, assessing which cognitive schema structures the narratives were processed through, the study found an emphasis on a combination of two main cognitive structures, person schema and self schema. Detailed person schematic cognitive processes about fictitious characters on the screen and their role model behaviour were combined by the respondents with dynamic cross-references to detailed self schematic introspections about their own characteristics, related to existential matters at some very specific moments in their lives. The viewers in the study seem to be inspired by movies as a mediated cultural resource, promoting the development of a personal moral framework with references to values deeply fostered by a humanistic tradition. It is argued that these findings support theories discussing individualised meaning making, developing ‘self-expression values’ and ‘altruistic individualism’ in contemporary western society.

What do you do if a computational object fails a specification? An obvious approach is to repair it, namely, to modify the object minimally to get something that satisfies the constraints. In this thesis we study foundational problems of repairing regular specifications over strings and trees. Given two regular specifications R and T we aim to understand how difficult it is to transform an object satisfying R into an object satisfying T. The setting is motivated by considering R to be a restriction -- a constraint that the input object is guaranteed to satisfy -- while T is a target -- a constraint that we want to enforce. We first study which pairs of restriction and target specifications can be repaired with a ``small'' numbers of changes. We formalize this as the bounded repair problem -- to determine whether one can repair each object satisfying R into T with a uniform number of edits. We provide effective characterizations of the bounded repair problem for regular specifications over strings and trees. These characterizations are based on a good understanding of the cyclic behaviour of finite automata. By exploiting these characterizations, we give optimal algorithms to decide whether two specifications are bounded repairable or not. We also consider the impact of limitations on the editing process -- what happens when we require the repair to be done sequentially over serialized objects. We study the bounded repair problem over strings and trees restricted to this streaming setting and show that this variant can be characterized in terms of finite games. Furthermore, we use this characterization to decide whether one can repair a pair of specifications in a streaming fashion with bounded cost and how to obtain a streaming repair strategy in this case. The previous notion asks for a uniform bound on the number of edits, but having this property is a strong requirement. To overcome this limitation, we study how to calculate the maximum number of edits per character needed to repair any object in R into T. We formalize this as the asymptotic cost -- the limit of the number of edits divided by the length of the input in the worst case. Our contribution is an algorithm to compute the asymptotic cost for any pair of regular specifications over strings. We also consider the streaming variant of this cost and we show how to compute it by reducing this problem to mean-payoff games.

Šiame darbe pristatomi nauji rezultatai, gauti tiriant diskretųjį Šturmo ir Liuvilio uždavinį su viena klasikine o kita nelokaliąja integraline kraštine sąlyga. Pirmoje dalyje pristatomas diferencialinis Šturmo ir Liuvilio uždavinys su nelokaliąja integraline kraštine sąlyga. Šio uždavinio kompleksinė spektro dalis buvo ištirta bakalauro darbe. Antroje darbo dalyje diferencialinis uždavinys suvedamas į antros eilės baigtinių skirtumų schemą, kai nelokalioji integralinė sąlyga aproksimuojama pagal trapecijų arba Simpsono formulę. Ištirta skirtuminių operatorių su nelokaliosiomis kraštinėmis sąlygomis spektro struktūra, tikrinių reikšmių priklausomybė nuo parametrų γ ir ξ esančių nelokaliosiose sąlygose, reikšmių ir pasirinkto tinklo taškų skaičiaus n. Rezultatai pateikiami charakteristinių funkcijų grafikais ir jų projekcijomis. / In this paper we present a new result of the investigation discrete Sturm--Liuoville problem with one classical and the other nonlocal integral boundary condition. The first part of paper presents differential Sturm Liuoville problem with integral boundary condition. Complex part of spectrum for Sturm Liuoville problem with integral boundary condition was investigated in Bachelor Thesis. The second part of paper present result of investigation second-order finite difference scheme, when the integral conditions condition is approximated by the Trapezoid or Simpson's rules. There are investigated the spectrum of the finite-difference schemes and it dependence on the parameters γ and ξ from nonlocal boundary condition n,where n number of grid points. Simulation results are presented as graphs and projections of characteristic functions.

近年來雲端運算蓬勃發展，為資訊系統的建置與服務帶來巨大的改變，其中一個重要趨勢為軟體即服務，並透過多租戶共享資源達到降低成本的優勢。因此如何讓服務可以共享資源，又能兼顧各租戶的客製化需求，這將會是軟體即服務關鍵成功因素。 為了讓租戶客製化自己的綱要，在多租戶的相關研究中，發展出各種綱要映射技術，各適用不同的狀況，但在開發應用程式時候往往無法預估租戶適合使用何種綱要映射技術。本研究提出可以讓多租戶軟體框架具有綱要映射技術的可調性，應用程式開發時候毋需考慮使用何種綱要映射技術，等租用時候再依據應用程式及租戶的特性決定。本研究將以小量租戶效能最佳的Private Table Layout與適合用於大量租戶的Universal Table Layout為例，提出的可調性多租戶實體模式來建構具有可調性的多租戶軟體框架。此外本研究提出的軟體框架經過技術的封裝，開發者不需要了解多租戶的相關技術，就能完成多租戶應用程式的開發。 / Software as a service (SaaS) is an emerging service model of cloud computing. It’s central defining characteristic is the ability for clients to use a software application on a pay-as-you-go subscription basis. However, to be economically sustainable, a SaaS application must leverage resource sharing to a large degree by accommodating different clients of the application while making it appear to each that they have the application all to themselves. In other words, a SaaS application must be a multi-tenant application. An important multi-tenant research topic is the various kinds of schema mapping technology have been developed in order for our tenants to customize their schema. However, it is hard to determine tenants’ need for particular schema mapping technology in different circumstances. This thesis proposes an adaptable schema mapping technology for a multi-tenant application (MTA) framework. The application and tenants’ characteristics do not need to be considered while applications developers are developing their schema mapping technology. This approach will take examples from the Private Table Layout mapping and the Universal Table Layout mapping to illustrate the features of this adaptable multi-tenant software framework. Furthermore, this thesis argues that, with the approach packaged as a software framework, developers are able to complete the development of a multi-tenant application without full understanding of the underlying technologies.

Diploma thesis "Body schema in Patients with Chronic Obstructive Pulmonary Disease" is an experimental work which deals with body schema perception. As a part of the thesis there are particular tests of body schema included, which examine difference between control group and group of patients with chronic obstructive pulmonary disease. Research part of the work deals with current findings about body schema and with findings about chronic obstructive pulmonary disease. There is more detailed analyze of musculoskeletal questions in patients with chronic obstructive pulmonary disease included. In an experimental part of the thesis there are comments on results of the body schema tests. The tests are focused on stereognosis, on position sense, on perception of self body size and on the ability to achieve isolated movement. Powered by TCPDF (www.tcpdf.org)

The thesis focuses on a chapter from Kant's Critique of Pure Reason, "The Schematism of the Pure Concepts of the Understanding". Kant assumes two independent sources of knowledge, understanding and intuition. These sources need to be overcome, because of their heterogeneity. Schematism is closely related to "The Deduction of the Pure Concepts of the Understanding". That is why the analysis of schemata is preceded by the analysis of this chapter. It shows a more detailed description of a role of intuition with respect to understanding. Firstly, the validity of the categories regarding whatever form of intuition is proved. Secondly, the proof of the validity of the categories regarding specific forms of time and space follows. The chapter on schematism deals with the specific methods by means of which the categories relate to intuition. Kant introduces transcendental schemata bridging the heterogeneity of understanding and intuition. The relation between category and schema is understood as one of analogy. The categories are rules of discursive type of unity of any kind of intuition, whereas schemata are determined as rules of perceptive unity of intuition. Intuition is brought under unity of apperception by means of schemata of imagination. Inseparable part of the thesis is the schematism of...

O projeto e manutenção de bancos de dados é um importante desafio, tendo em vista as frequentes mudanças de requisitos solicitados pelos usuários. Para acompanhar essas mudanças o esquema do banco de dados deve passar por alterações estruturais que muitas vezes prejudicam o desempenho e o projeto das consultas, tais como: relacionamentos desnecessários, chaves primárias ou estrangeiras criadas fortemente acopladas ao domínio, atributos obsoletos e tipos de atributos inadequados. A literatura sobre Métodos Ágeis para desenvolvimento de software propõe o uso de refatorações para evolução do esquema do banco de dados quando há mudanças de requisitos. Uma refatoração é uma alteração simples que melhora o design, mas não altera a semântica do modelo de dados, nem adiciona novas funcionalidades. Esta Tese apresenta um novo processo para aplicar refatorações ao esquema do banco de dados. Este processo é definido por um conjunto de tarefas com o objetivo de executar as refatorações de uma forma controlada e segura, permitindo saber o impacto no desempenho do banco de dados para cada refatoração executada. A notação BPMN foi utilizada para representar e executar as tarefas do processo. Como estudo de caso foi utilizado um banco de dados relacional, o qual é usado por um sistema de informação para agricultura de precisão. Esse sistema, baseado na Web, necessita fazer grandes consultas para plotagem de gráficos com informações georreferenciadas. / The development and maintenance of a database is an important challenge, due to frequent changes and requirements from users. To follow these changes, the database schema suffers structural modifications that, many times, negatively affect its performance and the result of the queries, such as: unnecessary relationships, primary and foreign keys, created strongly attached to the domain, with obsolete attributes or inadequate types of attributes. The literature about Agile Methods for software development suggests the use of refactoring for the evolution of database schemas when there are requirement changes. A refactoring is a simple change that improves the design, but it does not alter the semantics of the data model neither adds new functionalities. This thesis aims at proposing a new process to apply many refactoring to the database schema. This process is defined by a set of refactoring tasks, which is executed in a controlled, secure and automatized form, aiming at improving the design of the schema and allowing the DBA to know exactly the impact on the performance of the database for each refactoring performed. A notation BPMN has been used to represent and execute the tasks of the workflow. As a case study, a relational database, which is used by an information system for precision agriculture was used. This system is web based, and needs to perform large consultations to transfer graphics with geo-referential information.