Filtry
wszystkich: 2871
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: FUZZY SET QCA
-
Comparison of selected electroencephalographic signal classification methods
PublikacjaA variety of methods exists for electroencephalographic (EEG) signals classification. In this paper, we briefly review selected methods developed for such a purpose. First, a short description of the EEG signal characteristics is shown. Then, a comparison between the selected EEG signal classification methods, based on the overview of research studies on this topic, is presented. Examples of methods included in the study are: Artificial...
-
Voltage control in a power system with renewable sources of energy
PublikacjaIntensive development of distributed generation in power systems, caused by the European Union energy policy, gives possibility for improving safety in power delivery as well as optimizing the costs of the systems functioning. In this context, distributed generation can be used for voltage control in power systems – it can be performed by the control of reactive power of each source of energy or a group of energy sources. This...
-
Data on LEGO sets release dates and worldwide retail prices combined with aftermarket transaction prices in Poland between June 2018 and June 2023
PublikacjaThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction. The data spans the timeframe from June 2018 to June 2023. The data was obtained from three sources: Brickset.com (LEGO sets retail prices, release dates, and IDs), Lego.com official web page (ID number of each set that was released by Lego, its retail prices, the current status of the set) and promoklocki.pl web page (the retail...
-
Personalized avatar animation for virtual reality
PublikacjaThe paper presents a method for creating a personalized animation of avatar for virtual reality application such as multiplayer on-line games. Animation is stored in a simplified version, containing only keyframes for important avatar poses. This version defines key movements, i.e. roughly describes the avatar's action. Animation is enriched by the user with new motion phases utilizing fuzzy descriptors.Various degrees of motion...
-
Data on LEGO sets release dates and retail prices combined with aftermarket transaction prices between June 2018 and June 2023.
Dane BadawczeThe dataset contains LEGO bricks sets item count and pricing history for AI-based set pricing prediction.
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(G)) is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
An upper bound for the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent 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, and the set V(G)\D is independent. The double outer-independent domination number of a graph G, denoted by γ_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We prove...
-
2-outer-independent domination in graphs
PublikacjaWe initiate the study of 2-outer-independent domination in graphs. A 2-outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)\D has at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two,...
-
Multicriteria Evolutionary Weather Routing Algorithm in Practice
PublikacjaThe Multicriteria Evolutionary Weather Routing Algorithm (MEWRA) has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid-propulsion or motor-driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization...
-
Designing control strategies of aeration system in biological WWTP
PublikacjaThe paper presents the complete design processes of a novel aeration control systems in the SBR (Sequencing Batch Reactor) wastewater treatment plant (WWTP). Due to large energy expense and high influence on biological processes, the aeration system plays a key role in WWTP operation. The paper considers the aeration system for a biological WWTP located in the northeast of Poland. This system consists of blowers, the main collector...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Rule-Based Model for Selecting Integration Technologies for Smart Cities Systems
PublikacjaThe aim of this article is to present the stages of development for an information technology integration model for the design of systems for smart cities. The Introduction explains the need for integration technologies and presents a model for selecting integration technologies and the conditions for its use in designing smart cities systems. Then two verification stages of the presented model are discussed. In the first stage,...
-
INDICES FOR ASSESSING POTENTIAL ENVIRONMENTAL HAZARD FROM FUTURE SHIP SCRAPPING PROCESS, DETERMINABLE IN SHIP DESIGN STAGE
PublikacjaThis paper shortly presents the issue of utilization of ships after their withdrawal from service. Information on number of floating units liquidated in previous years was presented. Hazards to the environment , health and life of workers employed in the Far East ship scrapping yards operating on the beaches, were indicated. Then, the most important rules which have to make the ship recycling process safe were referred to. This...
-
A lower bound on the double outer-independent domination number of a tree
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A double outer-independent 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, and the set V(G)D is independent. The double outer-independent domination number of a graph G, denoted by gamma_d^{oi}(G), is the minimum cardinality of a double outer-independent dominating set of G. We...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
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...
-
Optimizing FSO networks resilient to adverse weather conditions by means of enhanced uncertainty sets
PublikacjaThis work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry...
-
Gesture-based computer control system applied to the interactive whiteboard
PublikacjaIn the paper the gesture-based computer control system coupled with the dedicated touchless interactive whiteboard is presented. The system engineered enables a user to control any top-most computer application by using one or both hands gestures. First, a review of gesture recognition applications with a focus on methods and algorithms applied is given. Hardware and software solution of the system consisting of a PC, camera, multimedia...
-
Gesture-based computer control system applied to the interactive whiteboard
PublikacjaIn the paper the gesture-based computer control system coupled with the dedicated touchless interactive whiteboard is presented. The system engineered enables a user to control any top-most computer application by using one or both hands gestures. First, a review of gesture recognition applications with a focus on methods and algorithms applied is given. Hardware and software solution of the system consisting of a PC, camera, multimedia...
-
A modelling approach to the transport support for the harvesting and transportation complex under uncertain conditions
PublikacjaThe article proposes a modelling approach based on structural and parametric identification of the transport support of the harvesting and transportation complex. The efficiency and effectiveness of the proposed methods of structural and parametric identification for the development of a system for harvesting and transportation complex operation has been proved. A mathematical model based on fuzzy logic has been developed. It reflects...
-
The dynamic signature verification using population-based vertical partitioning
PublikacjaThe dynamic signature is an attribute used in behavioral biometrics for verifying the identity of an individual. This attribute, apart from the shape of the signature, also contains information about the dynamics of the signing process described by the signals which tend to change over time. It is possible to process those signals in order to obtain descriptors of the signature characteristic of an individual user. One of the methods...
-
Dynamic Bankruptcy Prediction Models for European Enterprises
PublikacjaThis manuscript is devoted to the issue of forecasting corporate bankruptcy. Determining a firm’s bankruptcy risk is one of the most interesting topics for investors and decision-makers. The aim of the paper is to develop and to evaluate dynamic bankruptcy prediction models for European enterprises. To conduct this objective, four forecasting models are developed with the use of four different methods—fuzzy sets, recurrent and...
-
Bounds on the vertex-edge domination number of a tree
PublikacjaA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Thermodynamic Cycles of Air Microturbine Power Plants Working on Biomass Fuels
PublikacjaThe gas turbine engine is modified to work as an air turbine set which consists, in the simplest arrangement, of a compressor, a heat exchanger and a turbine. Air is a working medium for both: the compressor and the turbine. This kind of air turbine set can be applied in power plants working on biomass fuels. In this solution we can burn fuels of varying parameters in the external combustion chamber without any harmful effects...
-
On trees with double domination number equal to 2-domination number plus one
PublikacjaA vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating,...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a 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. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...
-
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...
-
Interpolation properties of domination parameters of a graph
PublikacjaAn integer-valued graph function π is an interpolating function if a set π(T(G))={π(T): T∈TT(G)} consists of consecutive integers, where TT(G) is the set of all spanning trees of a connected graph G. We consider the interpolation properties of domination related parameters.
-
Teoria zbiorów rozmytych w zarządzaniu ryzykiem jako utylitarne narzędzie systemu zarządzania jakością
PublikacjaDziałalność przedsiębiorstwa wiąże się z potrzebą analizowania ryzyka oddziałującego na procesy firmy. Norma PN-EN ISO 9001:2015 dokonuje identyfikacji czynników ryzyka i ich wpływu na jakość wyrobu. W szacowaniu ryzyka punktowe oceny wyrażające subiektywne opinie zastępowane są coraz częściej formalnym zapisem niepewności. Artykuł ukazuje zastosowanie rozmytego systemu wnioskującego w procesie zarządzania ryzykiem, umożliwiającego...
-
Independent Domination Subdivision in Graphs
PublikacjaA 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...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Weakly connected Roman domination in graphs
PublikacjaA Roman dominating function on a graph G=(V,E) is defined to be a function f :V → {0,1,2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v)=2. A dominating set D⊆V is a weakly connected dominating set of G if the graph (V,E∩(D×V)) is connected. We define a weakly connected Roman dominating function on a graph G to be a Roman dominating function such that the set...
-
A remark on singular sets of vector bundle morphisms
PublikacjaIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
All graphs with paired-domination number two less than their order
PublikacjaLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
Color-based Detection of Bleeding in Endoscopic Images
PublikacjaIn this paper a color descriptor designed for bleeding detection in endoscopic images is proposed. The development of the algorithm was carried out on a representative training set of 36 images of bleeding and 25 clear images. Another 38 bleeding and 26 normal images were used in the final stage as a test set. All of the considered images were extracted from separate endoscopic examinations. The experiments include color distribution...
-
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|...
-
Energy, water detailed usage. Living lab testing for sustainable urban food-water-energy cycle.
Dane BadawczeData set contains detailed, continuous measurements of the usage of water and electrical energy (AC power) in an experimental facility set up in a scientific laboratory (Laboratorium im. B.Niemkiewicza) at the Faculty of Mechanical Engineering and Ocean Technology of the Gdansk University of Technology. The test bed was established in co-operation...
-
Comparing Arbitrary Unrooted Phylogenetic Trees Using Generalized Matching Split Distance
PublikacjaIn the paper, we describe a method for comparing arbitrary, not necessary fully resolved, unrooted phylogenetic trees. Proposed method is based on finding a minimum weight matching in bipartite graphs and can be regarded as a generalization of well-known Robinson-Foulds distance. We present some properties and advantages of the new distance. We also investigate some properties of presented distance in a common biological problem...
-
Extending touch-less interaction with smart glasses by implementing EMG module
PublikacjaIn this paper we propose to use temporal muscle contraction to perform certain actions. Method: The set of muscle contractions corresponding to one of three actions including “single-click”, “double-click” “click-n-hold” and “non-action” were recorded. After recording certain amount of signals, the set of five parameters was calculated. These parameters served as an input matrix for the neural network. Two-layer feedforward neural...
-
Application of algorithms for reasoning from imperfect knowledge in it evaluation environment
PublikacjaThe paper describes concept of building multi-agent system dedicated for information technology evaluation or selection for IT enterprises management (IT_MAS). Authors present the model of Knowledge Processing Environment, which is one of main components of the solution. Either facts or rules will be based on IT specialists' experience. However, knowledge which is being acquisited from IT domain is mostly imperfect - uncertain...
-
Controlling computer by lip gestures employing neural network
PublikacjaResults of experiments regarding lip gesture recognition with an artificial neural network are discussed. The neural network module forms the core element of a multimodal human-computer interface called LipMouse. This solution allows a user to work on a computer using lip movements and gestures. A user face is detected in a video stream from a standard web camera using a cascade of boosted classifiers working with Haar-like features....
-
Human-Computer Interface Based on Visual Lip Movement and Gesture Recognition
PublikacjaThe multimodal human-computer interface (HCI) called LipMouse is presented, allowing a user to work on a computer using movements and gestures made with his/her mouth only. Algorithms for lip movement tracking and lip gesture recognition are presented in details. User face images are captured with a standard webcam. Face detection is based on a cascade of boosted classifiers using Haar-like features. A mouth region is located in...
-
Energy, water detailed usage. Living lab testing for sustainable urban food-water-energy cycle. Jan. 2022
Dane BadawczeData set contains detailed, continuous measurements of the usage of water and electrical energy (AC power) in an experimental facility set up in a scientific laboratory (Laboratorium im. B.Niemkiewicza) at the Faculty of Mechanical Engineering and Ocean Technology of the Gdansk University of Technology. The test bed was established in co-operation...
-
Energy, water detailed usage. Living lab testing for sustainable urban food-water-energy cycle. Dec. 2021
Dane BadawczeData set contains detailed, continuous measurements of the usage of water and electrical energy (AC power) in an experimental facility set up in a scientific laboratory (Laboratorium im. B.Niemkiewicza) at the Faculty of Mechanical Engineering and Ocean Technology of the Gdansk University of Technology. The test bed was established in co-operation...
-
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...
-
Induction of the common-sense hierarchies in lexical data
PublikacjaUnsupervised organization of a set of lexical concepts that captures common-sense knowledge inducting meaningful partitioning of data is described. Projection of data on principal components allow for dentification of clusters with wide margins, and the procedure is recursively repeated within each cluster. Application of this idea to a simple dataset describing animals created hierarchical partitioning with each clusters related...
-
Comparison of Methods for Real and Imaginary Motion Classification from EEG Signals
PublikacjaA method for feature extraction and results of classification of EEG signals obtained from performed and imagined motion are presented. A set of 615 features was obtained to serve for the recognition of type and laterality of motion using 8 different classifications approaches. A comparison of achieved classifiers accuracy is presented in the paper, and then conclusions and discussion are provided. Among applied algorithms the...
-
Domination-Related Parameters in Rooted Product Graphs
PublikacjaAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.