Asymmetric page split generalized index search trees for formal concept analysis

Formal Concept Analysis is an unsupervised machine learning technique that has successfully been applied to document organisation by considering documents as objects and keywords as attributes. The basic algorithms of Formal Concept Analysis then allow an intelligent information retrieval system to cluster documents according to keyword views. This paper investigates the scalability of this idea. In particular we present the results of applying spatial data structures to large datasets in formal concept analysis. Our experiments are motivated by the application of the Formal Concept Analysis idea of a virtual filesystem [11,17,15]. In particular the libferris [1] Semantic File System. This paper presents customizations to an RD-Tree Generalized Index Search Tree based index structure to better support the application of Formal Concept Analysis to large data sources.

Duck hepatitis B virus expresses a regulatory HBx-like protein from a hidden open reading frame

Duck hepatitis B viruses (DHBV), unlike mammalian hepadnaviruses, are thought to lack X genes, which encode transcription-regulatory proteins believed to contribute to the development of hepatocellular carcinoma. A lack of association of chronic DHBV infection with hepatocellular carcinoma development supports this belief. Here, we demonstrate that DHBV genomes have a hidden open reading frame from which a transcription-regulatory protein, designated DHBx, is expressed both in vitro and in vivo. We show that DHBx enhances neither viral protein expression, intracellular DNA synthesis, nor virion production when assayed in the full-length genome context in LMH cells. However, similar to mammalian hepadnavirus X proteins, DHBx activates cellular and viral promoters via the Raf-mitogen-activated protein kinase signaling pathway and localizes primarily in the cytoplasm. The functional similarities as,well as the weak sequence homologies of DHBx and the X proteins of mammalian hepadnaviruses strongly suggest a common ancestry of ortho- and avihepadnavirus X genes. In addition, our data disclose similar intracellular localization and transcription regulatory functions of the corresponding proteins, raise new questions as to their presumed role in hepatocarcinogenesis, and imply unique opportunities for deciphering of their still-enigmatic in vivo functions.

Portuguese newspapers’ front-page and the coverage of European Cultural Capital: Porto 2001 and Guimarães 2012

Portugal hosted in the last thirteen years, two editions of the event European Cultural Capital; this paper intends to illustrate the coverage that Portuguese newspapers (daily newspapers Público, Diário de Notícias, Correio da Manhã and Jornal de Notícias, a weekly newsmagazine Visão and a weekly newspaper Expresso) made, through referrals in front-page and respective developments within the editions, to each of the events and that allows us to define the main moments that marked each of them, patterns of action, the major players, planning and programming types. The European Cultural Capital project elects, from year to year, cities of different EU member states with the main goal of “contributing to bring together the Europe´s people" (words of Mélina Mercouri, Greek Minister of Culture who, in 1985, proposed the launch of this initiative) and encouraging the elected urban space to present new cultural paradigms. In the genesis of this model is the cultural decentralization’s vector, a possibility to medium-sized cities of funding public works, restoring heritage and promoting themselves in touristic terms, of giving visibility to cities away from cultural and creative industries’ major distribution centers. A crucial factor to achieve this goal is media coverage. This paper outline the information that the Portuguese press ran over the two years that elapsed the latest editions of the European Cultural Capital in Portugal, namely that media coverage have deviated from the disclosure of the events’ schedule to suggest itineraries of visit and little or not even question the role that cities, promoting such initiatives, have as places of innovation in terms of cultural policies, artistic production and innovation, in urban and environmental regeneration, in economic revitalization, in training and creating new artists and new audiences and in boosting the confidence of local communities. The content analysis performed to articles shows how press is essential to the promotion of cities as cultural/touristic destinations as it stimulates consumption among residents and attracts visitors, with the possible dire consequence of turning the cultural journalist into an agent of touristic instead of cultural promotion.

Improving quality-of-service in wireless sensor networks by mitigating “Hidden-Node Collisions”

Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquohidden node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the former, there will be a collision-called hidden-node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient hidden-node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots - over a WSN deployment.

H-NAMe: specifying, implementing and testing a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This technical report tackles the hidden-node problem in WSNs and proposes HNAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this technical report will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol.

Diversity in Teams: Source of Conflict or Source of Creativity? Investigating Hidden Mental Models

The workforce in organizations today is becoming increasingly diverse. Consequently the role of diversity management is heavily discussed with respect to the question how diversity influences the productivity of a group. Empirical studies show that on one hand there is a potential for increasing productivity but on the other hand it might be as well that conflicts arise due to the heterogeneity of the group. Usually according empirical studies are based on interviews, questionnaires and/or observations. These methods imply that answers are highly selective and filtered. In order to make the invisible visible, to have access to mental models of team members the paper will present an empirical study on the self-understanding of groups based on an innovative research method, called “mind-scripting”.

H-NAMe: a hidden-node avoidance mechanism for wireless sensor networks

