Tietokantojen yhdistäminen järjestelmän rajapintoja hyödyntäen

Tässä työssä on pyritty kartoittamaan mahdollisuudet omatoimiseen Voyager-kirjastojärjestelmän aineistotietokantojen ja asiakasrekisterien yhdistelyyn. Lähtökohtana on ollut oletus, että kohdejärjestelmän tietokantaan ei ole oikeuksia eikä sopimusteknistä mahdollisuuttakaan kirjoittaa tietoja suoraan kyselykielellä. Järjestelmän dokumentaatiota sekä verkostoa hyödyntämällä olen pyrkinyt kartoittamaan mahdollisuudet kaiken toiminnallisuuden vaatiman datan siirtoon. Hyödyntämällä järjestelmän rajapintoja, voidaan saavuttaa kustannussäästöjä sekä joustavuutta työn suorittamisen aikataulutukseen. Bibliografisen datan siirtoon Voyager-kirjastojärjestelmässä on mahdollisuus hyödyntää palvelimella eräajona suoritettavaa ohjelmaa. Tässä eräajossa voidaan siirtää sekä bibliografiset tietueet että varastotietueet. Nidetietojen kirjoittamiseksi kohteena olevaan tietokantaan käytetään Visual Studio -sovellusta, joka hyödyntää luettelointirajapintaa. Asiakastietojen siirtoon on mahdollista hyödyntää palvelimella suoritettavaa eräajoa, jonka syötteeksi kirjoitetaan määrämittainen syötetiedosto. Asiakastietueisiin sidotut lainatiedot voidaan siirtää kohdetietokantaan asiakasohjelman offline-lainaustoiminnolla.

On Energy Efficient Computing Platforms

In accordance with the Moore's law, the increasing number of on-chip integrated transistors has enabled modern computing platforms with not only higher processing power but also more affordable prices. As a result, these platforms, including portable devices, work stations and data centres, are becoming an inevitable part of the human society. However, with the demand for portability and raising cost of power, energy efficiency has emerged to be a major concern for modern computing platforms. As the complexity of on-chip systems increases, Network-on-Chip (NoC) has been proved as an efficient communication architecture which can further improve system performances and scalability while reducing the design cost. Therefore, in this thesis, we study and propose energy optimization approaches based on NoC architecture, with special focuses on the following aspects. As the architectural trend of future computing platforms, 3D systems have many bene ts including higher integration density, smaller footprint, heterogeneous integration, etc. Moreover, 3D technology can signi cantly improve the network communication and effectively avoid long wirings, and therefore, provide higher system performance and energy efficiency. With the dynamic nature of on-chip communication in large scale NoC based systems, run-time system optimization is of crucial importance in order to achieve higher system reliability and essentially energy efficiency. In this thesis, we propose an agent based system design approach where agents are on-chip components which monitor and control system parameters such as supply voltage, operating frequency, etc. With this approach, we have analysed the implementation alternatives for dynamic voltage and frequency scaling and power gating techniques at different granularity, which reduce both dynamic and leakage energy consumption. Topologies, being one of the key factors for NoCs, are also explored for energy saving purpose. A Honeycomb NoC architecture is proposed in this thesis with turn-model based deadlock-free routing algorithms. Our analysis and simulation based evaluation show that Honeycomb NoCs outperform their Mesh based counterparts in terms of network cost, system performance as well as energy efficiency.

Design Space Exploration for MPSoC Architectures

