scaling algorithms
Recently Published Documents


TOTAL DOCUMENTS

117
(FIVE YEARS 18)

H-INDEX

21
(FIVE YEARS 3)

2021 ◽  
Vol 18 ◽  
pp. 145-156
Author(s):  
Tiziana Comito ◽  
Colm Clancy ◽  
Conor Daly ◽  
Alan Hally

Abstract. Convection-permitting weather forecasting models allow for prediction of rainfall events with increasing levels of detail. However, the high resolutions used can create problems and introduce the so-called “double penalty” problem when attempting to verify the forecast accuracy. Post-processing within an ensemble prediction system can help to overcome these issues. In this paper, two new up-scaling algorithms based on Machine Learning and Statistical approaches are proposed and tested. The aim of these tools is to enhance the skill and value of the forecasts and to provide a better tool for forecasters to predict severe weather.


Author(s):  
Jason Robert VandenBeukel ◽  
Christopher Cochrane ◽  
Jean-François Godbout

Abstract Since 2015, the Canadian Senate has undergone a series of reforms designed to make it more independent, ideologically diverse, and active in the legislative process. We use loyalty scores and vote scaling algorithms to situate the voting behaviour of senators, focusing primarily on the 41st and 42nd Parliaments (2011–2019), the period just before and after the changes, respectively. We find that the reforms have led to a loosening of party discipline across all parties and caucuses but that independent senators appointed under the reformed process are the most likely supporters of the government's agenda. We also find that the Senate has become more willing to use its formal powers.


2021 ◽  
Vol 5 (2) ◽  
pp. 304-337
Author(s):  
Carlos Améndola ◽  
Kathlén Kohn ◽  
Philipp Reichenbach ◽  
Anna Seigal

2020 ◽  
Vol 39 (5) ◽  
pp. 7449-7467
Author(s):  
I. George Fernandez ◽  
J. Arokia Renjith

Cloud computing technology is playing a major role in the industry and real-life, for providing fast services such as data sharing and allocating the cloud resources that are paid and truly required. In this scenario, the cloud users are scheduled according to the rule-based systems for attempting to automate the matching between computing requirements and resources. Even though, the majority auto-scaling algorithms only helped as indicators for simple resource utilization and also not considered both cloud user needs and budget concerns. For this purpose, we propose a new model which is the combination of auto-scaling algorithms, resource allocation and scheduling for allocating the appropriate resources and scheduled them. This model consists of three new algorithms namely Grey Wolf Optimization and Fuzzy rules based Resource allocation and Scheduling Algorithm (GWOFRSA), Auto-Scaling Algorithm for Cloud based Web Application (ASACWA) and Auto-Scaling Algorithm for handling Distributed Computing Tasks (ASADCT). Here, we introduce new auto-scaling algorithms for enhancing the performance of cloud services. In this work, the optimization technique is used to predict the cloud server workload, resource requirements and it also uses fuzzy rules for monitoring the resource utilization and the size of virtual machine allocation process. According to the workload prediction, the completion time is estimated for each cloud server. The experiments are conducted by using a simulator called CloudSim environment of Java programming and compared with the existing works available in this direction in terms of resource utilization and enhance the cloud performance with better Quality of Service of Virtual Machine allocation, Missed Deadline, Demand Satisfaction, Power Utilization, CPU Load and throughput.


Author(s):  
Mehmet Erbudak ◽  
Selim Onat

The symmetry properties of an ornament contain information about its civilisation and its interactions with other cultural sources. Two-dimensional periodic ornaments can be strictly classified into mathematical wallpaper groups. The collection of ornaments thus classified for a civilisation is characteristic of the cultural group and serves as a fingerprint to identify that group. If the distribution of wallpaper groups is available for several societies, multi-dimensional scaling algorithms can be applied to determine similarities and differences between the art practices of these communities. This method allows a systematic approach to the general ornamental practices within a culture and their interactions in the form of similarity of fingerprints. We test the feasibility of the method on examples of medieval Armenians, Byzantium, Seljuks first in Persia and then in Anatolia and among Arabs in the Middle East. For this purpose we present the distribution of the planar ornaments and calculate the corresponding Pearson correlation coefficients in pairs. The results suggest an intense interaction between the Seljuk Turks and Arab craftsmen, as well as between Armenian and Byzantine artisans who made the ornaments.


2020 ◽  
Vol 76 (4) ◽  
pp. 385-399 ◽  
Author(s):  
James Beilsten-Edmands ◽  
Graeme Winter ◽  
Richard Gildea ◽  
James Parkhurst ◽  
David Waterman ◽  
...  

In processing X-ray diffraction data, the intensities obtained from integration of the diffraction images must be corrected for experimental effects in order to place all intensities on a common scale both within and between data collections. Scaling corrects for effects such as changes in sample illumination, absorption and, to some extent, global radiation damage that cause the measured intensities of symmetry-equivalent observations to differ throughout a data set. This necessarily requires a prior evaluation of the point-group symmetry of the crystal. This paper describes and evaluates the scaling algorithms implemented within the DIALS data-processing package and demonstrates the effectiveness and key features of the implementation on example macromolecular crystallographic rotation data. In particular, the scaling algorithms enable new workflows for the scaling of multi-crystal or multi-sweep data sets, providing the analysis required to support current trends towards collecting data from ever-smaller samples. In addition, the implementation of a free-set validation method is discussed, which allows the quantification of the suitability of scaling-model and algorithm choices.


Sign in / Sign up

Export Citation Format

Share Document