Asia... lijknat widh een flygande Häst, hwilken Poëterne kalla Pegasum - [Kartta - kartan - the map]

Stockholm 1595, Andreas Gutterwitz

Matkapuhelinverkon MAP-protokollatoteutus älyverkkopalveluiden ohjauspisteeseen

Työssä esitellään yleiseurooppalaisen GSM-matkapuhelinjärjestelmän verkkoelementtejä ja perehdytään niiden väliseen standardoituun merkinantoprotokollaan. Lisäksi tarkastellaan protokollan lyhytsanomien välitykseen liittyviä operaatioita ja niissä tapahtunutta kehitystä standardoinnin eri vaiheissa. Tavoitteena oli toteuttaa GSM-matkapuhelinverkon merkinantoprotokollaan perustuva ohjelma, jonka tehtävänä on välittää lyhytsanomia matkapuhelin- ja lyhytsanomakeskuksen välillä. Matkapuhelimeen päättyvän lyhytsanoman välitykseen liittyy lisäksi reititystiedon hakeminen vastaanottajan kotirekisteristä. Toteutuksessa on ohjelmointirajapinta, joka helpottaa matkapuhelinverkon uusien palvelusovellusten kehittämistä. Toteutus testattiin standardoituja testitapauksia soveltaen. Yhdenmukaisuustestauksessa käytettiin apuna merkinantoanalysaattoria. Testauksessa tarkastettiin, että protokolla toimii loogisesti oikein. Suorituskykyä ei ole voitu testata todellisessa testiympäristössä, mutta ohjelmallisesti toteutettujen simulaattoreiden avulla on saatu hyviä tuloksia.

On the bicanonical map of irregular varieties

From the point of view of uniform bounds for the birationality of pluricanonical maps, irregular varieties of general type and maximal Albanese dimension behave similarly to curves. In fact Chen-Hacon showed that, at least when their holomorphic Euler characteristic is positive, the tricanonical map of such varieties is always birational. In this paper we study the bicanonical map. We consider the natural subclass of varieties of maximal Albanese dimension formed by primitive varieties of Albanese general type. We prove that the only such varieties with non-birational bicanonical map are the natural higher-dimensional generalization to this context of curves of genus $2$: varieties birationally equivalent to the theta-divisor of an indecomposable principally polarized abelian variety. The proof is based on the (generalized) Fourier-Mukai transform.

International STakeholder NETwork (ISTNET): creating a developmental neurotoxicity (DNT) testing road map for regulatory purposes.

A major problem in developmental neurotoxicity (DNT) risk assessment is the lack of toxicological hazard information for most compounds. Therefore, new approaches are being considered to provide adequate experimental data that allow regulatory decisions. This process requires a matching of regulatory needs on the one hand and the opportunities provided by new test systems and methods on the other hand. Alignment of academically and industrially driven assay development with regulatory needs in the field of DNT is a core mission of the International STakeholder NETwork (ISTNET) in DNT testing. The first meeting of ISTNET was held in Zurich on 23-24 January 2014 in order to explore the concept of adverse outcome pathway (AOP) to practical DNT testing. AOPs were considered promising tools to promote test systems development according to regulatory needs. Moreover, the AOP concept was identified as an important guiding principle to assemble predictive integrated testing strategies (ITSs) for DNT. The recommendations on a road map towards AOP-based DNT testing is considered a stepwise approach, operating initially with incomplete AOPs for compound grouping, and focussing on key events of neurodevelopment. Next steps to be considered in follow-up activities are the use of case studies to further apply the AOP concept in regulatory DNT testing, making use of AOP intersections (common key events) for economic development of screening assays, and addressing the transition from qualitative descriptions to quantitative network modelling.

Local map update for large scale SLAM

A technique for simultaneous localisation and mapping (SLAM) for large scale scenarios is presented. This solution is based on the use of independent submaps of a limited size to map large areas. In addition, a global stochastic map, containing the links between adjacent submaps, is built. The information in both levels is corrected every time a loop is closed: local maps are updated with the information from overlapping maps, and the global stochastic map is optimised by means of constrained minimisation

New Distance Transforms for Gray Level Image Compression

