Search results for: Laplacian score
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 1965

Search results for: Laplacian score

1965 Extremal Laplacian Energy of Threshold Graphs

Authors: Seyed Ahmad Mojallal

Abstract:

Let G be a connected threshold graph of order n with m edges and trace T. In this talk we give a lower bound on Laplacian energy in terms of n, m, and T of G. From this we determine the threshold graphs with the first four minimal Laplacian energies. We also list the first 20 minimal Laplacian energies among threshold graphs. Let σ=σ(G) be the number of Laplacian eigenvalues greater than or equal to average degree of graph G. Using this concept, we obtain the threshold graphs with the largest and the second largest Laplacian energies.

Keywords: Laplacian eigenvalues, Laplacian energy, threshold graphs, extremal graphs

Procedia PDF Downloads 358
1964 Bounds on the Laplacian Vertex PI Energy

Authors: Ezgi Kaya, A. Dilek Maden

Abstract:

A topological index is a number related to graph which is invariant under graph isomorphism. In theoretical chemistry, molecular structure descriptors (also called topological indices) are used for modeling physicochemical, pharmacologic, toxicologic, biological and other properties of chemical compounds. Let G be a graph with n vertices and m edges. For a given edge uv, the quantity nu(e) denotes the number of vertices closer to u than v, the quantity nv(e) is defined analogously. The vertex PI index defined as the sum of the nu(e) and nv(e). Here the sum is taken over all edges of G. The energy of a graph is defined as the sum of the eigenvalues of adjacency matrix of G and the Laplacian energy of a graph is defined as the sum of the absolute value of difference of laplacian eigenvalues and average degree of G. In theoretical chemistry, the π-electron energy of a conjugated carbon molecule, computed using the Hückel theory, coincides with the energy. Hence results on graph energy assume special significance. The Laplacian matrix of a graph G weighted by the vertex PI weighting is the Laplacian vertex PI matrix and the Laplacian vertex PI eigenvalues of a connected graph G are the eigenvalues of its Laplacian vertex PI matrix. In this study, Laplacian vertex PI energy of a graph is defined of G. We also give some bounds for the Laplacian vertex PI energy of graphs in terms of vertex PI index, the sum of the squares of entries in the Laplacian vertex PI matrix and the absolute value of the determinant of the Laplacian vertex PI matrix.

Keywords: energy, Laplacian energy, laplacian vertex PI eigenvalues, Laplacian vertex PI energy, vertex PI index

Procedia PDF Downloads 208
1963 Normalized Laplacian Eigenvalues of Graphs

Authors: Shaowei Sun

Abstract:

Let G be a graph with vertex set V(G)={v_1,v_2,...,v_n} and edge set E(G). For any vertex v belong to V(G), let d_v denote the degree of v. The normalized Laplacian matrix of the graph G is the matrix where the non-diagonal (i,j)-th entry is -1/(d_id_j) when vertex i is adjacent to vertex j and 0 when they are not adjacent, and the diagonal (i,i)-th entry is the di. In this paper, we discuss some bounds on the largest and the second smallest normalized Laplacian eigenvalue of trees and graphs. As following, we found some new bounds on the second smallest normalized Laplacian eigenvalue of tree T in terms of graph parameters. Moreover, we use Sage to give some conjectures on the second largest and the third smallest normalized eigenvalues of graph.

Keywords: graph, normalized Laplacian eigenvalues, normalized Laplacian matrix, tree

Procedia PDF Downloads 304
1962 The Second Smallest Eigenvalue of Complete Tripartite Hypergraph

Authors: Alfi Y. Zakiyyah, Hanni Garminia, M. Salman, A. N. Irawati

Abstract:

In the terminology of the hypergraph, there is a relation with the terminology graph. In the theory of graph, the edges connected two vertices. In otherwise, in hypergraph, the edges can connect more than two vertices. There is representation matrix of a graph such as adjacency matrix, Laplacian matrix, and incidence matrix. The adjacency matrix is symmetry matrix so that all eigenvalues is real. This matrix is a nonnegative matrix. The all diagonal entry from adjacency matrix is zero so that the trace is zero. Another representation matrix of the graph is the Laplacian matrix. Laplacian matrix is symmetry matrix and semidefinite positive so that all eigenvalues are real and non-negative. According to the spectral study in the graph, some that result is generalized to hypergraph. A hypergraph can be represented by a matrix such as adjacency, incidence, and Laplacian matrix. Throughout for this term, we use Laplacian matrix to represent a complete tripartite hypergraph. The aim from this research is to determine second smallest eigenvalues from this matrix and find a relation this eigenvalue with the connectivity of that hypergraph.

