Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2015 ( 11 )

2014 ( 10 )

2013 ( 31 )

2012 ( 41 )

Custom range...

Search Results: 1 - 10 of 345 matches for " Sergiu GHICA "
All listed articles are free for downloading (OA Articles)
Page 1 /345
Display every page Item
Bourdieu Sociologist of Literature
Sergiu GHICA
Revista Romaneasca pentru Educatie Multidimensionala , 2013,
Abstract: Bourdieu is an exceptional reader of the works of art from a sociological perspective and social structures themselves, as are represented in these works. His approach is to interpret the style itself with social structures in mind. Not surprisingly, he speaks of social strategies of writing. It’s the strategy to be adopted and defined as social structural constraints of the field, but, besides these social strategies of writing, there is no doubt, and personal strategies of writing, only giving them a unique account of the writer. The concepts that Bourdieu introduce to analyze the literature : field, habitus, culture capital, symbolic capital, managed to minimize the contrast between internal reading of a work and its external reading, that her explanation is through the social conditions of production and consumption.This study examines Bourdieu’s methodology for analysing literary works, and demonstrates that it offers genuine insights for those involve in literary study. It will show that Bourdieu’s sociology accords literature a privileged status in struggles for political and aesthetic autonomy. This study also examines how Bourdieu understood the relationship between literature and politics.
Iulian Ghica
Revista de Economie Sociala , 2012,
Abstract: 1. Tipul de experien : Experien a la care face referire actualul articol are n vedere integrarea socioprofesional a tinerilor care p r sesc sistemul de protec ie a copilului.2. Caracteristicile organiza iei/ac iunii prezentate: nfiin at din anul 1996, Funda ia COTE” dezvolt programe i servicii de integrare social i profesional pentru copii i tineri proveni i din sistemul de protec ie. n ace ti 15 ani de activitate Funda ia COTE” a sprijinit peste 700 de tineri care au beneficiat de servicii n vederea integr rii sociale i profesionale. 3. Aspectele noi/pozitive din respectiva experien : Aspectele pozitive eviden iate de experien a descris vizeaz : abordarea holisitic a procesului de integrare profesional , mentoratul la locul de munc , dinamica dependen -independen , solu ionarea dilemelor etice, i importan a nv rii prin experien .4. Posibile ntreb ri: n ce m sur principiile validate de aceast experien se pot aplica cu succes i n contextul integr rii pe pia a muncii a altor grupuri vulnerabile?
Iulian Ghica
Revista de Economie Sociala , 2012,
Abstract: 1. Type of experience: The experience that this article is referring to is the socioprofessional integration of the youth who leave the child protection system.2. Characteristics of the organization/of the activity presented: COTE Foundation – established in 1996, develops social and professional integration programmes and services for children and youth coming from the child protection system. COTE Foundation has a 15 years’ experience in working with children and youth coming from the protection system, and has supported over 700 youth who havebeen offered services for social and professional integration.3. New/positive aspects from this experience: The positive aspects highlighted by the experience described are: a holistic approach of the professional integration process, mentoring at the work place, dependence-independence dynamics, solving ethical dilemmas and the importance of learning through experience.4. Potential questions: to what extent can the principles validated by this experience be successfully applied in the context of the integration on the labour market of other vulnerable groups?
Function Interface Models for Hardware Compilation: Types, Signatures, Protocols
Dan R. Ghica
Computer Science , 2009,
Abstract: The problem of synthesis of gate-level descriptions of digital circuits from behavioural specifications written in higher-level programming languages (hardware compilation) has been studied for a long time yet a definitive solution has not been forthcoming. The argument of this essay is mainly methodological, bringing a perspective that is informed by recent developments in programming-language theory. We argue that one of the major obstacles in the way of hardware compilation becoming a useful and mature technology is the lack of a well defined function interface model, i.e. a canonical way in which functions communicate with arguments. We discuss the consequences of this problem and propose a solution based on new developments in programming language theory. We conclude by presenting a prototype implementation and some examples illustrating our principles.
ec. drd. Oana Ghica,prof. univ. dr. Constantin Ghica
Lex et Scientia , 2006,
Abstract: Corporate Social Responsibility (CSR) and Sustainable Development (SD) are among the most important concepts applied and/or promoted by companies through specific programmes. Whether they are part of the company's PR strategy or an element of the company's operational system, CSR and SD programmes are becoming a constant part of corporate actions. Considered by some analysts as controversial concepts, studies regarding CSR and SD have increased especially over the last two decades and actions related to them have become both shield and weapon for companies, organizations and governments, depending on the pwpose they are used for.The following article makes a short presentation of the CSR and SD concepts, the relationship between them and benefits they generate, and ends with the case study of the eKOsystem programme launched by Hie Coca-Cola Company - a relevant example of programmes designed to promote and apply both CSR and SD concepts.
A System-Level Semantics
Dan R. Ghica,Nikos Tzevelekos
Computer Science , 2012,
Abstract: Game semantics is a trace-like denotational semantics for programming languages where the notion of legal observable behaviour of a term is defined combinatorially, by means of rules of a game between the term (the "Proponent") and its context (the "Opponent"). In general, the richer the computational features a language has, the less constrained the rules of the semantic game. In this paper we consider the consequences of taking this relaxation of rules to the limit, by granting the Opponent omnipotence, that is, permission to play any move without combinatorial restrictions. However, we impose an epistemic restriction by not granting Opponent omniscience, so that Proponent can have undisclosed secret moves. We introduce a basic C-like programming language and we define such a semantic model for it. We argue that the resulting semantics is an appealingly simple combination of operational and game semantics and we show how certain traces explain system-level attacks, i.e. plausible attacks that are realizable outside of the programming language itself. We also show how allowing Proponent to have secrets ensures that some desirable equivalences in the programming language are preserved.
From bounded affine types to automatic timing analysis
Dan R. Ghica,Alex Smith
Computer Science , 2013,
Abstract: Bounded linear types have proved to be useful for automated resource analysis and control in functional programming languages. In this paper we introduce an affine bounded linear typing discipline on a general notion of resource which can be modeled in a semiring. For this type system we provide both a general type-inference procedure, parameterized by the decision procedure of the semiring equational theory, and a (coherent) categorical semantics. This is a very useful type-theoretic and denotational framework for many applications to resource-sensitive compilation, and it represents a generalization of several existing type systems. As a non-trivial instance, motivated by our ongoing work on hardware compilation, we present a complex new application to calculating and controlling timing of execution in a (recursion-free) higher-order functional programming language with local store.
Abstract machines for game semantics, revisited
Olle Fredriksson,Dan R. Ghica
Computer Science , 2013,
Abstract: We define new abstract machines for game semantics which correspond to networks of conventional computers, and can be used as an intermediate representation for compilation targeting distributed systems. This is achieved in two steps. First we introduce the HRAM, a Heap and Register Abstract Machine, an abstraction of a conventional computer, which can be structured into HRAM nets, an abstract point-to-point network model. HRAMs are multi-threaded and subsume communication by tokens (cf. IAM) or jumps. Game Abstract Machines (GAM), are HRAMs with additional structure at the interface level, but no special operational capabilities. We show that GAMs cannot be naively composed, but composition must be mediated using appropriate HRAM combinators. HRAMs are flexible enough to allow the representation of game models for languages with state (non-innocent games) or concurrency (non-alternating games). We illustrate the potential of this technique by implementing a toy distributed compiler for ICA, a higher-order programming language with shared state concurrency, thus significantly extending our previous distributed PCF compiler. We show that compilation is sound and memory-safe, i.e. no (distributed or local) garbage collection is necessary.
Coherent Minimisation: Towards efficient tamper-proof compilation
Dan R. Ghica,Zaid Al-Zobaidi
Electronic Proceedings in Theoretical Computer Science , 2012, DOI: 10.4204/eptcs.104.8
Abstract: Automata representing game-semantic models of programs are meant to operate in environments whose input-output behaviour is constrained by the rules of a game. This can lead to a notion of equivalence between states which is weaker than the conventional notion of bisimulation, since not all actions are available to the environment. An environment which attempts to break the rules of the game is, effectively, mounting a low-level attack against a system. In this paper we show how (and why) to enforce game rules in games-based hardware synthesis and how to use this weaker notion of equivalence, called coherent equivalence, to aggressively minimise automata.
Sergiu Coseri
Molbank , 2006, DOI: 10.3390/m459
Abstract: No abstract available
Page 1 /345
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.