Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 12 of 12

Full-Text Articles in Physical Sciences and Mathematics

Identification Of Faults In Highways Using Approximation Methods And Algorithms, Khudayberdiyev Khakkulmirzayevich Mirzaakbar, Anvar Asatilloyevich Ravshanov Feb 2024

Identification Of Faults In Highways Using Approximation Methods And Algorithms, Khudayberdiyev Khakkulmirzayevich Mirzaakbar, Anvar Asatilloyevich Ravshanov

Chemical Technology, Control and Management

Many fast Fourier transforms are used to identify defective parts of uneven surfaces on roads and send information to relevant organizations on the road, using the " RAVON YO‘LLAR" application installed on a mobile device during car movement. We determine the uneven parts of the road. Smooth and well-maintained roads reduce the risk of vehicle collisions, skidding and other road-related incidents. Timely measures contribute to overall safety, comfort and economic efficiency.


A Novel Hybrid Algorithm For Morphological Analysis: Artificial Neural-Net-Xmor, Ayla Kayabaş, Ahmet Ercan Topcu, Özkan Kiliç Jul 2022

A Novel Hybrid Algorithm For Morphological Analysis: Artificial Neural-Net-Xmor, Ayla Kayabaş, Ahmet Ercan Topcu, Özkan Kiliç

Turkish Journal of Electrical Engineering and Computer Sciences

In this study, we present a novel algorithm that combines a rule-based approach and an artificial neural network-based approach in morphological analysis. The usage of hybrid models including both techniques is evaluated for performance improvements. The proposed hybrid algorithm is based on the idea of the dynamic generation of an artificial neural network according to two-level phonological rules. In this study, the combination of linguistic parsing, a neural network-based error correction model, and statistical filtering is utilized to increase the coverage of pure morphological analysis. We experimented hybrid algorithm applying rule-based and long short-term memory-based (LSTM-based) techniques, and the results …


Assessing Photogrammetry Artificial Intelligence In Monumental Buildings’ Crack Digital Detection, Said Maroun, Mostafa Khalifa, Nabil Mohareb Mar 2022

Assessing Photogrammetry Artificial Intelligence In Monumental Buildings’ Crack Digital Detection, Said Maroun, Mostafa Khalifa, Nabil Mohareb

Architecture and Planning Journal (APJ)

Natural and human-made disasters have significant impacts on monumental buildings, threatening them from being deteriorated. If no rapid consolidations took into consideration traumatic accidents would endanger the existence of precious sites. In this context, Beirut's enormous 4th of August 2020 explosion damaged an estimated 640 historical monuments, many volunteers assess damages for more than a year to prevent the more crucial risk of demolitions. This research aims to assist the collaboration ability among photogrammetry science, Artificial Intelligence Model (AIM) and Architectural Coding to optimize the process for better coverage and scientific approach of data specific to the crack disorders to …


An Algorithm For The Selection Of Route Dependent Orientation Information, Heinrich Loewen, Angela Schwering Jul 2021

An Algorithm For The Selection Of Route Dependent Orientation Information, Heinrich Loewen, Angela Schwering

Journal of Spatial Information Science

Landmarks are important features of spatial cognition and are naturally included in human route descriptions. In the past algorithms were developed to select the most salient landmarks at decision points and automatically incorporate them in route instructions. Moreover, it was shown that human route descriptions contain a significant amount of orientation information, which support the users to orient themselves regarding known environmental information, and it was shown that orientation information support the acquisition of survey knowledge. Thus, there is a need to extend the landmarks selection to automatically select orientation information. In this work, we present an algorithm for the …


Research On Multi-Objective Optimization Method Based On Model, Jianjun Liu, Guangya Si, Yanzheng Wang, Dachuan He Nov 2020

Research On Multi-Objective Optimization Method Based On Model, Jianjun Liu, Guangya Si, Yanzheng Wang, Dachuan He

Journal of System Simulation

Abstract: There is a model-based algorithm for the optimization of multiple objective functions by means of black-box evaluation is proposed. The algorithm iteratively generates candidate solutions from a mixture distribution over the solution space and updates the mixture distribution based on the sampled solutions’ domination count, such that the future search is biased towards the set of Pareto optimal solutions. The proposed algorithm seeks to find a mixture distribution on the solution space so that each component of the mixture distribution is a degenerate distribution centered at a Pareto optimal solution and each estimated Pareto optimal solution is uniformly spread …


Design Of Unified Algorithm For Sampling Mpdu, Ti Zhou, Miao Yi, Yang Jian Aug 2020

Design Of Unified Algorithm For Sampling Mpdu, Ti Zhou, Miao Yi, Yang Jian

Journal of System Simulation

