Earthquakes occur on faults and create new faults. They also occur on  normal, reverse and strike-slip faults. The aim of this work is to suggest a new unified classification of Shallow depth earthquakes based on the faulting styles, and to characterize each class. The characterization criteria include the maximum magnitude, focal depth, b-constant value, return period and relations between magnitude, focal depth and dip of fault plane. Global Centroid Moment Tensor (GCMT) catalog is the source of the used data. This catalog covers the period from Jan.1976 to Dec. 2017. We selected only the shallow (depth less than 70kms) pure, normal, strike-slip and reverse earthquakes (magnitude ≥ 5) and excluded the oblique earthquakes. Th

Any software application can be divided into four distinct interconnected domains namely, problem domain, usage domain, development domain and system domain. A methodology for assistive technology software development is presented here that seeks to provide a framework for requirements elicitation studies together with their subsequent mapping implementing use-case driven object-oriented analysis for component based software architectures. Early feedback on user interface components effectiveness is adopted through process usability evaluation. A model is suggested that consists of the three environments; problem, conceptual, and representational environments or worlds. This model aims to emphasize on the relationship between the objects

This study proposed a biometric-based digital signature scheme proposed for facial recognition. The scheme is designed and built to verify the person’s identity during a registration process and retrieve their public and private keys stored in the database. The RSA algorithm has been used as asymmetric encryption method to encrypt hashes generated for digital documents. It uses the hash function (SHA-256) to generate digital signatures. In this study, local binary patterns histograms (LBPH) were used for facial recognition. The facial recognition method was evaluated on ORL faces retrieved from the database of Cambridge University. From the analysis, the LBPH algorithm achieved 97.5% accuracy; the real-time testing was done on thirty subj

       In this work, a pollution-sensitive Photonic Crystal Fiber (PCF) based on Surface Plasmon Resonance (SPR) technology is designed and implemented for sensing refractive indices and concentrations of polluted  water . The overall construction of the sensor is achieved by splicing short lengths of PCF (ESM-12) solid core on one side with traditional multimode fiber (MMF) and depositing a gold nanofilm of 50nm thickness on the end of the PCF sensor. The PCF- SPR experiment was carried out with various samples of polluted water including(distilled water, draining water, dirty pond water, chemical water, salty  water and oiled water). The location of the resonant wavelength peaks is seen to move to longer wavelengths (red shift)

Abstract:

Background: The alteration of bowel habits, bleeding per-rectum and anemia were common features in both groups in this study, but in young patients there was a delay of 6 months between the presenting symptoms and the definitive diagnosis because the disease was not suspected and investigated in them. The most common site for the tumors in young patients was the rectum and in patients above the age of 40 years was the Sigmoid.

The pathological finding showed that classification of the colorectal tumors in young patients appear moderately to poorly differentiated adenocarcinoma , this indicate a more malignant course of the disease in young patients.

This study sen

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

Crime is considered as an unlawful activity of all kinds and it is punished by law. Crimes have an impact on a society's quality of life and economic development. With a large rise in crime globally, there is a necessity to analyze crime data to bring down the rate of crime. This encourages the police and people to occupy the required measures and more effectively restricting the crimes. The purpose of this research is to develop predictive models that can aid in crime pattern analysis and thus support the Boston department's crime prevention efforts. The geographical location factor has been adopted in our model, and this is due to its being an influential factor in several situations, whether it is traveling to a specific area or livin

The fact that the signature is widely used as a means of personal verification
emphasizes the need for an automatic verification system. Verification can be
performed either Offline or Online based on the application. Offline systems work on
the scanned image of a signature. In this paper an Offline Verification of handwritten
signatures which use set of simple shape based geometric features. The features used
are Mean, Occupancy Ratio, Normalized Area, Center of Gravity, Pixel density,
Standard Deviation and the Density Ratio. Before extracting the features,
preprocessing of a scanned image is necessary to isolate the signature part and to
remove any spurious noise present. Features Extracted for whole signature

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

The cuneiform images need many processes in order to know their contents
and by using image enhancement to clarify the objects (symbols) founded in the
image. The Vector used for classifying the symbol called symbol structural vector
(SSV) it which is build from the information wedges in the symbol.
The experimental tests show insome numbersand various relevancy including
various drawings in online method. The results are high accuracy in this research,
and methods and algorithms programmed using a visual basic 6.0. In this research
more than one method was applied to extract information from the digital images
of cuneiform tablets, in order to identify most of signs of Sumerian cuneiform.