Thematische Bibliographien / Information-Based Complexity

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte
Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Information-Based Complexity“

Autor: Grafiati

Veröffentlicht am 21. September 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Information-Based Complexity" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Information-Based Complexity"

Wozniakowski, H. „Information-Based Complexity“. Annual Review of Computer Science 1, Nr. 1 (Juni 1986): 319–80. http://dx.doi.org/10.1146/annurev.cs.01.060186.001535.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Packel, Edward W., und J. F. Traub. „Information-based complexity“. Nature 328, Nr. 6125 (Juli 1987): 29–33. http://dx.doi.org/10.1038/328029a0.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Heinrich, Stefan, und Jörg-Detlef Kern. „Parallel information-based complexity“. Journal of Complexity 7, Nr. 4 (Dezember 1991): 339–70. http://dx.doi.org/10.1016/0885-064x(91)90024-r.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kon, Mark A. „Book Review: Information-based complexity“. Bulletin of the American Mathematical Society 21, Nr. 2 (01.10.1989): 332–40. http://dx.doi.org/10.1090/s0273-0979-1989-15851-5.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Traub, J. F., und H. Wo\'zniakowski. „Perspectives on Information-Based Complexity“. Bulletin of the American Mathematical Society 26, Nr. 1 (01.04.1992): 29–53. http://dx.doi.org/10.1090/s0273-0979-1992-00240-9.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lui, Leong Ting, Germán Terrazas, Hector Zenil, Cameron Alexander und Natalio Krasnogor. „Complexity Measurement Based on Information Theory and Kolmogorov Complexity“. Artificial Life 21, Nr. 2 (Mai 2015): 205–24. http://dx.doi.org/10.1162/artl_a_00157.

Der volle Inhalt der Quelle

Annotation:

In the past decades many definitions of complexity have been proposed. Most of these definitions are based either on Shannon's information theory or on Kolmogorov complexity; these two are often compared, but very few studies integrate the two ideas. In this article we introduce a new measure of complexity that builds on both of these theories. As a demonstration of the concept, the technique is applied to elementary cellular automata and simulations of the self-organization of porphyrin molecules.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Parlett, Beresford N. „Some basic information\\ on information-based complexity theory“. Bulletin of the American Mathematical Society 26, Nr. 1 (01.01.1992): 3–29. http://dx.doi.org/10.1090/s0273-0979-1992-00239-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Orme, Anthony Mark, Haining Yao und Letha H. Etzkorn. „Complexity metrics for ontology based information“. International Journal of Technology Management 47, Nr. 1/2/3 (2009): 161. http://dx.doi.org/10.1504/ijtm.2009.024120.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Packel, Edward W., und Henryk Woźniakowski. „Recent developments in information-based complexity“. Bulletin of the American Mathematical Society 17, Nr. 1 (01.07.1987): 9–37. http://dx.doi.org/10.1090/s0273-0979-1987-15511-x.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Galas, David J., Matti Nykter, Gregory W. Carter, Nathan D. Price und Ilya Shmulevich. „Biological Information as Set-Based Complexity“. IEEE Transactions on Information Theory 56, Nr. 2 (Februar 2010): 667–77. http://dx.doi.org/10.1109/tit.2009.2037046.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Information-Based Complexity"

Schmitt, Wagner. „A new 3D shape descriptor based on depth complexity and thickness information“. reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2015. http://hdl.handle.net/10183/127030.

Der volle Inhalt der Quelle

Annotation:

Modelos geométricos desempenham um papel fundamental em divérsas áreas, desde a indústria do entretenimento até aplicações científicas. Para reduzir o elevado custo de criação de um modelo 3D, a reutilização de modelos existentes é a solução ideal. Recuperação de modelos 3D utilizam técnicas baseadas em conteúdo (do inglês CBR) que auxiliam a busca de modelos desejados em repositórios massivos, muitos disponíveis publicamente na Internet. Pontos principais para técnicas CBR eficientes e eficazes são descritores de forma que capturam com precisão as características de uma forma 3D e são capazes de discriminar entre diferentes formas. Nós apresentamos um descritor com base na distribuição de duas características globais, extraídas de uma forma 3D, depth complexity e thickness, que, respectivamente, capturam aspectos da topologia e da geometria das formas 3D. O descritor final, chamado DCT (depth complexity and thickness histogram), é um histograma 2D invariante a translações, rotações e escalas das formas geométricas. Nós eficientemente implementamos o DCT na GPU, permitindo sua utilização em consultas em tempo real em grandes bases de dados de modelos 3D. Nós validamos o DCT com as Princeton e Toyohashi Forma Benchmarks, contendo 1815 e 10000 modelos respectivamente. Os resultados mostram que DCT pode discriminar classes significativas desses benchmarks, é rápido e robusto contra transformações de forma e diferentes níveis de subdivisão e suavidade dos modelos.
Geometric models play a vital role in several fields, from the entertainment industry to scientific applications. To reduce the high cost of model creation, reusing existing models is the solution of choice. Model reuse is supported by content-based shape retrieval (CBR) techniques that help finding the desired models in massive repositories, many publicly available on the Internet. Key to efficient and effective CBR techniques are shape descriptors that accurately capture the characteristics of a shape and are able to discriminate between different shapes. We present a descriptor based on the distribution of two global features measured on a 3D shape, depth complexity and thickness, which respectively capture aspects of the geometry and topology of 3D shapes. The final descriptor, called DCT (depth complexity and thickness histogram), is a 2D histogram that is invariant to the translation, rotation and scale of geometric shapes. We efficiently implement the DCT on the GPU, allowing its use in real-time queries of large model databases. We validate the DCT with the Princeton and Toyohashi Shape Benchmarks, containing 1815 and 10000 models respectively. Results show that DCT can discriminate meaningful classes of these benchmarks, and is fast to compute and robust against shape transformations and different levels of subdivision and smoothness.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alamoudi, Rami Hussain. „Interaction Based Measure of Manufacturing Systems Complexity and Supply Chain Systems Vulnerability Using Information Entropy“. Scholarly Repository, 2008. http://scholarlyrepository.miami.edu/oa_dissertations/76.

