Wyniki wyszukiwania - BazTech

1

The Lean manager as a mentor in the process of problem-solving in the A3 Thinking approach

Burka Iwona

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2021

|

z. 153

21--44

EN

Purpose: The purpose of this study is to gather information on how Polish managers operating in a Lean environment, using mentoring, develop competences related to the application of the A3 Thinking approach among their employees, and how they themselves acquired the competences of mentors, what makes it difficult for them to work with their mentees and what benefits of mentoring they perceive. Design/methodology/approach: To answer the research questions raised, the author conducted a literature review and a qualitative research – multiple-case studies. As part of the qualitative study, five in-depth interviews were conducted. Findings: The main contribution of this study is to provide information on mentoring in the problem-solving process in the A3 Thinking approach and the experiences of mentor-managers. However, they can be used as input data for the design of training and mentoring programmes in the process of learning the A3 Thinking approach. Research limitations/implications: Subjectivity of the analysis, owing to the application of a qualitative approach in the studies. Future research may be connected with creating a mentoring programme in the studied area. Practical implications: The study results can be used as input data for the design of training programs and mentoring programs in the studied area. They can also act as a guidepost and motivation for Lean managers. Originality/value: The literature review shows a small number of scientific publications that contain an approach to mentoring in the problem-solving process in the spirit of A3 Thinking. This publication may provide input data for managers wishing to improve the effectiveness of the problem-solving process.

2

Zastosowanie wybranych metod twórczego myślenia w rozwiązywaniu problemów z zakresu inżynierii produkcji

Baron-Puda Maria, Kolny Damian

Zarządzanie Przedsiębiorstwem

|

2020

|

Vol. 23, nr 2

2--10

EN

Employees’ knowledge, skills and capabilities, as well as the possibility to use them in problem solving, are fundamental for company’s competitiveness. Quality of created solutions depends on human attributes related to creativity and innovation. Solutions based on creative thinking can be an important source of increasing a company’s efficiency. The aim of this article is to present the importance and need of using and developing the creativity and creative attitudes for continuous improvement. Creative thinking can be stimulated through many different dedicated methods. Their essential goal is to create the best environment for generating ideas, solutions and innovations within the specified problem. The article presents a review and suggested application of selected methods of creative thinking for solving various problems in the field of production engineering.

3

Applying Modern SAT-solvers to Solving Hard Problems

Niewiadomski Artur, Switalski Piotr, Sidoruk Teofil, Penczek Wojciech

Fundamenta Informaticae

|

2019

|

Vol. 165, nr 3-4

321--344

EN

We present nine SAT-solvers and compare their efficiency for several decision and combinatorial problems: three classical NP-complete problems of the graph theory, bounded Post correspondence problem (BPCP), extended string correction problem (ESCP), two popular chess problems, PSPACE-complete verification of UML systems, and the Towers of Hanoi (ToH) of exponential solutions. In addition to several known reductions to SAT for the problems of graph k-colouring, vertex k-cover, Hamiltonian path, and verification of UML systems, we also define new original reductions for the N-queens problem, the knight’s tour problem, and ToH, SCP, and BPCP. Our extensive experimental results allow for drawing quite interesting conclusions on efficiency and applicability of SAT-solvers to different problems: they behave quite efficiently for NP-complete and harder problems but they are by far inferior to tailored algorithms for specific problems of lower complexity.

4

Kształtowanie struktury działań w procesie rozwiązywania problemów

Zoleński W.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2018

|

z. 121

629--641

EN

In tasks with limited predictability, an important issue is the flexible shaping of the structure of activities. In particular, you should take into account the difficulty in achieving the goal and the appearance of valuable unintentional results. The article presents a general way of structuring of activities in the problem solving process, in particular characterization of the problem situation, conceptualization of activities and evaluation of results.

PL

W zadaniach charakteryzujących się ograniczoną przewidywal-nością ważnym zagadnieniem jest bieżące, elastyczne kształtowanie struktury działań. W szczególności należy uwzględniać trudności w osiągnięciu części wyznaczonych celów oraz pojawianie się wartościowych wyników niezamie-rzonych. W artykule przedstawiono ogólny sposób kształtowania struktury działań występujących w procesie rozwiązywania problemów, uwzględniając zwłaszcza charakterystykę sytuacji problemowej, konceptualizację działań oraz ocenę uzyskiwanych wyników.

5

TRIZ: Theory of Solving Inventive Problems to support engineering innovation in maritime industry

Souchkov V.

Zeszyty Naukowe Akademii Morskiej w Szczecinie

|

2018

|

nr 55 (127)

9--19

EN

