984 resultados para Problem oriented languages
Resumo:
L’objecte d’aquesta tesi es l’estudi del canvi de llengua que es produeix en l’obra poètica de Pere Gimferrer. Per arribar-hi haurem d’activar un itinerari complex – crític, teòric i metodològic -. La problemàtica que presentem intenta resoldre una qüestió central: tractar d’elucidar si aquest canvi de llengua – del castellà al català, i més tard, del català al castellà – implica necessàriament un canvi d’estil, o si, en canvi, l’estil de poeta resta estable tot i haver canviat la llengua d’escriptura. Si la recerca està orientada a trobar una possible resposta a aquesta qüestió, nosaltres ens proposem com a punt de partida l’anàlisi de les conseqüències que comporta l’escriure en diferents llengües a la modernitat. Per aquesta raó, en la tesi es desenvolupen teòricament les nocions de “frontera”, “extraterritorialitat”, o “llengua estrangera” que ens seran útils per a portar a terme la nostra anàlisi. A la darrera part, a través de la lexicometria, presentem un apropament exhaustiu a les particularitats lèxiques i sintagmàtiques de l’obra de Pere Gimferrer. Finalment, proposem una resposta a la problemàtica proposada.
Resumo:
This paper tackles the path planning problem for oriented vehicles travelling in the non-Euclidean 3-Dimensional space; spherical space S3. For such problem, the orientation of the vehicle is naturally represented by orthonormal frame bundle; the rotation group SO(4). Orthonormal frame bundles of space forms coincide with their isometry groups and therefore the focus shifts to control systems defined on Lie groups. The oriented vehicles, in this case, are constrained to travel at constant speed in a forward direction and their angular velocities directly controlled. In this paper we identify controls that induce steady motions of these oriented vehicles and yield closed form parametric expressions for these motions. The paths these vehicles trace are defined explicitly in terms of the controls and therefore invariant with respect to the coordinate system used to describe the motion.
Resumo:
Motivated by the motion planning problem for oriented vehicles travelling in a 3-Dimensional space; Euclidean space E3, the sphere S3 and Hyperboloid H3. For such problems the orientation of the vehicle is naturally represented by an orthonormal frame over a point in the underlying manifold. The orthonormal frame bundles of the space forms R3,S3 and H3 correspond with their isometry groups and are the Euclidean group of motion SE(3), the rotation group SO(4) and the Lorentzian group SO(1; 3) respectively. Orthonormal frame bundles of space forms coincide with their isometry groups and therefore the focus shifts to left-invariant control systems defined on Lie groups. In this paper a method for integrating these systems is given where the controls are time-independent. For constant twist motions or helical motions, the corresponding curves g(t) 2 SE(3) are given in closed form by using the well known Rodrigues’ formula. However, this formula is only applicable to the Euclidean case. This paper gives a method for computing the non-Euclidean screw/helical motions in closed form. This involves decoupling the system into two lower dimensional systems using the double cover properties of Lie groups, then the lower dimensional systems are solved explicitly in closed form.
Resumo:
Aspect-oriented programming (AOP) is a promising technology that supports separation of crosscutting concerns (i.e., functionality that tends to be tangled with, and scattered through the rest of the system). In AOP, a method-like construct named advice is applied to join points in the system through a special construct named pointcut. This mechanism supports the modularization of crosscutting behavior; however, since the added interactions are not explicit in the source code, it is hard to ensure their correctness. To tackle this problem, this paper presents a rigorous coverage analysis approach to ensure exercising the logic of each advice - statements, branches, and def-use pairs - at each affected join point. To make this analysis possible, a structural model based on Java bytecode - called PointCut-based Del-Use Graph (PCDU) - is proposed, along with three integration testing criteria. Theoretical, empirical, and exploratory studies involving 12 aspect-oriented programs and several fault examples present evidence of the feasibility and effectiveness of the proposed approach. (C) 2010 Elsevier Inc. All rights reserved.
Resumo:
The synthesis and self-assembly of tetragonal phase-containing L1(0)-Fe(55)Pt(45) nanorods with high coercive field is described. The experimental procedure resulted in a tetragonal/cubic phase ratio close to 1:1 for the as-synthesized nanoparticles. Using different surfactant/solvent proportions in the process allowed control of particle morphology from nanospheres to nanowires. Monodisperse nanorods with lengths of 60 +/- 5 nm and diameters of 2-3 nm were self-assembled in a perpendicular oriented array onto a substrate surface using hexadecylamine as organic spacer. Magnetic alignment and properties assigned, respectively, to the shape anisotropy and the tetragonal phase suggest that the self-assembled materials are a strong candidate to solve the problem of random magnetic alignment observed in FePt nanospheres leading to applications in ultrahigh magnetic recording (UHMR) systems capable of achieving a performance of the order of terabits/in(2).
Resumo:
A programming style can be seen as a particular model of shaping thought or a special way of codifying language to solve a problem. An adaptive device is made up of an underlying formalism, for instance, an automaton, a grammar, a decision tree, etc., and an adaptive mechanism, responsible for providing features for self-modification. Adaptive languages are obtained by using some programming language as the device’s underlying formalism. The conception of such languages calls for a new programming style, since the application of adaptive technology in the field of programming languages suggests a new way of thinking. Adaptive languages have the basic feature of allowing the expression of programs which self-modifying through adaptive actions at runtime. With the adaptive style, programming language codes can be structured in such a way that the codified program therein modifies or adapts itself towards the needs of the problem. The adaptive programming style may be a feasible alternate way to obtain self-modifying consistent codes, which allow its use in modern applications for self-modifying code.
Resumo:
XML has become an important medium for data exchange, and is frequently used as an interface to - i.e. a view of - a relational database. Although lots of work have been done on querying relational databases through XML views, the problem of updating relational databases through XML views has not received much attention. In this work, we give the rst steps towards solving this problem. Using query trees to capture the notions of selection, projection, nesting, grouping, and heterogeneous sets found throughout most XML query languages, we show how XML views expressed using query trees can be mapped to a set of corresponding relational views. Thus, we transform the problem of updating relational databases through XML views into a classical problem of updating relational databases through relational views. We then show how updates on the XML view are mapped to updates on the corresponding relational views. Existing work on updating relational views can then be leveraged to determine whether or not the relational views are updatable with respect to the relational updates, and if so, to translate the updates to the underlying relational database. Since query trees are a formal characterization of view de nition queries, they are not well suited for end-users. We then investigate how a subset of XQuery can be used as a top level language, and show how query trees can be used as an intermediate representation of view de nitions expressed in this subset.
Resumo:
MAIDL, André Murbach; CARVILHE, Claudio; MUSICANTE, Martin A. Maude Object-Oriented Action Tool. Electronic Notes in Theoretical Computer Science. [S.l:s.n], 2008.
Resumo:
Among a variety of learning conceptions, David Kolb´s Experiential Learning Theory proposes four different learning styles: diverging, characterized by orientation towards people and multi-perspective vision; assimilating, concerned with ideas and abstract concepts as well as theory formulation; converging, expert in dealing with technical tasks and problem solving; and accommodating, risk taker and good at getting things done. Interesting correlations have been pointed out between Kolb s learning styles, professional careers and genders. With respect to behaviors, specific cognitive skills and interests, sex differences are widely known, and explained by Evolutionary Psychology as the result of distinct selective pressures acting on each gender. The aim of this research was to assess adolescents learning styles and their relation with interests on school and career choices, analyzing possible gender differences. We distributed questionnaires to 221 senior high school students to research their preferences for school disciplines, professional activities and career choices. The Learning Style Inventory specified the learning style of each individual. Our results showed a high frequency of reflective styles, with predominance of females as diverging and males as assimilating. Concerning school and professional interests, there were correlations between styles oriented towards the abstract and technical interests. Moreover, females preferred disciplines related to languages and interpersonal activities while males preferred disciplines related to science and technical activities. There were more males in exact science and engineering careers, and more females in social science and applied social science. Correlations found between learning styles, school and professional interests corroborate Kolb´s propositions, and the findings about gender differences are supported by Evolutionary Psychology theories
Resumo:
This thesis presents ⇡SOD-M (Policy-based Service Oriented Development Methodology), a methodology for modeling reliable service-based applications using policies. It proposes a model driven method with: (i) a set of meta-models for representing non-functional constraints associated to service-based applications, starting from an use case model until a service composition model; (ii) a platform providing guidelines for expressing the composition and the policies; (iii) model-to-model and model-to-text transformation rules for semi-automatizing the implementation of reliable service-based applications; and (iv) an environment that implements these meta-models and rules, and enables the application of ⇡SOD-M. This thesis also presents a classification and nomenclature for non-functional requirements for developing service-oriented applications. Our approach is intended to add value to the development of service-oriented applications that have quality requirements needs. This work uses concepts from the service-oriented development, non-functional requirements design and model-driven delevopment areas to propose a solution that minimizes the problem of reliable service modeling. Some examples are developed as proof of concepts
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The process of knowledge representation as well as its procedures or tools and its products are not neutral in terms of values; instead they imply moral values. In this context, bias in representation related to prejudice and discrimination, to gender issues, to dicotomic categorization in classification systems or in thesauri and to lack of cultural warrant may arise. Concerning the problem of bias in indexing languages, starting from the initial theoretical reflexions of Brey (1999), Berman (1993), Olson (1998; 2002), Lopez-Huertas Perez & Torres Ramirez (2005), Guimaraes (2006), Hjorland (2008) and Milani et al. (2009), the proposal is to present a preliminary categorization aiming at facilitating the identification of bias concerning feminine issues in indexing languages, to offer a contribution to the theoretical universe of the specific questions of knowledge organization and to present a theme to be discussed by educators and professionals in the areas of cataloging, classification and indexing. If in a society which intends to be politically correct, social attitudes towards stigmatized citizens should be modified, then, the universe of indexing languages, taken as tools of knowledge representation, is a fertile field to sow this reflexion.
Resumo:
The application of Concurrency Theory to Systems Biology is in its earliest stage of progress. The metaphor of cells as computing systems by Regev and Shapiro opened the employment of concurrent languages for the modelling of biological systems. Their peculiar characteristics led to the design of many bio-inspired formalisms which achieve higher faithfulness and specificity. In this thesis we present pi@, an extremely simple and conservative extension of the pi-calculus representing a keystone in this respect, thanks to its expressiveness capabilities. The pi@ calculus is obtained by the addition of polyadic synchronisation and priority to the pi-calculus, in order to achieve compartment semantics and atomicity of complex operations respectively. In its direct application to biological modelling, the stochastic variant of the calculus, Spi@, is shown able to model consistently several phenomena such as formation of molecular complexes, hierarchical subdivision of the system into compartments, inter-compartment reactions, dynamic reorganisation of compartment structure consistent with volume variation. The pivotal role of pi@ is evidenced by its capability of encoding in a compositional way several bio-inspired formalisms, so that it represents the optimal core of a framework for the analysis and implementation of bio-inspired languages. In this respect, the encodings of BioAmbients, Brane Calculi and a variant of P Systems in pi@ are formalised. The conciseness of their translation in pi@ allows their indirect comparison by means of their encodings. Furthermore it provides a ready-to-run implementation of minimal effort whose correctness is granted by the correctness of the respective encoding functions. Further important results of general validity are stated on the expressive power of priority. Several impossibility results are described, which clearly state the superior expressiveness of prioritised languages and the problems arising in the attempt of providing their parallel implementation. To this aim, a new setting in distributed computing (the last man standing problem) is singled out and exploited to prove the impossibility of providing a purely parallel implementation of priority by means of point-to-point or broadcast communication.