Der volle Inhalt der Quelle

Annotation:

The first primary objective of this dissertation is to develop a framework that can quantitatively measure complexity of manufacturing systems in various configurations, including conjoined and disjoined systems. In this dissertation, an analytical model for manufacturing systems complexity that employs information entropy theory is proposed and verified. The model uses probability distribution of information regarding resource allocations that are described in terms of interactions among resources for part processing and part processing requirements. In the proposed framework, both direct and indirect interactions among resources are modeled using a matrix, called interaction matrix, which accounts for part processing and waiting times. The proposed complexity model identifies a manufacturing system that has evenly distributed interactions among resources as being more complex, because under disruption situation more information is required to identify source of the disruption. In addition, implicit relationships between the system complexity and performance in terms of resource utilizations, waiting time, cycle time and throughput of the system are studied in this dissertation by developing a computer program for simulating general job shop environment. The second primary objective of this dissertation is to develop a mathematical model for measuring the vulnerability of the supply chain systems. Global supply chains are exposed to different kinds of disruptions. This has promoted the issue of supply chain resilience higher than ever before in business as well as supporting agendas. In this dissertation, an extension of the proposed measure for manufacturing system complexity is used to measure the vulnerability of the supply chain systems using information entropy theory and influence matrix. We define the vulnerability of supply chain systems based on required information that describes the system in terms of topology and interrelationship among components. The proposed framework for vulnerability modeling in this dissertation focus on disruptive events such as natural disasters, terrorist attacks, or industrial disputes, rather than deviations such as variations in demand, procurement and transportation.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Thost, Veronika. „Using Ontology-Based Data Access to Enable Context Recognition in the Presence of Incomplete Information“. Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2017. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-227633.

Der volle Inhalt der Quelle

Annotation:

Ontology-based data access (OBDA) augments classical query answering in databases by including domain knowledge provided by an ontology. An ontology captures the terminology of an application domain and describes domain knowledge in a machine-processable way. Formal ontology languages additionally provide semantics to these specifications. Systems for OBDA thus may apply logical reasoning to answer queries; they use the ontological knowledge to infer new information, which is only implicitly given in the data. Moreover, they usually employ the open-world assumption, which means that knowledge not stated explicitly in the data or inferred is neither assumed to be true nor false. Classical OBDA regards the knowledge however only w.r.t. a single moment, which means that information about time is not used for reasoning and hence lost; in particular, the queries generally cannot express temporal aspects. We investigate temporal query languages that allow to access temporal data through classical ontologies. In particular, we study the computational complexity of temporal query answering regarding ontologies written in lightweight description logics, which are known to allow for efficient reasoning in the atemporal setting and are successfully applied in practice. Furthermore, we present a so-called rewritability result for ontology-based temporal query answering, which suggests ways for implementation. Our results may thus guide the choice of a query language for temporal OBDA in data-intensive applications that require fast processing, such as context recognition.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Dash, Santanu Kumar. „Adaptive constraint solving for information flow analysis“. Thesis, University of Hertfordshire, 2015. http://hdl.handle.net/2299/16354.

Der volle Inhalt der Quelle

Annotation:

In program analysis, unknown properties for terms are typically represented symbolically as variables. Bound constraints on these variables can then specify multiple optimisation goals for computer programs and nd application in areas such as type theory, security, alias analysis and resource reasoning. Resolution of bound constraints is a problem steeped in graph theory; interdependencies between the variables is represented as a constraint graph. Additionally, constants are introduced into the system as concrete bounds over these variables and constants themselves are ordered over a lattice which is, once again, represented as a graph. Despite graph algorithms being central to bound constraint solving, most approaches to program optimisation that use bound constraint solving have treated their graph theoretic foundations as a black box. Little has been done to investigate the computational costs or design e cient graph algorithms for constraint resolution. Emerging examples of these lattices and bound constraint graphs, particularly from the domain of language-based security, are showing that these graphs and lattices are structurally diverse and could be arbitrarily large. Therefore, there is a pressing need to investigate the graph theoretic foundations of bound constraint solving. In this thesis, we investigate the computational costs of bound constraint solving from a graph theoretic perspective for Information Flow Analysis (IFA); IFA is a sub- eld of language-based security which veri es whether con dentiality and integrity of classified information is preserved as it is manipulated by a program. We present a novel framework based on graph decomposition for solving the (atomic) bound constraint problem for IFA. Our approach enables us to abstract away from connections between individual vertices to those between sets of vertices in both the constraint graph and an accompanying security lattice which defines ordering over constants. Thereby, we are able to achieve significant speedups compared to state-of-the-art graph algorithms applied to bound constraint solving. More importantly, our algorithms are highly adaptive in nature and seamlessly adapt to the structure of the constraint graph and the lattice. The computational costs of our approach is a function of the latent scope of decomposition in the constraint graph and the lattice; therefore, we enjoy the fastest runtime for every point in the structure-spectrum of these graphs and lattices. While the techniques in this dissertation are developed with IFA in mind, they can be extended to other application of the bound constraints problem, such as type inference and program analysis frameworks which use annotated type systems, where constants are ordered over a lattice.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Eugénio, António Luís Beja. „The information systems and technology innovation process: a study using an agent-based approach“. Master's thesis, Instituto Superior de Economia e Gestão, 2007. http://hdl.handle.net/10400.5/636.

