The bookman.

Title from caption.

The aldermen of the city of London temp. Henry III.-1908. With notes on the parliamentary representation of the city, the aldermen and the livery companies, the aldermanic veto, aldermanic baronets and knights, etc.,

Vol. II has title: The aldermen of the city of London temp. Henry III.-1912.

The Journal of mental science.

Title from caption.

Teaching design and emotion in the foundation year : an industrial design approach

This paper showcases two design tools; the ‘storyboard’ and ‘a day in the life’ demonstrated to design students in their foundational year (first year) of study. By employing these tools during the design process the aim was to provoke students to consider and design for emotional experiences for potential users. The assessment asked students to design an MP3 player using these tools. This is demonstrated through a student project that successfully used the tools and method introduced. The teaching theory, project context, student outcome as well as challenges faced by students using this approach are discussed. The paper concludes with implications for teaching emotion theory at an undergraduate level and potential future directions.

Advancing practice in critical care: A model of knowledge integration

Explore and describe a conceptual model of knowledge integration pertinent to the development of individual practitioners in critical care. Discussion of how multiple learning strategies that are embedded in practice can be beneficial in developing knowledge.

Flow during individual and co-operative gameplay

This study aims to further research in the field of video games by examining flow during individual and co-operative gameplay. Using a puzzle game called Droppit, we examined differences in flow based on two modes of play: single player vs. co-operative gameplay. Co-operative gameplay was found to induce greater flow in participants than single player gameplay. Additionally, co-operative gameplay participants had increased feelings of Challenge-Skill Balance, Unambiguous Feedback, Transformation of Time and Autotelic Experience. Our findings suggest that co-operative gameplay, involving puzzle-based problems, may result in increased flow during video game play.

Hintakartelli toistettuna pelinä: teoriasta pääkaupunkiseudun bensiinin vähittäismyyntimarkkinoille

Tutkielman tarkoituksena oli soveltaa toistetun pelin teoria- ja empiriapohjaa suomalaiseen tutkimusaineistoon. Kartellin toimintadynamiikka on mallinnettu peliteorian osa-alueen, toistetun pelin kentäksi. Toistetussa pelissä samaa, kerran pelattua peliä pelataan useita kierroksia. Äärettömästi toistetusta pelistä muodostuu toistetun pelin yleinen teoria (The Folk Theorem), jossa jokaisella pelaajalla on yksilöllisesti rationaalinen käytössykli. Toisen pelaajan kanssa tehty yhteistyö kasvattaa pelaajan käytössykliltä kertyvää kokonaishyötyä. Kartellitutkimuksessa ei voi ohittaa oikeustieteellistä näkökulmaa, joten sekin on tiivistetysti mukana esityksessä. Äänettömässä tai implisiittisessä kartellissa ( tacit collusion ) ei avoimen kartellin tavoin ole osapuolten välistä kommunikointia, mutta sen lopputulos on sama. Tästä syystä äänetön kartelli on yhdenmukaistettuna käytöksenä kielletty. Koska myös tunnusmerkit ovat osin samat, kartellitutkimus on saanut arvokasta mittausaineistoa paljastuneiden kartellien käytöksestä. Pelkkään hintatiedostoonkin perustuvalla tutkimuksella on vankka teoreettinen ja empiirinen pohja. Oikeuskirjallisuudessa ja käytännössä hintayhteneväisyyden on yhdessä muiden tunnusmerkkien kanssa katsottu olevan indisio kartellista. Bensiinin vähittäismyyntimarkkinat ovat rakenteellisesti otollinen kenttä toistetulle pelille. Tutkielman empiirisessä osuudessa kohteena olivat pääkaupunkiseudun bensiinin vähittäismyyntimarkkinat ja tiedosto sisälsi otoksia hinta-aikasarjoista ajalta 1.8.2004 - 30.6.2005 kaikkiaan 116:ltä jakeluasemalta Espoosta, Helsingistä ja Vantaalta. Tutkimusmenetelmänä oli toistettujen mittausten varianssianalyysi post hoc-vertailuin. Tilastollisesti merkitsevä hinnoitteluyhtenevyys lähellä sijaitsevien asemien kesken löytyi 47 asemalta, ja näin ollen näillä asemilla on yksi kartellin tunnusmerkeistä. Hinnoitteluyhtenevyyden omaavat asemat muodostivat liikenneyhteyksien mukaan jaetuilla kilpailualueillaan ryhmittymiä ja kaikkiaan tällaisia yhtenevästi hinnoittelevia ryhmittymiä oli 21. Näistä ryhmittymistä 9 oli ns. sekapareja eli osapuolina olivat kylmäasema ja liikenneasema. Useimmissa tapauksissa oli kyseessä alueensa kalleimmin hinnoitteleva kylmäasema. Tutkielman tärkeimmät lähteet: Abrantes-Metz, Rosa M. – Froeb, Luke M. – Geweke, John F. – Taylor, Cristopher T. (2005): A Variance screen for collusion. Working paper no. 275, Bureau of economics, Federal Trade Commission, Washington DC 20580. Dutta, Prajit K. (1999): Strategies and Games, Theory and Practice. The MIT Press, Cambridge, Massachusetts, London, England. Harrington, Joseph E. (2004): Detecting cartels. Working paper. John Hopkins University. Ivaldi, Marc – Jullien, Bruno – Rey, Patric – Seabright, Paul – Tirole, Jean (2003): The Economics of Tacit Collusion. EU:n komission kilpailun pääosaston julkaisu. Phlips, Louis (1996): On the detection of collusion and predation. European Economic Review 40 (1996), 495–510.

