Wyniki wyszukiwania dla: COMPUTATIONAL COMPLEXITY
-
Machine learning-based seismic response and performance assessment of reinforced concrete buildings
PublikacjaComplexity and unpredictability nature of earthquakes makes them unique external loads that there is no unique formula used for the prediction of seismic responses. Hence, this research aims to implement the most well-known Machine Learning (ML) methods in Python software to propose a prediction model for seismic response and performance assessment of Reinforced Concrete Moment-Resisting Frames (RC MRFs). To prepare 92,400 data...
-
Multi-objective optimization of expensive electromagnetic simulation models
PublikacjaVast majority of practical engineering design problems require simultaneous handling of several criteria. For the sake of simplicity and through a priori preference articulation one can turn many design tasks into single-objective problems that can be handled using conventional numerical optimization routines. However, in some situations, acquiring comprehensive knowledge about the system at hand, in particular, about possible...
-
Hardware implementation of digital image stabilization using optical flow algorithm and FPGA technology
PublikacjaW artykule przedstawiono efektywną procedurę uproszczenia algorytmu przepływu optycznego oraz jego realizację w układzie programowalnym FPGA. Zmodyfikowany algorytm wykorzystuję metodę blokowego dopasowania podobszarów oraz jednowymiarową reprezentację podobszarów. Dodatkowo, funkcja korelacji oparta jest o normę L1. W rezultacie uzyskano zmniejszenie zużytych zasobów kosztem nieznacznej utraty dokładności. Zarówno dokładność,...
-
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 -
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...
-
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...
-
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...
-
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...
-
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....
-
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
-
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...
-
Mind the framing: Match purpose and context
PublikacjaIn several ways, the following chapters will allude to the concept of frames. The assumptions of a mathematical model tell us what it can explain and what it cannot (see chapter 5). The trade-off between the usefulness of a mathemati- cal model and the scale of complexity it seeks to capture further conditions the narrative, highlighting or downsizing cognitive elements relevant to responsible modelling (see ‘Mathematics and tales’...
-
Building Project and Project Team Characteristics For Creating Hybrid Management Processes
PublikacjaThis paper introduces a method of building the characteristic of Software Development Project. Project characteristic is determined on the basis of several factors such as the complexity of Software Development Project and Project Team, results of historical projects and information on processes and methodologies, which are implemented in analyzed organizations. Information on project complexity can be applied to many different...
-
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...
-
Adaptive Identification of Underwater Acoustic Channel with a Mix of Static and Time-Varying Parameters
PublikacjaWe consider the problem of identification of communication channels with a mix of static and time-varying parameters. Such scenarios are typical, among others, in underwater acoustics. In this paper, we further develop adaptive algorithms built on the local basis function (LBF) principle resulting in excellent performance when identifying time-varying systems. The main drawback of an LBF algorithm is its high complexity. The subsequently...
-
Business Sentiment Analysis. Concept and Method for Perceived Anticipated Effort Identification
PublikacjaRepresenting a valuable human-computer interaction interface, Sentiment Analysis (SA) is applied to a wide range of problems. In the present paper, the researchers introduce a novel concept of Business Sentiment (BS) as a measurement of a Perceived Anticipated Effort (PAE) in the context of business processes (BPs). BS is considered as an emotional component of BP task contextual complexity perceived by a process worker after reading...
-
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...
-
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...
-
Propulsion and Maneuvering Systems’ Characteristics of the U.S. Flagged Great Lakes Self-Unloading Bulk Carriers
PublikacjaPaper contains an overview of the propulsion and maneuvering systems’ characteristics of United States flagged Great Lakes self - unloading bulk carriers. A contrast between the importance of the transport task carried by those vessels to their low number and considerable age suggests the need to review and understand their complexity as well as complexity of their operations in order to provide suitable energy- and operational...
-
A Regular Expression Matching Application with Configurable Data Intensity for Testing Heterogeneous HPC Systems
PublikacjaModern High Performance Computing (HPC) systems are becoming increasingly heterogeneous in terms of utilized hardware, as well as software solutions. The problems, that we wish to efficiently solve using those systems have different complexity, not only considering magnitude, but also the type of complexity: computation, data or communication intensity. Developing new mechanisms for dealing with those complexities or choosing an...
-
Graph security testing
PublikacjaSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...
-
Overhead wires detection by FPGA real-time image processing
PublikacjaThe paper presents design and hardware implementation of real-time image filtering for overhead wires detection divided on image processing and results presentation blocks. The image processing block was separated from the whole implementation, and its delay and hardware complexity was analysed. Also the maximum frequency of image processing of the proposed implementation was estimated.
-
Discovery of Stylistic Patterns in Business Process Textual Descriptions: IT Ticket Case
PublikacjaGrowing IT complexity and related problems, which are reflected in IT tickets,create a need for new qualitative approaches. The goal isto automate the extraction of main topics described in tickets in order to provide high quality support for the IT process workers and enablea smooth service delivery to the end user. Present paper proposes a method of knowledge extraction in a form of stylistic patterns in business...
-
Analysis of the construction, assembly and usage of specialized fixtures illustrated with an example of machining a lever
PublikacjaThe paper presents a method of quantitative assessment of manufacturability of the construction of specialized fixtures used in machining. The assumed, simplified assessment criteria include both the complexity of the construction with respect to time-consumption of manufacturing the components and their assembly, as well as the features of the usage of fixtures. The paper contains a study case connected with variably designed...
-
Dedicated scheduling of tasks to minimize mean flow time
PublikacjaThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
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.
-
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.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublikacjaIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Connections between Mutually Unbiased Bases and Quantum Random Access Codes
PublikacjaWe present a new quantum communication complexity protocol, the promise--Quantum Random Access Code, which allows us to introduce a new measure of unbiasedness for bases of Hilbert spaces. The proposed measure possesses a clear operational meaning and can be used to investigate whether a specific number of mutually unbiased bases exist in a given dimension by employing Semi--Definite Programming techniques.
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublikacjaAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
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.
-
On bidirectional preestimates and their application to identification of fast time-varying systems
PublikacjaWhen applied to the identification of time-varying systems, such as rapidly fading telecommunication channels, adaptive estimation algorithms built on the local basis function (LBF) principle yield excellent tracking performance but are computationally demanding. The subsequently proposed fast LBF (fLBF) algorithms, based on the preestimation principle, allow a substantial reduction in complexity without significant performance...
-
Identification of regions of interest in video for a traffic monitoring system
PublikacjaA system for automatic event detection in the camera image is presented in this paper. A method of limiting a region of interest to relevant parts of the image using a set of processing procedures is proposed. Image processing includes object detection with shadow removal performed in the modified YCbCr color space instead of RGB. The proposed procedures help to reduce the complexity of image processing algorithm and result in...
-
Correlation between in vitro and in vivo data on food digestion. What can we predict with static in vitro digestion models?
PublikacjaDuring the last decade, there has been a growing interest in understanding food's digestive fate in order to strengthen the possible effects of food on human health. Ideally, food digestion should be studied in vivo on humans but this is not always ethically and financially possible. Therefore, simple in vitro digestion models mimicking the gastrointestinal tract have been proposed as alternatives to in vivo experiments. Thus,...
-
How can Systems Thinking Help Us Handling the COVID-19 Crisis?
PublikacjaPurpose: 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, such as public transport, education, and 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...
-
On Adaptive Spectrum Estimation of Multivariate Autoregressive Locally Stationary Processes
PublikacjaAutoregressive modeling is a widespread parametricspectrum estimation method. It is well known that, in the caseof stationary processes with unknown order, its accuracy canbe improved by averaging models of different complexity usingsuitably chosen weights. The paper proposes an extension of thistechnique to the case of multivariate locally stationary processes.The proposed solution is based on local autoregressive...
-
The Efficiency of Polish Stock Market: Ordinal Patterns Approach
PublikacjaZunino et al. analyzed the problem of discrimination of developed and emergent markets by the use of ordinal patterns methods: number of forbidden patterns and ordinal pattern probability distribution as a basis for entropy and statistical measure of complexity. In this paper we apply the same methodology for the analysis of Polish stock market (index WIG). The results indicate that Polish market belongs neither to developed, nor...
-
Adaptive Algorithm for Interactive Question-based Search
PublikacjaPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...
-
Gdańsk palimpsest. On obscuring and retrieving traces of memory
PublikacjaThe article deals with the problems of collective identity resulting from over one thousand year history of the city on the Motława river and the role of historical policy of the local authorities regarding the material cultural heritage of many nations and cultures. In our opinion, the palimpsestic (palimpsestueuse) character of the city plays a significant role in the discourse about the past of Gdańsk. We use that notion after...
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublikacjaWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Influence of statistical errors on damage detection based on structuralflexibility and mode shape curvature
PublikacjaDamage detection procedures based on measured natural frequencies and building structure mode shapes are discussed in this paper. Modal curvature and structural flexibility approaches are tested. Attention is paid to the modal identification errors that influence damage detection. This problem is studied using a computer simulation of a simple supported beam. For practical cases, the peak picking methodand its statistical errors...
-
Polarization interferometer using a Liquid Crystalline Polymer waveplate for wavelength measurement
PublikacjaA two-beam polarization interferometer for measuring wavelength changes of a tunable semiconductor laser was designed, built and tested. This interferometer uses a λ/8 waveplate made from Liquid Crystalline Polymer in order to generate two output signals in quadrature. The λ/8 waveplate can be manufactured either on a beamsplitter face or on the mirror surface, reducing the cost and complexity of the optomechnical assembly. Experiment...
-
Roadmap on dynamics of molecules and clusters in the gas phase
PublikacjaThis roadmap article highlights recent advances, challenges and future prospects in studies of the dynamics of molecules and clusters in the gas phase. It comprises nineteen contributions by scientists with leading expertise in complementary experimental and theoretical techniques to probe the dynamics on timescales spanning twenty orders of magnitudes, from attoseconds to minutes and beyond, and for systems ranging in complexity...
-
The Snow Team Problem
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Workers, Firms and Task Heterogeneity in International Trade Analysis: An Example of Wage Effects of Trade Within GVC.
PublikacjaObjective: The main aim of this article is to present how the heterogeneity of workers, firms, and tasks can be incorporated into empirical international trade analysis. In particular, we provide an empirical example in which we aim to quantify the reliance on foreign value added (FVA) within Global Value Chains (GVC) on wages. Research Design & Methods: We estimate a Mincerian wage model augmented with a measure of foreign value...
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublikacjaIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....