Nominal Rigidities and The Real Effects of Monetary Policy in a Structural VAR Model

The paper proposes an empirical VAR for the UK open economy in order to measure the effects of monetary policy shocks from 1981 to 2003. The identification of the VAR structure is based on short-run restrictions that are consistent with the general implications of a New Keynesian model. The identification scheme used in the paper is successful in identifying monetary policy shocks and solving the puzzles and anomalies regarding the effects of monetary policy shocks. The estimated dynamic impulse responses and the forecast error variance decompositions show a consistency with the New Keynesian approach and other available theories.Structural VAR; Nominal Rigidities; Monetary Policy Shocks; New Keynesian Theory

シールド工法におけるセグメント設計法の境界条件に関する研究

国立大学法人長岡技術科学大

Exploration efficace de l'espace d'état pour les programmes distribués asynchrones: Adaptation de l’UDPOR aux programes MPI.

Distributed message passing applications are in the mainstream of information technology since they exploit the power of parallel computer systems to produce higher performance. Designing distributed programs remains challenging because developers have to reason about concurrency, non-determinism, data distribution… that are main characteristics of distributed programs. Besides, it is virtually impossible to ensure the correctness of such programs via classical testing approaches since one may never successfully reach the execution that leads to unwanted behaviors in the programs. There is thus a need for more powerful verification techniques. Model-checking is one of the formal methods that allows to verify automatically and effectively some properties on models of computer systems by exploring all possible behaviors (states and transitions) of the system model. However, state spaces increase exponentially with the number of concurrent processes, leading to “state space explosion”.Unfolding-based Dynamic Partial Order Reduction (UDPOR) is a recent technique mixing Dynamic Partial Order Reduction (DPOR) with concepts of concurrency theory such as unfoldings to efficiently mitigate state space explosion in model-checking of concurrent programs. It is optimal in the sense that each Mazurkiewicz trace, i.e. a class of interleavings equivalent by commuting adjacent independent actions, is explored exactly once. And it is applicable to running programs, not only models of programs.The thesis aims at adapting UDPOR to verify asynchronous distributed programs (e.g. MPI programs) in the setting of the SIMGRID simulator of distributed applications. To do so, an abstract programming model of asynchronous distributed programs is defined and formalized in the TLA+ language, allowing to precisely define an independence relation, a main ingredient of the concurrency semantics. Then, the adaptation of UDPOR, involving the construction of an unfolding, is made efficient by a precise analysis of dependencies in the programming model, allowing efficient computations of usually costly operation. A prototype implementation of UDPOR adapted to distributed asynchronous programs has been developed, giving promising experimental results on a significant set of benchmarks.Distributed message passing applications are in the mainstream of information technology since they exploit the power of parallel computer systems to produce higher performance. Designing distributed programs remains challenging because developers have to reason about concurrency, non-determinism, data distribution… that are main characteristics of distributed programs. Besides, it is virtually impossible to ensure the correctness of such programs via classical testing approaches since one may never successfully reach the execution that leads to unwanted behaviors in the programs. There is thus a need for more powerful verification techniques. Model-checking is one of the formal methods that allows to verify automatically and effectively some properties on models of computer systems by exploring all possible behaviors (states and transitions) of the system model. However, state spaces increase exponentially with the number of concurrent processes, leading to “state space explosion”.Unfolding-based Dynamic Partial Order Reduction (UDPOR) is a recent technique mixing Dynamic Partial Order Reduction (DPOR) with concepts of concurrency theory such as unfoldings to efficiently mitigate state space explosion in model-checking of concurrent programs. It is optimal in the sense that each Mazurkiewicz trace, i.e. a class of interleavings equivalent by commuting adjacent independent actions, is explored exactly once. And it is applicable to running programs, not only models of programs.The thesis aims at adapting UDPOR to verify asynchronous distributed programs (e.g. MPI programs) in the setting of the SIMGRID simulator of distributed applications. To do so, an abstract programming model of asynchronous distributed programs is defined and formalized in the TLA+ language, allowing to precisely define an independence relation, a main ingredient of the concurrency semantics. Then, the adaptation of UDPOR, involving the construction of an unfolding, is made efficient by a precise analysis of dependencies in the programming model, allowing efficient computations of usually costly operation. A prototype implementation of UDPOR adapted to distributed asynchronous programs has been developed, giving promising experimental results on a significant set of benchmarks

