El Motezuma de Vivaldi

This article explores aesthetic and historical aspects of Antonio Vivaldi's (1678- 1741) Motezuma (1733), in three acts, to celebrate this opera revival after the score's discovery and its first premiere at De Doelen theatre, Rotterdam (2005). Particular attention is paid to cultural aspects, regarding the European interpretation of the Conquest of Mexico.

Publishing in the Networked World: Transforming the Nature of Communication, 14th International Conference on Electronic Publishing 16-18 June 2010, Helsinki, Finland

The title of the 14th International Conference on Electronic Publishing (ELPUB), “Publishing in the networked world: Transforming the nature of communication”, is a timely one. Scholarly communication and scientific publishing has recently been undergoing subtle changes. Published papers are no longer fixed physical objects, as they once were. The “convergence” of information, communication, publishing and web technologies along with the emergence of Web 2.0 and social networks has completely transformed scholarly communication and scientific papers turned to living and changing entities in the online world. The themes (electronic publishing and social networks; scholarly publishing models; and technological convergence) selected for the conference are meant to address the issues involved in this transformation process. We are pleased to present the proceedings book with more than 30 papers and short communications addressing these issues. What you hold in your hands is a by-product and the culmination of almost a Year long work of many people including conference organizers, authors, reviewers, editors and print and online publishers. The ELPUB 2010 conference was organized and hosted by the Hanken School of Economics in Helsinki, Finland. Professors Turid Hedlund of Hanken School of Economics and Yaşar Tonta of Hacettepe University Department of Information Management (Ankara, Turkey) served as General Chair and Program Chair, respectively. We received more than 50 submissions from several countries. All submissions were peer-reviewed by members of an international Program Committee whose contributions proved most valuable and appreciated. The 14th ELPUB conference carries on the tradition of previous conferences held in the United Kingdom (1997 and 2001), Hungary (1998), Sweden (1999), Russia (2000), the Czech Republic (2002), Portugal (2003), Brazil (2004), Belgium (2005), Bulgaria (2006), Austria (2007), Canada (2008) and Italy (2009). The ELPUB Digital Library, http://elpub.scix.net serves as archive for the papers presented at the ELPUB conferences through the years. The 15th ELPUB conference will be organized by the Department of Information Management of Hacettepe University and will take place in Ankara, Turkey, from 14-16 June 2011. (Details can be found at the ELPUB web site as the conference date nears by.) We thank Marcus Sandberg and Hannu Sääskilahti for copyediting, Library Director Tua Hindersson – Söderholm for accepting to publish the online as well as the print version of the proceedings. Thanks also to Patrik Welling for maintaining the conference web site and Tanja Dahlgren for administrative support. We warmly acknowledge the support in organizing the conference to colleagues at Hanken School of Economics and our sponsors.

On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations

It is important to identify the ``correct'' number of topics in mechanisms like Latent Dirichlet Allocation(LDA) as they determine the quality of features that are presented as features for classifiers like SVM. In this work we propose a measure to identify the correct number of topics and offer empirical evidence in its favor in terms of classification accuracy and the number of topics that are naturally present in the corpus. We show the merit of the measure by applying it on real-world as well as synthetic data sets(both text and images). In proposing this measure, we view LDA as a matrix factorization mechanism, wherein a given corpus C is split into two matrix factors M-1 and M-2 as given by C-d*w = M1(d*t) x Q(t*w).Where d is the number of documents present in the corpus anti w is the size of the vocabulary. The quality of the split depends on ``t'', the right number of topics chosen. The measure is computed in terms of symmetric KL-Divergence of salient distributions that are derived from these matrix factors. We observe that the divergence values are higher for non-optimal number of topics - this is shown by a `dip' at the right value for `t'.

Population genetics of the invasive plant species Impatiens glandulifera in Southern Finland

