Filtry
wszystkich: 2626
-
Katalog
- Publikacje 2086 wyników po odfiltrowaniu
- Czasopisma 62 wyników po odfiltrowaniu
- Konferencje 55 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 71 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Kursy Online 15 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 328 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: GRAPH NEURAL NETWORK
-
Video of LEGO bricks on conveyor belt - Technic axles
Dane BadawczeThe set contains videos of LEGO bricks (Technic axles) moving on a white conveyor belt. The videos were prepared for training neural network for recognition of LEGO bricks. The bricks were separated as much as possible and in most cases they should not overlap. The images were taken from different sides by stationary camera located over the final conveyor...
-
International Conference on Network Protocols
Konferencje -
International Conference on Network Softwarization
Konferencje -
Multimedia and Network Information Systems
Konferencje -
International Network Optimization Conference
Konferencje -
IEEE Intell Network Workshop
Konferencje -
Pose-Invariant Face Detection by Replacing Deep Neurons with Capsules for Thermal Imagery in Telemedicine
PublikacjaAbstract— The aim of this work was to examine the potential of thermal imaging as a cost-effective tool for convenient, non- intrusive remote monitoring of elderly people in different possible head orientations, without imposing specific behavior on users, e.g. looking toward the camera. Illumination and pose invariant head tracking is important for many medical applications as it can provide information, e.g. about vital signs, sensory...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Progress on Roman and Weakly Connected Roman Graphs
PublikacjaA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Artificial Neural Networks in Engineering Conference
Konferencje -
European Symposium on Artificial Neural Networks
Konferencje -
IEEE International Conference on Neural Networks
Konferencje -
International Conference on Artificial Neural Networks
Konferencje -
International Conference on Neural Information Processing
Konferencje -
User Orientation Detection in Relation to Antenna Geometry in Ultra-Wideband Wireless Body Area Networks Using Deep Learning
PublikacjaIn this paper, the issue of detecting a user’s position in relation to the antenna geometry in ultra-wideband (UWB) off-body wireless body area network (WBAN) communication using deep learning methods is presented. To measure the impulse response of the channel, a measurement stand consisting of EVB1000 devices and DW1000 radio modules was developed and indoor static measurement scenarios were performed. It was proven that for...
-
THE ROLE OF INFERENCE IN MOBILE MEDICAL APPLICATION DESIGN
PublikacjaIn the early 21st century, artificial intelligence began to be used to process medical information. However, before this happened, predictive models used in healthcare could only consider a limited number of variables, and only in properly structured and organised medical data. Today, advanced tools based on machine learning techniques - which, using artificial neural networks, can explore extremely complex relationships - and...
-
Joanna Czerska dr inż.
OsobyJoanna Czerska jestem człowiekiem, którego misją i pasją jest rozwój ludzi i organizacji. Moje motto to: „Nie ma takiej fantazji, której wola i rozum ludzki nie zdołałby przekształcić w rzeczywistość.” William Shakespeare W życiu kieruję się wartościami szacunku, pracy zespołowej i pozytywnego nastawienia. To one mnie definiują i decydują o tym jakim jest człowiekiem.Moja przygoda z Lean rozpoczęła się, podczas pisania pracy...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Dane BadawczeFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
CNN Architectures for Human Pose Estimation from a Very Low Resolution Depth Image
PublikacjaThe paper is dedicated to proposing and evaluating a number of convolutional neural network architectures for calculating a multiple regression on 3D coordinates of human body joints tracked in a single low resolution depth image. The main challenge was to obtain a high precision in case of a noisy and coarse scan of the body, as observed by a depth sensor from a large distance. The regression network was expected to reason about...
-
Comparison of image pre-processing methods in liver segmentation task
PublikacjaAutomatic liver segmentation of Computed Tomography (CT) images is becoming increasingly important. Although there are many publications in this field there is little explanation why certain pre-processing methods were utilised. This paper presents a comparison of the commonly used approach of Hounsfield Units (HU) windowing, histogram equalisation, and a combination of these methods to try to ascertain what are the differences...
-
Dynamic F-free Coloring of Graphs
PublikacjaA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Video of LEGO bricks on conveyor belt - Special Brics
Dane BadawczeThe set contains videos of LEGO bricks (special bricks, with additional connectors etc.) moving on a white conveyor belt. The videos were prepared for training neural network for recognition of LEGO bricks. The bricks were separated as much as possible and in most cases they should not overlap. The images were taken from different sides by stationary...
-
Video of LEGO bricks on conveyor belt - Wide Brics
Dane BadawczeThe set contains videos of LEGO bricks (wide bricks, with each side having more than 1 stud) moving on a white conveyor belt. The videos were prepared for training neural network for recognition of LEGO bricks. The bricks were separated as much as possible and in most cases they should not overlap. The images were taken from different sides by stationary...
-
Video of LEGO bricks on conveyor belt - minifigures, animals, plants and accessories
Dane BadawczeThe set contains videos of LEGO bricks (minifigures, animals, plants and accessories) moving on a white conveyor belt. The images were prepared for training neural network for recognition of LEGO bricks. The bricks were separated as much as possible and in most cases they should not overlap. The images were taken from different sides by stationary camera...
-
Video of LEGO bricks on conveyor belt - Narrow Brics
Dane BadawczeThe set contains videos of LEGO bricks (narrow bricks, with on side no wider than 1 stud) moving on a white conveyor belt. The videos were prepared for training neural network for recognition of LEGO bricks. The bricks were separated as much as possible and in most cases they should not overlap. The images were taken from different sides by stationary...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Dane BadawczeFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Deep Learning Basics 2023/24
Kursy OnlineA course about the basics of deep learning intended for students of Computer Science. It includes an introduction to supervised machine learning, the architecture of basic artificial neural networks and their training algorithms, as well as more advanced architectures (convolutional networks, recurrent networks, transformers) and regularization and optimization techniques.
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Dane BadawczeFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Deep-Learning-Based Precise Characterization of Microwave Transistors Using Fully-Automated Regression Surrogates
PublikacjaAccurate models of scattering and noise parameters of transistors are instrumental in facilitating design procedures of microwave devices such as low-noise amplifiers. Yet, data-driven modeling of transistors is a challenging endeavor due to complex relationships between transistor characteristics and its designable parameters, biasing conditions, and frequency. Artificial neural network (ANN)-based methods, including deep learning...
-
The trajectories of the financial crisis of companies at risk of bankruptcy
PublikacjaThis article concerns the assessment of the trajectory of the collapse of enterprises in Central Europe. The author has developed a model of a Kohonen artificial neural network. This model was used to determine 6 different classes of risk and was allowed to graphically determine the 5- to 10-year trajectory of going bankrupt. The study used data on 140 companies listed on the Warsaw Stock Exchange. This population was divided into...
-
Deep Learning-Based LOS and NLOS Identification in Wireless Body Area Networks
PublikacjaIn this article, the usage of deep learning (DL) in ultra-wideband (UWB) Wireless Body Area Networks (WBANs) is presented. The developed approach, using channel impulse response, allows higher efficiency in identifying the direct visibility conditions between nodes in off-body communication with comparison to the methods described in the literature. The effectiveness of the proposed deep feedforward neural network was checked on...
-
LSTM-based method for LOS/NLOS identification in an indoor environment
PublikacjaDue to the multipath propagation, harsh indoor environment significantly impacts transmitted signals which may adversely affect the quality of the radiocommunication services, with focus on the real-time ones. This negative effect may be significantly reduced (e.g. resources management and allocation) or compensated (e.g. correction of position estimation in radiolocalisation) by the LOS/NLOS identification algorithm. This paper...
-
Vehicle classification based on soft computing algorithms
PublikacjaExperiments and results regarding vehicle type classification are presented. Three classes of vehicles are recognized: sedans, vans and trucks. The system uses a non-calibrated traffic camera, therefore no direct vehicle dimensions are used. Various vehicle descriptors are tested, including those based on vehicle mask only and those based on vehicle images. The latter ones employ Speeded Up Robust Features (SURF) and gradient images...
-
Wstępne wyniki badań dostępności sieci ASG-Eupos podczas inwentaryzacji trasy kolejowej Kościerzyna - Kartuzy = Preliminary research results of ASG-Eupos network availability during surveying of Kościerzyna-Kartuzyrailway route
PublikacjaW artykule przedstawiono wyniki pomiarów dostępności określonej wartości błędu współrzędnych, wyznaczonych przy wykorzystaniu sieci ASG-EUPOS, uzyskane podczas pomiarów inwentaryzacyjnych testowego odcinka linii kolejowej. Pomiary z wykorzystaniem4 odbiorników GNSS przeprowadzono w miesiącu lutym bieżącego roku na odcinku trasy kolejowej Kościerzyna - Kartuzy. Program badań zakładał montaż, na pokładzie platformy kolejowej napędzanej...
-
Data augmentation for improving deep learning in image classification problem
PublikacjaThese days deep learning is the fastest-growing field in the field of Machine Learning (ML) and Deep Neural Networks (DNN). Among many of DNN structures, the Convolutional Neural Networks (CNN) are currently the main tool used for the image analysis and classification purposes. Although great achievements and perspectives, deep neural networks and accompanying learning algorithms have some relevant challenges to tackle. In this...
-
Andrzej Stateczny prof. dr hab. inż.
OsobyProf. dr hab. inż. Andrzej Stateczny jest profesorem Politechniki Gdańskiej i prezesem firmy Marine Technology Ltd. Jego zainteresowania naukowe koncentrują się głównie wokół nawigacji, hydrografii i geoinformatyki. Obecnie prowadzone badania obejmują nawigację radarową, nawigację porównawczą, hydrografię, metody sztucznej inteligencji w zakresie przetwarzania obrazów i fuzji danych wielosensorycznych. Był kierownikiem lub głównym...
-
Optimized Computational Intelligence Model for Estimating the Flexural Behavior of Composite Shear Walls
PublikacjaThis article presents a novel approach to estimate the flexural capacity of reinforced concrete-filled composite plate shear walls using an optimized computational intelligence model. The proposed model was developed and validated based on 47 laboratory data points and the Transit Search (TS) optimization algorithm. Using 80% of the experimental dataset, the optimized model was selected by determining the unknown coefficients of...
-
On trees with double domination number equal to total domination number plus one
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. A vertex of a graph is said to dominate itself and all of its neighbors. A double 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. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe 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....
-
Comparative study on total nitrogen prediction in wastewater treatment 1 plant and effect of various feature selection methods on machine learning algorithms performance
PublikacjaWastewater characteristics prediction in wastewater treatment plants (WWTPs) is valuable and can reduce the number of sampling, energy, and cost. Feature Selection (FS) methods are used in the pre-processing section for enhancing the model performance. This study aims to evaluate the effect of seven different FS methods (filter, wrapper, and embedded methods) on enhancing the prediction accuracy for total nitrogen (TN) in the WWTP...
-
South African International Graph Theory Conference
Konferencje -
Colorings of the Strong Product of Circulant Graphs
PublikacjaGraph coloring is one of the famous problems in graph theory and it has many applications to information theory. In the paper we present colorings of the strong product of several circulant graphs.
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublikacjaAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Video of LEGO bricks on conveyor belt - wheels, tires and caterpillars
Dane BadawczeThe set contains videos of LEGO bricks (wheels, tires and caterpillars) moving on a white conveyor belt. The images were prepared for training neural network for recognition of LEGO bricks. The bricks were separated as much as possible and in most cases they should not overlap. The images were taken from different sides by stationary camera located...
-
Style Transfer for Detecting Vehicles with Thermal Camera
PublikacjaIn this work we focus on nighttime vehicle detection for intelligent traffic monitoring from the thermal camera. To train a Convolutional Neural Network (CNN) detector we create a stylized version of COCO (Common Objects in Context) dataset using Style Transfer technique that imitates images obtained from thermal cameras. This new dataset is further used for fine-tuning of the model and as a result detection accuracy on images...
-
A collection of directed graphs for the minimum cycle mean weight computation
Dane BadawczeThis 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...
-
Pancreatic neuroendocrine neoplasms — update of the diagnostic and therapeutic guidelines (recommended by the Polish Network of Neuroendocrine Tumours) [Nowotwory neuroendokrynne trzustki — uaktualnione zasady diagnostyki i leczenia (rekomendowane przez Polską Sieć Guzów Neuroendokrynych)]
Publikacja -
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublikacjaWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.