Design a model of Image Restoration using AI in Digital Image Processing

Image restoration is the process of obtaining a distorted/noise image and giving an approximate clear image of the original image. False focus, motion blur and noise are forms of distortion. Image restoration can be done by reversing the process called Point Extension Function (PSF). In this process, the blurred image is generated by point source imaging and can be used to restore the image lost due to the blur process. Like to form. Modern artificial intelligence (AI) applied to image processing includes facial recognition, object recognition and detection, video, image action, and visual search. It helps to develop smart applications in digital image processing.

PEMBERDAYAAN ANAK PANTI ASUHAN AN-NAHL DAN YAUMIHA DI KABUPATEN SRAGEN MELALUI KETRAMPILAN BETERNAK AYAM RAS PETELUR

IbM activity was held at the An-Nahl and YAUMIHA orphanage Sragen. The method were counseling, training, and mentoring maintenance layer, providing complete equipment, marketing and management administration and composting. The target of outcomes are resulting child in orphanage which economically independent, and sustainable of layer egg production. There were 96 bateray cages, place of feed, nipple drinker, eggtray, 96 Brown Leghorn pullet and layer feed given to orphanage. From the results of quisioner counseling increased the value of correct answers (knowledge increased) after counseling was 219 points compared before the 118 point extension. Peak production of eggs at 30 weeks of layer age of 98%. Sales of perkilo eggs with the price of Rp.17.000-Rp.20.000/kg. Business analysis with a net profit of Rp. 23.000,-per day. Through these activities, students' abilities and skills An-Nahl and YAUMIHA orphanage have increased and are expected to be economically self-sufficient. The next plan is for both the partners increase the population of layer by buying pullet in order to expand the business.<br />Keywords: Layer, Farming Skills, Orphanage, An-Nahl and YAUMIHA

Jordan derivations of generalized one point extensions

For a generalized one-point extension algebra, it is proved that under certain conditions, each Jordan derivation is the sum of a derivation and an anti-derivation. Moreover, we prove that every Jordan derivation of a dual extension algebra is a derivation.

An algebraic approach to binary relations

Several attempts were made to assign to a given binary relation a certain binary operation in order to allow an algebraic approach for investigating binary relations. However, the previous attempts by the first two authors were restricted to the case of so-called directed binary relations. In this paper, this restriction is omitted and a general approach is developed. We assign to every binary relation a partial binary operation in such a way that the properties of the relation can be described by properties of the assigned operation. These properties are expressed mostly in terms of existential or strong identities. The partial binary operation can be extended to an everywhere defined binary operation by means of the so-called one-point extension. This enables us to get a genuine algebraic approach similar to that for directed binary relations.

ONE-POINT CONNECTIFICATIONS

A space $Y$ is called an extension of a space $X$ if $Y$ contains $X$ as a dense subspace. An extension $Y$ of $X$ is called a one-point extension if $Y\setminus X$ is a singleton. Compact extensions are called compactifications and connected extensions are called connectifications. It is well known that every locally compact noncompact space has a one-point compactification (known as the Alexandroff compactification) obtained by adding a point at infinity. A locally connected disconnected space, however, may fail to have a one-point connectification. It is indeed a long-standing question of Alexandroff to characterize spaces which have a one-point connectification. Here we prove that in the class of completely regular spaces, a locally connected space has a one-point connectification if and only if it contains no compact component.

Mine Water Irruption Flooding Spread Route Generation Algorithm Based on Directed Graph

In view of roadway complex spatial relationships, the lack of visual expression in the mine water prevention and control work, this paper gives the water irruption flooding spread generation algorithm. Based on building tree topology from water inrush starting point extension and simulating of water down to spread and water level to rise, the algorithm generates flooding route and establishes water inrush 3D simulation system. It provides scientific basis for developing disaster relief route optimization and emergency rescue decision-making.