Biological invasions affect biodiversity worldwide, and, consequently, the invaded ecosystems may suffer from significant losses in economic and cultural values. Impatiens glandulifera Royle (Balsaminaceae) is an invasive annual herb, native to the western Himalayas and introduced into Europe in the 19th century as a garden ornamental plant. The massive invasion of I. glandulifera is due to its high reproductive output, rapid growth and its ability to outcompete native species. In Finland, the first observations regarding the presence of I. glandulifera date from the year 1947, and today it is considered a serious problem in riparian habitats. The aim of this master’s thesis research is to reveal the population genetic structure of I. glandulifera in Finland and to find out whether there have been one or multiple invasions in Finland. The study focuses on investigating the origin of I. glandulifera in Southern Finland, by comparing plant samples from the Helsinki region with those from its native region and other regions of invasion. Samples from four populations in Helsinki and from the United Kingdom, Canada, India and Pakistan were collected and genotyped using 11 microsatellite markers. The genetic analyses were evaluated using the programs Arlequin and Structure. The results of the genetic analyses suggested that I. glandulifera has been introduced to Finland more than once. Multiple introductions are supported by the higher level of genetic diversity detected within and among Finnish populations than would be expected for a single introduction. Results of the Bayesian Structure analysis divided the four Finnish populations into four clusters. This geographical structure was further supported by pairwise Fst values among populations. The causes and potential consequences of such multiple introductions of I. glandulifera in Finland and further perspectives are discussed.

Sarveiskalvon permeabiliteetin ennustaminen QSPR-mallin avulla

QSPR-malli kuvaa kvantitatiivista riippuvuutta muuttujien ja biologisen ominaisuuden välillä. Näin ollen QSPR mallit ovat käyttökelpoisia lääkekehityksen apuvälineitä. Kirjallisessa osassa kerrotaan sarveiskalvon, suoliston ja veriaivoesteen permeabiliteetin malleista. Useimmin käytettyjä muuttujia ovat yhdisteen rasvaliukoisuus, polaarinen pinta-ala, vetysidosten muodostuminen ja varaus. Myös yhdisteen koko vaikuttaa läpäisevyyteen, vaikka tutkimuksissa onkin erilaista tietoa tämän merkittävyydestä. Malliin vaikuttaa myös muiden kuin mallissa mukana olevien muuttujien suuruusluokka esimerkkinä Lipinskin ‖rule of 5‖ luokittelu. Tässä luokittelussa yhdisteen ominaisuus ei saa ylittää tiettyjä raja-arvoja. Muussa tapauksessa sen imeytyminen suun kautta otettuna todennäköisesti vaarantuu. Lisäksi kirjallisessa osassa tutustuttiin kuljetinproteiineihin ja niiden toimintaan silmän sarveiskalvossa, suolistossa ja veriaivoesteessä. Nykyisin on kehitetty erilaisia QSAR-malleja kuljetinproteiineille ennustamaan mahdollisten substraatittien tai inhibiittorien vuorovaikutuksia kuljetinproteiinin kanssa. Kokeellisen osan tarkoitus oli rakentaa in silico -malli sarveiskalvon passiiviselle permeabiliteetille. Työssä tehtiin QSPR-malli 54 yhdisteen ACDLabs-ohjelmalla laskettujen muuttujien arvojen avulla. Permeabiliteettikertoimien arvot saatiin kirjallisuudesta kanin sarveiskalvon läpäisevyystutkimuksista. Lopullisen mallin muuttujina käytettiin oktanoli-vesijakaantumiskerrointa (logD) pH:ssa 7,4 ja vetysidosatomien kokonaismäärää. Yhtälö oli muotoa log10(permeabiliteettikerroin) = -3,96791 - 0,177842Htotal + 0,311963logD(pH7,4). R2-korrelaatiokerroin oli 0,77 ja Q2-korrelaatiokerroin oli 0,75. Lopullisen mallin hyvyyttä arvioitiin 15 yhdisteen ulkoisella testijoukolla, jolloin ennustettua permeabiliteettia verrattiin kokeelliseen permeabiliteettiin. QSPR-malli arvioitiin myös farmakokineettisen simulaation avulla. Simulaatiossa laskettiin seitsemän yhdisteen kammionestepitoisuudet in vivo vakaassa tilassa käyttäen simulaatioissa QSPR mallilla ennustettuja permeabiliteettikertoimia. Lisäksi laskettiin sarveiskalvon imeytymisen nopeusvakio (Kc) 13 yhdisteelle farmakokineettisen simulaation avulla ja verrattiin tätä lopullisella mallilla ennustettuun permeabiliteettiin. Tulosten perusteella saatiin tilastollisesti hyvä QSPR-malli kuvaamaan sarveiskalvon passiivista permeabiliteettia, jolloin tätä mallia voidaan käyttää lääkekehityksen alkuvaiheessa. QSPR-malli ennusti permeabiliteettikertoimet hyvin, mikä nähtiin vertaamalla mallilla ennustettuja arvoja kokeellisiin tuloksiin. Lisäksi yhdisteiden kammionestepitoisuudet voitiin simuloida käyttäen apuna QSPR-mallilla ennustettuja permeabiliteettikertoimien arvoja.

