A5100608390- Data Management and Algorithms
- Advanced Combinatorial Mathematics
- Vehicle Routing Optimization Methods
- graph theory and CDMA systems
- Multi-Criteria Decision Making
- Software-Defined Networks and 5G
- Transportation Planning and Optimization
- Coding theory and cryptography
- Optimization and Search Problems
- Fuel Cells and Related Materials
- Banking stability, regulation, efficiency
- Composite Material Mechanics
- Advanced MIMO Systems Optimization
- Advanced Optical Network Technologies
- Iterative Methods for Nonlinear Equations
- Topology Optimization in Engineering
- Elasticity and Material Modeling
- ECG Monitoring and Analysis
- Differential Equations and Numerical Methods
- semigroups and automata theory
- Railway Engineering and Dynamics
- Advanced Graph Theory Research
- HIV-related health complications and treatments
- Microbial Fuel Cells and Bioremediation
- Matrix Theory and Algorithms
University of Coimbra
2012-2024
University of Nebraska–Lincoln
2013-2020
AT&T (United States)
2009
The shortest path problem is a classical network that has been extensively studied. of determining not only the path, but also listing K paths (for given integer K>1) one studied so intensively, despite its obvious practical interest. Two different types problems are usually considered: unconstrained and constrained problem. While in former no restriction considered definition all have to satisfy some condition – for example, be loopless. In this paper new algorithms proposed uncontrained...
Eco-routing distributes traffic in cities to improve mobility sustainability. The implementation of eco-routing real-life requires a diverse set information, including different kinds sensors. These sensors are often already integrated city infrastructure, some technologically outdated, and operated by multiple entities. In this work, we provide use case-oriented system design for an service leveraging Internet-of-Things (IoT) technologies. methodology involves six phases: (1) defining case...
Abstract To keep up with the increasing number of connected devices in people’s daily lives, it is necessary to develop intelligent mechanisms that perform entire network management, interconnecting Wi-Fi, and emerging beyond Fifth-Generation (5G) communications. Hence, essential consider multiple usage scenarios, while managing end devices’ limitations. As a result, developing system allows operators link Wi-Fi services on their main networks becomes critical issue. These include new...
In this paper we present a variant of the Accelerated Overrelaxation iterative method (AOR), denoted by modified AOR-like (MAOR-like method) for solving augmented systems, i.e., with three real parameters $\omega$, $r$ and $\alpha$. For special values $\alpha$ get MSOR-like method, SOR-like method. An equation relating involved eigenvalues iteration matrix MAOR-like is obtained. Furthermore, some convergence conditions are derived. This generalizes main results Li, Nie, Evans 2004 Shao, Li...
In this paper, we present a comprehensive survey of currently available train approach detection methods and discuss some the more innovative techniques for addressing safety at highway-rail intersections (HRI) as well railway workers by providing sufficient early warning oncoming locomotives. A review various sensor technologies is provided, all which have been attempted in experimental settings academia transportation agencies. Our goal to highlight remaining research issues help foster...
The advances made in sustainable energy technology to power small Internet of Things (IoT) devices have raised the challenge how prolong neutral operation (ENO), which no node depletes its battery and all nodes prevent batteries from overcharging. Extending operational time IoT networks through environmental friendly sources (e.g., <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">solar, thermal, vibration</i> ) is first stage toward...
Abstract The multiobjective shortest path problem (MSPP) consists of finding the best nondominated linking two specified nodes in a network where k > 1 different criteria are considered for arc costs. Solving MSPP implies determining all paths; there may be many such paths, making selection process very hard task to accomplish. A traditional way dealing with difficulty is using utility function parameters aggregated weights. In this work, an alternative based on norm value associated each...
This paper presents a mixed-integer linear programming model for two-stage one-dimensional cutting stock problem that appears in the make-to-order steel industry. In this problem, ingots must be cut into intermediate pieces (billets) to heated furnace and then molded bar with section indicated production order. is obtain final bars desired lengths. The main objective reduce waste production. A heuristic approach proposed can easily implemented industry produces solutions an optimal gap less...
The continued growth and popularity of IoT-based wearables coupled with wireless body area sensor network (BASN) communication architectures continues to gain widespread adoption for e-Health applications. Challenges facing the this vision require e- Health wearable IoT/BASNs make effective use bandwidth, energy stores extended continuous transmission physiological data, mitigation computational burden when analyzing data in cloud at a global scale and, most importantly, ensuring features...
Personnel safety is a cornerstone of railroad operations. However, various activities such as track maintenance and repair require workers to be physically present on or near tracks that are potentially active. This creates significant risk the workers, especially at very high train speeds in places where geographical topography reduces direct line sight. In fact, fatalities injuries continue reported. A common approach lessen this problem employ specifically act lookouts — observe...
Let ${\mathcal W}_n$ denote any of the three families classical Weyl groups: symmetric groups S}_n$, hyperoctahedral (signed permutation groups) S}^B_n$, or even-signed S}^D_n$. In this paper we give an uniform construction a Hamilton cycle for restriction to involutions on these with respect inverse-closed connecting set involutions. This is optimal Hamming distance only group S}_n$. We also recall algorithm Gray code type $B$ A modification would provide Code $D$ two, which be optimal....
Abstract In this work we focus on the development of a numerical algorithm for inverse elastography problem. The goal is to perform an efficient material parameter identification knowing elastic displacement field induced by mechanical load. We propose define problem through quadratic optimization program which uses direct formulation objective function. way, end up with convex minimization attains its minimum at solution linear system. effectiveness our method illustrated numeral examples.
Abstract In this work we focus on the development of a numerical algorithm for inverse elastography problem. The goal is to perform an efficient material parameter identification knowing elastic displacement field induced by mechanical load. We propose define problem through quadratic optimization program which uses direct formulation objective function. way, end up with convex minimization attains its minimum at solution linear system. effectiveness our method illustrated numeral examples.