Filtry
wszystkich: 1633
-
Katalog
- Publikacje 1167 wyników po odfiltrowaniu
- Czasopisma 40 wyników po odfiltrowaniu
- Konferencje 35 wyników po odfiltrowaniu
- Osoby 48 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 8 wyników po odfiltrowaniu
- Kursy Online 21 wyników po odfiltrowaniu
- Wydarzenia 5 wyników po odfiltrowaniu
- Dane Badawcze 308 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SPLIT GRAPHS
-
Video DATA - Traffic generation modeling for discount shops - Dragana Street
Dane BadawczeThe data includes video traffic data (vehicles, pedestrians, cyclists) registered at 27 Dragana street in Gdansk. The data covers the day 01.10.2020 at 6:00-22:00. The video camera was installed at the parking area belonging to the discount store Lidl. The data obtained was used in analysis, providing information about the modal split, the number of...
-
Dynamic fracture of brittle shells in a space-time adaptive isogeometric phase field framework
PublikacjaPhase field models for fracture prediction gained popularity as the formulation does not require the specification of ad-hoc criteria and no discontinuities are inserted in the body. This work focuses on dynamic crack evolution of brittle shell structures considering large deformations. The energy contributions from in-plane and out-of-plane deformations are separately split into tensile and compressive components and the resulting...
-
Autonomous Battery Drive in Trolleybuses: an Overview of Practical Examples
PublikacjaBattery electric buses are believed to be means of transportation of the future. However, despite the continuous development of electrochemical batteries technology and the multitude of electric buses on offer, it is still no proved solutions that can be widely used. Charging is the one of the weakness point of the electric buses. Trolleybuses are alternative for them. Especially, trolleybuses equipment with traction batteries...
-
Collision-Free Network Exploration
PublikacjaA 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...
-
Application of the Msplitmethod for filtering airborne laser scanning data-sets to estimate digital terrain models
PublikacjaALS point cloud filtering involves the separation of observations representing the physical terrain surface from those representing terrain details. A digital terrain model (DTM) is created from a subset of points representing the ground surface. The accuracy of the generated DTM is influenced by several factors, including the survey method used, the accuracy of the source data, the applied DTM generation algorithm, and the survey...
-
South African International Graph Theory Conference
Konferencje -
Michał Czubenko dr inż.
OsobyMichał Czubenko jest wyróżniającym się absolwentem z 2009 roku Wydziału Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej, specjalizującym się w dyscyplinie automatyka i robotyka. Obecnie pełni funkcję adiunkta w Katedrze Systemów Decyzyjnych i Robotyki tej samej uczelni. W 2012 roku odbył trzymiesięczny staż na Kingston University London, poszerzając swoje horyzonty w tej dziedzinie. Od obrony pracy magisterskiej...
-
The Complexity of Zero-Visibility Cops and Robber
PublikacjaIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
Polynomial triset metric for unrooted phylogenetic trees
Publikacjathe following paper presents a polynomial triset metric for unrooted phylogenetic trees (based on weighted bipartite graphs and the method of determining a minimum edge cover) and its basic characteristics. also a list of further directions of research and examples of the wider use of this metric is presented.
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublikacjaWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
ANYTIME POLYNOMIAL HEURISTIC ALGORITHM FOR PARTITIONING GROUPS OF DATA WITH PRESERVING CLASS PROPORTIONS FOR CROSS-VALIDATION
PublikacjaThe article describes a problem of splitting data for k-fold cross-validation, where class proportions must be preserved, with additional constraint that data is divided into groups that cannot be split into different cross-validation sets. This problem often occurs in e.g. medical data processing, where data samples from one patient must be included in the same cross-validation set. As this problem is NP-complete, a heuristic...
-
Magnetic field microsensor based on GaAs MESFET
PublikacjaA novel concept of the drain separation design in a horizontally-split-drain GaAs MAGFET sensor, based on epitaxial layer growth, was developed. Proper choice of GaAs/AlAs/GaAs epitaxial layer sequence provided good electrical isolation between the drain regions. The measured leakage current between the drain regions was in the range of nA for up to 2V drain voltage bias difference. Performed analytical and numerical calculations...
-
Brushing with additional cleaning restrictions
PublikacjaIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
International Conference on Image and Graphics
Konferencje -
Applied Perception in Graphics and Visualization
Konferencje -
Spring Conference on Computer Graphics
Konferencje -
TG and DTG profiles for plastics: LDPE, HDPE, PP, PD and PET
Dane BadawczeThe dataset includes:
-
Rust QA: question answering dataset for "The Rust Programming Language" in SQuAD 2.0 format
Dane BadawczeRust QA is a dataset for training and evaluating QA systems. The dataset consists of 1068 questions to "The Rust Programming Language" book (https://doc.rust-lang.org/stable/book/) with the answers provided as text spans from the book. The dataset is released in SQuAD 2.0 format.
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublikacjaWe consider the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical. Hence the only way to elect a leader among agents is by exploiting asymmetries in their initial positions in the graph. Agents do not know the graph or their positions in it, hence they must gain this knowledge by navigating in the graph...
-
On trees with double domination number equal to 2-outer-independent domination number plus one
PublikacjaA 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 double domination number of a graph G is the minimum cardinality of a double dominating set of G. For a graph G=(V,E), a subset D subseteq V(G) is a 2-dominating set if every vertex of V(G)D has at least two neighbors...
-
Krzysztof Kutt dr inż.
OsobyComputer scientist and psychologist trying to combine expertise from both disciplines into something cool. My research activity focuses on the development of affective HCI/BCI interfaces (based on multimodal fusion of signals and contextual data), methods for processing sensory data (including semantization of such data) and the development of knowledge-based systems (in particular knowledge graphs and semantic web systems).
-
Expedited two-objective dimension scaling of compact microwave passives using surrogate models
PublikacjaGeometry scaling of compact microwave structures is a challenging problem because of complex relationships between the physical dimensions and electrical characteristics, mostly caused by considerable cross-couplings in densely arranged layouts. Here, a procedure for expedited dimension scaling of compact microwave couplers with respect to two independent criteria has been presented. Our approach involves inverse surrogate models...
-
Design of a complex multiplier based on the convolution with the use of the polynomial residue number system
Publikacjazaproponowano realizację mnożnika zespolonego opartego na algorytmie dekompozycyjnym skavantzosa i stouraitisa. mnożenie zespolone jest wykonywane jako splot 8-punktowy. przedstawiono przykład obliczeniowy i architekturę mnożnika dla małych liczb.
-
Nonrelational Databases DE 2023_2024
Kursy OnlineThis course discusses three types of non-relational databases (i.e., document, graph, and key-value). The course is aimed at students in the 5th semester of data engineering.
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublikacjaA 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent 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, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total...
-
Analyzing sets of phylogenetic trees using metrics
PublikacjaThe reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetictrees...
-
Modified SPWM Technique with Zero-Sequence Voltage Injection for a Five-Phase, Three-Level NPC Inverter
PublikacjaThis article presents a modified sinusoidal pulse-width modulation (SPWM) scheme for a five-phase, three-level neutral-point-clamped inverter. The modulation scheme deploys a modified min–max function to inject the zero-sequence components into the reference modulating signals; hence enabling the effective utilization of the DC-link voltage. Balanced split-input DC-link voltages were achieved through further incorporation of adjustable...
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublikacjaThe 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
-
Modelling of Mechatronic Systems with Distributed Parameter Components
PublikacjaThe paper presents an uniform, port-based approach to modelling of both lumped and distributed parameter systems. Port-based model of distributed system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The computational package for the analysis of complex...
-
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...
-
CRVG - a new model for wireless networks topology generation
PublikacjaThis paper presents a new model of wireless network topology generator. Its main advantage is the possibility of relatively sparse networks generation. Because no iteration is needed, the model can be used for massive generation of networks for testing. The topological properties of produced graphs place them in the class of scale free networks, resembling real ones.
-
Shape-controllable synthesis of GdVO4 photocatalysts and their tunable properties in photocatalytic hydrogen generation
PublikacjaNovel visible light responsive materials for water splitting are essential for the efficient conversion of solar energy into hydrogen bond energy. Among other semiconductors, gadolinium orthovanadate has appropriate conduction and valence band edges positioned to split water molecules and a narrow band gap that allows the use of visible light for hydrogen generation. Thus, we present here that hydrogen evolution under visible light...
-
Engineering Graphics II, W/P, Design and Production engineering, sem. letni 2021/2022, (PG_00040167)
Kursy OnlineCourse for Engineering Graphics II classes of Design and Production engineering students
-
Southeastern International Conference on Combinatorics, Graph Theory, and Computing
Konferencje -
Kyoto International Conference on Computational Geometry and Graph Theory
Konferencje -
International Workshop on Graph-Theoretic Concepts in Computer Science
Konferencje -
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Detection, identification and determination of resveratrol in wine. Problems and challenges
PublikacjaResveratrol is a compound synthesized by plants in response to unfavorable conditions of growth like mechanical injury, siege of bacteria or fungi and UV exposure. It is concentrated mostly in grapes skin and further more in the products made from grapes especially red wines. Each wine is characterized by different amount of given stilbene since its occurrence is affected by many factors like: types of grapes, environment (climate,...
-
Non-relational Databases 2022/2023
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Non-relational Databases 2023/2024
Kursy OnlineThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
A Compact and Lightweight Microwave Tilt Sensor Based on an SRR-Loaded Microstrip Line
PublikacjaIn this paper, the symmetry property of split ring resonators (SRRs) is exploited to develop a tilt sensor. The sensor is composed of an SRR-loaded microstrip line operating at microwave frequencies. It is shown that the depth of notch in the reflection characteristic of the microstrip is a function of the tilt angle of the SRR. Thus, it can be used for sensing inclination. The sensor benefits from very compact size and light weight....
-
N-phosphonomethylglycine utilization by the psychrotolerant yeast Solicoccozyma terricola M 3.1.4.
PublikacjaSolicoccozymaterricolaM 3.1.4., the yeast strain isolated from soil sample from blueberry cultivation in MiedzyrzecPodlaski in Poland, is capable to split of phosphorus to nitrogen and nitrogen to carbon bonds inN-phosphono-methylglycine (PMG, glyphosate). The biodegradation process proceeds in the phosphate-independent manner. Itis the first example of a psychrotolerant yeast strain able to degrade PMGviaCeN bond cleavage accompanied...
-
Near Field Coupled Wireless Microwave Sensor
PublikacjaThis paper presents a wireless planar microwave sensor operating at industrial scientific and medical (ISM) frequency for the detection of dielectric materials. The microwave sensor consists of a reader (ground defected microstrip coupled line) and a passive tag where a complementary split-ring resonator (CSRR) is made on the commercially available copper-foil. The CSRR is a peel-off type tag that is excited using the near field...
-
Total chromatic sum for trees
PublikacjaThe total chromatic sum of a graph is the minimum sum of colors (natural numbers) taken over all proper colorings of vertices and edges of a graph. We provide infinite families of trees for which the minimum number of colors to achieve the total chromatic sum is equal to the total chromatic number. We construct infinite families of trees for which these numbers are not equal, disproving the conjecture from 2012.
-
Nonrelational Databases DE 2022_2023
Kursy OnlineWithin this course the four types of non-relational databases (i.e. document, graph, key-value and column-oriented) are discussed. The course is aimed at students of the 5th semester of data engineering.
-
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...
-
Continuation classes for a population model with harvesting. Case He-S1: Equal harvesting of juveniles and adults, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case Ha-S1: Harvesting adults only, survival rates of juveniles and adults add up to 1
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.
-
Continuation classes for a population model with harvesting. Case He-Se: Equal harvesting and equal survival rates of juveniles and adults
Dane BadawczeThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper "Global dynamics in a stage-structured discrete population model with harvesting" by E. Liz and P. Pilarczyk: Journal of Theoretical Biology, Vol. 297 (2012), pp. 148–165, doi: 10.1016/j.jtbi.2011.12.012.