Segmenting point-sampled surfaces

Extracting features from point-based representations of geometric surface models is becoming increasingly important for purposes such as model classification, matching, and exploration. In an earlier paper, we proposed a multiphase segmentation process to identify elongated features in point-sampled surface models without the explicit construction of a mesh or other surface representation. The preliminary results demonstrated the strength and potential of the segmentation process, but the resulting segmentations were still of low quality, and the segmentation process could be slow. In this paper, we describe several algorithmic improvements to overcome the shortcomings of the segmentation process. To demonstrate the improved quality of the segmentation and the superior time efficiency of the new segmentation process, we present segmentation results obtained for various point-sampled surface models. We also discuss an application of our segmentation process to extract ridge-separated features in point-sampled surfaces of CAD models.

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.

Medetomidiinin glukuronidaation inhibitio

Lääkeainemetabolialla tarkoitetaan entsymaattisia reaktioita, jotka muuttavat lääkeaineita paremmin elimistöstä poistuvaan muotoon. Lääkeaineet voivat vaikuttaa toistensa metaboliaan inhiboimalla tai indusoimalla metaboloivia entsyymejä. Tällaisten interaktioiden seurauksena lääkeaineen pitoisuus elimistössä voi kasvaa jopa toksiseksi tai vähentyä merkittävästi. Tämä on erityisesti ongelmana silloin, kun käytössä on useita lääkkeitä samanaikaisesti. Lääketutkimuksessa onkin keskitytty tällaisten interaktioiden ennustamiseen ja niitä yritetään välttää tai ainakin vähentää. Työssä tutkittiin medetomidiinia, jonka on äskettäin havaittu metaboloituvan UDP-glukuronosyylitransferaasien (UGT) välityksellä. Työn tarkoituksena oli löytää medetomidiinin glukuronidaatiota inhiboivia yhdisteitä. Lisäksi haluttiin selvittää mahdollisen inhibition mekanismeja. On yleistä tutkia tietyn entsyymin substraatin interaktioita muiden saman perheen entsyymien kanssa. On kuitenkin harvinaisempaa tutkia tällaisia interaktioita kahden eri entsyymiperheen välillä. Tässä työssä tutkittiin inhiboivatko mahdolliset sytokromi P450 -entsyymiä (CYP) inhiboivat yhdisteet myös medetomidiinia glukuronoivia UDP-glukuronosyylitransferaaseja. Glukuronidaation inhibitiota tutkittiin HPLC-menetelmällä, joka on kehitetty aiemmin medetomidiinin glukuronidaation tutkimiseen. Aluksi glukuronidaatiota tutkittiin ilman inhibiittoreita. Tämän jälkeen tutkittiin kolmen mahdollisen inhibiittoriyhdisteen vaikutuksia medetomidiinin glukuronidaatioon ja tuloksia verrattiin ilman inhibiittoria saatuihin tuloksiin. Kolmen tutkitun yhdisteen havaittiin inhiboivan medetomidiinin glukuronidaatiota. Tutkimuksessa havaittiin myös mielenkiintoinen ilmiö, jossa inhibiittoriyhdisteen sitoutuminen aiheutti entsyymikineettisiä muutoksia UDP-glukuronosyylitransferaasin toiminnassa. On mielenkiintoista, että samat yhdisteet inhiboivat sekä CYP- että UGT-metaboliaa. Tulosten perusteella voidaan päätellä, että jos CYP ja UGT metaboloivat samaa yhdistettä, on mahdollista että yhdisteen rakenteelliset analogit aiheuttavat interaktioita molempien entsyymien kanssa. Uusia lääkeaineita kehitettäessä onkin otettava huomioon yleisesti tunnettujen CYP-entsyymien lisäksi myös UGT:t ja niiden mahdolliset yhteisvaikutukset.

