Entity

Time filter

Source Type


Jager G.,Stralsund University of Applied Sciences
Fuzzy Sets and Systems | Year: 2016

We develop a general theory of convergence for lattice-valued spaces based on the concept of s-stratified LM-filters. For different choices of the frames L and M, different kinds of filters arise, and suitable choices of the lattice N allow to view many existing fuzzy and probabilistic convergence spaces as special examples of our stratified LMN-convergence tower spaces. The stratification requires a certain relation between the frames L and M and we use a so-called stratification mapping to this end. The stratification condition is used to show that the resulting category is fiber-small and hence Cartesian closedness is equivalent to the existence of natural function spaces. We give several examples for our spaces for different choices of the lattices L, M and N with a special focus on enriched LM-fuzzy topological spaces. Finally, we study diagonal axioms and regularity. © 2015 Elsevier B.V. Source


Jager G.,Stralsund University of Applied Sciences
Iranian Journal of Fuzzy Systems | Year: 2016

We apply Preuß’ concept of E-connectedness to the categories of lattice-valued uniform convergence spaces and of lattice-valued uniform spaces. A space is uniformly E-connected if the only uniformly continuous mappings from the space to a space in the class E are the constant mappings. We develop the basic theory for E-connected sets, including the product theorem. Furthermore, we define and study uniform local E-connectedness, generalizing a classical definition from the theory of uniform convergence spaces to the lattice-valued case. In particular it is shown that if the underlying lattice is completely distributive, the quotient space of a uniformly locally E-connected space and products of locally uniformly E-connected spaces are locally uniformly E-connected. © 2016, University of Sistan and Baluchestan. All rights reserved. Source


Falkowski B.-J.,Stralsund University of Applied Sciences
World Scientific Proc. Series on Computer Engineering and Information Science 7; Uncertainty Modeling in Knowledge Engineering and Decision Making - Proceedings of the 10th International FLINS Conf. | Year: 2012

A solution of the ranking problem using kernels is described. As a consequence an elegant probabilistic ranking algorithm is obtained from the pocket algorithm. This removes a restriction from a former paper and simplifies proofs considerably. In addition results concerning class probabilities are exhibited. Some preliminary experimental results are reported and briefly discussed. Source


Pieper J.,Stralsund University of Applied Sciences
2012 2nd International Workshop on Games and Software Engineering: Realizing User Engagement with Game Engineering Techniques, GAS 2012 - Proceedings | Year: 2012

Software Processes belong to those knowledge areas of software engineering that are less suitable to be taught classically in lectures. Class projects which frequently complement lectures are limited by academic settings in various ways too. Simulation and digital game-based learning are considered to have great potential to extend the learning experiences beyond lectures and class projects, help to develop insight into the necessity of software processes and to widen the perspective of software engineering students in a virtual and efficient way. Several efforts made by different research groups show encouraging results. This research gathers preliminary findings, develops new ideas and gives suggestions to exhaust the potential further and to encourage the wider application of digital game-based learning in software engineering education. These suggestions are the foundation for building blocks of a new framework for simulation based digital learning games aiming to teach software engineering processes more effectively and efficiently. © 2012 IEEE. Source


Torsel A.-M.,Stralsund University of Applied Sciences
Proceedings - International Computer Software and Applications Conference | Year: 2011

Model-based testing is a promising technique for test case design that is used in an increasing number of application domains. However, to fully gain efficiency advantages, intuitive domain-specific notations with comfortable tool support as well as a high degree of automation in the whole testing process are required. In this paper, a model-based testing approach for web application black box testing is presented. A notation for web application control flow models augmented with data flow information is introduced. The described research prototype demonstrates the fully automated generation of ready to use test case scripts for common test automation tools including test oracles from the model. © 2011 IEEE. Source

Discover hidden collaborations