Real exchange rate dynamics in transition economies : a nonlinear analysis

We examine the behavior of the real exchange rates of nine transition economies during the 1990s. We propose an empirical model rationalized on the basis of standard economic models in the tradition of Mundell-Fleming-Dornbusch and Harrod-Balassa-Samuelson, allowing explicitly for real interest rate differentials and (implicitly) for productivity differentials to have an impact on real exchange rate equilibrium and employing nonlinear modeling techniques that are consistent with recently developed economic theories and observed regularities. Using a nonlinear multivariate generalization of the Beveridge-Nelson decomposition applied to our models, we also identify the permanent and temporary components of these real exchange rates implied by our estimates. The results have a natural interpretation and clear policy implications

Bulges or Bars from Secular Evolution?

We use high resolution collisionless $N$-body simulations to study the secular evolution of disk galaxies and in particular the final properties of disks that suffer a bar and perhaps a bar-buckling instability. Although we find that bars are not destroyed by the buckling instability, when we decompose the radial density profiles of the secularly-evolved disks into inner S\'ersic and outer exponential components, for favorable viewing angles, the resulting structural parameters, scaling relations and global kinematics of the bar components are in good agreement with those obtained for bulges of late-type galaxies. Round bulges may require a different formation channel or dissipational processes.Comment: Accepted to ApJL. 4 figures, 2 in color Corrected minor typos and reference lis

Unusual products of the aqueous chlorination of atenolol

The reaction of the drug atenolol with hypochlorite under conditions that simulate wastewater disinfection was investigated. The pharmaceutical reacted in 1 h yielding three products that were separated by chromatographic techniques and characterized by spectroscopic features. Two unusual products 2-(4-(3-(chloro(2-chloropropan- 2-yl)amino)-2-hydroxypropoxy) phenyl) acetamide and 2-(4- (3-formamido- 2-hydroxypropoxy) phenyl) acetamide were obtained along with 2-(4-hydroxyphenyl) acetamide. When the reaction was stopped at shorter times only 2-(4-(3-amino-2-hydroxypropoxy) phenyl) acetamide and the dichlorinated product were detected. Tests performed on the seeds of Lactuca sativa show that chlorinated products have phytotoxic activity

Extending fairness expressibility of ECTL+: a tree-style one-pass tableau approach

Temporal logic has become essential for various areas in computer science, most notably for the specification and verification of hardware and software systems. For the specification purposes rich temporal languages are required that, in particular, can express fairness constraints. For linear-time logics which deal with fairness in the linear-time setting, one-pass and two-pass tableau methods have been developed. In the repository of the CTL-type branching-time setting, the well-known logics ECTL and ECTL^+ were developed to explicitly deal with fairness. However, due to the syntactical restrictions, these logics can only express restricted versions of fairness. The logic CTL^*, often considered as "the full branching-time logic" overcomes these restrictions on expressing fairness. However, this logic itself, is extremely challenging for the application of verification techniques, and the tableau technique, in particular. For example, there is no one-pass tableau construction for this logic, while it is known that one-pass tableau has an additional benefit enabling the formulation of dual sequent calculi that are often treated as more "natural" being more friendly for human understanding. Based on these two considerations, the following problem arises - are there logics that have richer expressiveness than ECTL^+ yet "simpler" than CTL^* for which a one-pass tableau can be developed? In this paper we give a solution to this problem. We present a tree-style one-pass tableau for a sub-logic of CTL^* that we call ECTL^#, which is more expressive than ECTL^+ allowing the formulation of a new range of fairness constraints with "until" operator. The presentation of the tableau construction is accompanied by an algorithm for constructing a systematic tableau, for any given input of admissible branching-time formulae. We prove the termination, soundness and completeness of the method. As tree-shaped one-pass tableaux are well suited for the automation and are amenable for the implementation and for the formulation of sequent calculi, our results also open a prospect of relevant developments of the automation and implementation of the tableau method for ECTL^#, and of a dual sequent calculi

Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+

