In search of Lost Childhood

The article is located at the Daily Sun's editorial section's subsection "Post-Log."

Search Engine Optimization Methods & Search Engine Indexing for CMS Applications

Search engine optimization & marketing is a set of processes widely used on websites to improve search engine rankings which generate quality web traffic and increase ROI. Content is the most important part of any website. CMS web development is now become very essential for most of organizations and online businesses to develop their online system and websites. Every online business using a CMS wants to get users (customers) to make profit and ROI. This thesis comprises a brief study of existing SEO methods, tools and techniques and how they can be implemented to optimize a content base website. In results, the study provides recommendations about how to use SEO methods; tools and techniques to optimize CMS based websites on major search engines. This study compares popular CMS systems like Drupal, WordPress and Joomla SEO features and how implementing SEO can be improved on these CMS systems. Having knowledge of search engine indexing and search engine working is essential for a successful SEO campaign. This work is a complete guideline for web developers or SEO experts who want to optimize a CMS based website on all major search engines.

Mapping of summer crops in the State of Paran��, Brazil, through the 10-day spot vegetation NDVI composites

The search for low subjectivity area estimates has increased the use of remote sensing for agricultural monitoring and crop yield prediction, leading to more flexibility in data acquisition and lower costs comparing to traditional methods such as census and surveys. Low spatial resolution satellite images with higher frequency in image acquisition have shown to be adequate for cropland mapping and monitoring in large areas. The main goal of this study was to map the Summer crops in the State of Paran��, Brazil, using 10-day composition of NDVI SPOT Vegetation data for 2005/2006, 2006/2007 and 2007/2008 cropping seasons. For this, a supervised digital classification method with Parallelepiped algorithm in multitemporal RGB image composites was used, in order to generate masks of Summer cultures for each 10-day composition. Accuracy assessment was performed using Kappa index, overall accuracy and Willmott's concordance index, resulting in good levels of accuracy. This methodology allowed the accomplishment, with free and low resolution data, of the mapping of Summer cultures at State level.

Software for calculation of reservoir active capacity with the sequent-peak algorithm

It is presented a software developed with Delphi programming language to compute the reservoir's annual regulated active storage, based on the sequent-peak algorithm. Mathematical models used for that purpose generally require extended hydrological series. Usually, the analysis of those series is performed with spreadsheets or graphical representations. Based on that, it was developed a software for calculation of reservoir active capacity. An example calculation is shown by 30-years (from 1977 to 2009) monthly mean flow historical data, from Corrente River, located at S��o Francisco River Basin, Brazil. As an additional tool, an interface was developed to manage water resources, helping to manipulate data and to point out information that it would be of interest to the user. Moreover, with that interface irrigation districts where water consumption is higher can be analyzed as a function of specific seasonal water demands situations. From a practical application, it is possible to conclude that the program provides the calculation originally proposed. It was designed to keep information organized and retrievable at any time, and to show simulation on seasonal water demands throughout the year, contributing with the elements of study concerning reservoir projects. This program, with its functionality, is an important tool for decision making in the water resources management.

Generalized Differential Evolution for Global Multi-Objective Optimization with Constraints

The objective of this thesis work is to develop and study the Differential Evolution Algorithm for multi-objective optimization with constraints. Differential Evolution is an evolutionary algorithm that has gained in popularity because of its simplicity and good observed performance. Multi-objective evolutionary algorithms have become popular since they are able to produce a set of compromise solutions during the search process to approximate the Pareto-optimal front. The starting point for this thesis was an idea how Differential Evolution, with simple changes, could be extended for optimization with multiple constraints and objectives. This approach is implemented, experimentally studied, and further developed in the work. Development and study concentrates on the multi-objective optimization aspect. The main outcomes of the work are versions of a method called Generalized Differential Evolution. The versions aim to improve the performance of the method in multi-objective optimization. A diversity preservation technique that is effective and efficient compared to previous diversity preservation techniques is developed. The thesis also studies the influence of control parameters of Differential Evolution in multi-objective optimization. Proposals for initial control parameter value selection are given. Overall, the work contributes to the diversity preservation of solutions in multi-objective optimization.

Kahden merkkijonon pisimm��n yhteisen alijonon ongelma ja sen ratkaiseminen

T��m�� tutkielma kuuluu merkkijonoalgoritmiikan piiriin. Merkkijono S on merkkijonojen X[1..m] ja Y[1..n] yhteinen alijono, mik��li se voidaan muodostaa poistamalla X:st�� 0..m ja Y:st�� 0..n kappaletta merkkej�� mielivaltaisista paikoista. Jos yksik����n X:n ja Y:n yhteinen alijono ei ole S:���� pidempi, sanotaan, ett�� S on X:n ja Y:n pisin yhteinen alijono (lyh. PYA). T��ss�� ty��ss�� keskityt����n kahden merkkijonon PYAn ratkaisemiseen, mutta ongelma on yleistett��viss�� my��s useammalle jonolle. PYA-ongelmalle on sovelluskohteita ��� paitsi tietojenk��sittelytieteen niin my��s bioinformatiikan osa-alueilla. Tunnetuimpia niist�� ovat tekstin ja kuvien tiivist��minen, tiedostojen versionhallinta, hahmontunnistus sek�� DNA- ja proteiiniketjujen rakennetta vertaileva tutkimus. Ongelman ratkaisemisen tekee hankalaksi ratkaisualgoritmien riippuvuus sy��tejonojen useista eri parametreista. N��it�� ovat sy��tejonojen pituuden lis��ksi mm. sy��tt��aakkoston koko, sy��tteiden merkkijakauma, PYAn suhteellinen osuus lyhyemm��n sy��tejonon pituudesta ja t��sm����vien merkkiparien lukum����r��. T��ten on vaikeaa kehitt���� algoritmia, joka toimisi tehokkaasti kaikille ongelman esiintymille. Tutkielman on m����r�� toimia yht����lt�� k��sikirjana, jossa esitell����n ongelman perusk��sitteiden kuvauksen j��lkeen jo aikaisemmin kehitettyj�� tarkkoja PYAalgoritmeja. Niiden tarkastelu on ryhmitelty algoritmin toimintamallin mukaan joko rivi, korkeusk��yr�� tai diagonaali kerrallaan sek�� monisuuntaisesti prosessoiviin. Tarkkojen menetelmien lis��ksi esitell����n PYAn pituuden yl��- tai alarajan laskevia heuristisia menetelmi��, joiden laskemia tuloksia voidaan hy��dynt���� joko sellaisinaan tai ohjaamaan tarkan algoritmin suoritusta. T��m�� osuus perustuu tutkimusryhm��mme julkaisemiin artikkeleihin. Niiss�� k��sitell����n ensimm��ist�� kertaa heuristiikoilla tehostettuja tarkkoja menetelmi��. Toisaalta ty�� sis��lt���� laajahkon empiirisen tutkimusosuuden, jonka tavoitteena on ollut tehostaa olemassa olevien tarkkojen algoritmien ajoaikaa ja muistink��ytt����. Kyseiseen tavoitteeseen on pyritty ohjelmointiteknisesti esittelem��ll�� algoritmien toimintamallia hyvin tukevia tietorakenteita ja rajoittamalla algoritmien suorittamaa tuloksetonta laskentaa parantamalla niiden kyky�� havainnoida suorituksen aikana saavutettuja v��lituloksia ja hy��dynt���� niit��. Tutkielman johtop����t��ksin�� voidaan yleisesti todeta tarkkojen PYA-algoritmien heuristisen esiprosessoinnin l��hes systemaattisesti pienent��v��n niiden suoritusaikaa ja erityisesti muistintarvetta. Lis��ksi algoritmin k��ytt��m��ll�� tietorakenteella on ratkaiseva vaikutus laskennan tehokkuuteen: mit�� paikallisempia haku- ja p��ivitysoperaatiot ovat, sit�� tehokkaampaa algoritmin suorittama laskenta on.

Voimalaitoksen k��yt��naikaisen optimoinnin m����rittely

T��ss�� diplomity��ss�� m����ritell����n biopolttoainetta k��ytt��v��n voimalaitoksen k��yt��naikainen tuotannon optimointimenetelm��. M����rittelyty�� liittyy MW Powerin MultiPower CHP ���voimalaitoskonseptin jatkokehitysprojektiin. Erilaisten olemassa olevien optimointitapojen joukosta valitaan tarkoitukseen sopiva, laitosmalliin ja kustannusfunktioon perustuva menetelm��, jonka tulokset vied����n automaatioj��rjestelm����n PID-s����timien asetusarvojen muodossa. Prosessin mittaustulosten avulla lasketaan laitoksen energia- ja massataseet, joiden tuloksia k��ytet����n seuraavan optimointihetken l��ht��tietoina. Optimoinnin kohdefunktio on kustannusfunktio, jonka termit ovat voimalaitoksen k��yt��st�� aiheutuvia tuottoja ja kustannuksia. Prosessia optimoidaan s����timille annetut raja-arvot huomioiden niin, ett�� kokonaiskate maksimoituu. Kun laitokselle kertyy k��ytt��ik���� ja historiadataa, voidaan prosessin optimointia nopeuttaa hakemalla tilastollisesti historiadatasta nykytilanteen olosuhteita vastaava hetki. Kyseisen historian hetken katetta verrataan kustannusfunktion optimoinnista saatuun katteeseen. Paremman katteen antavan menetelm��n laskemat asetusarvot otetaan k��ytt����n prosessin ohjausta varten. Mik��li kustannusfunktion laskenta eik�� historiadatan perusteella tehty haku anna paranevaa katetta, niiden laskemia asetusarvoja ei oteta k��ytt����n. Sen sijaan optimia aletaan hakea deterministisell�� optimointialgoritmilla, joka hakee nykyhetken ymp��rist��st�� paremman katteen antavia s����timien asetusarvoja. S����t��j��rjestelm�� on mahdollista toteuttaa my��s tulevaisuutta ennustavana. Ty��n k��yt��nn��n osuudessa voimalaitosmalli luodaan kahden eri mallinnusohjelman avulla, joista toisella kuvataan kattilan ja toisella voimalaitosprosessin toimintaa. Mallinnuksen tuloksena saatuja prosessiarvoja hy��dynnet����n l��ht��tietoina k��ytt��katteen laskennassa. Kate lasketaan kustannusfunktion perusteella. Tuotoista suurimmat liittyv��t s��hk��n ja l��mm��n myyntiin sek�� tuotantotukeen, ja suurimmat kustannukset liittyv��t investoinnin takaisinmaksuun ja polttoaineen ostoon. Kustannusfunktiolle tehd����n herkkyystarkastelu, jossa seurataan katteen muutosta prosessin teknisi�� arvoja muutettaessa. Tuloksia vertaillaan referenssivoimalaitoksella suoritettujen verifiointimittausten tuloksiin, ja havaitaan, ett�� tulokset eiv��t ole t��ysin yhtenevi��. Erot johtuvat sek�� mallinnuksen puutteista ett�� mittausten lyhyehk��ist�� tarkasteluajoista. Automatisoidun optimointij��rjestelm��n k��yt��nn��n toteutusta alustetaan m����rittelem��ll�� k��ytt����n otettava optimointitapa, siihen liittyv��t s����t��piirit ja tarvittavat l��ht��tiedot. Projektia tullaan jatkamaan j��rjestelm��n ohjelmoinnilla, testauksella ja virityksell�� todellisessa voimalaitosymp��rist��ss�� ja my��hemmin ennustavan s����d��n toteuttamisella.

Optimization as a method of search engine marketing

This study is dedicated to search engine marketing (SEM). It aims for developing a business model of SEM firms and to provide explicit research of trustworthy practices of virtual marketing companies. Optimization is a general term that represents a variety of techniques and methods of the web pages promotion. The research addresses optimization as a business activity, and it explains its role for the online marketing. Additionally, it highlights issues of unethical techniques utilization by marketers which created relatively negative attitude to them on the Internet environment. Literature insight combines in the one place both technical and economical scientific findings in order to highlight technological and business attributes incorporated in SEM activities. Empirical data regarding search marketers was collected via e-mail questionnaires. 4 representatives of SEM companies were engaged in this study to accomplish the business model design. Additionally, the fifth respondent was a representative of the search engine portal, who provided insight on relations between search engines and marketers. Obtained information of the respondents was processed qualitatively. Movement of commercial organizations to the online market increases demand on promotional programs. SEM is the largest part of online marketing, and it is a prerogative of search engines portals. However, skilled users, or marketers, are able to implement long-term marketing programs by utilizing web page optimization techniques, key word consultancy or content optimization to increase web site visibility to search engines and, therefore, user���s attention to the customer pages. SEM firms are related to small knowledge-intensive businesses. On the basis of data analysis the business model was constructed. The SEM model includes generalized constructs, although they represent a wider amount of operational aspects. Constructing blocks of the model includes fundamental parts of SEM commercial activity: value creation, customer, infrastructure and financial segments. Also, approaches were provided on company���s differentiation and competitive advantages evaluation. It is assumed that search marketers should apply further attempts to differentiate own business out of the large number of similar service providing companies. Findings indicate that SEM companies are interested in the increasing their trustworthiness and the reputation building. Future of the search marketing is directly depending on search engines development.

Influence of Link Structure on Search Engine Result Pages of Online Nursery Shops

The primary objective of this thesis is to assess how the backlink portfolio structure and off site Search Engine Optimisation (SEO) elements influence ranking of UK based online nursery shops. The growth of the internet use demanded significant effort from companies to optimize and increase their online presence in order to cope with the increasing online competition. The new e-Commerce technology - called Search Engine Optimisation - has been developed that helped increase website visibility of companies. The SEO process involves on site elements (i.e. changing the parameters of the company's website such as keywords, title tags and meta descriptions) and off site elements (link building and social media marketing activity). Link Building is based on several steps of marketing planning including keyword research and competitor analysis. The underlying goal of keyword research is to understand the targeted market through identifying relevant keyword queries that are used by targeted costumer group. In the analysis, three types (geographic, field and company���s strategy related) and seven sources of keywords has been identified and used as a base of analysis. Following the determination of the most popular keywords, allinanchor and allintitle search has been conducted and the first ten results of the searches have been collected to identify the companies with the most significant web presence among the nursery shops. Finally, Link Profiling has been performed where the essential goal was to understand to what extent other companies' link structure is different that the base company's backlinks. Significant difference has been found that distinguished the top three companies ranking in the allinanchor and allintitle search. The top three companies, ���Mothercare���, ���Mamas and Papas��� and ���Kiddicare��� maintained significantly better metrics regarding domain and page authority on the main landing pages, the average number of outbound links for link portfolio metric and in number of backlinks. These companies also ranked among the highest in page authority distribution and followed external linking.

On Innovative Search: the use of internal and external sources of innovation among Finnish innovators

This dissertation explores the use of internal and external sources of knowledge in modern innovation processes. It builds on a framework that combines theories such as a behavioural theory of the firm, the evolutionary theory of economic change, and modern approaches to strategic management. It follows the recent increase in innovation research focusing on the firm-level examination of innovative activities instead of traditional industry-level determinants. The innovation process is seen as a problem- and slack- driven search process, which can take several directions in terms of organizational boundaries in the pursuit of new knowledge and other resources. It thus draws on recent models of technological change, according to which firms nowadays should build their innovative activities on both internal and external sources of innovation rather than relying solely on internal resources. Four different research questions are addressed, all of which are empirically investigated via a rich dataset covering Finnish innovators collected by Statistics Finland. Firstly, the study examines how the nature of problems shapes the direction of any search for new knowledge. In general it demonstrates that the nature of the problem does affect the direction of the search, although under resource constraints firms tend to use external rather than internal sources of knowledge. At the same time, it shows that those firms that are constrained in terms of finance seem to search both internally and externally. Secondly, the dissertation investigates the relationships between different kinds of internal and external sources of knowledge in an attempt to find out where firms should direct their search in order to exploit the potential of a distributed innovation process. The concept of complementarities is applied in this context. The third research question concerns how the use of external knowledge sources ��� openness to external knowledge ��� influences the financial performance of firms. Given the many advantages of openness presented in the current literature, the focus is on how it shapes profitability. The results reveal a curvilinear relationship between profitability and openness (taking an inverted U-shape), the implication being that it pays to be open up to a certain point, but being too open to external sources may be detrimental to financial performance. Finally, the dissertation addresses some challenges in CISbased innovation research that have received relatively little attention in prior studies. The general aim is to underline the fact that comprehensive understanding of the complex process of technological change requires the constant development of methodological approaches (in terms of data and measures, for example). All the empirical analyses included in the dissertation are based on the Finnish CIS (Finnish Innovation Survey 1998-2000).

A retrospective search for bovine respiratory syncytial virus (BRSV) antigens in histological specimens by immunofluorescence and immunohistochemistry

Bovine respiratory syncytial virus (BRSV) has been only sporadically identified as a causative agent of respiratory disease in Brazil. This contrasts with frequent reports of clinical and histopathological findings suggestive of BRSV-associated disease. In order to examine a possible involvement of BRSV in cases of calf pneumonia, a retrospective search was performed for BRSV antigens in histological specimens submitted to veterinary diagnostic services from the states of Rio Grande do Sul and Minas Gerais. Ten out of 41 cases examined (24.4%) were positive for BRSV antigens by immunohistochemistry (IPX). Eight of these cases (19.5%) were also positive by indirect immunofluorescence (IFA), and 31 cases (75.6%) were negative in both assays. In the lungs, BRSV antigens were predominantly observed in epithelial cells of bronchioles and less frequently found in alveoli. In one case, antigens were detected only in the epithelium of the alveolar septae. The presence of antigen-positive cells was largely restricted to epithelial cells of these airways. In two cases, positive staining was also observed in cells and cellular debris in the exudate within the pulmonary airways. The clinical cases positive for BRSV antigens were observed mainly in young animals (2 to 12 month-old) from dairy herds. The main microscopic changes included bronchointerstitial pneumonia characterized by thickening of alveolar septae adjacent to airways by mononuclear cell infiltrates, and the presence of alveolar syncytial giant cells. In summary, the results demonstrate the suitability of the immunodetection of viral antigens in routinely fixed tissue specimens as a diagnostic tool for BRSV infection. Moreover, the findings provide further evidence of the importance of BRSV as a respiratory pathogen of young cattle in southeastern and southern Brazil.

Search and Paper SKU Analysis of Recipes Meeting EUPS Standard

The theoretical research of the study concentrated on finding theoretical frameworks to optimize the amount of needed stock keeping units (SKUs) in manufacturing industry. The goal was to find ways for a company to acquire an optimal collection of stock keeping units needed for manufacturing needed amount of end products. The research follows constructive research approach leaning towards practical problem solving. In the empirical part of this study, a recipe search tool was developed to an existing database used in the target company. The purpose of the tools was to find all the recipes meeting the EUPS performance standard and put the recipes in a ranking order using the data available in the database. The ranking of the recipes was formed from the combination of the performance measures and price of the recipes. In addition, the tool researched what kind of paper SKUs were needed to manufacture the best performing recipes. The tool developed during this process meets the requirements. It eases and makes it much faster to search for all the recipes meeting the EUPS standard. Furthermore, many future development possibilities for the tool were discovered while writing the thesis.

Algorithm to determine the intersection curves between bezier surfaces by the solution of multivariable polynomial system and the differential marching method

The determination of the intersection curve between B��zier Surfaces may be seen as the composition of two separated problems: determining initial points and tracing the intersection curve from these points. The B��zier Surface is represented by a parametric function (polynomial with two variables) that maps a point in the tridimensional space from the bidimensional parametric space. In this article, it is proposed an algorithm to determine the initial points of the intersection curve of B��zier Surfaces, based on the solution of polynomial systems with the Projected Polyhedral Method, followed by a method for tracing the intersection curves (Marching Method with differential equations). In order to allow the use of the Projected Polyhedral Method, the equations of the system must be represented in terms of the Bernstein basis, and towards this goal it is proposed a robust and reliable algorithm to exactly transform a multivariable polynomial in terms of power basis to a polynomial written in terms of Bernstein basis .

Numerical Simulation of the Cavitation in the Hydrodynamic Lubrication of Journal Bearings: a Parallel Algorithm

In this paper we present an algorithm for the numerical simulation of the cavitation in the hydrodynamic lubrication of journal bearings. Despite the fact that this physical process is usually modelled as a free boundary problem, we adopted the equivalent variational inequality formulation. We propose a two-level iterative algorithm, where the outer iteration is associated to the penalty method, used to transform the variational inequality into a variational equation, and the inner iteration is associated to the conjugate gradient method, used to solve the linear system generated by applying the finite element method to the variational equation. This inner part was implemented using the element by element strategy, which is easily parallelized. We analyse the behavior of two physical parameters and discuss some numerical results. Also, we analyse some results related to the performance of a parallel implementation of the algorithm.

Methodology for wind turbine blade geometry optimization

Nowadays, the upwind three bladed horizontal axis wind turbine is the leading player on the market. It has been found to be the best industrial compromise in the range of different turbine constructions. The current wind industry innovation is conducted in the development of individual turbine components. The blade constitutes 20-25% of the overall turbine budget. Its optimal operation in particular local economic and wind conditions is worth investigating. The blade geometry, namely the chord, twist and airfoil type distributions along the span, responds to the output measures of the blade performance. Therefore, the optimal wind blade geometry can improve the overall turbine performance. The objectives of the dissertation are focused on the development of a methodology and specific tool for the investigation of possible existing wind blade geometry adjustments. The novelty of the methodology presented in the thesis is the multiobjective perspective on wind blade geometry optimization, particularly taking simultaneously into account the local wind conditions and the issue of aerodynamic noise emissions. The presented optimization objective approach has not been investigated previously for the implementation in wind blade design. The possibilities to use different theories for the analysis and search procedures are investigated and sufficient arguments derived for the usage of proposed theories. The tool is used for the test optimization of a particular wind turbine blade. The sensitivity analysis shows the dependence of the outputs on the provided inputs, as well as its relative and absolute divergences and instabilities. The pros and cons of the proposed technique are seen from the practical implementation, which is documented in the results, analysis and conclusion sections.