Fyysinen varhaiskasvatusympäristö päiväkotien varhaiskasvatussuunnitelmissa

The National Curriculum Guidelines on Early Childhood Education and Care (ECEC) in Finland says that ECEC is developed holistically through observing children´s and the educator community´s activities and the ECEC environment. The background of this research was that assesment should be based on commonly agreed principles, which are recorded e.g. to unit-specific ECEC curriculum. The objective of this research was to investigate how unit-specific ECEC curriculums have descriped the physical indoor environment in day-care centres. According to the National Curriculum Guidelines on ECEC, there are four ways of acting that are peculiar to children: playing, physical activities, exploration and artistic experiences and self-expression. The descriptions of physical environment in unit-spesific curriculums were observed through above mentioned four ways of acting. In addition to that, the descriptions of four ways of acting were compared to each other, in order to find out, which are the main differencies and similarities in relation to physical ECEC environment. Research material was build on unit-specific ECEC curriculums from 18 day-care centres of Helsinki. Target of the research were the descriptions of physical indoor environment in curriculums.The method used in the research was theory-guided content analysis. The analyses were mainly qualitative. The descriptions of psysical environment varied widely both quantitatively and by substance. All curriculums contained mentions of playing and artistic experiences and self-expression, but mentions of physical activities and exploration were noticiably fewer. All four ways of acting were mentioned in research material in relation to premises and instruments. Also, principles related to the use of premises and instruments and other more common priciples were mentioned in relation to all ways of acting. Instead of that, children were not mentioned even once as an upholders or innovators of physical activities environment and children were mentioned only once regarding to exploration environment. All ways of acting included scenarios of e.g. that environment must provide possibilities of particular way of acting, and both materials and instruments must be available for children. Anyhow, research material did not include any principle or scenario that relates to physical environment that would have occurred in every unit-specific curriculum.

A fast algorithm for finding frequent episodes in event streams

Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the frequency of an episode is some suitable measure of how often the episode occurs in the data sequence. Recently,we proposed a new frequency measure for episodes based on the notion of non-overlapped occurrences of episodes in the event sequence, and showed that, such a definition, in addition to yielding computationally efficient algorithms, has some important theoretical properties in connecting frequent episode discovery with HMM learning. This paper presents some new algorithms for frequent episode discovery under this non-overlapped occurrences-based frequency definition. The algorithms presented here are better (by a factor of N, where N denotes the size of episodes being discovered) in terms of both time and space complexities when compared to existing methods for frequent episode discovery. We show through some simulation experiments, that our algorithms are very efficient. The new algorithms presented here have arguably the least possible orders of spaceand time complexities for the task of frequent episode discovery.

Clustering Based Large Margin Classification: A Scalable Approach using SOCP Formulation

This paper presents a novel Second Order Cone Programming (SOCP) formulation for large scale binary classification tasks. Assuming that the class conditional densities are mixture distributions, where each component of the mixture has a spherical covariance, the second order statistics of the components can be estimated efficiently using clustering algorithms like BIRCH. For each cluster, the second order moments are used to derive a second order cone constraint via a Chebyshev-Cantelli inequality. This constraint ensures that any data point in the cluster is classified correctly with a high probability. This leads to a large margin SOCP formulation whose size depends on the number of clusters rather than the number of training data points. Hence, the proposed formulation scales well for large datasets when compared to the state-of-the-art classifiers, Support Vector Machines (SVMs). Experiments on real world and synthetic datasets show that the proposed algorithm outperforms SVM solvers in terms of training time and achieves similar accuracies.