Abstract: The standard of CCSDS AOS is used in space exploration because of the process of the standard airspace system. The spacecraft missions have used multi-protocol data unit (MPDU) to multiplex the package channels. The range of MPDU and the data are different in different spacecrafts. This process brings some problems in the maintenance and the correctness of the algorithms of virtual channel multiplexing in simulation system. The applications of CCSDS in the world were researched, and the general definitions of MPDU in these missions were described. A circle memory was given to buffer the data of MPDU, two general …


Study Of Parallelized Graph Clustering Algorithm Based On Spark, Dongjiang Liu, Jianhui Li Jun 2020

Study Of Parallelized Graph Clustering Algorithm Based On Spark, Dongjiang Liu, Jianhui Li

Journal of System Simulation

Abstract: The parallelized graph clustering algorithm is researched. A new parallelized graph clustering algorithm is proposed based on Spark. As the top operation of Spark occupies a lot of memory space, a new algorithm which is used to substitute the top operation is proposed to reduce the memory consumption. By improving bottom up hierarchical clustering algorithm, the speed of the proposed algorithm is improved. A new data filtering method based on the feature of graph data is proposed. By the method, the running time and memory space comsuption is reduced greatly. The reason of the high efficiency of this filtering …


Telemetry Parameters Simulation Of Spacecraft Based On Computation Tree, Ti Zhou, Miao Yi Jun 2020

Telemetry Parameters Simulation Of Spacecraft Based On Computation Tree, Ti Zhou, Miao Yi

Journal of System Simulation

Abstract: Simulation system of spacecrafts' Telemetry and Command (TT&C) needs to simulate lots of telemetry parameters in every missions, whose computing algorithms are different. In the past applications, these algorithms are fixed as codes in software programs, so it is very difficult to improve the maintainability and reuse of the simulation system. By studying the computing methods of telemetry parameters described in configuration files, a design scheme was given in which the algorithms of parameters were flexibly configured, and the principle of methods were described specially in computing parameters, software models, data structure and algorithms. In this framework, the algorithms …


Designing Fractal Line Pied-De-Poules: A Case Study In Algorithmic Design Mediating Between Culture And Fractal Mathematics, Loe M.G. Feijs Jan 2020

Designing Fractal Line Pied-De-Poules: A Case Study In Algorithmic Design Mediating Between Culture And Fractal Mathematics, Loe M.G. Feijs

Journal of Humanistic Mathematics

Millions of people own and wear pied-de-poule (houndstooth) garments. The pattern has an intriguing basic figure and a typical set of symmetries. The origin of the pattern lies in a specific type of weaving. In this article I apply computational techniques to modernize this ancient decorative pattern. In particular I describe a way to enrich pied-de-poule with a fractal structure.

Although a first fractal line pied-de-poule was shown at Bridges 2015, a number of fundamental questions still remained. The following questions are addressed in this article: Does the original pied-de-poule appear as a limit case when the fractal structure is …


Optimization Of Q-Btgsid Based On Sensitivity Analysis, Shuwei Jia Jan 2019

Optimization Of Q-Btgsid Based On Sensitivity Analysis, Shuwei Jia

Journal of System Simulation

Abstract: In order to make up for the defect that relative degree of incidence, absolute degree of incidence and synthetic degree of incidence are limited in the range of (0.5, 1], this paper attempts to improve the degree of grey incidence. A control factor of “λ” and the metric space are set up to adjust. A new model is established and its specific properties are studied. It is proved that the new model satisfies the grey incidence axioms and the range of degree of grey incidence can be extended to (0, 1]. We put forward four principles of …


Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri Nov 2018

Efficient Algorithm For Solving 3sum Problem, Muhamed Retkoceri

International Journal of Business and Technology

In this paper is presented an algorithm for solving 3SUM problem efficiently in general computation model. The algorithm is based on sorting and splits the task into sub-tasks where this approach enables the algorithm to run concurrently at the high-level of computing. The algorithm is O(n2) and running sequentially achieves at least ~1/5 n2 number of basic necessary accesses of data structures. In this paper is also presented a comparison of running performances in practice between the new algorithm and the current most famous algorithm for 3SUM which is in-place and also based on sorting.


Maximum Size Of The Pareto Cost Sets For Multi-Constrained Optimal Routing, Derya Yiltaş Kaplan Jan 2017

Maximum Size Of The Pareto Cost Sets For Multi-Constrained Optimal Routing, Derya Yiltaş Kaplan

Turkish Journal of Electrical Engineering and Computer Sciences

Routing under multiple independent constrains in point-to-point networks has been studied for over 10 years. Its NP-hardness keeps pushing researchers to study approximate algorithms and heuristics, and many results have been published in these years. To the best of our knowledge, the nature of its average case has been explored only for the self-adaptive multiple constraints routing algorithm (SAMCRA), which is an algorithm about multiple constraints routing. In this paper, we simplify SAMCRA into a format that is convenient for our average case analysis. This variant algorithm gives optimal solutions also for very large dimensional networks such as with more …