Filters
total: 734
filtered: 300
Search results for: applied mathematics
-
Recurrence scheme for FDTD-compatible discrete Green's function derived based on properties of Gauss hypergeometric function
PublicationIn this paper, the formulation of one-dimensional FDTD (Finite-difference time-domain)-compatible discrete Green's function (DGF) is derived based on the Gauss hypergeometric function (GHF). The properties of GHF make it possible to derive the recurrence scheme only in the time domain for the DGF generation. Furthermore, this recurrence scheme is valid for any stable time-step size and can be implemented using standard numerical...
-
Broken rotor symptoms in the sensorless control of induction machine
PublicationThe purpose of this paper is to investigate the need for a universal method for sensorless controlled induction motor drive diagnosis. The increasing number of sensorless control systems in industrial applications require a universal method for the drive diagnosis, which provides reliable diagnostic reasoning independent of control system structure and state variables measurement or estimation method.Simulations and experimental...
-
Multi-Criteria Simulation-Optimization Analysis of Usage of Automated Parcel Lockers: A Practical Approach
Publication -
Characterization of the Functionally Graded Shear Modulus of a Half-Space
PublicationIn this article, a method is proposed for determining parameters of the exponentialy varying shear modulus of a functionally graded half-space. The method is based on the analytical solution of the problem of pure shear of an elastic functionally graded half-space by a strip punch. The half-space has the depth-wise exponential variation of its shear modulus, whose parameters are to be determined. The problem is reduced to an integral...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Damage Control in Warships
PublicationAs a result of dynamic quantitative and qualitative developments in the maritime industry its participants face harder and harder challenges pertaining to safety of ships and navigation. Practice has shown that even very well organised fleets are harassed by emergencies and accidents that can be neither predicted nor absolutely avoided. In order to counter the occuring emergencies and accidents, and to minimize their effects damage...
-
Improvements to the STEAM-based teaching of architectural drawing
PublicationThe author of this article presents a systemic approach to improving the teaching of architectural drawing courses for engineers in the 21st Century. In this era of rapid development of digital technologies, the traditional teaching structure should be redefined to a purpose-oriented dynamic model. The existing, generally accepted teaching models have already proved successfully based on the practice-oriented STEAM programme, which...
-
Broken rotor bar impact on sensorless control of induction machine
PublicationThe aim of the research is analysis of the sensorless control system of induction machine with broken rotor for diagnostic purposes. Increasing popularity of sensorless controlled variable speed drives requires research in area of reliability, range of stable operation, fault symptoms and application of diagnosis methods. T transformation (Cunha et al.,2003) used for conversion of instantaneous rotor currents electrical circuit...
-
Why is TASK Quarterly a Significant Journal to Publish Your Article? —A Bibliometric Analysis of a Scientific and Technical Journal
PublicationA bibliometric analysis of TASK Quarterly in the years 1997-2021 in terms of various bibliometric indicators was performed to celebrate the 25th anniversary of the publication of the first issue of the journal. The number of publications and citations increased over the mentioned span of years. The leading countries in terms of the greatest number of papers published in TASK Quarterly are Poland, Italy, Germany, Ukraine, USA and...
-
A Review: Applications of the Spectral Finite Element Method
PublicationThe Spectral Finite Element Technique (SFEM) has Several Applications in the Sciences, Engineering, and Mathematics, which will be Covered in this Review Article. The Spectral Finite Element Method (SFEM) is a Variant of the Traditional Finite Element Method FEM that Makes use of Higher Order Basis Functions (FEM). One of the most Fundamental Numerical Techniques Employed in the Numerical Simulation is the SFEM, which Outperforms...
-
Self-Perceived Personal Brand Equity of Knowledge Workers by Gender in Light of Knowledge-Driven Organizational Culture: Evidence From Poland and the United States
PublicationThis study contributes to the limited literature on the personal branding of knowledge workers by revealing that a culture that incorporates knowledge, learning, and collaboration supports (explicit and tacit) knowledge sharing among employees and that sharing matters for knowledge workers’ self-perceived personal brand equity. Analysis of 2,168 cases from the United States and Poland using structural equation modeling (SEM) showed...
-
Al-Kindi’s “The Real One”: Considerations of a mathematician or of a metaphysician?
PublicationThe aim of the article is to analyze Al-Kindi’s concept of the True (Essential) One and certain additional issues, also taking into account the influence on his position from both classical philosophy and source texts of Islam. In the opening part of the article, Al-Kindi’s innovative approach to the application of mathematics in research in other areas of knowledge is discussed. In the next part,...
-
Ontology-Aided Software Engineering
PublicationThis thesis is located between the fields of research on Artificial Intelligence (AI), Knowledge Representation and Reasoning (KRR), Computer-Aided Software Engineering (CASE) and Model Driven Engineering (MDE). The modern offspring of KRR - Description Logic (DL) [Baad03] is considered here as a formalization of the software engineering Methods & Tools. The bridge between the world of formal specification (governed by the mathematics)...
-
Mind the framing: Match purpose and context
PublicationIn several ways, the following chapters will allude to the concept of frames. The assumptions of a mathematical model tell us what it can explain and what it cannot (see chapter 5). The trade-off between the usefulness of a mathemati- cal model and the scale of complexity it seeks to capture further conditions the narrative, highlighting or downsizing cognitive elements relevant to responsible modelling (see ‘Mathematics and tales’...
-
Interval vertex-coloring of a graph with forbidden colors
Publication -
A linear time algorithm for edge coloring of binomial trees
Publication -
The smallest hard-to-color graph for algorithm DSATUR
Publication -
Consecutive colorings of the edges of general graphs
Publication -
Interval edge coloring of a graph with forbidden colors
Publication -
The smallest hard-to-color graph for the SL algorithm
Publication -
Compact cyclic edge-colorings of graphs
PublicationArtykuł jest poświęcony modelowi zwartego cyklicznego kolorowania krawędzi grafów. Ten wariant kolorowania jest stosowany w modelowaniu uszeregowań w systemach produkcyjnych, w których proces produkcyjny ma charakter cykliczny. W pracy podano konstrukcje grafów, które nie zezwalają na istnienie pokolorowania w rozważanym modelu. Wykazano także kilka własności teoretycznych, takich jak ograniczenia górne na liczbę kolorów w optymalnym...
-
A note on compact and compact circular edge-colorings of graphs
PublicationW pracy rozważamy dwa warianty kolorowania krawędzi grafów prostych i ważonych, mianowicie kolorowania zwarte oraz zwarte cyrkularne. Rozważamy relacje pomiędzy nimi. Dowodzimy, że każdy zewnętrznie planarny graf dwudzielny posiada zwarte pokolorowanie krawędziowe oraz, że problem ten dla grafów ogólnych jest NP-zupełny. Podajemy również wielomianowy 1.5-przybliżony algorytm oraz pseudowielomianowy dokładny algorytm zwartego cyrkularnego...
-
On Directed Lattice Paths With Vertical Steps
Publication -
Enumerations of Plane Trees with Multiple Edges and Raney Lattice Paths
Publication -
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Distance paired domination numbers of graphs
PublicationW pracy przedstawione są pewne własności liczb k-dominowania parami w grafach. Wykazane jest, że problem decyzyjny liczby k-dominowania parami jest problemem NP-zupełnym nawet dla grafów dwudzielnych. Przedstawione są ograniczenia górne i dolne dla liczby k-dominowania parami w drzewach i scharakteryzowane drzewa, w których te ograniczenia są osiągnięte.
-
Paired bondage in trees
PublicationW pracy zdefiniowano pojęcie liczby zniewolenia parami jako moc najmniejszego zbioru krawędzi, którego usunięcie z grafu spowoduje wzrost liczby dominowania parami. W szczególności scharakteryzowane są wszystkie drzewa, w których liczba zniewolenia wynosi 0, czyli takie, w których usunięcie dowolnego podzbioru krawędzi nie zwiększy liczby dominowania parami.
-
Greedy T-colorings of graphs
PublicationTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
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...
-
The circular chromatic index of some class 2 graphs
PublicationW artykule został wyznaczony cyrkularny indeks chromatyczny dla dwóch rodzin grafów klasy 2. Co więcej, podano nie trywialne oszacowania tego parametru dla snarków Isaacsa i Goldberga. Na koniec artykułu rozważana jest złożoność obliczeniowa problemów związanych z cyrkularnym kolorowaniem krawędzi.
-
Total restrained domination numbers of trees
PublicationOpisane są wszystkie drzewa, w których liczby dominowania totalnego i totalno - powściągniętego są sobie równe, a także podano dolne ograniczenie na liczbę dominowania totalno - powściągniętego w drzewach.
-
On the homotopy equivalence of the spaces of proper and local maps
Publication -
Uniform Expansivity Outside a Critical Neighborhood in the Quadratic Family
Publication -
Chaotic invariant sets of vibro-impact systems with one degree of freedom
Publication -
Time fractional analysis of Casson fluid with application of novel hybrid fractional derivative operator
PublicationA new approach is used to investigate the analytical solutions of the mathematical fractional Casson fluid model that is described by the Constant Proportional Caputo fractional operator having non-local and singular kernel near an infinitely vertical plate. The phenomenon has been expressed in terms of partial differential equations, and the governing equations were then transformed in non-dimensional form. For the sake of generalized...
-
Turán numbers for odd wheels
PublicationThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
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.
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Geometrical versus analytical approach in problem solving- an exploatory study
PublicationAbstract. In this study we analyse the geometrical visualization as a part of the process of solution. In total 263 students in the first year of study at three different universities in three different countries (Poland, Slovakia and Spain) were asked to solve four mathematical problems. The analysis of the results of all students showed that geometrical visualization for problems where there is a possibility to choose different ways...
-
Erratum to "Formulas and Theorems for the Special Functions of Mathematical Physics" by W. Magnus, F. Oberhettinger, R. P. Soni
PublicationWe correct a number of misprints in the handbook "Formulas and theorems for the special functions of mathematial physics" (3rd edition) by Magnus, Oberhettinger and Soni.
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Graphs with isolation number equal to one third of the order
PublicationA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
Boundary value problems for systems of functional differential equations
PublicationPraca dotyczy przybliżonych rozwiązań zagadnienia brzegowego dla funkcyjnych równań różniczkowych 2-go rzędu. Podano numeryczne algorytmy na wyznaczenie tego rozwiązania i warunki dostateczne, przy których metoda jest zgodna i zbieżna. Podano też konstrukcję metody dowolnego rzędu.
-
Differential equations with a singular matrix and convergence of approximate solutions
PublicationZastosowano metodę kwazilinearyzacji dla równań różniczkowych z macierzą osobliwą aby pokazać, że odpowiednie ciągi rozwiązań przybliżonych są kwadratowo zbieżne do rozwiązania naszego problemu.Metodę tę zastosowano do układów takich równań różniczkowych.
-
Individual entrepreneurial orientation: comparison of business and STEM students
PublicationAbstract Purpose – The purpose of this study is to determine whether there are differences in Individual Entrepreneurial Orientation (IEO) between students who are doing their major in business studies and the ones whose areas of study are science, technology, engineering, and mathematics (STEM). Design/methodology/approach – The current research investigates which factors and components contribute to EO orientation development...
-
Chemical Theory of Machines, basic principles of strength with examples of calculations
PublicationThis book encompasses the essential range of information on technical aspects of mechanical design. It was written primarily for the students and staff of chemistry faculties of technical universities, yet it may also be utilized by everyone, who ether would like to try or already enjoys designing, but cannot take advantage of typical stress & machine construction handbooks. These handbooks often require familiarity with the concepts...
-
Bistability in a One-Dimensional Model of a TwoPredators-One-Prey Population Dynamics System
Publication