The hidden-node problem has been shown to be a major source of Quality-of-Service (QoS) degradation in Wireless Sensor Networks (WSNs) due to factors such as the limited communication range of sensor nodes, link asymmetry and the characteristics of the physical environment. In wireless contention-based Medium Access Control protocols, if two nodes that are not visible to each other transmit to a third node that is visible to the formers, there will be a collision – usually called hidden-node or blind collision. This problem greatly affects network throughput, energy-efficiency and message transfer delays, which might be particularly dramatic in large-scale WSNs. This paper tackles the hiddennode problem in WSNs and proposes H-NAMe, a simple yet efficient distributed mechanism to overcome it. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes and then scales to multiple clusters via a cluster grouping strategy that guarantees no transmission interference between overlapping clusters. We also show that the H-NAMe mechanism can be easily applied to the IEEE 802.15.4/ZigBee protocols with only minor add-ons and ensuring backward compatibility with the standard specifications. We demonstrate the feasibility of H-NAMe via an experimental test-bed, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. We believe that the results in this paper will be quite useful in efficiently enabling IEEE 802.15.4/ZigBee as a WSN protocol

Collision-free prioritized medium access in the presence of hidden nodes without relying on out-of-band signaling

Consider the problem of sharing a wireless channel between a set of computer nodes. Hidden nodes exist and there is no base station. Each computer node hosts a set of sporadic message streams where a message stream releases messages with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements staticpriority scheduling. The MAC protocol allows multiple masters and is fully distributed. It neither relies on synchronized clocks nor out-of-band signaling; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel. Our protocol has the key feature of not only being prioritized and collision-free but also dealing successfully with hidden nodes. This key feature enables schedulability analysis of sporadic message streams in multihop networks.

Collision-free prioritized medium access control in wireless networks with hidden nodes

We propose a collision-free medium access control (MAC) protocol, which implements static-priority scheduling and works in the presence of hidden nodes. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to sense the channel while transmitting to the channel. Our protocol is collision-free even in the presence of hidden nodes and it achieves this without synchronized clocks or out-of-band busy tones. In addition, the protocol is designed to ensure that many non-interfering nodes can transmit in parallel and it functions for both broadcast and unicast transmissions.

Are there hidden scalars in LHC Higgs results?

The Higgs boson recently discovered at the Large Hadron Collider has shown to have couplings to the remaining particles well within what is predicted by the Standard Model. The search for other new heavy scalar states has so far revealed to be fruitless, imposing constraints on the existence of new scalar particles. However, it is still possible that any existing heavy scalars would preferentially decay to final states involving the light Higgs boson thus evading the current LHC bounds on heavy scalar states. Moreover, decays of the heavy scalars could increase the number of light Higgs bosons being produced. Since the number of light Higgs bosons decaying to Standard Model particles is within the predicted range, this could mean that part of the light Higgs bosons could have their origin in heavy scalar decays. This situation would occur if the light Higgs couplings to Standard Model particles were reduced by a concomitant amount. Using a very simple extension of the SM - the two-Higgs doublet model we show that in fact we could already be observing the effect of the heavy scalar states even if all results related to the Higgs are in excellent agreement with the Standard Model predictions.

Characteristics of IEF, SDS and SAR-PAGE of Cuba EPO biosimilar

EPO is a glycoprotein produced in the kidney, which stimulates the division and differentiation of red cells in the bone marrow. Erythropoietin is available as a therapeutic agent produced by recombinant DNA technology in mammalian cell culture into which the human EPO gene has been transfected. Biosimilar Epoetins are mostly erythropoietins of the Epoetin alfa, beta or omega type, which are being produced at much lower cost due to expired patents. Recombinant human erythropoietin (rh-EPO) contains the identical amino acid sequence of natural EPO: 165 amino acids, with a molecular weight of 30,400 Da. Since glycosylation is not only dependent on the cell-line used for the expression of Epoetins but also on the entire biotechnological process the glycosylation patterns of biosimilars do not necessarily reflect the patterns of the originator compounds. Today biosimilar Epoetins are manufactured and distributed worldwide and under many different names. The use of recombinant EPOs for doping is prohibited because of its performance enhancing effect. The aim of the present study was to investigated whether biosimilar alpha r-HuEPO – ior®-EPOCIM, produced in Cuba and also available in other countries in all continents, could be differentiated from endogenous one by iso-electro-focusing plus double blotting, SDS-PAGE and SAR-PAGE for antidoping analysis.

The hidden value behind capital structure decisions

A Work Project, presented as part of the requirements for the Award of a Masters Degree in Finance from the NOVA – School of Business and Economics

Predicting market direction with hidden Markov models

This paper develops the model of Bicego, Grosso, and Otranto (2008) and applies Hidden Markov Models to predict market direction. The paper draws an analogy between financial markets and speech recognition, seeking inspiration from the latter to solve common issues in quantitative investing. Whereas previous works focus mostly on very complex modifications of the original hidden markov model algorithm, the current paper provides an innovative methodology by drawing inspiration from thoroughly tested, yet simple, speech recognition methodologies. By grouping returns into sequences, Hidden Markov Models can then predict market direction the same way they are used to identify phonemes in speech recognition. The model proves highly successful in identifying market direction but fails to consistently identify whether a trend is in place. All in all, the current paper seeks to bridge the gap between speech recognition and quantitative finance and, even though the model is not fully successful, several refinements are suggested and the room for improvement is significant.