Comparative Approach between Organizational Life Cycle and Rational Biological Model

This paper proposes an analogy between rational biological model and the organizations’ development during their existence. So, organizations’ "birth" or creation are considered the result of genetic algorithms, transformations are identified with changes that aim the adapting to the environment, and finally the ”death” treats the state of crisis and bankruptcy. In every stage of life there are proposals to increase it, by extension of states identified in the human area and not taken into account in the artificial one, which must learn from the first system, which we consider superior in the process of evolution. Although the authors’ approaches, do not build operational models to support the thesis presented, ask questions and focus on elements of management philosophy that "tomorrow" will certainly be resolved.genetic algorithms; organizational pathology; step by step evolution; tandem management change - organizational change.

Measuring the Managerial Potential

The paper proposes the measurement of managerial and functional capabilities of the organization, as the dimensions of managerial potential, based on the configurative theory and not on the reductionist one. The components of the managerial potential are fulfilled by the capability of building organizational culture, managerial change and defining equity as the proximate type of social responsibility. The components are described in relation with the socio-economic model, useful in the process of economic and social crisis when new issues of organization management appear.the management capability, organizational capability functioning, the capability of building organizational culture, managerial change capability, equity, socioeconomic model

Romania’s development level comparing with EU countries: The RGS (Relative Gap Scoring) Ranking Index

The main objective of Romania’s post-accession strategy stands for the convergence with the EU Member States. If the nominal convergence (low inflation rate, stability of the exchange and interest rates, contained public debt) seems more easily to be achieved, the real convergence is supposed to catch up structural gap, connected more or less to issues belonging to the development process approach. The study aims at comparative assessment of Romania’s development level within UE 27, proposing a composite index, called Relative Gap Scoring (RGS). This method is based on a scoring calculation depending on the quotient of each indicator level for a certain country and of the country’s ranked first for the respectively indicator, having the advantage to evidence the relative gaps and providing a synthetic image of their resultant. The RGS index has been constructed by the geometric aggregation of scoring resulted for 10 economic and social indicators, considered relevant for the prospective of real convergence. Examining Romania's position within the ranking of EU countries according to the RGS index, the study found that large gap of the current state of economic and social development of our country still remain. Nevertheless, it is worth mentioning that Romania stood at 42.5 percent of the EU average in 2007, while in relation to GDP per capita (PPS) at 40.4 percent, which reveals that, in terms of real convergence, the time horizon of catching up with EU countries could be shorter.Economic and Social Development; International Comparisons; Composite Indexes; Statistical Methods

A quantifying method of microinvestment optimum

Amid the controversies around the optimisation criteria and the objective functions when applying mathematical methods in economics, we proposed a method of quantifying a multi-criteria optimum, called critical distance method. The demonstration of this method is exemplified by assessing the investment optimum at microeconomic level (project or company portfolio choice). A hyperbolic paraboloid function of three variables (the recovery time, the investment value and the unit cost) representing a surface of the second degree has been defined. The intersection of the hyperbolic parabola planes identifies the point where the three considered variables have the same value, signifying an equal importance attached to them and revealing the optimum level of their interaction. The distance from this critical point to the origin represents, in fact, the criterion according to which one could choose the most efficient investment alternative. In our opinion, the proposed method could be extended to the study of any economic process.microeconomic optimum; critical distance method; portfolio choice; investment alternatives; multi-criteria optimum

Improving Organizations by Replacing the "Mechanical" Model with the "Organic" one

Organizations are currently viewed as artificial structures. However, in our opinion, organizations seem to match a biological structure much better. This paper explores this new approach with some interesting conclusions and results: organizations aim at perpetual exis-tence and continuous adaptation. We advance the ideas of organizational "instincts", organizational pathology and organizational optimization using genetic algorithms. In competitive markets, organizations are in a natural selection process, which actually is part of a natural genetic algorithm. This process may be simulated in an artificial multidisciplinary optimization environment, based on minimizing a Total Costs and Risks objective function. Unlike the gradient optimization methods, the genetic algorithms may be applied to such problems with thousands of degrees of freedom. This opens the way to the organizational structure optimization through genetic algorithms.organization, genetic algorithms, multidisciplinary optimization, organizational analysis, organizational structure

The Development of a Benchmark Tool for NoSQL Databases

The aim of this article is to describe a proposed benchmark methodology and software application targeted at measuring the performance of both SQL and NoSQL databases. These represent the results obtained during PhD research (being actually a part of a larger application intended for NoSQL database management). A reason for aiming at this particular subject is the complete lack of benchmarking tools for NoSQL databases, except for YCBS [1] and a benchmark tool made specifically to compare Redis to RavenDB. While there are several well-known benchmarking systems for classical relational databases (starting with the canon TPC-C, TPC-E and TPC-H), on the other side of databases world such tools are mostly missing and seriously needed

OPTIMAL AREA AND PERFORMANCE MAPPING OF K-LUT BASED FPGAS

FPGA circuits are increasingly used in many fields: for rapid prototyping of new products (including fast ASIC implementation), for logic emulation, for producing a small number of a device, or if a device should be reconfigurable in use (reconfigurable computing). Determining if an arbitrary, given wide, function can be implemented by a programmable logic block, unfortunately, it is generally, a very difficult problem. This problem is called the Boolean matching problem. This paper introduces a new implemented algorithm able to map, both for area and performance, combinational networks using k-LUT based FPGAs.k-LUT based FPGAs, combinational circuits, performance-driven mapping.

OPTIMIZING LARGE COMBINATIONAL NETWORKS FOR K-LUT BASED FPGA MAPPING

Optimizing by partitioning is a central problem in VLSI design automation, addressing circuit’s manufacturability. Circuit partitioning has multiple applications in VLSI design. One of the most common is that of dividing combinational circuits (usually large ones) that will not fit on a single package among a number of packages. Partitioning is of practical importance for k-LUT based FPGA circuit implementation. In this work is presented multilevel a multi-resource partitioning algorithm for partitioning large combinational circuits in order to efficiently use existing and commercially available FPGAs packagestwo-way partitioning, multi-way partitioning, recursive partitioning, flat partitioning, critical path, cutting cones, bottom-up clusters, top-down min-cut