Search results for "Python"
showing 10 items of 160 documents
Clustering-Based Protocol Classification via Dimensionality Reduction
2015
We propose a unique framework that is based upon diffusion processes and other methodologies for finding meaningful geometric descriptions in high-dimensional datasets. We will show that the eigenfunctions of the generated underlying Markov matrices can be used to construct diffusion processes that generate efficient representations of complex geometric structures for high-dimensional data analysis. This is done by non-linear transformations that identify geometric patterns in these huge datasets that find the connections among them while projecting them onto low dimensional spaces. Our methods automatically classify and recognize network protocols. The main core of the proposed methodology…
Identification of Risk Factors Associated with Obesity and Overweight-A Machine Learning Overview.
2020
Social determining factors such as the adverse influence of globalization, supermarket growth, fast unplanned urbanization, sedentary lifestyle, economy, and social position slowly develop behavioral risk factors in humans. Behavioral risk factors such as unhealthy habits, improper diet, and physical inactivity lead to physiological risks, and &ldquo
Collective Behavior of Price Changes of ERC-20 Tokens
2020
We analyze a network constructed from tokens developed on Ethereum platform. We collect a large data set of ERC-20 token prices; the total market capitalization of the token set is 50.2 billion (109) US dollars. The token set includes 541 tokens; each one of them has a market capitalization of 1 million US dollars or more. We construct and analyze the networks based on cross-correlation of tokens’ returns. We find that the degree distributions of the resulting graphs do not follow the power law degree distribution. We cannot find any hierarchical structures nor groupings of ERC-20 tokens in our analysis. peerReviewed
A Monge-Kantorovich mass transport problem for a discrete distance
2011
This paper is concerned with a Monge-Kantorovich mass transport problem in which in the transport cost we replace the Euclidean distance with a discrete distance. We fix the length of a step and the distance that measures the cost of the transport depends of the number of steps that is needed to transport the involved mass from its origin to its destination. For this problem we construct special Kantorovich potentials, and optimal transport plans via a nonlocal version of the PDE formulation given by Evans and Gangbo for the classical case with the Euclidean distance. We also study how these problems, when rescaling the step distance, approximate the classical problem. In particular we obta…
Iterative Reconstruction of Memory Kernels.
2017
In recent years, it has become increasingly popular to construct coarse-grained models with non-Markovian dynamics to account for an incomplete separation of time scales. One challenge of a systematic coarse-graining procedure is the extraction of the dynamical properties, namely, the memory kernel, from equilibrium all-atom simulations. In this article, we propose an iterative method for memory reconstruction from dynamical correlation functions. Compared to previously proposed noniterative techniques, it ensures by construction that the target correlation functions of the original fine-grained systems are reproduced accurately by the coarse-grained system, regardless of time step and disc…
A Proximal Solution for a Class of Extended Minimax Location Problem
2005
We propose a proximal approach for solving a wide class of minimax location problems which in particular contains the round trip location problem. We show that a suitable reformulation of the problem allows to construct a Fenchel duality scheme the primal-dual optimality conditions of which can be solved by a proximal algorithm. This approach permits to solve problems for which distances are measured by mixed norms or gauges and to handle a large variety of convex constraints. Several numerical results are presented.
An open-source GA framework for optimizing the seismic upgrading design of RC frames through BRBs
2022
Abstract Optimizing seismic upgrading interventions in reinforced concrete (RC) structures is a difficult task, due to the inner non-linearity of the analyses usually performed. Additionally, it is well known that the displacement demand to the structure depends from the mass and stiffness of the system, and consequently its definition cannot be made a-priori. This paper presents the application of a soft-computing method -i.e. Genetic Algorithm (GA)- for the shaping optimization of code-compliant seismic upgrading interventions on plane RC frames through Buckling-Restrained Braces (BRB). The metaheuristic procedure allows to minimize the cost while ensuring the required safety level, witho…
An airline connection builder using maximum connection lag with greedy parameter selection
2014
Abstract This paper introduces a methodology for designing an airline connection builder (CB) and adjusting its parameter settings. The objective of the proposed CB is to construct relevant connections that attract passenger demand while avoiding operationally infeasible and commercially irrelevant connections. Using worldwide MIDT booking data, we examined the sensitivity of CB results to the setting of the standard CB parameters maximum connection time and geographical detour. We demonstrated that CB performance can be increased by replacing these two parameters with connection lag, a measure that combines the impact of connection time with geographical detour on the total travel time of …
GWideCodeML: A python package for testing evolutionary hypotheses at the genome-wide level
2020
One of the most widely used programs for detecting positive selection, at the molecular level, is the program codeml, which is implemented in the Phylogenetic Analysis by Maximum Likelihood (PAML) package. However, it has a limitation when it comes to genome-wide studies, as it runs on a gene-by-gene basis. Furthermore, the size of such studies will depend on the number of orthologous genes the genomes have income and these are often restricted to only account for instances where a one-to-one relationship is observed between the genomes. In this work, we present GWideCodeML, a Python package, which runs a genome-wide codeml with the option of parallelization. To maximize the number of analy…
Seju un logo aptazīšanas tīmekļa sistēma
2017
Šajā dokumentā ir aprakstīta seju un logo atpazīšanas tīmekļa sistēma, kas paredzēta attēlos attēlotu seju atrašanai un no šīm sejām sistēmāievietoto seju atpazīšanai, kā arī attēlos redzamo logotipu, kas ievietoti sistēmā, atpazīšanai. Sistēmai tika aprakstīta veidota tikai aizmugures daļa, jo lietotāju saskarni implementēs pasūtītājs. Sistēma realizēta, izmantojot ārējus moduļus, Docker platformā. Tā implementēta Python valodā, izmantojot Flask ietvaru.