Fraud detection in the banking sector : a multi-agent approach

Fraud is an increasing phenomenon as shown in many surveys carried out by leading international consulting companies in the last years. Despite the evolution of electronic payments and hacking techniques there is still a strong human component in fraud schemes. Conflict of interest in particular is the main contributing factor to the success of internal fraud. In such cases anomaly detection tools are not always the best instruments, since the fraud schemes are based on faking documents in a context dominated by lack of controls, and the perpetrators are those ones who should control possible irregularities. In the banking sector audit team experts can count only on their experience, whistle blowing and the reports sent by their inspectors. The Fraud Interactive Decision Expert System (FIDES), which is the core of this research, is a multi-agent system built to support auditors in evaluating suspicious behaviours and to speed up the evaluation process in order to detect or prevent fraud schemes. The system combines Think-map, Delphi method and Attack trees and it has been built around audit team experts and their needs. The output of FIDES is an attack tree, a tree-based diagram to ”systematically categorize the different ways in which a system can be attacked”. Once the attack tree is built, auditors can choose the path they perceive as more suitable and decide whether or not to start the investigation. The system is meant for use in the future to retrieve old cases in order to match them with new ones and find similarities. The retrieving features of the system will be useful to simplify the risk management phase, since similar countermeasures adopted for past cases might be useful for present ones. Even though FIDES has been built with the banking sector in mind, it can be applied in all those organisations, like insurance companies or public organizations, where anti-fraud activity is based on a central anti-fraud unit and a reporting system.

Tuning Performance of Multi-threaded programs

Diplomityö tarkastelee säikeistettyä ohjelmointia rinnakkaisohjelmoinnin ylemmällä hierarkiatasolla tarkastellen erityisesti hypersäikeistysteknologiaa. Työssä tarkastellaan hypersäikeistyksen hyviä ja huonoja puolia sekä sen vaikutuksia rinnakkaisalgoritmeihin. Työn tavoitteena oli ymmärtää Intel Pentium 4 prosessorin hypersäikeistyksen toteutus ja mahdollistaa sen hyödyntäminen, missä se tuo suorituskyvyllistä etua. Työssä kerättiin ja analysoitiin suorituskykytietoa ajamalla suuri joukko suorituskykytestejä eri olosuhteissa (muistin käsittely, kääntäjän asetukset, ympäristömuuttujat...). Työssä tarkasteltiin kahdentyyppisiä algoritmeja: matriisioperaatioita ja lajittelua. Näissä sovelluksissa on säännöllinen muistinkäyttökuvio, mikä on kaksiteräinen miekka. Se on etu aritmeettis-loogisissa prosessoinnissa, mutta toisaalta huonontaa muistin suorituskykyä. Syynä siihen on nykyaikaisten prosessorien erittäin hyvä raaka suorituskyky säännöllistä dataa käsiteltäessä, mutta muistiarkkitehtuuria rajoittaa välimuistien koko ja useat puskurit. Kun ongelman koko ylittää tietyn rajan, todellinen suorituskyky voi pudota murto-osaan huippusuorituskyvystä.

Sarjakytkentäisen taajuusmuuttajan ohjauksen toteutus FPGA-piireillä

Tässä diplomityössä tutustutaan sarjakytkentäisen taajuusmuuttajan rakenteeseen ja ohjaukseen. Työssä tarkastellaan myös hajautetun järjestelmän testaamista ja ohjelmointia. Työssä toteutettiin sarjakytkentäisen taajuusmuuttajan modulaattori hajautetusti FPGA-piireille. Lisäksi diplomityössä kehitettiin ja toteutettiin optinen JTAG-rajapinta hajautetun järjestelmän testaukseen ja ohjelmointiin. Laboratoriokoelaitteisto koostui yhdeksästä taajuusmuuttajan ohjauskortista, LUT Master -ohjausyksiköstä ja dSPACE-ohjausjärjestelmästä. Laboratoriomittaukset tehtiin Lappeenrannan teknillisen yliopiston Säätötekniikan laboratoriossa.

