935 resultados para Algorithmic logic
Resumo:
Vargo and Lusch propose a very exciting framework that aims in expanding the boundaries of the marketing discipline by moving away from the existing exchange paradigm towards a Service Dominant (S-D) logic. This new S-D logic has the potential to strengthen the theoretical grounds of marketing by establishing links to other disciplines. This commentary attempts to discuss some aspects of the foundational premises of the S-D logic from the perspective of the MC21 group with special emphases on innovation, value creation, and resource allocation.
Resumo:
This study explores the institutional logic(s) governing the Corporate Internet Reporting (CIR) by Egyptian listed companies. In doing so, a mixed methods approach was followed. The qualitative part seeks to understand the perceptions, believes, values, norms, that are commonly shared by Egyptian companies which engaged in these practices. Consequently, seven cases of large listed Egyptian companies operating in different industries have been examined. Other stakeholders and stockholders have been interviewed in conjunction with these cases. The quantitative part consists of two studies. The first one is descriptive aiming to specify whether the induced logic(s) from the seven cases are commonly embraced by other Egyptian companies. The second study is explanatory aiming to investigate the impact of several institutional and economic factors on the extent of CIR, types of the online information, quality of the websites as well as the Internet facilities. Drawing on prior CIR literature, four potential types of logics could be inferred: efficiency, legitimacy, technical and marketing based logics. In Egypt, legitimacy logic was initially embraced in the earlier years after the Internet inception. latter, companies confronted radical challenges in their internal and external environments which impelled them to raise their websites potentialities to defend their competitive position; either domestically or internationally. Thus, two new logics emphasizing marketing and technical perspectives have emerged, in response. Strikingly, efficiency based logic is not the most prevalent logic driving CIR practices in Egypt as in the developed countries. The empirical results support this observation and show that almost half of Egyptian listed companies 115 as on December 2010 possessed an active website, half of them 62 disclosed part of their financial and accounting information, during December 2010 to February 2011. Less than half of the websites 52 offered latest annual financial statements. Fewer 33(29%) websites provided shareholders and stock information or included a separate section for corporate governance 25 (22%) compared to 50 (44%) possessing a section for news or press releases. Additionally, the variations in CIR practices, as well as timeliness and credibility were also evident even at industrial level. After controlling for firm size, profitability, leverage, liquidity, competition and growth, it was realized that industrial companies and those facing little competition tend to disclose less. In contrast, management size, foreign investors, foreign listing, dispersion of shareholders and firm size provided significant and positive impact individually or collectively. In contrast, neither audit firm, nor most of performance indicators (i.e. profitability, leverage, and liquidity) did exert an influence on the CIR practices. Thus, it is suggested that CIR practices are loosely institutionalised in Egypt, which necessitates issuing several regulative and processional rules to raise the quality attributes of Egyptian websites, especially, timeliness and credibility. Beside, this study highlights the potency of assessing the impact of institutional logic on CIR practices and suggests paying equal attention to the institutional and economic factors when comparing the CIR practices over time or across different institutional environments in the future.
Resumo:
The present study explores strategies used to legitimize the transfer of organizational practices in a situation of institutional upheaval. We apply the logic of social action (Risse, 2000) to analyze the effectiveness of consequence-based action and communication-based action, in terms of higher coordination, lower conflict, and overall higher economic performance. Consequence-based legitimation is obtained by using a system of distributor incentives tied to performance of specific tasks, while communicative legitimation can be achieved by recommendations and warnings. Our setting is an export channel to European emerging economies. Our results indicate that in the absence of legitimacy, as manifested in discretionary legal enforcement, consequence-based legitimation is more effective than communicative legitimation in reducing conflict, increasing coordination, and ultimately in improving the performance of the export dyad. © 2014 Elsevier Inc.
Resumo:
Processes of European integration and growing consumer scrutiny of public services have served to place the spotlight on the traditional French model of public/private interaction in the urban services domain. This article discusses recent debates within France of the institutionalised approach to local public/private partnership, and presents case study evidence from three urban agglomerations of a possible divergence from this approach. Drawing on the work of French academic, Dominique Lorrain, whose historical institutionalist accounts of the French model are perhaps the most comprehensive and best known, the article develops two hypotheses of institutional change, one from the historical institutionalist perspective of institutional stability and persistence, and the other from an explicitly sociological perspective, which emphasises the legitimating benefits of following appropriate rules of conduct. It argues that further studying the French model as an institution offers valuable empirical insight into processes of institutional change and persistence. © 2004 Taylor & Francis Ltd.
Resumo:
Cyclooxygenase 2 (COX2), a key regulatory enzyme of the prostaglandin/eicosanoid pathway, is an important target for anti-inflammatory therapy. It is highly induced by pro-inflammatory cytokines in a Nuclear factor kappa B (NFκB)-dependent manner. However, the mechanisms determining the amplitude and dynamics of this important pro-inflammatory event are poorly understood. Furthermore, there is significant difference between human and mouse COX2 expression in response to the inflammatory stimulus tumor necrosis factor alpha (TNFα). Here, we report the presence of a molecular logic AND gate composed of two NFκB response elements (NREs) which controls the expression of human COX2 in a switch-like manner. Combining quantitative kinetic modeling and thermostatistical analysis followed by experimental validation in iterative cycles, we show that the human COX2 expression machinery regulated by NFκB displays features of a logic AND gate. We propose that this provides a digital, noise-filtering mechanism for a tighter control of expression in response to TNFα, such that a threshold level of NFκB activation is required before the promoter becomes active and initiates transcription. This NFκB-regulated AND gate is absent in the mouse COX2 promoter, most likely contributing to its differential graded response in promoter activity and protein expression to TNFα. Our data suggest that the NFκB-regulated AND gate acts as a novel mechanism for controlling the expression of human COX2 to TNFα, and its absence in the mouse COX2 provides the foundation for further studies on understanding species-specific differential gene regulation.
Resumo:
Partial support of the Hungarian State Eötvös Scholarship, the Hungarian National Science Fund (Grant No. OTKA 42559 and 42706) and the Mobile Innovation Center, Hungary is gratefully acknowledged.
Resumo:
In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations.
Resumo:
* This work is partially supported by CICYT (Spain) under project TIN 2005-08943-C02-001 and by UPM-CAM (Spain) under project R05/11240.
Resumo:
* This paper was made according to the program of fundamental scientific research of the Presidium of the Russian Academy of Sciences «Mathematical simulation and intellectual systems», the project "Theoretical foundation of the intellectual systems based on ontologies for intellectual support of scientific researches".
Resumo:
* This paper was made according to the program of fundamental scientific research of the Presidium of the Russian Academy of Sciences «Mathematical simulation and intellectual systems», the project "Theoretical foundation of the intellectual systems based on ontologies for intellectual support of scientific researches".
Resumo:
* The work is partially supported by Grant no. NIP917 of the Ministry of Science and Education – Republic of Bulgaria.
Resumo:
The "recursive" definition of Default Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the "recursive" fixed-point equation of Default Logic with an initial set of axioms and defaults if and only if the meaning of the fixed-point is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original "recursive" definition of Default Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults.
Resumo:
A Quantified Autoepistemic Logic is axiomatized in a monotonic Modal Quantificational Logic whose modal laws are slightly stronger than S5. This Quantified Autoepistemic Logic obeys all the laws of First Order Logic and its L predicate obeys the laws of S5 Modal Logic in every fixed-point. It is proven that this Logic has a kernel not containing L such that L holds for a sentence if and only if that sentence is in the kernel. This result is important because it shows that L is superfluous thereby allowing the ori ginal equivalence to be simplified by eliminating L from it. It is also shown that the Kernel of Quantified Autoepistemic Logic is a generalization of Quantified Reflective Logic, which coincides with it in the propositional case.
Resumo:
Systems analysis (SA) is widely used in complex and vague problem solving. Initial stages of SA are analysis of problems and purposes to obtain problems/purposes of smaller complexity and vagueness that are combined into hierarchical structures of problems(SP)/purposes(PS). Managers have to be sure the PS and the purpose realizing system (PRS) that can achieve the PS-purposes are adequate to the problem to be solved. However, usually SP/PS are not substantiated well enough, because their development is based on a collective expertise in which logic of natural language and expert estimation methods are used. That is why scientific foundations of SA are not supposed to have been completely formed. The structure-and-purpose approach to SA based on a logic-and-linguistic simulation of problems/purposes analysis is a step towards formalization of the initial stages of SA to improve adequacy of their results, and also towards increasing quality of SA as a whole. Managers of industrial organizing systems using the approach eliminate logical errors in SP/PS at early stages of planning and so they will be able to find better decisions of complex and vague problems.
Resumo:
The nonmonotonic logic called Reflective Logic is shown to be representable in a monotonic Modal Quantificational Logic whose modal laws are stronger than S5. Specifically, it is proven that a set of sentences of First Order Logic is a fixed-point of the fixed-point equation of Reflective Logic with an initial set of axioms and defaults if and only if the meaning of that set of sentences is logically equivalent to a particular modal functor of the meanings of that initial set of sentences and of the sentences in those defaults. This result is important because the modal representation allows the use of powerful automatic deduction systems for Modal Logic and because unlike the original Reflective Logic, it is easily generalized to the case where quantified variables may be shared across the scope of the components of the defaults thus allowing such defaults to produce quantified consequences. Furthermore, this generalization properly treats such quantifiers since all the laws of First Order Logic hold and since both the Barcan Formula and its converse hold.