Der volle Inhalt der Quelle

Annotation:

Mestrado em Gestão de Sistemas de Informação
Um modelo abstracto baseado em agentes é utilizado para estudar a inovação em Sistemas de Informação e em Tecnologia de Informação, no plano organizacional, utilizando uma aproximação sócio-cognitiva. A conclusão do estudo indica que o poder dos profissionais conhecedores de tecnologias de informação na decisão de adopção de uma determinada inovação varia com o nível de concordância de ideias entre eles e os decisores, ao mesmo tempo que depende da taxa de depreciação das transacções, conduzindo a uma forte flutuação de poder quando o ambiente é instável.
An abstract Agent Based Model is used to study Information Systems and Information Technology innovation on an organizational realm, using a socio-cognitive approach. Conclusion is drawn that the power of the knowledge workers in the decision to adopt an IS/IT innovation within an organization varies with the matching level of ideas between them and the top management, while being dependant of the transactions’ depreciation rate, leading to a strong fluctuation of power when the environment is unstable.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Syed, Tamseel Mahmood. „Precoder Design Based on Mutual Information for Non-orthogonal Amplify and Forward Wireless Relay Networks“. University of Akron / OhioLINK, 2014. http://rave.ohiolink.edu/etdc/view?acc_num=akron1392043776.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Clément, François. „An Optimization Perspective on the Construction of Low-Discrepancy Point Sets“. Electronic Thesis or Diss., Sorbonne université, 2024. http://www.theses.fr/2024SORUS138.

Der volle Inhalt der Quelle

Annotation:

Les mesures de discrépance sont une famille de mesures quantifiant l'uniformité d'un ensemble de points: sont-ils bien répartis dans l'espace (discrépance faible) ou concentrés par endroits (discrépance élevée)? Parmi ces mesures, la discrépance à l'origine L∞ joue un rôle primordial: elle permet de quantifier l'erreur faite lors de l'approximation d'une intégrale par une somme finie composée d'évaluations de la fonction en un ensemble de points. Ce résultat mène à de très nombreuses applications dans des domaines variés allant de la vision en informatique à la finance, sans oublier tout ce qui concerne le plan d'expérience (design of experiments), où des points bien répartis sont essentiels. Les points à faible discrépance utilisés dans ces applications sont issus d'approches mathématiques en théorie des nombres, avec de nombreuses séquences ou ensembles de points connus depuis plusieurs décennies. Malgré cela, ce sujet reste surtout le domaine de mathématiciens, souvent plus intéressés par les propriétés asymptotiques de ces points que leur utilisations en pratique. Il en résulte que les ensembles à faible discrépance, bien que très bons théoriquement, sont parfois moins bien que des points aléatoires pour certaines applications, particulièrement lorsque la dimension augmente. D'un point de vue plus qualitatif, malgré certaines bornes asymptotiques, nous ne savons pas précisément quelle est la limite inférieure pour la discrépance d'un ensemble de points d'une taille fixée. Or, ce type de question a un impact immédiat sur la qualité des résultats lors d'applications. Dans cette thèse, nous abordons le problème de la construction d'ensembles à faible discrépance d'un point de vue informatique, tout en obtenant de nombreux résultats empiriques sur la qualité de ces ensembles. Plutôt que de construire mathématiquement ces séquences, nous utilisons un ensemble de méthodes issues de l'optimisation, ainsi que les séquences existantes, pour obtenir de nouveaux ensembles de points. Nous montrons qu'il est possible d'obtenir des ensembles de points de bien meilleure discrépance à l'origine L∞ que ceux existant déjà, dans des dimensions variées. Enfin, nous présentons également une approche basée sur la discrépance à l'origine L2, pour montrer que son utilisation de manière gloutonne permet la construction d'une séquence extrêmement régulière pour la discrépance L∞, ouvrant la voie vers de nombreuses approches novatrices
Discrepancy measures are metrics designed to quantify how well spread a point set is in a given space. Among these, the L∞ star discrepancy is arguably one of the most popular. Indeed, by the Koksma-Hlawka inequality~cite{Hlawka,Koksma}, when replacing an integral by the average of function evaluations in specific points, the error made is bounded by a product of two terms, one depending only on the function and the other on the L∞ star discrepancy of the points. This leads to a variety of applications, from computer vision to financial mathematics and to design of experiments where well-spread points covering a space are essential.Low-discrepancy sets used in such applications usually correspond to number theoretic designs, with a wide variety of possible constructions. Despite the high demand in practice, the design of these point sets remains largely the work of mathematicians, often more interested in finding asymptotic bounds than in adapting the point sets to the desired applications. This results in point sets that, while theoretically excellent, sometimes leave a lot to be desired for applications, in particular high-dimensional ones. Indeed, the constructions are not tailored to the many different settings found in applications and are thus suboptimal. Furthermore, not only do we not know how low the discrepancy of point sets of a given size in a fixed dimension can go, but often we do not even know the discrepancy of existing constructions. This leaves essential questions unanswered in the design of low-discrepancy sets and sequences. In this thesis, we tackle the problem of constructing low-discrepancy sets from a computational perspective. With optimization approaches applied in isolation or on top of existing sets and sequences, we provide a diverse set of methods to generate excellent low-discrepancy sets, largely outperforming the discrepancy of known constructions in a wide variety of contexts. In particular, we describe a number of examples such as provably optimal sets for very few points in dimension 2, or improved sets of hundreds of points in moderate dimensions via subset selection. Finally, we extend recent work on greedy one-dimensional sequence construction to show that greedy L2 construction of point sets provides excellent empirical results with respect to the L∞ star discrepancy

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Domercant, Jean Charles. „ARC-VM: an architecture real options complexity-based valuation methodology for military systems-of-systems acquisitions“. Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42928.

