MixAR mobile prototype: visualizing virtually reconstructed ancient structures in situ

Archeology and related areas have a special interest on cultural heritage sites since they provide valuable information about past civilizations. However, the ancient buildings present in these sites are commonly found in an advanced state of degradation which difficult the professional/expert analysis. Virtual reconstructions of such buildings aim to provide a digital insight of how these historical places could have been in ancient times. Moreover, the visualization of such models has been explored by some Augmented Reality (AR) systems capable of providing support to experts. Their compelling and appealing environments have also been applied to promote the social and cultural participation of general public. The existing AR solutions regarding this thematic rarely explore the potential of realism, due to the following lacks: the exploration of mixed environments is usually only supported for indoors or outdoors, not both in the same system; the adaptation of the illumination conditions to the reconstructed structures is rarely addressed causing a decrease of credibility. MixAR [1] is a system concerned with those challenges, aiming to provide the visualization of virtual buildings augmented upon real ruins, allowing soft transitions among its interiors and exteriors and using relighting techniques for a faithful interior illumination, while the user freely moves in a given cultural heritage site, carrying a mobile unit. Regarding the focus of this paper, we intend to report the current state of MixAR mobile unit prototype, which allows visualizing virtual buildings – properly aligned with real-world structures – based on user's location, during outdoor navigation. In order to evaluate the prototype performance, a set of tests were made using virtual models with different complexities.

Task clustering on ETL systems – A pattern-oriented approach

Usually, data warehousing populating processes are data-oriented workflows composed by dozens of granular tasks that are responsible for the integration of data coming from different data sources. Specific subset of these tasks can be grouped on a collection together with their relationships in order to form higher- level constructs. Increasing task granularity allows for the generalization of processes, simplifying their views and providing methods to carry out expertise to new applications. Well-proven practices can be used to describe general solutions that use basic skeletons configured and instantiated according to a set of specific integration requirements. Patterns can be applied to ETL processes aiming to simplify not only a possible conceptual representation but also to reduce the gap that often exists between two design perspectives. In this paper, we demonstrate the feasibility and effectiveness of an ETL pattern-based approach using task clustering, analyzing a real world ETL scenario through the definitions of two commonly used clusters of tasks: a data lookup cluster and a data conciliation and integration cluster.

Distance perception in immersive environments: the role of photorealism

Immersive environments (IE) are being increasingly used in order to perform psychophysical experiments. The versatility in terms of stimuli presentation and control and the less time-consuming procedures are their greatest strengths. However, to ensure that IE results can be generalized to real world scenarios we must first provide evidence that performance in IE is quantitatively indistinguishable from performance in real-world. Our goal was to perceptually validate distance perception for CAVE-like IEs. Participants performed a Frontal Matching Distance Task (Durgin & Li, 2011) in three different conditions: real-world scenario (RWS); photorealistic IE (IEPH) and non-photorealistic IE (IENPH). Underestimation of distance was found across all the conditions, with a significant difference between the three conditions (Wilks’ Lambda = .38, F(2,134)= 110.8, p<.01, significant pairwise differences with p<.01). We found a mean error of 2.3 meters for the RWS, 5 meters for the IEPH, and of 6 meters for the IENPH in a pooled data set of 5 participants. Results indicate that while having a photorealistic IE with perspective and stereoscopic depth cues might not be enough to elicit a real-world performance in distance judgment tasks, nevertheless this type of environment minimizes the discrepancy between simulation and real-world when compared with non-photorealistic IEs.

In silico constraint-based strain optimization methods: the quest for optimal cell factories

Shifting from chemical to biotechnological processes is one of the cornerstones of 21st century industry. The production of a great range of chemicals via biotechnological means is a key challenge on the way toward a bio-based economy. However, this shift is occurring at a pace slower than initially expected. The development of efficient cell factories that allow for competitive production yields is of paramount importance for this leap to happen. Constraint-based models of metabolism, together with in silico strain design algorithms, promise to reveal insights into the best genetic design strategies, a step further toward achieving that goal. In this work, a thorough analysis of the main in silico constraint-based strain design strategies and algorithms is presented, their application in real-world case studies is analyzed, and a path for the future is discussed.

Extreme value Birnbaum-Saunders regression models applied to environmental data

Extreme value models are widely used in different areas. The Birnbaum–Saunders distribution is receiving considerable attention due to its physical arguments and its good properties. We propose a methodology based on extreme value Birnbaum–Saunders regression models, which includes model formulation, estimation, inference and checking. We further conduct a simulation study for evaluating its performance. A statistical analysis with real-world extreme value environmental data using the methodology is provided as illustration.

Solving large 0–1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm

The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.

Text mining na análise de sentimentos em contextos de big data

Dissertação de mestrado integrado em Engenharia e Gestão de Sistemas de Informação

Análise contrastiva entre preposições romenas e portuguesas através do uso de recursos bilingues

Dissertação de mestrado em Português Língua Não Materna (MPLNM) Português Língua Estrangeira (PLE) e Língua Segunda (PL2)

Performance of Surgical Risk Scores to Predict Mortality after Transcatheter Aortic Valve Implantation

