Search
Filters
total: 3190
-
Catalog
- Publications 2494 available results
- Journals 27 available results
- Conferences 11 available results
- Publishing Houses 1 available results
- People 117 available results
- Inventions 1 available results
- Projects 3 available results
- Laboratories 1 available results
- Research Equipment 1 available results
- e-Learning Courses 83 available results
- Events 55 available results
- Open Research Data 396 available results
displaying 1000 best results Help
Search results for: TEAM COMPLEXITY.
-
Team Roles and Team Performance in Small Virtual Software Teams
PublicationThe article presents the results of research on the composition of team roles conducted in 24 student software teams. An adaptation of M. Belbin’s model by B. Kożusznik was used. The model of team balance according to Belbin and Haaf is presented and correlations between team balance and team performance are analysed. Team performance is measured at three levels: result, satisfaction and team climate. The selected constellation...
-
Complicity-An International Journal of Complexity and Education
Journals -
Entropic Measures of Complexity of Short-Term Dynamics of Nocturnal Heartbeats in an Aging Population
PublicationTwo entropy-based approaches are investigated to study patterns describing differences in time intervals between consecutive heartbeats. The first method explores matrices arising from networks of transitions constructed following events represented by a time series. The second method considers distributions of ordinal patterns of length three, whereby patterns with repeated values are counted as different patterns. Both methods provide...
-
COMPLEXITY
Journals -
Team dynamics in emergency surgery teams: results from a first international survey
Publication -
Team Performance Management
Journals -
The beauty of architectural complexity
Publication -
COMPUTATIONAL COMPLEXITY
Journals -
Ecological Complexity
Journals -
JOURNAL OF COMPLEXITY
Journals -
On the complexity of distributed greedy coloring
PublicationW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
The clinical complexity of patients with acromegaly
Publication -
The complexity of list ranking of trees
PublicationUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
Complexity of resilient network optimisation
Publication -
On the complexity of resilient network design
Publication -
The complexity of node blocking for dags
PublicationRozważamy następującą grę (pomiędzy dwoma graczami) kombinatoryczną o nazwie ''node blocking''. Dany jest graf skierowany. Każdy wierzchołek może być zajęty przez co najwyżej jeden token. Wyróżniamy dwa kolory tokenów, biały i czarny, każdy gracz może przemieszczać tylko własne tokeny. Gracze wykonują ruchy naprzemiennie. Ruch polega na wyborze dowolnego tokena własnego koloru i przesunięciu go na dowolnego niezajętego przez inny...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Management of complexity and information flow
PublicationProblemy złożoności i zarządzania przepływem informacji. W rozdziale omówio-no podejście do modelowania systemów złożonych oraz zarządzania przepływeminformacji w takich systemach. Rozwiązania odniesiono do płaszczyzny elasty-cznego wytwarzania. Poruszono aspekty miękkiego modelowania w takich środo-wiskach.
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
Complexity of a classical flow restoration problem
Publication -
The Complexity of Zero-Visibility Cops and Robber
PublicationIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
The complexity of zero-visibility cops and robber
PublicationWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
Groups Complexity Cryptology
Journals -
EMERGENCE-Complexity & Organization
Journals -
Strength Fracture and Complexity
Journals -
Discontinuity, Nonlinearity, and Complexity
Journals -
Journal of Physics-Complexity
Journals -
Economic Complexity and Evolution
Journals -
Clinical complexity – where to find it and how to use it
Publication -
Complexity of weak acceptonic conditions in tree automata
PublicationRozważano złożoność problemu pustości dla automatów na drzewach ze słabymi warunkami akceptowalności. Rozważano także translacje pomiędzy słabymi i silnymi warunkami akceptowalności.
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Structural Heart-The Journal of the Heart Team
Journals -
A-Team Middleware on a Cluster
Publication -
The Snow Team Problem
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
The laws of thermodynamics: entropy, free energy, information and complexity
PublicationW rozdziale przedstawiono podstawowe Zasady Termodynamiki. Omówiono zagadnienia związane z pojęciem entropii, energii Gibbsa, egzergii oraz systemami złożonymi.
-
On the complexity of distributed graph coloring with local minimality constraints
PublicationArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
-
Smart systems integration: toward overcoming the problem of complexity
PublicationW pracy omówiono modelowa propozycję integracji systemu opartą na zastosowaniu sztucznej inteligencji w celu rozwiązania problemu złożoności systemowej.
-
The complexity of the T-coloring problem for graphs with small degree
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
Scheduling jobs to contain a natural disaster: a model and complexity
Publicationthis paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...
-
ANALYSIS OF EFFECTIVENESS AND COMPUTATIONAL COMPLEXITY OF TREND REMOVAL METHODS
PublicationThe paper presents a method of processing measurement data due to remove slowly varying component of the trend occurring in the recorded waveforms. Comparison of computational complexity and trend removal efficiency between some commonly used methods is presented. The impact of these procedures on probability distribution and power spectral density is shown. Effectiveness and computational complexity of these methods depend essentially...
-
Review of the Complexity of Managing Big Data of the Internet of Things
PublicationTere is a growing awareness that the complexity of managing Big Data is one of the main challenges in the developing feld of the Internet of Tings (IoT). Complexity arises from several aspects of the Big Data life cycle, such as gathering data, storing them onto cloud servers, cleaning and integrating the data, a process involving the last advances in ontologies, such as Extensible Markup Language (XML) and Resource Description...
-
The complexity of the T-coloring problem for graphs with small degree.
PublicationW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Web Accessible A-Team Middleware
Publication -
To Work or Not to Work… in a Multicultural Team?
PublicationThe main goal of the article is to present research findings regarding student’s attitude to working in a multicultural team (MCT). Research participants of different cultural background completed the research survey. Their willingness to work in MCT was measured together with factors that influence it. These include factors related to both team members and the task structure. Research findings indicate that the respondents preferred...
-
Complex Systems and Complexity Science
Journals -
Journal of Systems Science & Complexity
Journals -
Farrow structure for complex digital Hilbert filter of low complexity
PublicationW pracy przeanalizowano złożoność numeryczną filtru Hilberta (filtr zespolony), złożonego z pary filtrów cyfrowych o zmiennym opóźnieniu ułamkowym, o strukturze Farrowa. Struktura ta pozwala na zmianę opóźnienia ułamkowego na bieżąco, bez potrzeby każdorazowego przeprojektowywania filtru. Zaproponowano algorytmy/struktury wykorzystujące nie tylko symetrię oryginalnej struktury Farrowa, ale również wspólne elementy opóźniające podfiltrów...
-
Biopsychosocial complexity measured by health care needs in controlled acromegaly
Publication -
Assessing Grounding Frequency using Ship Traffic and Waterway Complexity
Publication -
A low complexity double-talk detector based on the signal envelope
PublicationA new algorithm for double-talk detection, intended for use in the acoustic echo canceller for voice communication applications, is proposed. The communication system developed by the authors required the use of a double-talk detection algorithm with low complexity and good accuracy. The authors propose an approach to doubletalk detection based on the signal envelopes. For each of three signals: the far-end speech, the microphone...
-
The final answer to the complexity of a basic problem in resilient network design
Publication -
Quantum communication complexity advantage implies violation of a Bell inequality
PublicationWe obtain a general connection between a quantum advantage in communication complexity and non-locality. We show that given any protocol offering a (sufficiently large) quantum advantage in communication complexity, there exists a way of obtaining measurement statistics which violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily...
-
Teaching Architecture – contemporary challenges and threats in the complexity of built environment
PublicationThe complexity of the modern built environment is a problem n ot only of architectural and urban issues. This issue extends to many othe r disciplines as well as covering a wide range of social engagements. The idea of writing this pa per is generally initiated by the debate which took place in Gdańs k on 22.01.2016, and was prepar ed in order to meet representatives of the four circles of interest...
-
Reduction of Computational Complexity in Simulations of the Flow Process in Transmission Pipelines
PublicationThe paper addresses the problem of computational efficiency of the pipe-flow model used in leak detection and identification systems. Analysis of the model brings attention to its specific structure, where all matrices are sparse. With certain rearrangements, the model can be reduced to a set of equations with tridiagonal matrices. Such equations can be solved using the Thomas algorithm. This method provides almost the same values...
-
Pre-arrangement of solvability, complexity, stability and quality of GPC systems
PublicationPraca dotyczy podstawowych problemów strojenia algorytmów dyskretnoczasowego uogólnienia sterowania predykcyjnego (GPC). Optymalne sterowanie predykcyjne, w sensie pewnego kwadratowego funkcjonału kosztów, wyznacza się rozwiązując odpowiednie liniowe zadanie. W pracy podano warunki, przy których macierz tego zadania jest macierzą o pełnym kolumnowym rzędzie - co gwarantuje istnienie optymalnego sterownika. W następnej kolejności...
-
Examination of the effect of altering model complexity on representing groundwater flow
PublicationW artykule przedstawiono wyniki badań na dokładnością modeli numerycznych przepływu wód podziemnych. Analizowano wpływ upraszczania struktury przestrzennej modelu na wyniki obliczeń.
-
Quantum Beam Science
Journals -
Electron-beam irradiation in TEM of hard-segment homopolymers and polyurethanes with different hard-segment content.
PublicationZbadano odporność na niszczenie radiacyjne w transmisyjnym mikroskopie elektronowym homopolimeru segmentów sztywnych i poliuretanów z różną zawartością segmentów sztywnych. Dokonano rejestracji morfologii tych polimerów w TEM w trakcie obserwacji w jasnym polu oraz selektywnej dyfrakcji elektronowej. Analizowano tkże te polimery w mikroskopie polaryzacyjnym przed i po obserwacjach w TEM. Potwierdzono doniesienia literatutowe o...
-
NGOization: Complicity, Contradictions and Prospects
Publication -
Mapping the complexity of dementia: factors influencing cognitive function at the onset of dementia
Publication -
Implementation complexity analysis of the turbo decoding algorithms on digital signal processor
Publication -
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Influence of the Working Strategy on A-Team Performance
Publication -
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
Towards increasing F-measure of approximate string matching in O(1) complexity
PublicationThe paper analyzes existing approaches for approximate string matching based on linear search with Levenshtein distance, AllScan and CPMerge algorithms using cosine, Jaccard and Dice distance measures. The methods are presented and compared to our approach that improves indexing time using Locally Sensitive Hashing. Advantages and drawbacks of the methods are identified based on theoretical considerations as well as empirical evaluations...
-
COMPLEXITY OF INNOVATIVE FINANCIAL PRODUCTS: THE CASE OF SYNTHETIC EXCHANGE TRADED FUNDS IN EUROPE
PublicationThe aim of the text is the presentation of the most important categories of exchange traded funds (ETFs) – physical and synthetic ones. A theoretical part of the text includes an overview of the main features of ETFs, the presentation of differences between physical and synthetic funds and the main risks posed by both types to their users and the whole financial systems. An empirical part focuses on the European market. Time span...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
e-JABAT – An Implementation of the Web-Based A-Team
Publication -
A Cross-Team Collaborative Evaluation of a CRM System
PublicationThis paper presents an analysis of an usability evaluation a CRM (Customer Relationship Management) performed by a team composed of external usability experts jointly with a CRM staff. The evaluation process differed from a classical scheme known from former projects, including some new elements resulting from a specific context of this study. These novel elements resulted in reshaping the role of the CRM system and considering...
-
Fuzzy Methods and Models for a Team-Building Process
PublicationThis chapter contains an introduction to fuzzy-logic model-based approaches for a team-building process. Such appraches allow extending typical recruiting practice and selection processes to enable a wider and more precise assessment of a new team and/or existing team members, taking into account both their hard and soft skills. Moreover, as effectiveness of teams depends on the interpersonal skills and emotional intelligence...
-
Geam-Geoingegneria Ambientale e Mineraria-Geam-Geoengineering Environment and Mining
Journals -
Annals of Long-Term Care
Journals -
Journal of Long-Term Care
Journals -
Journal of Tea Science
Journals -
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublicationW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
Complexity analysis of the Pawlak’s flowgraph extension for re-identification in multi-camera surveillance system
PublicationThe idea of Pawlak’s flowgraph turned out to be a useful and convenient container for a knowledge of objects’ behaviour and movements within the area observed with a multi-camera surveillance system. Utilization of the flowgraph for modelling behaviour admittedly requires certain extensions and enhancements, but it allows for combining many rules into a one data structure and for obtaining parameters describing how objects tend...
-
Two-Rate Based Low-Complexity Variable Fractional-Delay FIR Filter Structures
PublicationThis paper considers two-rate based structures for variable fractional-delay (VFD) finite-length impulse response (FIR) filters. They are single-rate structures but derived through a two-rate approach. The basic structure considered hitherto utilizes a regular half-band (HB) linear-phase filter and the Farrow structure with linear-phase subfilters. Especially for wide-band specifications, this structure is computationally efficient...
-
Reshaping the Gdańsk Shipyard—The Birthplace of the Solidarity Movement. The Complexity of Adaptive Reuse in the Heritage Context
PublicationThe Gdańsk Shipyard—the birthplace of the Solidarity movement—is host to a unique example of a multi-layered brownfield redevelopment project, an area that is burdened by a complex history, overlapping heritage, and multiple memories. These circumstances require an integrated yet differentiated approach to the site’s heritage and make the creation of one homogeneous narration of its future impossible. At the same time, the size...
-
Wydziałowy Team Biegowy ZiE
EventsW niedzielę, 23.10.2016 r. w trakcie VIII edycji Gdańsk Biega, pracownicy WZiE wystartowali pod wspólnym szyldem Wydziałowy Team Biegowy ZiE. Klub zrzesza 5 aktualnych maratończyków. Imprezie patronuje dziekan WZiE.
-
Chest Injuries Based on Medical Rescue Team Data
Publication -
Acute coronary syndromes in the practice of the emergency medical team
Publication -
Project Team Management Supported by an Agent-Based Model
PublicationThis work is a continuation of a series of works about research into the use of multi-agent systems to support IT project management. Previous studies have shown the possibility of using a multi-agent in order to optimize management decisions concerning the selection of methods for project implementation. It was noted that the project manager's decisions are influenced by three fundamental parameters: the entropy of the project,...
-
On the Agile Mindset of an Effective Team – An Industrial Opinion Survey
PublicationIn this paper we present the results of an opinion survey among 52 agile practitioners who evaluated the importance of 26 selected elements of the agile mindset to the effectiveness of an agile team. In total, we have identified 70 unique agile mindset elements based on 11 literature sources and 5 interviews with industry experts. 7 elements belonged to the “support for business goals” category, 20 to the “relationships within...
-
Complixity results on open shop scheduling to minimize total cost of operations
PublicationW pracy zaprezentowano serię rezultatów dotyczących złożoności obliczeniowejproblemu szeregowania w systemie otwartym z kryterium łącznego kosztu opera-cji. W ogólności problem jest NP-trudny nawet w przypadku 1-procesorowym.Dlatego zaprezentowano możliwie wiele przypadków szczególnych, które są wie-lomianowe. Są one funkcją długości operacji i struktury grafu konfliktów po-między zadaniami.
-
Computational complexity and length of recorded data for fluctuation enhanced sensing method in resistive gas sensors
PublicationThis paper considers complexity and accuracy of data processing for gas detection using resistance fluctuation data observed in resistance gas sensors. A few selected methods were considered (Principal Component Analysis – PCA, Support Vector Machine – SVM). Functions like power spectral density or histogram were used to create input data vector for these algorithms from the observed resistance fluctuations. The presented considerations...
-
Computational Complexity and Its Influence on Predictive Capabilities of Machine Learning Models for Concrete Mix Design
PublicationThe design of concrete mixtures is crucial in concrete technology, aiming to produce concrete that meets specific quality and performance criteria. Modern standards require not only strength but also eco-friendliness and production efficiency. Based on the Three Equation Method, conventional mix design methods involve analytical and laboratory procedures but are insufficient for contemporary concrete technology, leading to overengineering...
-
Assessing business process complexity based on textual data: Evidence from ITIL IT ticket processing
PublicationPurpose This study aims to draw the attention of business process management (BPM) research and practice to the textual data generated in the processes and the potential of meaningful insights extraction. The authors apply standard natural language processing (NLP) approaches to gain valuable knowledge in the form of business process (BP) complexity concept suggested in the study. It is built on the objective, subjective and meta-knowledge...
-
An A-Team Approach to Learning Classifiers from Distributed Data Sources
Publication -
An A-Team approach to learning classifiers from distributed data sources
Publication -
JADE-Based A-Team as a Tool for Implementing Population-Based Algorithms
Publication -
GROUP COMPOSER - System for Modeling Agents’ Team Building for Tasks
PublicationMulti-agent systems consist of many autonomous units, called agents, that can interact when trying to achieve their goals. The selection of interaction partners is called team formation. Three basic approaches can be considered to match multi-agent system resources to the problem at hand. To research the properties of different approaches, a software for modeling team formation in multi-agent systems has been created and is presented...
-
The Structure of Entrepreneurial Team Members’ Competencies: Between Effectuation and Causation
PublicationA conscious shaping of entrepreneurial competence is a relevant element of entrepreneurial education. In order to recognize which of the competencies regarded as entrepreneurial are characteristic of members of entrepreneurial teams, which is crucial for the work of those teams, it is necessary to identify the structure of those competencies. This quantitative study was conducted with the use of a survey method and involved 111...
-
Teams tools. Leading high-performance teams with different types of intelligence
PublicationThe subject of this paper is the analysis of necessary tools for global teams, image of the team leader, styles of leadership in global teams. The analysis is based on selected examples from high-performance teams with visible results. The purpose of the work is to answer for the following questions: What are the characteristics of the leading global teams? Which style of leadership use the global teams? Is a female leader different...
-
Remarks on steam condensation modeling related to steam turbine large output
PublicationIn the paper numerical simulations have been performed to predict the performance of the diferent steam models. All of the considered models of steam condensation have been validated on the base of benchmark experiment employing expansion in nozzle and next on the low pressure part of the steam turbine equipped with the so-called Baumann stage. For numerical analysis three models have been finally used - the ideal steam model without...