Estimation of an open economy DSGE model for Romania. Do nominal and real frictions matter?

In this paper we use a medium scale open economy DSGE model developed by Adolfson et al. (2005). Besides authors’ observables we include also one extra observable series (CPI) in the model. Some of the parameters will be calibrated as to match sample’s mean or common values found in literature and others will be etimated on Romania’s data with the help of Bayesian techniques. Next, we specify some alternative scenarios where nominal or real rigidities will be ”turned off” and we asses their importance for the data generating process (with the help of marginal log likelihood).DSGE

Design of object processing systems

Object processing systems are met rather often in every day life, in industry, tourism, commerce, etc. When designing such a system, many problems can be posed and considered, depending on the scope and purpose of design. We give here a general approach which involves graph theory, and which can have many applications. The generation of possible designs for an object processing system, known as synthesis in the engineering field, is reduced to first solving a graph embedding problem. We believe that our model could be successful and relatively easily implemented in a software tool, called Smart Synthesis Tool, so that the engineering design process will perform quicker. We propose three types of graph transformations which aid the way an object processing system can be designed. Future work will show to which extent these transformation types suffice for generating most of the layouts of the object processing systems

An efficient sparse conjugate gradient solver using a Beneš permutation network

© 2014 Technical University of Munich (TUM).The conjugate gradient (CG) is one of the most widely used iterative methods for solving systems of linear equations. However, parallelizing CG for large sparse systems is difficult due to the inherent irregularity in memory access pattern. We propose a novel processor architecture for the sparse conjugate gradient method. The architecture consists of multiple processing elements and memory banks, and is able to compute efficiently both sparse matrix-vector multiplication, and other dense vector operations. A Beneš permutation network with an optimised control scheme is introduced to reduce memory bank conflicts without expensive logic. We describe a heuristics for offline scheduling, the effect of which is captured in a parametric model for estimating the performance of designs generated from our approach

A Mediated Definite Delegation Model allowing for Certified Grid Job Submission

Grid computing infrastructures need to provide traceability and accounting of their users" activity and protection against misuse and privilege escalation. A central aspect of multi-user Grid job environments is the necessary delegation of privileges in the course of a job submission. With respect to these generic requirements this document describes an improved handling of multi-user Grid jobs in the ALICE ("A Large Ion Collider Experiment") Grid Services. A security analysis of the ALICE Grid job model is presented with derived security objectives, followed by a discussion of existing approaches of unrestricted delegation based on X.509 proxy certificates and the Grid middleware gLExec. Unrestricted delegation has severe security consequences and limitations, most importantly allowing for identity theft and forgery of delegated assignments. These limitations are discussed and formulated, both in general and with respect to an adoption in line with multi-user Grid jobs. Based on the architecture of the ALICE Grid Services, a new general model of mediated definite delegation is developed and formulated, allowing a broker to assign context-sensitive user privileges to agents. The model provides strong accountability and long- term traceability. A prototype implementation allowing for certified Grid jobs is presented including a potential interaction with gLExec. The achieved improvements regarding system security, malicious job exploitation, identity protection, and accountability are emphasized, followed by a discussion of non- repudiation in the face of malicious Grid jobs

Optimising Sparse Matrix Vector multiplication for large scale FEM problems on FPGA

Sparse Matrix Vector multiplication (SpMV) is an important kernel in many scientific applications. In this work we propose an architecture and an automated customisation method to detect and optimise the architecture for block diagonal sparse matrices. We evaluate the proposed approach in the context of the spectral/hp Finite Element Method, using the local matrix assembly approach. This problem leads to a large sparse system of linear equations with block diagonal matrix which is typically solved using an iterative method such as the Preconditioned Conjugate Gradient. The efficiency of the proposed architecture combined with the effectiveness of the proposed customisation method reduces BRAM resource utilisation by as much as 10 times, while achieving identical throughput with existing state of the art designs and requiring minimal development effort from the end user. In the context of the Finite Element Method, our approach enables the solution of larger problems than previously possible, enabling the applicability of FPGAs to more interesting HPC problems

SITUATION OF INTERIM FINANCIAL REPORTING IN ROMANIA

In Romania, unfortunately, here we can not speak of the existence of interim financial reports. The financial statements required to be submitted to the tax authorities for the first half of each fiscal year are rather too short list of the main economic - financial indicators than a tool that can be useful to a financial analysis. Notes to the interim financial reports often are brief or nonexistent and presents irrelevant information in understanding the evolution of society. The article is presenting the appearance and evolution of financial reporting from Romania, with accent on the interim ones

ADAPTING FINANCIAL REPORTING PRACTICES TO IAS / IFRS

In economic and financial communication, the common language is represented by accounting rules consenting the process of converting operations related to economic developments in figures (the position of the one who prepares financial reports) and a process of conversion of figures in economic transactions (situation of using financial statements). Therefore it occurs the necessary accounting normalization process, involving a complex of rules set to uniform criteria which are based on the representation and interpretation of the values of the financial reports. These rules, whether general or specific, or may derive from accounting practice can be established through legislation. The paper is presenting the harmonisation process of the national accountings to the international standards, as IAS and IFRS

CONSIDERATIONS REGARDING HISTORY OF INTERIM FINANCIAL REPORTING

Financial reporting is nowadays, the basis of the decision making, investment and commercial and financial transactions. The present form of the financial reporting is based on history and human evolution, being observed even in Egyptian period. The paper is presenting the evolution of financial reports, underlining its stages, finalising with the appearance of interim financial statements. It is well recognised the internationalisation of the accounting statements and reports, as a result of the business and trade globalisation, the national borders being eliminated by common standards and principles