Wyszukiwarka
Filtry
wszystkich: 530
wybranych: 487
Wyniki wyszukiwania dla: query complexity
-
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...
-
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...
-
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...
-
NGOization: Complicity, Contradictions and Prospects
Publikacja -
Implementation complexity analysis of the turbo decoding algorithms on digital signal processor
Publikacja -
Mapping the complexity of dementia: factors influencing cognitive function at the onset of dementia
Publikacja -
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.
-
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...
-
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:...
-
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.
-
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...
-
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...
-
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...
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublikacjaW pracy pokazano, że problem L(p,q)-kolorowania przy użyciu ''t'' kolorów jest NP-zupełny nawet w wersji ograniczonej do grafów planarnych dwudzielnych małego stopnia, nawet dla stosunkowo niewielkich wartości ''t''. Jako wniosek z uzyskanych wyników stwierdzono, że problem L(2,1)-kolorowania grafów planarnych przy użyciu 4 kolorów jest NP-zupełny, a także że problem L(p,q)-kolorowania grafów o maksymalnym stopniu 4 jest NP-zupełny...
-
Complexity analysis of the Pawlak’s flowgraph extension for re-identification in multi-camera surveillance system
PublikacjaThe idea of Pawlak’s flowgraph turned out to be a useful and convenient container for a knowledge of objects’ behaviour and movements within the area observed with a multi-camera surveillance system. Utilization of the flowgraph for modelling behaviour admittedly requires certain extensions and enhancements, but it allows for combining many rules into a one data structure and for obtaining parameters describing how objects tend...
-
Two-Rate Based Low-Complexity Variable Fractional-Delay FIR Filter Structures
PublikacjaThis paper considers two-rate based structures for variable fractional-delay (VFD) finite-length impulse response (FIR) filters. They are single-rate structures but derived through a two-rate approach. The basic structure considered hitherto utilizes a regular half-band (HB) linear-phase filter and the Farrow structure with linear-phase subfilters. Especially for wide-band specifications, this structure is computationally efficient...
-
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...
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublikacjaConsider a generalization of the classical binary search problem in linearly sorted data to the graph-theoretic setting. The goal is to design an adaptive query algorithm, called a strategy, that identifies an initially unknown target vertex in a graph by asking queries. Each query is conducted as follows: the strategy selects a vertex q and receives a reply v: if q is the target, then =, and if q is not the target, then v is a...
-
Complixity results on open shop scheduling to minimize total cost of operations
PublikacjaW pracy zaprezentowano serię rezultatów dotyczących złożoności obliczeniowejproblemu szeregowania w systemie otwartym z kryterium łącznego kosztu opera-cji. W ogólności problem jest NP-trudny nawet w przypadku 1-procesorowym.Dlatego zaprezentowano możliwie wiele przypadków szczególnych, które są wie-lomianowe. Są one funkcją długości operacji i struktury grafu konfliktów po-między zadaniami.
-
Computational complexity and length of recorded data for fluctuation enhanced sensing method in resistive gas sensors
PublikacjaThis paper considers complexity and accuracy of data processing for gas detection using resistance fluctuation data observed in resistance gas sensors. A few selected methods were considered (Principal Component Analysis – PCA, Support Vector Machine – SVM). Functions like power spectral density or histogram were used to create input data vector for these algorithms from the observed resistance fluctuations. The presented considerations...
-
Computational Complexity and Its Influence on Predictive Capabilities of Machine Learning Models for Concrete Mix Design
PublikacjaThe design of concrete mixtures is crucial in concrete technology, aiming to produce concrete that meets specific quality and performance criteria. Modern standards require not only strength but also eco-friendliness and production efficiency. Based on the Three Equation Method, conventional mix design methods involve analytical and laboratory procedures but are insufficient for contemporary concrete technology, leading to overengineering...
-
Assessing business process complexity based on textual data: Evidence from ITIL IT ticket processing
PublikacjaPurpose This study aims to draw the attention of business process management (BPM) research and practice to the textual data generated in the processes and the potential of meaningful insights extraction. The authors apply standard natural language processing (NLP) approaches to gain valuable knowledge in the form of business process (BP) complexity concept suggested in the study. It is built on the objective, subjective and meta-knowledge...
-
Effect of electron count and chemical complexity in the Ta-Nb-Hf-Zr-Ti high-entropy alloy superconductor
PublikacjaHigh-entropy alloys are made from random mixtures of principal elements on simple lattices, stabilized by a high mixing entropy. The recently discovered body-centered cubic (BCC) Ta-Nb-Hf-Zr-Ti high-entropy alloy superconductor appears to display properties of both simple crystalline intermetallics and amorphous materials; e.g., it has a well-defined superconducting transition along with an exceptional robustness against disorder....
-
Complexing and Chelating Agents Immobilized on Silica Gel and Related Materials and Their Application for Sorption of Inorganic Species
Publikacja -
Temporal Changes in Complexity of Cardiovascular Regulation during Head-Up Tilt Test by Entropic Measures of Fluctuations of Heart Period Intervals and Systolic Blood Pressure
PublikacjaTemporal changes in complexity of cardiovascular regulation during head-up tilt test by entropic measures of fluctuations of heart period intervals and systolic blood pressure
-
Silicon polypodands: powerful metal cation complexing agents and solid–liquid phase-transfer catalysts of new generation
Publikacja -
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...
-
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,...
-
Information Retrieval with the Use of Music Clustering by Directions Algorithm
PublikacjaThis paper introduces the Music Clustering by Directions (MCBD) algorithm. The algorithm is designed to support users of query by humming systems in formulating queries. This kind of systems makes it possible to retrieve songs and tunes on the basis of a melody recorded by the user. The Music Clustering by Directions algorithm is a kind of an interactive query expansion method. On the basis of query, the algorithm provides suggestions...
-
An Approach to Data Reduction for Learning from Big Datasets: Integrating Stacking, Rotation, and Agent Population Learning Techniques
Publikacja -
Overcoming “Big Data” Barriers in Machine Learning Techniques for the Real-Life Applications
Publikacja -
Advances in Architectures, Big Data, and Machine Learning Techniques for Complex Internet of Things Systems
PublikacjaTe feld of Big Data is rapidly developing with a lot of ongoing research, which will likely continue to expand in the future. A crucial part of this is Knowledge Discovery from Data (KDD), also known as the Knowledge Discovery Process (KDP). Tis process is a very complex procedure, and for that reason it is essential to divide it into several steps (Figure 1). Some authors use fve steps to describe this procedure, whereas others...
-
NLP Questions Answering Using DBpedia and YAGO
PublikacjaIn this paper, we present results of employing DBpedia and YAGO as lexical databases for answering questions formulated in the natural language. The proposed solution has been evaluated for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference). Our method uses dependency trees generated from the user query. The trees are browsed for paths leading from the root of the tree to the question...
-
DBpedia and YAGO Based System for Answering Questions in Natural Language
PublikacjaIn this paper we propose a method for answering class 1 and class 2 questions (out of 5 classes defined by Moldovan for TREC conference) based on DBpedia and YAGO. Our method is based on generating dependency trees for the query. In the dependency tree we look for paths leading from the root to the named entity of interest. These paths (referenced further as fibers) are candidates for representation of actual user intention. The...
-
Nowe wyzwania, nowe rozwiązania. Jak przedsiębiorstwo branży IT odnajduje się w erze VUCA?
PublikacjaZmienność, niepewność, złożoność i niejednoznaczność, określane akronimem VUCA (volatility, uncertainty, complexity, ambiguity) towarzyszą funkcjonowaniu każdego przedsiębiorstwa. Jak wykorzystać te nieodłączne cechy otoczenia przedsiębiorstw jako szanse dla ich rozwoju to wy-zwania stojące przed nimi, a zarazem pytanie badawcze artykułu. Celem artykułu jest wykazanie, na przykładzie przedsiębiorstwa branży IT, że analiza zmienności,...
-
SMAQ - A Semantic Model for Analitical Queries
PublikacjaWhile the Self-Service Business Intelligence (BI) becomes an important part of organizational BI solutions there is a great need for new tools allowing to construct ad-hoc queries by users with various responsibilities and skills. The paper presents a Semantic Model for Analytical Queries – SMAQ allowing to construct queries by users familiar with business events and terms, but being unaware of database or data warehouse concepts...
-
Lower rim substituted tert-butylcalix[4]arenes (II). Complexing ability of5,11,17,23-tetra-tert-butyl-25,26,27,28-tetrakis-O-(piperidinylcarbonyl)me- thylenecalix[4]arene. The crystal structures of the ligand and its sodium complex
PublikacjaSyntezowano kompleksy wymienionego w tytule liganda z chlorkiem sodu i azotanami itru(III), lantanu(III), samaru(III) i gadolinu(III) w reakcji liganda i odpowiedniej soli, które charakteryzowano za pomocą widm IR, UV-vis,1H NMR, FAB-MS, a także za pomocą analizy elementarnej. W reakcji wymiany z kompleksu z sodem otrzymywano kompleksy z lantanowcami. Określono strukturę krystaliczną wolnego liganda i jego kompleksu z sodem za...
-
Music Information Retrieval – Soft Computing versus Statistics . Wyszukiwanie informacji muzycznej - algorytmy uczące versus metody statystyczne
PublikacjaMusic Information Retrieval (MIR) is an interdisciplinary research area that covers automated extraction of information from audio signals, music databases and services enabling the indexed information searching. In the early stages the primary focus of MIR was on music information through Query-by-Humming (QBH) applications, i.e. on identifying a piece of music by singing (singing/whistling), while more advanced implementations...
-
LSA Is not Dead: Improving Results of Domain-Specific Information Retrieval System Using Stack Overflow Questions Tags
PublikacjaThe paper presents the approach to using tags from Stack Overflow questions as a data source in the process of building domain-specific unsupervised term embeddings. Using a huge dataset of Stack Overflow posts, our solution employs the LSA algorithm to learn latent representations of information technology terms. The paper also presents the Teamy.ai system, currently developed by Scalac company, which serves as a platform that...
-
Listening to Live Music: Life beyond Music Recommendation Systems
PublikacjaThis paper presents first a short review on music recommendation systems based on social collaborative filtering. A dictionary of terms related to music recommendation systems, such as music information retrieval (MIR), Query-by-Example (QBE), Query-by-Category (QBC), music content, music annotating, music tagging, bridging the semantic gap in music domain, etc. is introduced. Bases of music recommender systems are shortly presented,...
-
Relation-based Wikipedia Search System for Factoid Questions Answering
PublikacjaIn this paper we propose an alternative keyword search mechanism for Wikipedia, designed as a prototype solution towards factoid questions answering. The method considers relations between articles for finding the best matching article. Unlike the standard Wikipedia search engine and also Google engine, which search the articles content independently, requiring the entire query to be satisfied by a single article, the proposed...
-
Asymmetric Renyi Problem and > PATRICIA Tries
PublikacjaIn 1960 R´enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have theselabels? Weconsider here anasymmetric version of the problem in which in every query an object is chosenwith probability p > 1/2 and we ignore “inconclusive” queries. We study the number of queries needed...
-
Ideologiczny i praktyczny model metaontologii
PublikacjaRozwój inicjatywy Semantic Web spowodował rozwój różnych języków definiowania wiedzy i manipulowania nią. W ramach tych języków istotnym elementem jest zaprojektowanie rozkazów terminologicznych. W artykule przedstawiono sposób realizacji zapytań terminologicznych w języku KQL (Knowledge Query Language) - języku dostępu do systemu zarządzania wiedzą RKaSeA.
-
Ideological and Practical Model of Metaontology
PublikacjaRozwój inicjatywy Semantic Web spowodował rozwój różnych języków definiowania wiedzy i manipulowania nią. W ramach tych języków istotnym elementem jest zaprojektowanie rozkazów terminologicznych. W artykule przedstawiono sposób realizacji zapytań terminologicznych w języku KQL (Knowledge Query Language), służącym do dostępu do systemu zarządzania wiedzą RKaSeA.
-
Issues related to noise and protection against noise against the background of hazards present in the working environment
PublikacjaNoise is one of the physical factors that poses the greatest threat in the working environment. In order to reduce the noise exposure, noise reduction at the source should be considered. Next, the engineering and administrative controls are being developed. Finally, hearing protectors are used. Issues related to protection against noise are part of the topics in the field of occupational...
-
Management of Textual Data at Conceptual Level
PublikacjaThe article presents the approach to the management of a large repository of documents at conceptual level. We describe our approach to representing Wikipedia articles using their categories. The representation has been used to construct groups of similar articles. Proposed approach has been implemented in prototype system that allows to organize articles that are search results for a given query. Constructed clusters allow to...