Filtry
wszystkich: 10618
-
Katalog
- Publikacje 5802 wyników po odfiltrowaniu
- Czasopisma 17 wyników po odfiltrowaniu
- Konferencje 23 wyników po odfiltrowaniu
- Osoby 140 wyników po odfiltrowaniu
- Wynalazki 10 wyników po odfiltrowaniu
- Projekty 4 wyników po odfiltrowaniu
- Laboratoria 6 wyników po odfiltrowaniu
- Zespoły Badawcze 7 wyników po odfiltrowaniu
- Aparatura Badawcza 40 wyników po odfiltrowaniu
- Kursy Online 1202 wyników po odfiltrowaniu
- Wydarzenia 24 wyników po odfiltrowaniu
- Dane Badawcze 3343 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: chromatic cost coloring, optimum cost chromatic partition, weighted graph, bipartite graph, approximation algorithm, chromatic cost 3-pseudocoloring
-
Approximation Strategies for Generalized Binary Search in Weighted Trees
PublikacjaWe consider the following generalization of the binary search problem. A search strategy is required to locate an unknown target node t in a given tree T. Upon querying a node v of the tree, the strategy receives as a reply an indication of the connected component of T\{v} containing the target t. The cost of querying each node is given by a known non-negative weight function, and the considered objective is to minimize the total...
-
Mixed graph edge coloring
PublikacjaW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
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...
-
EvOLAP Graph – Evolution and OLAP-Aware Graph Data Model
PublikacjaThe objective of this paper is to propose a graph model that would be suitable for providing OLAP features on graph databases. The included features allow for a multidimensional and multilevel view on data and support analytical queries on operational and historical graph data. In contrast to many existing approaches tailored for static graphs, the paper addresses the issue for the changing graph schema. The model, named Evolution...
-
Neural network based algorithm for hand gesture detection in a low-cost microprocessor applications
PublikacjaIn this paper the simple architecture of neural network for hand gesture classification was presented. The network classifies the previously calculated parameters of EMG signals. The main goal of this project was to develop simple solution that is not computationally complex and can be implemented on microprocessors in low-cost 3D printed prosthetic arms. As the part of conducted research the data set EMG signals corresponding...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublikacjaAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
Cost efficiency of administrative service in public higher education in Poland
PublikacjaPurpose: The aim of the study is to determine changes in the cost efficiency of the administration of public higher education in Poland. Design/methodology/approach: The biennial cost Malmquist productivity index was used to study changes in cost efficiency of 58 public higher education institutions in 2014-2016. The results were...
-
How Much Does an e-Vote Cost? Cost Comparison per Vote in Multichannel Elections in Estonia
PublikacjaWe are presenting the results of the CoDE project in this paper, where we investigate the costs per vote of different voting channels in Estonian Local Elections (2017). The elections analyzed involve different processes for casting a vote: Early Voting at County Centers, Advance Voting at County Centers, Advance Voting at Ordinary Voting District Committees, Electronic Voting, Election Day Voting, and Home Voting. Our analysis...
-
Low-Cost Surrogate Models for Microwave Filters
PublikacjaA novel low-cost kriging-based multivariable parametric macromodeling technique for microwave filters is presented. Kriging is used to model both the residues and poles of a microwave filter's reflection coefficient, and the zeros of the transmission coefficient. The proposed residue-pole-zero (RPZ) technique is demonstrated to efficiently model a high dimensional (8D) microwave filter with pseudoelliptic characteristics.
-
Cost-Efficient Design Methodology for Compact Rat-Race Couplers
PublikacjaIn this article, a reliable and low-cost design methodology for simulation-driven optimization of miniaturized rat-race couplers (RRCs) is presented. We exploit a two-stage design approach, where a composite structure (a basic building block of the RRC structure) is first optimized using a pattern search algorithm, and, subsequently, the entire coupler is tuned by means of surrogate-based optimization (SBO) procedure. SBO is executed...
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Constructing a map of an anonymous graph: applications of universal sequences
PublikacjaWe study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...
-
Influence of passive house technology on time and cost of construction investment
PublikacjaDue to the changes in the energy standards for housing in Poland there are many concerns. Is the standard required by the regulation achievable and if it is, then at what cost? There are many solutions to construct a building in line with the requirements of passive house technology. They are differentiated by price and time required for implementation. This study is based on the solution proposed by one of Polish companies, offering...
-
Rotational Design Space Reduction for Cost-Efficient Multi-Objective Antenna Optimization
PublikacjaCost-efficient multi-objective design of antenna structures is presented. Our approach is based on design space reduction algorithm using auxiliary single-objective optimization runs and coordinate system rotation. The initial set of Pareto-optimal solutions is obtained by optimizing a response surface approximation model established in the reduced space using coarse-discretization EM simulation data. The optimization engine is...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publikacjagenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
Life Cycle Cost Assessment and the Optimum Design of Timber Roofs for Sustainable Construction
Publikacja -
Cost-efficient simulation-driven design of compact impedance matching transformers
PublikacjaIn this paper, an algorithmic framework for cost-efficient design optimization of miniaturized impedance matching transformers has been presented. Our approach exploits a bottom-up design that involves translating the overall design specifications for the circuit at hand to its elementary building blocks (here, compact microstrip resonant cells, CMRCs), as well as fast surrogate-assisted optimization of the cells followed by simulation-based...
-
The influence of historical conditions on time and cost of construction project
PublikacjaConducting construction works in a building or in an area entered in the historic register is associated with the contracting authority's risk of incurring higher than planned costs of works, as well as delays in their implementation. In many cases, these deviations are completely independent of contracting authority and contractor. The aim of this article is to indicate the reasons for cost and time changes in the construction...
-
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
Publikacja -
Efficient list cost coloring of vertices and/or edges of some sparse graphs
PublikacjaRozważane jest kolorowanie wierzchołków i krawędzi grafów w modelach klasycznym, totalnym i pseudototalnym z uwzględnieniem dodatkowego ograniczenia w postaci list dostępnych kolorów. Proponujemy wielomianowy algorytm oparty na paradygmacie programowania dynamicznego dla grafów o strukturze drzewa. Wynik ten można uogólnić na grafy o liczbie cyklomatycznej ograniczonej z góry przez dowolnie wybraną stała.
-
Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times
PublikacjaWe consider a generalization of binary search in linear orders to the domain of weighted trees. The goal is to design an adaptive search strategy whose aim is to locate an unknown target vertex of a given tree. Each query to a vertex v incurs a non-negative cost ω(v) (that can be interpreted as the duration of the query) and returns a feedback that either v is the target or the edge incident to v is given that is on the path towards...
-
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
Publikacja -
Chromatic scheduling of 1- and 2-processor uet tasks on dedicated machines with availability constraints.
PublikacjaRozważono uogólnienie klasycznego szeregowania jednostkowych zadań jedno- i dwuprocesorowych na maszynach dedykowanych. Przyjęty model pozwala na naturalne wprowadzenie wszystkich klasycznych kryteriów optymalizacyjnych dla harmonogramów. Zaproponowano algorytmy wielomianowe dla systemów rzadkich.
-
Distributed graph searching with a sense of direction
PublikacjaIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Low Cost Method for Location Service in the WCDMA System
PublikacjaA new and low cost method for a location service (LCS) in the Wideband Code Division Multiple Access (WCDMA) system is outlined. This method, which is called TDOA + RTT, enables calculation of the geographical position of a mobile station (MS) without knowledge of relative time differences (RTDs) between base stations (BSs). The TDOA+RTT method is based on the measurement of round trip times (RTTs) between the MS and the serving...
-
Cost-Efficient Optical Fronthaul Architectures for 5G and Future 6G Networks
PublikacjaFifth-generation and Beyond (5GB) wireless networks have introduced new centralized architectures such as cloud radio access network (CRAN), which necessitate extremely high-capacity low latency Fronthaul (FH). CRAN has many advantageous features in terms of cost reduction, performance enhancement, ease of deployment, and centralization of network management. Nevertheless, designing and deploying a cost-efficient FH is still a...
-
Reduced-Cost Microwave Modeling Using Constrained Domains and Dimensionality Reduction
PublikacjaDevelopment of modern microwave devices largely exploits full-wave electromagnetic (EM) simulations. Yet, simulation-driven design may be problematic due to the incurred CPU expenses. Addressing the high-cost issues stimulated the development of surrogate modeling methods. Among them, data-driven techniques seem to be the most widespread owing to their flexibility and accessibility. Nonetheless, applicability of approximation-based...
-
Cost-efficient design optimization of compact patch antennas with improved bandwidth
PublikacjaIn this letter, a surrogate-assisted optimization procedure for fast design of compact patch antennas with enhanced bandwidth is presented. The procedure aims at addressing a fundamental challenge of the design of antenna structures with complex topologies, which is simultaneous adjustment of numerous geometry parameters. The latter is necessary in order to find a truly optimum design and cannot be executed-at the level of high-fidelity...
-
Simple and low-cost wireless voting system
PublikacjaThis paper presents the concept of a simple and low-cost wireless voting system working in the 868 MHz frequency band. The described system is dedicated to general shareholders assemblies but it can be easily adapted for other applications. The main advantage is its simplicity and mobility as it consists solely of three components - voting modules, a base station and a PC application from which the whole system is mamaged. This...
-
Simple and low-cost wireless voting system
PublikacjaThis paper presents the concept of a simple and low-cost wireless voting system working on the 868 MHz frequency band. Described system is dedicated to general shareholders assemblies but it can be easily adapted for other applications. The main advantage is its simplicity and mobility as it consists solely of three components - voting modules, base station and a PC application from which the whole system is managed. This architecture...
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color looking at the hat colors of the other people. The team wins if at least one person 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 win. In this version every...
-
Low cost set-up for supercapacitors parameters evaluation
PublikacjaSupercapacitors are capable to store relatively high amount of energy comparing to its mass. Growing number of these devices applications requires development of new testing methods. Standard methods of evaluation of supercapacitor parameters, as cycling voltammetry, CV, galvanostatic cycling with potential limitation, GCPL, impedance measurements, require equipment of high cost...
-
Low-Cost EM-Simulation-Driven Multi-Objective Optimization of Antennas
PublikacjaA surrogate-based method for efficient multi-objective antenna optimization is presented. Our technique exploits response surface approximation (RSA) model constructed from sampled low-fidelity antenna model (here, obtained through coarse-discretization EM simulation). The RSA model enables fast determination of the best available trade-offs between conflicting design goals. A low-cost RSA model construction is possible through...
-
Low cost microwave X-band generator
PublikacjaA low cost microwave X-band generator for educational purposes was designed and built. Its simple construction and user's interface makes it suitable for a student laboratory.The generator is based on a single frequency conversion concept. It uses a digitally tunable PLL chip for intermediate frequency generation and an active frequency multiplier for frequency conversion. The generator covers 9,7 - 11 GHz part of the X frequency...
-
On the low-cost design of abbreviated multisection planar matching transformer
PublikacjaA numerically demanding wideband matching transformer composed of three nonuniform transmission lines (NUTLs) has been designed and optimized at a low computational cost. The computational feasibility of the design has been acquired through the exploitation of low-fidelity NUTL models in most steps of the design procedure and an implicit space mapping optimization engine, providing high accuracy results with only a handful of EM...
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublikacjaWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
Interval vertex-coloring of a graph with forbidden colors
Publikacja -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publikacja -
Interval edge coloring of a graph with forbidden colors
Publikacja -
An experimental study of distributed algorithms for graph coloring.
PublikacjaW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublikacjaWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
On the hat problem on a graph
PublikacjaThe topic of this paper is the hat problem in which each of n players is uniformly and independently 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....
-
Low-Cost Automated Design of Compact Branch-Line Couplers
PublikacjaBranch-line couplers (BLCs) are important components of wireless communication systems. Conventional BLCs are often characterized by large footprints which make miniaturization an important prerequisite for their application in modern devices. State-of-the-art approaches to design of compact BLCs are largely based on the use of high-permittivity substrates and multi-layer topologies. Alternative methods involve replacement of transmission-line...
-
5G/6G optical fronthaul modeling: cost and energy consumption assessment
PublikacjaIn fifth generation (5G) and the future beyond 5G (6G) radio access networks (RANs), the cost of fronthaul deployment is a main challenge for mobile network operators. Depending on different constraints, there are various solutions to deploy an efficient fronthaul. Fiber-optic-based fronthaul offers long-term support with regard to a rapid increase in capacity demands. When fiber connections, either point-to-point (P2P) or point-to-multipoint...
-
Chromatic monitoring technique for thickness measurementof thin transparent films.IV Workshopon Atomic and Molecular Physics.
PublikacjaW pracy opisano nową technikę monitorowania grubości cienkich warstw podczas procesu ich syntezy. Jest to optyczna metoda oparta na zdegenerowanej analizie widmowej tzw. modulacji chromatycznej. Umożliwia ona precyzyjny ciągły pomiar zmian grubości wzrastających warstw stosowanych w optyce.
-
COMPREHENSIVE MODELLING OF THE COST EFFECTIVNESS OF RAILWAY LINE ELECTRIFICATION
PublikacjaSubject of this paper is the mathematical model estimating the Economical threshold between usage of combustion engine traction and electrical traction for new and modernized railway passenger communication lines. Currently available models do not coincide with the whole complexity of the problem. The proposed model was implemented into Matlab and then validated on “Pomorska Kolej Metropolitalna” investment time-frame and its cost...
-
Domain segmentation for low-cost surrogate-assisted multi-objective design optimisation of antennas
PublikacjaAbstract: Information regarding the best possible design trade-offs of an antenna structure can be obtained through multiobjective optimisation (MO). Unfortunately, MO is extremely challenging if full-wave electromagnetic (EM) simulation models are used for performance evaluation. Yet, for the majority of contemporary antennas, EM analysis is the only tool that ensures reliability. This study introduces a procedure for accelerated...