Filtry
wszystkich: 5110
-
Katalog
- Publikacje 3203 wyników po odfiltrowaniu
- Czasopisma 112 wyników po odfiltrowaniu
- Konferencje 6 wyników po odfiltrowaniu
- Wydawnictwa 1 wyników po odfiltrowaniu
- Osoby 223 wyników po odfiltrowaniu
- Projekty 31 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 55 wyników po odfiltrowaniu
- Wydarzenia 14 wyników po odfiltrowaniu
- Dane Badawcze 1463 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: RICE GRAINS
-
Diamond investments – Is the market free from multiple price bubbles?
PublikacjaThe following study aims to investigate whether multiple price bubbles, in which the quoted market price of diamonds significantly deviates from their fundamental value, exist in the diamond market. It was conducted using ADF, SADF and GSADF tests, with the latter found to be an optimal form of evaluating the analysed issue. The presented results support the conclusion that the diamond market is not free from periods defined as...
-
THE METHODOLOGY FOR DETERMINING CONDITIONS FOR ARCHITECTURAL INTERVENTIONS IN HERITAGE-RICH ENVIRONMENT
Publikacja -
Environmental Role of Rime Chemistry at Selected Mountain Sites in Poland
PublikacjaThe results of field experiments on fog pollutantdeposition enhanced by local mountain climate, completed by thedendrochronological analysis of the forest response, are presentedin this paper. In spite of their low absolute altitude (1,000-1,600 ma.s.l), the Sudetes and the Silesian Beskid form a noticeable orographicbarrier for the airflow of the humid Atlantic air masses.This results in the increase of cloudiness and fog frequency...
-
Rich magnetic phase diagram in the Kagome-staircase compound Mn3V2O8
PublikacjaNa podstawie pomiarów podatności magnetycznej i ciepła właściwego monokryształu Mn3V2O8 skonstruowano diagram fazowy. Właściwości magnetyczne związku są silnie anizotropowe.
-
Doubly miniaturized rat-race coupler with periodic pbg structures
PublikacjaW referacie zaprezentowano projekt oraz wyniki eksperymentu podwójnie zminiaturyzowanego sprzęgacza pierścieniowego. Wstępny stopień miniaturyzacji uzyskano poprzez modyfikację impedancji charakterystycznych oraz długości elektrycznych odpowiednich sekcji linii mikropaskowych, natomiast dodatkową redukcję powierzchni osiągnięto poprzez implementację kaskad komórek PBG w odcinkach linii mikropaskowych. Wyniki eksperymentu potwierdzają...
-
Drainage and capillary rise components in water balance of alluvial soils
PublikacjaPrzepływ wody przez dolny brzeg profilu glebowego stanowi ważny element wielu modeli pracy drenażu. Przeciekanie wody w głąb albo podsiąk kapilarny ku górze mierzone były metodą lizymetryczną w warunkach polowych podczas 4 lat (1972-1975). Podsiąk kapilarny wynosił 40-50% ogólnego zasilania w wodę w glebach typu Histosols, natomiast prawie zero w glebach typu Inceptisols. Pomierzone wartości pozwalaja na ocenę wymiany wody pomiedzy...
-
Zaawansowane rozwiązania projektowe aplikacji typu Rich Internet Application
PublikacjaRich Internet Application (RIA) jest modelem aplikacji internetowych zyskującym w ostatnim czasie coraz większą popularność. Jednym ze sposobów jego realizacji jest paradygmat AJAX. Stosowane w nowatorski sposób, istniejące od wielu lat technologie pozwalają osiągnąć niespotykane dotąd możliwości. Wieloletnie doświadczenia programistów powodują jednak, że w aplikacjach tego typu stosuje się często rozwiązania projektowe przeznaczone...
-
Simplified, serine‐rich theta‐defensin analogues as antitumour peptides
Publikacja -
THE RISE OF FISCAL OPACITY IN POLAND IN THE ERA OF THE COVID-19 PANDEMIC
PublikacjaResearch background: The quality of information provided by the fiscal authorities and the correct flow of this information between them and the society are very important especially in times of crisis, when there is an imbalance in public finances and an increasing public debt. Ensuring fiscal transparency (transparency of public finances) reduces fiscal risk and corruption and supports public acceptance of fiscal reforms. Purpose...
-
Pounding between high-rise buildings with different structural arrangements
PublikacjaEarthquake-induced structural pounding has led to significant damages during previous earthquakes. This paper investigates the effect of pounding on the dynamic response of colliding high-rise buildings with different structural arrangements. Three 3-D buildings are considered in the study, including 5-storey building, 7-storey building and 9-storey building. Three pounding scenarios are also taken into account, i.e. pounding between...
-
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...
-
A robust design of a numerically demanding compact rat-race coupler
PublikacjaA fast and accurate design procedure of a computationally expensive microwave circuit has been presented step-by-step and experimentally validated on the basis of a compact rat-race coupler (RRC) comprising slow-wave resonant structures (SWRSs). The final compact RRC solution has been obtained by means of a sequential optimization scheme exploiting the implicit space mapping (ISM) algorithm. A well-suited surrogate optimization...
-
A CMRC-based compact rat-race coupler with harmonic suppression
PublikacjaIn this paper, an eective miniaturization technique exploiting compact microstrip resonant cells has been discussed and experimentally validated on the basis of a 3-dB microstrip rat-race coupler. The application of the method proposed has resulted in 91 % circuit area reduction in comparison to a conventional rat-race coupler. Experimental results show good agreement with theoretical characteristics, as well as an additional eect,...
-
IS THE REGIONAL DIVERGENCE A PRICE FOR THE INTERNATIONAL CONVERGENCE? THE CASE OF THE VISEGRAD GROUP
PublikacjaThe main goal of this article is to verify whether the Visegrad Group countries are achieving social convergence at national level at the expense of internal divergence. For this purpose, the existence of social beta-, sigma- and gamma-convergence at national and regional level was tested. The author of this article decided to tackle the convergence problem since there is a high risk that countries are trying to catch up at...
-
Influence of grain shape on the mechanical behaviour of granular materials
PublikacjaWe performed series of numerical vertical compression tests on assemblies of 2D granular material using a Discrete Element code and studied the results in regard to the grain shape. The samples consist of 5000 grains made either of 3 overlapping discs (clump - grain with concavities) or of six-edged polygons (convex grain). These two types of grains have a similar external envelope, ruled with a geometrical parameter α. In the...
-
Use of Sustainable Fine-Grain Aggregates in Cement Composites
Publikacja -
Influence of the grain boundaries on conductivity of yttrium stabilized zirconia
PublikacjaW pracy przedstawiono wyniki badań przewodności domieszkowanego tlenku cyrkonu. Przygotowano tlenk cyrkonu o krystalitach od 100nm to 10um. Badania impedancyjne pozwoliły na określenie przedności ziaren oraz obszarów międzyziarnowych.
-
Biodiversity of Weeds in Fields of Grain in South-Eastern Poland
Publikacja -
International Journal of High-Rise Buildings
Czasopisma -
Rilce: Revista de Filología Hispánica
Czasopisma -
Puerto Rico Health Sciences Journal
Czasopisma -
JOURNAL OF AGRICULTURE OF THE UNIVERSITY OF PUERTO RICO
Czasopisma -
PLAINS ANTHROPOLOGIST
Czasopisma -
Raman scattering tensors for translational vibrations of ice
Publikacja -
Estimating operability of ships in ridged ice fields
Publikacja -
A method for ice-aware maritime route optimization
Publikacja -
Ice Load Characteristics on Floating Photovoltaic Platform
PublikacjaNowadays, based upon human needs and preferring perpetual types of energy, photovoltaic system (PV) is a suitable alternative and more frequently used in northern countries, which are recently more attracted by solar power. The new floating type of the structure is installed in the water bodies instead of land. One of the main elements in floating photovoltaic structures is the forces imposed on the panels. In the northern regions,...
-
Modeling of Ice Phenomena in the Mouth of the Vistula River
PublikacjaThe mouth of the Vistula River, which is a river outlet located in tideless area, is analyzed. The Vistula River mouth is a man-made, artificial channel which was built in the 19th century in order to prevent the formation of ice jams in the natural river delta. Since the artificial river outlet was constructed, no severe ice-related flood risk situations have ever occurred. However, periodic ice-related phenomena still have an impact...
-
The Brain of the city
PublikacjaIn order to highlight the characteristics of the West End of Wrocław, we conducted a site analysis. Using the strengths of the site, we were able to create a unique concept of the district while minimizing the impacts of weaknesses by design. The purpose of redesigning the West End of Wrocław is to attract new people to the district through the transformation of an identity. Initially, we conducted a SWOT analysis to identify the...
-
Trans Theorizing
Publikacja -
Trans Theorizing
Publikacja -
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...
-
Interval Edge-Coloring of Graphs
Publikacja -
Correction to: Serialization for Property Graphs
Publikacja -
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Greedy T-colorings of graphs
PublikacjaTreścią artykułu są pokolorowania kontrastowe wygenerowane przez algorytm zachłanny. Zbadane zostały ich własności, obejmujące liczbę kolororów, rozpiętość i rozpiętość krawędziową.
-
Equitable vertex coloring of graphs
PublikacjaW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
Interval edge-coloring of graphs.
PublikacjaRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
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...
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
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...
-
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...
-
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...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
Three-fast-searchable graphs
PublikacjaIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...