Wyszukiwarka
Filtry
wszystkich: 9419
-
Katalog
- Publikacje 7490 wyników po odfiltrowaniu
- Czasopisma 43 wyników po odfiltrowaniu
- Konferencje 41 wyników po odfiltrowaniu
- Osoby 142 wyników po odfiltrowaniu
- Wynalazki 20 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Laboratoria 3 wyników po odfiltrowaniu
- Zespoły Badawcze 5 wyników po odfiltrowaniu
- Aparatura Badawcza 2 wyników po odfiltrowaniu
- Kursy Online 315 wyników po odfiltrowaniu
- Wydarzenia 18 wyników po odfiltrowaniu
- Dane Badawcze 1339 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: JOB SCHEDULING UNIFORM MACHINES MAKESPAN TOTAL COMPLETION TIME APPROXIMATION SCHEME NP-HARDNESS INCOMPATIBILITY GRAPH
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Compact scheduling of zero-one time operations in multi-stage systems.
PublikacjaRozważamy szeregowanie zwarte na maszynach dedykowanych z zero-jedynkowymi operacjami w modelu otwartym, przepływowym i mieszanym. Harmonogramy zostały zmodelowane przy pomocy pokolorowań krawędzi grafu konfliktów z pewnymi dodatkowymi ograniczeniami. Dowodzimy NP-trudności problemów w przypadku ogólnym oraz prezentujemy przegląd znanych wielomianowych algorytmów szeregujących dla systemów o specyficznej budowie.
-
Unicyclic graphs with equal total and total outer-connected domination numbers
PublikacjaLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Uniform solvability for families of linear systems on time scales
Publikacja -
Rearrangeability in multicast Clos networks is NP-complete
PublikacjaPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
Stability by linear approximation for time scale dynamical systems
Publikacja -
Graph classes generated by Mycielskians
PublikacjaIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
THRIVING AND JOB SATISFACTION IN MULTICULTURAL ENVIRONMENTS OF MNCS
PublikacjaPurpose of the article The aim of the paper is to analyze the relationship between thriving and job satisfaction in multicultural environments of multinational corporations (MNCs). Methodology/methods The quantitative cross-sectional study was conducted on the sample of 128 individuals from subsidiaries of various MNCs located in Poland involved in intercultural interactions. Scientific aim The aim of this study was to examine...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
Chromatic scheduling of 1- and 2-processor uet tasks on dedicated machines with availability constraints.
PublikacjaRozważono uogólnienie klasycznego szeregowania jednostkowych zadań jedno- i dwuprocesorowych na maszynach dedykowanych. Przyjęty model pozwala na naturalne wprowadzenie wszystkich klasycznych kryteriów optymalizacyjnych dla harmonogramów. Zaproponowano algorytmy wielomianowe dla systemów rzadkich.
-
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
Publikacja -
Job satisfaction in the multicultural environment of multinational corporations
PublikacjaPurpose – Since prior research into the effects of multiculturalism on job satisfaction in multinational corporations (MNCs) is rather scant and inconclusive, the authors attempt to review the literature and explain why these results are inconsistent as well as propose a new model aimed at responding to these irregularities. Design/methodology/approach – In the narrative review of the prior research and the proposed model the...
-
Ferro- and antiferro-magnetism in (Np, Pu)BC
PublikacjaTwo new transuranium metal boron carbides, NpBC and PuBC, have been synthesized. Rietveld refinements of powder XRD patterns of {Np,Pu} BC confirmed in both cases isotypism with the structure type of UBC. Temperature dependent magnetic susceptibility data reveal antiferromagnetic ordering for PuBC below T-N = 44 K, whereas ferromagnetic ordering was found for NpBC below T-C = 61 K. Heat capacity measurements prove the bulk character...
-
Some Progress on Total Bondage in Graphs
PublikacjaThe total bondage number b_t(G) of a graph G with no isolated vertex is the cardinality of a smallest set of edges E'⊆E(G) for which (1) G−E' has no isolated vertex, and (2) γ_t(G−E')>γ_t(G). We improve some results on the total bondage number of a graph and give a constructive characterization of a certain class of trees achieving the upper bound on the total bondage number.
-
A 27/26-approximation algorithm for the chromatic sum coloring of bipartitegraphs
PublikacjaWe consider the CHROMATIC SUM PROBLEM on bipartite graphs which appears to be much harder than the classical CHROMATIC NUMBER PROBLEM. We prove that the CHROMATIC SUM PROBLEM is NP-complete on planar bipartite graphs with Delta less than or equal to 5, but polynomial on bipartite graphs with Delta less than or equal to 3, for which we construct an O(n(2))-time algorithm. Hence, we tighten the borderline of intractability for this...
-
Graph Decomposition for Memoryless Periodic Exploration
PublikacjaWe consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...
-
Compact Scheduling In Open Shop With Zero-One Time Operations
Publikacja -
Comparison of 3D Point Cloud Completion Networks for High Altitude Lidar Scans of Buildings
PublikacjaHigh altitude lidar scans allow for rapid acquisition of big spatial data representing entire city blocks. Unfortunately, the raw point clouds acquired by this method are largely incomplete due to object occlusions and restrictions in scanning angles and sensor resolution, which can negatively affect the obtained results. In recent years, many new solutions for 3D point cloud completion have been created and tested on various objects;...
-
JOURNAL OF SCHEDULING
Czasopisma -
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublikacjaConsider 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...
-
Fast Collaborative Graph Exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Fast collaborative graph exploration
PublikacjaWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Burst loss probability for the combination of extended offset time based service differentiation scheme and PPS in optical burst switching network
PublikacjaIn the paper analytical model for calculating burst loss probabilities for the combination of two service differentiation schemes for OBS network namely: extended offset time based scheme and PPS (Preemption Priority Schemes) is revised. Moreover authors introduce analytical model for calculating burst loss probabilities for an optical path when OBS network employs both service differentiation schemes and JET signaling. The comparison...
-
Optimal conditions of ramentaceone and plumbagin separation and isolation from carnivorous plants extracts using normal phase-high performance liquid chromatography (NP-HPLC)
PublikacjaPraca prezentuje optymalne warunki rozdzielania i izolacji plumbaginy i ramentacenu z matrycy analitycznej, którą stanowią chloroformowe ekstrakty z roślin D.aliciae i D.capensis z wykorzystaiem techniki NP-HPLC. Skład eluentu dla żelu krzemionkowego jako fazy stacjonarnej był optymalizowany. Zostały przedstawione optymalne warunki powiększania skali procesu izolacji badanych metabolitów z ekstrakrów roślinnych. Określono również...
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublikacjaWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Unusual behaviour of (Np,Pu)B2C
PublikacjaTwo transuranium metal boron carbides, NpB2C and PuB2C have been synthesized by argon arc melting. The crystal structures of the {Np,Pu}B2C compounds were determined from single-crystal X-ray data to be isotypic with the ThB2C-type (space group R3m, a = 0.6532(2) nm; c = 1.0769(3) nm for NpB2C and a = 0.6509(2) nm; c = 1.0818(3) nm for PuB2C; Z = 9). Physical properties have been derived from polycrystalline bulk material in the...
-
Wojciech Wojnowski dr inż.
OsobyUkończył V Liceum Ogólnokształcące w Gdańsku w klasie o profilu matematyczno-fizycznym z wykładowym językiem angielskim. W 2009 roku rozpoczął studia na Wydziale Chemicznym PG na kierunku technologia chemiczna, uzyskując w 2012 roku tytuł inżyniera, a w 2013 tytuł magistra. W latach 2013–2015 studiował sinologię na Uniwersytecie w Nankinie dzięki uzyskaniu Stypendium Rządu ChRL. Po powrocie do Polski w 2015 roku rozpoczął studia...
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
The Influence of Workpiece Hardness on Plate Temperature during One Side Lapping
PublikacjaLapping leads to a surface with low roughness and high precision. Because of required parts accuracy tool flatness is the key to the successful machining. To avoid its excessive thermal expansion, plate temperature research was taken. The goal was to determine the correlation between the basic lapping conditions and wheel temperature. In work Bulsara et al. authors developed model to estimate the maximum and average temperature...
-
Compact scheduling of zero–one time operations in multi-stage systems
Publikacja -
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
Chemical identification of rubber fender sample and hardness and density measurements
PublikacjaScope of testing: Chemical identification of rubber fender sample and hardness and density measurements. - Raport z badań zleconych - Numer umowy: 031178
-
On trees attaining an upper bound on the total domination number
PublikacjaA total 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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
Knowledge Sharing and Organizational Culture Dimensions: Does Job Satisfaction Matter?
PublikacjaThe aim of this study is to examine how job satisfaction influences the relationship between company performance, knowledge sharing, and organizational culture, perceived through the prism of Hofstede’s cultural dimensions, controlled by company size and staff position. A survey of 910 Polish employees (mainly knowledge workers) with different roles and experiences across different industries was conducted. The data were analyzed...
-
Organizational Conditioning of Job Satisfaction. A Model of Job Satisfaction
Publikacja -
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Positivity and job burnout in emergency personnel: examining linear and curvilinear relationship
PublikacjaThe aim of this study was to examine whether the relationship between the ratio of job-related positive to negative emotions (positivity ratio) and job burnout is best described as linear or curvilinear. Participants were 89 police officers (12% women) and 86 firefighters. The positivity ratio was evaluated using the Job-related Affective Wellbeing Scale (Van Katwyk, Fox, Spector, & Kelloway, 2000). Exhaustion and disengagement,...
-
An in-depth look at the tire rubber hardness influence on tire/road noise measurements
PublikacjaWhen assessing the acoustic quality of a road pavement with the close-proximity (CPX) or the on-board sound intensity (OBSI) method, the rubber hardness of the reference tire substantially affects the measurement. Practical experience shows that measurement tires can get significantly harder within a single measurement season. This is why one would like to normalize measurements to a reference rubber hardness. The recently published...
-
Zgred - Zgred Graph Editor
PublikacjaThe paper presents a graph editor that was developed as a supplementary tool for the Koala graph library. We discuss its requirements, design choices and main ideas behind the implementation. The later part of the paper is meant to be a brief user manual, as we go through the functionality provided by the editor
-
Work Values of Police Officers and Their Relationship With Job Burnout and Work Engagement
PublikacjaValues represent people’s highest priorities and are cognitive representations of basic motivations. Past research shows that levels of both aspects of job-related well-being, job burnout and work engagement, are related to work values. The policing profession is associated with high engagement and a risk of burnout. There is a gap in the literature regarding the hierarchy of work values in police officers, how work values are...
-
Workshop on Graph Theory
WydarzeniaThe Gdańsk Workshop on Graph Theory (GWGT) is an annual, informal workshop whose goal is to provide a forum for scientists to meet, present their work, interact, and establish collaborations in the field of Graph Theory
-
On trees with double domination number equal to total domination number plus one
PublikacjaA total 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. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Electric Machines Virtual Laboratory
Kursy OnlineThis is an educational aid for students. It shows the environment of industrial application of electric machines and allows for a look inside them. Users can see the main components of the power system in its natural environment. This course is to allow access to the VR app – Electric Machines Virtual Laboratory.
-
The excitation controller with gain scheduling mechanism for synchronous generator control
PublikacjaThe power systems, including the synchronous generators and power systems networks, are complex nonlinear systems with configuration and parameters which change through time. That leads to electromechanical oscillations occurring in that system. Thus synchronous generator excitation controller must be capable of providing appropriate stabilization signal over broad range of operating conditions and disturbances. In this paper,...