Multiprocessor system-on-chip (MPSoC) designs utilize the available technology and communication architectures to meet the requirements of the upcoming applications. In MPSoC, the communication platform is both the key enabler, as well as the key differentiator for realizing efficient MPSoCs. It provides product differentiation to meet a diverse, multi-dimensional set of design constraints, including performance, power, energy, reconfigurability, scalability, cost, reliability and time-to-market. The communication resources of a single interconnection platform cannot be fully utilized by all kind of applications, such as the availability of higher communication bandwidth for computation but not data intensive applications is often unfeasible in the practical implementation. This thesis aims to perform the architecture-level design space exploration towards efficient and scalable resource utilization for MPSoC communication architecture. In order to meet the performance requirements within the design constraints, careful selection of MPSoC communication platform, resource aware partitioning and mapping of the application play important role. To enhance the utilization of communication resources, variety of techniques such as resource sharing, multicast to avoid re-transmission of identical data, and adaptive routing can be used. For implementation, these techniques should be customized according to the platform architecture. To address the resource utilization of MPSoC communication platforms, variety of architectures with different design parameters and performance levels, namely Segmented bus (SegBus), Network-on-Chip (NoC) and Three-Dimensional NoC (3D-NoC), are selected. Average packet latency and power consumption are the evaluation parameters for the proposed techniques. In conventional computing architectures, fault on a component makes the connected fault-free components inoperative. Resource sharing approach can utilize the fault-free components to retain the system performance by reducing the impact of faults. Design space exploration also guides to narrow down the selection of MPSoC architecture, which can meet the performance requirements with design constraints.

Thermal-Aware Networked Many-Core Systems

Advancements in IC processing technology has led to the innovation and growth happening in the consumer electronics sector and the evolution of the IT infrastructure supporting this exponential growth. One of the most difficult obstacles to this growth is the removal of large amount of heatgenerated by the processing and communicating nodes on the system. The scaling down of technology and the increase in power density is posing a direct and consequential effect on the rise in temperature. This has resulted in the increase in cooling budgets, and affects both the life-time reliability and performance of the system. Hence, reducing on-chip temperatures has become a major design concern for modern microprocessors. This dissertation addresses the thermal challenges at different levels for both 2D planer and 3D stacked systems. It proposes a self-timed thermal monitoring strategy based on the liberal use of on-chip thermal sensors. This makes use of noise variation tolerant and leakage current based thermal sensing for monitoring purposes. In order to study thermal management issues from early design stages, accurate thermal modeling and analysis at design time is essential. In this regard, spatial temperature profile of the global Cu nanowire for on-chip interconnects has been analyzed. It presents a 3D thermal model of a multicore system in order to investigate the effects of hotspots and the placement of silicon die layers, on the thermal performance of a modern ip-chip package. For a 3D stacked system, the primary design goal is to maximise the performance within the given power and thermal envelopes. Hence, a thermally efficient routing strategy for 3D NoC-Bus hybrid architectures has been proposed to mitigate on-chip temperatures by herding most of the switching activity to the die which is closer to heat sink. Finally, an exploration of various thermal-aware placement approaches for both the 2D and 3D stacked systems has been presented. Various thermal models have been developed and thermal control metrics have been extracted. An efficient thermal-aware application mapping algorithm for a 2D NoC has been presented. It has been shown that the proposed mapping algorithm reduces the effective area reeling under high temperatures when compared to the state of the art.

Kuljetustensuunnittelu- ja reitinoptimointiohjelmiston kaupallistamiseen vaikuttavat keskeiset ominaisuudet

