Search results for: directed acyclic graph
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 978

Search results for: directed acyclic graph

828 Robust Electrical Segmentation for Zone Coherency Delimitation Base on Multiplex Graph Community Detection

Authors: Noureddine Henka, Sami Tazi, Mohamad Assaad

Abstract:

The electrical grid is a highly intricate system designed to transfer electricity from production areas to consumption areas. The Transmission System Operator (TSO) is responsible for ensuring the efficient distribution of electricity and maintaining the grid's safety and quality. However, due to the increasing integration of intermittent renewable energy sources, there is a growing level of uncertainty, which requires a faster responsive approach. A potential solution involves the use of electrical segmentation, which involves creating coherence zones where electrical disturbances mainly remain within the zone. Indeed, by means of coherent electrical zones, it becomes possible to focus solely on the sub-zone, reducing the range of possibilities and aiding in managing uncertainty. It allows faster execution of operational processes and easier learning for supervised machine learning algorithms. Electrical segmentation can be applied to various applications, such as electrical control, minimizing electrical loss, and ensuring voltage stability. Since the electrical grid can be modeled as a graph, where the vertices represent electrical buses and the edges represent electrical lines, identifying coherent electrical zones can be seen as a clustering task on graphs, generally called community detection. Nevertheless, a critical criterion for the zones is their ability to remain resilient to the electrical evolution of the grid over time. This evolution is due to the constant changes in electricity generation and consumption, which are reflected in graph structure variations as well as line flow changes. One approach to creating a resilient segmentation is to design robust zones under various circumstances. This issue can be represented through a multiplex graph, where each layer represents a specific situation that may arise on the grid. Consequently, resilient segmentation can be achieved by conducting community detection on this multiplex graph. The multiplex graph is composed of multiple graphs, and all the layers share the same set of vertices. Our proposal involves a model that utilizes a unified representation to compute a flattening of all layers. This unified situation can be penalized to obtain (K) connected components representing the robust electrical segmentation clusters. We compare our robust segmentation to the segmentation based on a single reference situation. The robust segmentation proves its relevance by producing clusters with high intra-electrical perturbation and low variance of electrical perturbation. We saw through the experiences when robust electrical segmentation has a benefit and in which context.

Keywords: community detection, electrical segmentation, multiplex graph, power grid

Procedia PDF Downloads 51
827 Code Embedding for Software Vulnerability Discovery Based on Semantic Information

Authors: Joseph Gear, Yue Xu, Ernest Foo, Praveen Gauravaran, Zahra Jadidi, Leonie Simpson

Abstract:

Deep learning methods have been seeing an increasing application to the long-standing security research goal of automatic vulnerability detection for source code. Attention, however, must still be paid to the task of producing vector representations for source code (code embeddings) as input for these deep learning models. Graphical representations of code, most predominantly Abstract Syntax Trees and Code Property Graphs, have received some use in this task of late; however, for very large graphs representing very large code snip- pets, learning becomes prohibitively computationally expensive. This expense may be reduced by intelligently pruning this input to only vulnerability-relevant information; however, little research in this area has been performed. Additionally, most existing work comprehends code based solely on the structure of the graph at the expense of the information contained by the node in the graph. This paper proposes Semantic-enhanced Code Embedding for Vulnerability Discovery (SCEVD), a deep learning model which uses semantic-based feature selection for its vulnerability classification model. It uses information from the nodes as well as the structure of the code graph in order to select features which are most indicative of the presence or absence of vulnerabilities. This model is implemented and experimentally tested using the SARD Juliet vulnerability test suite to determine its efficacy. It is able to improve on existing code graph feature selection methods, as demonstrated by its improved ability to discover vulnerabilities.

Keywords: code representation, deep learning, source code semantics, vulnerability discovery

Procedia PDF Downloads 132
826 A Graph SEIR Cellular Automata Based Model to Study the Spreading of a Transmittable Disease

Authors: Natasha Sharma, Kulbhushan Agnihotri

Abstract:

Cellular Automata are discrete dynamical systems which are based on local character and spatial disparateness of the spreading process. These factors are generally neglected by traditional models based on differential equations for epidemic spread. The aim of this work is to introduce an SEIR model based on cellular automata on graphs to imitate epidemic spreading. Distinctively, it is an SEIR-type model where the population is divided into susceptible, exposed, infected and recovered individuals. The results obtained from simulations are in accordance with the spreading behavior of a real time epidemics.

Keywords: cellular automata, epidemic spread, graph, susceptible

Procedia PDF Downloads 438
825 Deep Graph Embeddings for the Analysis of Short Heartbeat Interval Time Series

Authors: Tamas Madl

