Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "time complexity" wg kryterium: Wszystkie pola

  Lista filtrów

Dostawca treści

Wyrównaj
Wyświetlanie 1-15 z 21
Tytuł:
Entropic evolution of lexical richness of homogeneous texts over time : A dynamic complexity perspective
Autorzy:
Zhang, Y.
Powiązania:
https://bibliotekanauki.pl/articles/103947.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:
dynamic complexity
lexical richness
entropy
homogenous texts
language modeling
Opis:
This work concerns the evolving pattern of the lexical richness of the corpus text of China Government Work Report measured by entropy, based on a fundamental assumption that these texts are linguistically homogeneous. The corpus is interpreted and studied as a dynamic system, the components of which maintain spontaneous variations, adjustment, self-organizations, and adaptations to fit into the semantic, discourse, and sociolinguistic functions that the text is set to perform. Both the macroscopic structural trend and the microscopic fluctuations of the time series of the interested entropic process are meticulously investigated from the dynamic complexity theoretical perspective. Rigorous nonlinear regression analysis is provided throughout the study for empirical justifications to the theoretical postulations. An overall concave model with modulated fluctuations incorporated is proposed and statistically tested to represent the key quantitative findings. Possible extensions of the current study are discussed.
Źródło:
Journal of Language Modelling; 2015, 3, 2; 569-599
2299-856X
2299-8470
Pojawia się w:
Journal of Language Modelling
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Optimization Algorithm for Dilation and Erosion
Autorzy:
Yin, K.
Powiązania:
https://bibliotekanauki.pl/articles/108794.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi
Tematy:
dilation
erosion
optimization
iteration algorithm
time complexity analysis
Opis:
Effectively optimizing dilation and erosion is an extensively studied but not completely resolved problem. In this paper, a new optimization algorithm is proposed to improve the efficiency of dilation and erosion. Four notions are given to define the edges for any simply connected structuring element (SE). An assistant algorithm is proposed to detect these edges. Based on these notions, three iteration equations can be derived, which redefine dilation and erosion as iteration calculation. Time complexity of the new algorithm is reduced to O(n³). In addition, the new algorithm is suitable for online applications without the decomposition of SE. Simulation shows that with the same parameters, the performance of the new algorithm is better than that of Yang's algorithm.
Źródło:
Journal of Applied Computer Science Methods; 2011, 3 No. 1; 5-16
1689-9636
Pojawia się w:
Journal of Applied Computer Science Methods
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Real-time visibility transportation platform deployment. Evidence from business practice and insights for theory
Problem wdrożenia platformy transportowej zapewniającej widoczność w czasie rzeczywistym. Wnioski z badań i rekomendacje dla teorii
Autorzy:
Wyciślak, Sławomir
Powiązania:
https://bibliotekanauki.pl/articles/2087341.pdf
Data publikacji:
2021-10-31
Wydawca:
Polskie Wydawnictwo Ekonomiczne
Tematy:
supply chain visibility
transportation visibility platform
supply chain
supply chain complexity
digitization
łańcuch dostaw
widoczność w łańcuchu dostaw
sieć transportowa
złożoność
cyfryzacja
Opis:
The aim of the study is to contribute to supply chain visibility literature by addressing a gap between the expectations on the benefits of supply chain visibility and the successfully implemented cases. Determinants of a real- -time transportation visibility platform implementation were identified and explained and the reasons for not achieving the expected real-time visibility benefits from a platform in the transportation network with a predominant share of subcontracting were ranked. A complex network of fast-moving consumer goods companies was chosen for the research because of their greater need for visibility; visibility improvement is also more challenging for such companies. Asymmetry of risk, rewards, and benefits for freight forwarders and a real-time visibility platform hinder information sharing willingness. The in-depth analysis of entities involved in the platform deployment shows the tensions that platform governance can address. This study also provides insights on information utilization, including automating, informational, and transformational characteristics. This paper contributes to the supply chain visibility theoretical field by focusing on the practical development of real-time visibility from the standpoint of supply chain professionals.
Celem artykułu jest wniesienie wkładu w rozwój dyskusji naukowej dotyczącej widoczności łańcucha dostaw poprzez dociekania na temat luki między oczekiwaniami dotyczącymi korzyści z widoczności łańcucha dostaw a pomyślnymi wdrożeniami. Zidentyfikowano i wyjaśniono czynniki warunkujące wdrożenie platformy widoczności transportu w czasie rzeczywistym. Uszeregowano przyczyny nieosiągnięcia oczekiwanych korzyści z widoczności w czasie rzeczywistym za pomocą platformy w sieci transportowej z przeważającym udziałem podwykonawstwa. Do badań wybrano złożoną sieć z branży produktów szybko rotujących. Uczyniono tak dlatego, że w przypadku takiej sieci istnieje większa potrzeba widoczności, a jej poprawa jest trudniejsza. Asymetria ryzyka i korzyści dla spedytorów oraz platformy zmniejszają gotowość do wymiany informacji. Dogłębna analiza zachowań podmiotów zaangażowanych we wdrażanie platformy wskazuje na napięcia, które może rozwiązać zarządzanie platformą. Przeprowadzone badania skupiają się na analizie wykorzystania informacji w kontekście automatyzacji, informatyzacji i transformacji cyfrowej. Niniejszy artykuł przyczynia się do rozwoju rozważań dotyczących widoczności w łańcuchu dostaw.
Źródło:
Gospodarka Materiałowa i Logistyka; 2021, 10; 2-18
1231-2037
Pojawia się w:
Gospodarka Materiałowa i Logistyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficient Schur Parametrization and Modeling of p-Stationary Second-Order Time-Series for LPC Transmission
Autorzy:
Wielgus, A.
Zarzycki, J.
Powiązania:
https://bibliotekanauki.pl/articles/226070.pdf
Data publikacji:
2018
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
second-order nonstationary time-series
linear Schur parametrization/modeling
complexity reduction
Opis:
Following the results presented in [21], we present an efficient approach to the Schur parametrization/modeling of a subclass of second-order time-series which we term p-stationary time-series, yielding a uniform hierarchy of algorithms suitable for efficient implementations and being a good starting point for nonlinear generalizations to higher-order non-Gaussian nearstationary time-series.
Źródło:
International Journal of Electronics and Telecommunications; 2018, 64, 3; 343-350
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the relationship between fractal geometry of space and time in which a system of interacting cells exists and dynamics of gene expression.
Autorzy:
Waliszewski, Przemysław
Molski, Marcin
Konarski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/1044188.pdf
Data publikacji:
2001
Wydawca:
Polskie Towarzystwo Biochemiczne
Tematy:
complexity
neoplasia
fractal
differentiation
fractal dimension
Opis:
We report that both space and time, in which a system of interacting cells exists, possess fractal structure. Each single cell of the system can restore the hierarchical organization and dynamic features of the entire tumor. There is a relationship between dynamics of gene expression and connectivity (i.e., interconnectedness which denotes the existence of complex, dynamic relationships in a population of cells leading to the emergence of global features in the system that would never appear in a single cell existing out of the system). Fractal structure emerges owing to non-bijectivity of dynamic cellular network of genes and their regulatory elements. It disappears during tumor progression. This latter state is characterized by damped dynamics of gene expression, loss of connectivity, loss of collectivity (i.e., capability of the interconnected cells to interact in a common mode), and metastatic phenotype. Fractal structure of both space and time is necessary for a cellular system to self-organize. Our findings indicate that results of molecular studies on gene expression should be interpreted in terms of space-time geometry of the cellular system. In particular, the dynamics of gene expression in cancer cells existing in a malignant tumor is not identical with the dynamics of gene expression in the same cells cultured in the monolayer system.
Źródło:
Acta Biochimica Polonica; 2001, 48, 1; 209-220
0001-527X
Pojawia się w:
Acta Biochimica Polonica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Complexity study of guaranteed state estimation for real time robot localization
Autorzy:
Seignez, E.
Lambert, A.
Powiązania:
https://bibliotekanauki.pl/articles/384760.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
autonomous robot
data fusion
localization
bounded error state estimation
algorithm
Opis:
The estimation of a vehicle configuration in its environment is mostly solved by Bayesian methods. Interval analysis allows an alternative approach: bounded-error localization. Such an approach provides a bounded set of configuration that is guaranteed to include the actual vehicle configuration. This paper describes the boundederror localization algorithms and presents their complexity study. A real time implementation of the studied algorithms is validated through the use of an experimental platform.
Źródło:
Journal of Automation Mobile Robotics and Intelligent Systems; 2011, 5, 2; 12-27
1897-8649
2080-2145
Pojawia się w:
Journal of Automation Mobile Robotics and Intelligent Systems
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Numerically Stable and Efficient Implementation of a Continuous-Discrete Multiple-Model Estimator
Autorzy:
Sankowski, M.
Buda, W.
Powiązania:
https://bibliotekanauki.pl/articles/226632.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
radar tracking
continuous-time systems
nonlinear filtering
numerical complexity
implementation
Opis:
This paper deals with the problem of implementing adaptive radar tracking filters based on continuous-time models of target motion and on discrete-time models of measurement process. The particular difficulties addressed include: nonlinear and non-stationary target movement models with uncertain parameters, and low data rate due to a rotating radar antenna. The proposed tracking filter relies basically on the continuous-discrete variant of the extended Kalman filter (EKF), the probabilistic data association (PDA) technique and the interacting multiplemodel (IMM) state estimation scheme. Numerical properties of the algorithm are discussed and a software implementation is developed using the open-source BLAS library. Several design concepts are combined to assure numerical stability, convergence and efficiency of the estimator.
Źródło:
International Journal of Electronics and Telecommunications; 2013, 59, 4; 369-374
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Complexity of Creole Languages: The Fractal Approach
Autorzy:
Pietraszewska, Natalia
Powiązania:
https://bibliotekanauki.pl/articles/504770.pdf
Data publikacji:
2016
Wydawca:
Komisja Nauk Filologicznych Polskiej Akademii Nauk, Oddział we Wrocławiu
Tematy:
fractal dimension
language complexity
creole languages
time series
Opis:
The current paper aims to compare the complexity of texts translated into English-based creole languages and English. The main motivation for the choice of topic was the growing body of evidence that languages and language phenomena, such as texts, may be regarded as complex adaptable systems of signs. These systems may display some fractal properties, such as self-similarity at different scales. In consequence, texts may be analysed in the same manner as other fractal objects. It is possible, for instance, to estimate their fractal dimensions which, to some extent, reflect the degree of their structural complexity. Such an assumption enables one to calculate and compare fractal dimensions of parallel translations of texts to various languages in order to compare their complexity levels. Methods which enable comparisons of complexity of texts in different languages are particularly important with regard to creole languages, since the complexity of contact languages is still the subject of debate. In the following study, ten parallel translations of passages from the New Testament were mapped onto time series plots based on the length and the frequency rank of words. The values of Hurst exponent as well as fractal dimension were estimated and it was found that the studied time series did not differ significantly between English and English-based creoles with respect to their fractal dimensions. The results lend support to the idea that creole languages are simply new languages which are merely different from their superstrate language rather than being less complex, at least with regard to their lexical patterns.
Źródło:
Academic Journal of Modern Philology; 2015, 4; 73-80
2299-7164
2353-3218
Pojawia się w:
Academic Journal of Modern Philology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Emotion learning: solving a shortest path problem in an arbitrary deterministic environment in linear time with an emotional agent
Autorzy:
Petruseva, S.
Powiązania:
https://bibliotekanauki.pl/articles/907900.pdf
Data publikacji:
2008
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
czynnik emocjonalny
złożoność
programowanie
sieć neuronowa
emotional agent
complexity
consequence programming
CAA neural network
planning
Opis:
The paper presents an algorithm which solves the shortest path problem in an arbitrary deterministic environment with n states with an emotional agent in linear time. The algorithm originates from an algorithm which in exponential time solves the same problem, and the agent architecture used for solving the problem is an NN-CAA architecture (neural network crossbar adaptive array). By implementing emotion learning, the linear time algorithm is obtained and the agent architecture is modified. The complexity of the algorithm without operations for initiation in general does not depend on the number of states n, but only on the length of the shortest path. Depending on the position of the goal state, the complexity can be at most O(n). It can be concluded that the choice of the function which evaluates the emotional state of the agent plays a decisive role in solving the problem efficiently. That function should give as detailed information as possible about the consequences of the agent’s actions, starting even from the initial state. In this way the function implements properties of human emotions.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 409-421
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Edge decompositions of multigraphs into multi-2-paths
Autorzy:
Kratochvil, J.
Lonc, Z.
Meszka, M.
Skupień, Z.
Powiązania:
https://bibliotekanauki.pl/articles/2050185.pdf
Data publikacji:
2004
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
edge decomposition
multigraph
multipath
path
time complexity
Opis:
We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.
Źródło:
Opuscula Mathematica; 2004, 24, 1; 97-102
1232-9274
2300-6919
Pojawia się w:
Opuscula Mathematica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Influence of the scenario complexity and the lighting conditions on the driver behaviour in a car-following situation
Autorzy:
Jurecki, Rafał
Powiązania:
https://bibliotekanauki.pl/articles/263747.pdf
Data publikacji:
2019
Wydawca:
Sieć Badawcza Łukasiewicz. Przemysłowy Instytut Motoryzacji
Tematy:
simulator
car-following situation
driver behaviour
reaction time
Opis:
The aim of this study was to analyse the driver behaviour in simple and complex car-following situations under day- and night-time lighting conditions (four scenarios). Nearly 70 drivers participated in the tests, each taking several trials, during which they were exposed to randomly selected situations. The tests involved driving along a two-lane motorway with a vehicle in front and responding to its sudden braking. Different distances between the vehicles were simulated. The scenarios varied in complexity ranging from none to some vehicles around the subject vehicle. The study involved measuring different reaction times, i.e. the time to release the accelerator pedal, the time to apply the brake pedal and the time to start steering, to find out how the particular emergency manoeuvres contribute to the occurrence of collisions in the four scenarios. The results show that both the complexity of a road situation as well as the lighting conditions determine the type of emergency manoeuvre undertaken and the time of the driver reaction.
Źródło:
Archiwum Motoryzacji; 2019, 83, 1; 151-173
1234-754X
2084-476X
Pojawia się w:
Archiwum Motoryzacji
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Time Complexity Reduction of Hard Problems
Autorzy:
Jarosz, Janusz
Jaworski, Jerzy.
Powiązania:
https://bibliotekanauki.pl/articles/748628.pdf
Data publikacji:
1986
Wydawca:
Polskie Towarzystwo Matematyczne
Tematy:
Analysis of algorithms and problem complexity
Opis:
.
The metodology for reduction of the time complexity for a wide class of hard problems is presented. Some open problems connected with the theoretical properties of computer tree (CT) are stated. The most important one consists in the deriving of the algorithms which can be solved in polynomial time using CT.
Źródło:
Mathematica Applicanda; 1986, 14, 28
1730-2668
2299-4009
Pojawia się w:
Mathematica Applicanda
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Efficiency of artificial intelligence models due to data association and availability
Efektywność modeli sztucznej inteligencji w powiązaniu z dostępnością i asocjacją danych
Autorzy:
Horzyk, A.
Dudek-Dyduch, E.
Powiązania:
https://bibliotekanauki.pl/articles/274573.pdf
Data publikacji:
2011
Wydawca:
Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów
Tematy:
asocjacyjne obliczenia neuronowe
sztuczna inteligencja
złożoność obliczeniowa
czas dostępności danych
associative neurocomputing
artificial intelligence
computational complexity
data availability time
Opis:
This paper discusses effectiveness of algorithms, computational complexity and a new data association model. It introduces a novelty Associative Graph Neurocomputing AGNC together with Associative Graph Data Structure AGDS and Actively Associated Data Neural Networks AADNN that can make able to avoid some computational complexity problems and make computation more likely to natural information processing. Moreover, the paper draw attention on benefits from complete data availability before beginning of an adaptation process.
W artykule podjęto dyskusję efektywności algorytmów, złożoności obliczeniowej i nowych asocjacyjnych modeli danych. Artykuł przedstawia nowy rodzaj grafowych obliczeń neuroasocjacyjnych razem z grafowymi asocjacyjnymi strukturami danych AGDS oraz aktywnymi asocjacyjnymi sieciami neuronowymi AADNN, które mogą rozwiązać pewne problemy związane ze złożonością obliczeniową i sprawią, że obliczenia będą bardziej podobne do biologicznych procesów obliczeniowych. Ponadto artykuł porusza kwestię korzyści wynikających z dostępności danych przed rozpoczęciem procesu uczenia.
Źródło:
Pomiary Automatyka Robotyka; 2011, 15, 12; 158-164
1427-9126
Pojawia się w:
Pomiary Automatyka Robotyka
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Time complexity of page filling algorithms in Materialized Aggregate List (MAL) and MAL/TRIGG materialization cost
Autorzy:
Gorawski, M.
Powiązania:
https://bibliotekanauki.pl/articles/970792.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
spatial data warehouse
materialization
indexing
materialized aggregate list
time complexity of MAL algorithms
Opis:
The Materialized Aggregate List (MAL) enables effective storing and processing of long aggregates lists. The MAL structure contains an iterator table divided into pages that stores adequate number of aggregates. Time complexity of three algorithms was calculated and, in comparison with experimental results, the best configuration of MAL parameters (number of pages, single page size and number of database connections) was estimated. MAL can be also applied to every aggregation level in different indexing structures, like for instance the aR-tree.
Źródło:
Control and Cybernetics; 2009, 38, 1; 153-172
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A pragmatic analyses of the use of types of deixis in poetry and novels of the author Ismail Kadare - The importance and complexity to the pragmatic process concerning the different realities evoked in social interaction, communication and language
Autorzy:
Gjergji, Shpresa
Powiązania:
https://bibliotekanauki.pl/articles/1036532.pdf
Data publikacji:
2015
Wydawca:
Academicus. International Scientific Journal publishing house
Tematy:
pragmatics
person deixis
place deixis
time deixis
contextual elements
discourse
extra-linguistic context
linguistic sign
Opis:
Context is both social and interpersonal. It is social in the sense that context encompasses the internal organization of a society including communication and consist s of the study of linguistic material produced within the structure of the society. The interpersonal context usually takes priority over the social context in such sub-disciplines as pragmatic, discourse analysis, conversational analysis, etc. The focus is rather on the individuals involved in interaction relative the speaker and the hearer or the reader and the writer to understand of exchanged utterances or texts. However the role of context in linguistic use has been most forcefully asserted in the studies associated with names such as in Yule, Grundy, Buhler, Levinson, Rankema, Keith etc. by introducing the wide notion of deixis referring to the ‘environment text’. The same logic stands in communication of the utterance of ‘Broken April’ by Ismail Kadare referring to the phrase analyzing process, in order of getting intrinsically the meaning out and comparing it with discourse and utterance itself.
Źródło:
Academicus International Scientific Journal; 2015, 12; 134-146
2079-3715
2309-1088
Pojawia się w:
Academicus International Scientific Journal
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 21

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies