Search
Filters
total: 595
filtered: 544
Search results for: MESSAGE COMPLEXITY
-
MEMS based voice message system for elevators
PublicationW artykule przedstawiono implementację systemu głosowych komunikatów w windach. Prezentowany system posiada unikalną cechę polegającą na tym, że do działania nie potrzebuje połączenia z systemem sterującym windy. Zasilany z baterii lub akumulatorów może być zamontowany w ścianie windy, wymaga tylko prostej kalibracji. System oparty jest na akcelerometrach MEMS dokonujących pomiaru przeciążeń w kabinie windy. W artykule przedstawiono...
-
A taxonomy of challenges to resilient message dissemination in VANETs
PublicationInter-vehicular communications is seen as a promising solution to a number of issues related with public road safety, road congestion management, and infotainment. However, Vehicular Ad-hoc NETworks (VANETs) characterized by high mobility of vehicles and facing a number of other issues related with high frequency wireless communications and network disconnections, encounter major challenges related with reliability of message delivery....
-
Mining e-mail message sequences from log data
Publication -
The beauty of architectural complexity
Publication -
Routing equal-size messages on a slotted ring
PublicationAnalizujemy problem routingu wiadomości w sieci slotted ring, biorąc pod uwagę dwa kryteria optymalizacyjne: długość uszeregowania oraz liczbę 'cykli' pracy sieci. Optymalny routing dla wiadomości o rozmiarze k jest silnie NP-trudny, natomiast dla k=q, gdzie q jest rozmiarem sieci, można obliczyć w czsie O(n^2log n) dla pierwszego kryterium. Podajemy również algorytm o czasie działania O(nlog n) oraz o stałym współczynniku dobroci....
-
The clinical complexity of patients with acromegaly
Publication -
Complexity of resilient network optimisation
Publication -
On the complexity of resilient network design
Publication -
The complexity of node blocking for dags
PublicationRozważamy następującą grę (pomiędzy dwoma graczami) kombinatoryczną o nazwie ''node blocking''. Dany jest graf skierowany. Każdy wierzchołek może być zajęty przez co najwyżej jeden token. Wyróżniamy dwa kolory tokenów, biały i czarny, każdy gracz może przemieszczać tylko własne tokeny. Gracze wykonują ruchy naprzemiennie. Ruch polega na wyborze dowolnego tokena własnego koloru i przesunięciu go na dowolnego niezajętego przez inny...
-
Management of complexity and information flow
PublicationProblemy złożoności i zarządzania przepływem informacji. W rozdziale omówio-no podejście do modelowania systemów złożonych oraz zarządzania przepływeminformacji w takich systemach. Rozwiązania odniesiono do płaszczyzny elasty-cznego wytwarzania. Poruszono aspekty miękkiego modelowania w takich środo-wiskach.
-
On the complexity of distributed greedy coloring
PublicationW pracy rozważono problem kolorowania grafów przy dodatkowym założeniu, że kolor żadnego wierzchołka nie może zostać zmniejszony bez zmiany kolorów przynajmniej jednego z jego sąsiadów. Przeprowadzone rozważania dotyczyły złożoności obiczeniowej problemu w modelu Liniala obliczeń rozproszonych. Podano ograniczenia dolne i górne złożoności problemu oraz zestawiono problem z innymi pokrewnymi zagadnieniami grafowymi.
-
The complexity of list ranking of trees
PublicationUporządkowane kolorowanie grafu polega na takim etykietowaniu jego wierzchołków, aby każda ścieżka łącząca dwa wierzchołki o tym samym kolorze zawierała wierzchołek o kolorze wyższym. Jeśli każdy wierzchołek posiada dodatkowo listę dozwolonych dla niego etykiet, to mówimy wówczas o uporządkowanym listowym kolorowaniu wierzchołków. W pracy wskazano szereg klas grafów, dla których problem jest trudny: pełne drzewa binarne, drzewa...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Message Inter-Arrival and Inter-Departure Time Distributions in IMS/NGN Architecture
PublicationCurrently is it assumed that requirements of the information society for delivering multimedia services will be satisfied by the Next Generation Network (NGN) architecture, which includes elements of the IP Multimedia Subsystem (IMS) solution. In order to guarantee Quality of Service (QoS), NGN has to be appropriately designed and dimensioned. Therefore, proper traffic models should be proposed and applied. This requires determination...
-
Development and Research of the Text Messages Semantic Clustering Methodology
PublicationThe methodology of semantic clustering analysis of customer’s text-opinions collection is developed. The author's version of the mathematical models of formalization and practical realization of short textual messages semantic clustering procedure is proposed, based on the customer’s text-opinions collection Latent Semantic Analysis knowledge extracting method. An algorithm for semantic clustering of the text-opinions is developed,...
-
Complexity of a classical flow restoration problem
Publication -
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
The complexity of minimum-length path decompositions
PublicationWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
-
The complexity of zero-visibility cops and robber
PublicationWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
The Complexity of Zero-Visibility Cops and Robber
PublicationIn this work we deal with the computational complexity aspects of the zero-visibility Cops and Robber game. We provide an algorithm that computes the zero-visibility copnumber of a tree in linear time and show that the corresponding decision problem is NP-complete even for the class of starlike graphs.
-
Complexity Issues on of Secondary Domination Number
PublicationIn this paper we study the computational complexity issues of the problem of secondary domination (known also as (1, 2)-domination) in several graph classes. We also study the computational complexity of the problem of determining whether the domination and secondary domination numbers are equal. In particular, we study the influence of triangles and vertices of degree 1 on these numbers. Also, an optimal algorithm for finding...
-
The effectiveness of therapeutic massage in neck pain – prospective, preliminary studies
Publication -
A multi-label text message classification method designed for applications in call/contact centre systems
Publication -
Management of culture globalization message from the past. Ancient heritage as a tool for civilization development and improvement.
PublicationPraca zawiera propozycję odwołania się do kultury celtyckiej - jako wzorca w zarządzaniu rozmaitością kulturową.
-
Clinical complexity – where to find it and how to use it
Publication -
Complexity of weak acceptonic conditions in tree automata
PublicationRozważano złożoność problemu pustości dla automatów na drzewach ze słabymi warunkami akceptowalności. Rozważano także translacje pomiędzy słabymi i silnymi warunkami akceptowalności.
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Review of the Complexity of Managing Big Data of the Internet of Things
PublicationTere 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...
-
The complexity of the T-coloring problem for graphs with small degree
Publication -
Some results concerning the complexity of restricted colorings of graphs
Publication -
Scheduling jobs to contain a natural disaster: a model and complexity
Publicationthis 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...
-
On the complexity of distributed graph coloring with local minimality constraints
PublicationArtykuł 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.
-
The laws of thermodynamics: entropy, free energy, information and complexity
PublicationW rozdziale przedstawiono podstawowe Zasady Termodynamiki. Omówiono zagadnienia związane z pojęciem entropii, energii Gibbsa, egzergii oraz systemami złożonymi.
-
Smart systems integration: toward overcoming the problem of complexity
PublicationW 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.
PublicationW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
ANALYSIS OF EFFECTIVENESS AND COMPUTATIONAL COMPLEXITY OF TREND REMOVAL METHODS
PublicationThe 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...
-
Exploring application relationships within enterprise system by matching messages in enterprise log
PublicationWith data becoming their key asset, large enterprises require data governance processes to maintain its quality. Because a large portion of business value in enterprise systems is usually delivered by legacy applications without proper documentation, there is a need for a better understanding of these applications and the data produced by them. In this paper, we present an approach to collecting insights into the data managed by...
-
DATABASE AND BIGDATA PROCESSING SYSTEM FOR ANALYSIS OF AIS MESSAGES IN THE NETBALTIC RESEARCH PROJECT
PublicationA specialized database and a software tool for graphical and numerical presentation of maritime measurement results has been designed and implemented as part of the research conducted under the netBaltic project (Internet over the Baltic Sea – the implementation of a multi-system, self-organizing broadband communications network over the sea for enhancing navigation safety through the development of e-navigation services.) The...
-
Biopsychosocial complexity measured by health care needs in controlled acromegaly
Publication -
The final answer to the complexity of a basic problem in resilient network design
Publication -
Pre-arrangement of solvability, complexity, stability and quality of GPC systems
PublicationPraca 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...
-
Farrow structure for complex digital Hilbert filter of low complexity
PublicationW pracy przeanalizowano złożoność numeryczną filtru Hilberta (filtr zespolony), złożonego z pary filtrów cyfrowych o zmiennym opóźnieniu ułamkowym, o strukturze Farrowa. Struktura ta pozwala na zmianę opóźnienia ułamkowego na bieżąco, bez potrzeby każdorazowego przeprojektowywania filtru. Zaproponowano algorytmy/struktury wykorzystujące nie tylko symetrię oryginalnej struktury Farrowa, ale również wspólne elementy opóźniające podfiltrów...
-
A low complexity double-talk detector based on the signal envelope
PublicationA 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...
-
Assessing Grounding Frequency using Ship Traffic and Waterway Complexity
Publication -
Examination of the effect of altering model complexity on representing groundwater flow
PublicationW 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
PublicationWe 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...
-
Reduction of Computational Complexity in Simulations of the Flow Process in Transmission Pipelines
PublicationThe 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...
-
Teaching Architecture – contemporary challenges and threats in the complexity of built environment
PublicationThe 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...
-
Approximation of Message Inter-Arrival and Inter-Departure Time Distributions in IMS/NGN Architecture Using Phase-Type Distributions
PublicationCurrently it is assumed that requirements of the information society for delivering multimedia services will be satisfied by the Next Generation Network (NGN) architecture, which includes elements of the IP Multimedia Subsystem (IMS) solution. In order to guarantee Quality of Service (QoS), NGN has to be appropriately designed and dimensioned. Therefore, proper traffic models should be proposed and applied. This requires determination...
-
Acute Effects of Percussive Massage Treatment on Drop Jump Performance and Achilles Tendon Stiffness
Publication