Ajoneuvojen reititystä on tutkittu 1950-luvulta asti, alunperin etsiessä polttoainekuljetuksille optimaalisinta reittiä varastolta useille palveluasemille. Siitä lähtien ajoneuvon reititystehtäviä on tutkittu akateemisesti ja niistä on muodostettu kymmeniä erilaisia variaatioita. Tehtävien ratkaisumenetelmät jaetaan tyypillisesti tarkkoihin menetelmiin sekä heuristiikkoihin ja metaheuristiikkoihin. Konetehon ja heuristiikoissa käytettävien algoritmien kehittymisen myötä reitinoptimointia on alettu tarjota kaupallisesti. CO-SKY-projektin tavoitteena on kaupallistaa web-pohjainen tai toiminnanohjausjärjestelmään integroitava ajoneuvon reititys. Diplomityössä tutkitaan kuljetustensuunnittelu- ja reitinoptimointiohjelmistojen kaupallistamiseen vaikuttavia keskeisiä ominaisuuksia. Ominaisuuksia on tarkasteltu: 1) erityisesti pk-kuljetusyritysten tarpeiden ja vaatimusten pohjalta, ja 2) markkinoilla olevien ohjelmistojen tarjontaa arvioiden. Näiden pohjalta on myös pyritty arvioimaan kysynnän ja tarjonnan kohtaamista. Pilottiasiakkaita haastattelemalla ohjelmistolle on kyetty asettamaan vaatimuksia, mutta samalla on kuultu käyttäjien mielipiteitä optimoinnista. Lukuisia logistiikkaohjelmistojen tarjoajia on haastateltu logistiikkamessuilla sekä Suomessa että Saksassa. Haastattelujen perusteella on saatu käsitys kyseisistä ohjelmista sekä optimoinnin tarjonnasta että kysynnästä. Akateeminen tutkimus aiheesta on laajaa, koskien niin teknistä toteutusta kuin myös (kysely-)tutkimuksia tarjolla olevien ohjelmistojen ominaisuuksista ja laadusta. Kuljetusyritysten tarpeissa on vaihtelua yritys- ja alakohtaisesti. Perusongelmat ovat samoja, joita reitinoptimoinnin akateemisessa tutkimuksessa käsitellään ja joita kaupalliset ohjelmistot pystyvät ratkaisemaan. Vaikka reitinoptimoinnilla saatavat hyödyt ovat mitattavissa, suunnittelu etenkin pk-yrityksissä tehdään pääosin yhä käsin. Messuhaastattelujen ja loppukäyttäjien mielipiteiden perusteella voidaan todeta kaupallisten ratkaisujen olevan suunniteltu isommille kuljetusyrityksille: tyypillisen it-projektin hinta, käyttöönottoaika ja asennus sekä ratkaisun takaisinmaksuaika vaikuttavat pk-yritysten hankintapäätökseen. Kaupallistamiseen liittyen haasteet liittyvät erityisesti segmentointiin ja markkinointiin asiakasarvon todentamisen ja sen välittämisen kautta.

Myynti ja toimituskanavan valinta ulkomaan kaupassa, kohdemaa Venäjä

Parissa kymmenessä vuodessa on tapahtunut paljon muutoksia. Neuvostoliitto hajosi, Suomen talousrakenne muuttui, globalisaatio kiihtyy kasvavalla vauhdilla, viennin kuljetusmuotoihin on tullut muutoksia, mutta yritystoiminta edellyttää pysymistä ajan tasalla. Tässä diplomityössä tutkitaan myynti- ja toimituskanavien valintoja EU:sta Venäjälle tapahtuvissa viennissä. Työssä käytetään Venäjältä saatavaa tietoa, sillä suurimmat lopputulokseen vaikuttavat kuljetuskustannukset kuten kuljetus, tavaran käsittely ja välivarastointi syntyvät Venäjän puolella. Vienti EU:sta Venäjälle on kasvanut koko ajan tasaisella vauhdilla ja muodostanut samalla tavanomaisesta poikkeavia kuljetusmenetelmiä. Suomessa pk-yrityksillä ei ole resursseja perehtyä aiheeseen, mutta koko ajan yhä useammat yritykset harjoittavat kauppaa ohjaamalla tavaran valmistajalta suoraan vastaanottajalle. Silloin tavara on lähetettävä esimerkiksi eurooppalaiselta keskusvarastolta Venäjälle, jolloin säästytään turhista kuljetuksista Suomen kautta. Työssä tutkitaan yleisimpiä käytössä olevia kuljetusmuotoja, rautatiekuljetuksen potentiaalia ja maantiekuljetuksen mahdollisuuksia. Siinä analysoidaan logistisen teorian pääpiirteitä, yritystoiminnan logistisia prosesseja samoin kuin EU:n vientisäädöksiä ja EU:sta lähtevien vientikuljetuksien organisointiongelmia. Käytössäni on logististen prosessien rakenteen metodologia. Työssä suoritetaan vientiprosessin tutkimus ja esitetään suoritetun tutkimuksen tulokset. Tuloksien pohjalta tehdään päätökset.