Keywords: connectivity, graph, hypergraph, Laplacian matrix

Procedia PDF Downloads 450
1961 Kirchoff Type Equation Involving the p-Laplacian on the Sierpinski Gasket Using Nehari Manifold Technique

Authors: Abhilash Sahu, Amit Priyadarshi

Abstract:

In this paper, we will discuss the existence of weak solutions of the Kirchhoff type boundary value problem on the Sierpinski gasket. Where S denotes the Sierpinski gasket in R² and S₀ is the intrinsic boundary of the Sierpinski gasket. M: R → R is a positive function and h: S × R → R is a suitable function which is a part of our main equation. ∆p denotes the p-Laplacian, where p > 1. First of all, we will define a weak solution for our problem and then we will show the existence of at least two solutions for the above problem under suitable conditions. There is no well-known concept of a generalized derivative of a function on a fractal domain. Recently, the notion of differential operators such as the Laplacian and the p-Laplacian on fractal domains has been defined. We recall the result first then we will address the above problem. In view of literature, Laplacian and p-Laplacian equations are studied extensively on regular domains (open connected domains) in contrast to fractal domains. In fractal domains, people have studied Laplacian equations more than p-Laplacian probably because in that case, the corresponding function space is reflexive and many minimax theorems which work for regular domains is applicable there which is not the case for the p-Laplacian. This motivates us to study equations involving p-Laplacian on the Sierpinski gasket. Problems on fractal domains lead to nonlinear models such as reaction-diffusion equations on fractals, problems on elastic fractal media and fluid flow through fractal regions etc. We have studied the above p-Laplacian equations on the Sierpinski gasket using fibering map technique on the Nehari manifold. Many authors have studied the Laplacian and p-Laplacian equations on regular domains using this Nehari manifold technique. In general Euler functional associated with such a problem is Frechet or Gateaux differentiable. So, a critical point becomes a solution to the problem. Also, the function space they consider is reflexive and hence we can extract a weakly convergent subsequence from a bounded sequence. But in our case neither the Euler functional is differentiable nor the function space is known to be reflexive. Overcoming these issues we are still able to prove the existence of at least two solutions of the given equation.

Keywords: Euler functional, p-Laplacian, p-energy, Sierpinski gasket, weak solution

Procedia PDF Downloads 211
1960 Some New Bounds for a Real Power of the Normalized Laplacian Eigenvalues

Authors: Ayşe Dilek Maden

Abstract:

For a given a simple connected graph, we present some new bounds via a new approach for a special topological index given by the sum of the real number power of the non-zero normalized Laplacian eigenvalues. To use this approach presents an advantage not only to derive old and new bounds on this topic but also gives an idea how some previous results in similar area can be developed.

Keywords: degree Kirchhoff index, normalized Laplacian eigenvalue, spanning tree, simple connected graph

Procedia PDF Downloads 343
1959 Normalized P-Laplacian: From Stochastic Game to Image Processing

Authors: Abderrahim Elmoataz

Abstract:

More and more contemporary applications involve data in the form of functions defined on irregular and topologically complicated domains (images, meshs, points clouds, networks, etc). Such data are not organized as familiar digital signals and images sampled on regular lattices. However, they can be conveniently represented as graphs where each vertex represents measured data and each edge represents a relationship (connectivity or certain affinities or interaction) between two vertices. Processing and analyzing these types of data is a major challenge for both image and machine learning communities. Hence, it is very important to transfer to graphs and networks many of the mathematical tools which were initially developed on usual Euclidean spaces and proven to be efficient for many inverse problems and applications dealing with usual image and signal domains. Historically, the main tools for the study of graphs or networks come from combinatorial and graph theory. In recent years there has been an increasing interest in the investigation of one of the major mathematical tools for signal and image analysis, which are Partial Differential Equations (PDEs) variational methods on graphs. The normalized p-laplacian operator has been recently introduced to model a stochastic game called tug-of-war-game with noise. Part interest of this class of operators arises from the fact that it includes, as particular case, the infinity Laplacian, the mean curvature operator and the traditionnal Laplacian operators which was extensiveley used to models and to solve problems in image processing. The purpose of this paper is to introduce and to study a new class of normalized p-Laplacian on graphs. The introduction is based on the extension of p-harmonious function introduced in as discrete approximation for both infinity Laplacian and p-Laplacian equations. Finally, we propose to use these operators as a framework for solving many inverse problems in image processing.

Keywords: normalized p-laplacian, image processing, stochastic game, inverse problems

Procedia PDF Downloads 485
1958 Fundamental Solutions for Discrete Dynamical Systems Involving the Fractional Laplacian

Authors: Jorge Gonzalez Camus, Valentin Keyantuo, Mahamadi Warma

