Modal μ-calculus is a logic that uses min and max fixed point operators (μ, ν). It is very applicable for use in model checking, a promising domain for development, both theoretically and practically. In this essay modal μ-calculus will be defined and several interpretation algorithms will be presented. Some of the algorithms are more or less intuitive, while others involve automata theory and ...

Substantial number of problems in artificial intelligence requires optimization. Increasing complexity of the problems imposes several challenges on optimization algorithms. The algorithms must be fast, computationally efficient, and scalable. Balance between convergence speed and computational complexity is of central importance. Typical example is the task of training neural networks. Superli...

This paper deals with single layer polarization independent Frequency selective surface (FSS) which acts as a triple band reject filter. The two stop bands are broad with percentage bandwidth 11.16% and 10.13% and one is narrow with 3.33% bandwidth. The band ratio is more than 1.5 and band separation is around 30-35dB. This design is investigated theoretically by ANSOFT® Designer software and p...

This paper surveys methods for simplifying and approximating polygonal surfaces. A polygonal surface is a piecewiselinear surface in 3-D defined by a set of polygons; typically a set of triangles. Methods from computer graphics, computer vision, cartography, computational geometry, and other fields are classified, summarized, and compared both practically and theoretically. The surface types ra...

Several algorithms for performing gossiping on one-and higher dimensional meshes are presented. As a routing model, we assume the practically important worm-hole routing. For one-dimensional arrays, we give a novel lower bound and an asymptotically optimal gossiping algorithm. For two-dimensional meshes, we present a simple algorithm composed of one-dimensional phases. For an important range of...

Determining the meaning of words in text is an important process in natural language processing. In this paper, we propose a new method for word sense disambiguation that uses a corpus-based semantic network. Creating a semantic network that represents semantic distances among words in general, we resolve the ambiguities activating the network. Theoretically, our method needs no annotation on t...

In the information systems development process there are important success factors emerging from organisational issues. In order to manage these factors in an effective manner the organisation has to be prepared already before the project begins. Based on these factors we have developed a theoretically grounded framework aiming to guide organisations in what considerations they should make in t...

In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study whic...

Determining whether a graph is planar is both theoretically and practically interesting. Although several sequential algorithms have been introduced which accomplish planarity testing in O(V ) time for graphs with V vertices, very few of these have been parallelized. In a recent comparison of sequential planarity testing algorithms, the newest algorithms were found to be fastest; however, these...

It has been a big challenge for lattice QCD to simulate dynamical quarks near the chiral limit. Theoretically, it is well-known that the naive chiral symmetry cannot be realized on the lattice (the Nielsen-Ninomiya theorem). Also practically, the computational cost rapidly grows as the quark mass is reduced. The JLQCD collaboration started a project to perform simulations with exact but modifie...