INTERACTIVE SYSTEM FOR ON-LINE CONSULTING

Liberal professions, developed after 1990, require an historical casuistry that enable them to reach a pertinent conclusion to another similar case. Where there is not a similar case tried, it is required the need for a procedure for resolving differencesbar, process model, standard, association

CONSIDERATIONS ON THE MEASURES TO COUNTER THE RISK OF BANKRUPTCY FOR SMES DURING THE FINANCIAL CRISIS

The financial crisis in Romania has expressed in an eloquent manner and meant large negative effects, such as external factors generated by trigger of the financial crisis in Romania in October 2008 and internal factors for society that fundamentally influenced the decreasing of funding in 2009. Promotion of private initiative is, in our opinion, one of the methods that attenuate the financial effort of state for social segment which generates costs and, is producing revenue for the state. In this paper we promote the idea of opening a fundamental process of restructuring the SME’s management mentality, that of safeguarding of the enterprises with existing instruments, but also with new proposals to the Government, for regeneration as soon as possible of the country's economic and human factors capable of working.bankruptcy, SME, Reorganization, companies, crisis, fusion.

Employees Misbehaviour. Formes, Causes and What Management Should do to Handle With

In many organizations there are employees who sabotage processes, steal company property, harass others, cheat the management or mislead customers. These misbehaviours of the employees are pervasive and costly. In the same time, they are warning that employees` needs are not met. Sometimes managers avoid to facing the unacceptable behaviours of the employee due to certain psychological reasons. The approach of problem-employees is a challenge for the managers. While most of them may be tempted to dismiss these employees researches have indicated that the best alternative is to learn how to behave with that person.employee misbehaviour, violence at the workplace, substance abuse, workplace dishonesty, causes of misbehaviours, problem-employees

The Role of Ontologies for Designing Accounting Information Systems

The accounting ontologies were conceptualized as a framework for building accounting information systems in a shared data environment, within enterprises or between different enterprises. The model’s base feature was an object pattern consisting of two mirror-image that represented conceptual the input and output components of a business process. The REA acronym derives from that pattern’s structure, which consisted of economic resources, economic events, and economic agents. The REA model was proposed as a means for an organization to capture the signification of economic exchanges between two business partners. The REA ontology provides an alternative for modelling an enterprise’s economic resources, economic events, economic agents, and their relationships. Resources are considerate organization assets that are able to generate revenue for implicated parties. Events provide a source of detailed data in this approach. Agents participate in events and can affect some resources. They can be an individual or organization inside or outside the organization that is capable of controlling economic resources and interacting with other agents. The objective of this work is to offer an understandable of this framework and to explain how this model can help us via the identification of the afferent concepts.REA ontology, accounting information systems, business process, economic exchange

The Role of Ontologies for Designing Accounting Information Systems

The accounting ontologies were conceptualized as a framework for building accounting information systems in a shared data environment, within enterprises or between different enterprises. The model’s base feature was an object pattern consisting of two mirror-image that represented conceptual the input and output components of a business process. The REA acronym derives from that pattern’s structure, whichconsisted of economic resources, economic events, and economic agents. The REA model was proposed as a means for an organization to capture the signification of economic exchanges between two business partners. The REA ontology provides an alternative for modelling an enterprise’s economic resources, economic events, economic agents, andtheir relationships. Resources are considerate organization assets that are able to generate revenue for implicated parties. Events provide a source of detailed data in this approach. Agents participate in events and can affect some resources. They can be anindividual or organization inside or outside the organization that is capable of controlling economic resources and interacting with other agents. The objective of this work is to offer an understandable of this framework and to explain how this model can help us via the identification of the afferent concepts

ENVIRONMENTAL RISK IN ROMANIAN VINEYARDS

Agricultural activity, unlike other economic areas, is accompanied by a high degree of risk and uncertainty, caused mainly by environmental factors. The influence of weather on growth and developing processes of crops, orchards and vineyards is the science which studies and determines agricultural biotope necessary to achieve optimal biological productivity. Thus, agro meteorology involves agro-climatic resources’ management and conservation in developing agricultural production process (weather - deepening relationship). Agriculture, as user of agro meteorological information, recover their combination with specialized information (agricultural, technological, economic, etc.) for preventing and minimizing climatic risk upon plant species, but also for establishing sustainable development strategies. In order to prevent and reduce the negative impact on wine production, it is necessary to monitor weather forecasts and hazardous to achieve decision-making system of protection and assurance wine production.natural hazards, traceability, agro meteorological monitoring, risk management.

Bayesian optimization for materials design

We introduce Bayesian optimization, a technique developed for optimizing time-consuming engineering simulations and for fitting machine learning models on large datasets. Bayesian optimization guides the choice of experiments during materials design and discovery to find good material designs in as few experiments as possible. We focus on the case when materials designs are parameterized by a low-dimensional vector. Bayesian optimization is built on a statistical technique called Gaussian process regression, which allows predicting the performance of a new design based on previously tested designs. After providing a detailed introduction to Gaussian process regression, we introduce two Bayesian optimization methods: expected improvement, for design problems with noise-free evaluations; and the knowledge-gradient method, which generalizes expected improvement and may be used in design problems with noisy evaluations. Both methods are derived using a value-of-information analysis, and enjoy one-step Bayes-optimality

Fast Reinforcement Learning with Large Action Sets Using Error-Correcting Output Codes for MDP Factorization

International audienceThe use of Reinforcement Learning in real-world scenarios is strongly limited by issues of scale. Most RL learning algorithms are unable to deal with problems composed of hundreds or sometimes even dozens of possible actions, and therefore cannot be applied to many real-world problems. We consider the RL problem in the supervised classification framework where the optimal policy is obtained through a multiclass classifier, the set of classes being the set of actions of the problem. We introduce error-correcting output codes (ECOCs) in this setting and propose two new methods for reducing complexity when using rollouts-based approaches. The first method consists in using an ECOC-based classifier as the multiclass classifier, reducing the learning complexity from O(A2) to O(Alog(A)) . We then propose a novel method that profits from the ECOC's coding dictionary to split the initial MDP into O(log(A)) separate two-action MDPs. This second method reduces learning complexity even further, from O(A2) to O(log(A)) , thus rendering problems with large action sets tractable. We finish by experimentally demonstrating the advantages of our approach on a set of benchmark problems, both in speed and performance

Comparative analysis, the base of some viable solutions in entrepreneurship

According to an expert on issues of entrepreneurship, John Lary, decent living is defined as: "I feel rich when you can do whatever I want in life, can travel where I want, buy whatever I want and I can live anywhere in the house that I drive the cars they want, without having ever so, ever, to check my bank account. This means that always had enough money to cover expenses that keep my lifestyle. This is my definition for the term rich”. I consider the entrepreneurship one of the best economic solutions for development and achieving a decent standard of living. In this paper I propose to develop a comparative study on occupancy of 10 spaces located in the port of Galati, the study aiming at the selection of the three areas and fields with the greatest chance for opening a business implementation

Design of competitive paging algorithms with good behaviour in practice

Paging is one of the most prominent problems in the field of online algorithms. We have to serve a sequence of page requests using a cache that can hold up to k pages. If the currently requested page is in cache we have a cache hit, otherwise we say that a cache miss occurs, and the requested page needs to be loaded into the cache. The goal is to minimize the number of cache misses by providing a good page-replacement strategy. This problem is part of memory-management when data is stored in a two-level memory hierarchy, more precisely a small and fast memory (cache) and a slow but large memory (disk). The most important application area is the virtual memory management of operating systems. Accessed pages are either already in the RAM or need to be loaded from the hard disk into the RAM using expensive I/O. The time needed to access the RAM is insignificant compared to an I/O operation which takes several milliseconds. The traditional evaluation framework for online algorithms is competitive analysis where the online algorithm is compared to the optimal offline solution. A shortcoming of competitive analysis consists of its too pessimistic worst-case guarantees. For example LRU has a theoretical competitive ratio of k but in practice this ratio rarely exceeds the value 4. Reducing the gap between theory and practice has been a hot research issue during the last years. More recent evaluation models have been used to prove that LRU is an optimal online algorithm or part of a class of optimal algorithms respectively, which was motivated by the assumption that LRU is one of the best algorithms in practice. Most of the newer models make LRU-friendly assumptions regarding the input, thus not leaving much room for new algorithms. Only few works in the field of online paging have introduced new algorithms which can compete with LRU as regards the small number of cache misses. In the first part of this thesis we study strongly competitive randomized paging algorithms, i.e. algorithms with optimal competitive guarantees. Although the tight bound for the competitive ratio has been known for decades, current algorithms matching this bound are complex and have high running times and memory requirements. We propose the algorithm OnlineMin which processes a page request in O(log k/log log k) time in the worst case. The best previously known solution requires O(k^2) time. Usually the memory requirement of a paging algorithm is measured by the maximum number of pages that the algorithm keeps track of. Any algorithm stores information about the k pages in the cache. In addition it can also store information about pages not in cache, denoted bookmarks. We answer the open question of Bein et al. '07 whether strongly competitive randomized paging algorithms using only o(k) bookmarks exist or not. To do so we modify the Partition algorithm of McGeoch and Sleator '85 which has an unbounded bookmark complexity, and obtain Partition2 which uses O(k/log k) bookmarks. In the second part we extract ideas from theoretical analysis of randomized paging algorithms in order to design deterministic algorithms that perform well in practice. We refine competitive analysis by introducing the attack rate parameter r, which ranges between 1 and k. We show that r is a tight bound on the competitive ratio of deterministic algorithms. We give empirical evidence that r is usually much smaller than k and thus r-competitive algorithms have a reasonable performance on real-world traces. By introducing the r-competitive priority-based algorithm class OnOPT we obtain a collection of promising algorithms to beat the LRU-standard. We single out the new algorithm RDM and show that it outperforms LRU and some of its variants on a wide range of real-world traces. Since RDM is more complex than LRU one may think at first sight that the gain in terms of lowering the number of cache misses is ruined by high runtime for processing pages. We engineer a fast implementation of RDM, and compare it to LRU and the very fast FIFO algorithm in an overall evaluation scheme, where we measure the runtime of the algorithms and add penalties for each cache miss. Experimental results show that for realistic penalties RDM still outperforms these two algorithms even if we grant the competitors an idealistic runtime of 0