Abstract:

Sudden cardiac death (SCD) constitutes a large proportion of cardiovascular mortalities, provides little advance warning, and the risk is difficult to recognize based on ubiquitous, low cost medical equipment such as the standard, 12-lead, ten second ECG. Autonomic abnormalities have been shown to be strongly predictive of SCD risk; yet current methods are not trivially applicable to the brevity and low temporal and electrical resolution of standard ECGs. Here, we build horizontal visibility graph representations of very short inter-beat interval time series, and perform unsuper- vised representation learning in order to convert these variable size objects into fixed-length vectors preserving similarity rela- tions. We show that such representations facilitate classification into healthy vs. at-risk patients on two different datasets, the Mul- tiparameter Intelligent Monitoring in Intensive Care II and the PhysioNet Sudden Cardiac Death Holter Database. Our results suggest that graph representation learning of heartbeat interval time series facilitates robust classification even in sequences as short as ten seconds.

Keywords: sudden cardiac death, heart rate variability, ECG analysis, time series classification

Procedia PDF Downloads 212
824 Validation and Interpretation about Precedence Diagram for Start to Finish Relationship by Graph Theory

Authors: Naoki Ohshima, Ken Kaminishi

Abstract:

Four types of dependencies, which are 'Finish-to-start', 'Finish-to-finish', 'Start-to-start' and 'Start-to-finish (S-F)' as logical relationship are modeled based on the definition by 'the predecessor activity is defined as an activity to come before a dependent activity in a schedule' in PMBOK. However, it is found a self-contradiction in the precedence diagram for S-F relationship by PMBOK. In this paper, author would like to validate logical relationship of S-F by Graph Theory and propose a new interpretation of the precedence diagram for S-F relationship.

Keywords: project time management, sequence activity, start-to-finish relationship, precedence diagram, PMBOK

Procedia PDF Downloads 244
823 Spectral Clustering from the Discrepancy View and Generalized Quasirandomness

Authors: Marianna Bolla

Abstract:

The aim of this paper is to compare spectral, discrepancy, and degree properties of expanding graph sequences. As we can prove equivalences and implications between them and the definition of the generalized (multiclass) quasirandomness of Lovasz–Sos (2008), they can be regarded as generalized quasirandom properties akin to the equivalent quasirandom properties of the seminal Chung-Graham-Wilson paper (1989) in the one-class scenario. Since these properties are valid for deterministic graph sequences, irrespective of stochastic models, the partial implications also justify for low-dimensional embedding of large-scale graphs and for discrepancy minimizing spectral clustering.

Keywords: generalized random graphs, multiway discrepancy, normalized modularity spectra, spectral clustering

Procedia PDF Downloads 170
822 Proposing an Architecture for Drug Response Prediction by Integrating Multiomics Data and Utilizing Graph Transformers

Authors: Nishank Raisinghani

Abstract:

Efficiently predicting drug response remains a challenge in the realm of drug discovery. To address this issue, we propose four model architectures that combine graphical representation with varying positions of multiheaded self-attention mechanisms. By leveraging two types of multi-omics data, transcriptomics and genomics, we create a comprehensive representation of target cells and enable drug response prediction in precision medicine. A majority of our architectures utilize multiple transformer models, one with a graph attention mechanism and the other with a multiheaded self-attention mechanism, to generate latent representations of both drug and omics data, respectively. Our model architectures apply an attention mechanism to both drug and multiomics data, with the goal of procuring more comprehensive latent representations. The latent representations are then concatenated and input into a fully connected network to predict the IC-50 score, a measure of cell drug response. We experiment with all four of these architectures and extract results from all of them. Our study greatly contributes to the future of drug discovery and precision medicine by looking to optimize the time and accuracy of drug response prediction.

Keywords: drug discovery, transformers, graph neural networks, multiomics

Procedia PDF Downloads 117
821 Coupling of Reticular and Fuzzy Set Modelling in the Analysis of the Action Chains from Socio-Ecosystem, Case of the Renewable Natural Resources Management in Madagascar

Authors: Thierry Ganomanana, Dominique Hervé, Solo Randriamahaleo

Abstract:

Management of Malagasy renewable natural re-sources allows, in the case of forest, the mobilization of several actors with norms and/or territory. The interaction in this socio-ecosystem is represented by a graph of two different relationships in which most of action chains, from individual activities under the continuous of forest dynamic and discrete interventions by institutional, are also studied. The fuzzy set theory is adapted to graduate the elements of the set Illegal Activities in the space of sanction’s institution by his severity and in the space of degradation of forest by his extent.

Keywords: fuzzy set, graph, institution, renewable resource, system