Abstract:

In this work, we obtain representation results for solutions of a time-fractional differential equation involving the discrete fractional Laplace operator in terms of generalized Wright functions. Such equations arise in the modeling of many physical systems, for example, chain processes in chemistry and radioactivity. The focus is on the linear problem of the simplified Moore - Gibson - Thompson equation, where the discrete fractional Laplacian and the Caputo fractional derivate of order on (0,2] are involved. As a particular case, we obtain the explicit solution for the discrete heat equation and discrete wave equation. Furthermore, we show the explicit solution for the equation involving the perturbed Laplacian by the identity operator. The main tool for obtaining the explicit solution are the Laplace and discrete Fourier transforms, and Stirling's formula. The methodology mainly is to apply both transforms in the equation, to find the inverse of each transform, and to prove that this solution is well defined, using Stirling´s formula.

Keywords: discrete fractional Laplacian, explicit representation of solutions, fractional heat and wave equations, fundamental

Procedia PDF Downloads 177
1957 Electromyography Pattern Classification with Laplacian Eigenmaps in Human Running

Authors: Elnaz Lashgari, Emel Demircan

Abstract:

Electromyography (EMG) is one of the most important interfaces between humans and robots for rehabilitation. Decoding this signal helps to recognize muscle activation and converts it into smooth motion for the robots. Detecting each muscle’s pattern during walking and running is vital for improving the quality of a patient’s life. In this study, EMG data from 10 muscles in 10 subjects at 4 different speeds were analyzed. EMG signals are nonlinear with high dimensionality. To deal with this challenge, we extracted some features in time-frequency domain and used manifold learning and Laplacian Eigenmaps algorithm to find the intrinsic features that represent data in low-dimensional space. We then used the Bayesian classifier to identify various patterns of EMG signals for different muscles across a range of running speeds. The best result for vastus medialis muscle corresponds to 97.87±0.69 for sensitivity and 88.37±0.79 for specificity with 97.07±0.29 accuracy using Bayesian classifier. The results of this study provide important insight into human movement and its application for robotics research.

Keywords: electromyography, manifold learning, ISOMAP, Laplacian Eigenmaps, locally linear embedding

Procedia PDF Downloads 330
1956 Edge Detection in Low Contrast Images

Authors: Koushlendra Kumar Singh, Manish Kumar Bajpai, Rajesh K. Pandey

Abstract:

The edges of low contrast images are not clearly distinguishable to the human eye. It is difficult to find the edges and boundaries in it. The present work encompasses a new approach for low contrast images. The Chebyshev polynomial based fractional order filter has been used for filtering operation on an image. The preprocessing has been performed by this filter on the input image. Laplacian of Gaussian method has been applied on preprocessed image for edge detection. The algorithm has been tested on two test images.

Keywords: low contrast image, fractional order differentiator, Laplacian of Gaussian (LoG) method, chebyshev polynomial

Procedia PDF Downloads 593
1955 Effect of the Birth Order and Arrival of Younger Siblings on the Development of a Child: Evidence from India

Authors: Swati Srivastava, Ashish Kumar Upadhyay

Abstract:

Using longitudinal data from three waves of Young Lives Study and Ordinary Least Square methods, study has investigated the effect of birth order and arrival of younger siblings on child development in India. Study used child’s height for age z-score, weight for age z-score, BMI for age z-score, Peabody Picture Vocabulary Test (PPVT-Score)c, maths score, Early Grade Reading Assessment Test (ERGA) score, and memory score to measure the physical and cognitive development of child during wave-3. Findings suggest that having a high birth order is detrimental for child development and the gap between adjacent siblings is larger for children late in the birth sequences than early in the birth sequences. Study also reported that not only older siblings but arrival of younger siblings before assessment of test also reduces the development of a child. The effects become stronger in case of female children than male children.

Keywords: height for age z-score, weight for age z-score, BMI for z-score, PPVT score, math score, EGRA score, memory score, birth order, siblings, Young Lives Study, India

Procedia PDF Downloads 305
1954 Vehicle to Vehicle Communication: Collision Avoidance Scenarios

Authors: Ahmed Emad, Ahmed Salah, Abdelrahman Magdy, Omar Rashid, Mohammed Adel

Abstract:

This research paper discusses vehicle-to-vehicle technology as an important application of linear algebra. This communication technology represents an efficient and promising application to help to ensure the safety of the drivers by warning them when a crash possibility is close. The major link that combines our topic with linear algebra is the Laplacian matrix. Some main definitions used in the V2V were illustrated, such as VANET and its characteristics. The V2V technology could be applied in different applications with different traffic scenarios and various ways to warn car drivers. These scenarios were simulated programs such as MATLAB and Python to test how the V2V system would respond to the different scenarios and warn the car drivers exposed to the threat of collisions.