Der volle Inhalt der Quelle

Annotation:

An Architecture Real Options Complexity-Based Valuation Methodology (ARC-VM) is developed for use to aid in the acquisition of military systems-of-systems (SoS). ARC-VM is suitable for acquisition-level decision making, where there is a stated desire for more informed tradeoffs between cost, schedule, and performance during the early phases of design. First, a framework is introduced to measure architecture complexity as it directly relates to military SoS. Development of the framework draws upon a diverse set of disciplines, including Complexity Science, software architecting, measurement theory, and utility theory. Next, a Real Options based valuation strategy is developed using techniques established for financial stock options that have recently been adapted for use in business and engineering decisions. The derived complexity measure provides architects with an objective measure of complexity that focuses on relevant complex system attributes. These attributes are related to the organization and distribution of SoS functionality and the sharing and processing of resources. The use of Real Options provides the necessary conceptual and visual framework to quantifiably and traceably combine measured architecture complexity, time-valued performance levels, as well as programmatic risks and uncertainties. An example suppression of enemy air defenses (SEAD) capability demonstrates the development and utility of the resulting architecture complexity&Real Options based valuation methodology. Different portfolios of candidate system types are used to generate an array of architecture alternatives that are then evaluated using an engagement model. This performance data is combined with both measured architecture complexity and programmatic data to assign an acquisition value to each alternative. This proves useful when selecting alternatives most likely to meet current and future capability needs.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Мельничук, Андрій Богданович, und Andrii Melnychuk. „Методи захисту інформації в рамках предметно-орієнтованого проєктування інформаційних систем“. Master's thesis, ТНТУ, 2021. http://elartu.tntu.edu.ua/handle/lib/36742.

Der volle Inhalt der Quelle

Annotation:

«Методи захисту інформації в рамках предметно-орієнтованого проєктування інформаційних систем» // Дипломна робота ОР «Магістр» // Мельничук Андрій Богданович // Тернопільський національний технічний університет імені Івана Пулюя, факультет комп'ютерно інформаційних систем і програмної інженерії, кафедра кібербезпеки, група СБм-61 // Тернопіль, 2021 // С. 61, табл. – 3, рис. – 10, додат. – 1.
Предметно-орієнтоване проектування — це підхід до проектування програмного забезпечення. Метод проєктування визначає у собі практики як спілкуватись із спеціалістами, самої, предметної області та набір правил проектування де кінцевий код буде відображати у собі всі поняття самого домену. У деяких випадках розділення проблем, передбачених предметно орієнтованим підходом, важко досягти, а саме, коли розглядається функціональність, яка не залежить від домену, але є тісно пов’язаною з функціональністю, пов’язаною з предметною областю. Дані проблеми стосуються блоку програми яка б відповідала за безпеку. На жаль, засновник досліджуваного підходу не визначив як саме можна поєднати таку логіку, тому було досліджено різні методи забезпечення захисту даних та аналіз найкращих варіантів реалізації, які можна застосовувати у реальних проектах.
Domain Driven Design — is an approach to software design. The approach method defines the practices of how to communicate with specialists, of the subject area and a set of design rules where the final code will reflect all the concepts of the domain itself. In some cases, the separation covered by a subject-oriented approach is difficult to achieve, namely when considering functionality that is independent of the domain but is closely related to functionality related to the subject area. These issues are related to the security unit. Unfortunately, the founder of the researched approach did not define exactly how such logic can be combined. That is why were researched the different methods of data protection and analysis of the best implementation options that can be used in real projects.
ПЕРЕЛІК УМОВНИХ СКОРОЧЕНЬ…8 ВСТУП… 9 РОЗДІЛ 1. АНАЛІЗ ПРЕДМЕТНО-ОРІЄНТОВАНОГО ПРОЄКТУВАННЯ ТА ПРОБЛЕМИ БЕЗПЕКИ У НЬОМУ…13 1.1. Предметно-орієнтоване проєктування…13 1.2 Архітектура та структура проекту при DDD проєктуванні… 16 1.3 Аспектно-орієнтоване програмування…18 1.4 Вимірювання складності реалізації методу… 20 1.5 Проблема захисту даних при проектуванні…22 РОЗДІЛ 2. ЗАХИСТ ІНФОРМАЦІЇ В РАМКАХ ПРЕДМЕТНО-ОРІЄНТОВАНОГО ПРОЄКТУВАННЯ…24 2.1 Предмет дослідження проблеми захисту інформації… 24 2.2 Критерії оцінки варіантів реалізації безпеки в рамках предметно-орієнтованому проектуванні… 26 2.3 Аналіз методу захисту інформації, яка вбудована у шар предметної області… 28 2.3.1 Опис підходу та його плюси…28 2.3.2 Недоліки підходу… 30 2.3.3 Висновок по підрозділу…30 2.4 Аналіз методу захисту інформації, яка винесена в окремий контекст… 31 2.4.1 Опис підходу та його плюси…31 2.4.2 Недоліки підходу… 32 2.4.3 Висновок по підрозділу…34 2.5 Аналіз методу захисту інформації, з використанням фасаду предметної області… 34 2.5.1 Опис підходу та його плюси…35 2.5.2 Недоліки підходу… 36 2.5.3 Висновок по підрозділу…36 2.6 Аналіз методу захисту інформації, з використанням аспектно-орієнтованого підходу…37 2.6.1 Опис підходу та його плюси…37 2.6.2 Недоліки підходу… 38 2.6.3 Висновок по підрозділу…39 РОЗДІЛ 3. РЕАЛІЗАЦІЯ МЕТОДІВ ЗАХИСТУ ТА ПОРІВНЯННЯ СКЛАДНОСТІ…40 3.1 Реалізація базової структури проекту…40 3.1.1 Вибір середовища та технологія для створення інформаційної системи… 40 3.1.2 Розробка головного ядра інформаційної системи… 40 3.1.3 Розробка відокремленого контексту безпеки… 42 3.1.4 Розробка інтерфейсу користувача… 43 3.2 Аналіз складності у реалізацій та підтримки кожного із методів…44 3.2.1 Визначення значення залежностей у інформаційній системі…44 3.2.2 Вимірювання цикломатичної складності… 44 3.3 Підсумки отриманих результатів…45 РОЗДІЛ 4. ОХОРОНА ПРАЦІ ТА БЕЗПЕКА У НАДЗВИЧАЙНИХ СИТУАЦІЯХ…47 4.1 Охорона праці…47 4.2 Підвищення стійкості роботи підприємств будівельної галузі у воєнний час…49 ВИСНОВКИ… 54 СПИСОК ВИКОРИСТАНИХ ДЖЕРЕЛ… 56 ДОДАТКИ…59

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kuhn, John. „A THEORY OF COMPLEX ADAPTIVE INQUIRING ORGANIZATIONS: APPLICATION TO CONTINUOUS ASSURANCE OF CORPORATE FINANCIAL INFORMATION“. Doctoral diss., University of Central Florida, 2009. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2432.

