Filtry
wszystkich: 449
Wyniki wyszukiwania dla: COMPLEXITY
-
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.
-
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.
-
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 -
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 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...
-
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...
-
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.
-
Complicity-An International Journal of Complexity and Education
Czasopisma -
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...
-
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...
-
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...
-
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...
-
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...
-
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....
-
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
-
Journal of Open Innovation: Technology, Market, and Complexity
Czasopisma -
Workshop on Parameterized Complexity
Konferencje -
Algorithms and Complexity in Durham
Konferencje -
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...
-
IEEE Conference on Computational Complexity
Konferencje -
DIMACS Workshop on Intrinsic Complexity of Computation
Konferencje -
International Conference on Computability and Complexity in Analysis
Konferencje -
Complexity and information-theoretic approaches to biology
Konferencje -
International Colloquium on Structural Information and Communication Complexity
Konferencje -
International Conference on Algorithms and Complexity (was Italian Conference )
Konferencje -
TAI: Algorithmic Information Theory: Kolmogorov Complexity
Konferencje -
International Workshop on Logic and Complexity in Computer Science
Konferencje -
International Conference on Complexity, Future Information Systems and Risk
Konferencje -
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublikacjaThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Systematic Assessment of Product Quality
PublikacjaThe article describes an innovative metrizable idea for systemic assessments of product quality within the baking industry. Complex product quality analysis requires the employment of metrizability criteria for factors that impact the quality of the product, and these are called determinants. Therefore, such analysis is only possible with the use of systems engineering. A system represents the potential of a manufacturing process,...
-
Trouble in Paradise? Barriers to Open Innovation in Regional Clusters in the Era of the 4th Industrial Revolution
PublikacjaThe purpose of this paper is to provide an insight into the barriers faced by clusters as open innovation intermediaries. Literature review and an empirical study were performed, involving a nation-wide survey, case studies, and in-depth interviews with cluster actors involved in open innovation activities. This article conceptually links open innovation and clusters in the context of the fourth industrial revolution, empirically...
-
Marek Kubale prof. dr hab. inż.
OsobyDetails concerning: Qualifications, Experiences, Editorial boards, Ph.D. theses supervised, Books, and Recent articles can be found at http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/Marek_KubaleGoogle ScholarSylwetka prof. Marka Kubalego Prof. Marek Kubale pracuje na Wydziale ETI Politechniki Gdańskiej nieprzerwanie od roku 1969. W tym czasie napisał ponad 150 prac naukowych, w tym ponad 40 z listy JCR. Ponadto...
-
Michał Małafiejski dr hab. inż.
OsobyMichał Małafiejski urodził się w 1975 roku. Uzyskał tytuł zawodowy magistra inżyniera informatyka w 1999 roku. W 2002 roku uzyskał stopień doktora nauk technicznych w dyscyplinie informatyka, a w 2014 roku stopień doktora habilitowanego w tej samej dziedzinie. Obecnie pracuje jako profesor nadzwyczajny w Katedrze Algorytmów i Modelowania Systemów. Jest autorem licznych prac z zakresu informatyki teoretycznej i matematyki dyskretnej....
-
Source code - AI models (MLM1-5 - series I-III - QNM opt)
Dane BadawczeSource code - AI models (MLM1-5 - series I-III - QNM opt) for the paper "Computational Complexity and Its Influence on Concrete Compressive Strength Prediction Capabilities of Machine Learning Models for Concrete Mix Design Support" accepted for publication.
-
Joanna Raczek dr inż.
OsobyWykształcenie 1997 -- 2001 Studia inżynierskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2001 -- 2003 Studia magisterskie, Wydział Fizyki Technicznej i Matematyki Stosowanej, Politechnika Gdańska. Kierunek: Matematyka, specjalność: Matematyka Stosowana. 2000 -- 2004 Studia inżynierskie, Wydział Elektroniki, Informatyki i Telekomunikacji,...
-
Multi-Criteria Knowledge-Based Recommender System for Decision Support in Complex Business Processes
PublikacjaIn this paper, we present a concept of a multi-criteria knowledge-based Recommender System (RS) designed to provide decision support in complex business process (BP) scenarios. The developed approach is based on the knowledge aspects of Stylistic Patterns, Business Sentiment and Decision-Making Logic extracted from the BP unstructured texts. This knowledge serves as an input for a multi-criteria RS algorithm. The output is prediction...
-
How can systems thinking help us in the COVID‐19 crisis?
PublikacjaThe COVID-19 pandemic outbreak remains one of the most influential events in the global economy over the recent years. While being primarily public health related, it has a tremendous impact on many other aspects, including business management. Many businesses were forced to introduce rapid changes to their business models in order to survive. The aim of this paper is to show the complexity and interrelations of changes triggered...
-
Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublikacjaIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
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...
-
Sample Rate Conversion Based on Frequency Response Masking Filter
PublikacjaThe sample rate conversion with high resampling ratios requires low-pass digital filters with very narrow transition band which results in high computational complexity and makes filter design problematic. Therefore in this work we propose to use the FRM method, which breaks the filter with a narrow transition band into a group of filters with reduced design requirements. These decreases the number of non-zero coefficients and...
-
A Developer's View of Application Servers Interoperability
PublikacjaThe paper describes analysis of application servers interoperability that considers both the available level of integration and the required level of development complexity. Development complexity ranges from simple GUI operations to changes of undocumented features in configuration files. We verify if an integration can be established on a given level of development complexity, rather than verify if it is objectively feasible....
-
Finite-window RLS algorithms
PublikacjaTwo recursive least-squares (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions of these algorithms. However, these two windows are not always the best choice for identification of fast time-varying systems, when the identification performance is most important. In this paper, we...