Search in Publications

Found 6273 publications

Success criteria of a knowledge based organizational operation -or the necessity of the leadership style change

Publication Name: Problems and Perspectives in Management

Publication Date: 2007-01-01

Volume: 5

Issue: 2

Page Range: 51-65

Description:

In corporate practice the condition of success is that leaders must be aware of the value of human capital. The target of our theoretical research was to identify expectations that we can create against managers, who want to realize the development and successful operation of Knowledge Management System (KMS). We composed some questions that we answered in the study. The phases of our research: We looked over and summarized expectations generally valid in leading work and expectations, which are waiting for the realization as the elements of KMS, We selected expectations and identified the common areas in consideration of principal expectations that managers have to accomplish, We summarized the relations among principal features succeed in the following fields: satisfaction - emotional intelligence (EQ) - elements of Knowledge Management (KM), EQ - managing competence - elements of KM. We drafted the direction of change and things that managers have to do to make KMS work successful. The result of our theoretically research will be expanded to practical field, the managerial practice will be measured, tested, compared against the drafted expectations and with the extent of their fulfilment. We will give an account of the practical results in a following study. © Andrea Bencsik, Krisztina Bognár, 2007.

Open Access: Yes

DOI: DOI not available

Simulation of 3-dimensional cell population growth processes in polyhedral cellular systems

Publication Name: Materials Science Forum

Publication Date: 2007-01-01

Volume: 537-538

Issue: Unknown

Page Range: 579-590

Description:

In order to simulate the polyhedral grain nucleation in alloys, 3-D cell population growth processes are studied in space-filling periodic cellular systems. We discussed two different methods by which space-filling polyhedral cellular systems can be constructed by topological transformations performed on "stable" 3-D cellular systems. It has been demonstrated that an infinite sequence of stable periodic space-filling polyhedral systems can be generated by means of a simple recursion procedure based on a vertex based tetrahedron insertion. On the basis of computed results it is conjectured that in a 3-D periodic, topologically stable cellular system the minimum value of the average face number 〈f〉 of polyhedral cells is larger than eight (i.e. 〈f〉 > 8). The outlined algorithms (which are based on cell decomposition and/or cell nucleation) provide a new perspective to simulate grain population growth processes in materials with polyhedral microstructure.

Open Access: Yes

DOI: 10.4028/0-87849-426-x.579

On the topological characterization of 3-D polyhedral microstructures

Publication Name: Materials Science Forum

Publication Date: 2007-01-01

Volume: 537-538

Issue: Unknown

Page Range: 563-570

Description:

To characterize topologically the polycrystalline microstructure of single-phase alloys computer simulations are performed on 3-dimensional cellular models. These infinite periodic cellular systems are constructed from a finite set of space filling convex polyhedra (grains). It is shown that the appropriately selected topological shape factors can be successfully used for the quantitative characterization of computer-simulated microstructures of various types.

Open Access: Yes

DOI: 10.4028/0-87849-426-x.563

On the temperature rate dependent transformation processes

Publication Name: Materials Science Forum

Publication Date: 2007-01-01

Volume: 537-538

Issue: Unknown

Page Range: 571-578

Description:

Kinetic models of new types are suggested which are designated primarily to predict the progress of non-isothermal transformations occurring during rapid heating and cooling in alloys. A common feature of each model outlined is that it takes into account not only the varying temperature but also the rate of temperature change on the transformation rate of the process. The two models represented by differential equations are generated by using the concept of virtual kinetic parameters, which can be determined from non-isothermal experiments only. A key property of the virtual parameter "p" involved in the transformation rate equations is that it quantitatively characterizes the temperature rate dependence of the non-isothermal reaction.

Open Access: Yes

DOI: 10.4028/0-87849-426-x.571

Reconstruction decision model for trasportation infrastructure systems

Publication Name: Isciii 07 3rd International Symposium on Computational Intelligence and Intelligent Informatics Proceedings

Publication Date: 2007-01-01

Volume: Unknown

Issue: Unknown

Page Range: 163-166

Description:

Improving transportation infrastructure raises several questions requiring complex analysis. Creating the mathematic model for transportation reconstruction needed developing a quick, dynamic programming process which considers the costs of single reconstruction phases and the direct or indirect profit emerging after completing reconstruction works. In the study we examined the application possibilities of the highly prestigious Bellman-theorem. We found that the combinatorial method for optimal distribution of investments is not very efficient in the current issue, although it applies the sequential method and the Bellman-theorem in a remarkable way. The method proposed in the study applies exponential partial profit-functions. The primary advantage is that it solves the problem of the complicated nonlinear dynamic programming on the basis of direct relations, without numeric analysis. Consequently, results are supplied quickly and the method allows solving enormous problems without any constraints. © 2007 IEEE.

