A confluence of forces has brought journalism and journalism education to a precipice. The rise of fascism, the advance of digital technology, and the erosion of the economic foundation of news media are disrupting journalism and mass communication (JMC) around the world. Combined with the increasingly globalized nature of journalism and media, these forces are posing extraordinary challenges to and opportunities for journalism and media education. This essay outlines 10 core principles to guide and reinvigorate international JMC education. We offer a concluding principle for JMC education as a foundation for the general education of college students.

Dust is a frequent contributor to health risks and changes in the climate, one of the most dangerous issues facing people today. Desertification, drought, agricultural practices, and sand and dust storms from neighboring regions bring on this issue. Deep learning (DL) long short-term memory (LSTM) based regression was a proposed solution to increase the forecasting accuracy of dust and monitoring. The proposed system has two parts to detect and monitor the dust; at the first step, the LSTM and dense layers are used to build a system using to detect the dust, while at the second step, the proposed Wireless Sensor Networks (WSN) and Internet of Things (IoT) model is used as a forecasting and monitoring model. The experiment DL system

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings

In this paper mildly-regular topological space was introduced via the concept of mildly g-open sets. Many properties of mildly - regular space are investigated and the interactions between mildly-regular space and certain types of topological spaces are considered. Also the concept of strong mildly-regular space was introduced and a main theorem on this space was proved.

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ? W ? M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of ri

In this paper, some relations between the flows and the Enveloping Semi-group were studied. It allows to associate some properties on the topological compactification to any pointed flows. These relations enable us to study a number of the properties of the principles of flows corresponding with using algebric properties. Also in this paper proofs to some theorems of these relations are given.

The main purpose of this work is to introduce some types of fuzzy convergence sequences of operators defined on a standard fuzzy normed space (SFN-spaces) and investigate some properties and relationships between these concepts. Firstly, the definition of weak fuzzy convergence sequence in terms of fuzzy bounded linear functional is given. Then the notions of weakly and strongly fuzzy convergence sequences of operators  are introduced and essential theorems related to these concepts are proved. In particular, if ( ) is a strongly fuzzy convergent sequence with a limit  where linear operator from complete standard fuzzy normed space  into a standard fuzzy normed space  then  belongs to the set of all fuzzy bounded linear operators

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

In this paper, we present the almost approximately nearly quasi compactly packed (submodules) modules as an application of the almost approximately nearly quasiprime submodule. We give some examples, remarks, and properties of this concept. Also, as the strong form of this concept, we introduce the strongly, almost approximately nearly quasi compactly packed (submodules) modules. Moreover, we present the definitions of almost approximately nearly quasiprime radical submodules and almost approximately nearly quasiprime radical submodules and give some basic properties of these concepts that will be needed in section four of this research. We study these two concepts extensively.

There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com