This thesis deals with distance transforms which are a fundamental issue in image processing and computer vision. In this thesis, two new distance transforms for gray level images are presented. As a new application for distance transforms, they are applied to gray level image compression. The new distance transforms are both new extensions of the well known distance transform algorithm developed by Rosenfeld, Pfaltz and Lay. With some modification their algorithm which calculates a distance transform on binary images with a chosen kernel has been made to calculate a chessboard like distance transform with integer numbers (DTOCS) and a real value distance transform (EDTOCS) on gray level images. Both distance transforms, the DTOCS and EDTOCS, require only two passes over the graylevel image and are extremely simple to implement. Only two image buffers are needed: The original gray level image and the binary image which defines the region(s) of calculation. No other image buffers are needed even if more than one iteration round is performed. For large neighborhoods and complicated images the two pass distance algorithm has to be applied to the image more than once, typically 3 10 times. Different types of kernels can be adopted. It is important to notice that no other existing transform calculates the same kind of distance map as the DTOCS. All the other gray weighted distance function, GRAYMAT etc. algorithms find the minimum path joining two points by the smallest sum of gray levels or weighting the distance values directly by the gray levels in some manner. The DTOCS does not weight them that way. The DTOCS gives a weighted version of the chessboard distance map. The weights are not constant, but gray value differences of the original image. The difference between the DTOCS map and other distance transforms for gray level images is shown. The difference between the DTOCS and EDTOCS is that the EDTOCS calculates these gray level differences in a different way. It propagates local Euclidean distances inside a kernel. Analytical derivations of some results concerning the DTOCS and the EDTOCS are presented. Commonly distance transforms are used for feature extraction in pattern recognition and learning. Their use in image compression is very rare. This thesis introduces a new application area for distance transforms. Three new image compression algorithms based on the DTOCS and one based on the EDTOCS are presented. Control points, i.e. points that are considered fundamental for the reconstruction of the image, are selected from the gray level image using the DTOCS and the EDTOCS. The first group of methods select the maximas of the distance image to new control points and the second group of methods compare the DTOCS distance to binary image chessboard distance. The effect of applying threshold masks of different sizes along the threshold boundaries is studied. The time complexity of the compression algorithms is analyzed both analytically and experimentally. It is shown that the time complexity of the algorithms is independent of the number of control points, i.e. the compression ratio. Also a new morphological image decompression scheme is presented, the 8 kernels' method. Several decompressed images are presented. The best results are obtained using the Delaunay triangulation. The obtained image quality equals that of the DCT images with a 4 x 4

Knowledge Map of Research on Biofuels

This work highlights and analyzes the citations and co-citations by different authors, countries and institutions in series of researches on biofuel. These relations represent a knowledge map which shows the areas of research by different countries and authors. The contributions of different institutions were also shown. With this knowledge map developed, areas of research that still need more attention as well as the most important studies were highlighted. The software used for this analysis is Citespace which is developed by Chaomei Chen. Sources of information are articles retrieved from ISI Web of Science. Biofuel as a renewable form of energy is discussed. Its sources, types, methods of production, effects, market, and producers were discussed. Also plans and strategies that aim at boosting world biofuel market were listed as well as recent researches on it. Knowledge mapping, its types and methods as well as the method and software used for the analysis were also discussed.

Building the map of innovation for membrane materials (Ceramic membranes)

This work proposes a method of visualizing the trend of research in the field of ceramic membranes from 1999 to 2006. The presented approach involves identifying problems encountered during research in the field of ceramic membranes. Patents from US patent database and articles from Science Direct(& by ELSEVIER was analyzed for this work. The identification of problems was achieved with software Knowledgist which focuses on the semantic nature of a sentence to generate series of subject action object structures. The identified problems are classified into major research issues. This classification was used for the visualization of the intensity of research. The image produced gives the relation between the number of patents, with time and the major research issues. The identification of the most cited papers which strongly influence the research of the previously identified major issues in the given field was also carried out. The relations between these papers are presented using the metaphor of social network. The final result of this work are two figures, a diagram showing the change in the studied problems a specified period of time and a figure showing the relations between the major papers and groups of the problems