The key ingredient, which provides the strongest impact on success of an innovation process, is the stage of generating new inventive solution ideas, which requires creativity and out-of-the-box thinking. Until the beginning of the 2000th, and even still very much today, creative engineering has been random and chaotic as it was not supported by scientifically based methods. As a result, the process has low effectiveness of dealing with situations demanding new inventive solutions. Introduction of TRIZ (Theory of Solving Inventive Problems) has radically changed the situation in many industries. TRIZ provides a structured support to organize engineering creativity based on many years of studies of innovative development of diverse technical systems and technologies. These studies helped to extract and formulate generic patterns of inventive solutions, which can be reused to produce new ideas in a much shorter time period rather than using traditional methods to enhance creative thinking. Although TRIZ has been successfully used in a number of industries, its use in maritime industry has been rather limited, most likely due to the low awareness by maritime engineers. This paper discusses modern TRIZ and presents some of its techniques that can be utilized in maritime engineering.

6

Rozwój symulacji jako narzędzia w logistyce miejskiej za pomocą sztucznej inteligencji na przykładzie gry Cities: Skylines

Pajka A., Gera G.

Journal of TransLogistics

|

2018

|

Vol. 4, nr 1

101--108

PL

Artykuł prezentuje możliwość zastosowania sztucznej inteligencji w symulacjach jako nowego rozwiązania w celu poprawienia przepływu dóbr i osób w mieście. Pokazuje też zależność i kooperacyjność rozwoju sztucznej inteligencji z grami komputerowymi jako możliwy fundament rozwoju jej algorytmów. Omówiono także elementy gry Cities: Skylines odzwierciedlające rzeczywistość, które mogłyby pomóc w rozwoju sztucznej inteligencji. Dodatkowo omówiono temat użycia gry jako narzędzia badawczego podnoszącego świadomość problemów logistyki miejskiej wśród zwykłych uczestników ruchu codziennego w miastach zarówno tych poruszających się pieszo jak i środkami transportu publicznego bądź prywatnego.

EN

The article presents the possibility of using artificial intelligence in simulations as a new solution to improve the flow of goods and people in the city. It also shows the dependence and interaction of the development of artificial intelligence with computer games in order to develop its algorithms. The parts of the Cities: Skylines game reflecting reality these could help in the development of artificial intelligence was presented. Additionally, the topic of using game as a research instrument which improves awareness of urban logistics’ problem for common people using public or private transport was also presented.

7

Implementation of a system quality tool to reduce the costs of scrap loss in industrial enterprise

Lestyánszka-Škůrková K.

Zeszyty Naukowe. Quality. Production. Improvement

|

2017

|

No. 1 (6)

93--111

EN

This study focuses on reducing the costs of scrap loss in industrial enterprise through the quick response control methodology, used in quality management in the automotive industry. Its use can identify various influences causing problems is production, quality, logistics or management. The costs reducing in this study used tools and methods as QRQC, Global 8D, 5 Why, Is/Is Not as well as seven old statistical (japanese) tools, especially Pareto analysis. Using the QRQC methods there were found causes connected with scrap costs and were setted the corrective action to reduce the scrap costs.

8

Modelowanie zależności przyczynowo-skutkowych w opisie sytuacji problemowej

Zoleński W.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2017

|

z. 101

585--596

PL

Identyfikacja i analiza zależności przyczynowo-skutkowych jest ważną częścią opisu sytuacji problemowej. Podstawowymi trudnościami występującymi w modelowaniu takich zależności są liczność i złożoność zjawisk, jakie należy uwzględnić oraz ograniczona przewidywalność zamierzonych wyników. W artykule przedstawiono ogólny model struktury zależności przyczynowo-skutkowych oraz sposoby dekompozycji i upraszczania złożoności w celu utworzenia modeli formalnych, mających zastosowanie w komputerowych symulacjach badawczych.

EN

Identifying and analyzing cause-and-effect relationships is an important part of the problem description. The basic difficulties involved in modeling such dependencies are the multiplicity and complexity of the phenomena to be taken into account and the limited predictability of the intended results. The article presents the general model of causal relationship structure and the ways of decomposition and simplification of complexity in order to create formal models applied in computer simulation tests.

9

Usprawnianie podejmowania decyzji w budownictwie dzięki zróżnicowaniu sposobów wykorzystywania porównywania parami

Dytczak M., Ginda G., Jastrząbek B.

Materiały Budowlane

|

2016

|

nr 6

94--96

PL

Złożoność uwarunkowań otoczenia powoduje, że rozwiązywane zagadnienia decyzyjne w budownictwie wymagają uwzględniania informacji o niedoskonałym charakterze. W tym celu wykorzystywane są różne narzędzia. Jednym z nich są porównania parami (PP), które stały się podstawą wielu metod wspomagania decyzji. Są one również używane wspólnie z innymi narzędziami oraz ułatwiają ich implementację. Takie sposoby stosowania wzbogacają inne narzędzia, a także poszerzają potencjał aplikacyjny porównań parami (PP). W artykule omówiono zaawansowane sposoby stosowania PP, które okazują się użyteczne w przypadku podejmowania decyzji w budownictwie i dziedzinach pokrewnych.