Keywords: V2V communication, vehicle to vehicle scenarios, VANET, FCW, EEBL, IMA, Laplacian matrix

Procedia PDF Downloads 119
1953 Existence and Concentration of Solutions for a Class of Elliptic Partial Differential Equations Involving p-Biharmonic Operator

Authors: Debajyoti Choudhuri, Ratan Kumar Giri, Shesadev Pradhan

Abstract:

The perturbed nonlinear Schrodinger equation involving the p-biharmonic and the p-Laplacian operators involving a real valued parameter and a continuous real valued potential function defined over the N- dimensional Euclidean space has been considered. By the variational technique, an existence result pertaining to a nontrivial solution to this non-linear partial differential equation has been proposed. Further, by the Concentration lemma, the concentration of solutions to the same problem defined on the set consisting of those elements where the potential function vanishes as the real parameter approaches to infinity has been addressed.

Keywords: p-Laplacian, p-biharmonic, elliptic PDEs, Concentration lemma, Sobolev space

Procedia PDF Downloads 212
1952 Biologically Inspired Small Infrared Target Detection Using Local Contrast Mechanisms

Authors: Tian Xia, Yuan Yan Tang

Abstract:

In order to obtain higher small target detection accuracy, this paper presents an effective algorithm inspired by the local contrast mechanism. The proposed method can enhance target signal and suppress background clutter simultaneously. In the first stage, a enhanced image is obtained using the proposed Weighted Laplacian of Gaussian. In the second stage, an adaptive threshold is adopted to segment the target. Experimental results on two changeling image sequences show that the proposed method can detect the bright and dark targets simultaneously, and is not sensitive to sea-sky line of the infrared image. So it is fit for IR small infrared target detection.

Keywords: small target detection, local contrast, human vision system, Laplacian of Gaussian

Procedia PDF Downloads 437
1951 The Application of Video Segmentation Methods for the Purpose of Action Detection in Videos

Authors: Nassima Noufail, Sara Bouhali

Abstract:

In this work, we develop a semi-supervised solution for the purpose of action detection in videos and propose an efficient algorithm for video segmentation. The approach is divided into video segmentation, feature extraction, and classification. In the first part, a video is segmented into clips, and we used the K-means algorithm for this segmentation; our goal is to find groups based on similarity in the video. The application of k-means clustering into all the frames is time-consuming; therefore, we started by the identification of transition frames where the scene in the video changes significantly, and then we applied K-means clustering into these transition frames. We used two image filters, the gaussian filter and the Laplacian of Gaussian. Each filter extracts a set of features from the frames. The Gaussian filter blurs the image and omits the higher frequencies, and the Laplacian of gaussian detects regions of rapid intensity changes; we then used this vector of filter responses as an input to our k-means algorithm. The output is a set of cluster centers. Each video frame pixel is then mapped to the nearest cluster center and painted with a corresponding color to form a visual map. The resulting visual map had similar pixels grouped. We then computed a cluster score indicating how clusters are near each other and plotted a signal representing frame number vs. clustering score. Our hypothesis was that the evolution of the signal would not change if semantically related events were happening in the scene. We marked the breakpoints at which the root mean square level of the signal changes significantly, and each breakpoint is an indication of the beginning of a new video segment. In the second part, for each segment from part 1, we randomly selected a 16-frame clip, then we extracted spatiotemporal features using convolutional 3D network C3D for every 16 frames using a pre-trained model. The C3D final output is a 512-feature vector dimension; hence we used principal component analysis (PCA) for dimensionality reduction. The final part is the classification. The C3D feature vectors are used as input to a multi-class linear support vector machine (SVM) for the training model, and we used a multi-classifier to detect the action. We evaluated our experiment on the UCF101 dataset, which consists of 101 human action categories, and we achieved an accuracy that outperforms the state of art by 1.2%.

Keywords: video segmentation, action detection, classification, Kmeans, C3D

Procedia PDF Downloads 50
1950 Construction of Graph Signal Modulations via Graph Fourier Transform and Its Applications

Authors: Xianwei Zheng, Yuan Yan Tang

Abstract:

