950 resultados para Counterfactual conditional
Resumo:
Modal cohesion and subordination. The Finnish conditional and jussive moods in comparison to the French subjunctive This study examines verb moods in subordinate clauses in French and Finnish. The first part of the analysis deals with the syntax and semantics of the French subjunctive, mood occurring mostly in subordinate positions. The second part investigates Finnish verb moods. Although subordinate positions in Finnish grammar have no special finite verb form, certain uses of Finnish verb moods have been compared to those of subjunctives and conjunctives in other languages. The present study focuses on the subordinate uses of the Finnish conditional and jussive (i.e. the third person singular and plural of the imperative mood). The third part of the analysis discusses the functions of subordinate moods in contexts beyond complex sentences. The data used for the analysis include 1834 complex sentences gathered from newspapers, online discussion groups and blog texts, as well as audio-recorded interviews and conversations. The data thus consist of both written and oral texts as well as standard and non-standard variants. The analysis shows that the French subjunctive codes theoretical modality. The subjunctive does not determine the temporal and modal meaning of the event, but displays the event as virtual. In a complex sentence, the main clause determines the temporal and modal space within which the event coded by the subjunctive clause is interpreted. The subjunctive explicitly indicates that the space constructed in the main clause extends its scope over the subordinate clause. The subjunctive can therefore serve as a means for creating modal cohesion in the discourse. The Finnish conditional shares the function of making explicit the modal link between the components of a complex construction with the French subjunctive, but the two moods differ in their semantics. The conditional codes future time and can therefore occur only in non-factual or counterfactual contexts, whereas the event expressed by French subjunctive clauses can also be interpreted as realized. Such is the case when, for instance, generic and habitual meaning is involved. The Finnish jussive mood is used in a relatively limited number of subordinate clause types, but in these contexts its modal meaning is strikingly close to that of the French subjunctive. The permissive meaning, typical of the jussive in main clause positions, is modified in complex sentences so that it entails inter-clausal relation, namely concession. Like the French subjunctive, the jussive codes theoretical modal meaning with no implication of the truth value of the proposition. Finally, the analysis shows that verb moods mark modal cohesion, not only on the syntagmatic level (namely in complexe sentences), but also on the paradigmatic axis of discourse in order to create semantic links over entire segments of talk. In this study, the subjunctive thus appears, not as an empty category without function, as it is sometimes described, but as an open form that conveys the temporal and modal meanings emerging from the context.
Resumo:
We propose an efficient and parameter-free scoring criterion, the factorized conditional log-likelihood (ˆfCLL), for learning Bayesian network classifiers. The proposed score is an approximation of the conditional log-likelihood criterion. The approximation is devised in order to guarantee decomposability over the network structure, as well as efficient estimation of the optimal parameters, achieving the same time and space complexity as the traditional log-likelihood scoring criterion. The resulting criterion has an information-theoretic interpretation based on interaction information, which exhibits its discriminative nature. To evaluate the performance of the proposed criterion, we present an empirical comparison with state-of-the-art classifiers. Results on a large suite of benchmark data sets from the UCI repository show that ˆfCLL-trained classifiers achieve at least as good accuracy as the best compared classifiers, using significantly less computational resources.
Resumo:
In this paper, an improved probabilistic linearization approach is developed to study the response of nonlinear single degree of freedom (SDOF) systems under narrow-band inputs. An integral equation for the probability density function (PDF) of the envelope is derived. This equation is solved using an iterative scheme. The technique is applied to study the hardening type Duffing's oscillator under narrow-band excitation. The results compare favorably with those obtained using numerical simulation. In particular, the bimodal nature of the PDF for the response envelope for certain parameter ranges is brought out.
Resumo:
A systematic assessment of the submodels of conditional moment closure (CMC) formalism for the autoignition problem is carried out using direct numerical simulation (DNS) data. An initially non-premixed, n-heptane/air system, subjected to a three-dimensional, homogeneous, isotropic, and decaying turbulence, is considered. Two kinetic schemes, (1) a one-step and (2) a reduced four-step reaction mechanism, are considered for chemistry An alternative formulation is developed for closure of the mean chemical source term
Resumo:
Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase-shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evolution method. We demonstrate here the implementation of the conditional phase-shift gate using transition selective pulses. As an application of the gate, we demonstrate Grover's search algorithm and quantum Fourier transform by simulations and experiments using transition selective pulses. (C) 2002 Elsevier Science (USA). All rights reserved.
Resumo:
A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.
Resumo:
Topoisomerases are an important class of enzymes for regulating the DNA transaction processes. Mycobacterium tuberculosis (Mtb) is one of the most formidable pathogens also posing serious challenges for therapeutic interventions. The organism contains only one type IA topoisomerase (Rv3646c), offering an opportunity to test its potential as a candidate drug target. To validate the essentiality of M.tuberculosis topoisomerase I (TopoI(Mt)) for bacterial growth and survival, we have generated a conditionally regulated strain of topoI in Mtb. The conditional knockdown mutant exhibited delayed growth on agar plate. In liquid culture, the growth was drastically impaired when TopoI expression was suppressed. Additionally, novobiocin and isoniazid showed enhanced inhibitory potential against the conditional mutant. Analysis of the nucleoid revealed its altered architecture upon TopoI depletion. These studies establish the essentiality of TopoI for the M.tuberculosis growth and open up new avenues for targeting the enzyme.
Resumo:
We present a multipartite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles transferring the information between them. We propose here a tripartite counterfactual quantum protocol for the task of certificate authorization. Here a trusted third party, Alice, authenticates an entity Bob (e.g., a bank) that a client Charlie wishes to securely transact with. The protocol is counterfactual with respect to either Bob or Charlie. We prove its security against a general incoherent attack, where Eve attacks single particles.