Barrier crossing by a flexible long chain molecule - The kink mechanism

The problem and related earlier work All the above problems involve the passage of a long chain molecule, through a region in space, where the free energy per segment is higher, thus effectively presenting a barrier for the motion of the molecule. This is what we refer to as the Kramers proble...

Siding wear of materials

We review here our understanding of the sliding wear phenomenon: some generalities have emerged in the last 50 years of research, these can now be taken as established principles and be used for practical design and maintenance. Other issues related for example to nano-wear, the role of microstructure on wear or mechanism of crack nucleation require renewed efforts, for greater predictivity in wear. The review is based on published literature with examples principally drawn from our work on sliding wear of metals and ceramics.

Probabilistic Prediction based Scheduling for Delay Sensitive Traffic in Internet of Things

This paper proposes a probabilistic prediction based approach for providing Quality of Service (QoS) to delay sensitive traffic for Internet of Things (IoT). A joint packet scheduling and dynamic bandwidth allocation scheme is proposed to provide service differentiation and preferential treatment to delay sensitive traffic. The scheduler focuses on reducing the waiting time of high priority delay sensitive services in the queue and simultaneously keeping the waiting time of other services within tolerable limits. The scheme uses the difference in probability of average queue length of high priority packets at previous cycle and current cycle to determine the probability of average weight required in the current cycle. This offers optimized bandwidth allocation to all the services by avoiding distribution of excess resources for high priority services and yet guaranteeing the services for it. The performance of the algorithm is investigated using MPEG-4 traffic traces under different system loading. The results show the improved performance with respect to waiting time for scheduling high priority packets and simultaneously keeping tolerable limits for waiting time and packet loss for other services. Crown Copyright (C) 2015 Published by Elsevier B.V.

Direct Link-Aware Relay Selection for Average Interference-Constrained Underlay Cognitive Radio

Cooperative relaying combined with selection exploits spatial diversity to significantly improve the performance of interference-constrained secondary users in an underlay cognitive radio network. We present a novel and optimal relay selection (RS) rule that minimizes the symbol error probability (SEP) of an average interference-constrained underlay secondary system that uses amplify-and-forward relays. A key point that the rule highlights for the first time is that, for the average interference constraint, the signal-to-interference-plus-noise-ratio (SINR) of the direct source-to-destination (SI)) link affects the choice of the optimal relay. Furthermore, as the SINR increases, the odds that no relay transmits increase. We also propose a simpler, more practical, and near-optimal variant of the optimal rule that requires just one bit of feedback about the state of the SD link to the relays. Compared to the SD-unaware ad hoc RS rules proposed in the literature, the proposed rules markedly reduce the SEP by up to two orders of magnitude.

Error Correcting Functional Source Coding with Decoder Side Information using Row-Latin Rectangles

The functional source coding problem in which the receiver side information (Has-set) and demands (Want-set) include functions of source messages is studied using row-Latin rectangle. The source transmits encoded messages, called the functional source code, in order to satisfy the receiver's demands. We obtain a minimum length using the row-Latin rectangle. Next, we consider the case of transmission errors and provide a necessary and sufficient condition that a functional source code must satisfy so that the receiver can correctly decode the values of the functions in its Want-set.

Distributed Nonparametric Sequential Spectrum Sensing under Electromagnetic Interference

We propose a distributed sequential algorithm for quick detection of spectral holes in a Cognitive Radio set up. Two or more local nodes make decisions and inform the fusion centre (FC) over a reporting Multiple Access Channel (MAC), which then makes the final decision. The local nodes use energy detection and the FC uses mean detection in the presence of fading, heavy-tailed electromagnetic interference (EMI) and outliers. The statistics of the primary signal, channel gain and the EMI is not known. Different nonparametric sequential algorithms are compared to choose appropriate algorithms to be used at the local nodes and the Fe. Modification of a recently developed random walk test is selected for the local nodes for energy detection as well as at the fusion centre for mean detection. We show via simulations and analysis that the nonparametric distributed algorithm developed performs well in the presence of fading, EMI and outliers. The algorithm is iterative in nature making the computation and storage requirements minimal.