Data-driven estimation of flights’ hidden parameters

This paper presents a data-driven methodology for the estimation of flights’ hidden parameters, combining mechanistic and AI/ML models. In the context of this methodology the paper studies several AI/ML methods and reports on evaluation results for estimating hidden parameters, in terms of mean absolute error. In addition to the estimation of hidden parameters themselves, this paper examines how these estimations affect the prediction of KPIs regarding the efficiency of flights using a mechanistic model. Results show the accuracy of the proposed methods and the benefits of the proposed methodology. Indeed, the results show significant advances of data-driven methods to estimate hidden parameters towards predicting KPIs.This work has received funding from SESAR Joint Undertaking (JU) within SIMBAD project under grant agreement No 894241. The JU receives support from the European Union’s Horizon 2020 research and innovation programme and the SESAR JU members other than the UnionPeer ReviewedPostprint (author's final draft

Coupled Analysis of In Vitro and Histology Tissue Samples to Quantify Structure-Function Relationship

The structure/function relationship is fundamental to our understanding of biological systems at all levels, and drives most, if not all, techniques for detecting, diagnosing, and treating disease. However, at the tissue level of biological complexity we encounter a gap in the structure/function relationship: having accumulated an extraordinary amount of detailed information about biological tissues at the cellular and subcellular level, we cannot assemble it in a way that explains the correspondingly complex biological functions these structures perform. To help close this information gap we define here several quantitative temperospatial features that link tissue structure to its corresponding biological function. Both histological images of human tissue samples and fluorescence images of three-dimensional cultures of human cells are used to compare the accuracy of in vitro culture models with their corresponding human tissues. To the best of our knowledge, there is no prior work on a quantitative comparison of histology and in vitro samples. Features are calculated from graph theoretical representations of tissue structures and the data are analyzed in the form of matrices and higher-order tensors using matrix and tensor factorization methods, with a goal of differentiating between cancerous and healthy states of brain, breast, and bone tissues. We also show that our techniques can differentiate between the structural organization of native tissues and their corresponding in vitro engineered cell culture models

Revisiting Java Bytecode Compression for Embedded and Mobile Computing Environments

Abstract — Pattern-based Java bytecode compression techniques rely on the identification of identical instruction sequences that occur more than once. Each occurrence of such a sequence is substituted by a single instruction. The sequence defines a pattern that is used for extending the standard bytecode instruction set with the instruction that substitutes the pattern occurrences in the original bytecode. Alternatively, the pattern may be stored in a dictionary that serves for the bytecode decompression. In this case, the instruction that substitutes the pattern in the original bytecode serves as an index to the dictionary. In this paper, we investigate a bytecode compression technique that considers a more general case of patterns. Specifically, we employ the use of an advanced pattern discovery technique that allows locating patterns of an arbitrary length, which may contain a variable number of wildcards in place of certain instruction opcodes or operands. We evaluate the benefits and the limitations of this technique in various scenarios that aim at compressing the reference implementation of MIDP, a standard Java environment for the development of applications for mobile devices. Index Terms — D.3.2.j Java, I.4.2 Compression (Coding). I

Multiagent Reinforcement Learning Methods to Resolve Demand Capacity Balance Problems

Summarization: In this article, we explore the computation of joint policies for autonomous agents to resolve congestions problems in the air traffic management (ATM) domain. Agents, representing flights, have limited information about others’ payoffs and preferences, and need to coordinate to achieve their tasks while adhering to operational constraints. We formalize the problem as a multiagent Markov decision process (MDP) towards deciding flight delays to resolve demand and capacity balance (DCB) problems in ATM. To this end, we present multiagent reinforcement learning methods that allow agents to interact and form own policies in coordination with others. Experimental study on real-world cases, confirms the effectiveness of our approach in resolving the demand-capacity balance problem. Παρουσιάστηκε στο: 10th Hellenic Conference on Artificial Intelligenc

Multiagent reinforcement learning methods to resolve demand capacity balance problems

Summarization: In this article, we explore the computation of joint policies for autonomous agents to resolve congestions problems in the air traffic management (ATM) domain. Agents, representing flights, have limited information about others’ payoffs and preferences, and need to coordinate to achieve their tasks while adhering to operational constraints. We formalize the problem as a multiagent Markov decision process (MDP) towards deciding flight delays to resolve demand and capacity balance (DCB) problems in ATM. To this end, we present multiagent reinforcement learning methods that allow agents to interact and form own policies in coordination with others. Experimental study on real-world cases, confirms the effectiveness of our approach in resolving the demand-capacity balance problem.Παρουσιάστηκε στο: 10th Hellenic Conference on Artificial Intelligenc