scholarly journals Μέθοδοι σχεδιασμού-βελτιστοποίησης στις στροβιλομηχανές βασισμένες στους εξελικτικούς αλγορίθμους

2013 ◽  
Author(s):  
Στυλιανός Κυριάκου
Keyword(s):  
Design Optimization ◽  
Real World ◽  
Large Scale ◽  
Optimization Methods ◽  
Industrial Applications ◽  
Turn Around Time ◽  
Phd Thesis

The scope of this PhD thesis is to pΙopose a set of improvements to existingshape design-optimization methods in fluid dynamiοs based on EvolutionaryΑlgorithms (EAs) and demonstrate their effiοienοy in real-world applications.Though the proposed method and the developed EA-based software are bothgeneriο, this thesis foοuses on applicatiοns in the fields of hydrau1ic andthermal turbomaοhines. With the proposed a1gorithmic variants, theoptimization turn-around time is notiοeably reduοed with respeοt to that ofοonventional (reference, background) methods. Though the latter areοomputationally expensive, with the proposed add-ons, they becomeaffordable even for large-scale industrial applications.

scholarly journals Stochastic Recursive Gradient Support Pursuit and Its Sparse Representation Applications

Sensors ◽  
2020 ◽  
Vol 20 (17) ◽  
pp. 4902
Author(s):  
Fanhua Shang ◽  
Bingkun Wei ◽  
Yuanyuan Liu ◽  
Hongying Liu ◽  
Shuang Wang ◽  
...  
Keyword(s):  
Sparse Representation ◽  
Real World ◽  
Large Scale ◽  
Matching Pursuit ◽  
Linear Convergence ◽  
Representation Learning ◽  
Optimization Methods ◽  
Hard Thresholding ◽  
Real World Datasets ◽  
Norm Constraint

In recent years, a series of matching pursuit and hard thresholding algorithms have been proposed to solve the sparse representation problem with ℓ0-norm constraint. In addition, some stochastic hard thresholding methods were also proposed, such as stochastic gradient hard thresholding (SG-HT) and stochastic variance reduced gradient hard thresholding (SVRGHT). However, each iteration of all the algorithms requires one hard thresholding operation, which leads to a high per-iteration complexity and slow convergence, especially for high-dimensional problems. To address this issue, we propose a new stochastic recursive gradient support pursuit (SRGSP) algorithm, in which only one hard thresholding operation is required in each outer-iteration. Thus, SRGSP has a significantly lower computational complexity than existing methods such as SG-HT and SVRGHT. Moreover, we also provide the convergence analysis of SRGSP, which shows that SRGSP attains a linear convergence rate. Our experimental results on large-scale synthetic and real-world datasets verify that SRGSP outperforms state-of-the-art related methods for tackling various sparse representation problems. Moreover, we conduct many experiments on two real-world sparse representation applications such as image denoising and face recognition, and all the results also validate that our SRGSP algorithm obtains much better performance than other sparse representation learning optimization methods in terms of PSNR and recognition rates.

Design optimization of large-scale structures with sequential linear programming

2002 ◽  
Vol 216 (8) ◽  
pp. 799-811 ◽  
Author(s):  
L Lamberti ◽  
C Pappalettere
Keyword(s):  
Linear Programming ◽  
Design Optimization ◽  
Large Scale ◽  
Optimization Technique ◽  
Computational Cost ◽  
Optimization Methods ◽  
Optimization Techniques ◽  
Truss Structures ◽  
Large Set ◽  
Sequential Linear Programming

Design optimization of complex structures entails tasks that oppose the usual constraints on time and computational resources. However, using optimization techniques is very useful because it allows engineers to obtain a large set of designs at low computational cost. Among the different optimization methods, sequential linear programming (SLP) is very popular because of its simplicity and because linear solvers (e.g. Simplex) are easily available. In spite of the inherent theoretical simplicity, well-coded SLP algorithms may outperform more sophisticated optimization methods. This paper describes the experience obtained in the design optimization of large-scale truss structures and beams with SLP-based algorithms. Sizing and configuration problems of structures under multiple loading conditions with up to 1000 design variables and 3500 constraints are considered. The relative performance and merits of some SLP-based algorithms are compared and the efficiency of an advanced SLP-based algorithm called ILEAML (improved linearization error amplitude move limits) is tested. ILEAML is also compared to the sequential quadratic programming (SQP) method, which is considered by theoreticians as probably the best theoretically founded optimization technique.

