scholarly journals LINEAR SEARCH ALGORITHM TO BE SOLVED BY PARAMETER LOOP

2020 ◽  
Author(s):  
J. Dashdemberel ◽  
◽  
D. Buren-Arvijikh ◽  
Keyword(s):  
Search Algorithm ◽  
Detailed Knowledge ◽  
Automatic Programming ◽  
Linear Search ◽  
Program Language ◽  
Basic Understanding ◽  
Internal Core ◽  
Programming Systems ◽  
The Given ◽  
Algebra Of Sets

There are common occasions for finding out required optional data or element from the given algebra of sets and any kind of systems when we are solving practical and informatics tasks. In order to solve these types of tasks or issues, students or researchers have to know about the methodologies for basic understanding which are called tasks for searching. This process is very important as for finding out basic understanding and methodologies, having detailed knowledge of algorithms and searching methods, although there are modern specific technologies and automatic programming systems. When searching methods are programmedfor informatics tasks, necessary abilities such as seeking essential or import of program language operators and making analysis indifference among characterful solving should be owned by students or specialists. Therefore,I set my purpose of thesis of organizing linear searching algorithms by the parameter loop of the programming language C during the discovering process of identifying differences, patterns, and internal core of linear searching methodologies.

Study of a Method for Calculating the Current Accuracy In Map-Aided Navigation Problem

2021 ◽  
Vol 29 (1) ◽  
pp. 52-69
Author(s):  
K. V. Dunaevskaya ◽  
◽  
L. V. Kiselev ◽  
V. B. Kostousov ◽  
◽  
...  
Keyword(s):  
Extreme Values ◽  
Search Algorithm ◽  
Computer Experiments ◽  
Gravity Anomalies ◽  
Navigation Problem ◽  
Measurement Systems ◽  
Mapping Process ◽  
Reference Map ◽  
The Given ◽  
Current Accuracy

The paper studies a previously proposed method for calculating the current accuracy characteristics of a correlation-extreme search algorithm for solving the map-aided navigation problem. The proposed method is based on the analysis of the ratio of the extreme values of the functional used in the search algorithm for comparing the measured field fragment, and the fragments obtained from a reference map, and on determining the diameter of the set of the given level for this functional. The study is carried out using an example of three spatial geophysical fields: the sea depth field, the field of gravity anomalies, and the anomalous magnetic field; it is focused on their application for underwater vehicle navigation. The specific features of the information and measurement systems used in the survey of these fields, done by means of an underwater robot are described, as well as the procedure simulating the mapping process taking these features into account. The results of computer experiments on comparison of the proposed method for calculating the current accuracy and the method used in the Bayesian algorithm for solving the navigation problem are presented.

scholarly journals APLIKASI PENGHITUNG UPAH LEMBUR BERDASARKAN JUMLAH WAKTU LEMBUR DENGAN MENGGUNAKAN ALGORITMA LINEAR SEARCH

Petir ◽  
2019 ◽  
Vol 12 (1) ◽  
Author(s):  
Hendra Kurniawan ◽  
Sabar Rudiarto
Keyword(s):  
Information Technology ◽  
Human Resources ◽  
Search Algorithm ◽  
Working Hours ◽  
Linear Search ◽  
Long Time ◽  
Recorded Data

The development of information technology has created many solutions to problems that are often faced in life. An application can help a job and make it easier has encourage companies to use applications that help their work in several departments such as administration and human resources. Some companies have regulations requiring employees to do work more than normal working hours that called overtime. Every employee who does overtime will get overtime wages accordance to the amount of overtime that has been done. But sometimes the late of payments occurred because the calculation of overtime wages takes a long time when many employees did overtime. To solve this problem the company needs an application that can calculate overtime wages quickly and accurately, using the linear search algorithm application will search and process the recorded data in the attendance machine, then calculate overtime wages according to the amount of overtime that has been done. And then it can minimize the occurrence of late payments and more accurate calculations result.

scholarly journals Multi-Keyword Ranked Search in Cloud Storage using Homomorphic Indexing

2018 ◽  
Vol 7 (2.24) ◽  
pp. 243
Author(s):  
K Renugha ◽  
P Shanthi ◽  
A Umamakeswari
Keyword(s):  
Search Algorithm ◽  
Homomorphic Encryption ◽  
Cloud Service ◽  
Security And Privacy ◽  
Cloud Service Provider ◽  
Secure Information ◽  
Data Owner ◽  
Ranked Search ◽  
The Given ◽  
Is Outsourcing

In the cloud environment, the main issue is outsourcing of the information to the cloud service provider and outsider. Consider this, the cloud tenant store data in an encrypted form to achieve data security and privacy. The data owner needs the secure information sharing from the cloud and without leak of access pattern to the eavesdroppers. XOR homomorphic encryption searchable algorithm along with ranking is proposed to provide the security over the network. In addition our scheme provides secure Multi-keyword ranked search over encrypted data. Efficient ranked search algorithm returns the relevant document based on the results for the given multiple keywords. The experimental results prove that the system is efficient. 

Online Rescheduling in Semiconductor Manufacturing

2010 ◽  
Vol 4 (2) ◽  
pp. 184-197 ◽  
Author(s):  
Masao Sugi ◽  
◽  
Mingang Cheng ◽  
Masashi Yamamoto ◽  
Hiroki Ito ◽  
...  
Keyword(s):  
Local Search ◽  
Real Time ◽  
Semiconductor Manufacturing ◽  
Search Algorithm ◽  
Local Search Algorithm ◽  
Dispatching Rule ◽  
Feasible Schedule ◽  
Rule Based ◽  
Schedule Stability ◽  
The Given

Semiconductor manufacturing rescheduling problems are difficult to solve in real time due to numerous disturbances. We focus on maintaining the existing schedule and propose online semiconductor manufacturing rescheduling. To handle temporary disturbances and obtain a new feasible schedule, our proposal revises the given schedule based on affected operation rescheduling with operation sorting (sorting-AOR) based on schedule stability. To reduce deadline violations, we propose improving schedules two or more days ahead based on a fast local search algorithm for semicritical paths. In problems with 200,000 processes, this handles disturbances and gets new feasible schedules and better revised schedules in less than 1 minute. This is more effective than conventional dispatching-rule-based approaches, some of which have been applied in different facilities because it provides higher schedule stability and fewer deadline violations.

Sign in / Sign up

Export Citation Format

Share Document