Procedia PDF Downloads 68
820 Screen Method of Distributed Cooperative Navigation Factors for Unmanned Aerial Vehicle Swarm

Authors: Can Zhang, Qun Li, Yonglin Lei, Zhi Zhu, Dong Guo

Abstract:

Aiming at the problem of factor screen in distributed collaborative navigation of dense UAV swarm, an efficient distributed collaborative navigation factor screen method is proposed. The method considered the balance between computing load and positioning accuracy. The proposed algorithm utilized the factor graph model to implement a distributed collaborative navigation algorithm. The GNSS information of the UAV itself and the ranging information between the UAVs are used as the positioning factors. In this distributed scheme, a local factor graph is established for each UAV. The positioning factors of nodes with good geometric position distribution and small variance are selected to participate in the navigation calculation. To demonstrate and verify the proposed methods, the simulation and experiments in different scenarios are performed in this research. Simulation results show that the proposed scheme achieves a good balance between the computing load and positioning accuracy in the distributed cooperative navigation calculation of UAV swarm. This proposed algorithm has important theoretical and practical value for both industry and academic areas.

Keywords: screen method, cooperative positioning system, UAV swarm, factor graph, cooperative navigation

Procedia PDF Downloads 50
819 Allocation of Mobile Units in an Urban Emergency Service System

Authors: Dimitra Alexiou

Abstract:

In an urban area the allocation placement of an emergency service mobile units, such as ambulances, police patrol must be designed so as to achieve a prompt response to demand locations. In this paper, a partition of a given urban network into distinct sub-networks is performed such that; the vertices in each component are close and simultaneously the difference of the sums of the corresponding population in the sub-networks is almost uniform. The objective here is to position appropriately in each sub-network a mobile emergency unit in order to reduce the response time to the demands. A mathematical model in the framework of graph theory is developed. In order to clarify the corresponding method a relevant numerical example is presented on a small network.

Keywords: graph partition, emergency service, distances, location

Procedia PDF Downloads 466
818 DTI Connectome Changes in the Acute Phase of Aneurysmal Subarachnoid Hemorrhage Improve Outcome Classification

Authors: Sarah E. Nelson, Casey Weiner, Alexander Sigmon, Jun Hua, Haris I. Sair, Jose I. Suarez, Robert D. Stevens

Abstract:

Graph-theoretical information from structural connectomes indicated significant connectivity changes and improved acute prognostication in a Random Forest (RF) model in aneurysmal subarachnoid hemorrhage (aSAH), which can lead to significant morbidity and mortality and has traditionally been fraught by poor methods to predict outcome. This study’s hypothesis was that structural connectivity changes occur in canonical brain networks of acute aSAH patients, and that these changes are associated with functional outcome at six months. In a prospective cohort of patients admitted to a single institution for management of acute aSAH, patients underwent diffusion tensor imaging (DTI) as part of a multimodal MRI scan. A weighted undirected structural connectome was created of each patient’s images using Constant Solid Angle (CSA) tractography, with 176 regions of interest (ROIs) defined by the Johns Hopkins Eve atlas. ROIs were sorted into four networks: Default Mode Network, Executive Control Network, Salience Network, and Whole Brain. The resulting nodes and edges were characterized using graph-theoretic features, including Node Strength (NS), Betweenness Centrality (BC), Network Degree (ND), and Connectedness (C). Clinical (including demographics and World Federation of Neurologic Surgeons scale) and graph features were used separately and in combination to train RF and Logistic Regression classifiers to predict two outcomes: dichotomized modified Rankin Score (mRS) at discharge and at six months after discharge (favorable outcome mRS 0-2, unfavorable outcome mRS 3-6). A total of 56 aSAH patients underwent DTI a median (IQR) of 7 (IQR=8.5) days after admission. The best performing model (RF) combining clinical and DTI graph features had a mean Area Under the Receiver Operator Characteristic Curve (AUROC) of 0.88 ± 0.00 and Area Under the Precision Recall Curve (AUPRC) of 0.95 ± 0.00 over 500 trials. The combined model performed better than the clinical model alone (AUROC 0.81 ± 0.01, AUPRC 0.91 ± 0.00). The highest-ranked graph features for prediction were NS, BC, and ND. These results indicate reorganization of the connectome early after aSAH. The performance of clinical prognostic models was increased significantly by the inclusion of DTI-derived graph connectivity metrics. This methodology could significantly improve prognostication of aSAH.

Keywords: connectomics, diffusion tensor imaging, graph theory, machine learning, subarachnoid hemorrhage

Procedia PDF Downloads 164
817 Top-K Shortest Distance as a Similarity Measure

