Soares, João, João M. Lourenço, and Nuno Preguiça. "
MacroDB: Scaling Database Engines on Multicores."
Euro-Par 2013 Parallel Processing. Eds. Felix Wolf, Bernd Mohr, and Dieter Mey. Vol. 8097. Lecture Notes in Computer Science, 8097. Springer Berlin Heidelberg, 2013. 607-619.
Abstract
Polcyn, M. J., LL Jacobs, O. Mateus, AS Schulp, C. Strganac, R. Araújo, JF Graf, D. Vineyard, and TS Myers A marine vertebrate assemblage from the Campanian-Maastrichtian boundary at Bentiaba, Angola. Geological Society of America Abstracts with Programs. Vol. 45, No. 7, p.0., 2013.
Sallem, Amin, Pedro Pereira, Mourad Fakhfakh, and Helena Fino. "
A Multi-objective Simulation Based Tool: Application to the Design of High Performance LC-VCOs."
Technological Innovation for the Internet of Things. Eds. LuisM. Camarinha-Matos, Slavisa Tomic, and Paula Graça. Vol. 394. IFIP Advances in Information and Communication Technology, 394. Portugal: Springer Berlin Heidelberg, 2013. 459-468.
AbstractThe continuing size reduction of electronic devices imposes design challenges to optimize the performances of modern electronic systems, such as: wireless services, telecom and mobile computing. Fortunately, those design challenges can be overcome thanks to the development of Electronic Design Automation (EDA) tools. In the analog, mixed signal and radio-frequency (AMS/RF) domains, circuit optimization tools have demonstrated their usefulness in addressing design problems taking into account downscaling technological aspects. Recent advances in EDA have shown that the simulation-based sizing technique is a very interesting solution to the ‘complex’ modelling task in the circuit design optimization problem. In this paper we propose a multi-objective simulation-based optimization tool. A CMOS LC-VCO circuit is presented to show the viability of this tool. The tool is used to generate the Pareto front linking two conflicting objectives, namely the VCO Phase Noise and Power Consumption. The accuracy of the results is checked against HSPICE/RF simulations.
Salminen, J., J. Dinis, and O. Mateus Preliminary magnetostratigraphy for Jurassic/Cretaceous transition in Porto da Calada, Portugal. In: Veikkolainen, T., Suhonen, K., Näränen, J., Kauristie, K., and Kaasalainen, S. (eds.). XXVI Geofysiikan päivät,. May 21-22 2013 in Helsinki, 2013.
Karlovich, Alexei Yu., and Ilya M. Spitkovsky. "
Pseudodifferential operators on variable Lebesgue spaces."
Operator Theory, Pseudo-Differential Equations, and Mathematical Physics. Operator Theory: Advances and Applications, 228. Eds. Yuri I. Karlovich, Luigi Rodino, Bernd Silbermann, and Ilya M. Spitkovsky. Basel: Birkhäuser, 2013. 173-183.
AbstractLet \(\mathcal{M}(\mathbb{R}^n)\) be the class of bounded away from one and infinity functions \(p:\mathbb{R}^n\to[1,\infty]\) such that the Hardy-Littlewood maximal operator is bounded on the variable Lebesgue space \(L^{p(\cdot)}(\mathbb{R}^n)\). We show that if \(a\) belongs to the Hörmander class \(S_{\rho,\delta}^{n(\rho-1)}\) with \(0<\rho\le 1\), \(0\le\delta<1\), then the pseudodifferential operator \(\operatorname{Op}(a)\) is bounded on the variable Lebesgue space \(L^{p(\cdot)}(\mathbb{R}^n)\) provided that \(p\in\mathcal{M}(\mathbb{R}^n)\). Let \(\mathcal{M}^*(\mathbb{R}^n)\) be the class of variable exponents \(p\in\mathcal{M}(\mathbb{R}^n)\) represented as \(1/p(x)=\theta/p_0+(1-\theta)/p_1(x)\) where \(p_0\in(1,\infty)\), \(\theta\in(0,1)\), and \(p_1\in\mathcal{M}(\mathbb{R}^n)\). We prove that if \(a\in S_{1,0}^0\) slowly oscillates at infinity in the first variable, then the condition \[ \lim_{R\to\infty}\inf_{|x|+|\xi|\ge R}|a(x,\xi)|>0 \] is sufficient for the Fredholmness of \(\operatorname{Op}(a)\) on \(L^{p(\cdot)}(\mathbb{R}^n)\) whenever \(p\in\mathcal{M}^*(\mathbb{R}^n)\). Both theorems generalize pioneering results by Rabinovich and Samko [RS08] obtained for globally log-Hölder continuous exponents \(p\), constituting a proper subset of \(\mathcal{M}^*(\mathbb{R}^n)\).
Cunha, Jácome, João Paulo Fernandes, Jorge Mendes, Rui Pereira, and João Saraiva. "
Querying Model-Driven Spreadsheets."
Proceedings of the 2013 IEEE Symposium on Visual Languages and Human-Centric Computing. VLHCC '13. Washington, DC, USA: IEEE Computer Society, 2013. 83-86.
AbstractSpreadsheets are being used with many different purposes that range from toy applications to complete information systems. In any of these cases, they are often used as data repositories that can grow significantly. As the amount of data grows, it also becomes more difficult to extract concrete information out of them. This paper focuses on the problem of spreadsheet querying. In particular, we propose an expressive and composable technique where intuitive queries can be defined. Our approach builds on a model-driven spreadsheet development environment, and queries are expressed referencing entities in the model of a spreadsheet instead of in its actual data. Finally, the system that we have implemented relies on Google's query function for spreadsheets.
Belo, Orlando, Jácome Cunha, João Paulo Fernandes, Jorge Mendes, Rui Pereira, and João Saraiva. "
QuerySheet: A Bidirectional Query Environment for Model-Driven Spreadsheets."
Proceedings of the 2013 IEEE Symposium on Visual Languages and Human-Centric Computing. VLHCC '13. Washington, DC, USA: IEEE Computer Society, 2013. 199-200.
AbstractThis paper presents a tool, named QUERYSHEET, to query spreadsheets. We defined a language to write the queries, which resembles SQL, the language to query databases. This allows to write queries which are more related to the spreadsheet content than with current approaches.
Liu, H., Â. Mestre, and Teresa Sousa. "
Rainbow vertex k-connection in graphs."
Discrete Applied Mathematics. 161.16-17 (2013): 2549-2555.
AbstractLet k be a positive integer and G be a k-connected graph. An edge-coloured path is rainbow if its edges have distinct colours. The rainbow k-connection number of G, denoted by rc_k(G), is the minimum number of colours required to colour the edges of G so that any two vertices of G are connected by k internally vertex-disjoint rainbow paths. The function rc_k(G) was first introduced by Chartrand, Johns, McKeon, and Zhang in 2009, and has since attracted considerable interest. In this paper, we consider a version of the function rc_k(G) which involves vertex-colourings. A vertex-coloured path is vertex-rainbow if its internal vertices have distinct colours. The rainbow vertex k-connection number of G, denoted by rvc_k(G), is the minimum number of colours required to colour the vertices of G so that any two vertices of G are connected by k internally vertex-disjoint vertex-rainbow paths. We shall study the function rvc_k(G) when G is a cycle, a wheel, and a complete multipartite graph. We also construct graphs G where rc_k(G) is much larger than rvc_k(G) and vice versa so that we cannot in general bound one of rc_k(G) and rvc_k(G) in terms of the other.
Silva, João A., Tiago M. Vale, João M. Lourenço, and Hervé Paulino. "
Replicação Parcial com Memória Transacional Distribuída."
Proceedings of INForum Simpósio de Informática. INForum 2013. Lisbon, Portugal: Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa, 2013. 310-321.
AbstractOs sistemas de memória transacional distribuída atuais recorrem essencialmente à distribuição ou à replicação total para distribuir os seus dados pelos múltiplos nós do sistema. No entanto, estas estratégias de replicação de dados apresentam limitações. A distribuição não oferece tolerância a falhas e a replicação total limita a capacidade de armazenamento do sistema. Nesse contexto, a replicação parcial de dados surge como uma solução intermédia, que combina o melhor das duas anteriores com o intuito de mitigar as suas desvantagens. Esta estratégia tem sido explorada no contexto das bases de dados distribuídas, mas tem sido pouco abordada no contexto da memória transacional e, tanto quanto sabemos, nunca antes tinha sido incorporada num sistema de memória transacional distribuída para uma linguagem de propósito geral. Assim, neste artigo propomos e avaliamos uma infraestrutura para replicação parcial de dados para programas Java bytecode, que foi desenvolvida com base num sistema já existente de memória transacional distribuída. A modularidade da infraestrutura que apresentamos permite a implementação de múltiplos algoritmos e, por conseguinte, avaliar em que contextos de utilização (workloads, número de nós, etc.) a replicação parcial se apresenta como uma alternativa viável a outras estratégias de replicação de dados.
Santos, Susana, Débora Azeitona, Nuno Lapa, João Morais, Helena Lopes, and Benilde Mendes Study on the effect of thermal pre-treatments in the thermophilic anaerobic digestion of a potato peel waste. Proceedings of the International Anaerobic Digestion Symposium within the BioGasWorld 2013. Berlin, Germany: German Society for Sustainable Biogas and Bioenergy Utilisation, 2013.
AbstractThis work aimed to study the effect of different pre-treatments applied to a potato peel residue, in a thermophilic Anaerobic Digestion (AD) process. All samples were subjected to a mechanical pre-treatment through milling to a particle size below 2 mm. The thermal pre-treatments applied consisted of autoclaving the residue at a gauge pressure of 1.2 bar, under a temperature of 122°C, and for 20, 35 and 55 minutes: assays E122.20, E122.35 and E122.55, respectively. The control assay was performed on a ground residue, which was not submitted to any thermal pre-treatment. All pre-treated residues were subjected to an AD process in a CSTR reactor at 49±1°C. The experimental data showed that the highest methane percentages were very similar (about 92% v/v) for all samples submitted to the thermal pre-treatments. For the control assay, the highest percentage of methane was 87.9% (v/v). The highest biogas yields were recorded in the trial E122.35 (646±50 cm3.g-1 CODremoved), against only 250±20 cm3.g-1 CODremoved for the control assay. The highest biogas yields for VSremoved were attained in the assays E122.55 and E122.35, with values of 646±48 cm3.g-1 VSremoved and 634±59 cm3.g-1 VSremoved, respectively. Globally, the yields registered for the assay E122.35 were similar to those determined in the assay E122.55. Due to the lower energy consumption during the pre-treatment performed in the assay E122.35, this was considered to be the most suitable pre-treatment for this type of residue.