Open Access: Yes

DOI: 10.1109/ISCIII.2007.367382

Component based hardware-software system for fuzzy controlling of automated vehicles

No authors available

Publication Name: Proceedings of SEFI and IGIP Joint Annual Conference 2007: Joining Forces in Engineering Educations Towards Excellence

Publication Date: 2007-01-01

Volume:

Issue:

Page Range: 397-398

Description:

Open Access: No

DOI: DOI not available

Resource allocation and its distributed implementation

Publication Name: Innovations and Advanced Techniques in Computer and Information Sciences and Engineering

Publication Date: 2007-01-01

Volume: Unknown

Issue: Unknown

Page Range: 511-518

Description:

During the execution of a project (investment, innovation etc.), three important parameters must be kept in mind: we have to execute the project as soon as possible, with minimal total cost and not to exceed resource (manpower, materials, engines etc.) availabilities. Why does it important to execute the project as soon as possible with minimal total cost? If more than one company compete for the execution of an investment project, usually the chance of winning the tender will be higher if a company can execute the project with minimal total project time (TPT) and minimal total project cost. This problem could already be handled in the 60s and 70s with network planning (CPM, MPM, PERT etc.), scheduling (Gantt Diagrams, LOB etc.) and other related cost-minimizing (CPM/COST, MPM/COST etc.) techniques. The most difficult problem was to handle the resources. During the execution of a project we must keep in view the resources, because these resources are usually straitened. There are well-defined number of labours, engines and so on. If we would like to execute the project with minimal TPT and minimal total project cost and optimal use of the resources (manpower, materials, engines etc.) the problem becomes easily so hard to solve (already at 5000-10000 activities) that computers available today cannot find the solution within a reasonable time. The real problem is more complicated, because before the execution of the project we can only estimate the duration time, (variable) cost and resource need of activities. In real life it is common that the duration time of project activities cannot be estimated correctly. In this paper a novel algorithm is introduced by which an optimal resource allocation with minimal total cost for any arbitrary project could be determined. Moreover, this algorithm also handles the competences of the human resources. A distributed problem solving environment is also introduced that implements the above mentioned optimal resource allocation algorithm with a parallel branch and bound method. The system is built on the Jini technology [44]. It is a dynamic, service-oriented infrastructure that utilizes spare cycles of networked workstations in an efficient way and solves computation intensive problems more easily due to the parallelization. © 2007 Springer.

Open Access: Yes

DOI: 10.1007/978-1-4020-6268-1_90

Prediction of fullerene stability using topological descriptors

Publication Name: Materials Science Forum

Publication Date: 2007-01-01

Volume: 537-538

Issue: Unknown

Page Range: 439-448

Description:

In recent years, several attempts have been made to characterize the geometric structure of fullerenes by means of topological shape factors in order to predict their physical properties and stability. In this paper, we present a simple method to estimate the stability of fullerenes on the basis of quantitative topological criteria. This approach is based on the concept of the generalized combinatorial curvatures defined on the set of simple graphs embedded on a closed surface without boundary (sphere, torus, projective plane, Klein bottle). It is shown that starting with the computed generalized combinatorial curvatures several novel topological indices can be generated. From computations performed on a set of C40 and C60 fullerenes, we concluded that the four topological shape factors tested (Λ(-1), Ω(-1), Λ(1) and Ω(1)) could be successfully used to preselect the most stable fullerene isomers.

Open Access: Yes

DOI: 10.4028/0-87849-426-x.439

Investigation of the spatial distribution algorithm of the traffic flow analysis and of the entity flow-phase analysis

No authors available

Publication Name: ESM 2007 - 2007 European Simulation and Modelling Conference: Modelling and Simulation 2007

Publication Date: 2007-01-01

Volume:

Issue:

Page Range: 291-295

Description:

This paper investigates an important algorithm that is used in both the Traffic-Flow Analysis and the Entity Flow-phase Analysis. These methods are similar to each other and can be used for the fast and approximate (performance) analysis of Information and Communication Technology (ICT) systems and Business Process (BP) systems. Both methods contain an algorithm for the spatial distribution of the traffic (or entities) in the system. It is shown how the error of the spatial distribution can be measured, and the effect of the so called size of routing unit parameter of two algorithms is investigated.

Open Access: No

DOI: DOI not available