Authors: Andrey Lebedev, Ilya Dmitrenok, JooYoung Lee, Leonard Johard

Abstract:

Top-k shortest path routing problem is an extension of finding the shortest path in a given network. Shortest path is one of the most essential measures as it reveals the relations between two nodes in a network. However, in many real world networks, whose diameters are small, top-k shortest path is more interesting as it contains more information about the network topology. Many variations to compute top-k shortest paths have been studied. In this paper, we apply an efficient top-k shortest distance routing algorithm to the link prediction problem and test its efficacy. We compare the results with other base line and state-of-the-art methods as well as with the shortest path. Then, we also propose a top-k distance based graph matching algorithm.

Keywords: graph matching, link prediction, shortest path, similarity

Procedia PDF Downloads 337
816 The Role of Defense Mechanisms in Treatment Adherence in Type 2 Diabetes Mellitus: An Exploratory Study

Authors: F. Marchini, A. Caputo, J. Balonan, F. Fedele, A. Napoli, V. Langher

Abstract:

Aim: The present study aims to explore the specific role of defense mechanisms in persons with type 2 diabetes mellitus in treatment adherence. Materials and methods: A correlational study design was employed. Thirty-two persons with type 2 diabetes mellitus were enrolled and assessed with Defense Mechanism Inventory, Beck Depression Inventory-II, Toronto Alexithymia Scale and Self-Care Inventory-Revised. Bivariate correlation and two-step regression analyses were performed. Results: Treatment adherence negatively correlates with hetero-directed hostility (r= -.537; p < .01), whereas it is positively associated with principalization (r= .407; p < .05). These two defense mechanisms overall explain an incremental variance of 26.9% in treatment adherence (ΔF=4.189, df1=2, df2 =21, p < .05), over and above the control variables for depression and alexithymia. However, only higher hetero-directed hostility is found to be a solid predictor of a decreased treatment adherence (β=-.497, p < .05). Conclusions: Despite providing preliminary results, this pilot study highlights the original contribution of defense mechanisms in adherence to type 2 diabetes regimens. Specifically, hetero-directed hostility may relate to an unconscious process, according to which disease-related painful feelings are displaced onto care relationships with negative impacts on adherence.

Keywords: alexithymia, defense mechanisms, treatment adherence, type 2 diabetes mellitus

Procedia PDF Downloads 295
815 Classification of Equations of Motion

Authors: Amritpal Singh Nafria, Rohit Sharma, Md. Shami Ansari

Abstract:

Up to now only five different equations of motion can be derived from velocity time graph without needing to know the normal and frictional forces acting at the point of contact. In this paper we obtained all possible requisite conditions to be considering an equation as an equation of motion. After that we classified equations of motion by considering two equations as fundamental kinematical equations of motion and other three as additional kinematical equations of motion. After deriving these five equations of motion, we examine the easiest way of solving a wide variety of useful numerical problems. At the end of the paper, we discussed the importance and educational benefits of classification of equations of motion.

Keywords: velocity-time graph, fundamental equations, additional equations, requisite conditions, importance and educational benefits

Procedia PDF Downloads 761
814 An Efficient Hardware/Software Workflow for Multi-Cores Simulink Applications

Authors: Asma Rebaya, Kaouther Gasmi, Imen Amari, Salem Hasnaoui

Abstract:

Over these last years, applications such as telecommunications, signal processing, digital communication with advanced features (Multi-antenna, equalization..) witness a rapid evaluation accompanied with an increase of user exigencies in terms of latency, the power of computation… To satisfy these requirements, the use of hardware/software systems is a common solution; where hardware is composed of multi-cores and software is represented by models of computation, synchronous data flow (SDF) graph for instance. Otherwise, the most of the embedded system designers utilize Simulink for modeling. The issue is how to simplify the c code generation, for a multi-cores platform, of an application modeled by Simulink. To overcome this problem, we propose a workflow allowing an automatic transformation from the Simulink model to the SDF graph and providing an efficient schedule permitting to optimize the number of cores and to minimize latency. This workflow goes from a Simulink application and a hardware architecture described by IP.XACT language. Based on the synchronous and hierarchical behavior of both models, the Simulink block diagram is automatically transformed into an SDF graph. Once this process is successfully achieved, the scheduler calculates the optimal cores’ number needful by minimizing the maximum density of the whole application. Then, a core is chosen to execute a specific graph task in a specific order and, subsequently, a compatible C code is generated. In order to perform this proposal, we extend Preesm, a rapid prototyping tool, to take the Simulink model as entry input and to support the optimal schedule. Afterward, we compared our results to this tool results, using a simple illustrative application. The comparison shows that our results strictly dominate the Preesm results in terms of number of cores and latency. In fact, if Preesm needs m processors and latency L, our workflow need processors and latency L'< L.