AN EVIDENCE FOR THE CONTRIBUTION OF ANAMMOX PROCESS IN NITROGEN REMOVAL FROM GROUNDWATER

Joint Research on Environmental Science and Technology for the Eart

Variation of constant formulas for fractional difference equations

In this paper, we establish variation of constant formulas for both Caputo and Riemann- Liouville fractional difference equations. The main technique is the Z -transform. As an application, we prove a lower bound on the separation between two different solutions of a class of nonlinear scalar fractional difference equations

Attention correlated appearance and motion feature followed temporal learning for activity recognition

Recent advances in deep neural networks have been successfully demonstrated with fairly good accuracy for multi-class activity identification. However, existing methods have limitations in achieving complex spatial-temporal dependencies. In this work, we design two stream fusion attention (2SFA) connected to a temporal bidirectional gated recurrent unit (GRU) one-layer model and classified by prediction voting classifier (PVC) to recognize the action in a video. Particularly in the proposed deep neural network (DNN), we present 2SFA for capturing appearance information from red green blue (RGB) and motion from optical flow, where both streams are correlated by proposed fusion attention (FA) as the input of a temporal network. On the other hand, the temporal network with a bi-directional temporal layer using a GRU single layer is preferred for temporal understanding because it yields practical merits against six topologies of temporal networks in the UCF101 dataset. Meanwhile, the new proposed classifier scheme called PVC employs multiple nearest class mean (NCM) and the SoftMax function to yield multiple features outputted from temporal networks, and then votes their properties for high-performance classifications. The experiments achieve the best average accuracy of 70.8% in HMDB51 and 91.9%, the second best in UCF101 in terms of 2DConvNet for action recognition

Random Lasing from a Layer of ZnO Powder Painted on Glass Substrate under Excitation of Nanosecond and Picosecond Laser Pulses

The ZnO powder which consists of monodisperse colloidal spheres with average diameter of 100-300 nm was synthesized by hydrolysis of Zinc acetate dehydrate. The random lasing around 380 nm was produced from a layer of the ZnO powder painted on a glass substrate and optically pumped at 355 nm. Our experimental results show that random laser action of a layer of ZnO spherical nanoparticles and the characteristics of these random lasers under excitation of nanosecond and picosecond laser pulses

Channel assignment in IEEE 802.11-based substitution networks

International audienceA substitution network is a rapidly deployable wireless network that provides a backup solution to quickly react to failures on an existing network. We consider a substitution network scenario where wireless routers are equipped with several Wi-Fi cards. The problem addressed in this paper deals with the channel assignment of these wireless interfaces. In this particular context, it is possible to derive an objectivefunction that estimates precisely the overall throughput that can be achieved. This problem is formulated through a linear optimization problem for which we propose a heuristics. Solutions give the channel assignments but also the optimal traffic load sharing between the different paths of the substitution network. Simulation results, performed with ns-3, compare our heuristics to the optimum and to classical approaches

Biocontrol of Alternaria alternata YZU, a causal of stem end rot disease on pitaya, with soil phosphate solubilizing bacteria

Stem end rot is the most destructive disease caused by Alternaria alternata YZU in pitaya-growing regions of Vietnam. This study was conducted to characterize antagonistic phosphate-solubilizing bacteria (PSB) from rhizosphere soil for their biocontrol activities against A. alternata YZU and evaluate the effect of temperature, pH, and water activity on that antagonism. Among seven PSB isolated from 45 rhizosphere soil samples, PSB31 (identified as Bacillus sp. strain IMAU61039, Accession number: MF803700.1) exhibited the highest antagonistic activity against A. alternata YZU with an average inhibition diameter of 0.65 ± 0.05 cm. The results also show that the strain PSB31 controlled the mycelial growth of A. alternata YZU by secreting antifungal metabolites. The most potent inhibitory activity was identified under in vitro conditions of 25 °C, pH 7, and aw 1. The isolated PSB31 could be a potential biological control agent against A. alternata YZU