arXiv subjects

Mohamed Khaled

Publications and source records attributed to Mohamed Khaled.

15 recordsLinked to original sources

arXiv2025

FPGA-based Lane Detection System incorporating Temperature and Light Control Units

Intelligent vehicles are one of the most important outcomes gained from the world tendency toward automation. Applications of IVs, whether in urban roads or robot tracks, do prioritize lane path detection. This paper proposes an FPGA-based Lane Detector Vehicle LDV architecture that relies on the Sobel algorithm for edge detection. Operating on 416 x 416 images and 150 MHz, the system can generate a valid output every 1.17 ms. The valid output consists of the number of present lanes, the current lane index, as well as its right and left boundaries. Additionally, the automated light and temperature control units in the proposed system enhance its adaptability to the surrounding environmental conditions.

cs.CV↗

arXiv2025

Towards Automated Regulatory Compliance Verification in Financial Auditing with Large Language Models

The auditing of financial documents, historically a labor-intensive process, stands on the precipice of transformation. AI-driven solutions have made inroads into streamlining this process by recommending pertinent text passages from financial reports to align with the legal requirements of accounting standards. However, a glaring limitation remains: these systems commonly fall short in verifying if the recommended excerpts indeed comply with the specific legal mandates. Hence, in this paper, we probe the efficiency of publicly available Large Language Models (LLMs) in the realm of regulatory compliance across different model configurations. We place particular emphasis on comparing cutting-edge open-source LLMs, such as Llama-2, with their proprietary counterparts like OpenAI's GPT models. This comparative analysis leverages two custom datasets provided by our partner PricewaterhouseCoopers (PwC) Germany. We find that the open-source Llama-2 70 billion model demonstrates outstanding performance in detecting non-compliance or true negative occurrences, beating all their proprietary counterparts. Nevertheless, proprietary models such as GPT-4 perform the best in a broad variety of scenarios, particularly in non-English contexts.

cs.CL↗

arXiv2025

Automating Hot-Rolling: Designing an Integrated Mechatronics System for Enhanced Efficiency in Sheet Metal Production

The hot-rolling process is a critical stage in sheet metal production within the heavy steel industry. Traditionally, parameter adjustments such as sheet metal velocity and roll gap are performed manually, leading to inefficiencies and limited precision. This project introduces an integrated mechatronics system designed to automate the control of rolling speed and sheet metal thickness, enhancing efficiency, consistency, and quality. The proposed system consists of a pair of rolls applying compression loads, with a mechanism for gap control, suitable motors and sensors, and dynamic modeling to optimize performance. Through simulation and practical implementation strategies, we demonstrate the feasibility of automating the hot-rolling process. By integrating mechatronics, this solution aims to modernize sheet metal production, improve productivity, and enhance product quality in the steel industry.

eess.SY↗

arXiv2023

Improving Zero-Shot Text Matching for Financial Auditing with Large Language Models

Auditing financial documents is a very tedious and time-consuming process. As of today, it can already be simplified by employing AI-based solutions to recommend relevant text passages from a report for each legal requirement of rigorous accounting standards. However, these methods need to be fine-tuned regularly, and they require abundant annotated data, which is often lacking in industrial environments. Hence, we present ZeroShotALI, a novel recommender system that leverages a state-of-the-art large language model (LLM) in conjunction with a domain-specifically optimized transformer-based text-matching solution. We find that a two-step approach of first retrieving a number of best matching document sections per legal requirement with a custom BERT-based model and second filtering these selections using an LLM yields significant performance improvements over existing approaches.

cs.CL↗

arXiv2021

On the networks of large embeddings

We define a special network that exhibits the large embeddings in any class of similar algebras. With the aid of this network, we introduce a notion of distance that conceivably counts the minimum number of dissimilarities, in a sense, between two given algebras in the class in hand; with the possibility that this distance may take the value $\infty$. We display a number of inspirational examples from different areas of algebra, e.g., group theory and monounary algebras, to show that this research direction can be quite remarkable.

math.GM↗

arXiv2021

DREAMS: Drilling and Extraction Automated System

Drilling and Extraction Automated System (DREAMS) is a fully automated prototype-drilling rig that can drill, extract water and assess subsurface density profiles from simulated lunar and Martian subsurface ice. DREAMS system is developed by the Texas A&M drilling automation team and composed of four main components: 1- tensegrity rig structure, 2- drilling system, 3- water extracting and heating system, and 4- electronic hardware, controls, and machine algorithm. The vertical and rotational movements are controlled by using an Acme rod, stepper, and rotary motor. DREAMS is a unique system and different from other systems presented before in the NASA Rascal-Al competition because 1- It uses the tensegrity structure concept to decrease the system weight, improve mobility, and easier installation in space. 2- It cuts rock layers by using a short bit length connected to drill pipes. This drilling methodology is expected to drill hundreds and thousands of meters below the moon and Martian surfaces without any anticipated problems (not only 1 m.). 3- Drilling, heating, and extraction systems are integrated into one system that can work simultaneously or individually to save time and cost.