Keywords: hardware/software system, latency, modeling, multi-cores platform, scheduler, SDF graph, Simulink model, workflow

Procedia PDF Downloads 243
813 Synchrotron Radiation and Inverse Compton Scattering in Astrophysical Plasma

Authors: S. S. Sathiesh

Abstract:

The aim of this project is to study the radiation mechanism synchrotron and Inverse Compton scattering. Theoretically, we discussed spectral energy distribution for both. Programming is done for plotting the graph of Power-law spectrum for synchrotron Radiation using fortran90. The importance of power law spectrum was discussed and studied to infer its physical parameters from the model fitting. We also discussed how to infer the physical parameters from the theoretically drawn graph, we have seen how one can infer B (magnetic field of the source), γ min, γ max, spectral indices (p1, p2) while fitting the curve to the observed data.

Keywords: blazars/quasars, beaming, synchrotron radiation, Synchrotron Self Compton, inverse Compton scattering, mrk421

Procedia PDF Downloads 396
812 Stock Market Prediction Using Convolutional Neural Network That Learns from a Graph

Authors: Mo-Se Lee, Cheol-Hwi Ahn, Kee-Young Kwahk, Hyunchul Ahn

Abstract:

Over the past decade, deep learning has been in spotlight among various machine learning algorithms. In particular, CNN (Convolutional Neural Network), which is known as effective solution for recognizing and classifying images, has been popularly applied to classification and prediction problems in various fields. In this study, we try to apply CNN to stock market prediction, one of the most challenging tasks in the machine learning research. In specific, we propose to apply CNN as the binary classifier that predicts stock market direction (up or down) by using a graph as its input. That is, our proposal is to build a machine learning algorithm that mimics a person who looks at the graph and predicts whether the trend will go up or down. Our proposed model consists of four steps. In the first step, it divides the dataset into 5 days, 10 days, 15 days, and 20 days. And then, it creates graphs for each interval in step 2. In the next step, CNN classifiers are trained using the graphs generated in the previous step. In step 4, it optimizes the hyper parameters of the trained model by using the validation dataset. To validate our model, we will apply it to the prediction of KOSPI200 for 1,986 days in eight years (from 2009 to 2016). The experimental dataset will include 14 technical indicators such as CCI, Momentum, ROC and daily closing price of KOSPI200 of Korean stock market.

Keywords: convolutional neural network, deep learning, Korean stock market, stock market prediction

Procedia PDF Downloads 407
811 Managing Cognitive Load in Accounting: An Analysis of Three Instructional Designs in Financial Accounting

Authors: Seedwell Sithole

Abstract:

One of the persistent problems in accounting education is how to effectively support students’ learning. A promising technique to this issue is to investigate the extent that learning is determined by the design of instructional material. This study examines the academic performance of students using three instructional designs in financial accounting. Student’s performance scores and reported mental effort ratings were used to determine the instructional effectiveness. The findings of this study show that accounting students prefer graph and text designs that are integrated. The results suggest that spatially separated graph and text presentations in accounting should be reorganized to align with the requirements of human cognitive architecture.

Keywords: accounting, cognitive load, education, instructional preferences, students

Procedia PDF Downloads 117
810 CTHTC: A Convolution-Backed Transformer Architecture for Temporal Knowledge Graph Embedding with Periodicity Recognition

Authors: Xinyuan Chen, Mohd Nizam Husen, Zhongmei Zhou, Gongde Guo, Wei Gao

Abstract:

Temporal Knowledge Graph Completion (TKGC) has attracted increasing attention for its enormous value; however, existing models lack capabilities to capture both local interactions and global dependencies simultaneously with evolutionary dynamics, while the latest achievements in convolutions and Transformers haven't been employed in this area. What’s more, periodic patterns in TKGs haven’t been fully explored either. To this end, a multi-stage hybrid architecture with convolution-backed Transformers is introduced in TKGC tasks for the first time combining the Hawkes process to model evolving event sequences in a continuous-time domain. In addition, the seasonal-trend decomposition is adopted to identify periodic patterns. Experiments on six public datasets are conducted to verify model effectiveness against state-of-the-art (SOTA) methods. An extensive ablation study is carried out accordingly to evaluate architecture variants as well as the contributions of independent components in addition, paving the way for further potential exploitation. Besides complexity analysis, input sensitivity and safety challenges are also thoroughly discussed for comprehensiveness with novel methods.

Keywords: temporal knowledge graph completion, convolution, transformer, Hawkes process, periodicity

