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

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

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

     Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if

 the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are  introduced and given some  properties .

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored. A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure. Pharmacological

An anal fissure which does not heal with conservative measures as sits baths and laxatives is a chronic anal fissure. Physiologically, it is the high resting tone of the internal anal sphincter that chiefly interferes with the healing process of these fissures. Until now, the gold standard treatment modality is surgery, either digital anal dilatation or lateral sphincterotomy. However, concerns have been raised about the incidence of faecal incontinence after surgery. Therefore, pharmacological means to treat chronic anal fissures have been explored.A Medline and pub med database search from 1986-2012 was conducted to perform a literature search for articles relating to the non-surgical treatment of chronic anal fissure.Pharmacological s

تهدف هذه الدراسة للتعرف على السياسات اإلاسرائيلية المتبعة على الارض والمتمثلة في االاستيطان
الاستعماري والطرق التفافية، ومصادرة الاراضي وجدار الضم والتوسع العنصري، بالاضافة إلى التصنيف
الاداري للمناطق في الضفة الغربية حسب ما جاء في اتفاقية أوسلو، والتي من شأنها التأثير على تلك
المناطق، وال سيما قطاع اإلسكان الذي يعد من أهم القطاعات التي تتر كب وبالتحديد في منطقة الدراسة،
وسوف تحاول هذه الدراسة تس

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric