Kinship in entrepreneur networks: Performance effects of resource assembly in Africa

We examine the relationship between structural social capital, resource assembly, and firm performance of entrepreneurs in Africa. We posit that social capital primarily composed of kinship or family ties helps the entrepreneur to raise resources, but it does so at a cost. Using data drawn from small firms in Kampala, Uganda, we explore how shared identity among the entrepreneur's social network moderates this relationship. A large network contributed a higher quantity of resources raised, but at a higher cost when shared identity was high. We discuss the implications of these findings for the role of family ties and social capital in resource assembly, with an emphasis on developing economies.

Does Reasoning Enhance Learning?

Utilizing the well-known Ultimatum Game, this note presents the following phenomenon. If we start with simple stimulus-response agents, learning through naive reinforcement, and then grant them some introspective capabilities, we get outcomes that are not closer but farther away from the fully introspective game-theoretic approach. The cause of this is the following: there is an asymmetry in the information that agents can deduce from their experience, and this leads to a bias in their learning process.

Does eeasoning enhance learning?

Utilizing the well-known Ultimatum Game, this note presents the following phenomenon. If we start with simple stimulus-response agents,learning through naive reinforcement, and then grant them some introspective capabilities, we get outcomes that are not closer but farther away from the fully introspective game-theoretic approach. The cause of this is the following: there is an asymmetry in the information that agents can deduce from their experience, and this leads to a bias in their learning process.

Are agent-based simulations robust? The wholesale electricity trading case

Agent-based computational economics is becoming widely used in practice. This paperexplores the consistency of some of its standard techniques. We focus in particular on prevailingwholesale electricity trading simulation methods. We include different supply and demandrepresentations and propose the Experience-Weighted Attractions method to include severalbehavioural algorithms. We compare the results across assumptions and to economic theorypredictions. The match is good under best-response and reinforcement learning but not underfictitious play. The simulations perform well under flat and upward-slopping supply bidding,and also for plausible demand elasticity assumptions. Learning is influenced by the number ofbids per plant and the initial conditions. The overall conclusion is that agent-based simulationassumptions are far from innocuous. We link their performance to underlying features, andidentify those that are better suited to model wholesale electricity markets.

Towards secure mobile P2P applications using JXME

Mobile devices have become ubiquitous, allowing the integration of new information from a large range of devices. However, the development of new applications requires a powerful framework which simplifies their construction. JXME is the JXTA implementation for mobile devices using J2ME, its main value being its simplicity when creating peer-to-peer (P2P) applications on limited devices. On that regard, an issue that is becoming veryimportant in the recent times is being able to provide a security baseline to such applications. This paper analyzes the currentstate of security in JXME and proposes a simple security mechanism in order to protect JXME applications against a broad range of vulnerabilities.

Hallintasovellus M2M-tiedonsiirtoon GPRS-verkossa

Pääosa matkapuhelinjärjestelmien liikenteestä on toistaiseksi puhetta. Dataliikenteen osuus on kuitenkin jatkuvasti kasvamassa uusien tekniikoiden myötävaikutuksella. Langattoman dataliikenteen kehittämiselle tuo myös lisäpainetta internetin nopeasti yleistynyt käyttö. Eräs lupaavimmista sovellusalueista on konekommunikaatio, M2M, minkä läpilyöntiä on ennustettu jo vuosia. Viime vuosina markkinoille tulleet M2M-laitteet tarjoavat aiemmista laitteista poiketen myös mahdollisuuden sovellusten suorittamiseen itse laitteessa ja niiden päivittämisen langattomasti. Työssä vertaillaan kolmea markkinoilla olevaa konekommunikaatioon soveltuvaa laitetta ja tarkastellaan niiden ominaisuuksia ja sovellusten päivitettävyyttä GPRS-verkkoa käyttäen. Tarkastelussa havaitaan, että teleoperaattoreiden asettamat rajoitukset ja käytössä olevat päivitysmenetelmät aiheuttavat tiettyjä ongelmia päivitysten käytettävyydelle. Työn tuloksena kehitettiin hallintasovellusohjelmisto, mikä mahdollisti etäällä sijaitsevien M2M-laitteiden sovellusten päivittämisen helppokäyttöisen käyttöliittymän avulla. Hallintasovellusta käyttäen useita, maantieteellisesti hajallaan olevia laitteita oli mahdollista päivittää samanaikaisesti automatisoidusti. Hallintasovellus osoittautui käyttökelpoiseksi työkaluksi M2Mlaitteiden sovellusten hallintaan jo, kun laitemäärä kasvoi muutamista kappaleista muutamaan kymmeneen.