Classical window Fourier transform has been widely used in signal processing, image processing, machine learning and pattern recognition. The related Gabor transform is powerful enough to capture the texture information of any given dataset. Recently, in the emerging field of graph signal processing, researchers devoting themselves to develop a graph signal processing theory to handle the so-called graph signals. Among the new developing theory, windowed graph Fourier transform has been constructed to establish a time-frequency analysis framework of graph signals. The windowed graph Fourier transform is defined by using the translation and modulation operators of graph signals, following the similar calculations in classical windowed Fourier transform. Specifically, the translation and modulation operators of graph signals are defined by using the Laplacian eigenvectors as follows. For a given graph signal, its translation is defined by a similar manner as its definition in classical signal processing. Specifically, the translation operator can be defined by using the Fourier atoms; the graph signal translation is defined similarly by using the Laplacian eigenvectors. The modulation of the graph can also be established by using the Laplacian eigenvectors. The windowed graph Fourier transform based on these two operators has been applied to obtain time-frequency representations of graph signals. Fundamentally, the modulation operator is defined similarly to the classical modulation by multiplying a graph signal with the entries in each Fourier atom. However, a single Laplacian eigenvector entry cannot play a similar role as the Fourier atom. This definition ignored the relationship between the translation and modulation operators. In this paper, a new definition of the modulation operator is proposed and thus another time-frequency framework for graph signal is constructed. Specifically, the relationship between the translation and modulation operations can be established by the Fourier transform. Specifically, for any signal, the Fourier transform of its translation is the modulation of its Fourier transform. Thus, the modulation of any signal can be defined as the inverse Fourier transform of the translation of its Fourier transform. Therefore, similarly, the graph modulation of any graph signal can be defined as the inverse graph Fourier transform of the translation of its graph Fourier. The novel definition of the graph modulation operator established a relationship of the translation and modulation operations. The new modulation operation and the original translation operation are applied to construct a new framework of graph signal time-frequency analysis. Furthermore, a windowed graph Fourier frame theory is developed. Necessary and sufficient conditions for constructing windowed graph Fourier frames, tight frames and dual frames are presented in this paper. The novel graph signal time-frequency analysis framework is applied to signals defined on well-known graphs, e.g. Minnesota road graph and random graphs. Experimental results show that the novel framework captures new features of graph signals.

Keywords: graph signals, windowed graph Fourier transform, windowed graph Fourier frames, vertex frequency analysis

Procedia PDF Downloads 311
1949 The Keys to Innovation: Defining and Evaluating Attributes that Measure Innovation Capabilities

Authors: Mohammad Samarah, Benjamin Stark, Jennifer Kindle, Langley Payton

Abstract:

Innovation is a key driver for companies, society, and economic growth. However, assessing and measuring innovation for individuals as well as organizations remains difficult. Our i5-Score presented in this study will help to overcome this difficulty and facilitate measuring the innovation potential. The score is based on a framework we call the 5Gs of innovation which defines specific innovation attributes. Those are 1) the drive for long-term goals 2) the audacity to generate new ideas, 3) the openness to share ideas with others, 4) the ability to grow, and 5) the ability to maintain high levels of optimism. To validate the i5-Score, we conducted a study at Florida Polytechnic University. The results show that the i5-Score is a good measure reflecting the innovative mindset of an individual or a group. Thus, the score can be utilized for evaluating, refining and enhancing innovation capabilities.

Keywords: Change Management, Innovation Attributes, Organizational Development, STEM and Venture Creation

Procedia PDF Downloads 132
1948 Predicting Financial Distress in South Africa

Authors: Nikki Berrange, Gizelle Willows

Abstract:

Business rescue has become increasingly popular since its inclusion in the Companies Act of South Africa in May 2011. The Alternate Exchange (AltX) of the Johannesburg Stock Exchange has experienced a marked increase in the number of companies entering business rescue. This study sampled twenty companies listed on the AltX to determine whether Altman’s Z-score model for emerging markets (ZEM) or Taffler’s Z-score model is a more accurate model in predicting financial distress for small to medium size companies in South Africa. The study was performed over three different time horizons; one, two and three years prior to the event of financial distress, in order to determine how many companies each model predicted would be unlikely to succeed as well as the predictive ability and accuracy of the respective models. The study found that Taffler’s Z-score model had a greater ability at predicting financial distress from all three-time horizons.

Keywords: Altman’s ZEM-score, Altman’s Z-score, AltX, business rescue, Taffler’s Z-score

Procedia PDF Downloads 327
1947 The Play Translator’s Score Developing: Methodology for Intercultural Communication

Authors: Akhmylovskaia Larisa, Barysh Andriana

Abstract:

The present paper is introducing the translation score developing methodology and methods in the cross-cultural communication. The ideas and examples presented by the authors illustrate the universal character of translation score developing methods under analysis. Personal experience in the international theatre-making projects, opera laboratories, cross-cultural master-classes, movie and theatre festivals give more opportunities to single out the conditions, forms, means and principles of translation score developing as well as the translator/interpreter’s functions as cultural liaison for multiethnic collaboration.