Temporal logic has become essential for various areas in computer science, most notably for the specification and verification of hardware and software systems. For the specification purposes rich temporal languages are required that, in particular, can express fairness constraints. For linear-time logics which deal with fairness in the linear-time setting, one-pass and two-pass tableau methods have been developed. In the repository of the CTL-type branching-time setting, the well-known logics ECTL and ECTL+ were developed to explicitly deal with fairness. However, due to the syntactical restrictions, these logics can only express restricted versions of fairness. The logic CTL⋆, often considered as ‘the full branching-time logic’ overcomes these restrictions on expressing fairness. However, CTL⋆ is extremely challenging for the application of verification techniques, and the tableau technique, in particular. For example, there is no one-pass tableau construction for CTL⋆, while one-pass tableau has an additional benefit enabling the formulation of dual sequent calculi that are often treated as more ‘natural’ being more friendly for human understanding. These two considerations lead to the following problem - are there logics that have richer expressiveness than ECTL+, allowing the formulation of a new range of fairness constraints with ‘until’ operator, yet ‘simpler’ than CTL⋆, and for which a one-pass tableau can be developed? Here we give a positive answer to this question, introducing a sub-logic of CTL⋆ called ECTL#, its tree-style one-pass tableau, and an algorithm for obtaining a systematic tableau, for any given admissible branching-time formulae. We prove the termination, soundness and completeness of the method. As tree-shaped one-pass tableaux are well suited for the automation and are amenable for the implementation and for the formulation of sequent calculi. Our results also open a prospect of relevant developments of the automation and implementation of the tableau method for ECTL#, and of a dual sequent calculi

Perfect state transfers by selective quantum interferences within complex spin networks

We present a method that implement directional, perfect state transfers within a branched spin network by exploiting quantum interferences in the time-domain. That provides a tool to isolate subsystems from a large and complex one. Directionality is achieved by interrupting the spin-spin coupled evolution with periods of free Zeeman evolutions, whose timing is tuned to be commensurate with the relative phases accrued by specific spin pairs. This leads to a resonant transfer between the chosen qubits, and to a detuning of all remaining pathways in the network, using only global manipulations. As the transfer is perfect when the selected pathway is mediated by 2 or 3 spins, distant state transfers over complex networks can be achieved by successive recouplings among specific pairs/triads of spins. These effects are illustrated with a quantum simulator involving 13C NMR on Leucine's backbone; a six-spin network.Comment: 5 pages, 3 figure

One-pass Context-based Tableaux Systems for CTL and ECTL

When building tableau for temporal logic formulae, applying a two-pass construction, we first check the validity of the given tableaux input by creating a tableau graph, and then, in the second `pass', we check if all the eventualities are satisfied. In one-pass tableaux checking the validity of the input does not require these auxiliary constructions. This paper continues the development of one-pass tableau method for temporal logics introducing tree-style one-pass tableau systems for Computation Tree Logic (CTL) and shows how this can be extended to capture Extended CTL (ECTL). A distinctive feature here is the utilisation, for the core tableau construction, of the concept of a context of an eventuality which forces its earliest fulfilment. Relevant algorithms for obtaining a systematic tableau for these branching-time logics are also defined. We prove the soundness and completeness of the method. With these developments of a tree-shaped one-pass tableau for CTL and ECTL, we have formalisms which are well suited for the automation and are amenable for the implementation, and for the formulation of dual sequent calculi. This brings us one step closer to the application of one pass context based tableaux in certified model checking for a variety of CTL-type branching-time logics

A strategic approach to network value in network industries

This article extends previous research on network industries by analyzing the role that firm strategy plays in markets where network effects are important. The authors postulate that firms can benefit from the existence of network effects through their strategic choices. The main premise of this article is that companies, by influencing expectations, coordination, and compatibility, can leverage network effects and network value. The authors empirically test their hypotheses in the mobile telecommunications industry, a paradigmatic example of a network industry. This study not only seeks to understand the impact of firm strategy on network value but also analyzes the impact of the latter on firm performance

How the culture of a country explains the social status of entrepreneurs

Despite the benefits of entrepreneurial activity on economic development, entrepreneurs do not have a good social status in all societies. While in some countries they are highly respected (Anglo-Saxon context), in others, their image is not so positive (European context). In this paper, we highlight these differences using a sample from the GEM project and explain the social status of entrepreneurs using the cultural profile of countries, which is measured with the Schwartz database. Our results show that some cultural profiles favor entrepreneurs' social status