Replikoitavan palvelinjärjestelmän toteuttaminen julkisen liikenteen avoimen datan jakeluun

Tässä diplomityössä tutkittiin, miten toteuttaa replikoitava palvelinjärjestelmä julkisen liikenteen avoimen datan jakeluun. Tutkimuksessa selvitettiin, onko vastaavanlaisia järjestelmiä suunniteltu aiemmin, vai pitääkö järjestelmä suunnitella itse. Projektissa käytettiin avoimen lähdekoodin OneBusAway-ohjelmistokokonaisuutta. Projektin avulla osoitettiin, että kyseinen ohjelmisto toimi yliopiston testikäytössä hyvin. Ohjelmiston avulla pystytään jakelemaan staattista ja reaaliaikaista dataa, ja se on replikoitavissa kunnasta toiseen maailmanlaajuisesti. Tulevaisuudessa olisi kuitenkin hyvä selvittää, miten ohjelmistosta puuttuva reittihakuominaisuus kannattaisi toteuttaa, sekä olisiko REST- rajapinta mahdollista muuttaa sellaiseksi, että se noudattaisi julkisen liikenteen standardeja.

Participation of the endoplasmic reticulum protein chaperone thio-oxidoreductase in gonadotropin-releasing hormone receptor expression at the plasma membrane

Chaperone members of the protein disulfide isomerase family can catalyze the thiol-disulfide exchange reaction with pairs of cysteines. There are 14 protein disulfide isomerase family members, but the ability to catalyze a thiol disulfide exchange reaction has not been demonstrated for all of them. Human endoplasmic reticulum protein chaperone thio-oxidoreductase (ERp18) shows partial oxidative activity as a protein disulfide isomerase. The aim of the present study was to evaluate the participation of ERp18 in gonadotropin-releasing hormone receptor (GnRHR) expression at the plasma membrane. Cos-7 cells were cultured, plated, and transfected with 25 ng (unless indicated) wild-type human GnRHR (hGnRHR) or mutant GnRHR (Cys14Ala and Cys200Ala) and pcDNA3.1 without insert (empty vector) or ERp18 cDNA (75 ng/well), pre-loaded for 18 h with 1 µCi myo-[2-3H(N)]-inositol in 0.25 mL DMEM and treated for 2 h with buserelin. We observed a decrease in maximal inositol phosphate (IP) production in response to buserelin in the cells co-transfected with hGnRHR, and a decrease from 20 to 75 ng of ERp18 compared with cells co-transfected with hGnRHR and empty vector. The decrease in maximal IP was proportional to the amount of ERp18 DNA over the range examined. Mutants (Cys14Ala and Cys200Ala) that could not form the Cys14-Cys200 bridge essential for plasma membrane routing of the hGnRHR did not modify maximal IP production when they were co-transfected with ERp18. These results suggest that ERp18 has a reduction role on disulfide bonds in wild-type hGnRHR folding.

Modelling Energy Consumption of a Switch using Fuzzy-Rule Classifier

The energy consumption of IT equipments is becoming an issue of increasing importance. In particular, network equipments such as routers and switches are major contributors to the energy consumption of internet. Therefore it is important to understand how the relationship between input parameters such as bandwidth, number of active ports, traffic-load, hibernation-mode and their impact on energy consumption of a switch. In this paper, the energy consumption of a switch is analyzed in extensive experiments. A fuzzy rule-based model of energy consumption of a switch is proposed based on the result of experiments. The model can be used to predict the energy saving when deploying new switches by controlling the parameters to achieve desired energy consumption and subsequent performance. Furthermore, the model can also be used for further researches on energy saving techniques such as energy-efficient routing protocol, dynamic link shutdown, etc.