Procedia PDF Downloads 54
809 New Kinetic Effects in Spatial Distribution of Electron Flux and Excitation Rates in Glow Discharge Plasmas in Middle and High Pressures

Authors: Kirill D. Kapustin, Mikhail B. Krasilnikov, Anatoly A. Kudryavtsev

Abstract:

Physical formation mechanisms of differential electron fluxes is high pressure positive column gas discharge are discussed. It is shown that the spatial differential fluxes of the electrons are directed both inward and outward depending on the energy relaxation law. In some cases the direction of energy differential flux at intermediate energies (5-10eV) in whole volume, except region near the wall, appeared to be down directed, so electron in this region dissipate more energy than gain from axial electric field. Paradoxical behaviour of electron flux in spatial-energy space is presented.

Keywords: plasma kinetics, electron distribution function, excitation and radiation rates, local and nonlocal EDF

Procedia PDF Downloads 379
808 Moving on or Deciding to Let Go: The Effects of Emotional and Decisional Forgiveness on Intentional Forgetting

Authors: Saima Noreen, Malcolm D. MacLeod

Abstract:

Different types of forgiveness (emotional and decisional) have been shown to have differential effects on incidental forgetting of information related to a prior transgression. The present study explored the extent to which emotional and decisional forgiveness also influenced intentional forgetting; that is, the extent to which forgetting occurs following an explicit instruction to forget. Using the List-Method Directed Forgetting (LMDF) paradigm, 236 participants were presented with a hypothetical transgression and then assigned to an emotional forgiveness, a decisional forgiveness, or a no-forgiveness manipulation. Participants were then presented with two-word lists each comprising transgression-relevant and transgression-irrelevant words. Following the presentation of the first list, participants were told to either remember or forget the previously learned list of words. Participants in the emotional forgiveness condition were found to remember fewer relevant and more irrelevant transgression-related words, while the opposite was true for both decisional forgiveness and no-forgiveness conditions. Furthermore, when directed to forget words in List 1, participants in the decisional and no-forgiveness conditions were less able to forget relevant transgression-related words in comparison to participants in the emotional forgiveness condition. This study suggests that emotional forgiveness plays a pivotal role in the intentional forgetting of transgression-related information. The potential implications of these findings for coping with unpleasant incidents will be considered.

Keywords: decisional forgiveness, directed forgetting, emotional forgiveness, executive control, forgiveness

Procedia PDF Downloads 210
807 Modeling and Simulation of Underwater Flexible Manipulator as Raleigh Beam Using Bond Graph

Authors: Sumit Kumar, Sunil Kumar, Chandan Deep Singh

Abstract:

This paper presents modeling and simulation of flexible robot in an underwater environment. The underwater environment completely contrasts with ground or space environment. The robot in an underwater situation is subjected to various dynamic forces like buoyancy forces, hydrostatic and hydrodynamic forces. The underwater robot is modeled as Rayleigh beam. The developed model further allows estimating the deflection of tip in two directions. The complete dynamics of the underwater robot is analyzed, which is the main focus of this investigation. The control of robot trajectory is not discussed in this paper. Simulation is performed using Symbol Shakti software.

Keywords: bond graph modeling, dynamics. modeling, rayleigh beam, underwater robot

Procedia PDF Downloads 560
806 Asymmetric Synthesis of β- and γ-Borylated Amines via Rh-Catalyzed Hydroboration of Allylamine Derivatives

Authors: Rukshani Wickrama-Arachchi, Tanner Metz, James M. Takacs

Abstract:

Amines bearing γ-stereocenters are important structural motifs found in many biologically active compounds. Regioselective Rh-catalyzed asymmetric hydroboration of acyclic allylamines is used to synthesize amines bearing chiral β- and γ-boronic esters yields up to 70% with 98:2 enantioselectivity. The major enantiomeric outcome can be independent of starting alkene geometry, revealing that cis/trans-isomerization of alkene can occur before hydroboration. Stereospecific transformations of the newly generated C-B bond illustrates the utility of these chiral synthons.

Keywords: allylamines, borylated amines, chiral amines, hydroboration, rhodium-catalysis

Procedia PDF Downloads 162
805 Programmed Speech to Text Summarization Using Graph-Based Algorithm

Authors: Hamsini Pulugurtha, P. V. S. L. Jagadamba

Abstract:

Programmed Speech to Text and Text Summarization Using Graph-based Algorithms can be utilized in gatherings to get the short depiction of the gathering for future reference. This gives signature check utilizing Siamese neural organization to confirm the personality of the client and convert the client gave sound record which is in English into English text utilizing the discourse acknowledgment bundle given in python. At times just the outline of the gathering is required, the answer for this text rundown. Thus, the record is then summed up utilizing the regular language preparing approaches, for example, solo extractive text outline calculations