Diversity in ranking via resistive graph centers

Users can rarely reveal their information need in full detail to a search engine within 1--2 words, so search engines need to "hedge their bets" and present diverse results within the precious 10 response slots. Diversity in ranking is of much recent interest. Most existing solutions estimate the marginal utility of an item given a set of items already in the response, and then use variants of greedy set cover. Others design graphs with the items as nodes and choose diverse items based on visit rates (PageRank). Here we introduce a radically new and natural formulation of diversity as finding centers in resistive graphs. Unlike in PageRank, we do not specify the edge resistances (equivalently, conductances) and ask for node visit rates. Instead, we look for a sparse set of center nodes so that the effective conductance from the center to the rest of the graph has maximum entropy. We give a cogent semantic justification for turning PageRank thus on its head. In marked deviation from prior work, our edge resistances are learnt from training data. Inference and learning are NP-hard, but we give practical solutions. In extensive experiments with subtopic retrieval, social network search, and document summarization, our approach convincingly surpasses recently-published diversity algorithms like subtopic cover, max-marginal relevance (MMR), Grasshopper, DivRank, and SVMdiv.

Cognitive radio implementation for a frequency hopping primary signal

Frequency hopping communications, used in the military present significant opportunities for spectrum reuse via the cognitive radio technology. We propose a MAC which incorporates hop instant identification, and supports network discovery and formation, QOS Scheduling and secondary communications. The spectrum sensing algorithm is optimized to deal with the problem of spectral leakage. The algorithms are implemented in a SDR platform based test bed and measurement results are presented.

Biological sulfate reduction of a sulfate-rich industrial waste liquor using sulfate reducing bacteria

An industrial waste liquor having high sulfate concentrations was subjected to biological treatment using the sulfate-reducing bacteria (SRB) Desulfovibrio desulfuricans. Toxicity levels of different sulfate, cobalt and nickel concentrations toward growth of the SRB with respect to biological sulfate reduction kinetics was initially established. Optimum sulfate concentration to promote SRB growth amounted to 0.8 - 1 g/L. The strain of D. desulfuricans used in this study initially tolerated up to 4 -5 g/L of sulfate or 50 mg/L of cobalt and nickel, while its tolerance could be further enhanced through adaptation by serial subculturing in the presence of increasing concentrations of sulfate, cobalt and nickel. From the waste liquor, more than 70% of sulfate and 95% of cobalt and nickel could be precipitated as sulfides, using a preadapted strain of D. desulfuricans. Probable mechanisms involving biological sulfide precipitation and metal adsorption onto precipitates and bacterial cells are discussed.

Pd-Catalyzed Cross-Coupling Reactions of Hydrazones: Regioselective Synthesis of Highly Branched Dienes

The regioselective formation of highly branched dienes is a challenging task. Design and exploration of alternative working models to achieve such a regioselectivity to accomplish highly branched dienes is considered to be a historical advancement of Heck reaction to construct branched dienes. On the basis of the utility of carbene transfer reactions, in the reaction of hydrazones with Pd(II) under oxidative conditions, we envisioned obtaining a Pd-bis-carbene complex with alpha-hydrogens, which can lead to branched dienes. Herein, we report a novel Pd-catalyzed selective coupling reaction of hydrazones in the presence of t-BuOLi and benzoquinone to form the corresponding branched dienes. The utility of the Pd catalyst for the cross-coupling reactions for synthesizing branched conjugated dienes is rare. The reaction is very versatile and compatible with a variety of functional groups and is useful in synthesizing heterocyclic molecules. We anticipate that this Pd-catalyzed cross-coupling reaction will open new avenues for synthesizing useful compounds.