cs.RO↗

arXiv2019

Atoms in infinite dimensional free sequence-set algebras

A. Tarski proved that the m-generated free algebra of $\mathrm{CA}_α$, the class of cylindric algebras of dimension $α$, contains exactly $2^m$ zero-dimensional atoms, when $m\ge 1$ is a finite cardinal and $α$ is an arbitrary ordinal. He conjectured that, when $α$ is infinite, there are no more atoms. This conjecture has not been confirmed or denied yet. In this article, we show that Tarski's conjecture is true if $\mathrm{CA}_α$ is replaced by $\mathrm{D}_α$, $\mathrm{G}_α$, but the $m$-generated free $\mathrm{Crs}_α$ algebra is atomless.

math.LO↗

arXiv2018

Geometrical representation theorems for cylindric-type algebras

In this paper, we give new proofs of the celebrated Andréka-Resek-Thompson representability results of certain axiomatized cylindric-like algebras. Such representability results provide completeness theorems for variants of first order logic, that can also be viewed as multi-modal logics. The proofs herein are combinatorial and we also use some techniques from game theory.

math.LO↗

arXiv2018

Stone type representation theorems via games

The classes of relativized relation algebras (whose units are not necessarily transitive as binary relations) are known to be finitely axiomatizable. In this article, we give a new proof for this fact that is easier and more transparent than the original proofs. We give direct constructions for all cases, whereas the original proofs reduced the problem to only one case. The proof herein is combinatorial and it uses some techniques from game theory.

math.LO↗

arXiv2018

Distances between formal theories

In the literature, there have been several methods and definitions for working out if two theories are "equivalent" (essentially the same) or not. In this article, we do something subtler. We provide means to measure distances (and explore connections) between formal theories. We introduce two main notions for such distances. The first one is that of \textit{axiomatic distance}, but we argue that it might be of limited interest. The more interesting and widely applicable notion is that of \textit{conceptual distance} which measures the minimum number of concepts that distinguish two theories. For instance, we use conceptual distance to show that relativistic and classical kinematics are distinguished by one concept only. We also develop further notions of distance, and we include a number of suggestions for applying and extending our project.

math.LO↗

arXiv2018

First order logic without equality on relativized semantics

Let $α\geq 2$ be any ordinal. We consider the class $\mathsf{Drs}_α$ of relativized diagonal free set algebras of dimension $α$. With same technique, we prove several important results concerning this class. Among these results, we prove that almost all free algebras of $\mathsf{Drs}_α$ are atomless, and none of these free algebras contains zero-dimensional elements other than zero and top element. The class $\mathsf{Drs}_α$ corresponds to first order logic, without equality symbol, with $α$-many variables and on relativized semantics. Hence, in this variation of first order logic, there is no finitely axiomatizable, complete and consistent theory.

math.LO↗

arXiv2017

General normal forms for any additive logic

In this article, we define general normal forms for any logic that has propositional part and whose non-propositional connectives distribute over the finite disjunctions. We do not require the non-propositional connectives to be closed on the set of formulas, so our normal forms cover logics with partial connectives too. We also show that most of the known normal forms in the literature are in fact particular cases of our general forms. These general normal forms are natural improvement of the distributive normal forms of J. Hintikka and their modal analogues, e.g. [Anderson] and [Fine].

math.LO↗

arXiv2015

Weak Godel's incompleteness property for some decidable versions of first order logic

The founding of the theory of cylindric algebras, by Alfred Tarski, was a conscious effort to create algebras out of first order predicate calculus. Let $n\inω$. The classes of non-commutative cylindric algebras ($NCA_n$) and weakened cylindric algebras ($WCA_n$) were shown, by István Németi, to be examples of decidable versions of first order logic with $n$ variables. In this article, we give new proofs for the decidability of the equational theories of these classes. We also give an answer to the open problem, posed by Németi in 1985, addressing the atomicity of the finitely generated free algebras of these classes. We prove that all the finitely generated free algebras of the varieties $NCA_n$ and $WCA_n$ are not atomic. In other words, we prove that the corresponding versions of first order logic have weak Gödel's incompleteness property.

math.LO↗

arXiv2015

Weak Godel's incompleteness property for some decidable versions of the calculus of relations

Relativization is one of the central topics in the study of algebras of relations. Some relativized relation algebras behave much nicer than the original relation algebras. In this paper, we study the atomicity of the finitely generated free algebras of these nice classes of relativized relation algebras. In particular, we give an answer for the open problem, posed by I. Nemeti in 1985, which asks whether the finitely generated free algebras of the class of the weak associative relation algebras WA are atomic or not.

math.LO↗

arXiv2013

Building relativized representations using games

We prove the celebrated representation theorem of Andreka-Resek-Thompson, together with its polyadic analogue by Ferenczi, using games as introduced in algebraic logic by Hirsch and Hodkinson. We also show that atomic algebras are completely representable and that all such varieties of relativized set algebras have the strong amalgmation property.

math.LO↗