Der volle Inhalt der Quelle

Annotation:

Drawing upon the theories of complexity and complex adaptive systems and the Singerian Inquiring System from C. West Churchman’s seminal work The Design of Inquiring Systems the dissertation herein develops a systems design theory for continuous auditing systems. The dissertation consists of discussion of the two foundational theories, development of the Theory of Complex Adaptive Inquiring Organizations (CAIO) and associated design principles for a continuous auditing system supporting a CAIO, and instantiation of the CAIO theory. The instantiation consists of an agent-based model depicting the marketplace for Frontier Airlines that generates an anticipated market share used as an integral component in a mock auditor going concern opinion for the airline. As a whole, the dissertation addresses the lack of an underlying system design theory and comprehensive view needed to build upon and advance the continuous assurance movement and addresses the question of how continuous auditing systems should be designed to produce knowledge--knowledge that benefits auditors, clients, and society as a whole.
Ph.D.
Department of Management Information Systems
Business Administration
Business Administration PhD

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Bücher zum Thema "Information-Based Complexity"

W, Wasilkowski G., und Woźniakowski H, Hrsg. Information-based complexity. Boston: Academic Press, 1988.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Petras, Iasonas. Contributions to Information-Based Complexity and to Quantum Computing. [New York, N.Y.?]: [publisher not identified], 2013.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Cvetkov, Viktor. Basics of complexity theory. ru: INFRA-M Academic Publishing LLC., 2024. http://dx.doi.org/10.12737/2110856.

Der volle Inhalt der Quelle

Annotation:

The monograph reveals the basics of complexity theory and methods for assessing complexity. The concept of complexity consideration is based on the analysis of complexity as a common attribute in processes and systems. The monograph describes the main methods for assessing different types of complexity. The concept of considering complexity in this monograph is also based on the fact that complexity is a comparative characteristic. It is given on a relative scale of difficulty. Therefore, complexity must be defined on a relative scale of “simplicity-complexity.” This concept motivates the consideration and analysis of the concept of “simplicity” as a complement to the concept of “complexity”. These concepts set the scale of complexity. The monograph provides a comparative analysis of the related concepts of simplicity and complexity. Three methods for assessing complexity are described: expert assessment of complexity, assessment of complexity using mathematical metrics, comparative assessment of complexity based on the theory of comparative analysis. The monograph contains a taxonomy of the main types of complexity. The content of the main types of complexity is revealed in detail: descriptive complexity, system complexity, modeling complexity, computational complexity. algorithmic complexity, deterministic complexity. Specific cognitive difficulties are described in detail. For cognitive complexity, special assessment methods are used. An interpretation of the concept of cognitive filter is given. Complexity is associated with the concept of complex systems. In most monographs on complex systems, the complexity aspect has not been considered or is viewed in a simplified manner. This monograph examines complexity as a characteristic of complex systems and the basis for their classification. Emergence is described as a characteristic of the complexity of systems and complex processes. The monograph contains a taxonomy of complex systems with characteristics of the complexity of different systems. Complex data systems have been explored. An analysis of organizational complex systems is given. Various types of complex ergatic systems have been described. An analysis of complex technical systems is given. Self-developing complex systems are described. autopoiesis of a complex organizational and technical system has been studied as a principle of systems development. Cyber-physical systems are described as an example of the development of complex systems. The monograph is intended for specialists in the field of computer science, systems analysis, artificial intelligence and philosophy of information.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zu, Qiaohong. Pervasive Computing and the Networked World: Joint International Conference, ICPCA/SWS 2012, Istanbul, Turkey, November 28-30, 2012, Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baryshev, Ruslan. Proactive library in the information and educational environment of the University. ru: INFRA-M Academic Publishing LLC., 2020. http://dx.doi.org/10.12737/1123649.

