Wyszukiwarka
Wyniki wyszukiwania dla: TREES.
-
Characterization of herbal teas containing lime flowers – Tiliae flos by HPTLC method with chemometric analysis
PublikacjaLinden trees are a source of food products called lime flowers (Tiliae flos), traditionally used in the form of infusion for the treatment of feverish colds and coughs. Lime flowers should include flowers of Tilia cordata Mill, T.x europaea L., and T. platyphyllos Scop. or a mixture of these. The aim of current research was to establish a fast, sensitive HPTLC (high-performance thin-layer chromatography) method that would allow...
-
DBpedia and YAGO Based System for Answering Questions in Natural Language
PublikacjaIn this paper we propose a method for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference) based on DBpedia and YAGO. Our method is based on generating dependency trees for the query. In the dependency tree we look for paths leading from the root to the named entity of interest. These paths (referenced further as fibers) are candidates for representation of actual user intention. The...
-
Experience-Driven Model of Decision-Making Processes in Project Teams
PublikacjaThis article presents a model of decision-making processes in project teams. Project teams constitute a specific type of organization appointed to implement a project. Decisions made by project teams result from the methods of project management and best management practices. The authors have undertaken the task of formalizing these processes using the classical method of constructing decision trees. It has been established that...
-
Collision-free network exploration
PublikacjaMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
-
Testing of Software for the Planning of a Linear Object GNSS Measurement Campaign under Simulated Conditions
PublikacjaThe 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...
-
Ranking Speech Features for Their Usage in Singing Emotion Classification
PublikacjaThis 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...
-
Perfect hashing with pseudo-minimal bottom-up deterministic tree automata
PublikacjaWe 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...
-
On the Hat Problem on the Cycle C7
PublikacjaThe 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...
-
Early warning models against bankruptcy risk for Central European and Latin American enterprises
PublikacjaThis 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...
-
Sridhar Gutam PhD
OsobyWorking as Senior Scientist (Plant Physiology) in the Agricultural Research Service of the Indian Council of Agricultural Research (ICAR). Currently posted at ICAR-Indian Institute of Horticultural Research (IIHR), Bengaluru in the division of ICAR-All India Coordinated Research Project on Fruits.. Apart from interests in Plant Physiology and Plant Phenology of fruit trees, I have interests in Open Science and Open Access to public...
-
Interactive Decision Making, Inżynieria Środowiska, Environmental Engineering, 2023/2024 (summer semester)
Kursy OnlineThe course is designed for students of MSc Studies in Environmental Engineering (studies in Polish and English) Person responsible for the subject, carrying out lectures and tutorials: mgr inż. Agata.Siemaszko; agata.siemaszko@pg.edu.pl The person conducting the lectures and tutorials: dr inż. Anna Jakubczyk-Gałczyńska; anna.jakubczyk@pg.edu.pl The course is conducted using the Project-Based Learning (PBL) method. It provides...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA 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
PublikacjaAbstract: 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|...
-
Assessing vehicle restraint systems on horizontal curves
PublikacjaHorizontal 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...
-
Scanning networks with cactus topology
PublikacjaThe 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...
-
Parity vertex colouring of graphs
PublikacjaA 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...
-
2-bondage in graphs
PublikacjaA 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...
-
Paired domination versus domination and packing number in graphs
PublikacjaGiven 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
PublikacjaOne 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...
-
Examining Statistical Methods in Forecasting Financial Energy of Households in Poland and Taiwan
PublikacjaThis 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...