1588-P: Therapy Trends in Initial 6 Months of the First Large-Scale Longitudinal Nationwide Study on Management and Real-World Outcomes of Diabetes in India (LANDMARC)

Diabetes ◽  
2020 ◽  
Vol 69 (Supplement 1) ◽  
pp. 1588-P ◽  
Author(s):  
ROMIK GHOSH ◽  
ASHOK K. DAS ◽  
AMBRISH MITHAL ◽  
SHASHANK JOSHI ◽  
K.M. PRASANNA KUMAR ◽  
...  
Keyword(s):  
Real World ◽  
Large Scale ◽  
Nationwide Study

2258-PUB: Impact of Cardiovascular (CV) Risk Factors during the Initial 6 Months of the First Large-Scale Longitudinal Nationwide Study on Management and Real-World Outcomes of Diabetes in India (LANDMARC)

Diabetes ◽  
2020 ◽  
Vol 69 (Supplement 1) ◽  
pp. 2258-PUB
Author(s):  
ROMIK GHOSH ◽  
ASHOK K. DAS ◽  
SHASHANK JOSHI ◽  
AMBRISH MITHAL ◽  
K.M. PRASANNA KUMAR ◽  
...  
Keyword(s):  
Risk Factors ◽  
Real World ◽  
Large Scale ◽  
Nationwide Study

scholarly journals The graph neural networking challenge

2021 ◽  
Vol 51 (3) ◽  
pp. 9-16
Author(s):  
José Suárez-Varela ◽  
Miquel Ferriol-Galmés ◽  
Albert López ◽  
Paul Almasan ◽  
Guillermo Bernárdez ◽  
...  
Keyword(s):  
Machine Learning ◽  
Computer Networks ◽  
Real World ◽  
Large Scale ◽  
Lessons Learned ◽  
Educational Resources ◽  
Global Competition ◽  
International Telecommunication Union ◽  
International Telecommunication ◽  
Broad Audience

During the last decade, Machine Learning (ML) has increasingly become a hot topic in the field of Computer Networks and is expected to be gradually adopted for a plethora of control, monitoring and management tasks in real-world deployments. This poses the need to count on new generations of students, researchers and practitioners with a solid background in ML applied to networks. During 2020, the International Telecommunication Union (ITU) has organized the "ITU AI/ML in 5G challenge", an open global competition that has introduced to a broad audience some of the current main challenges in ML for networks. This large-scale initiative has gathered 23 different challenges proposed by network operators, equipment manufacturers and academia, and has attracted a total of 1300+ participants from 60+ countries. This paper narrates our experience organizing one of the proposed challenges: the "Graph Neural Networking Challenge 2020". We describe the problem presented to participants, the tools and resources provided, some organization aspects and participation statistics, an outline of the top-3 awarded solutions, and a summary with some lessons learned during all this journey. As a result, this challenge leaves a curated set of educational resources openly available to anyone interested in the topic.

scholarly journals Influence of Wind Power on Modeling of Bidding Strategy in a Promising Power Market with a Modified Gravitational Search Algorithm

2021 ◽  
Vol 11 (10) ◽  
pp. 4438
Author(s):  
Satyendra Singh ◽  
Manoj Fozdar ◽  
Hasmat Malik ◽  
Maria del Valle Fernández Moreno ◽  
Fausto Pedro García Márquez
Keyword(s):  
Wind Power ◽  
Electricity Market ◽  
Large Scale ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Optimization Methods ◽  
Bidding Strategy ◽  
Wind Speed Profile ◽  
Gravitational Search ◽  
Modified Gravitational Search Algorithm