Der volle Inhalt der Quelle

Annotation:

In the monograph, the University library is presented as a complex system that includes elements of various properties and varying complexity. As in any system, structural change inevitably affects the performance of all its components. In this regard, the library is an element of the information and educational environment of the University, which is designed to support and improve the effectiveness of educational and scientific activities. The article reveals the concept of active University library" as a system for providing information services to the reader in any form and on any medium based on classical and network forms of service based on query advance services. The article analyzes the opportunities provided by the active University library for its users. The mechanism of activation of an electronic library through selective provision of information is considered, and the principle of the influence of an active electronic library on its proactivity is approved. For all those interested in librarianship and Informatization of education."

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kaliski, Burton S. Cryptographic Hardware and Embedded Systems - CHES 2002: 4th International Workshop Redwood Shores, CA, USA, August 13 15, 2002 Revised Papers. Berlin: Springer-Verlag Berlin Heidelberg, 2003.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Christof, Paar, und SpringerLink (Online service), Hrsg. RFID. Security and Privacy: 7th International Workshop, RFIDSec 2011, Amherst, USA, June 26-28, 2011, Revised Selected Papers. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Jianying, Zhou, Li Hui und SpringerLink (Online service), Hrsg. Information Security: 14th International Conference, ISC 2011, Xi’an, China, October 26-29, 2011. Proceedings. Berlin, Heidelberg: Springer-Verlag GmbH Berlin Heidelberg, 2011.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Stanescu, Liana. Creating New Medical Ontologies for Image Annotation: A Case Study. New York, NY: Springer Science+Business Media, LLC, 2012.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

1969-, Sarkar Palash, und SpringerLink (Online service), Hrsg. Identity-Based Encryption. Boston, MA: Springer Science+Business Media, LLC, 2011.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Buchteile zum Thema "Information-Based Complexity"

Traub, J. F. „Introduction to Information-Based Complexity“. In Complexity in Information Theory, 63–76. New York, NY: Springer New York, 1998. http://dx.doi.org/10.1007/978-1-4612-3774-7_3.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Standish, Russell K. „Information-Based Complexity of Networks“. In Advances in Network Complexity, 209–27. Weinheim, Germany: Wiley-VCH Verlag GmbH & Co. KGaA, 2013. http://dx.doi.org/10.1002/9783527670468.ch09.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Polkowski, Lech. „Granulation of Knowledge: Similarity Based Approach in Information and Decision Systems“. In Computational Complexity, 1464–87. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-1800-9_94.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lin, Grace Y., Richard Breitwieser, Feng Cheng, John T. Eagen und Markus Ettl. „Product Hardware Complexity and Its Impact on Inventory and Customer On-Time Delivery“. In Information-Based Manufacturing, 61–79. Boston, MA: Springer US, 2001. http://dx.doi.org/10.1007/978-1-4615-1599-9_4.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhao, Weidong, Haitao Liu und Xi Liu. „Role Identification Based on the Information Dependency Complexity“. In Advanced Data Mining and Applications, 276–87. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-53917-6_25.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Traub, Joseph F. „Information-based complexity: Recent results and open problems“. In Fundamentals of Computation Theory, 86–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54458-5_52.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mockus, Jonas, William Eddy, Audris Mockus, Linas Mockus und Gintaras Reklaitis. „Information-Based Complexity (IBC) and the Bayesian Heuristic Approach“. In Nonconvex Optimization and Its Applications, 31–46. Boston, MA: Springer US, 1997. http://dx.doi.org/10.1007/978-1-4757-2627-5_2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Polkowski, Lech. „Granulation of Knowledge: Similarity Based Approach in Information and Decision Systems“. In Encyclopedia of Complexity and Systems Science, 4411–35. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-30440-3_262.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Polkowski, Lech. „Granulation of Knowledge: Similarity Based Approach in Information and Decision Systems“. In Encyclopedia of Complexity and Systems Science, 1–32. Berlin, Heidelberg: Springer Berlin Heidelberg, 2020. http://dx.doi.org/10.1007/978-3-642-27737-5_262-2.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Eguchi, Takao, Tsuyoshi Koga und Kazuhiro Aoyama. „MANAGEMENT OF RELATIONSHIPS BETWEEN PRODUCT INFORMATION ON MODEL BASED DESIGN PROCESS“. In Gain competitive advantage by managing complexity, 211–24. München: Carl Hanser Verlag GmbH & Co. KG, 2012. http://dx.doi.org/10.3139/9783446434127.017.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Information-Based Complexity"