Keywords: methodology of translation score developing, pre-production, analysis, production, post-production, ethnic scene theory, theatre anthropology, laboratory, master-class, educational project, academic project, Stanislavski terminology meta-language, super-objective, participant observation

Procedia PDF Downloads 291
1946 Biimodal Biometrics System Using Fusion of Iris and Fingerprint

Authors: Attallah Bilal, Hendel Fatiha

Abstract:

This paper proposes the bimodal biometrics system for identity verification iris and fingerprint, at matching score level architecture using weighted sum of score technique. The features are extracted from the pre processed images of iris and fingerprint. These features of a query image are compared with those of a database image to obtain matching scores. The individual scores generated after matching are passed to the fusion module. This module consists of three major steps i.e., normalization, generation of similarity score and fusion of weighted scores. The final score is then used to declare the person as genuine or an impostor. The system is tested on CASIA database and gives an overall accuracy of 91.04% with FAR of 2.58% and FRR of 8.34%.

Keywords: iris, fingerprint, sum rule, fusion

Procedia PDF Downloads 339
1945 Physiotherapy Program for Frozen Shoulder on Pain, Onset of Symptom and Obtaining Modalities

Authors: Narupon Kunbootsri, J. Kraipoj, K. Phandech, P. Sirasaporn

Abstract:

