Filtry
wszystkich: 3049
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: COMPLEX
-
ANALYSIS OF EFFECTIVENESS AND COMPUTATIONAL COMPLEXITY OF TREND REMOVAL METHODS
PublikacjaThe paper presents a method of processing measurement data due to remove slowly varying component of the trend occurring in the recorded waveforms. Comparison of computational complexity and trend removal efficiency between some commonly used methods is presented. The impact of these procedures on probability distribution and power spectral density is shown. Effectiveness and computational complexity of these methods depend essentially...
-
Review of the Complexity of Managing Big Data of the Internet of Things
PublikacjaTere is a growing awareness that the complexity of managing Big Data is one of the main challenges in the developing feld of the Internet of Tings (IoT). Complexity arises from several aspects of the Big Data life cycle, such as gathering data, storing them onto cloud servers, cleaning and integrating the data, a process involving the last advances in ontologies, such as Extensible Markup Language (XML) and Resource Description...
-
On the complexity of distributed graph coloring with local minimality constraints
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
-
Scheduling jobs to contain a natural disaster: a model and complexity
Publikacjathis paper is devoted to the problem of scheduling suppression units so that a natural disaster is dealt with as efficient as possible. the concept of deteriorating jobs is adopted, that is, the formal model of scheduling represents linearly increasing value loss as the disaster remains unsuppressed and increasing time for its suppression. more precisely, two different goals are considered: finding a suppression schedule of minimal...
-
Smart systems integration: toward overcoming the problem of complexity
PublikacjaW pracy omówiono modelowa propozycję integracji systemu opartą na zastosowaniu sztucznej inteligencji w celu rozwiązania problemu złożoności systemowej.
-
The complexity of the T-coloring problem for graphs with small degree.
PublikacjaW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Phosphoroorganic Metal Complexes in Therapeutics
PublikacjaThe present mini-review highlights recent developments on antitumor activity of metal-based therapeutics which have been a subject of researches for the last few decades. In 1965, Rosenberg found that during an electrolysis on platinum electrodes a complex of Pt is generated which inhibited to a great extent a binary fission in Escherichia coli bacteria. This discovery started a new chapter in medicinal chemistry and the interesting...
-
Lower rim substituted tert-butylcalix[4]arenes.Part 8: Calix[4]arenes with dialkoxyphosphoryl functions. Synthesis and complexing properties
PublikacjaW pracy przedstawiono syntezę i charakterystykę otrzymanych związków (1, 2), pochodnych alkoksyfosforylowych p-tert-butylokaliks[4]arenu: 5,11,17,23-tetra-tert-butylo-25,26,27,28-tetrakis(3-diizopropoksyfosforylopropoksy)kaliks[4]arenu (1) oraz 5,11,17,23-tetra-tert-butylo-25,26,27,28-tetrakis(3-methoksyetoksyfosforylopropoksy)kaliks[4]arenu (2). Zbadano właściwości jonoforowe związków 1 i 2 w membranie elektrod jonoselektywnych,...
-
Assessing Grounding Frequency using Ship Traffic and Waterway Complexity
Publikacja -
A low complexity double-talk detector based on the signal envelope
PublikacjaA new algorithm for double-talk detection, intended for use in the acoustic echo canceller for voice communication applications, is proposed. The communication system developed by the authors required the use of a double-talk detection algorithm with low complexity and good accuracy. The authors propose an approach to doubletalk detection based on the signal envelopes. For each of three signals: the far-end speech, the microphone...
-
Biopsychosocial complexity measured by health care needs in controlled acromegaly
Publikacja -
Teaching Architecture – contemporary challenges and threats in the complexity of built environment
PublikacjaThe complexity of the modern built environment is a problem n ot only of architectural and urban issues. This issue extends to many othe r disciplines as well as covering a wide range of social engagements. The idea of writing this pa per is generally initiated by the debate which took place in Gdańs k on 22.01.2016, and was prepar ed in order to meet representatives of the four circles of interest...
-
Reduction of Computational Complexity in Simulations of the Flow Process in Transmission Pipelines
PublikacjaThe paper addresses the problem of computational efficiency of the pipe-flow model used in leak detection and identification systems. Analysis of the model brings attention to its specific structure, where all matrices are sparse. With certain rearrangements, the model can be reduced to a set of equations with tridiagonal matrices. Such equations can be solved using the Thomas algorithm. This method provides almost the same values...
-
The final answer to the complexity of a basic problem in resilient network design
Publikacja -
Pre-arrangement of solvability, complexity, stability and quality of GPC systems
PublikacjaPraca dotyczy podstawowych problemów strojenia algorytmów dyskretnoczasowego uogólnienia sterowania predykcyjnego (GPC). Optymalne sterowanie predykcyjne, w sensie pewnego kwadratowego funkcjonału kosztów, wyznacza się rozwiązując odpowiednie liniowe zadanie. W pracy podano warunki, przy których macierz tego zadania jest macierzą o pełnym kolumnowym rzędzie - co gwarantuje istnienie optymalnego sterownika. W następnej kolejności...
-
Examination of the effect of altering model complexity on representing groundwater flow
PublikacjaW artykule przedstawiono wyniki badań na dokładnością modeli numerycznych przepływu wód podziemnych. Analizowano wpływ upraszczania struktury przestrzennej modelu na wyniki obliczeń.
-
Quantum communication complexity advantage implies violation of a Bell inequality
PublikacjaWe obtain a general connection between a quantum advantage in communication complexity and non-locality. We show that given any protocol offering a (sufficiently large) quantum advantage in communication complexity, there exists a way of obtaining measurement statistics which violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily...
-
Journal of Systems Science & Complexity
Czasopisma -
Carboxymethyl cellulose–gelatin complexes
Publikacja -
Complexation studies of 3-substituted β-diketones with selected d- and f-metal ions
Publikacja -
Effect of chemical structure on complexation efficiency of aromatic drugs with cyclodextrins: The example of dibenzazepine derivatives
PublikacjaIt is widely believed that the hydrophobic effect governs the binding of guest molecules to cyclodextrins (CDs). However, it is also known that high hydrophobicity of guest molecules does not always translate to the formation of stable inclusion complexes with CDs. Indeed, a plethora of other factors can play a role in the efficiency of guest–CD interactions, rendering structure-based prediction of the complexation efficiency with...
-
Optical activity of the guest azobenzene molecule generated by inclusion complexation with steroidal bile acids.
PublikacjaZsyntetyzowano krystaliczne kompleksy inkluzyjne azobenzenu z kwasami cholowym i deoksycholowym. Otrzymane związki inkluzyjne poddano badaniom przy wykorzystaniu spektroskopii dichroizmu kołowego w fazie stałej (KBr). Dodatni efekt Cottona, odpowiadający niskoenergetycznemu przejściu elektronowemu n-pi*, skorelowano z helikalnością M,M skręconej cząsteczki azobenzenu. Ponadto w celach porównawczych zmierzono dichroizm kołowy w...
-
Optical activity of benzophenone and thiobenzophenone generated by spontaneous crystallization and inclusion complexation with cholic acid.
PublikacjaOtrzymano związki inkluzyjne benzofenonu i jego tioanalogu z kwasem cholowym. W zależności od stosowanej metody syntezy kompleksów inkluzyjnych benzofenonu powstawały one w dwóch różnych postaciach polimorficznych. Jedna z nich wykazuje istnienie cząsteczek gościa w czterech konformacjach, przy czym dominuje konformer o helikalności M. Struktura krystalograficzna kompleksu tiobenzofenonu z kwasem cholowym ujawniła obecność tylko...
-
Mapping the complexity of dementia: factors influencing cognitive function at the onset of dementia
Publikacja -
Implementation complexity analysis of the turbo decoding algorithms on digital signal processor
Publikacja -
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublikacjaIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublikacjaIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublikacjaIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Electrochemical Synthesis of Polysaccharide-Protein Complexes. Part 1: Preliminary Studies on Apple Pectin-Albumin Complexes
Publikacja -
Electrosynthesis of potato starch-casein complexes
Publikacja -
Electrosynthesis of carboxymethyl cellulose – ovoalbumin complexes
Publikacja -
The two ring road complexes of Gdansk
PublikacjaThe urban structure of Gdańsk city centre is determined by two ring road complexes. The first of them, the Gdańsk Ring, has been designed by Hermann Josef Stübben as a result of a defortification at the turn of the 19th and 20th centuries. This new modern zone of the city centre was destroyed like the rest of Gdańsk in the end of World War Two and had not been reconstructed as a result of de-Germanization of the Recovered Territories....
-
Starch–metal complexes and metal compounds
PublikacjaRecently, metal derivatives of starch evoked considerable interest. Such metal derivatives can take a form of starch compounds bearing metal atoms and metal carrying moieties either covalently bound or complexed. Starch metal complexes may have a character of either Werner, inclusion, sorption or capillary complexes. In this publication, preparation, structure, properties and numerous current and potential applications of those...
-
Thiolate complexes of molybdenum. synthesis and application
PublikacjaZwiązki molibdenu, w tym siarczki, posiadają własności katalityczne i są szeroko wykorzystywane m.in. w przemyśle petrochemicznym. Enzym nitrogenaza posiadający w centrum aktywnym molibdenu umożliwia reakcję redukcji azotu atmosferycznego w niskiej temperaturze i pod ciśnieniem atmosferycznym. Ta sama reakcja w przemyśle wymaga zastosowania znacznie bardziej drastycznych warunków. Stąd wieloletnie zainteresowanie badaczy możliwością...
-
Boron Difluoride Complexes of Carbamoyl Meldrum's Acids
Publikacja5-[Hydroxy(aryl/alkylamino)methylene]-2,2-dimethyl-1,3-dioxane-4,6-diones react with BF3•Et2O in mild conditions leading to the formation of boron difluoride complexes of carbamoyl Meldrum's acids. The X-ray structure has been obtained for one representative complex. The obtained new compounds are fairly stable at standard ambient conditions and easily isolable.
-
Towards increasing F-measure of approximate string matching in O(1) complexity
PublikacjaThe paper analyzes existing approaches for approximate string matching based on linear search with Levenshtein distance, AllScan and CPMerge algorithms using cosine, Jaccard and Dice distance measures. The methods are presented and compared to our approach that improves indexing time using Locally Sensitive Hashing. Advantages and drawbacks of the methods are identified based on theoretical considerations as well as empirical evaluations...
-
COMPLEXITY OF INNOVATIVE FINANCIAL PRODUCTS: THE CASE OF SYNTHETIC EXCHANGE TRADED FUNDS IN EUROPE
PublikacjaThe aim of the text is the presentation of the most important categories of exchange traded funds (ETFs) – physical and synthetic ones. A theoretical part of the text includes an overview of the main features of ETFs, the presentation of differences between physical and synthetic funds and the main risks posed by both types to their users and the whole financial systems. An empirical part focuses on the European market. Time span...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublikacjaGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Entropic Measures of Complexity of Short-Term Dynamics of Nocturnal Heartbeats in an Aging Population
PublikacjaTwo entropy-based approaches are investigated to study patterns describing differences in time intervals between consecutive heartbeats. The first method explores matrices arising from networks of transitions constructed following events represented by a time series. The second method considers distributions of ordinal patterns of length three, whereby patterns with repeated values are counted as different patterns. Both methods provide...
-
Navigating the Complexity: Understanding Social Integration in Smart Communities versus Smart Cities
PublikacjaThis study delves into the differentiation between smart community and smart city concepts, employing a comprehensive review of conceptual literature. The aim of this study is to identify and deliberate on the nuanced disparities between these two paradigms. By establishing pivotal distinctions, we aim to scrutinize the integration of social aspects in the development and implementation of smart communities. Our findings will offer...
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublikacjaArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
Pyrrole azocrown ethers. Synthesis, complexation, selective lead transport and ion-selective membrane electrode studies
PublikacjaOtrzymano nowe, 21-członowe, lipofilowe etery koronowe z jednostką pirolową i dwoma grupami azowymi jako składowymi makrocyklu. Właściwości kompleksujące tych nowych oraz dwóch wcześniej otrzymanych makrocykli zbadano w acetonitrylu. Ligandy te zostały użyte jako jonofory w badaniach konkurencyjnego transportu równomolowej mieszaniny jonów metali: Co2+, Ni2+, Cu2+, Zn2+, Cd2+, Ag2+, Pb2+ w układzie woda(pH 4.9)/chloroform/woda(pH...
-
Complicity-An International Journal of Complexity and Education
Czasopisma -
Reshaping the Gdańsk Shipyard—The Birthplace of the Solidarity Movement. The Complexity of Adaptive Reuse in the Heritage Context
PublikacjaThe Gdańsk Shipyard—the birthplace of the Solidarity movement—is host to a unique example of a multi-layered brownfield redevelopment project, an area that is burdened by a complex history, overlapping heritage, and multiple memories. These circumstances require an integrated yet differentiated approach to the site’s heritage and make the creation of one homogeneous narration of its future impossible. At the same time, the size...
-
Molecular Modeling of the Neurohypophyseal Receptor/Atosiban Complexes
Publikacja -
Polysaccharide–Protein Complexes in a Coarse-Grained Model
Publikacja -
Formation of carboxymethyl cellulose–casein complexes by electrosynthesis
Publikacja -
Apple pectin complexes with whey protein isolate
Publikacja -
Iron complexes with terminal and nonbridging phosphanido ligands
PublikacjaThis review discusses known iron complexes with terminal-bonded and nonbridging phosphanido ligands R2Pand their analogs, such as phosphanylphosphanido, borylphosphanido and oligophosphanido groups, that have been reported since 1960s. Particular attention is focused on the synthesis and structural features of these complexes, which have a direct impact on their philicity and further reactivity. Moreover, their application in catalysis...