AbstractBackground:Predicting mortality in patients undergoing transcatheter aortic valve implantation (TAVI) remains a challenge.Objectives:To evaluate the performance of 5 risk scores for cardiac surgery in predicting the 30-day mortality among patients of the Brazilian Registry of TAVI.Methods:The Brazilian Multicenter Registry prospectively enrolled 418 patients undergoing TAVI in 18 centers between 2008 and 2013. The 30-day mortality risk was calculated using the following surgical scores: the logistic EuroSCORE I (ESI), EuroSCORE II (ESII), Society of Thoracic Surgeons (STS) score, Ambler score (AS) and Guaragna score (GS). The performance of the risk scores was evaluated in terms of their calibration (Hosmer–Lemeshow test) and discrimination [area under the receiver–operating characteristic curve (AUC)].Results:The mean age was 81.5 ± 7.7 years. The CoreValve (Medtronic) was used in 86.1% of the cohort, and the transfemoral approach was used in 96.2%. The observed 30-day mortality was 9.1%. The 30-day mortality predicted by the scores was as follows: ESI, 20.2 ± 13.8%; ESII, 6.5 ± 13.8%; STS score, 14.7 ± 4.4%; AS, 7.0 ± 3.8%; GS, 17.3 ± 10.8%. Using AUC, none of the tested scores could accurately predict the 30-day mortality. AUC for the scores was as follows: 0.58 [95% confidence interval (CI): 0.49 to 0.68, p = 0.09] for ESI; 0.54 (95% CI: 0.44 to 0.64, p = 0.42) for ESII; 0.57 (95% CI: 0.47 to 0.67, p = 0.16) for AS; 0.48 (95% IC: 0.38 to 0.57, p = 0.68) for STS score; and 0.52 (95% CI: 0.42 to 0.62, p = 0.64) for GS. The Hosmer–Lemeshow test indicated acceptable calibration for all scores (p > 0.05).Conclusions:In this real world Brazilian registry, the surgical risk scores were inaccurate in predicting mortality after TAVI. Risk models specifically developed for TAVI are required.

Energy policies for rural electrification: a social multi-criteria evaluation approach

In this article, a real-world case- study is presented with two general objectives: to give a clear and simple illustrative example of application of social multi-criteria evaluation (SMCE) in the field of rural renewable energy policies, and to help in understanding to what extent and under which circumstances solar energy is suitable for electrifying isolated farmhouses. In this sense, this study might offer public decision- makers some insight on the conditions that favour the diffusion of renewable energy, in order to help them to design more effective energy policies for rural communities.

Quality control and conduct of genome-wide association meta-analyses.

Rigorous organization and quality control (QC) are necessary to facilitate successful genome-wide association meta-analyses (GWAMAs) of statistics aggregated across multiple genome-wide association studies. This protocol provides guidelines for (i) organizational aspects of GWAMAs, and for (ii) QC at the study file level, the meta-level across studies and the meta-analysis output level. Real-world examples highlight issues experienced and solutions developed by the GIANT Consortium that has conducted meta-analyses including data from 125 studies comprising more than 330,000 individuals. We provide a general protocol for conducting GWAMAs and carrying out QC to minimize errors and to guarantee maximum use of the data. We also include details for the use of a powerful and flexible software package called EasyQC. Precise timings will be greatly influenced by consortium size. For consortia of comparable size to the GIANT Consortium, this protocol takes a minimum of about 10 months to complete.

Extensió de l'entorn SMARD per permetre la depuració d'aplicacions basades en agents mòbils

Un dels principals obstacles per l’adopció dels agents mòbils, fins i tot per tasques per les quals s’ha demostrat la seva idoneïtat, és la dificultat de desenvolupar-los. Aquest projecte aporta solucions per ajudar en aquest procés. Més concretament, per provar agents i observar-ne el seu comportament en un entorn de simulació, abans d’executar-los en un escenari real. Hem afegit un depurador i un constructor d’agents mòbils a la interfície gràfica de disseny d’itineraris de l’entorn SMARD. Fent servir afegit aquests nous components, el programador pot dissenyar, construir i fer proves d’un agent mòbil des d’aquesta aplicació.

Creation of a carrier-grade telco based on a voice over IP backbone

En aquesta memòria l'autor, fent servir un enfoc modern, redissenya i implementa la plataforma que una empresa de telecomunicacions del segle 21 necessita per poder donar serveis de telefonia i comunicacions als seus usuaris i clients. Al llarg d'aquesta exposició es condueix al lector des d'una fase inicial de disseny fins a la implementació i posada en producció del sistema final desenvolupat, centrant-nos en solucionar les necessitats actuals que això implica. Aquesta memòria cubreix el software, hardware i els processos de negoci associats al repte de fer realitat aquest objectiu, i presenta al lector les múltiples tecnologies emprades per aconseguir-ho, fent emfàsi en la convergència actual de xarxes cap al concepte de xarxes IP i basant-se en aquesta tendència i utilitzant aquesta tecnologia de veu sobre IP per donar forma a la plataforma que finalment, de forma pràctica, es posa en producció.

Competing with Asking Prices

In many markets, sellers advertise their good with an asking price. This is a price at which the seller will take his good off the market and trade immediately, though it is understood that a buyer can submit an offer below the asking price and that this offer may be accepted if the seller receives no better offers. Despite their prevalence in a variety of real world markets, asking prices have received little attention in the academic literature. We construct an environment with a few simple, realistic ingredients and demonstrate that using an asking price is optimal: it is the pricing mechanism that maximizes sellers’ revenues and it implements the efficient outcome in equilibrium. We provide a complete characterization of this equilibrium and use it to explore the positive implications of this pricing mechanism for transaction prices and allocations.

Competing with Asking Prices

In many markets, sellers advertise their good with an asking price. This is a price at which the seller will take his good off the market and trade immediately, though it is understood that a buyer can submit an offer below the asking price and that this offer may be accepted if the seller receives no better offers. Despite their prevalence in a variety of real world markets, asking prices have received little attention in the academic literature. We construct an environment with a few simple, realistic ingredients and demonstrate that using an asking price is optimal: it is the pricing mechanism that maximizes sellers' revenues and it implements the efficient outcome in equilibrium. We provide a complete characterization of this equilibrium and use it to explore the implications of this pricing mechanism for transaction prices and allocations.