Keywords: Siamese neural network, English speech, English text, natural language processing, unsupervised extractive text summarization

Procedia PDF Downloads 184
804 Balancing Independence and Guidance: Cultivating Student Agency in Blended Learning

Authors: Yeo Leng Leng

Abstract:

Blended learning, with its combination of online and face-to-face instruction, presents a unique set of challenges and opportunities in terms of cultivating student agency. While it offers flexibility and personalized learning pathways, it also demands a higher degree of self-regulation and motivation from students. This paper presents the design of blended learning in a Chinese lesson and discusses the framework involved. It also talks about the Edtech tools adopted to engage the students. Some of the students’ works will be showcased. A qualitative case study research method was employed in this paper to find out more about students’ learning experiences and to give them a voice. The purpose is to seek improvement in the blended learning design of the Chinese lessons and to encourage students’ self-directed learning.

Keywords: blended learning, student agency, ed-tech tools, self-directed learning

Procedia PDF Downloads 43
803 Effect of Facilitation in a Problem-Based Environment on the Metacognition, Motivation and Self-Directed Learning in Nursing: A Quasi-Experimental Study among Nurse Students in Tanzania

Authors: Walter M. Millanzi, Stephen M. Kibusi

Abstract:

Background: Currently, there has been a progressive shortage not only to the number but also the quality of medical practitioners for the most of nursing. Despite that, those who are present exhibit unethical and illegal practices, under standard care and malpractices. The concern is raised in the ways they are prepared, or there might be something missing in nursing curricula or how it is delivered. There is a need for transforming or testing new teaching modalities to enhance competent health workforces. Objective: to investigate the Effect of Facilitation in a Problem-based Environment (FPBE) on metacognition, self-directed learning and learning motivation to undergraduate nurse student in Tanzanian higher learning institutions. Methods: quasi-experimental study (quantitative research approach). A purposive sampling technique was employed to select institutions and achieving a sample size of 401 participants (interventional = 134 and control = 267). Self-administered semi-structured questionnaire; was the main data collection methods and the Statistical Package for Service Solution (v. 20) software program was used for data entry, data analysis, and presentations. Results: The pre-post test results between groups indicated noticeably significant change on metacognition in an intervention (M = 1.52, SD = 0.501) against the control (M = 1.40, SD = 0.490), t (399) = 2.398, p < 0.05). SDL in an intervention (M = 1.52, SD = 0.501) against the control (M = 1.40, SD = 0.490), t (399) = 2.398, p < 0.05. Motivation to learn in an intervention (M = 62.67, SD = 14.14) and the control (n = 267, M = 57.75), t (399) = 2.907, p < 0.01). A FPBE teaching pedagogy, was observed to be effective on the metacognition (AOR = 1.603, p < 0.05), SDL (OR = 1.729, p < 0.05) and Intrinsic motivation in learning (AOR = 1.720, p < 0.05) against conventional teaching pedagogy. Needless, was less likely to enhance Extrinsic motivation (AOR = 0.676, p > 0.05) and Amotivation (AOR = 0.538, p > 0.05). Conclusion and recommendation: FPBE teaching pedagogy, can improve student’s metacognition, self-directed learning and intrinsic motivation to learn among nurse students. Nursing curricula developers should incorporate it to produce 21st century competent and qualified nurses.

Keywords: facilitation, metacognition, motivation, self-directed

Procedia PDF Downloads 157
802 A Self-Directed Home Yoga Program for Women with Breast Cancer during Chemotherapy

Authors: Hiroko Komatsu, Kaori Yagasaki

Abstract:

Background: Cancer-related cognitive impairment is a common problem seen in cancer patients undergoing chemotherapy. Physical activity may show beneficial effects on the cognitive function in such patients. Therefore, we have developed a self-directed home yoga program for cancer patients with cognitive symptoms during chemotherapy. This program involves a DVD presenting a combination of yoga courses based on patient preferences to be practiced at home. This study was performed to examine the feasibility of this program. In addition, we also examined changes in cognitive function and quality of life (QOL) in these patients participating in the program. Methods: This prospective feasibility study was conducted in a 500-bed general hospital in Tokyo, Japan. The study population consisted of breast cancer patients undergoing chemotherapy as the initial therapy. This feasibility study used a convenience sample with estimation of recruitment rate in a single facility with the availability of trained nurses and physicians to ensure safe yoga intervention. The aim of the intervention program was to improve cognitive function by means of both physical and mental activation via yoga, consisting of physical practice, breathing exercises, and meditation. Information on the yoga program was provided as a booklet, with an instructor-guided group yoga class during the orientation, and a self-directed home yoga program on DVD with yoga logs. Results: The recruitment rate was 44.7%, and the study population consisted of 18 women with a mean age of 43.9 years. This study showed high rates of retention, adherence, and acceptability of the yoga program. Improvements were only observed in the cognitive aspects of fatigue, and there were serious adverse events during the program. Conclusion: The self-directed home yoga program discussed here was both feasible and safe for breast cancer patients showing cognitive symptoms during chemotherapy. The patients also rated the program as useful, interesting, and satisfactory. Participation in the program was associated with improvements in cognitive fatigue but not cognitive function.

