computer memory
Recently Published Documents


TOTAL DOCUMENTS

274
(FIVE YEARS 31)

H-INDEX

19
(FIVE YEARS 1)

2021 ◽  
Vol 63 ◽  
pp. 469-492
Author(s):  
Pouria Assari ◽  
Fatemeh Asadi-Mehregan ◽  
Mehdi Dehghan

The main goal of this paper is to solve a class of Darboux problems by converting them into the two-dimensional nonlinear Volterra integral equation of the second kind. The scheme approximates the solution of these integral equations using the discrete Galerkin method together with local radial basis functions, which use a small set of data instead of all points in the solution domain. We also employ the Gauss–Legendre integration rule on the influence domains of shape functions to compute the local integrals appearing in the method. Since the scheme is constructed on a set of scattered points and does not require any background meshes, it is meshless. The error bound and the convergence rate of the presented method are provided. Some illustrative examples are included to show the validity and efficiency of the new technique. Furthermore, the results obtained demonstrate that this method uses much less computer memory than the method established using global radial basis functions. doi:10.1017/S1446181121000377


Author(s):  
Yu. Sobirov

This paper presents an improved method for adjusting individual mirrors –facets of heliostats of a Big Solar Furnace (BSF) with a heat output of 1000 kW in Uzbekistan. Due to the fact that a BSF consists of 22,790 pieces of individual mirrors, the adjustment - setting a specific geometric position of these mirrors is very important. The process of adjusting the mirrors is very time consuming and lengthy. Often exactly the adjustments are influenced by subjective factors by the aligners. In order to improve the performance and accuracy of the alignment, the facet of heliostats has applied the Technical Vision System (TVS), as well as improved the process of assessing the state of alignment and the processing of alignment data. The TVS consisting of a video camera, an interface, a personal computer and special software allows you to visually and accurately assess the alignment conditions of the heliostat facets before and after the alignment process. Allows you to save the data in computer memory for further processing and analysis. Allows you to create a database of the alignment status of each of the 62 heliostats of LSF. Special software developed by us allows you to quickly and accurately determine the deviations of the heliostat facets from the calculated geometric points in angular minutes. Based on the data obtained, you can build histograms, graphs, etc. for visual analysis of the heliostat alignment states before and after the alignment process.


2021 ◽  
pp. 1-24
Author(s):  
P. ASSARI ◽  
F. ASADI-MEHREGAN ◽  
M. DEHGHAN

Abstract The main goal of this paper is to solve a class of Darboux problems by converting them into the two-dimensional nonlinear Volterra integral equation of the second kind. The scheme approximates the solution of these integral equations using the discrete Galerkin method together with local radial basis functions, which use a small set of data instead of all points in the solution domain. We also employ the Gauss–Legendre integration rule on the influence domains of shape functions to compute the local integrals appearing in the method. Since the scheme is constructed on a set of scattered points and does not require any background meshes, it is meshless. The error bound and the convergence rate of the presented method are provided. Some illustrative examples are included to show the validity and efficiency of the new technique. Furthermore, the results obtained demonstrate that this method uses much less computer memory than the method established using global radial basis functions.


Author(s):  
Marcin Jurkiewicz

AbstractWe present two greedy algorithms that determine zero-error codes and lower bounds on the zero-error capacity. These algorithms have many advantages, e.g., they do not store a whole product graph in a computer memory and they use the so-called distributions in all dimensions to get better approximations of the zero-error capacity. We also show an additional application of our algorithms.


Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1826
Author(s):  
Sagvan Y. Musa ◽  
Baravan A. Asaad