Development of a measuring-control system for energy monitoring in low power

In this thesis a control system for an intelligent low voltage energy grid is presented, focusing on the control system created by using a multi-agent approach which makes it versatile and easy to expand according to the future needs. The control system is capable of forecasting the future energy consumption and decisions making on its own without human interaction when countering problems. The control system is a part of the St. Petersburg State Polytechnic University’s smart grid project that aims to create a smart grid for the university’s own use. The concept of the smart grid is interesting also for the consumers as it brings new possibilities to control own energy consumption and to save money. Smart grids makes it possible to monitor the energy consumption in real-time and to change own habits to save money. The intelligent grid also brings possibilities to integrate the renewable energy sources to the global or the local energy production much better than the current systems. Consumers can also sell their extra power to the global grid if they want.

Hammashihnajohdeakseleiden liikkeiden synkronointi

Nykyisessä valmistusteollisuudessa erilaisten robottien ja automatisoitujen tuotantovaiheiden rooli on erittäin merkittävä. Tarkasti suunnitellut liikkeet ja toimintavaiheet voidaan nykyisillä järjestelmillä ajoittaa tarkasti toisiinsa nähden, jolloin erilaisten virhetilanteidenkin sattuessa järjestelmä pystyy toimimaan tilanteen edellyttämällä tavalla. Automatisoinnin etuna on myös tuotannon muokkaaminen erilaisten tuotteiden valmistamiseen pienillä muutoksilla, jolloin tuotantokustannukset pysyvät matalina myös pienten valmistuserien tapauksissa. Usean akselin laitteissa eli niin sanotuissa moniakselikäytöissä laitteen toimintatarkkuus riippuu jokaisen liikeakselin tarkkuudesta. Liikkeenohjauksessa on perinteisesti ollut käytössä myötäkytketty paikkakaskadi, jonka virityksessä otetaan huomioon akselilla olevat erilaiset dynaamiset tilat ja käytettävät referenssit. Monissa nykyisissä hajautetuissa järjestelmissä eli moniakselikäytöissä, joissa jokaiselle akselille on oma ohjauslaite, ei yksittäisen akselin paikkavirhettä huomioida muiden akseleiden ohjauksessa. Työssä tutkitaan erilaisia moniakselijärjestelmien ohjausmenetelmiä ja myötäkytketyn paikkakaskadin toimintaa moniakselikäytössä pyritään parantamaan tuomalla paikkasäätimen rinnalle toinen säädin, jonka tulona on akseleiden välinen paikkaero.

Exploring Adaptive Implementation of On-Chip Networks

As technology geometries have shrunk to the deep submicron regime, the communication delay and power consumption of global interconnections in high performance Multi- Processor Systems-on-Chip (MPSoCs) are becoming a major bottleneck. The Network-on- Chip (NoC) architecture paradigm, based on a modular packet-switched mechanism, can address many of the on-chip communication issues such as performance limitations of long interconnects and integration of large number of Processing Elements (PEs) on a chip. The choice of routing protocol and NoC structure can have a significant impact on performance and power consumption in on-chip networks. In addition, building a high performance, area and energy efficient on-chip network for multicore architectures requires a novel on-chip router allowing a larger network to be integrated on a single die with reduced power consumption. On top of that, network interfaces are employed to decouple computation resources from communication resources, to provide the synchronization between them, and to achieve backward compatibility with existing IP cores. Three adaptive routing algorithms are presented as a part of this thesis. The first presented routing protocol is a congestion-aware adaptive routing algorithm for 2D mesh NoCs which does not support multicast (one-to-many) traffic while the other two protocols are adaptive routing models supporting both unicast (one-to-one) and multicast traffic. A streamlined on-chip router architecture is also presented for avoiding congested areas in 2D mesh NoCs via employing efficient input and output selection. The output selection utilizes an adaptive routing algorithm based on the congestion condition of neighboring routers while the input selection allows packets to be serviced from each input port according to its congestion level. Moreover, in order to increase memory parallelism and bring compatibility with existing IP cores in network-based multiprocessor architectures, adaptive network interface architectures are presented to use multiple SDRAMs which can be accessed simultaneously. In addition, a smart memory controller is integrated in the adaptive network interface to improve the memory utilization and reduce both memory and network latencies. Three Dimensional Integrated Circuits (3D ICs) have been emerging as a viable candidate to achieve better performance and package density as compared to traditional 2D ICs. In addition, combining the benefits of 3D IC and NoC schemes provides a significant performance gain for 3D architectures. In recent years, inter-layer communication across multiple stacked layers (vertical channel) has attracted a lot of interest. In this thesis, a novel adaptive pipeline bus structure is proposed for inter-layer communication to improve the performance by reducing the delay and complexity of traditional bus arbitration. In addition, two mesh-based topologies for 3D architectures are also introduced to mitigate the inter-layer footprint and power dissipation on each layer with a small performance penalty.

