Filters
total: 900
filtered: 720
Search results for: graph
-
A Novel Electrochemical Sensor Based on Graphene Oxide Nanosheets and Ionic Liquid Binder for Differential Pulse Voltammetric Determination of Droxidopa in Pharmaceutical and Urine Samples
Publication -
Application of polyethylene glycol-coated iron oxide nanoparticles for magnetic solid phase extraction of copper from seawater samples and its determination by graphite furnace atomic absorption spectrometry using response surface methodology for optimization of extraction
Publication -
Controllable Synthesis of 3D Hollow-Carbon-Spheres/Graphene-Flake Hybrid Nanostructures from Polymer Nanocomposite by Self-Assembly and Feasibility for Lithium-Ion Batteries
Publication -
N-doped graphene quantum dot-decorated MOF-derived yolk-shell ZnO/NiO hybrids to boost lithium and sodium ion battery performance
PublicationSurface engineering at the nanoscale to obtain robust interface between metal oxides and quantum dots is essential for improving the performance and stability of battery materials. Herein, we designed and prepared novel N-doped graphene quantum dot-modified ZnO/NiO anode materials with a well-defined yolk-shell structure for lithium and sodium-ion batteries. NG QDs were assembled on the ZnO/NiO microspheres using three different...
-
A hierarchical porous composite magnetic sorbent of reduced graphene oxide embedded in polyvinyl alcohol cryogel for solvent‐assisted‐solid phase extraction of polycyclic aromatic hydrocarbons
PublicationA hierarchical porouscomposite magnetic sorbent was fabricated and applied tothe dispersive solvent-assisted solid-phase extraction of five polycyclic aromatichydrocarbons. A sorbent was first prepared by incorporating graphene oxide,calcium carbonate, and magnetite nanoparticles into a polyvinyl alcohol cryo-gel. The graphene oxide was converted to reduced graphene oxide using ascorbicacid and a hierarchical porous structure was...
-
Mechanistic insights into the reactive radicals-assisted degradation of sulfamethoxazole via calcium peroxide activation by manganese-incorporated iron oxide–graphene nanocomposite: Formation of radicals and degradation pathway
Publication -
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...
-
Application of Box–Behnken design in the optimization of a simple graphene oxide/zinc oxide nanocomposite-based pipette tip micro-solid phase extraction for the determination of Rhodamine B and Malachite green in seawater samples by spectrophotometry
Publication -
Counting Lattice Paths With Four Types of Steps
Publication -
Certified domination
PublicationImagine that we are given a set D of officials and a set W of civils. For each civil x ∈ W, there must be an official v ∈ D that can serve x, and whenever any such v is serving x, there must also be another civil w ∈ W that observes v, that is, w may act as a kind of witness, to avoid any abuse from v. What is the minimum number of officials to guarantee such a service, assuming a given social network? In this paper, we introduce...
-
Detection and segmentation of moving vehicles and trains using Gaussian mixtures, shadow detection and morphological processing
PublicationSolution presented in this paper combines background modelling, shadow detection and morphological and temporal processing into one system responsible for detection and segmentation of moving objects recorded with a static camera. Vehicles and trains are detected based on their pixellevel difference from the continually updated background model utilizing a Gaussian mixture calculated separately for every pixel. The shadow detection...
-
Long range molecular dynamics study of interactions of the eukaryotic glucosamine-6-phosphate synthase with fructose-6-phosphate and UDP-GlcNAc
PublicationGlucosamine-6-phosphate synthase (EC 2.6.1.16) is responsible for catalysis of the first and practically irreversible step in hexosamine metabolism. The final product of this pathway, uridine 5 diphospho Nacetyl- d-glucosamine (UDP-GlcNAc), is an essential substrate for assembly of bacterial and fungal cell walls. Moreover, the enzyme is involved in phenomenon of hexosamine induced insulin resistance in type II diabetes, which...
-
Simplified AutoDock force field for hydrated binding sites
Publicationhas been extracted from the Protein Data Bank and used to test and recalibrate AutoDock force field. Since for some binding sites water molecules are crucial for bridging the receptor-ligand interactions, they have to be included in the analysis. To simplify the process of incorporating water molecules into the binding sites and make it less ambiguous, new simple water model was created. After recalibration of the force field on...
-
Visualizing spatially decomposed intermolecular correlations in the infrared spectra of aprotic liquids
PublicationInfrared (IR) spectroscopy is commonly used to study intermolecular interactions in the liquid phase, including solvation phenomena. On the other hand, ab initio molecular dynamics (AIMD) simulations offer the possibility to obtain IR spectra from first principles. Surpassing the experiment, AIMD simulations can deliver additional information on the spatial intermolecular correlations underlying the IR spectrum of the liquid. Although...
-
Designing Emergency-Medical-Service Helicopter Interiors Using Virtual Manikins
Publication -
Evaluation of the scale-consistent UNRES force field in template-free prediction of protein structures in the CASP13 experiment
Publication -
Use of the UNRES force field in template-assisted prediction of protein structures and the refinement of server models: Test with CASP12 targets
Publication -
Ensemble fits of restrained peptides’ conformational equilibria to NMR data. Dependence on force fields: AMBER/8 ff03 versus ECEPP/3
Publication -
Molecular dynamics-based model of VEGF-A and its heparin interactions
Publication -
Modeling protein structures with the coarse-grained UNRES force field in the CASP14 experiment
PublicationThe UNited RESidue (UNRES) force field was tested in the 14th Community Wide Experiment on the Critical Assessment of Techniques for Protein Structure Prediction (CASP14), in which larger oligomeric and multimeric targets were present compared to previous editions. Three prediction modes were tested (i) ab initio (the UNRES group), (ii) contact-assisted (the UNRES- contact group), and (iii) template-assisted (the UNRES-template...
-
Atmospheric degradation mechanism of anthracene initiated by OH•: A DFT prediction
PublicationDensity functional theory (DFT) calculations at the M06-2X/def2-TZVP level have been employed to investigate the atmospheric oxidation mechanism of anthracene (ANT) initiated by HO•. Direct hydrogen atom abstraction from the ANT using HO• takes place hardly at ambient conditions while the addition of HO• to the C1, C2, and C4 sites are thermodynamically and kinetically more advantageous. The addition reactions are controlled by...
-
Vector Field Editing and Periodic Orbit Extraction Using Morse Decomposition
Publication -
Applying Generative Modelling Tools to Explore Architectural Forms
PublicationThe digital generative methods open up new areas for exploration of formal and tectonic features, accentuate form’s ability to emerge and perform. They allow for automatic generation of variations of solutions, and digital production of “difficult” components of architectural forms using CNC technology.The paper deals with contemporary architectural explorations of complex , curvilinear surfaces in the context of generative...
-
Chosen Methods Supporting Didacts of Descriptive Geometry
PublicationThe article presents reflections on the practical ways of supporting the teaching processes of descriptive geometry in the context of psychological theories of learning and motivation.
-
Visualization of Spatial Issues in Adobe Acrobat 3D PDF
PublicationThe ability to capture and embed model information in a 3D PDF file and subsequently share it for free is highly needed in the education of descriptive geometry. The described technology and in particular inserting 3D models into the other files can improve the existing teaching materials. The strongest point of 3D PDF technology is that the model can be visualized and manipulated in multiple ways by viewers which enhance the...
-
Entasis- shape of beauty
PublicationTwo algorithms for the construction of entasis given by [2,3] are examined in this study. It has been shown, that those shapes are not an ellipse for which they were considered by the authors, but another curves.
-
From a Point Cloud to a 3D Model - an Exercise for Users of AutoCAD and Revit
PublicationThe paper presents a proposal of the topic of an exercise for students of building faculties as part of classes on 3D modelling. The task consists in creating a three-dimensional model based on the measurement obtained with the Leica P30 laser scanner. Due to the maximum number of points in the cloud in the presented programs, the output files must be properly cleared and reduced. The point cloud was pre-processed in Cyclone software....
-
THE PANTOGRAPH AND ITS GEOMETRIC TRANSFORMATIONS - A FORMER POPULAR TOOL FOR COPYING AND SCALING
PublicationDevelopment of digital technology has resulted in significant transformations of designer workshops. Computer applications replaced the previously existing tools and methods for drawing up of projects. Professional, sophisticated drawing instruments and tools for manual plotting, as well as basic drawing aids, have gradually fallen into oblivion and become relicts of a bygone era - the objects of collectors' interest. Gdansk University...
-
Examples of Original Descriptive Geometry Task Items
PublicationThe paper presents several descriptive geometry drawing tasks and a comprehensive approach to their evaluation. The results as the task profile include the most important features and enable interpretation of the tasks in the educational system.
-
Descriptive geometry tasks with computer aided design for geodesy and cartography
PublicationZasady rzutowania topograficznego i środkowego stanowią teoretyczną podstawę dla kluczowych przedmiotów zawodowych na kierunku Geodezja i Kartografia, dlatego dobór zarówno treści nauczania jak i konkretnych zadań ćwiczeniowo-projektowych w ramach geometrii wykreślnej jest szczególnie istotny. W artykule na przykładzie tematów zadań rysunkowych omówiono zakres tematyczny z perspektywy dla danego kierunku studiów oraz sposoby jego...
-
Preparation of Descriptive Geometry Course in English
PublicationW artykule przedstawiono wybrane różnice stosowane w zapisie konstrukcji geometrycznych w podręcznikach do geometrii wykreślnej w różnych krajach.
-
Selection of descriptive geometry textbooks
PublicationW artykule przedstawiono koncepcję badania podręczników do geometrii wykreślnej bazującą na psycholingwistycznej teorii komunikatu. Zaprezentowane podejście umożliwia analizę podręczników na sześciu poziomach odnoszących się do głównych funkcji komunikacji międzyludzkiej. W artykule skupiono się na postrzeganiu językowej funkcji podręczników geometrii wykreślnej i w tym zakresie stwierdzono wiele cech zbieżnych.
-
Cienie i cieniowanie w grafice komputerowej
PublicationW artykule poruszono kwestie dotyczące tworzenia cieni i światłocieni w gra-fice komputerowej. Przywołano popularne algorytmy do generowania cieni orazich relacje z metodami wykreślnymi. Ponadto omówiono specyfikę i niektóremożliwości przykładowego programu (3DStudio Viz 3) w tym zakresie.
-
Between Descriptive Geometry and CAD 3D
PublicationDescriptive geometry provides methods to analyse three-dimensional space through two-dimensional drawings and prepares to create technical documentation. Geometric form of an engineering project is presented by the means of projection methods based on a 3D model, which is present in designer’s imagination. The forthcoming era of Building Information Modelling (BIM) brings changes in the way the engineer works, as the vision is...
-
Modeling BIM Objects From Point Clouds. Examples
PublicationThe article presents several ways to obtain BIM (Building Information Modeling) models from point clouds using standard commands in Revit 2018. In Revit geometric forms are possible to obtain in project, family or conceptual environments. Efficient modeling requires knowledge of methods of creating families and components in these environments and ways to combine them. Modeling methods with system and loadable families are presented,...
-
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...
-
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...
-
The hat problem on cycles on at least nine vertices
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 winning. In this version every player...
-
On trees with double domination number equal to total domination number plus one
PublicationA 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,...
-
Infinite chromatic games
PublicationIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe 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
PublicationWe 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...
-
Brushing with additional cleaning restrictions
PublicationIn 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...
-
Leader election for anonymous asynchronous agents in arbitrary networks
PublicationWe 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
PublicationA 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...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 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...
-
Bounds on the Cover Time of Parallel Rotor Walks
PublicationThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node maintains a cyclic ordering of its outgoing arcs, and successively propagates walkers which visit it along its outgoing arcs in...
-
On the ratio between 2-domination and total outer-independent domination numbers of trees
PublicationA 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...
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublicationThe 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
-
An upper bound for the double outer-independent domination number of a tree
PublicationA 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...