Hypersoft set theory is an extension of soft set theory and is a new mathematical tool for dealing with fuzzy problems; however, it still suffers from the parametric tools’ inadequacies. In order to boost decision-making accuracy even more, a new mixed mathematical model called the bipolar hypersoft set is created by merging hypersoft sets and bipolarity. It is characterized by two hypersoft sets, one of which provides positive information and the other provides negative information. Moreover, some fundamental properties relative to it such as subset, superset, equal set, complement, difference, relative (absolute) null set and relative (absolute) whole set are defined. Furthermore, some set-theoretic operations such as the extended intersection, the restricted union, intersection, union, AND-operation and OR-operation of two bipolar hypersoft sets with their properties are discussed and supported by examples. Finally, tabular representations for the purposes of storing bipolar hypersoft sets in computer memory are used.


Author(s):  
P.A. Polyanskikh ◽  
◽  
A.A. Mescheryakov ◽  
V.P. Denisov ◽  
◽  
...  

The possibility of assessing the distance from the aircraft to an operating ground-based radar based on the totality of reflections of its signals from the terrain and local objects is evaluated. The peculiarity of the measurement algorithm is that a priori it is not necessary to know from which object one or the other signal was reflected. The coordinates of the reflectors are stored in the computer memory in the form of an electronic map of the area. The position of the radio emission source is determined by the difference in the arrival times of the direct and reflected signals, as well as the bearings measured from them.


2021 ◽  
Author(s):  
Parthasarathy Rajarathinam Jayachandran

The computational time and resources required to calculate an accurate solution is the key concern in the field of CFD. Especially in the CFD analysis of turbomachines many simulations are required to validate the CFD code and to predict the performance of the turbomachines. In this thesis, the typical computational domain was remodelled and the best computational settings were identified to compute the flows. By modifying the numerical domain, improved grid distribution with less number of nodes was achieved and the results predicted were within the limits specified by NASA for the validation of CFD codes. The modified model with the best computational settings required 28.3% less computational time and 20.5% less computer memory than the typical model and baseline methods.


2021 ◽  
Author(s):  
Parthasarathy Rajarathinam Jayachandran

The computational time and resources required to calculate an accurate solution is the key concern in the field of CFD. Especially in the CFD analysis of turbomachines many simulations are required to validate the CFD code and to predict the performance of the turbomachines. In this thesis, the typical computational domain was remodelled and the best computational settings were identified to compute the flows. By modifying the numerical domain, improved grid distribution with less number of nodes was achieved and the results predicted were within the limits specified by NASA for the validation of CFD codes. The modified model with the best computational settings required 28.3% less computational time and 20.5% less computer memory than the typical model and baseline methods.


Author(s):  
A Sardashti ◽  
HM Daniali ◽  
SM Varedi-Koulaei

This paper presents a novel methodology for path generation synthesis of the four-bar mechanism. A new objective function for the path generation synthesis problem, namely, the Geometrical Similarity Error Function (GSEF), is introduced. Indeed, GSEF assesses the similarity between generated and desired paths, and its number of design variables is less than those in the other synthesis methods. Then, using an Innovative Adaptive Algorithm (IAA), some operators are utilized for matching two similar paths. GSEF-IAA methodology has some significant advantages over the reported synthesis methods. The method is fast, takes much less CPU time, and saves a large amount of computer memory. Four path generation problems are solved using GSEF-IAA, and the results are compared with those of previous methods using some well-known optimization algorithms to demonstrate the efficiency of GSEF-IAA methodology.


Ledger ◽  
2021 ◽  
Vol 6 ◽  
Author(s):  
Kees Leune ◽  
Jai Punjwani

Voting is one of the most fundamental aspects of democracy. Over the past few decades, voting methods around the world have expanded from traditional paper ballot systems to electronic voting (e-voting), in which votes are written directly to computer memory. Like any computer system, voting machines are susceptible to technical vulnerabilities that open up opportunities for hackers to tamper with votes, causing the use of electronic voting technology to raise concerns about ballot security. We describe how electronic voting can be supported by blockchain technology to ensure voter secrecy, vote correctness, and equal voting rights. In this paper, we present a system using two separate blockchains, each with separate transactions and consensus algorithms. We describe a prototype implementation that validates our ideas by executing several proof-of-concept simulations of a range of voting scenarios.


Sign in / Sign up

Export Citation Format

Share Document