Filters
total: 10618
-
Catalog
- Publications 5802 available results
- Journals 17 available results
- Conferences 23 available results
- People 140 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 1202 available results
- Events 24 available results
- Open Research Data 3343 available results
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
-
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....
-
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...
-
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 -
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...
-
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...
-
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...
-
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...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the “critical” partition type
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
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...
-
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.
-
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...
-
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ą.
-
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...
-
[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 -
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)...
-
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...
-
JOURNAL OF GRAPH THEORY
Journals -
Uniform expansion estimates in the quadratic map as a function of the partition size, using the “derivative” partition type
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
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 structure of revenues of non-public universities in 2010 from didactic activity by sources of financing (in%)
Open Research DataIncome from teaching activities of non-public universities accounted for almost 1/5 of income from teaching activities of all types of universities. Non-public universities generated the highest revenues from fees for teaching classes, which accounted for over half of the revenues from this title in relation to all universities.The average cost of education...
-
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...
-
An optimal sliding mode control based on immune-wavelet algorithm for underwater robotic manipulator
PublicationIn this paper, a robust optimal Sliding Mode Controller (SMC) based on new algorithm of Artificial Immune System (AIS) is proposed for trajectory tracking of underwater manipulators. A new AIS algorithm is used to derive optimal values of surface parameters and boundary layer thickness in SMC with considering minimum torques and error. Surface parameters and boundary layer thickness are considered as antibody in AIS and Morlet...
-
Antecedents to Achieve Kanban Optimum Benefits in Software Companies
PublicationIn 2004, Kanban successfully entered into the Agile and Lean realm. Since then software companies have been increasingly using it in software development teams. The goal of this study is to perform an empirical investigation on antecedents considered as important for achieving optimum benefits of Kanban use and to discuss the practical implications of the findings. We conducted an online survey with software professionals from...
-
Using Long-Short term Memory networks with Genetic Algorithm to predict engine condition
PublicationPredictive maintenance (PdM) is a type of approach for maintenance processes, allowing maintenance actions to be managed depending on the machine's current condition. Maintenance is therefore carried out before failures occur. The approach doesn’t only help avoid abrupt failures but also helps lower maintenance cost and provides possibilities to manufacturers to manage maintenance budgets in a more efficient way. A new deep neural...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublicationThe article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm,...
-
Development of UV/H 2 O 2 /TiO 2 –LECA hybrid process based on operating cost: Application of an effective fixed bed photo-catalytic recycled reactor
Publication -
Entropy of water calculated from harmonic approximation: estimation of the accuracy of method
PublicationSome molecular dynamics simulations were performed for liquid TIP4P and SPC water at a constant density (1.00 g/cm(3)) and within the temperature range of 5-90 degrees C. By using harmonic approximation, both the entropy of water S-H and the specific heat c(v) were calculated, and the results were compared to literature data. It was found that harmonic approximation overestimates absolute entropy of TIP4P water by 5.6 J/mol K (similar...
-
Approximate search strategies for weighted trees
PublicationW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Jan Franz dr hab.
People