Trophic resource partitioning and competition between the two sibling bat species Myotis myotis and Myotis blythii

1. Niche theory predicts that the stable coexistence of species within a guild should be associated, if resources are limited, with a mechanism of resource partitioning. Using extensive data on diets, the present study attempts: (i) to test the hypothesis that, in sympatry, the interspecific overlap between the trophic niches of the sibling bat species Myotis myotis and M. blythii-which coexist intimately in their roosts-is effectively lower than the two intraspecific overlaps; (ii) to assess the role played by interspecific competition in resource partitioning through the study of trophic niche displacement between several sympatric and allopatric populations. 2. Diets were determined by the analysis of faecal samples collected in the field from individual bats captured in various geographical areas. Trophic niche overlaps were calculated monthly for all possible intraspecific and interspecific pairs of individuals from sympatric populations. Niche breadth was estimated from: (i) every faecal sample; (ii) all the faecal samples collected per month in a given population (geographical area). 3. In every population, the bulk of the diets of M. myotis and M. blythii consisted of, respectively, terrestrial (e.g. carabid beetles) and grass-dwelling (mostly bush crickets) prey. All intraspecific trophic niche overlaps were significantly greater than the interspecific one, except in Switzerland in May when both species exploited mass concentrations of cockchafers, a non-limiting food source. This clearcut partitioning of resources may allow the stable, intimate coexistence observed under sympatric conditions. 4. Relative proportions of ground-and grass-dwelling prey, as well as niche breadths (either individual or population), did not differ significantly between sympatry and allopatry, showing that, under allopatric conditions, niche expansion does not take place. This suggests that active interspecific competition is not the underlying mechanism responsible for the niche partitioning which is currently observed between M. myotis and M. blythii.

Suunnitelma lähiverkon toteuttamiseksi oppilaitoksessa

Lähiverkkojen tehtävänä on toimia alustana useille eri tekniikoille ja palveluille. Verkossa liikkuu dataliikenteen lisäksi myös puhetta ja kuvaa. Lähiverkko mahdollistaa oheislaitteiden, kuten tiedostopalvelimien ja tulostimien, jakamisen ja käyttämisen koko lähiverkon alueelta. Organisaation lähiverkkoja voidaan yhdistää teleoperaattoreiden toimesta joten on vaikeaa enää määritellä lähiverkkoa tarkasti. Työssä on käyty läpi Ethernet-tekniikan peruselementit ja verkkotopologiat. Selvitystyö kattaa koko Ethernetin kehityshistorian jaetun media väylästä nykyaikaiseen täysin kytkentäiseen Ethernettiin asti sekä sen eri kaapelointimahdollisuudet. Verkoissa liikennöintiin ja valvontaan tarvittavien protokollien ja palveluiden toiminta on esitelty, samoin kuin tyypillisempien verkon aktiivilaitteiden toiminta. Verkon nykytilan kartoituksen kautta lopputuloksena esitetään uuden verkon fyysinen rakenne sekä verkon toiminnan kannalta keskeisimmät palvelut. Verkon fyysinen rakenne perustuu yleiskaapelointistandardiin EN 50173-1. Verkossa tapahtuvan ja verkkoon kohdistuvan opetuksen erityispiirteistä ja ongelmista esitetään ratkaisut niin teknisistä kuin tietoturvallisuuden näkökohdista . Kustannusarviossa keskitytään verkon komponenttien hintoihin ja tehdään vertailu kahden eri kytkimen hinnoista ja ominaisuuksista. Johtopäätöksissä pohditaan verkonsuunnittelun uusia suuntia SAN-verkkojen näkökulmasta.

Giant monopole energies from a constrained relativistic mean-field approach

Background:Average energies of nuclear collective modes may be efficiently and accurately computed using a nonrelativistic constrained approach without reliance on a random phase approximation (RPA). Purpose: To extend the constrained approach to the relativistic domain and to establish its impact on the calibration of energy density functionals. Methods: Relativistic RPA calculations of the giant monopole resonance (GMR) are compared against the predictions of the corresponding constrained approach using two accurately calibrated energy density functionals. Results: We find excellent agreement at the 2% level or better between the predictions of the relativistic RPA and the corresponding constrained approach for magic (or semimagic) nuclei ranging from 16 O to 208 Pb. Conclusions: An efficient and accurate method is proposed for incorporating nuclear collective excitations into the calibration of future energy density functionals.

Platform Architectures for Policy-Based Network Access Control

