The aim of advancements in technologies is to increase scientific development and get the overall human satisfaction and comfortability. One of the active research area in recent years that addresses the above mentioned issues, is the integration of radio frequency identification (RFID) technology into network-based systems. Even though, RFID is considered as a promising technology, it has some bleeding points. This paper identifies seven intertwined deficiencies, namely: remote setting, scalability, power saving, remote and concurrent tracking, reusability, automation, and continuity in work. This paper proposes the construction of a general purpose infrastructure for RFID-based applications (IRFID) to tackle these deficiencies. Finally

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

B3LYP/6-31G, DFT method was applied to hypothetical study the design of six carbon nanotube materials based on [8]circulene, through the use of cyclic polymerization of two and three molecules of [8]circulene. Optimized structures of [8]circulene have saddle-shaped. Design of six carbon nanotubes reactions were done by thermodynamically calculating (Δ S, Δ G and Δ H) and the stability of these hypothetical nanotubes depending on the value of HOMO energy level. Nanotubes obtained have the most efficient gap energy, making them potentially useful for solar cell applications.

In folk medicine there are various medicinal amalgamation possessing hepatoprotective activity. This activity is of significance because several toxins cause liver injury. Hence, many pharmaceutical companies are targeting herbal medicines for the treatment of liver abnormalities and towards evolving a safe and effective formulation with desired route of administration. In current review we have focused on the studies showing hepatoprotective effect using marine compounds and plant derived compounds. Liver disorder, a global health problem, usually include acute or chronic hepatitis, heptoses, and cirrhosis. It may be due to toxic chemicals and certain antibiotics. Uncontrolled consumption of alcohol also affects liver in an unhealthy wa

Photonic Crystal Fiber Interferometers (PCFIs) are greatly used
for sensing applications. This work presents the fabrication and
characterization of a relative humidity sensor based on Mach-
Zehnder Interferometer (MZI), which operates in reflection mode.
The humidity sensor operation based on the adsorption and
desorption of water vapour at the silica-air interface within the PCF.
The fabrication of this sensor is simple, it only includes splicing and
cleaving the PCF with SMF.PCF (LMA-10) with a certain length
spliced to SMF (Corning-28).
The spectrum of PCFI exhibits good sensitivity to humidity
variations. The PCFI response is observed for a range of humidity
values from (27% RH to 85% RH), the positi

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