Physiotherapy is one of the treatments for frozen shoulder but there was no data about the treatment of physiotherapy. Moreover, it is question about onset of symptom before physiotherapy program and obtaining physical modalities and delayed start physiotherapy program lead to delayed improvement. Thus the aim of this study was to investigate physiotherapy program for frozen shoulder on pain score, onset of symptom and obtaining physical modalities. A retrospective study design was conducted. 182 medical records of patients with frozen shoulder were reviewed. These frozen shoulders were treated at physiotherapy unit, department of Rehabilitation last 3 years (January, 2014- December, 2016). The data consist of onset of symptom, pain score and obtaining physical modalities were recorded. There was a statistically significant improve in pain score, pretreatment score mean 7.24±1.52 and the last follow up pain score mean 3.88± 1.0 [mean difference 3.18 with 95%CI were [2.45- 3.92]. In addition, the onset of symptoms was 145 days before obtaining physiotherapy program. The physical modalities used frequently were hot pack 14.8% and ultrasound diathermy 13.7%. In conclusion, the retrospective study show physiotherapy program including, hot pack and ultrasound diathermy seem to be useful for frozen shoulder in term of pain score. But onset of symptom is too long to start physiotherapy programs.

Keywords: frozen shoulder, physiotherapy, pain score, onset of symptom, physical modality

Procedia PDF Downloads 148
1944 Inequality for Doubly Warped Product Manifolds

Authors: Morteza Faghfouri

Abstract:

In this paper we establish a general inequality involving the Laplacian of the warping functions and the squared mean curvature of any doubly warped product isometrically immersed in a Riemannian manifold.

Keywords: integral submanifolds, S-space forms, doubly warped product, inequality

Procedia PDF Downloads 262
1943 Clinical Prediction Score for Ruptured Appendicitis In ED

Authors: Thidathit Prachanukool, Chaiyaporn Yuksen, Welawat Tienpratarn, Sorravit Savatmongkorngul, Panvilai Tangkulpanich, Chetsadakon Jenpanitpong, Yuranan Phootothum, Malivan Phontabtim, Promphet Nuanprom

Abstract:

Background: Ruptured appendicitis has a high morbidity and mortality and requires immediate surgery. The Alvarado Score is used as a tool to predict the risk of acute appendicitis, but there is no such score for predicting rupture. This study aimed to developed the prediction score to determine the likelihood of ruptured appendicitis in an Asian population. Methods: This study was diagnostic, retrospectively cross-sectional and exploratory model at the Emergency Medicine Department in Ramathibodi Hospital between March 2016 and March 2018. The inclusion criteria were age >15 years and an available pathology report after appendectomy. Clinical factors included gender, age>60 years, right lower quadrant pain, migratory pain, nausea and/or vomiting, diarrhea, anorexia, fever>37.3°C, rebound tenderness, guarding, white blood cell count, polymorphonuclear white blood cells (PMN)>75%, and the pain duration before presentation. The predictive model and prediction score for ruptured appendicitis was developed by multivariable logistic regression analysis. Result: During the study period, 480 patients met the inclusion criteria; of these, 77 (16%) had ruptured appendicitis. Five independent factors were predictive of rupture, age>60 years, fever>37.3°C, guarding, PMN>75%, and duration of pain>24 hours to presentation. A score > 6 increased the likelihood ratio of ruptured appendicitis by 3.88 times. Conclusion: Using the Ramathibodi Welawat Ruptured Appendicitis Score. (RAMA WeRA Score) developed in this study, a score of > 6 was associated with ruptured appendicitis.

Keywords: predictive model, risk score, ruptured appendicitis, emergency room

Procedia PDF Downloads 141
1942 The FINDRISC Score for Prediabetes and Diabetes Screening in Adult Libyan Males

Authors: Issam M Hajjaji, Adel Tajoury, Salah R Benhamid

Abstract:

The MENA region has the highest prevalence of diabetes in the world. Various risk scores were developed, not all appropriate locally. The objective of this study is to apply the FINDRISC Score to adult Libyan males to determine its significance, sensitivity, specificity and Positive Predictive Values as an initial screening tool for type 2 diabetes, and suggest a cut-off point. Methods: 600 subjects answered the questionnaire at their place of work, and their waist, weight, height & BP were measured. Thereafter, after excluding those with known diabetes, an Oral Glucose Tolerance Test was done. Results: 414 subjects aged 19-78 completed the questionnaire and tests. 35 (8.4%) had impaired glucose tolerance (IGT) and 13 (3.1%) had diabetes (DM). The AUC-ROC for IGT was 0.614 (95% CI: 0.527-0.701), for DM 0.810 (95% CI: 0.709-0.911) and for both 0.689 (95% CI: 0.609-0.769). The Positive Predictive Value for a cut-off score of 5 were 15.5%, 11.7% & 5.7% for both conditions combined, prediabetes & diabetes respectively. The equivalent values for a cut-off score of 8 were 16.1%, 9.0% & 7.7%. The Negative Predictive Values were uniformly above 90%. Conclusions & Recommendations: The FINDRISC Score had a low predictive value for dysglycaemia in this sample and performed at a level of significance for IGT that is similar to other MENA countries, but did better for DM. A larger sample that included women is suggested, with a view of adjusting the Score to suit the local population.

Keywords: diabetes, FINDRISK, Libya, prediabetes

Procedia PDF Downloads 100
1941 Level of Gross Motor Development and Age Equivalents of Children 9 Years

Authors: Masri Baharom

Abstract:

The purpose of the study is to identify the age group of children 9 who have experienced delays in gross motor development. Instrument used in this study is Test Gross Motor Development / TGMD-2 (Ulrich, 2000) which was adopted at the international level. Gross motor development data were obtained by video recording (Sony (DRC-SR42 with a 40x optical zoom capability, and software Ultimate Studio 14) on locomotor and manipulative skills. A total n = 192 persons, children of 9 years (9.30 ± .431) at Sekolah Kebangsaan Mutiara Perdana, Bayan Lepas, Penang were involved as subjects. Children age 9 years experienced delays AELS (4.61 ± .69), AEMS (5:52 ± .62) and GMDQ (7.26 ± .2.14). The findings based on descriptive rating indicated that the performance of children age 9 years acquired low levels of AELS, MSS, AEMS and very low in LSS and GMDS.

Keywords: gross motor development score, locomotor standard score, age equivalent locomotor score, manipulative standard score, age equivalent manipulative score

Procedia PDF Downloads 416
1940 Addressing the Oracle Problem: Decentralized Authentication in Blockchain-Based Green Hydrogen Certification

Authors: Volker Wannack

Abstract:

The aim of this paper is to present a concept for addressing the Oracle Problem in the context of hydrogen production using renewable energy sources. The proposed approach relies on the authentication of the electricity used for hydrogen production by multiple surrounding actors with similar electricity generation facilities, which attest to the authenticity of the electricity production. The concept introduces an Authenticity Score assigned to each certificate, as well as a Trust Score assigned to each witness. Each certificate must be attested by different actors with a sufficient Trust Score to achieve an Authenticity Score above a predefined threshold, thereby demonstrating that the produced hydrogen is indeed "green."

Keywords: hydrogen, blockchain, sustainability, structural change

Procedia PDF Downloads 32
1939 Knowledge, Attitude, and Practice of Medical Ethics amongst Paediatric Surgeons and Trainees in Malaysia

Authors: Salehah Tahkin, Norlaila Mustafa, Dayang Anita Abdul Aziz

Abstract:

Knowledge of medical ethics is important to all practitioners so the best care can be delivered to all patients through safe practice. Surgeons are not exceptions to this. Knowledge, attitude, and practice (KAP) of medical ethics among paediatric surgeons and trainees in Malaysia has not been evaluated before. This study aims to determine the level of KAP regarding medical ethics among these groups. This was a cross-sectional study involving three groups of samples, i.e., paediatric surgeons (PS), paediatric surgical trainees (PST), and medical officers with a special interest in paediatric surgery (MO). A validated KAP questionnaire was used. Standard formulas were used to calculate objective indexes for measuring KAP, which were then compared for statistical significance across different sample groups; p less than 0.05 is taken as significant. The index is rated into 5 classes using a score of 0 to 10, i.e., poor (1-2.99), fair (3-4.99), good (5-6.99), very good (7-8.99), and excellent (9-10). There were 117 samples, i.e., PS n=45 (38.5%), PST n=25 (21.3%), and MO n=47 (40.2%). For knowledge, all three groups display a good index score (mean score of 5.44). For attitude, PS and MO also display an index score of good (mean score of 5.81), while the PST index score was fair (4.82). For practice, our study shows a highest score of 7.14 (very good) among PST. However, these differences were not statistically significant (p> 0.05). Conclusion: Training in paediatric surgery must continue to emphasize professionalism and medical ethics education to deliver the best health care services.

Keywords: KAP, medical ethics, paediatric, surgeons, trainees

Procedia PDF Downloads 41
1938 Regional Disparities in the Level of Education in West Bengal

Authors: Nafisa Banu

Abstract:

The present study is an attempt to analyze the regional disparities in the level of education in West Bengal. The data based on secondary sources obtained from a census of India. The study is divided into four sections. The first section presents introductions, objectives and brief descriptions of the study area, second part discuss the methodology and data base, while third and fourth comprise the empirical results, interpretation, and conclusion respectively. For showing the level of educational development, 8 indicators have been selected and Z- score and composite score techniques have been applied. The present study finds out there are large variations of educational level due to various historical, economical, socio-cultural factors of the study area.

Keywords: education, regional disparity, literacy rate, Z-score, composite score

Procedia PDF Downloads 318
1937 Level Of Gross Motor Development And Age Equivalents Of 9-Year-Old Children

Authors: Ahmad Hashim, Masri Baharom

Abstract:

The purpose of the study is to identify the age group of children 9 who have experienced delays in gross motor development. Instrument used in this study is Test Gross Motor Development / TGMD-2 (Ulrich, 2000) which was adopted at the international level. Gross motor development data were obtained by video recording (Sony (DRC-SR42 with a 40x optical zoom capability, and software Ultimate Studio 14) on locomotor and manipulative skills. A total n = 192 persons, children of 9 years (9.30 ± .431) at Sekolah Kebangsaan Mutiara Perdana, Bayan Lepas, Penang were involved as subjects. Children age 9 years experienced delays AELS (4.61 ± .69), AEMS (5:52 ± .62) and GMDQ (7.26 ± .2.14). The findings based on descriptive rating indicated that the performance of children age 9 years acquired low levels of AELS, MSS, AEMS and very low in LSS and GMDS.

Keywords: gross motor development score, locomotor standard score, age equivalent locomotor score, manipulative standard score, age equivalent manipulative score

Procedia PDF Downloads 384
1936 Development of a Novel Score for Early Detection of Hepatocellular Carcinoma in Patients with Hepatitis C Virus

Authors: Hatem A. El-Mezayen, Hossam Darwesh

Abstract:

Background/Aim: Hepatocellular carcinoma (HCC) is often diagnosed at advanced stage where effective therapies are lacking. Identification of new scoring system is needed to discriminate HCC patients from those with chronic liver disease. Based on the link between vascular endothelial growth factor (VEGF) and HCC progression, we aimed to develop a novel score based on combination of VEGF and routine laboratory tests for early prediction of HCC. Methods: VEGF was assayed for HCC group (123), liver cirrhosis group (210) and control group (50) by Enzyme Linked Immunosorbent Assay (ELISA). Data from all groups were retrospectively analyzed including α feto protein (AFP), international normalized ratio (INR), albumin and platelet count, transaminases, and age. Areas under ROC curve were used to develop the score. Results: A novel index named hepatocellular carcinoma-vascular endothelial growth factor score (HCC-VEGF score)=1.26 (numerical constant) + 0.05 ×AFP (U L-1)+0.038 × VEGF(ng ml-1)+0.004× INR –1.02 × Albumin (g l-1)–0.002 × Platelet count × 109 l-1 was developed. HCC-VEGF score produce area under ROC curve of 0.98 for discriminating HCC patients from liver cirrhosis with sensitivity of 91% and specificity of 82% at cut-off 4.4 (ie less than 4.4 considered cirrhosis and greater than 4.4 considered HCC). Conclusion: Hepatocellular carcinoma-VEGF score could replace AFP in HCC screening and follow up of cirrhotic patients.

Keywords: Hepatocellular carcinoma, cirrhosis, HCV, diagnosis, tumor markers

Procedia PDF Downloads 299