Wasilkowski, G. W. „Information-Based Complexity; An Overview“. In 1990 American Control Conference. IEEE, 1990. http://dx.doi.org/10.23919/acc.1990.4790762.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kipp, Teresa A. „Fusion by the information-based complexity approach“. In Optical Engineering and Photonics in Aerospace Sensing, herausgegeben von Lynn E. Garn und Lynda L. Graceffo. SPIE, 1993. http://dx.doi.org/10.1117/12.161456.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Moore, Philip. „The Complexity of Context in Mobile Information Systems“. In 2009 International Conference on Network-Based Information Systems (NBIS). IEEE, 2009. http://dx.doi.org/10.1109/nbis.2009.10.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Foucart, Simon. „Complexity of multivariate problems based on binary information“. In 2017 International Conference on Sampling Theory and Applications (SampTA). IEEE, 2017. http://dx.doi.org/10.1109/sampta.2017.8024351.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fuhrer, Julian, Alejandro Blenkmann, Tor Endestad, Anne-Kristin Solbakk und Kyrre Glette. „Complexity-based Encoded Information Quantification in Neurophysiological Recordings“. In 2022 44th Annual International Conference of the IEEE Engineering in Medicine & Biology Society (EMBC). IEEE, 2022. http://dx.doi.org/10.1109/embc48229.2022.9871501.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pizzolante, Raffaele, Arcangelo Castiglione, Bruno Carpentieri und Alfredo De Santis. „Parallel Low-Complexity Lossless Coding of Three-Dimensional Medical Images“. In 2014 17th International Conference on Network-Based Information Systems (NBiS). IEEE, 2014. http://dx.doi.org/10.1109/nbis.2014.107.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Ravari, Alireza Norouzzadeh, und Hamid D. Taghirad. „Transformation invariant 3D object recognition based on information complexity“. In 2014 Second RSI/ISM International Conference on Robotics and Mechatronics (ICRoM). IEEE, 2014. http://dx.doi.org/10.1109/icrom.2014.6991019.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aimin, Luo, Huang Li und Luo Xueshan. „Entropy-Based Complexity Analysis for Architecture of Information System“. In 2008 IEEE International Conference on Networking, Sensing and Control (ICNSC). IEEE, 2008. http://dx.doi.org/10.1109/icnsc.2008.4525503.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lee, Gil-beom, Youn-chul Shin, Joo-heon Park und Myeong-jin Lee. „Low-complexity camera tamper detection based on edge information“. In 2014 IEEE International Conference on Consumer Electronics - Taiwan (ICCE-TW). IEEE, 2014. http://dx.doi.org/10.1109/icce-tw.2014.6904034.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sun Yanming, Zhang Kaisheng, Zhang Xiaohua und Zheng Shixiong. „Modeling of manufacturing information system based on complexity science“. In International Technology and Innovation Conference 2006 (ITIC 2006). IEE, 2006. http://dx.doi.org/10.1049/cp:20060765.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Information-Based Complexity"

Parlett, Beresford. Some Basic Information on Information-Based Complexity Theory. Fort Belvoir, VA: Defense Technical Information Center, Juli 1989. http://dx.doi.org/10.21236/ada256585.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Sanders, David M., und William B. Carlton. Information Overload at the Tactical Level (an Application of Agent Based Modeling and Complexity Theory in Combat Modeling). Fort Belvoir, VA: Defense Technical Information Center, August 2002. http://dx.doi.org/10.21236/ada405459.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mascagni, Giulia, Roel Dom und Fabrizio Santoro. The VAT in Practice: Equity, Enforcement and Complexity. Institute of Development Studies (IDS), Januar 2021. http://dx.doi.org/10.19088/ictd.2021.002.

Der volle Inhalt der Quelle

Annotation:

The value added tax (VAT) is supposed to be a tax on consumption that achieves greater economic efficiency than alternative indirect taxes. It is also meant to facilitate enforcement through the ‘self-enforcing mechanism’ – based on opposed incentives for buyers and sellers, and because of the paper trail it creates. Being a rather sophisticated tax, however, the VAT is complex to administer and costly to comply with, especially in lower-income countries. This paper takes a closer look at how the VAT system functions in practice in Rwanda. Using a mixed-methods approach, which combines qualitative information from focus group discussions with the analysis of administrative and survey data, we document and explain a number of surprising inconsistencies in the filing behaviour of VAT-remitting firms, which lead to suboptimal usage of electronic billing machines, as well as failure to claim legitimate VAT credits. The consequence of these inconsistencies is twofold. It makes it difficult for the Rwanda Revenue Authority to exploit its VAT data to the fullest, and leads to firms, particularly smaller ones, bearing a higher VAT burden than larger ones. There are several explanations for these inconsistencies. They appear to lie in a combination of taxpayer confusion, fear of audit, and constraints in administrative capacity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pilkevych, Ihor, Oleg Boychenko, Nadiia Lobanchykova, Tetiana Vakaliuk und Serhiy Semerikov. Method of Assessing the Influence of Personnel Competence on Institutional Information Security. CEUR Workshop Proceedings, April 2021. http://dx.doi.org/10.31812/123456789/4374.

Der volle Inhalt der Quelle

Annotation:

Modern types of internal threats and methods of counteracting these threats are analyzed. It is established that increasing the competence of the staff of the institution through training (education) is the most effective method of counteracting internal threats to information. A method for assessing the influence of personnel competence on institutional information security is proposed. This method takes into account violator models and information threat models that are designed for a specific institution. The method proposes to assess the competence of the staff of the institution by three components: the level of knowledge, skills, and character traits (personal qualities). It is proposed to assess the level of knowledge based on the results of test tasks of different levels of complexity. Not only the number of correct answers is taken into account, but also the complexity of test tasks. It is proposed to assess the assessment of the level of skills as the ratio of the number of correctly performed practical tasks to the total number of practical tasks. It is assumed that the number of practical tasks, their complexity is determined for each institution by the direction of activity. It is proposed to use a list of character traits for each position to assess the character traits (personal qualities) that a person must have to effectively perform the tasks assigned to him. This list should be developed in each institution. It is proposed to establish a quantitative assessment of the state of information security, defining it as restoring the amount of probability of occurrence of a threat from the relevant employee to the product of the general threat and employees of the institution. An experiment was conducted, the results of which form a particular institution show different values of the level of information security of the institution for different values of the competence of the staff of the institution. It is shown that with the increase of the level of competence of the staff of the institution the state of information security in the institution increases.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Baader, Franz, Stefan Borgwardt und Marcel Lippmann. Temporal Conjunctive Queries in Expressive DLs with Non-simple Roles. Technische Universität Dresden, 2015. http://dx.doi.org/10.25368/2022.222.

