scholarly journals Parallel Implementations of Candidate Solution Evaluation Algorithm for N-Queens Problem

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-15
Author(s):  
Jianli Cao ◽  
Zhikui Chen ◽  
Yuxin Wang ◽  
He Guo
Keyword(s):  
Simulated Annealing ◽  
Heuristic Algorithm ◽  
Large Scale ◽  
Fitness Function ◽  
Academic Research ◽  
Coarse Grained ◽  
Practical Application ◽  
Problem Size ◽  
Candidate Solution ◽  
Evaluation Algorithm

The N-Queens problem plays an important role in academic research and practical application. Heuristic algorithm is often used to solve variant 2 of the N-Queens problem. In the process of solving, evaluation of the candidate solution, namely, fitness function, often occupies the vast majority of running time and becomes the key to improve speed. In this paper, three parallel schemes based on CPU and four parallel schemes based on GPU are proposed, and a serial scheme is implemented at the baseline. The experimental results show that, for a large-scale N-Queens problem, the coarse-grained GPU scheme achieved a maximum 307-fold speedup over a single-threaded CPU counterpart in evaluating a candidate solution. When the coarse-grained GPU scheme is applied to simulated annealing in solving N-Queens problem variant 2 with a problem size no more than 3000, the speedup is up to 9.3.

scholarly journals Performance Analysis of Simulated Annealing and Genetic Algorithm on systems of linear equations

F1000Research ◽  
2021 ◽  
Vol 10 ◽  
pp. 1297
Author(s):  
Md. Shabiul Islam ◽  
Most Tahamina Khatoon ◽  
Kazy Noor-e-Alam Siddiquee ◽  
Wong Hin Yong ◽  
Mohammad Nurul Huda
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Real Time ◽  
Large Scale ◽  
Fitness Function ◽  
Random Search ◽  
Linear Equations ◽  
Simultaneous Equations ◽  
Function Evaluation ◽  
Solution Sets

Problem solving and modelling in traditional substitution methods at large scale for systems using sets of simultaneous equations is time consuming. For such large scale global-optimization problem, Simulated Annealing (SA) algorithm and Genetic Algorithm (GA) as meta-heuristics for random search technique perform faster. Therefore, this study applies the SA to solve the problem of linear equations and evaluates its performances against Genetic Algorithms (GAs), a population-based search meta-heuristic, which are widely used in Travelling Salesman problems (TSP), Noise reduction and many more. This paper presents comparison between performances of the SA and GA for solving real time scientific problems. The significance of this paper is to solve the certain real time systems with a set of simultaneous linear equations containing different unknown variable samples those were simulated in Matlab using two algorithms-SA and GA. In all of the experiments, the generated random initial solution sets and the random population of solution sets were used in the SA and GA respectively. The comparison and performances of the SA and GA were evaluated for the optimization to take place for providing sets of solutions on certain systems. The SA algorithm is superior to GA on the basis of experimentation done on the sets of simultaneous equations, with a lower fitness function evaluation count in MATLAB simulation. Since, complex non-linear systems of equations have not been the primary focus of this research, in future, performances of SA and GA using such equations will be addressed. Even though GA maintained a relatively lower number of average generations than SA, SA still managed to outperform GA with a reasonably lower fitness function evaluation count. Although SA sometimes converges slowly, still it is efficient for solving problems of simultaneous equations in this case. In terms of computational complexity, SA was far more superior to GAs.

Evaluating Qualitative Research

2017 ◽  
Author(s):  
Jeasik Cho
Keyword(s):  
Qualitative Research ◽  
Large Scale ◽  
Academic Research ◽  
Research Community ◽  
Assessment Tools ◽  
Journal Articles ◽  
Journal Editors ◽  
The Past ◽  
Grant Proposals

This book provides the qualitative research community with some insight on how to evaluate the quality of qualitative research. This topic has gained little attention during the past few decades. We, qualitative researchers, read journal articles, serve on masters’ and doctoral committees, and also make decisions on whether conference proposals, manuscripts, or large-scale grant proposals should be accepted or rejected. It is assumed that various perspectives or criteria, depending on various paradigms, theories, or fields of discipline, have been used in assessing the quality of qualitative research. Nonetheless, until now, no textbook has been specifically devoted to exploring theories, practices, and reflections associated with the evaluation of qualitative research. This book constructs a typology of evaluating qualitative research, examines actual information from websites and qualitative journal editors, and reflects on some challenges that are currently encountered by the qualitative research community. Many different kinds of journals’ review guidelines and available assessment tools are collected and analyzed. Consequently, core criteria that stand out among these evaluation tools are presented. Readers are invited to join the author to confidently proclaim: “Fortunately, there are commonly agreed, bold standards for evaluating the goodness of qualitative research in the academic research community. These standards are a part of what is generally called ‘scientific research.’ ”

scholarly journals Research on capacity optimization of micro-grid hybrid energy storage system based on simulated annealing artificial fish swarm algorith with memory function

2020 ◽  
Vol 185 ◽  
pp. 01023
Author(s):  
Yuan An ◽  
Jianing Li ◽  
Cenyue Chen
Keyword(s):  
Simulated Annealing ◽  
Energy Storage ◽  
Large Scale ◽  
Memory Function ◽  
Storage System ◽  
Energy Storage System ◽  
Hybrid Energy ◽  
Hybrid Energy Storage ◽  
Hybrid Energy Storage System ◽  
With Memory