Tämä diplomityö käsittelee sääntöpohjaisen verkkoon pääsyn hallinnan (NAC) ratkaisuja arkkitehtonisesta näkökulmasta. Työssä käydään läpi Trusted Computing Groupin, Microsoft Corporationin, Juniper Networksin sekä Cisco Systemsin NAC-ratkaisuja. NAC koostuu joukosta uusia sekä jo olemassa olevia teknologioita, jotka auttavat ennalta määriteltyyn sääntökantaan perustuen hallitsemaan suojattuun verkkoon pyrkivien laitteiden tietoliikenneyhteyksiä. Käyttäjän tunnistamisen lisäksi NAC pystyy rajoittamaan verkkoon pääsyä laitekohtaisten ominaisuuksien perusteella, esimerkiksi virustunnisteisiin ja käyttöjärjestelmäpäivityksiin liittyen ja paikkaamaan tietyin rajoituksin näissä esiintyviä puutteita verkkoon pääsyn sallimiseksi. NAC on verraten uusi käsite, jolta puuttuu tarkka määritelmä. Tästä johtuen nykymarkkinoilla myydään ominaisuuksiltaan puutteellisia tuotteita NAC-nimikkeellä. Standardointi eri valmistajien NAC-komponenttien yhteentoimivuuden takaamiseksi on meneillään, minkä perusteella ratkaisut voidaan jakaa joko avoimia standardeja tai valmistajakohtaisia standardeja noudattaviksi. Esitellyt NAC-ratkaisut noudattavat standardeja joko rajoitetusti tai eivät lainkaan. Mikään läpikäydyistä ratkaisuista ei ole täydellinen NAC, mutta Juniper Networksin ratkaisu nousee niistä potentiaalisimmaksi jatkokehityksen ja -tutkimuksen kohteeksi TietoEnator Processing & Networks Oy:lle. Eräs keskeinen ongelma NAC-konseptissa on työaseman tietoverkolle toimittama mahdollisesti valheellinen tietoturvatarkistuksen tulos, minkä perusteella pääsyä osittain hallitaan. Muun muassa tähän ongelmaan ratkaisuna voisi olla jo nykytietokoneista löytyvä TPM-siru, mikä takaa tiedon oikeellisuuden ja koskemattomuuden.

Vaahdonestokemikaalin syöttötapahtuman tehostamisen vaikutus märkäosan toimintaan

An improved defoamer dosage procedure and a more efficient dosing point to the approach system were studied in this thesis. Their influence on paper machine wet end operations was investigated. The improved defoamer dosing procedure was examined at UMP-Kymmene Tervasaari PM8. Air content and its controlling methods at the paper machine were studied in the literature survey. Also the influence of dissolved gases and entrained air in the papermaking furnish were introduced. Feeding methods – a TrumpJet chemical mixer and traditional feeding devices – were reviewed. The defoamer’s functioning methods were studied. The influence of the use of defoamers was estimated based on the main selected wet end operations. In the experimental part, defoamer mixing with a traditional feeding method and two improved mixing stages were compared based on the air content profiles in PM8’s approach system. The reference dosage procedure was PM8’s old dosing system. The first dosage procedure in the comparison involved two TrumpJet chemical mixers installed on the bottom wire trays. The second element of comparison involved the improvement brought by a third TrumpJet chemical mixer installed on the top wire tray. This second comparison of the efficient defoamer feeding concept was made at a higher production speed of PM8. The air content control situation was also studied at the higher production speed. In addition the connection between the defoamer and air content was observed and a mill-scale system was studied. The economical benefits of the new dosing procedure were also reviewed. Air content profiles of short circulation were measured in the reference situation and the two comparison points of the study. These air content measurements proved the main gas load is introduced to PM8's paper furnish from the white water tray. Thick stock air content was not essential when the air volume flow was considered. The improved defoamer dosing procedure made lower dosage amounts possible. Compared with the traditional feeding system, the new defoamer feeding concept made only few direct improvements to the wet end operations and the produced paper itself. The lower defoamer need was noticed to have a positive influence on hydrophobic sizing and paper defects. The surfaces of the white water tanks and the operation of pumps were assessed based on the density variations of the suspension. The temperature in the white water silo was stated to have a significant influence on the air content measured in the first centrifugal cleaning stage.

Reward networks in the brain as captured by connectivity measures

