Filters
total: 9419
-
Catalog
- Publications 7490 available results
- Journals 43 available results
- Conferences 41 available results
- People 142 available results
- Inventions 20 available results
- Projects 1 available results
- Laboratories 3 available results
- Research Teams 5 available results
- Research Equipment 2 available results
- e-Learning Courses 315 available results
- Events 18 available results
- Open Research Data 1339 available results
displaying 1000 best results Help
Search results for: JOB SCHEDULING UNIFORM MACHINES MAKESPAN TOTAL COMPLETION TIME APPROXIMATION SCHEME NP-HARDNESS INCOMPATIBILITY GRAPH
-
Reliability of production machines in the bakery industry – theoretical and practical issues
PublicationThe aim of the article is to present probabilistic models, which were then used to analyze the reliability of production machines in the baking industry. The author conducted research in the period from January 2, 2016 to December 31, 2018 regarding the measurement of reliability of a traditional production system based on a probabilistic concept. Due to the limited scope of the article, reliability calculations for a set of thermo-oil...
-
A lower bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
A review on analytical models of brushless permanent magnet machines
PublicationThis study provides an in-depth investigation of the use of analytical and numerical methods in analyzing electrical machines. Although numerical models such as the finite-element method (FEM) can handle complex geometries and saturation effects, they have significant computational burdens, are time-consuming, and are inflexible when it comes to changing machine geometries or input values. Analytical models based on magnetic equivalent...
-
Michał Michna dr hab. inż.
PeopleMichal Michna received the M.Sc. and Ph.D. degrees in electrical engineering from the Gdansk University of Technology (GUT), Gdansk, Poland, in 1998 and 2005, respectively. Since 2004, he was employed at the Department of Power Electronics and Electrical Machines of the Gdańsk University of Technology (assistant, assistant professor, senior lecturer). In 2010-2015 he was a deputy of head of the Department of Power Electronics and...
-
The influence of IT-competency dimensions on job satisfaction, knowledge sharing and performance across industries
PublicationPurpose – Technology makes knowledge management easier. Knowledge sharing is essential for organizational development. Job satisfaction fosters knowledge sharing. Hence, this study aims to develop an understanding of the mutual relationship between knowledge sharing and job satisfaction when both are predicted by information technology (IT)-competency dimensions such as IT-operations, IT-knowledge and IT-infrastructure in the context...
-
An upper bound on the total outer-independent domination number of a tree
PublicationA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
Parallel implementation of background subtraction algorithms for real-time video processing on a supercomputer platform
PublicationResults of evaluation of the background subtraction algorithms implemented on a supercomputer platform in a parallel manner are presented in the paper. The aim of the work is to chose an algorithm, a number of threads and a task scheduling method, that together provide satisfactory accuracy and efficiency of a real-time processing of high resolution camera images, maintaining the cost of resources usage at a reasonable level. Two...
-
Comparison of selected algorithms for scheduling workflow applications with dynamically changing service availability
PublicationThis paper compares the quality and execution times of several algorithms for scheduling service based workflow applications with changeable service availability and parameters. A workflow is defined as an acyclic directed graph with nodes corresponding to tasks and edges to dependencies between tasks. For each task, one out of several available services needs to be chosen and scheduled to minimize the workflow execution time and...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
Interpolation properties of domination parameters of a graph
PublicationAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Photogrammetric and total station's measurement of compressed column's model
PublicationModelling studies continue to play an important role. One of such study is stress determination in the reinforcement bars of reinforced columns and determine column's axis deformation. The article presents measurements results of control points located on the model of reinforced concrete column. The column was compressed in few series till it's destruction. In this studies, photogrammetric method and total station measurements...
-
A fast high-resolution 3-D Finite Difference Time-Domain scheme with macromodels.
PublicationZaprezentowano szybki trójwymiarowy wysokorozdzielczy algorytm różnic skończonych w dziedzinie czasu. Zwiększona rozdzielczość osiągnięta została poprzez połączenie standardowego schematu FDTD z makromodelami silnie zagęszczonych objętości stworzonych przez zastosowanie redukcji rzędu modelu. Nowy schemat FDTD z makromodelami jest wyprowadzony. Koszt numeryczny nowej metody jest wyestymowany. Doskonałe wyniki zostały zaobserwowane...
-
Serial control of CNC machines
PublicationIn this paper a new method of the serial control of CNC machines is proposed. Actuators are controlled locally and the role of the central computer is limited to sending commands to the controller instead of sending it directly to actuators. It has been achieved with the use of the serial protocol with the use of the USB port. The taken approach leads to more reliable operation because commands are buffered and no synchronization...
-
Uniform Law Review
Journals -
On the Dynamics of an Enhanced Coaxial Inertial Exciter for Vibratory Machines
Publication -
Approximation of Message Inter-Arrival and Inter-Departure Time Distributions in IMS/NGN Architecture Using Phase-Type Distributions
PublicationCurrently it is assumed that requirements of the information society for delivering multimedia services will be satisfied by the Next Generation Network (NGN) architecture, which includes elements of the IP Multimedia Subsystem (IMS) solution. In order to guarantee Quality of Service (QoS), NGN has to be appropriately designed and dimensioned. Therefore, proper traffic models should be proposed and applied. This requires determination...
-
On trees with equal domination and total outer-independent domination numbers
PublicationFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Lubricant property and rolling contact fatigue test of oil-in-water emulsion type HFA-E and oil Total Azolla 46 as working liquids in hydraulic systems
PublicationW artykule scharakteryzowano i opisano wyniki badań własności smarnych wody destylowanej, emulsji wodno-olejowej typu HFA-E (1% oleju w wodzie) sporządzonej na bazie koncentratu Isosynth VX110BF, oleju Total Azolla 46 i samego koncentratu Isosynth VX110BF (tylko dla porównania z olejem, emulsją i wodą). W artykule pokazano wyniki badań pittingu z użyciem wody, emulsji i oleju jako środków smarnych. Ponadto w artykule przedstawiono...
-
Time
Journals -
Trust Dynamics Analysis of CTR Scheme Subversion under Virtual Anonymity and Trust-Unaware Partner Selection
PublicationWe propose a framework to study Markovian trust value dynamics in a centralized Computational Trust and Reputation (CTR) scheme under trust-unaware partner selection using a mean-value approximation. Analytically founded answers are sought to questions like: Can dishonest agents subvert the CTR scheme (i.e., acquire higher trust values than honest agents)? Is indirect reciprocity incentivized? Is there a qualitative impact of a...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Chromatic scheduling in a cyclic open shop
PublicationPraca jest poświęcona złożoności obliczeniowej problemu cyklicznego szeregowania w systemie otwartym. Autorzy analizując wykazują, że problem jest NP-trudny dla 3 procesorów i konstruują algorytm dokładny dla przypadku dwóch procesorów.Ponadto analizowany jest zwarty wariant cyklicznego systemu otwartego. W tym przypadku autorzy pokazują, że już szeregowanie na dwóch procesorach prowadzi do problemu NP-trudnego.
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublicationWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Constructing a map of an anonymous graph: applications of universal sequences
PublicationWe study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...
-
A note on an approximative scheme of finding almost homoclinic solutions for Newtonian systems
PublicationIn this work we will be concerned with the existence of an almost homoclinic solution for a perturbed Newtonian system in a finite dimensional space. It is assumed that a potential is C^1 smooth and its gradient is bounded with respect to a time variable. Moreover, a forcing term is continuous, bounded and squere integrable. We will show that the appproximative scheme due to J. Janczewska for a time periodic potential extends to...
-
Hardness measurements for assessment of cavitation intensity
PublicationArtykuł opisuje możliwość zastosowania pomiarów teardości erodowanego materiału do oceny natężenia zjawiska kawitacji. Proponowana metoda zakłada, że cała energia implodujących pęcherzyków kawitacyjnych zamieniana jest na przyrost twardości warstwy wierzchniej materiału
-
On the hardness of computing span of subcubic graphs
PublicationIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
Contextualizing a Knowledge Base by Approximation – A Case Study
PublicationModular knowledge bases give their users opportunity to store and access knowledge at different levels of generality. In this paper we present how to organize a modular knowledge bases organized into contexts in which a user can express their knowledge in much simplified way, yet without losing its precision. The work is centered around the notion of approximation - i.e. reducing the arity of predicates used. The presentation is...
-
Terminal charging scheduling of battery electric buses based on vehicle routing problem
PublicationElectric buses are considered to be a viable solution for reducing emission in dense urban areas. However, the greater charging time is a huge challenge for operators. In this paper, charging scheduling method was elaborated based on vehicle routing problem using mixed-integer linear programming model. The main novelty of the paper is the combination of modelling aspect, namely flexible turn sequence and heterogeneous shared charging...
-
Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Coronas and Domination Subdivision Number of a Graph
PublicationIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Proximal primal–dual best approximation algorithm with memory
PublicationWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
Study of data scheduling methods in the WiMAX Mobile metropolitan area networks
PublicationThe paper discusses basic assumptions of the WiMAX Mobile system. It also presents and analyses the results of simulation tests run for selected data scheduling methods and subcarrier allocation. Based on the test results, the authors have prepared a comparative analysis of two popular data scheduling methods, i.e. WRR and PF, and their own method CDFQ which uses information about the current channel situation for the queuing processes...
-
On the approximation of the UWB dipole elliptical arms with stepped-edge polygon
PublicationA simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....
-
The effect of job-related stress on psychological well-being = Wpływ stresu zawodowego na dobrostan psychiczny
PublicationThe aim of the investigation was to evaluate the effect of job stress factors on psychological well-being of firemen. Goldberg's GHQ-12 for well-being evaluation, the Perceived Job Stress Questionnaire by Dudek et al. for job stress assessment, and indicator of participation in traumatic events were used. 19% of the firemen were qualified to the group with increased risk of mental disorders. Occupational stress had a strong impact...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublicationWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
SCIENTIFIC PROBLEMS OF MACHINES OPERATION AND MAINTENANCE
Journals -
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublicationIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
TIME SERIES MODELING (PG_00063724)
e-Learning CoursesEffectively uses in-depth knowledge of economic time series analysis methods, applying the results of analyzes to formulate forecasts. Subject contents: 1. Classical time series analysis (trend, cyclical fluctuations) 2. Exponential smoothing models 3. Holt and Winters model 4. Stochastic processes and time series 5. Characteristics of stochastic processes 6. Process spectrum autocorrelation functions 7. Study of the stationarity...
-
The convex domination subdivision number of a graph
PublicationLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
A New Quaternion Encryption Scheme for Image Transmission
PublicationQuaternions are hypercomplex number of rank 4. They are often applied to mechanics in three-dimensional space and considered as one of the best ways to represent rotations. In this paper a new encryption scheme, based on the rotation of data vector in three-dimensional space around another quaternion (key) is proposed. A computer-based simulation was created to analyze the potential of the proposed encryption technique.
-
SPE DRILLING & COMPLETION
Journals -
An approximation algorithm for maximum P3-packing in subcubic graphs
PublicationW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
Parallel immune system for graph coloring
PublicationThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...
-
Job Demands, Engagement, and Turnover Intentions in Polish Nurses: The Role of Work-Family Interface
PublicationBackground: Poland has lower ratios of employed registered nurses per 1,000 inhabitants than the EU average. Polish nurses work under miserable conditions without assisting personnel, and they reconcile their professional demands with responsibilities for their families; 96% of them are women. Rationale/Aims: This study uses Hobfoll’s conservation of resources (CORs) theory to explain the role of various resources in the improvement...
-
Psychometric properties of the polish version of the job-related affective well-being scale
PublicationObjectives: The aim of this study was to verify psychometric properties of the Polish version of the Job-related Affective Well-being Scale (JAWS). Specifically, theoretical 4-factor structure (based on the dimensions of pleasure and arousal) and reliability of the original – 20-item JAWS (van Katwyk et al., 2000) and the shortened – 12-item (Schaufeli and Van Rhenen, 2006) versions were tested. Material and Methods: Two independent...
-
Non-monotone graph searching models
PublicationGraph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublicationProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...