Filtry
wszystkich: 2609
wybranych: 2054
-
Katalog
- Publikacje 2054 wyników po odfiltrowaniu
- Czasopisma 48 wyników po odfiltrowaniu
- Konferencje 3 wyników po odfiltrowaniu
- Osoby 87 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 35 wyników po odfiltrowaniu
- Wydarzenia 13 wyników po odfiltrowaniu
- Dane Badawcze 366 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: VERTEX RANKING
-
Tyre/road noise measurements on ISO tracks using the modified CPX method
PublikacjaTyre rolling noise test method specified in the UNECE Regulation 117 is directly used in the Tyre Labelling Directive. Noise level specified on EU Tyre Label of each new tyre available on the European market was determined based on vehicle coast-by noise measurements performed on the standard reference road surface proscribed in the ISO 10844:2014. Available data from investigations by the vehicle and tyre industry and results...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublikacjaA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Independent Domination Subdivision in Graphs
PublikacjaA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Sample preparation procedure using extraction and derivatization of carboxylic acids from aqueous samples by means of deep eutectic solvents for gas chromatographic-mass spectrometric analysis
PublikacjaThe paper presents a new procedure for the determination of organic acids in a complex aqueous matrixusing ultrasound-assisted dispersive liquid–liquid microextraction followed by injection port derivati-zation and GC–MS analysis. A deep eutectic solvent (choline chloride: 4-methylphenol in a 1:2 mol ratio)was used both as an extracting solvent and as a derivatizing agent to yield ion pairs which were next con-verted to methyl...
-
Liquidity and the cross-section of international stock returns
Publikacja -
Cross-sectional seasonalities in international government bond returns
Publikacja -
Misery on Main Street, victory on Wall Street: Economic discomfort and the cross-section of global stock returns
Publikacja -
Where have the profits gone? Market efficiency and the disappearing equity anomalies in country and industry returns
Publikacja -
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...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Strategic balance in graphs
PublikacjaFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Certified domination
PublikacjaImagine 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...
-
Developing Game-Structure Sensitive Matchmaking System for Massive-Multiplayer Online Games
PublikacjaProviding a fair matchmaking system is an essential issue, while developing every online video game. In the article, we show that the currently existing matchmaking system in League of Legends, one of the most popular online video games currently existing, is built on a base of conditions which do not hold true in the presence of empirical data. This, in short, decreases the effectiveness of the ranking system, and negatively affects...
-
A lower bound on the total outer-independent domination number of a tree
PublikacjaA 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 total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_t^{oi}(T) >= (2n-2l+2)/3,...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor 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 in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
Hardware cryptography coprocessor for system on chip soft processor
PublikacjaW artykule przedstawiono realizację sprzętową i programową szyfrującejo i deszyfrującego algorytmu AES.Obydwie implementacje zostały zralizowane z wykorzystaniem układu Virtex II i przetestowane. Jako kryterium porónawcze wybrano zużycie zasobów układu oraz wydajność. Realizacja sprzętowa wykonuje operację szyfrowania 2 dekady szybcie niż wersja programowa, ale wymaga pięciokrotnie więcej zasobówIn this paper hardware and software...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublikacjaA 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...
-
An upper bound on the 2-outer-independent domination number of a tree
PublikacjaA 2-outer-independent 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, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2,...
-
On trees attaining an upper bound on the total domination number
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. The total domination number of a graph G, denoted by γ_t(G), is the minimum cardinality of a total dominating set of G. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International Journal of Graphs and Combinatorics 1 (2004), 69-75] established the following upper bound on the total domination...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
Design and realization of two-operand modular adders in the FPGA
PublikacjaW pracy zaprezentowano strukturę sumatorów modularnych w środowisku Xilinx z użyciem rodziny układów Virtex-6. Rozważono dwa typy sumatorów, jeden dla modułów 5-bitowych i drugi dla 6-bitowych. Zaprojektowano ich struktury i podano eksperymentalne wyniki implementacji.
-
Economic significance of initial public offerings in China and India
PublikacjaRapid economic growth in China and India has attracted attention of many researchers, focusing on various social and economic factors underlying the success of these countries. One of the key components of country’s economy is financial system which consists of segments such as banking sector and equity market. The topic of initial public offerings (IPOs), one of the corporate financing sources, involving raising funds through...
-
Analysis of unsteady flow forces on the thermowell of steam temperature sensor
PublikacjaIn this paper, 3D numerical analysis of unsteady flow forces acting on the measuring sheath of steam temperature is presented. According to that purpose, the CFD (Computation Fluid Dynamic [1]) approach has been used. The nonstationary of fluid acting on the measuring sheath such as: Strouhal frequency, amplitude of pressure, structure of vortex, peak of pressure, field of pressure, field of velocity etc. are studied analytically...
-
Safety PL - a support tool for Road Safety Impact Assessment
PublikacjaPublished on 19 November 2008, the European Union's Directive 2008/96/EC is one of the most important EU documents setting out a road safety orientation, in particular, road infrastructure safety management. It identifies four main areas of activity: road safety impact assessment, road safety audit, ranking of high accident concentration sections and network safety ranking and road infrastructure safety inspection. The Directive...
-
Możliwości zamiany elektrycznych przepływomierzy powietrza stosowanych w silnikach spalinowych samochodów
PublikacjaW artykule przedstawiono podstawowe typy przepływomierzy powietrza, stosowane w silnikach spalinowych samochodów: z klapąspiętrzającą, HLM, HFM, Vortex i MAP. Przedstawiono wyniki badania tych przepływomierzy na specjalnie przygotowanym stanowisku pomiarowym. Przeanalizowano możliwość ich zamiany i zweryfikowano taką możliwość w praktyce.
-
An upper bound on the total outer-independent domination number of a tree
PublikacjaA total outer-independent dominating set of a graph G=(V(G),E(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 total outer-independent domination number of a graph G, denoted by gamma_t^{oi}(G), is the minimum cardinality of a total outer-independent dominating set of G. We prove that for every tree T of order n >= 4, with l leaves and s support vertices we have...
-
A bisection‐based heuristic for rapid EM‐driven multiobjective design of compact impedance transformers
PublikacjaDesign of microwave structures is a multiobjective task where several conflicting requirements have to be considered at the same time. For contemporary circuits characterized by complex geometries, multiobjective optimization cannot be performed using standard population‐based algorithms due to high cost of electromagnetic (EM) evaluations. In this work, we propose a deterministic approach for fast EM‐driven multiobjective design...
-
Cyfrowy akcelerator wybranych modułów standardu kompresji wideo H.264
PublikacjaW komunikacie przedstawiono konfigurowalny cyfrowy akcelerator estymacji ruchu (motion estimation) przeznaczony dla enkodera wideo standardu H.264. Akcelerator został wstępnie zaimplementowany w układzie FPGA VIRTEX6-VLX365T, a następnie w układzie ASIC w technologii UMC 90 nm. Obie implementacje zostały zweryfikowane pozytywnie, a szczegółowe wyniki symulacji i pomiarów akceleratora ASIC zostały porównane z innymi dostępnymi w...
-
Derecho Evolving from a Mesocyclone—A Study of 11 August 2017 Severe Weather Outbreak in Poland: Event Analysis and High-Resolution Simulation
PublikacjaThis study documents atmospheric conditions, development, and evolution of a severe weather outbreak that occurred on 11 August 2017 in Poland. The emphasis is on analyzing system morphology and highlighting the importance of a mesovortex in producing the most significant wind damages. A derecho-producing mesoscale convective system (MCS) had a remarkable intensity and was one of the most impactful convective storms in the history...
-
The Optimal Location of Ground-Based GNSS Augmentation Transceivers
PublikacjaModern 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...
-
The nonlinear effects of sound in a liquid with relaxation losses
PublikacjaThe nonlinear effects of sound in electrolyte with a chemical reaction are examined. The dynamic equations that govern non-wave modes in the field of intense sound are derived, and acoustic forces of vortex, entropy, and relaxation modes are determined in the cases of low-frequency sound and high-frequency sound. The difference in the nonlinear effects of sound in electrolyte and in a gas with excited vibrational degrees of molecules,...
-
Bipartite theory of graphs: outer-independent domination
PublikacjaLet $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...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Pathological and physiological high-frequency oscillations in focal human epilepsy
PublikacjaHigh-frequency oscillations (HFO; gamma: 40-100 Hz, ripples: 100-200 Hz, and fast ripples: 250-500 Hz) have been widely studied in health and disease. These phenomena may serve as biomarkers for epileptic brain; however, a means of differentiating between pathological and normal physiological HFO is essential. We categorized task-induced physiological HFO during periods of HFO induced by a visual or motor task by measuring frequency,...
-
Działalność publicznych instytutów badawczych w Polsce
PublikacjaCel – Celem badań jest ocena działalności instytutów badawczych w Polsce przez pryzmat ich atrakcyjności biznesowej oraz innowacyjności wyrażanej w postaci patentów. Metoda badań – W części teoretycznej artykułu wykorzystano analizę dokumentacyjną, porównawczą, studium przypadku i krytyczną analizę literatury, a w empirycznej metodę unitaryzacji zerowej do znormowania cech diagnostycznych. Wnioski...
-
Total domination in versus paired-domination in regular graphs
PublikacjaA subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...
-
Method for the simultaneous determination of monoaromatic and polycyclic aromatic hydrocarbons in industrial effluents using dispersive liquid-liquid microextraction with GC-MS
PublikacjaWe present a new method for simultaneous determination of 22 monoaromatic and polycyclic aromatic hydrocarbons in postoxidative effluents from the production of petroleum bitumen using dispersive liquid-liquid microextraction coupled to gas chromatography and mass spectrometry. The eight extraction parameters including the type and volume of extraction and disperser solvent, pH, salting out effect, extraction and centrifugation...
-
Wpływ wariantów termodynamicznych układów ORC i systemów trigeneracyjnych na poprawę ich sprawności
PublikacjaNiniejsza praca przedstawia systemowe podejście do problemu uzyskania optymalnej sprawności układów ORC (Organic Ranking Cycle), przy uwzględnieniu jako kryterium zarówno sprawności termodynamicznej, ekologicznego wpływu czynnika termodynamicznego na środowisko oraz kryteriów doboru rodzaju czynnika z punktu widzenia jego oceny i temperaturowych warunków pracy.
-
Application of the LifeRoSE method in funcionality evaluation of road safety equipment
PublikacjaThe article presents a mathematical model of the life cycle estimation method of road safety equipment. Then the model was adjusted to estimate the life cycle costs of the chosen horizontal road marking. Using the LCC method, the functionality of the horizontal marking was evaluated in terms of efficiency, durability and economic effectiveness. The article also presents the impact of selected factors on the life cycle costs of...
-
The process of fuzzy model development for the case of polish internet mortgage market
PublikacjaThe aim of the paper is to present the conceptual description of fuzzy model representing the Polish Internet mortgage market. The first part of the paper consists of assessment and verification of model variables which are important for the Polish Internet Mortgage Market. This process begins with the initial set of variables which was used previously for the rule based model of the same market. As numerous aspects of the market...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublikacjaLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublikacjaGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
EVALUATION OF THE EFFICIENCY OF FLEXICURITY IMPLEMENTATION IN OECD COUNTRIES
PublikacjaFlexicurity is a policy of flexible and secure labour market. It has been the subject of many analyses, however, a coherent evaluation methodology is difficult to specify. The purpose of this paper is to propose a Data Envelopment Analysis based model for the evaluation of the efficiency of flexicurity implementation in OECD countries. The results will be used to create the ranking of countries, to determine changes in time, and...
-
Experimental study and comparison with predictive methods for flow boiling heat transfer coefficient of HFE7000
PublikacjaThis article describes an experimental study of flow boiling of HFE7000 inside a smooth vertical channel. The investigation has been carried out in a circular stainless-steel tube with an inner diameter of 2.3 mm. The data have been collected for the applied heat fluxes q ranging from 61 to 205 kW/m2, the mass flux G ranging from 214 to 1006 kg/(m2 s), the saturation temperature Tsat ranging from 30 to 54 °C and the full range...
-
Assessment and design of greener deep eutectic solvents – A multicriteria decision analysis
PublikacjaDeep eutectic solvents (DES) are often considered as green solvents because of their properties, such as negligible vapor pressure, biodegradability, low toxicity or natural origin of their components. Due to the fact that DES are cheaper than ionic liquids, they have gained many applications in a short period of time. However, claims about their greenness sometimes seem to be exaggerated. Especially, bearing in mind lots of data...
-
Testing the durability and function of road traffic management devices
PublikacjaTraffic management measures (vertical signs and horizontal marking, reflective elements) are used for guiding vehicles optically, indicating road mileage, marking objects in road gauge, marking vehicle and pedestrian safeguards and driver information and warning. This paper presents a synthesis of a literature study and the results of research conducted under stage one of the project LifeRoSE. The requirements for different traffic...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Multi-Decision Analysis for selection of the best procedure for PAHs determination in smoked food.
PublikacjaMaking a proper decision in multifacitated situation is very challenging task. Especially, if there are many alternatives and criteria, even contradictory ones. The support tools may be application of MultiCriteria Decision Analysis methods. In this study the application of PROMETHEE...