Search
Search results for: TREES
-
Testing of Software for the Planning of a Linear Object GNSS Measurement Campaign under Simulated Conditions
PublicationThe precision of a linear object measurement using satellite techniques is determined by the number and the relative position of the visible satellites by the receiver. The status of the visible constellation is described by DOP. The obtained geometric coefficient values are dependent on many variables. When determining these values, field obstacles at the receiver location and satellite positions changing with time must be taken...
-
On the Hat Problem on the Cycle C7
PublicationThe topic is the hat problem in which each of n players is randomly 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 a win. In this version every player can...
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublicationWe describe a technique that maps unranked trees to their hash codes using a bottom-up deterministic tree automaton (DTA). In contrast to techniques implemented with minimal tree automata, our procedure builds a pseudo-minimal DTA. Pseudo-minimal automata are larger than the minimal ones but in turn the mapping can be arbitrary, so it can be determined prior to the automaton construction. We also provide procedures to build incrementally...
-
Early warning models against bankruptcy risk for Central European and Latin American enterprises
PublicationThis article is devoted to the issue of forecasting the bankruptcy risk of enterprises in Latin America and Central Europe. The author has used statistical and soft computing methods to program the prediction models. It compares the effectiveness of twelve different early warningmodels for forecasting the bankruptcy risk of companies. In the research conducted, the author used data on 185 companies listed on the Warsaw Stock Exchange...
-
Ranking Speech Features for Their Usage in Singing Emotion Classification
PublicationThis paper aims to retrieve speech descriptors that may be useful for the classification of emotions in singing. For this purpose, Mel Frequency Cepstral Coefficients (MFCC) and selected Low-Level MPEG 7 descriptors were calculated based on the RAVDESS dataset. The database contains recordings of emotional speech and singing of professional actors presenting six different emotions. Employing the algorithm of Feature Selection based...
-
Multi-agent graph searching and exploration algorithms
PublicationA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Common Independence in Graphs
PublicationAbstract: The cardinality of a largest independent set of G, denoted by α(G), is called the independence number of G. The independent domination number i(G) of a graph G is the cardinality of a smallest independent dominating set of G. We introduce the concept of the common independence number of a graph G, denoted by αc(G), as the greatest integer r such that every vertex of G belongs to some independent subset X of VG with |X|...
-
Parity vertex colouring of graphs
PublicationA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
Scanning networks with cactus topology
PublicationThe family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...
-
Assessing vehicle restraint systems on horizontal curves
PublicationHorizontal curves, an element of road infrastructure, have a statistically high number of accidents. Considering that horizontal curves in the last ten years have had app. 10% of all road accidents representing app. 14% of all fatalities on Polish roads, the issue is serious and requires more research and proper road safety treatments. Data for 2007 - 2016 show that in the case of accidents on horizontal curves app. 45% of the...
-
2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The 2-bondage number of G, denoted by b_2(G), is the minimum cardinality among all sets of edges E' subseteq E such that gamma_2(G-E') > gamma_2(G). If for every E' subseteq E we have...
-
Examining Statistical Methods in Forecasting Financial Energy of Households in Poland and Taiwan
PublicationThis paper examines the usefulness of statistical methods in forecasting the financial energy of households. The study’s objective is to create the innovative ratios that combine both financial and demographic information of households and implement them in the forecasting models. To conduct this objective, six forecasting models are developed using three different methods—discriminant analysis, logit analysis, and decision trees...
-
Paired domination versus domination and packing number in graphs
PublicationGiven a graph G = (V(G), E(G)), the size of a minimum dominating set, minimum paired dominating set, and a minimum total dominating set of a graph G are denoted by γ (G), γpr(G), and γt(G), respectively. For a positive integer k, a k-packing in G is a set S ⊆ V(G) such that for every pair of distinct vertices u and v in S, the distance between u and v is at least k + 1. The k-packing number is the order of a largest kpacking and...
-
Prediction of Wastewater Quality at a Wastewater Treatment Plant Inlet Using a System Based on Machine Learning Methods
PublicationOne of the important factors determining the biochemical processes in bioreactors is the quality of the wastewater inflow to the wastewater treatment plant (WWTP). Information on the quality of wastewater, sufficiently in advance, makes it possible to properly select bioreactor settings to obtain optimal process conditions. This paper presents the use of classification models to predict the variability of wastewater quality at...
-
Hat problem on a graph
PublicationThe 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...
-
Double bondage in graphs
PublicationA vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The double domination number of a graph G, denoted by gamma_d(G), is the minimum cardinality of a double dominating set of G. The double bondage number of G, denoted by b_d(G), is the minimum cardinality among all sets...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublicationW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
Non-isolating 2-bondage in graphs
PublicationA 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G)....
-
Non-isolating bondage in graphs
PublicationA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Efficiency of Artificial Intelligence Methods for Hearing Loss Type Classification: an Evaluation
PublicationThe evaluation of hearing loss is primarily conducted by pure tone audiometry testing, which is often regarded as golden standard for assessing auditory function. If the presence of hearing loss is determined, it is possible to differentiate between three types of hearing loss: sensorineural, conductive, and mixed. This study presents a comprehensive comparison of a variety of AI classification models, performed on 4007 pure tone...
-
Independent Domination Subdivision in Graphs
PublicationA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Comparison of Classification Methods for EEG Signals of Real and Imaginary Motion
PublicationThe classification of EEG signals provides an important element of brain-computer interface (BCI) applications, underlying an efficient interaction between a human and a computer application. The BCI applications can be especially useful for people with disabilities. Numerous experiments aim at recognition of motion intent of left or right hand being useful for locked-in-state or paralyzed subjects in controlling computer applications....
-
Risk assessment for tram traffic on tramway bridges
PublicationMiejski transport szynowy wielu miastach stanowi istotny element systemu transportowego i jest przestrzennie rozwijającym się systemem zapewniającym mieszkańcom codzienną obsługę transportową. Bezpieczeństwo pasażerów transportu szynowego i użytkowników dróg jest jednym z najważniejszych czynników, który należy uwzględnić w trakcie projektowania infrastruktury oraz w ocenie operacyjnej systemu miejskiego transportu tramwajowego....
-
SORPTION OF SELECTED CHLORINATED SOLVENTS ON PLANT DEBRIS COLLECTED IN A CITY PARK
PublicationDebris from deciduous trees in the form of park green waste was investigated as a potential biosorbent for the removal of chlorinated solvents from water. The sorption properties of beech leaves and cupules, oak leaves and acorns, birch leaves and lime leaves (all tree species common for a moderate climate) in a non-modified form were investigated with regard to the removal of perchloroethylene, 1,1,2-trichloroethane and 1,1,1,2-tetrachlorothane....
-
Speed estimation of a car at impact with a W-beam guardrail using numerical simulations and machine learning
PublicationThis paper aimed at developing a new method of estimating the impact speed of a passenger car at the moment of a crash into a W-beam road safety barrier. The determination of such a speed based on the accident outcomes is demanding, because often there is no access to full accident data. However, accurate determination of the impact speed is one of the key elements in the reconstruction of road accidents. A machine learning algorithm...
-
Rewitalizacja historycznego zespołu pałacowo-parkowego w Lokalnym Programie Rewitalizacji Wejherowa (2008-2015). Revitalisation of the Historic Palace and Park in the Local Revitalisation Program of Wejherowo (2008-2015)
PublicationW latach 1990. po upadku komunizmu w Polsce, przestrzeń publiczna w Wejherowie - podobnie jak i w innych miastach Polski była w dużym stopniu zdegradowana. W 2008 roku władze miasta Wejherowa opracowały i zatwierdziły "lokalny program rewitalizacji na lata 2008-2015", który dotyczył głównie centrum miasta. Miał on być w dużym stopniu finansowany przez Unię Europejską..Jedną z najbardziej eksponowanych przestrzeni publicznych, które...
-
The lognormal model of the multipath fading channel
Open Research DataThe dataset contains the results of simulations that are part of the research on modelling the multipath fading in the communication channel. The lognormal fading envelope is generated using the Monte-Carlo simulation (MCS) in the LabVIEW programming environment.
-
Hat problem on odd cycles
PublicationThe topic is the hat problem in which each of n players is randomly 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 a win. In this version every player can...
-
A construction for the hat problem on a directed graph
PublicationA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
On the hat problem on a graph
PublicationThe 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....
-
Quantitative Risk Assessment in Construction Disputes Based on Machine Learning Tools
PublicationA high monetary value of the construction projects is one of the reasons of frequent disputes between a general contractor (GC) and a client. A construction site is a unique, one-time, and single-product factory with many parties involved and dependent on each other. The organizational dependencies and their complexity make any fault or mistake propagate and influence the final result (delays, cost overruns). The constant will...
-
Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Collision-Free Network Exploration
PublicationA set of mobile agents is placed at different nodes of a n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round may two agents occupy the same node. In each round, an agent may choose to stay at its currently occupied node or to move to one of its neighbors. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest possible...
-
Stereo vision with Equal Baseline Multiple Camera Set (EBMCS) for obtaining depth maps of plants
PublicationThis paper presents a method of improving the estimation of distances between an autonomous harvesting robot and plants with ripe fruits by using the vision system based on five cameras. The system is called Equal Baseline Multiple Camera Set (EBMCS). EBMCS has some features of a camera matrix and a camera array. EBMCS is regarded as a set of stereo cameras for estimating distances by obtaining disparity maps and depth maps. This...
-
Machine learning-based seismic fragility and seismic vulnerability assessment of reinforced concrete structures
PublicationMany studies have been performed to put quantifying uncertainties into the seismic risk assessment of reinforced concrete (RC) buildings. This paper provides a risk-assessment support tool for purpose of retrofitting and potential design strategies of RC buildings. Machine Learning (ML) algorithms were developed in Python software by innovative methods of hyperparameter optimization, such as halving search, grid search, random...
-
Detecting type of hearing loss with different AI classification methods: a performance review
PublicationHearing is one of the most crucial senses for all humans. It allows people to hear and connect with the environment, the people they can meet and the knowledge they need to live their lives to the fullest. Hearing loss can have a detrimental impact on a person's quality of life in a variety of ways, ranging from fewer educational and job opportunities due to impaired communication to social withdrawal in severe situations. Early...
-
Karol Flisikowski dr inż.
PeopleKarol Flisikowski works as Associate Professor at the Department of Statistics and Econometrics, Faculty of Management and Economics, Gdansk University of Technology. He is responsible for teaching descriptive and mathematical statistics (in Polish and English), as well as scientific research in the field of social statistics. He has been a participant in many national and international conferences, where he has presented the results...
-
Intelligent Decision Forest Models for Customer Churn Prediction
PublicationCustomer churn is a critical issue impacting enterprises and organizations, particularly in the emerging and highly competitive telecommunications industry. It is important to researchers and industry analysts interested in projecting customer behavior to separate churn from non‐churn consumers. The fundamental incentive is a firm’s intent desire to keep current consumers, along with the exorbitant expense of gaining new ones....
-
The effect of road restraint systems on the level of road safety - Polish experience
PublicationRoadside accidents happen when a vehicle runs off the road. The majority of these accidents are very severe because leaving the road is usually followed by hitting a solid obstacle (tree, pole, support, culvert front wall, barrier). Roadsides are some of the most important issues of road safety. They have been studied for years to identify roadside hazards and the effectiveness of road safety measures such as restraint systems....
-
DESIGN OF THE DUAL CONSTELLATION GPS/GALILEO MOBILE DEVICE FOR IMPROVING NAVIGATION OF THE VISUALLY IMPAIRED IN AN URBAN AREA
PublicationIt is well known by users of Personal Navigation Device (PND) and other GPS-based devices that positioning suffers from (local) significant decreases of accuracy in partially obscured environments like urbanized areas, where buildings (especially high buildings), trees or terrain block large portions of the sky. In such areas, GPS receiver performance is usually deteriorated by the reduced number of currently available satellite...
-
DUAL CONSTELLATION GPS/GALILEO MOBILE SYSTEM FOR IMPROVING NAVIGATION OF THE VISUALLY IMPAIRED IN AN URBAN AREA
PublicationIt is well known by users of Portable Navigation Device (PND) and other GPS-based devices that positioning suffers from (local) significant decreases of accuracy in partially obscured environments like urbanized areas, where buildings (especially high buildings), trees or terrain block large portions of the sky. In such areas, GPS receiver performance is usually deteriorated by the reduced number of currently available satellite...
-
The Effect of Steaming Beech, Birch and Maple Woods on Qualitative Indicators of the Surface
PublicationThis work presents the effect of steaming beech, birch and maple woods on the resulting quality of the milled wood surface. The steaming process of the studied woods results in a targeted change in the color of the wood, which changes from the original light white-gray color to fine reddishbrown to dark brown color shades that are more or less saturated depending on the temperature of the saturated water steam. The color changes...
-
Shore Construction Detection by Automotive Radar for the Needs of Autonomous Surface Vehicle Navigation
PublicationAutonomous surface vehicles (ASVs) are becoming more and more popular for performing hydrographic and navigational tasks. One of the key aspects of autonomous navigation is the need to avoid collisions with other objects, including shore structures. During a mission, an ASV should be able to automatically detect obstacles and perform suitable maneuvers. This situation also arises in near-coastal areas, where shore structures like...
-
Ultrasound and Clinical Preoperative Characteristics for Discrimination Between Ovarian Metastatic Colorectal Cancer and Primary Ovarian Cancer: A Case-Control Study
PublicationThe aim of this study was to describe the clinical and sonographic features of ovarian metastases originating from colorectal cancer (mCRC), and to discriminate mCRC from primary ovarian cancer (OC). We conducted a multi-institutional, retrospective study of consecutive patients with ovarian mCRC who had undergone ultrasound examination using the International Ovarian Tumor Analysis (IOTA) terminology, with the addition of evaluating...
-
Study of various machine learning approaches for Sentinel-2 derived bathymetry
PublicationIn recent years precise and up-to-date information regarding seabed depth has become more and more important for companies and institutions that operate on coastlines. While direct, in-situ measurements are performed regularly, they are expensive, time-consuming and impractical to be performed in short time intervals. At the same time, an ever-increasing amount of satellite imaging data becomes available. With these images, it...
-
A Framework for Searching in Graphs in the Presence of Errors
PublicationWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Brief Announcement: Energy Constrained Depth First Search
PublicationDepth first search is a natural algorithmic technique for constructing a closed route that visits all vertices of a graph. The length of such route equals, in an edge-weighted tree, twice the total weight of all edges of the tree and this is asymptotically optimal over all exploration strategies. This paper considers a variant of such search strategies where the length of each route is bounded by a positive integer B (e.g. due...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...