Variable-speed-drive-based detection methods for problems in fluid handling systems

Fluid handling systems account for a significant share of the global consumption of electrical energy. They also suffer from problems, which reduce their energy efficiency and increase life-cycle costs. Detecting or predicting these problems in time can make fluid handling systems more environmentally and economically sustainable to operate. In this Master’s Thesis, significant problems in fluid systems were studied and possibilities to develop variable-speed-drive-based detection methods for them was discussed. A literature review was conducted to find significant problems occurring in fluid handling systems containing pumps, fans and compressors. To find case examples for evaluating the feasibility of variable-speed-drive-based methods, queries were sent to industrial companies. As a result of this, the possibility to detect heat exchanger fouling with a variable-speed drive was analysed with data from three industrial cases. It was found that a mass flow rate estimate, which can be generated with a variable speed drive, can be used together with temperature measurements to monitor a heat exchanger’s thermal performance. Secondly, it was found that the fouling-related increase in the pressure drop of a heat exchanger can be monitored with a variable speed drive. Lastly, for systems where the flow device is speed controlled with by a pressure measurement, it was concluded that increasing rotational speed can be interpreted as progressing fouling in the heat exchanger.

Developmental patterns of individiuals within a sensory-based learning environment in art education : insights emerging from a case study /

My research permitted me to reexamine my recent evaluations of the Leaf Project given to the Foundation Year students during the fall semester of 1997. My personal description of the drawing curriculum formed part of the matrix of the Foundation Core Studies at the Ontario College of Art and Design. Research was based on the random selection of 1 8 students distributed over six of my teaching groups. The entire process included a representation of all grade levels. The intent of the research was to provide a pattern of alternative insights that could provide a more meaningful method of evaluation for visual learners in an art education setting. Visual methods of learning are indeed complex and involve the interplay of many sensory modalities of input. Using a qualitative method of research analysis, a series of queries were proposed into a structured matrix grid for seeking out possible and emerging patterns of learning. The grid provided for interrelated visual and linguistic analysis with emphasis in reflection and interconnectedness. Sensory-based modes of learning are currently being studied and discussed amongst educators as alternative approaches to learning. As patterns emerged from the research, it became apparent that a paradigm for evaluation would have to be a progressive profile of the learning that would take into account many of the different and evolving learning processes of the individual. A broader review of the student's entire development within the Foundation Year Program would have to have a shared evaluation through a cross section of representative faculty in the program. The results from the research were never intended to be conclusive. We realized from the start that sensory-based learning is a difficult process to evaluate from traditional standards used in education. The potential of such a process of inquiry permits the researcher to ask for a set of queries that might provide for a deeper form of evaluation unique to the students and their related learning environment. Only in this context can qualitative methods be used to profile their learning experiences in an expressive and meaningful manner.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

Improving the Scalability of Reduct Determination in Rough Sets

Rough Set Data Analysis (RSDA) is a non-invasive data analysis approach that solely relies on the data to find patterns and decision rules. Despite its noninvasive approach and ability to generate human readable rules, classical RSDA has not been successfully used in commercial data mining and rule generating engines. The reason is its scalability. Classical RSDA slows down a great deal with the larger data sets and takes much longer times to generate the rules. This research is aimed to address the issue of scalability in rough sets by improving the performance of the attribute reduction step of the classical RSDA - which is the root cause of its slow performance. We propose to move the entire attribute reduction process into the database. We defined a new schema to store the initial data set. We then defined SOL queries on this new schema to find the attribute reducts correctly and faster than the traditional RSDA approach. We tested our technique on two typical data sets and compared our results with the traditional RSDA approach for attribute reduction. In the end we also highlighted some of the issues with our proposed approach which could lead to future research.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.