The intermittence and uncertainty of wind power and photovoltaic power have hindered the large-scale development of both. Therefore, it is very necessary to properly configure energy storage devices in the wind-solar complementary power grid. For the hybrid energy storage system composed of storage battery and supercapacitor, the optimization model of hybrid energy storage capacity is established with the minimum comprehensive cost as the objective function and the energy saving and charging state as the constraints. A simulated annealing artificial fish school algorithm with memory function is proposed to solve the model. The results show that the hybrid energy storage system can greatly save costs and improve system economy.

scholarly journals Mean-Field Models for EEG/MEG: From Oscillations to Waves

2021 ◽  
Author(s):  
Áine Byrne ◽  
James Ross ◽  
Rachel Nicks ◽  
Stephen Coombes
Keyword(s):  
Gap Junction ◽  
Large Scale ◽  
Mean Field ◽  
Coarse Grained ◽  
Neural Mass Model ◽  
Neuron Network ◽  
Mass Model ◽  
Mean Field Model ◽  
Neural Mass ◽  
The Rich

AbstractNeural mass models have been used since the 1970s to model the coarse-grained activity of large populations of neurons. They have proven especially fruitful for understanding brain rhythms. However, although motivated by neurobiological considerations they are phenomenological in nature, and cannot hope to recreate some of the rich repertoire of responses seen in real neuronal tissue. Here we consider a simple spiking neuron network model that has recently been shown to admit an exact mean-field description for both synaptic and gap-junction interactions. The mean-field model takes a similar form to a standard neural mass model, with an additional dynamical equation to describe the evolution of within-population synchrony. As well as reviewing the origins of this next generation mass model we discuss its extension to describe an idealised spatially extended planar cortex. To emphasise the usefulness of this model for EEG/MEG modelling we show how it can be used to uncover the role of local gap-junction coupling in shaping large scale synaptic waves.

scholarly journals Simba

2021 ◽  
Vol 64 (6) ◽  
pp. 107-116
Author(s):  
Yakun Sophia Shao ◽  
Jason Cemons ◽  
Rangharajan Venkatesan ◽  
Brian Zimmer ◽  
Matthew Fojtik ◽  
...  
Keyword(s):  
Deep Learning ◽  
Large Scale ◽  
Data Locality ◽  
Coarse Grained ◽  
Batch Size ◽  
Peak Performance ◽  
Large Scale Systems ◽  
High Area ◽  
On Chip ◽  
And Storage

Package-level integration using multi-chip-modules (MCMs) is a promising approach for building large-scale systems. Compared to a large monolithic die, an MCM combines many smaller chiplets into a larger system, substantially reducing fabrication and design costs. Current MCMs typically only contain a handful of coarse-grained large chiplets due to the high area, performance, and energy overheads associated with inter-chiplet communication. This work investigates and quantifies the costs and benefits of using MCMs with finegrained chiplets for deep learning inference, an application domain with large compute and on-chip storage requirements. To evaluate the approach, we architected, implemented, fabricated, and tested Simba, a 36-chiplet prototype MCM system for deep-learning inference. Each chiplet achieves 4 TOPS peak performance, and the 36-chiplet MCM package achieves up to 128 TOPS and up to 6.1 TOPS/W. The MCM is configurable to support a flexible mapping of DNN layers to the distributed compute and storage units. To mitigate inter-chiplet communication overheads, we introduce three tiling optimizations that improve data locality. These optimizations achieve up to 16% speedup compared to the baseline layer mapping. Our evaluation shows that Simba can process 1988 images/s running ResNet-50 with a batch size of one, delivering an inference latency of 0.50 ms.

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 Mobility patterns are associated with experienced income segregation in large US cities

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Esteban Moro ◽  
Dan Calacci ◽  
Xiaowen Dong ◽  
Alex Pentland
Keyword(s):  
Large Scale ◽  
Mobility Model ◽  
Coarse Grained ◽  
Spatial Proximity ◽  
Mobility Patterns ◽  
Data Set ◽  
Residential Patterns ◽  
Income Segregation ◽  
Mobility Data ◽  
Mobility Behavior

AbstractTraditional understanding of urban income segregation is largely based on static coarse-grained residential patterns. However, these do not capture the income segregation experience implied by the rich social interactions that happen in places that may relate to individual choices, opportunities, and mobility behavior. Using a large-scale high-resolution mobility data set of 4.5 million mobile phone users and 1.1 million places in 11 large American cities, we show that income segregation experienced in places and by individuals can differ greatly even within close spatial proximity. To further understand these fine-grained income segregation patterns, we introduce a Schelling extension of a well-known mobility model, and show that experienced income segregation is associated with an individual’s tendency to explore new places (place exploration) as well as places with visitors from different income groups (social exploration). Interestingly, while the latter is more strongly associated with demographic characteristics, the former is more strongly associated with mobility behavioral variables. Our results suggest that mobility behavior plays an important role in experienced income segregation of individuals. To measure this form of income segregation, urban researchers should take into account mobility behavior and not only residential patterns.

Sign in / Sign up

Export Citation Format

Share Document