An EDTA-β-cyclodextrin adsorbent for the adsorption of rare earth elements and its application in preconcentration of ultratrace rare earth elements from seawater

The objectives of this work were synthesizing an EDTA-β-CD adsorbent and investigating its adsorption potential and applications in preconcentration of REEs from aqueous phase. The adsorption capacity of EDTA-β-CD was investigated. The adsorption studies were performed by batch techniques both in one- and multi-component systems. The effects of pH, contact time and initial concentration were evaluated. The analytical detection methods and characterization methods were presented. EDTA-β-CD adsorbent was synthesized successfully with high EDTA coverage. The maximum REEs uptake was 0.310 mmol g-1 for La(III), 0.337 mmol g-1 for Ce(III) and 0.353 mmol g-1 for Eu(III), respectively. The kinetics of REEs onto EDTA-β-CD fitted well to pseudo-second-order model and the adsorption rate was affected by intra-particle diffusion. The experimental data of one component studies fitted to Langmuir isotherm model indicating the homogeneous surface of the adsorbent. The extended Sips model was applicable for the isotherm studies in three-component system. The electrostatic interaction, chelation and complexation were all involved in the adsorption mechanism. The preconcentration of RE ions and regeneration of EDTA-β-CD were successful. Overall, EDTA-β-CD is an effective adsorbent in adsorption and preconcentration of REEs.

Optimizing last mile delivery using public transport with multiagent based control

The majority of research work carried out in the field of Operations-Research uses methods and algorithms to optimize the pick-up and delivery problem. Most studies aim to solve the vehicle routing problem, to accommodate optimum delivery orders, vehicles etc. This paper focuses on green logistics approach, where existing Public Transport infrastructure capability of a city is used for the delivery of small and medium sized packaged goods thus, helping improve the situation of urban congestion and greenhouse gas emissions reduction. It carried out a study to investigate the feasibility of the proposed multi-agent based simulation model, for efficiency of cost, time and energy consumption. Multimodal Dijkstra Shortest Path algorithm and Nested Monte Carlo Search have been employed for a two-phase algorithmic approach used for generation of time based cost matrix. The quality of the tour is dependent on the efficiency of the search algorithm implemented for plan generation and route planning. The results reveal a definite advantage of using Public Transportation over existing delivery approaches in terms of energy efficiency.

A mathematical study of fuzzy logic; an algebraic approach