It is expected that large-scale producers of wind energy will become dominant players in the future electricity market. However, wind power output is irregular in nature and it is subjected to numerous fluctuations. Due to the effect on the production of wind power, producing a detailed bidding strategy is becoming more complicated in the industry. Therefore, in view of these uncertainties, a competitive bidding approach in a pool-based day-ahead energy marketplace is formulated in this paper for traditional generation with wind power utilities. The profit of the generating utility is optimized by the modified gravitational search algorithm, and the Weibull distribution function is employed to represent the stochastic properties of wind speed profile. The method proposed is being investigated and simplified for the IEEE-30 and IEEE-57 frameworks. The results were compared with the results obtained with other optimization methods to validate the approach.

scholarly journals Machine Learning for Design Optimization of Electromagnetic Devices: Recent Developments and Future Directions

2021 ◽  
Vol 11 (4) ◽  
pp. 1627
Author(s):  
Yanbin Li ◽  
Gang Lei ◽  
Gerd Bramerdorfer ◽  
Sheng Peng ◽  
Xiaodong Sun ◽  
...  
Keyword(s):  
Machine Learning ◽  
Design Optimization ◽  
Optimization Methods ◽  
Machine Learning Algorithms ◽  
Cloud Services ◽  
Robust Design Optimization ◽  
Support Vector ◽  
Future Directions ◽  
Electromagnetic Devices ◽  
Recent Developments

This paper reviews the recent developments of design optimization methods for electromagnetic devices, with a focus on machine learning methods. First, the recent advances in multi-objective, multidisciplinary, multilevel, topology, fuzzy, and robust design optimization of electromagnetic devices are overviewed. Second, a review is presented to the performance prediction and design optimization of electromagnetic devices based on the machine learning algorithms, including artificial neural network, support vector machine, extreme learning machine, random forest, and deep learning. Last, to meet modern requirements of high manufacturing/production quality and lifetime reliability, several promising topics, including the application of cloud services and digital twin, are discussed as future directions for design optimization of electromagnetic devices.

A Heuristic Algorithm for Solving a Large-scale Real-world Territory Design Problem

Omega ◽  
2021 ◽  
pp. 102442
Author(s):  
Lin Zhou ◽  
Lu Zhen ◽  
Roberto Baldacci ◽  
Marco Boschetti ◽  
Ying Dai ◽  
...  
Keyword(s):  
Heuristic Algorithm ◽  
Real World ◽  
Design Problem ◽  
Large Scale ◽  
Territory Design

scholarly journals An information theoretic approach to link prediction in multiplex networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Seyed Hossein Jafari ◽  
Amir Mahdi Abdolhosseini-Qomi ◽  
Masoud Asadpour ◽  
Maseud Rahgozar ◽  
Naser Yazdani
Keyword(s):  
Real World ◽  
Link Prediction ◽  
Large Scale ◽  
Similarity Measures ◽  
Prediction Method ◽  
General Purpose ◽  
Fast Method ◽  
Theoretic Approach ◽  
Multiplex Networks ◽  
Wide Range

AbstractThe entities of real-world networks are connected via different types of connections (i.e., layers). The task of link prediction in multiplex networks is about finding missing connections based on both intra-layer and inter-layer correlations. Our observations confirm that in a wide range of real-world multiplex networks, from social to biological and technological, a positive correlation exists between connection probability in one layer and similarity in other layers. Accordingly, a similarity-based automatic general-purpose multiplex link prediction method—SimBins—is devised that quantifies the amount of connection uncertainty based on observed inter-layer correlations in a multiplex network. Moreover, SimBins enhances the prediction quality in the target layer by incorporating the effect of link overlap across layers. Applying SimBins to various datasets from diverse domains, our findings indicate that SimBins outperforms the compared methods (both baseline and state-of-the-art methods) in most instances when predicting links. Furthermore, it is discussed that SimBins imposes minor computational overhead to the base similarity measures making it a potentially fast method, suitable for large-scale multiplex networks.

Sign in / Sign up

Export Citation Format

Share Document