2020
Authors
Cruz, R; Fontes, H; Ruela, J; Ricardo, M; Campos, R;
Publication
WNS3
Abstract
In wireless networking R&D we typically depend on simulation and experimentation to evaluate and validate new networking solutions. While simulations allow full control over the scenario conditions, real-world experiments are influenced by external random phenomena and may produce hardly repeatable and reproducible results, impacting the validation of the solution under evaluation. Previously, we have proposed the Trace-based Simulation (TS) approach to address the problem. TS uses traces of radio link quality and position of nodes to accurately reproduce past experiments in ns-3. Yet, in its current version, the TS approach is not compatible with scenarios where the radio spectrum is shared with concurrent networks, as it does not reproduce their channel occupancy. In this paper, we introduce the InterferencePropagationLossModel and a modified MacLow to allow reproducing the channel occupancy observed in past experiments using Wi-Fi. To validate the proposed models, the network throughput was measured in different experiments performed in the w-iLab.t testbed, controlling the channel occupancy introduced by concurrent networks. The experimental results were then compared with the network throughput achieved using the improved TS approach, the legacy TS approach, and pure simulation, validating the new proposed models and confirming their relevance to reproduce experiments previously executed in real environments.
2020
Authors
Cardoso, SM; Teixeira, AAC;
Publication
POVERTY & PUBLIC POLICY
Abstract
Scientific publications tend to influence policymakers significantly. Despite the scientific and social importance of poverty today, the attention the top economic journals (American Economic Review; Econometrica; International Economic Review; Journal of Economic Theory; Journal of Political Economy; Quarterly Journal of Economics; Review of Economic Studies) pay to the matter is not clear, particularly in the so-called "Blue Ribbon" journals (and Review of Economics and Statistics). On the basis of bibliometric techniques, we analyzed all 27,322 articles published in the "Blue Ribbon" journals from 1970 to 2018. This is the first study on the scientific attention paid to poverty by the most influential journals in the field of economics. Two main findings can be highlighted: (i) the scientific attention paid to poverty in the Blue Ribbon journals is relatively meager, but it has observed a positive trend, increasing from a modest 0.36 percent of the total articles published in the 1970s to 1.92 percent of total publications in the 2010s; and (ii) the relative weight of specific poverty subtopics has significantly changed over the last 50 years, shifting from a focus on defining and measuring poverty in the earlier decades to policy-related issues in the most recent period (2000 onward).
2020
Authors
de Matos, A; Leucker, M; Pereira, D; Pinto, JS;
Publication
2020 INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING (TASE 2020)
Abstract
This paper introduces a synthesis procedure for the satisfiability problem of RMTL-integral formulas as SAT solving modulo theories. RMTL-integral is a real-time version of metric temporal logic (MTL) extended by a duration quantifier allowing to measure time durations. For any given formula, a SAT instance modulo the theory of arrays, uninterpreted functions with equality and non-linear real-arithmetic is synthesized and may then be further investigated using appropriate SMT solvers. We show the benefits of using RMTL-integral with the given SMT encoding on a diversified set of examples that include in particular its application in the area of schedulability analysis. Therefore, we introduce a simple language for formalizing schedulability problems and show how to formulate timing constraints as RMTL-integral formulas. Our practical evaluation based on our synthesis and Z3 as back-end SMT solver also shows the feasibility of the overall approach.
2020
Authors
Viveiros, D; Vasconcelos, H; De Almeida, JMMM; Coelho, L; Amorim, VA; Maia, JM; Jorge, PAS; Marques, PVS;
Publication
Optics InfoBase Conference Papers
Abstract
Optical fiber Mach-Zehnder interferometers were fabricated by combining two TiO2 coated LPFGs fabricated through femtosecond laser direct writing. Results of its refractometric characterization are presented and compared with the single LPFGs sensors. Wavelength sensitivity of 1175 nm/RIU at 1.38 and spectral resolution of 2.2×10-5 were achieved. © 2021 The Author(s).
2020
Authors
Rafael, A; Santos, C; Duque, D; Fernandes, S; Sousa, A; Reis, LP;
Publication
FOURTH IBERIAN ROBOTICS CONFERENCE: ADVANCES IN ROBOTICS, ROBOT 2019, VOL 1
Abstract
In recent years robots have been used as a tool for teaching purposes, motivating the development of fully virtual environments for combined real/simulated robotics teaching. The AlphaBot2 Raspberry Pi (RPi), a robot used for education, has no currently available simulator. A Gazebo simulator was produced and a ROS framework was implemented for hardware abstraction and control of low-level modules facilitating students control of the robot's physical behaviours in the real and simulated robot, simultaneously. For the demonstration of the basic model operation, an algorithm for detection of obstacles and lines was implemented for the IR sensors, however, some discrepancies in a line track timed test were detected justifying the need for further work in modelling and performance assessment. Despite that, the implemented ROS structure was verified to be functional in the simulation and the real AlphaBot2 for its motion control, through the input sensors and camera.
2020
Authors
Hosseinian, S; Fontes, DBMM; Butenko, S;
Publication
INFORMS JOURNAL ON COMPUTING
Abstract
This paper explores the connections between the classical maximum clique problem and its edge-weighted generalization, the maximum edge weight clique (MEWC) problem. As a result, a new analytic upper bound on the clique number of a graph is obtained and an exact algorithm for solving the MEWC problem is developed. The bound on the clique number is derived using a Lagrangian relaxation of an integer (linear) programming formulation of the MEWC problem. Furthermore, coloring-based bounds on the clique number are used in a novel upper-bounding scheme for the MEWC problem. This scheme is employed within a combinatorial branch-and-bound framework, yielding an exact algorithm for the MEWC problem. Results of computational experiments demonstrate a superior performance of the proposed algorithm compared with existing approaches.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.