Keywords: yoga, cognition, breast cancer, chemotherapy, quality of life

Procedia PDF Downloads 240
801 Ultraviolet Visible Spectroscopy Analysis on Transformer Oil by Correlating It with Various Oil Parameters

Authors: Rajnish Shrivastava, Y. R. Sood, Priti Pundir, Rahul Srivastava

Abstract:

Power transformer is one of the most important devices that are used in power station. Due to several fault impending upon it or due to ageing, etc its life gets lowered. So, it becomes necessary to have diagnosis of oil for fault analysis. Due to the chemical, electrical, thermal and mechanical stress the insulating material in the power transformer degraded. It is important to regularly assess the condition of oil and the remaining life of the power transformer. In this paper UV-VIS absorption graph area is correlated with moisture content, Flash point, IFT and Density of Transformer oil. Since UV-VIS absorption graph area varies accordingly with the variation in different transformer parameters. So by obtaining the correlation among different oil parameters for oil with respect to UV-VIS absorption area, decay contents of transformer oil can be predicted

Keywords: breakdown voltage (BDV), interfacial Tension (IFT), moisture content, ultra violet-visible rays spectroscopy (UV-VIS)

Procedia PDF Downloads 622
800 Flashsonar or Echolocation Education: Expanding the Function of Hearing and Changing the Meaning of Blindness

Authors: Thomas, Daniel Tajo, Kish

Abstract:

Sight is primarily associated with the function of gathering and processing near and extended spatial information which is largely used to support self-determined interaction with the environment through self-directed movement and navigation. By contrast, hearing is primarily associated with the function of gathering and processing sequential information which may typically be used to support self-determined communication through the self-directed use of music and language. Blindness or the lack of vision is traditionally characterized by a lack of capacity to access spatial information which, in turn, is presumed to result in a lack of capacity for self-determined interaction with the environment due to limitations in self-directed movement and navigation. However, through a specific protocol of FlashSonar education developed by World Access for the Blind, the function of hearing can be expanded in blind people to carry out some of the functions normally associated with sight, that is to access and process near and extended spatial information to construct three-dimensional acoustic images of the environment. This perceptual education protocol results in a significant restoration in blind people of self-determined environmental interaction, movement, and navigational capacities normally attributed to vision - a new way to see. Thus, by expanding the function of hearing to process spatial information to restore self-determined movement, we are not only changing the meaning of blindness, and what it means to be blind, but we are also recasting the meaning of vision and what it is to see.

Keywords: echolocation, changing, sensory, function

Procedia PDF Downloads 130
799 Power Iteration Clustering Based on Deflation Technique on Large Scale Graphs

Authors: Taysir Soliman

Abstract:

One of the current popular clustering techniques is Spectral Clustering (SC) because of its advantages over conventional approaches such as hierarchical clustering, k-means, etc. and other techniques as well. However, one of the disadvantages of SC is the time consuming process because it requires computing the eigenvectors. In the past to overcome this disadvantage, a number of attempts have been proposed such as the Power Iteration Clustering (PIC) technique, which is one of versions from SC; some of PIC advantages are: 1) its scalability and efficiency, 2) finding one pseudo-eigenvectors instead of computing eigenvectors, and 3) linear combination of the eigenvectors in linear time. However, its worst disadvantage is an inter-class collision problem because it used only one pseudo-eigenvectors which is not enough. Previous researchers developed Deflation-based Power Iteration Clustering (DPIC) to overcome problems of PIC technique on inter-class collision with the same efficiency of PIC. In this paper, we developed Parallel DPIC (PDPIC) to improve the time and memory complexity which is run on apache spark framework using sparse matrix. To test the performance of PDPIC, we compared it to SC, ESCG, ESCALG algorithms on four small graph benchmark datasets and nine large graph benchmark datasets, where PDPIC proved higher accuracy and better time consuming than other compared algorithms.

Keywords: spectral clustering, power iteration clustering, deflation-based power iteration clustering, Apache spark, large graph

Procedia PDF Downloads 163