EN

The complexity of surrounding environment results in a need for utilizing imperfect information while solving decision making problems in civil engineering. Diverse pair-wise comparison-based tools are often applied to make use of imperfect information. They are applied both in a standalone mode as well as together with other tools. Their common application with other tools provides necessary means for mutual enhancement in application potential of them and the other tools they are used together with. The utilization modes which prove to be useful in solving decision making problemin civil engineering and related fields are therefore presented in the paper.

10

Redukcja złożoności modelu zagadnienia decyzyjnego

Dytczak M., Ginda G., Jastrząbek B.

Materiały Budowlane

|

2016

|

nr 6

92--93

PL

Modele matematyczne opisujące problemy decyzyjne uwzględniają zazwyczaj złożoną sytuację decyzyjną danego problemu, opisują strukturę modelowanego systemu i zachodzących procesów przez wskazanie powiązań jego elementów (strukturę sieci powiązań) i ich charakterystyki. Dodatkowo, ograniczenia czasowe i w dostępności zasobów niezbędnych do zastosowania opracowanego modelu utrudnią rozwiązanie zagadnień wobec zróżnicowanych uwarunkowań, np. przyrodniczych, ekonomicznych, społecznych. Wówczas warto pomyśleć o zmniejszeniu (redukcji) złożoności rozwiązywanych problemów i skoncentrować się na tym co istotne. Na szczęście dostępne są względnie proste narzędzia, za pomocą których można w adekwatny sposób upraszczać zbyt złożone modele zagadnień. Przykłady zaprezentowano w artykule.

EN

The application of adequate model is necessary to solve a decision making problem in a reliable manner. Such the model should therefore include all important components of a system a decision making problem under consideration deals with. However, limited availability of time and other necessary resources may make a prepared model too complex to be seamlessly applied. The same problem often appears the case of solving civil engineering decision making problems while including influence of factors of diverse nature. The skilful reduction of model complexity may nevertheless help in providing a simpler and adequate model. Some simple model reduction tools are therefore presented in the paper.

11

Twelve Years of QBF Evaluations : QSAT Is PSPACE-Hard and It Shows

Marin P., Pulina L., Giunchiglia E., Narizzano M., Tacchella A.

Fundamenta Informaticae

|

2016

|

Vol. 149, nr 1/2

133--158

EN

Twelve years have elapsed since the first Quantified Boolean Formulas (QBFs) evaluation was held as an event linked to SAT conferences. During this period, researchers have striven to propose new algorithms and tools to solve challenging formulas, with evaluations periodically trying to assess the current state of the art. In this paper, we present an experimental account of solvers and formulas with the aim to understand the progress in the QBF arena across these years. Unlike typical evaluations, the analysis is not confined to the snapshot of submitted solvers and formulas, but rather we consider several tools that were proposed over the last decade, and we run them on different formulas from previous QBF evaluations. The main contributions of our analysis, which are also the messages we would like to pass along to the research community, are: (i) many formulas that turned out to be difficult to solve in past evaluations, remain still challenging after twelve years, (ii) there is no single solver which can significantly outperform all the others, unless specific categories of formulas are considered, and (iii) effectiveness of preprocessing depends both on the coupled solver and the structure of the formula.

12

Shift Design with Answer Set Programming

Abseher M., Musliu N., Woltran S., Gebser M., Schaub T.

Fundamenta Informaticae

|

2016

|

Vol. 147, nr 1

1--25

EN

Answer Set Programming (ASP) is a powerful declarative programming paradigm that has been successfully applied to many different domains. Recently, ASP has also proved successful for hard optimization problems like course timetabling and travel allotment. In this paper, we approach another important task, namely, the shift design problem, aiming at an alignment of a minimum number of shifts in order to meet required numbers of employees (which typically vary for different time periods) in such a way that over- and understaffing is minimized. We provide an ASP encoding of the shift design problem, which, to the best of our knowledge, has not been addressed by ASP yet. Our experimental results demonstrate that ASP is capable of improving the best known solutions to some benchmark problems. Other instances remain challenging and make the shift design problem an interesting benchmark for ASP-based optimization methods.

13

On The Complexity of Counter Reachability Games

Reichert J.

Fundamenta Informaticae

|

2016

|

Vol. 143, nr 3/4

415--436

EN

Counter reachability games are played by two players on a graph with labelled edges. Each move consists of picking an edge from the current location and adding its label to a counter vector. The objective is to reach a given counter value in a given location. We distinguish three semantics for counter reachability games, according to what happens when a counter value would become negative: the edge is either disabled, or enabled but the counter value becomes zero, or enabled. We consider the problem of determining the winner in counter reachability games and show that, in most cases, it has the same complexity under all semantics. This constrasts with the one-player case, for which the decision problem is decidable without any elementary upper bound under the first semantics, whereas it is NP-complete under the third one. Surprisingly, under one semantics, the complexity in dimension one depends on whether the objective value is zero or any other integer.

