Filters
total: 10529
filtered: 5769
-
Catalog
- Publications 5769 available results
- Journals 17 available results
- Conferences 23 available results
- People 139 available results
- Inventions 10 available results
- Projects 4 available results
- Laboratories 6 available results
- Research Teams 7 available results
- Research Equipment 40 available results
- e-Learning Courses 1153 available results
- Events 24 available results
- Open Research Data 3337 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: chromatic cost coloring, optimum cost chromatic partition, weighted graph, bipartite graph, approximation algorithm, chromatic cost 3-pseudocoloring
-
Towards explainable motion prediction using heterogeneous graph representations
Publication -
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publication -
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublicationThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublicationPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
Low-cost multiband four-port phased array antenna for sub-6 GHz 5G applications with enhanced gain methodology in Radio-over-fiber systems using modulation instability
PublicationPhased array antenna (PAA) technology is essential for applications requiring high gain and wide bandwidth, such as sensors, medical, and 5G. Achieving such a design, however, is a challenging and intricate process that calls for precise calculations and a combination of findings to alter the phase and amplitude of each unit. Furthermore, coupling effects between these PAA structure elements can only be completed with the use of...
-
Application of low-cost Gallium Arsenide light-emitting-diodes as kerma dosemeter and fluence monitor for high-energy neutrons
Publication -
Evidence for the Cost of Reproduction in Humans: High Lifetime Reproductive Effort Is Associated with Greater Oxidative Stress in Post-Menopausal Women
Publication -
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublicationThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
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...
-
A linear time algorithm for edge coloring of binomial trees
Publication -
Calculating the Partition Coefficients of Organic Solvents in Octanol/Water and Octanol/Air
PublicationPartition coefficients define how a solute is distributed between two immiscible phases at equilibrium. The experimental estimation of partition coefficients in a complex system can be an expensive, difficult, and time-consuming process. Here a computational strategy to predict the distributions of a set of solutes in two relevant phase equilibria is presented. The octanol/water and octanol/air partition coefficients are predicted...
-
Selecting the optimum location for logistics facilities using Solver
PublicationSiting logistics facilities strategically in the most costeffective geographic location is one of the key decisions a contemporary company will make. The aim of the paper is to present a solution to this problem using the Solver add-on. In the case study discussed in the paper, the company’s central warehouse location was selected based on the classic location theory, which addresses the need to minimize the cost of transport....
-
Recent progress in research on the cutting processes of wood. A review COST Action E35 2004–2008: Wood machining – micromechanics and fracture
Publication -
Costs and cost‐effectiveness of the meeting centres support programme for people living with dementia and carers in Italy, Poland and the UK: The MEETINGDEM study
Publication -
Effective calcium doping at the B-site of BaFeO3−δ perovskite: towards low-cost and high-performance oxygen permeation membranes
Publication -
Personalized nutrition in ageing society: redox control of major-age related diseases through the NutRedOx Network (COST Action CA16112)
PublicationA healthy ageing process is important when it is considered that one-third of the population of Europe is already over 50 years old, although there are regional variations. This proportion is likely to increase in the future, and maintenance of vitality at an older age is not only an important measure of the quality of life but also key to participation and productivity. So, the binomial “nutrition and ageing” has different aspects...
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublicationThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
A note on mixed tree coloring
PublicationZaproponowano liniowy algorytm dla problemu kolorowania mieszanego w drzewach, uzyskując tym samym poprawę w stosunku do algorytmu o złożoności O(n^2) podanego w pracy [P. Hansen, J. Kuplinsky, D. de Werra, Mixed graph colorings, Math. Methods Oper. Res. 45 (1997) 145-160].
-
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Eventual Convergence of the Reputation-Based Algorithm in IoT Sensor Networks
PublicationUncertainty in dense heterogeneous IoT sensor networks can be decreased by applying reputation-inspired algorithms, such as the EWMA (Exponentially Weighted Moving Average) algorithm, which is widely used in social networks. Despite its popularity, the eventual convergence of this algorithm for the purpose of IoT networks has not been widely studied, and results of simulations are often taken in lieu of the more rigorous proof....
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
Adsorptive Removal of Aqueous Phase Crystal Violet Dye by Low-Cost Activated Carbon Obtained from Date Palm (L.) Dead Leaflets
PublicationUp to now, water pollution is still one of the important issues and challenges worldwide, due to its environmental, economic and human life impacts. It is also remains a challenge to environment scientists and technologists. Nowadays, the textile dyeing industry is considered one of the largest water consuming industries and produces large volumes of colored wastewater in its dyeing and finishing process. In this study, date palm...
-
Application of Graph Theory Algorithms in Non-disjoint Functional Decomposition of Specific Boolean Functions
Publication -
Partition of friction heat between sliding semispaces due to adhesion-deformational heat generation
PublicationAnalytical expressions of heat-partition coefficient and contact temperatures for two sliding semispaces with account for adhesion-deformational heat generation and contact heat exchange have been obtained. The rate of deformational heat generation is assumed to decay exponentially with increase of distance from the interface. It has been shown that heat-generation configuration and the intensity of contact heat exchange have impact...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Reconfiguring Minimum Dominating Sets in Trees
PublicationWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
A new B-D-galactosidase with a low temperature optimum isolated from the Antarctic Arthrobacter sp. 20B: gene cloning, purification and characterization.
PublicationA psychrotrophic bacterium producing a coldadaptedB-galactosidase upon growth at low temperatureswas classiWed as Arthrobacter sp. 20B. A genomic DNAlibrary of strain 20B introduced into Escherichia coliTOP10F' and screening on X-Gal (5-bromo-4-chloro-3-indolyl-B-D-galactopyranoside)-containing agar plates ledto the isolation of B-galactosidase gene. The B-galactosidasegene (bgaS) encoding a protein of 1,053 amino acids,with a...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Optimum Control of Gyroscopic Systems
PublicationThe problem of optimum control of transverse rotor vibrations with gyroscopic interactions has been described and solved in the paper. An integral performance index has been defined for such system in order to minimize vibration level of a chosen rotor point. For this reason, an efficient way of finding the weight coefficients of integral performance index for multi-degrees-of-freedom system with gyroscopic interactions has been...
-
Electron collision with B(CD3)3 molecules
PublicationArtykuł prezentuje całkowite przekroje czynne na rozpraszanie elektronów na drobinach B(CD3)3 zmierzone dla niskich i średnich energii zderzenia. Wyniki porównano z elastycznymi i jonizacyjnymi przekrojami czynnymi obliczonymi dla drobiny B(CD3)3 dla średnich energii zderzenia. Porównano i przedyskutowano przekroje czynne dla drobin zawierających bor.
-
Influence of transglutaminase or 1-ethyl-3-(3-dimethylaminopropyl) carbodiimide (EDC) on the properties of fish-skin gelatin films
PublicationBadano wpływ sieciowania żelatyny przy użyciu transglutaminazy (TG) lub EDC na rozpuszczalność oraz mechaniczne i barierowe właściwości wytworzonych folii. Rozpuszczalność sieciowanych enzymatycznie folii w buforach o pH 3 i 6 obniżyła się ze 100% do 30%, a folii modyfikowanych TG w obecności ditiotreitolu lub cysteiny, odpowiednio, do 5 i 15%. Rozpuszczalność folii modyfikowanych EDC wynosiła 10%. Sieciowanie enzymatyczne nie...
-
Weighted Clustering for Bees Detection on Video Images
PublicationThis work describes a bee detection system to monitor bee colony conditions. The detection process on video images has been divided into 3 stages: determining the regions of interest (ROI) for a given frame, scanning the frame in ROI areas using the DNN-CNN classifier, in order to obtain a confidence of bee occurrence in each window in any position and any scale, and form one detection window from a cloud of windows provided by...
-
LanroNET, a non-interventional, prospective study to assess the resource utilization and cost of lanreotide autogel 120 mg in Polish patients with neuroendocrine tumors – results of interim analysis
Publication -
Comparative Study of Pavement Rehabilitation Using Hot in-Place Recycling and Hot-Mix Asphalt: Performance Evaluation, Pavement Life Prediction, and Life Cycle Cost Analysis
Publication -
Report for the Short Term Scientific Mission within COST Action FP1101: development of the in-field sensor for estimation of fracture toughness and shear strength by measuring cutting forces
PublicationKnowledge on the fracture properties of materials is essential to assure structural integrity and proper design of mechanical connections in timber constructions. Measurement of this property is, however, a very challenging task. The linear fracture mechanics is usually used for its assessment assisted with experimental data acquired by means of various techniques, usually of destructive nature. The cutting force is an energetic...
-
Selection of energy storage units by genetic algorithm for mitigating voltage deviations
PublicationIn recent years, energy storage units have become very popular. They are applied both for economic and technical purposes. Unfortunately, the cost of such devices is still high and selecting their proper location and rated power have to be performed precisely. In this paper, a Genetic-Algorithm-based optimization method for selecting the best configuration of energy storage units in the power network is proposed. The presented...
-
On noncausal weighted least squares identification of nonstationary stochastic systems
PublicationIn this paper, we consider the problem of noncausal identification of nonstationary, linear stochastic systems, i.e., identification based on prerecorded input/output data. We show how several competing weighted (windowed) least squares parameter smoothers, differing in memory settings, can be combined together to yield a better and more reliable smoothing algorithm. The resulting parallel estimation scheme automatically adjusts...
-
Necessary and Sufficient Condition for State-Independent Contextual Measurement Scenarios
PublicationThe problem of identifying measurement scenarios capable of revealing state-independent contextuality in a given Hilbert space dimension is considered. We begin by showing that for any given dimension d and any measurement scenario consisting of projective measurements, (i) the measure of contextuality of a quantum state is entirely determined by its spectrum, so that pure and maximally mixed states represent the two extremes...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Selection of optimal location and rated power of capacitor banks in distribution network using genetic algorithm
PublicationIn this paper, the problem of placement and rated power of capacitor banks in the Distribution Network (DN) is considered. We try to suggest the best places for installing capacitor banks and define their reactive power. The considered formulation requires the optimization of the cost of two different objectives. Therefore the use of properly multiobjective heuristic optimization methods is desirable. To solve this problem we use...
-
Task Assignments in Logistics by Adaptive Multi-Criterion Evolutionary Algorithm with Elitist Selection
PublicationAn evolutionary algorithm with elitist selection has been developed for finding Pareto-optimal task assignments in logistics. A multi-criterion optimization problem has been formulated for finding a set of Pareto- optimal solutions. Three criteria have been applied for evaluation of task assignment: the workload of a bottleneck machine, the cost of machines, and the numerical performance of system. The machine constraints have...
-
Collisions of electrons with trimethylamine N(CH3)3 molecules
PublicationPrzedstawiono całkowite przekroje czynne na rozpraszanie elektronów na drobinach N(CH3)3, zmierzone dla niskich i średnich energii zderzenia. Wyniki porównano z elastycznymi i jonizacyjnymi przekrojami czynnymi, obliczonymi dla tej drobiny, dla średnich energii zderzenia. Porównano i przedyskutowano przekroje czynne dla drobin zawierających azot jako atom centralny.
-
Collisions of electrons with trimethylphosphine [P(CH3)3] molecules
PublicationPrzedstawiono wyniki pomiarów całkowitych przekrojów czynnych na rozpraszanie elektronów na molekułach P(CH3)3. Pomiary przeprowadzono w przedziale energii od 0,4 do 400eV. Obliczono przekroje czynne na rozpraszanie sprężyste i na jonizację. Wyniki porównano z przekrojami czynnymi dla innych związków zawierających fosfor jako atom centralny oraz grupę metylową.
-
The Optimum Dataset method – examples of the application
PublicationData reduction is a procedure to decrease the dataset in order to make their analysis more effective and easier. Reduction of the dataset is an issue that requires proper planning, so after reduction it meets all the user’s expectations. Evidently, it is better if the result is an optimal solution in terms of adopted criteria. Within reduction methods, which provide the optimal solution there is the Optimum Dataset method (OptD)...
-
[P4–544]: MEETINGDEM REPORTING ON THE IMPLEMENTATION, EFFECTIVENESS AND COST‐EFFECTIVENESS OF THE DUTCH MEETING CENTRES SUPPORTS PROGRAMME FOR PEOPLE LIVING WITH DEMENTIA AND FAMILY CARERS IN THREE EUROPEAN COUNTRIES
Publication -
Application of the Optimum Dataset Method in Archeological Studies on Barrows
PublicationLight Detection and Ranging (LiDAR) became one of the technologies used in archaeological research. It allows for relatively easy detection of archaeological sites that have their own field form, e.g.: barrows, fortresses, tracts, ancient fields [1]. As a result of the scanning, the so-called point cloud is obtained, often consisting of millions of points. Such large measurement datasets are very time-consuming and labor-intensive...
-
Total domination in versus paired-domination in regular graphs
PublicationA 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...
-
The Potential of Greed for Independence
PublicationThe well-known lower bound on the independence number of a graph due to Caro and Wei can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so-called potential functions p(G) : V(G) -> N_0 defined on the vertex set of a graph G for which suitably...