Fuzzy set theory and Fuzzy logic is studied from a mathematical point of view. The main goal is to investigatecommon mathematical structures in various fuzzy logical inference systems and to establish a general mathematical basis for fuzzy logic when considered as multi-valued logic. The study is composed of six distinct publications. The first paper deals with Mattila'sLPC+Ch Calculus. THis fuzzy inference system is an attempt to introduce linguistic objects to mathematical logic without defining these objects mathematically.LPC+Ch Calculus is analyzed from algebraic point of view and it is demonstratedthat suitable factorization of the set of well formed formulae (in fact, Lindenbaum algebra) leads to a structure called ET-algebra and introduced in the beginning of the paper. On its basis, all the theorems presented by Mattila and many others can be proved in a simple way which is demonstrated in the Lemmas 1 and 2and Propositions 1-3. The conclusion critically discusses some other issues of LPC+Ch Calculus, specially that no formal semantics for it is given.In the second paper the characterization of solvability of the relational equation RoX=T, where R, X, T are fuzzy relations, X the unknown one, and o the minimum-induced composition by Sanchez, is extended to compositions induced by more general products in the general value lattice. Moreover, the procedure also applies to systemsof equations. In the third publication common features in various fuzzy logicalsystems are investigated. It turns out that adjoint couples and residuated lattices are very often present, though not always explicitly expressed. Some minor new results are also proved.The fourth study concerns Novak's paper, in which Novak introduced first-order fuzzy logic and proved, among other things, the semantico-syntactical completeness of this logic. He also demonstrated that the algebra of his logic is a generalized residuated lattice. In proving that the examination of Novak's logic can be reduced to the examination of locally finite MV-algebras.In the fifth paper a multi-valued sentential logic with values of truth in an injective MV-algebra is introduced and the axiomatizability of this logic is proved. The paper developes some ideas of Goguen and generalizes the results of Pavelka on the unit interval. Our proof for the completeness is purely algebraic. A corollary of the Completeness Theorem is that fuzzy logic on the unit interval is semantically complete if, and only if the algebra of the valuesof truth is a complete MV-algebra. The Compactness Theorem holds in our well-defined fuzzy sentential logic, while the Deduction Theorem and the Finiteness Theorem do not. Because of its generality and good-behaviour, MV-valued logic can be regarded as a mathematical basis of fuzzy reasoning. The last paper is a continuation of the fifth study. The semantics and syntax of fuzzy predicate logic with values of truth in ana injective MV-algerba are introduced, and a list of universally valid sentences is established. The system is proved to be semanticallycomplete. This proof is based on an idea utilizing some elementary properties of injective MV-algebras and MV-homomorphisms, and is purely algebraic.

Teaching mathematics and programming : new approaches with empirical evaluation

Programming and mathematics are core areas of computer science (CS) and consequently also important parts of CS education. Introductory instruction in these two topics is, however, not without problems. Studies show that CS students find programming difficult to learn and that teaching mathematical topics to CS novices is challenging. One reason for the latter is the disconnection between mathematics and programming found in many CS curricula, which results in students not seeing the relevance of the subject for their studies. In addition, reports indicate that students' mathematical capability and maturity levels are dropping. The challenges faced when teaching mathematics and programming at CS departments can also be traced back to gaps in students' prior education. In Finland the high school curriculum does not include CS as a subject; instead, focus is on learning to use the computer and its applications as tools. Similarly, many of the mathematics courses emphasize application of formulas, while logic, formalisms and proofs, which are important in CS, are avoided. Consequently, high school graduates are not well prepared for studies in CS. Motivated by these challenges, the goal of the present work is to describe new approaches to teaching mathematics and programming aimed at addressing these issues: Structured derivations is a logic-based approach to teaching mathematics, where formalisms and justifications are made explicit. The aim is to help students become better at communicating their reasoning using mathematical language and logical notation at the same time as they become more confident with formalisms. The Python programming language was originally designed with education in mind, and has a simple syntax compared to many other popular languages. The aim of using it in instruction is to address algorithms and their implementation in a way that allows focus to be put on learning algorithmic thinking and programming instead of on learning a complex syntax. Invariant based programming is a diagrammatic approach to developing programs that are correct by construction. The approach is based on elementary propositional and predicate logic, and makes explicit the underlying mathematical foundations of programming. The aim is also to show how mathematics in general, and logic in particular, can be used to create better programs.