14

Interrupt Timed Automata with Auxiliary Clocks and Parameters

Bérard B., Jovanović A., Haddad S., Lime D.

Fundamenta Informaticae

|

2016

|

Vol. 143, nr 3/4

235--259

EN

Interrupt Timed Automata (ITA) are an expressive timed model, introduced to take into account interruptions according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results related to reachability and model checking have been obtained. We add auxiliary clocks to ITA, thereby extending its expressive power while preserving decidability of reachability. Moreover, we define a parametrized version of ITA, with polynomials of parameters appearing in guards and updates. While parametric reasoning is particularly relevant for timed models, it very often leads to undecidability results. We prove that various reachability problems, including robust reachability, are decidable for this model, and we give complexity upper bounds for a fixed or variable number of clocks, levels and parameters.

15

Equivalence Relations Defined by Numbers of Occurrences of Factors

Saarela A.

Fundamenta Informaticae

|

2016

|

Vol. 145, nr 3

385--397

EN

We study the question of what can be said about a word based on the numbers of occurrences of certain factors in it. We do this by defining a family of equivalence relations that generalize the so called k-abelian equivalence. The characterizations and answers we obtain are linear algebraic. We also use these equivalence relations to help us in solving some problems related to repetitions and palindromes, and to point out that some previous results about Sturmian words and k-abelian equivalence hold in a more general form.

16

Combinatorial Geometry and Coding Theory

Raigorodskii A. M.

Fundamenta Informaticae

|

2016

|

Vol. 145, nr 3

359--369

EN

In this paper, we overview three closely related problems: Nelson-Hadwiger problem on coloring spaces with forbidden monochromatics distances; Borsuk's problem on partitioning sets in spaces into parts of smaller diameter; problem of finding codes with forbidden Hamming distances.

17

Branching-Time Model Checking Gap-Order Constraint Systems

Mayr R., Totzke P.

Fundamenta Informaticae

|

2016

|

Vol. 143, nr 3/4

339--353

EN

We consider the model checking problem for Gap-order Constraint Systems (GCS) w.r.t. the branching-time temporal logic CTL, and in particular its fragments EG and EF. GCS are nondeterministic infinitely branching processes described by evolutions of integer-valued variables, subject to Presburger constraints of the form x−y ≥ k, where x and y are variables or constants and k ∈ N is a non-negative constant. We show that EG model checking is undecidable for GCS, while EF is decidable. In particular, this implies the decidability of strong and weak bisimulation equivalence between GCS and finite-state systems.

18

Adding Data Registers to Parameterized Networks with Broadcast

Delzanno G., Sangnier A., Traverso R.

Fundamenta Informaticae

|

2016

|

Vol. 143, nr 3/4

287--316

EN

We study parameterized verification problems for networks of interacting register automata. The network is represented through a graph, and processes may exchange broadcast messages containing data with their neighbours. Upon reception a process can either ignore a sent value, test for equality with a value stored in a register, or simply store the value in a register. We consider safety properties expressed in terms of reachability, from arbitrarily large initial configurations, of a configuration exposing some given control states and patterns. We investigate, in this context, the impact on decidability and complexity of the number of local registers, the number of values carried by a single message, and dynamic reconfigurations of the underlying network.

19

A Function Elimination Method for Checking Satisfiability of Arithmetical Logics

Castiglioni V., Lanotte R., Tini S.

Fundamenta Informaticae

|

2016

|

Vol. 143, nr 1/2

51--71

EN

We study function elimination for Arithmetical Logics. We propose a method allowing substitution of functions occurring in a given formula with functions with less arity. We prove the correctness of the method and we use it to show the decidability of the satisfiability problem for two classes of formulas allowing linear and polynomial terms.

20

Determinanty sytuacji problemowych - przegląd i systematyzacja

Zoleński W.

Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska

|

2015

|

z. 83

775--784

PL

Ważnym zadaniem heurystyki jest systematyzacja pojęć związanych z rozwiązywaniem problemów. W artykule przedstawiono typologię sytuacji problemowych z uwzględnieniem problemów poznawczych, wykonawczych i przekazu wiedzy. Wyszczególnione zostały wybrane determinanty sytuacji problemowych, w tym uwarunkowania wewnętrzne i zewnętrzne oraz niektóre aspekty rozwiązywania problemu.

EN

Systematization of concepts related to problem solving is an important task of heuristics. The article presents a typology of problem situations in this cognitive problems, practical problems and problems of knowledge transfer. There are listed some of the determinants of problem situations that is internal and external conditions and some aspects of problem solving.