An assortment of human behaviors is thought to be driven by rewards including reinforcement learning, novelty processing, learning, decision making, economic choice, incentive motivation, and addiction. In each case the ventral tegmental area/ventral striatum (nucleus accumbens) (VTAVS) system has been implicated as a key structure by functional imaging studies, mostly on the basis of standard, univariate analyses. Here we propose that standard functional magnetic resonance imaging analysis needs to be complemented by methods that take into account the differential connectivity of the VTAVS system in the different behavioral contexts in order to describe reward based processes more appropriately. We fi rst consider the wider network for reward processing as it emerged from animal experimentation. Subsequently, an example for a method to assess functional connectivity is given. Finally, we illustrate the usefulness of such analyses by examples regarding reward valuation, reward expectation and the role of reward in addiction.

Avaliação de dispositivos de captura de imagens digitais para detecção colorimétrica em microzonas impressas

This report describes a study about the feasibility of using a conventional digital camera, a cell-phone camera, an optical microscope, and a scanner as digital image capture devices on printed microzones. An array containing nine circular zones was drawn using graphics software and printed onto transparency film by a laser printer. Due to its superior analytical performance, the scanner was chosen for the quantitative determination of Fe2+ in pharmaceutical samples. The data achieved using scanned images did not differ statistically from those attained by the reference spectrophotometric method at the confidence level of 0.05.

IDEAS for Strategic Technology Management: Design of an electronically mediated scenario method

The age-old adage goes that nothing in this world lasts but change, and this generation has indeed seen changes that are unprecedented. Business managers do not have the luxury of going with the flow: they have to plan ahead, to think strategies that will meet the changing conditions, however stormy the weather seems to be. This demand raises the question of whether there is something a manager or planner can do to circumvent the eye of the storm in the future? Intuitively, one can either run on the risk of something happening without preparing, or one can try to prepare oneself. Preparing by planning for each eventuality and contingency would be impractical and prohibitively expensive, so one needs to develop foreknowledge, or foresight past the horizon of the present and the immediate future. The research mission in this study is to support strategic technology management by designing an effective and efficient scenario method to induce foresight to practicing managers. The design science framework guides this study in developing and evaluating the IDEAS method. The IDEAS method is an electronically mediated scenario method that is specifically designed to be an effective and accessible. The design is based on the state-of-the-art in scenario planning, and the product is a technology-based artifact to solve the foresight problem. This study demonstrates the utility, quality and efficacy of the artifact through a multi-method empirical evaluation study, first by experimental testing and secondly through two case studies. The construction of the artifact is rigorously documented as justification knowledge as well as the principles of form and function on the general level, and later through the description and evaluation of instantiations. This design contributes both to practice and foundation of the design. The IDEAS method contributes to the state-of-the-art in scenario planning by offering a light-weight and intuitive scenario method for resource constrained applications. Additionally, the study contributes to the foundations and methods of design by forging a clear design science framework which is followed rigorously. To summarize, the IDEAS method is offered for strategic technology management, with a confident belief that it will enable gaining foresight and aid the users to choose trajectories past the gales of creative destruction and off to a brighter future.

Algorithmic Solutions for Combinatorial Problems in Resource Management of Manufacturing Environments

This thesis studies the use of heuristic algorithms in a number of combinatorial problems that occur in various resource constrained environments. Such problems occur, for example, in manufacturing, where a restricted number of resources (tools, machines, feeder slots) are needed to perform some operations. Many of these problems turn out to be computationally intractable, and heuristic algorithms are used to provide efficient, yet sub-optimal solutions. The main goal of the present study is to build upon existing methods to create new heuristics that provide improved solutions for some of these problems. All of these problems occur in practice, and one of the motivations of our study was the request for improvements from industrial sources. We approach three different resource constrained problems. The first is the tool switching and loading problem, and occurs especially in the assembly of printed circuit boards. This problem has to be solved when an efficient, yet small primary storage is used to access resources (tools) from a less efficient (but unlimited) secondary storage area. We study various forms of the problem and provide improved heuristics for its solution. Second, the nozzle assignment problem is concerned with selecting a suitable set of vacuum nozzles for the arms of a robotic assembly machine. It turns out that this is a specialized formulation of the MINMAX resource allocation formulation of the apportionment problem and it can be solved efficiently and optimally. We construct an exact algorithm specialized for the nozzle selection and provide a proof of its optimality. Third, the problem of feeder assignment and component tape construction occurs when electronic components are inserted and certain component types cause tape movement delays that can significantly impact the efficiency of printed circuit board assembly. Here, careful selection of component slots in the feeder improves the tape movement speed. We provide a formal proof that this problem is of the same complexity as the turnpike problem (a well studied geometric optimization problem), and provide a heuristic algorithm for this problem.