Der volle Inhalt der Quelle

Annotation:

In Ontology-Based Data Access (OBDA), user queries are evaluated over a set of facts under the open world assumption, while taking into account background knowledge given in the form of a Description Logic (DL) ontology. Motivated by situation awareness applications, temporal conjunctive queries (TCQs) have recently been proposed as a useful extension of traditional OBDA to support the processing of temporal information. This paper extends the existing complexity analysis of TCQ entailment to very expressive DLs underlying the OWL 2 standard, and in contrast to previous work also allows for queries containing transitive roles.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Borgwardt, Stefan, und Walter Forkel. Closed-World Semantics for Conjunctive Queries with Negation over ELH⊥ Ontologies. Technische Universität Dresden, 2019. http://dx.doi.org/10.25368/2023.222.

Der volle Inhalt der Quelle

Annotation:

Ontology-mediated query answering is a popular paradigm for enriching answers to user queries with background knowledge. For querying the absence of information, however, there exist only few ontology-based approaches. Moreover, these proposals conflate the closed-domain and closed-world assumption, and therefore are not suited to deal with the anonymous objects that are common in ontological reasoning. We propose a new closed-world semantics for answering conjunctive queries with negation over ontologies formulated in the description logic ELH⊥, which is based on the minimal canonical model. We propose a rewriting strategy for dealing with negated query atoms, which shows that query answering is possible in polynomial time in data complexity.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kud, A. A. Figures and Tables. Reprinted from “Comprehensive сlassification of virtual assets”, A. A. Kud, 2021, International Journal of Education and Science, 4(1), 52–75. KRPOCH, 2021. http://dx.doi.org/10.26697/reprint.ijes.2021.1.6.a.kud.

Der volle Inhalt der Quelle

Annotation:

Figure. Distributed Ledger Token Accounting System. Figure. Subjects of Social Relations Based on the Decentralized Information Platform. Figure. Derivativeness of a Digital Asset. Figure. Semantic Features of the Concept of a “Digital Asset” in Economic and Legal Aspects. Figure. Derivativeness of Polyassets and Monoassets. Figure. Types of Tokenized Assets Derived from Property. Figure. Visual Representation of the Methods of Financial and Management Accounting of Property Using Various Types of Tokenized Assets. Figure. Visual Representation of the Classification of Virtual Assets Based on the Complexity of Their Nature. Table. Comparison of Properties of Various Types of Virtual Assets of the Distributed Ledger Derivative of the Original Asset. Table. Main Properties and Parameters of Types of Tokenized Assets. Table. Classification of Virtual Assets as Tools for Implementing the Methods of Financial and Management Accounting of Property.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lutz, Carsten, und Frank Wolter. Modal Logics of Topological Relations. Technische Universität Dresden, 2004. http://dx.doi.org/10.25368/2022.142.

Der volle Inhalt der Quelle

Annotation:

The eight topological RCC8(or Egenhofer-Franzosa)- relations between spatial regions play a fundamental role in spatial reasoning, spatial and constraint databases, and geographical information systems. In analogy with Halpern and Shoham’s modal logic of time intervals based on the Allen relations, we introduce a family of modal logics equipped with eight modal operators that are interpreted by the RCC8-relations. The semantics is based on region spaces induced by standard topological spaces, in particular the real plane. We investigate the expressive power and computational complexity of the logics obtained in this way. It turns our that, similar to Halpern and Shoham’s logic, the expressive power is rather natural, but the computational behavior is problematic: topological modal logics are usually undecidable and often not even recursively enumerable. This even holds if we restrict ourselves to classes of finite region spaces or to substructures of region spaces induced by topological spaces. We also analyze modal logics based on the set of RCC5relations, with similar results.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Koopmann, Patrick. Ontology-Mediated Query Answering for Probabilistic Temporal Data with EL Ontologies (Extended Version). Technische Universität Dresden, 2018. http://dx.doi.org/10.25368/2022.242.

Der volle Inhalt der Quelle

Annotation:

Especially in the field of stream reasoning, there is an increased interest in reasoning about temporal data in order to detect situations of interest or complex events. Ontologies have been proved a useful way to infer missing information from incomplete data, or simply to allow for a higher order vocabulary to be used in the event descriptions. Motivated by this, ontology-based temporal query answering has been proposed as a means for the recognition of situations and complex events. But often, the data to be processed do not only contain temporal information, but also probabilistic information, for example because of uncertain sensor measurements. While there has been a plethora of research on ontologybased temporal query answering, only little is known so far about querying temporal probabilistic data using ontologies. This work addresses this problem by introducing a temporal query language that extends a well-investigated temporal query language with probability operators, and investigating the complexity of answering queries using this query language together with ontologies formulated in the description logic EL.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Lutz, Carsten, Carlos Areces, Ian Horrocks und Ulrike Sattler. Keys, Nominals, and Concrete Domains. Technische Universität Dresden, 2002. http://dx.doi.org/10.25368/2022.122.

Der volle Inhalt der Quelle

Annotation:

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to 'concrete' domains such as numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be quite useful for reasoning about conceptual models of information systems, and as the basis for expressive ontology languages. We propose to further extend such DLs with key constraints that allow the expression of statements like 'US citizens are uniquely identified by their social security number'. Based on this idea, we introduce a number of natural description logics and perform a detailed analysis of their decidability and computational complexity. It turns out that naive extensions with key constraints easily lead to undecidability, whereas more careful extensions yield NEXPTIME-complete DLs for a variety of useful concrete domains.

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!