Filters
total: 600
filtered: 554
Search results for: MESSAGE COMPLEXITY
-
NGOization: Complicity, Contradictions and Prospects
Publication -
Cosmic-Time Quantum Mechanics and the Passage-of-Time Problem
PublicationA new dynamical paradigm merging quantum dynamics with cosmology is discussed.
-
Mapping the complexity of dementia: factors influencing cognitive function at the onset of dementia
Publication -
Implementation complexity analysis of the turbo decoding algorithms on digital signal processor
Publication -
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn 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
PublicationWe 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.
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn 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...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn 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:...
-
Modeling of Ice Passage Through Reservoirs System on the Vistula River
PublicationNumerical model was used to assess ice passage through proposed reservoir on the lower Vistula River. Model results were compared with observation on the Vistula River, but because the dam is not constructed yet, the direct comparison was not possible. The study focused on ice movement and accumulation in the reservoir for variety of low flow condition with and without wind effect. Bridge’s piers in the upper part of the reservoir...
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł 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.
-
Towards increasing F-measure of approximate string matching in O(1) complexity
PublicationThe 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
PublicationThe 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
PublicationTwo 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...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven 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...
-
The complexity of the L(p,q)-labeling problem for bipartite planar graphs of small degree
PublicationW 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...
-
Two-Rate Based Low-Complexity Variable Fractional-Delay FIR Filter Structures
PublicationThis 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...
-
Complexity analysis of the Pawlak’s flowgraph extension for re-identification in multi-camera surveillance system
PublicationThe 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...
-
Reshaping the Gdańsk Shipyard—The Birthplace of the Solidarity Movement. The Complexity of Adaptive Reuse in the Heritage Context
PublicationThe 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...
-
Complixity results on open shop scheduling to minimize total cost of operations
PublicationW 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
PublicationThis 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...
-
Assessing business process complexity based on textual data: Evidence from ITIL IT ticket processing
PublicationPurpose 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
PublicationThe 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...
-
DYNAMIC ANALYSIS OF THE RAILWAY BRIDGES IN POLAND WITH REGARDS TO HIGH-SPEED TRAINS PASSAGE ADJUSTMENT
PublicationThe dynamic analysis of the railway bridge in Tczew was carried out in the article as an example of such bridges adaptation suitability to handle high-speed trains. Calculations of railway bridges are greatly complicated and labor-consuming. The bridge model and a rolling stock passage simulation were developed in the SOFISTIK software. Three types of elements were used for the correct mapping of the structure in the calculation...
-
Effect of electron count and chemical complexity in the Ta-Nb-Hf-Zr-Ti high-entropy alloy superconductor
PublicationHigh-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....
-
Analysis of pavement structure sensitivity to passage of oversized heavy duty vehicle in terms of bearing capacity
PublicationOversized heavy duty vehicles occur in traffic very rarely but they reach extremely high weights, even up to 800 tonne. The detrimental impact of these vehicles on pavement structure is much higher than in case of commercial vehicles that comprise typical traffic, thus it is necessary to assess the sensitivity of pavement structure to passage of oversized vehicles. The paper presents results of sample calculations of load equivalency factor...
-
Complexing and Chelating Agents Immobilized on Silica Gel and Related Materials and Their Application for Sorption of Inorganic Species
Publication -
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
PublicationTemporal 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
Publication -
Lower rim substituted tert-butylcalix[4]arenes.Part 8: Calix[4]arenes with dialkoxyphosphoryl functions. Synthesis and complexing properties
PublicationW 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,...
-
PHONEME DISTORTION IN PUBLIC ADDRESS SYSTEMS
PublicationThe quality of voice messages in speech reinforcement and public address systems is often poor. The sound engineering projects of such systems take care of sound intensity and possible reverberation phenomena in public space without, however, considering the influence of acoustic interference related to the number and distribution of loudspeakers. This paper presents the results of measurements and numerical simulations of the...
-
An Approach to Data Reduction for Learning from Big Datasets: Integrating Stacking, Rotation, and Agent Population Learning Techniques
Publication -
Overcoming “Big Data” Barriers in Machine Learning Techniques for the Real-Life Applications
Publication -
Advances in Architectures, Big Data, and Machine Learning Techniques for Complex Internet of Things Systems
PublicationTe 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...
-
A Review of Traffic Analysis Attacks and Countermeasures in Mobile Agents' Networks
PublicationFor traditional, message-based communication, traffic analysis has been already studied for over three decades and during that time various attacks have been recognised. As far as mobile agents’ networks are concerned only a few, specific-scope studies have been conducted. This leaves a gap that needs to be addressed as nowadays, in the era of Big Data, the Internet of Things, Smart Infrastructures and growing concerns for privacy,...
-
Information-driven network resilience: Research challenges and perspectives
PublicationInternet designed over 40 years ago was originally focused on host-to-host message delivery in a best-effort manner. However, introduction of new applications over the years have brought about new requirements related with throughput, scalability, mobility, security, connectivity, and availability among others. Additionally, convergence of telecommunications, media, and information technology was responsible for transformation...
-
PROGRAMMABLE YANG - BASED INTERFACE IN CONTROL OF OPTICAL TRANSPORT NETWORK
PublicationSince over a decade we observe intensive effort of research institutions and industrial consortia on extending flexibility and automation of the transport network control also known under the term network programmability. Key aspect of each programming interface is ability to evolve but also sensitivity to future modifications. As indicated in the past work in the specific context of optical transport networks an important criterion...
-
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
PublicationSyntezowano 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...
-
Zero-knowledge convincing protocol on quantum bit is impossible
PublicationIt is one of fundamental features of quantum formalism that o n one hand it provides a new infor- mation processing resources and on the other hand puts funda mental constraints on the processing of quantum information implying “no-go” theorems for cloni ng [1–3], bit commitment [4, 5] and deleting [6] in quantum theory. Here we ask about possibilit y of “zero knowledge” scenario which, for its simplicity, can be considered as...
-
Enhanced Remote Control Providing Medical Functionalities
PublicationThis paper presents the enhanced remote control and its role in pervasive healthcare in the home. The device was equipped with health-related measurement modules and a message-processing unit. Preliminary results are presented for monitoring of a pulse, hand tremors, grip forces, and for self evaluation procedures. The interaction of the device with the smart environment is presented and discussed.
-
Mechanizmy komunikacji w rozproszonych systemach specjalnego przeznaczenia
PublicationZadania ochrony i bezpieczeństwa granic państwa realizowane przez Straż Graniczną wymagają wsparcia ze strony nowoczesnych systemów Technologii Informacyjnych (TI) uwarunkowanych ich specjalnym przeznaczeniem. Z uwagi na charakter tej służby, rozwiązania dla jej potrzeb muszą być realizowane jako systemy rozproszone umożliwiające przenoszenie i przetwarzanie informacji głosowych oraz różnorodnych danych, w tym specjalnego przeznaczenia....
-
Reinforced Secure Gossiping Against DoS Attacks in Post-Disaster Scenarios
PublicationDuring and after a disaster, the perceived quality of communication networks often becomes remarkably degraded with an increased ratio of packet losses due to physical damages of the networking equipment, disturbance to the radio frequency signals, continuous reconfiguration of the routing tables, or sudden spikes of the network traffic, e.g., caused by the increased user activity in a post-disaster period. Several techniques have...
-
Designing digital displays and interactive media in today’s cities by night. Do we know enough about attracting attention to do so?
PublicationWith the huge transformation in the development of digital screen technology and its consistently decreasing cost, digital billboards are progressively replacing traditional static, two-dimensional poster advertisements in our cities1. Previously, due to the substantial expenditure involved, they were only available to major international brands with vast promotional resources to build their brand fame. Today, however, they are...
-
C2 NIWA Community-Segmentation Criteria and Building Brand Associations on the Example of a Selected Target Group
PublicationEvery organization which offers products or services wishes to communicate with their customers in the most effective way. This kind of communication is based on proper selection of target groups, which are extracted in the process of market segmentation. That is way it is very important to ask the question to whom the message is to be directed and what kind of message we want to give. This article describes the selection criteria...
-
DYNAMIC ANALYSIS OF HISTORIC RAILWAY BRIDGES IN POLAND IN THE CONTEXT OF ADJUSTING THEM TO PENDOLINO TRAINS
PublicationThe article presents the dynamic analysis of the historic railway bridge in Tczew as an example of the usefulness of such type of bridge for high-speed trains. The model of the bridge and the simulation of rolling stock passage was performed in SOFISTIK program. The scope of work includes experimental studies, the solution of the problem concerning the correct solution features dynamic model takes into account the dependencies...
-
A distributed system for conducting chess games in parallel
PublicationThis paper proposes a distributed and scalable cloud based system designed to play chess games in parallel. Games can be played between chess engines alone or between clusters created by combined chess engines. The system has a built-in mechanism that compares engines, based on Elo ranking which finally presents the strength of each tested approach. If an approach needs more computational power, the design of the system allows...
-
Transmitting Alarm Information in DAB+ Broadcasting System
PublicationThe main goal of digital broadcasting is to deliver high-quality content with the lowest possible bitrate. This paper is focused on transmitting alarm information, such as emergency warning and alerting, in the DAB+ (Digital Audio Broadcasting plus) broadcasting system. These additional services should be available at the lowest possible bitrate, in order to provide a clear and understandable voice message to people. Furthermore, additional...
-
Research on GNSS satellite navigation systems
PublicationThis article contains results of research on two GNSS systems, i.e. GPS and GLONASS. Architectures, signal structures and navigation messages of both systems have been described. Some selected investigation results, concerning receiver performance in presence of interference, have been presented.
-
Review of Diameter protocol implementations for realization of communication in NGN networks
PublicationIn the paper Diameter protocol as well as its applications in the context of Next Generation Network (NGN) are described. Diameter message content and Attribute-Value Pairs (AVPs) concept are presented. Critical review of open source Diameter implementations is carried out. The performed analysis takes into consideration programming language, availability, support and documentation aspects. Basing on the review project fulfilling...
-
Matching Exception Class Hierarchies between .NET, Java Environments
PublicationThe paper presents a methodology of exception classification and matching exception messages between .NET andJava environments. The methodology operates on existing exception class hierarchies and proposes two complementingapproaches: automated and manual matching. The automated matching uses the similarity measure to find associationsbetween exception messages from the two sets of classes for the considered programming languages....
-
An Efficient Noisy Binary Search in Graphs via Median Approximation
PublicationConsider 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...