Filters
total: 2824
filtered: 2377
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: OPTICAL GLYPHS
-
Design of Cost-Efficient Optical Fronthaul for 5G/6G Networks: An Optimization Perspective
PublicationCurrently, 5G and the forthcoming 6G mobile communication systems are the most promising cellular generations expected to beat the growing hunger for bandwidth and enable the fully connected world presented by the Internet of Everything (IoE). The cloud radio access network (CRAN) has been proposed as a promising architecture for meeting the needs and goals of 5G/6G (5G and beyond) networks. Nevertheless, the provisioning of cost-efficient...
-
Impact of temperature on optical sensing in biology based on investigation of SARS‐CoV ‐2
PublicationIn this paper, we present an investigation of the influence of the temperature on the sensing of biological samples. We used biofunctionalized microsphere-based fiber-optic sensor to detect immunoglobulin G attached to the sensor head at temperatures relevant in biological research: 5°C, 25°C, and 55°C. The construction of the sensor allowed us to perform measurements in the small amount of solution. The results of our experiment...
-
A new optimal algorithm for a time-dependent scheduling problem
PublicationIn this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then...
-
Generation of Optimal Process Plan Alternatives for ManufacturingMechanical Components
PublicationOmówiono aktualny stan wiedzy dotyczący wykorzystania systemów komputerowo wspomaganego projektowania procesów technologicznych - CAPP. Przedstawiono problemy związane z integracją systemów CAPP z systemami CAD. Omówiono założenia dla generowania optymalnych wariantów procesów wytwarzania z zastosowaniem modułów technologicznych tzw. features, wg metody gałęzi i ograniczceń (ang. branch-and-bound).
-
Optimal and safe control planning with the use of discrete optimization
PublicationW opracowaniu zaproponowano metodę projektowania optymalnych i tolerujących uszkodzenia systemów sterowania opartych na wykorzystaniu algorytmów optymalizacji dyskretnej. Publikacja przedstawia potencjalne wady i zalety metody. Główna idea proponowanego algorytmu sprowadza się do wykorzystania struktury grafu przepływowego w celu stworzenia reprezentacji dynamiki własnej danego procesu. Poszukiwana trajektoria optymalna, jeśli...
-
Motion stability during optimal control of the mobile platform
PublicationPraca przedstawia metodę badania stabilności robotów mobilnych podczas sterowania optymalnego na przykładzie 3-kołowej platformy mobilnej. Robot posiada więzy nieholonomiczne. Model matematyczny 3-kołowej platformy mobilnej opisuje skończona liczba nieliniowych równań różniczkowych. Stąd, prognozowanie stabilności ruchu takiego obiektu wymaga zastosowania efektywnych algorytmów.
-
Energy-Optimal Data Aggregation and Dissemination for the Internet of Things
Publication -
Optimal linear control theory in power system application
PublicationPrzedstawiono syntezę stabilizatora systemowego przy wykorzystaniu metodyki Hinf. Zaprojektowany regulator umożliwia uzyskanie lepszych rezultatów w porównaniu z regulatorem odniesienia w szerokim zakresie zmian punktu pracy.
-
The spindle speed optimal control in modern milling operations.
PublicationPraca dotyczy modeli obrabiarek ze sprzężeniem zwrotnym, w przypadku których istotne znaczenie mają drgania samowzbudne typu chatter. Opis układu drgającego przedstawiono w postaci dynamiki układu sterowanego, przy czym sygnałem sterującym jest chwilowa zmiana prędkości obrotowej wrzeciona. Rozważano frezowanie czołowe smukłym frezem trzpieniowym na pionowym cent rum frezarskim. Przedstawiono rezultaty przykładów symulacji komputerowych....
-
Optimal asynchronous estimation of 2D Gaussian-Markov processes
PublicationW artykule rozważa się problem estymacji trajektorii dwuwymiarowych ciągłoczasowych procesów Gaussa-Markowa na podstawie zaszumionych pomiarów wykonywanych w nierównomiernie rozłożonych chwilach czasu. W przypadku takiego problemu, w każdym cyklu pracy algorytmu należy dokonać dyskretnoczasowej predykcji (analogicznie jak w przypadku filtru Kalmana). Niestety zadanie to może być złożone obliczeniowo. Aby rozwiązać ten problem,...
-
Chatter surveillance with the creation of a map of optimal spindle speeds
PublicationW pracy przedstawiono metodę nadzorowania drgań samowzbudnych typu chatter. Wyznaczono wartości optymalnych prędkości obrotowych wrzeciona dla poszczególnych punktów na powierzchni przedmiotu obrabianego, wykorzystując rożne techniki analizy modalnej. Badania eksperymentalne wykazały, że otrzymana w ten sposób mapa optymalnych prędkości obrotowych wrzeciona jest skutecznym narzędziem do eliminacji drgań chatter w procesie obróbki...
-
The Optimal Location of Ground-Based GNSS Augmentation Transceivers
PublicationModern Global Navigation Satellite Systems (GNSS) allow for positioning with accuracies ranging from tens of meters to single millimeters depending on user requirements and available equipment. A major disadvantage of these systems is their unavailability or limited availability when the sky is obstructed. One solution is to use additional range measurements from ground-based nodes located in the vicinity of the receiver. The highest...
-
An optimal designed experiment for the alkaline hydrolysis of feather keratin
PublicationFeathers, burdensome waste from the poultry industry, can be a cheap source of keratin, a protein with excellent physico- chemical, biological, and mechanical properties. Acid and alkaline hydrolyses are usually adopted for isolation of keratin from its natural resources. This study aimed at assessing the statistically significant effect of input variables in the alkaline hydrolysis of keratin from chicken feathers on the process...
-
Optimal placement of IMU sensor for the detection of children activity
PublicationIn this paper an investigation to determine the optimal placement of IMU sensors for the purpose of children characteristic activity detection is presented. The article compares four different placement of two IMU sensors on human body. Ten healthy volunteers participated within the study. Data were collected firstly from two wireless 9-axial IMU sensors placed at the left and right wrists, then sensors were placed at lower back...
-
Optimal configuration of an electrode array for measuring ventricles' contraction
PublicationAn influence of an electrode-array configuration on an impedance signal composition for a fixed spatial distribution of its sources is examined in the paper. The Finite Element Method and Geselowitz relationship were used for examining three different electrode-arrays. A sensitivity approach was used to evaluate each configuration assuming that localization of the signal source is known. A conductivity change, thus the source of...
-
Sum Coloring of Bipartite Graphs with Bounded Degree
Publication -
Strong weakly connected domination subdivisible graphs
PublicationArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.
-
program verification strategy and edge ranking of graphs
PublicationW artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...
-
On extremal sizes of locally k-tree graphs
PublicationA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Parallel query processing and edge ranking of graphs
PublicationArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Sum coloring of bipartite graphs with bounded degree.
PublicationArtykuł poświęcony jest złożoności obliczeniowej zagadnienia sumacyjnego kolorowania grafów dwudzielnych o ograniczonym stopniu. Zawiera dowód tego, że sumacyjne kolorowanie grafów dwudzielnych stopnia mniejszego równego 5 jest NP-zupełne oraz opis wielomianowego algorytmu, który optymalnie sumacyjnie koloruje grafy dwudzielne podkubiczne.
-
Cholesky factorization of matrices in parallel and ranking of graphs.
PublicationUporządkowane kolorowanie znajduje zastosowanie przy równoległej faktoryzacji macierzy metodą Cholesky'ego. Praca zawiera opis tego zastosowania. Podano także algorytmy optymalnego uporządkowanego kolorowania krawędzi pewnych klas grafów: grafów pełnych dwudzielnych oraz powstałych z pełnych dwudzielnych przez usunięcie O(log n) krawędzi.
-
Graphs with convex domination number close to their order
PublicationW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract 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.
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
Minimum order of graphs with given coloring parameters
PublicationA complete k-coloring of a graph G=(V,E) is an assignment F: V -> {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...
-
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Chromatic cost coloring of weighted bipartite graphs
PublicationGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA 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)....
-
The State Of Lightguide Technology In Poland On The Basis Of The IV National Symposium "Optical Fibres And Their Applications"
Publication -
<title>FPGA-based modular configurable controller with fast synchronous optical network</title>
Publication -
Evolution of the optical properties of chromium doped calcium tetraborate glass under high pressure
Publication -
Effect of Temperature and Pressure on Structural and Optical Properties of Organic–Inorganic Hybrid Manganese Halides
Publication -
Changes in optical properties of YAG:Ce single crystals due to codoping and ionizing radiation treatment
Publication -
Photoacoustic and optical absorption spectroscopy studies of luminescentCr3+andCr4+centers in yttrium aluminum garnet
Publication -
Optical properties of pure and Ce3+ doped gadolinium gallium garnet crystals and epitaxial layers
Publication -
Magnesium porphyrazine with peripheral methyl (3,5-dibromophenylmethyl)amino groups – synthesis and optical properties
Publication -
Large-scale multimedia content delivery over optical networks for interactive TV services
Publication