Search results for: node points
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 2885

Search results for: node points

2615 Customized Design of Amorphous Solids by Generative Deep Learning

Authors: Yinghui Shang, Ziqing Zhou, Rong Han, Hang Wang, Xiaodi Liu, Yong Yang

Abstract:

The design of advanced amorphous solids, such as metallic glasses, with targeted properties through artificial intelligence signifies a paradigmatic shift in physical metallurgy and materials technology. Here, we developed a machine-learning architecture that facilitates the generation of metallic glasses with targeted multifunctional properties. Our architecture integrates the state-of-the-art unsupervised generative adversarial network model with supervised models, allowing the incorporation of general prior knowledge derived from thousands of data points across a vast range of alloy compositions, into the creation of data points for a specific type of composition, which overcame the common issue of data scarcity typically encountered in the design of a given type of metallic glasses. Using our generative model, we have successfully designed copper-based metallic glasses, which display exceptionally high hardness or a remarkably low modulus. Notably, our architecture can not only explore uncharted regions in the targeted compositional space but also permits self-improvement after experimentally validated data points are added to the initial dataset for subsequent cycles of data generation, hence paving the way for the customized design of amorphous solids without human intervention.

Keywords: metallic glass, artificial intelligence, mechanical property, automated generation

Procedia PDF Downloads 56
2614 An Exact Algorithm for Location–Transportation Problems in Humanitarian Relief

Authors: Chansiri Singhtaun

Abstract:

This paper proposes a mathematical model and examines the performance of an exact algorithm for a location–transportation problems in humanitarian relief. The model determines the number and location of distribution centers in a relief network, the amount of relief supplies to be stocked at each distribution center and the vehicles to take the supplies to meet the needs of disaster victims under capacity restriction, transportation and budgetary constraints. The computational experiments are conducted on the various sizes of problems that are generated. Branch and bound algorithm is applied for these problems. The results show that this algorithm can solve problem sizes of up to three candidate locations with five demand points and one candidate location with up to twenty demand points without premature termination.

Keywords: disaster response, facility location, humanitarian relief, transportation

Procedia PDF Downloads 451
2613 Asymptotic Expansion of Double Oscillatory Integrals: Contribution of Non Stationary Critical Points of the Second Kind

Authors: Abdallah Benaissa

Abstract:

In this paper, we consider the problem of asymptotics of double oscillatory integrals in the case of critical points of the second kind, the order of contact between the boundary and a level curve of the phase being even, the situation when the order of contact is odd will be studied in other occasions. Complete asymptotic expansions will be derived and the coefficient of the leading term will be computed in terms of the original data of the problem. A multitude of people have studied this problem using a variety of methods, but only in a special case when the order of contact is minimal: the more cited papers are a paper of Jones and Kline and an other one of Chako. These integrals are encountered in many areas of science, especially in problems of diffraction of optics.

Keywords: asymptotic expansion, double oscillatory integral, critical point of the second kind, optics diffraction

Procedia PDF Downloads 350
2612 Cooperative Cross Layer Topology for Concurrent Transmission Scheduling Scheme in Broadband Wireless Networks

Authors: Gunasekaran Raja, Ramkumar Jayaraman

Abstract:

In this paper, we consider CCL-N (Cooperative Cross Layer Network) topology based on the cross layer (both centralized and distributed) environment to form network communities. Various performance metrics related to the IEEE 802.16 networks are discussed to design CCL-N Topology. In CCL-N topology, nodes are classified as master nodes (Master Base Station [MBS]) and serving nodes (Relay Station [RS]). Nodes communities are organized based on the networking terminologies. Based on CCL-N Topology, various simulation analyses for both transparent and non-transparent relays are tabulated and throughput efficiency is calculated. Weighted load balancing problem plays a challenging role in IEEE 802.16 network. CoTS (Concurrent Transmission Scheduling) Scheme is formulated in terms of three aspects – transmission mechanism based on identical communities, different communities and identical node communities. CoTS scheme helps in identifying the weighted load balancing problem. Based on the analytical results, modularity value is inversely proportional to that of the error value. The modularity value plays a key role in solving the CoTS problem based on hop count. The transmission mechanism for identical node community has no impact since modularity value is same for all the network groups. In this paper three aspects of communities based on the modularity value which helps in solving the problem of weighted load balancing and CoTS are discussed.

Keywords: cross layer network topology, concurrent scheduling, modularity value, network communities and weighted load balancing

Procedia PDF Downloads 265
2611 Defectoscopy of Reinforced Concrete Structures with Using an Ultrasonic Method for Failure Monitoring

Authors: Sabina Hublova, Kristyna Hrabova, Petr Cikrle

Abstract:

Sustainable development and preservation of existing buildings are becoming increasingly important worldwide. In order to reduce the amount of CO2 emissions in the air and to reduce the amount of waste from building structures, we can predict an increasing demand for maintenance of some existing buildings in the future. The use of modern diagnostic methods, which allow detailed determination of the properties of structures, the identification of critical points, could be the great importance for the better assessment of existing structures. Non-destructive methods could be one of the options. From these methods, ultrasonic appears to be a highly perspective method, thanks to which we are able to identify critical points of an element or a structure. The experiment will focus on the use of electroacoustic methods for defectoscopy in reinforced concrete columns.

Keywords: sustainability, defectoscopy, ultrasonic method, non-destructive methods, electroacoustic methods

Procedia PDF Downloads 168
2610 Contribution to the Evaluation of Uncertainties of Measurement to the Data Processing Sequences of a Cmm

Authors: Hassina Gheribi, Salim Boukebbab

Abstract:

The measurement of the parts manufactured on CMM (coordinate measuring machine) is based on the association of a surface of perfect geometry to the group of dots palpated via a mathematical calculation of the distances between the palpated points and itself surfaces. Surfaces not being never perfect, they are measured by a number of points higher than the minimal number necessary to define them mathematically. However, the central problems of three-dimensional metrology are the estimate of, the orientation parameters, location and intrinsic of this surface. Including the numerical uncertainties attached to these parameters help the metrologist to make decisions to be able to declare the conformity of the part to specifications fixed on the design drawing. During this paper, we will present a data-processing model in Visual Basic-6 which makes it possible automatically to determine the whole of these parameters, and their uncertainties.

Keywords: coordinate measuring machines (CMM), associated surface, uncertainties of measurement, acquisition and modeling

Procedia PDF Downloads 325
2609 A Two Server Poisson Queue Operating under FCFS Discipline with an ‘m’ Policy

Authors: R. Sivasamy, G. Paulraj, S. Kalaimani, N.Thillaigovindan

Abstract:

For profitable businesses, queues are double-edged swords and hence the pain of long wait times in a queue often frustrates customers. This paper suggests a technical way of reducing the pain of lines through a Poisson M/M1, M2/2 queueing system operated by two heterogeneous servers with an objective of minimising the mean sojourn time of customers served under the queue discipline ‘First Come First Served with an ‘m’ policy, i.e. FCFS-m policy’. Arrivals to the system form a Poisson process of rate λ and are served by two exponential servers. The service times of successive customers at server ‘j’ are independent and identically distributed (i.i.d.) random variables and each of it is exponentially distributed with rate parameter μj (j=1, 2). The primary condition for implementing the queue discipline ‘FCFS-m policy’ on these service rates μj (j=1, 2) is that either (m+1) µ2 > µ1> m µ2 or (m+1) µ1 > µ2> m µ1 must be satisfied. Further waiting customers prefer the server-1 whenever it becomes available for service, and the server-2 should be installed if and only if the queue length exceeds the value ‘m’ as a threshold. Steady-state results on queue length and waiting time distributions have been obtained. A simple way of tracing the optimal service rate μ*2 of the server-2 is illustrated in a specific numerical exercise to equalize the average queue length cost with that of the service cost. Assuming that the server-1 has to dynamically adjust the service rates as μ1 during the system size is strictly less than T=(m+2) while μ2=0, and as μ1 +μ2 where μ2>0 if the system size is more than or equal to T, corresponding steady state results of M/M1+M2/1 queues have been deduced from those of M/M1,M2/2 queues. To conclude this investigation has a viable application, results of M/M1+M2/1 queues have been used in processing of those waiting messages into a single computer node and to measure the power consumption by the node.

Keywords: two heterogeneous servers, M/M1, M2/2 queue, service cost and queue length cost, M/M1+M2/1 queue

Procedia PDF Downloads 362
2608 Computational Team Dynamics and Interaction Patterns in New Product Development Teams

Authors: Shankaran Sitarama

Abstract:

New Product Development (NPD) is invariably a team effort and involves effective teamwork. NPD team has members from different disciplines coming together and working through the different phases all the way from conceptual design phase till the production and product roll out. Creativity and Innovation are some of the key factors of successful NPD. Team members going through the different phases of NPD interact and work closely yet challenge each other during the design phases to brainstorm on ideas and later converge to work together. These two traits require the teams to have a divergent and a convergent thinking simultaneously. There needs to be a good balance. The team dynamics invariably result in conflicts among team members. While some amount of conflict (ideational conflict) is desirable in NPD teams to be creative as a group, relational conflicts (or discords among members) could be detrimental to teamwork. Team communication truly reflect these tensions and team dynamics. In this research, team communication (emails) between the members of the NPD teams is considered for analysis. The email communication is processed through a semantic analysis algorithm (LSA) to analyze the content of communication and a semantic similarity analysis to arrive at a social network graph that depicts the communication amongst team members based on the content of communication. The amount of communication (content and not frequency of communication) defines the interaction strength between the members. Social network adjacency matrix is thus obtained for the team. Standard social network analysis techniques based on the Adjacency Matrix (AM) and Dichotomized Adjacency Matrix (DAM) based on network density yield network graphs and network metrics like centrality. The social network graphs are then rendered for visual representation using a Metric Multi-Dimensional Scaling (MMDS) algorithm for node placements and arcs connecting the nodes (representing team members) are drawn. The distance of the nodes in the placement represents the tie-strength between the members. Stronger tie-strengths render nodes closer. Overall visual representation of the social network graph provides a clear picture of the team’s interactions. This research reveals four distinct patterns of team interaction that are clearly identifiable in the visual representation of the social network graph and have a clearly defined computational scheme. The four computational patterns of team interaction defined are Central Member Pattern (CMP), Subgroup and Aloof member Pattern (SAP), Isolate Member Pattern (IMP), and Pendant Member Pattern (PMP). Each of these patterns has a team dynamics implication in terms of the conflict level in the team. For instance, Isolate member pattern, clearly points to a near break-down in communication with the member and hence a possible high conflict level, whereas the subgroup or aloof member pattern points to a non-uniform information flow in the team and some moderate level of conflict. These pattern classifications of teams are then compared and correlated to the real level of conflict in the teams as indicated by the team members through an elaborate self-evaluation, team reflection, feedback form and results show a good correlation.

Keywords: team dynamics, team communication, team interactions, social network analysis, sna, new product development, latent semantic analysis, LSA, NPD teams

Procedia PDF Downloads 69
2607 A Hybrid Heuristic for the Team Orienteering Problem

Authors: Adel Bouchakhchoukha, Hakim Akeb

Abstract:

In this work, we propose a hybrid heuristic in order to solve the Team Orienteering Problem (TOP). Given a set of points (or customers), each with associated score (profit or benefit), and a team that has a fixed number of members, the problem to solve is to visit a subset of points in order to maximize the total collected score. Each member performs a tour starting at the start point, visiting distinct customers and the tour terminates at the arrival point. In addition, each point is visited at most once, and the total time in each tour cannot be greater than a given value. The proposed heuristic combines beam search and a local optimization strategy. The algorithm was tested on several sets of instances and encouraging results were obtained.

Keywords: team orienteering problem, vehicle routing, beam search, local search

Procedia PDF Downloads 418
2606 Vertical Electrical Sounding and Seismic Refraction Techniques in Resolving Groundwater Problems at Kujama Prison Farm, Kaduna, Nigeria

Authors: M. D. Dogara, C. G, Afuwai, O. O. Esther, A. M. Dawai

Abstract:

For two decades, the inhabitants of Kujama Prison Farm faced problems of water for domestic and agricultural purposes, even after the drilling of three deep boreholes. The scarcity of this groundwater resource led to the geophysical investigation of the basement complex of the prison farm. Two geophysical techniques, vertical electrical sounding and seismic refraction methods were deployed to unravel the cause(s) of the non-productivity of the three boreholes. The area of investigation covered was 400,000 m2 of ten profiles with six investigative points. In all, 60 vertical electrical points were sounded, and sixty sets of seismic refraction data were collected using the forward and reverse approach. From the geoelectric sections, it is suggestive that the area is underlain by three to five geoelectric layers of varying thicknesses and resistivities. The result of the interpreted seismic data revealed two geovelocity layers, with velocities ranging between 478m/s to 1666m/s for the first layer and 1166m/s to 7141m/s for the second layer. From the combined results of the two techniques, it was suggestive that all the three unproductive boreholes were drilled at points that were neither weathered nor fractured. It was, therefore, suggested that new boreholes should be drilled at areas identified with depressed bedrock topography having geophysical evidence of intense weathering and fracturing within the fresh basement.

Keywords: groundwater, Kujama prison farm, kaduna, nigeria, seismic refraction, vertical electrical sounding

Procedia PDF Downloads 155
2605 Analysis the Different Types of Nano Sensors on Based of Structure and It’s Applications on Nano Electronics

Authors: Hefzollah Mohammadiyan, Mohammad Bagher Heidari, Ensiyeh Hajeb

Abstract:

In this paper investigates and analyses the structure of nano sensors will be discussed. The structure can be classified based of nano sensors: quantum points, carbon nanotubes and nano tools, which details into each other and in turn are analyzed. Then will be fully examined to the Carbon nanotubes as chemical and mechanical sensors. The following discussion, be examined compares the advantages and disadvantages as different types of sensors and also it has feature and a wide range of applications in various industries. Finally, the structure and application of Chemical sensor transistors and the sensors will be discussed in air pollution control.

Keywords: carbon nanotubes, quantum points, chemical sensors, mechanical sensors, chemical sensor transistors, single walled nanotube (SWNT), atomic force microscope (AFM)

Procedia PDF Downloads 450
2604 Improving the Patient Guidance Satisfaction and Integrity of Patients Hospitalized in Iodine-131 Isolation Rooms

Authors: Yu Sin Syu

Abstract:

Objective: The study aimed to improve the patient guidance satisfaction of patients hospitalized in iodine-131 isolation rooms, as well as the patient guidance completion rate for such patients. Method: A patient care guidance checklist and patient care guidance satisfaction questionnaire were administered to 29 patients who had previously been hospitalized in iodine-131 isolation rooms. The evaluation was conducted on a one-on-one basis, and its results showed that the patients’ satisfaction with patient guidance was only 3.7 points and that the completion rate for the patient guidance performed by nurses was only 67%. Therefore, various solutions were implemented to create a more complete patient guidance framework for nurses, including the incorporation of regular care-related training in in-service education courses; the establishment of patient care guidance standards for patients in iodine-131 isolation rooms; the establishment of inpatient care standards and auditing processes for iodine-131 isolation rooms; the creation of an introductory handbook on ward environment; Invite other the care team the revision of iodine-131 health education brochures; the creation of visual cards and videos covering equipment operation procedures; and introduction of QR codes. Results: Following the implementation of the above measures, the overall satisfaction of patients hospitalized in iodine-131 isolation rooms increased from 3.7 points to 4.6 points, and the completion rate for patient guidance rose from 67% to 100%. Conclusion: Given the excellent results achieved in this study, it is hoped that this nursing project can serve as a benchmark for other relevant departments.

Keywords: admission care guidance, guidance satisfaction, integrity, Iodine131 isolation

Procedia PDF Downloads 127
2603 Research on the Strategy of Orbital Avoidance for Optical Remote Sensing Satellite

Authors: Zheng DianXun, Cheng Bo, Lin Hetong

Abstract:

This paper focuses on the orbit avoidance strategies of optical remote sensing satellite. The optical remote sensing satellite, moving along the Sun-synchronous orbit, is equipped with laser warning equipment to alert CCD camera from laser attacks. There are three ways to protect the CCD camera: closing the camera cover, satellite attitude maneuver and satellite orbit avoidance. In order to enhance the safety of optical remote sensing satellite in orbit, this paper explores the strategy of satellite avoidance. The avoidance strategy is expressed as the evasion of pre-determined target points in the orbital coordinates of virtual satellite. The so-called virtual satellite is a passive vehicle which superposes the satellite at the initial stage of avoidance. The target points share the consistent cycle time and the same semi-major axis with the virtual satellite, which ensures the properties of the satellite’s Sun-synchronous orbit remain unchanged. Moreover, to further strengthen the avoidance capability of satellite, it can perform multi-target-points avoid maneuvers. On occasions of fulfilling the satellite orbit tasks, the orbit can be restored back to virtual satellite through orbit maneuvers. Thereinto, the avoid maneuvers adopts pulse guidance. And the fuel consumption is also optimized. The avoidance strategy discussed in this article is applicable to optical remote sensing satellite when it is encountered with hostile attack of space-based laser anti-satellite.

Keywords: optical remote sensing satellite, satellite avoidance, virtual satellite, avoid target-point, avoid maneuver

Procedia PDF Downloads 404
2602 Two Points Crossover Genetic Algorithm for Loop Layout Design Problem

Authors: Xu LiYun, Briand Florent, Fan GuoLiang

Abstract:

The loop-layout design problem (LLDP) aims at optimizing the sequence of positioning of the machines around the cyclic production line. Traffic congestion is the usual criteria to minimize in this type of problem, i.e. the number of additional cycles spent by each part in the network until the completion of its required routing sequence of machines. This paper aims at applying several improvements mechanisms such as a positioned-based crossover operator for the Genetic Algorithm (GA) called a Two Points Crossover (TPC) and an offspring selection process. The performance of the improved GA is measured using well-known examples from literature and compared to other evolutionary algorithms. Good results show that GA can still be competitive for this type of problem against more recent evolutionary algorithms.

Keywords: crossover, genetic algorithm, layout design problem, loop-layout, manufacturing optimization

Procedia PDF Downloads 279
2601 Temporally Coherent 3D Animation Reconstruction from RGB-D Video Data

Authors: Salam Khalifa, Naveed Ahmed

Abstract:

We present a new method to reconstruct a temporally coherent 3D animation from single or multi-view RGB-D video data using unbiased feature point sampling. Given RGB-D video data, in form of a 3D point cloud sequence, our method first extracts feature points using both color and depth information. In the subsequent steps, these feature points are used to match two 3D point clouds in consecutive frames independent of their resolution. Our new motion vectors based dynamic alignment method then fully reconstruct a spatio-temporally coherent 3D animation. We perform extensive quantitative validation using novel error functions to analyze the results. We show that despite the limiting factors of temporal and spatial noise associated to RGB-D data, it is possible to extract temporal coherence to faithfully reconstruct a temporally coherent 3D animation from RGB-D video data.

Keywords: 3D video, 3D animation, RGB-D video, temporally coherent 3D animation

Procedia PDF Downloads 373
2600 An Efficient Propensity Score Method for Causal Analysis With Application to Case-Control Study in Breast Cancer Research

Authors: Ms Azam Najafkouchak, David Todem, Dorothy Pathak, Pramod Pathak, Joseph Gardiner

Abstract:

Propensity score (PS) methods have recently become the standard analysis as a tool for the causal inference in the observational studies where exposure is not randomly assigned, thus, confounding can impact the estimation of treatment effect on the outcome. For the binary outcome, the effect of treatment on the outcome can be estimated by odds ratios, relative risks, and risk differences. However, using the different PS methods may give you a different estimation of the treatment effect on the outcome. Several methods of PS analyses have been used mainly, include matching, inverse probability of weighting, stratification, and covariate adjusted on PS. Due to the dangers of discretizing continuous variables (exposure, covariates), the focus of this paper will be on how the variation in cut-points or boundaries will affect the average treatment effect (ATE) utilizing the stratification of PS method. Therefore, we are trying to avoid choosing arbitrary cut-points, instead, we continuously discretize the PS and accumulate information across all cut-points for inferences. We will use Monte Carlo simulation to evaluate ATE, focusing on two PS methods, stratification and covariate adjusted on PS. We will then show how this can be observed based on the analyses of the data from a case-control study of breast cancer, the Polish Women’s Health Study.

Keywords: average treatment effect, propensity score, stratification, covariate adjusted, monte Calro estimation, breast cancer, case_control study

Procedia PDF Downloads 105
2599 Effects of Aerodynamic on Suspended Cables Using Non-Linear Finite Element Approach

Authors: Justin Nwabanne, Sam Omenyi, Jeremiah Chukwuneke

Abstract:

This work presents structural nonlinear static analysis of a horizontal taut cable using Finite Element Analysis (FEA) method. The FEA was performed analytically to determine the tensions at each nodal point and subsequently, performed based on finite element displacement method computationally using the FEA software, ANSYS 14.0 to determine their behaviour under the influence of aerodynamic forces imposed on the cable. The convergence procedure is adapted into the method to prevent excessive displacements through the computations. The work compared the two FEA cases by examining the effectiveness of the analytical model in describing the response with few degrees of freedom and the ability of the nonlinear finite element procedure adopted to capture the complex features of cable dynamics with reference to the aerodynamic external influence. Results obtained from this work explain that the analytic FEM results without aerodynamic influence show a parabolic response with an optimum deflection at nodal points 12 and 13 with the cable weight at nodes 12 and 13 having the value -1.002936N while for the cable tension shows an optimum deflection value for nodes 12 and 13 at -189396.97kg/km. The maximum displacement for the cable system was obtained from ANSYS 14.0 as 4483.83 mm for X, Y and Z components of displacements at node number 2 while the maximum displacement obtained is 4218.75mm for all the directional components. The dynamic behaviour of a taut cable investigated has application in a typical power transmission line. Aerodynamic influences on the cables were considered using FEA approach by employing ANSYS 14.0 showed a complex modal behaviour as expected.

Keywords: aerodynamics, cable tension and weight, finite element analysis, nodal, non-linear model, optimum deflection, suspended cable, transmission line

Procedia PDF Downloads 278
2598 Detailed Quantum Circuit Design and Evaluation of Grover's Algorithm for the Bounded Degree Traveling Salesman Problem Using the Q# Language

Authors: Wenjun Hou, Marek Perkowski

Abstract:

The Traveling Salesman problem is famous in computing and graph theory. In short, it asks for the Hamiltonian cycle of the least total weight in a given graph with N nodes. All variations on this problem, such as those with K-bounded-degree nodes, are classified as NP-complete in classical computing. Although several papers propose theoretical high-level designs of quantum algorithms for the Traveling Salesman Problem, no quantum circuit implementation of these algorithms has been created up to our best knowledge. In contrast to previous papers, the goal of this paper is not to optimize some abstract complexity measures based on the number of oracle iterations, but to be able to evaluate the real circuit and time costs of the quantum computer. Using the emerging quantum programming language Q# developed by Microsoft, which runs quantum circuits in a quantum computer simulation, an implementation of the bounded-degree problem and its respective quantum circuit were created. To apply Grover’s algorithm to this problem, a quantum oracle was designed, evaluating the cost of a particular set of edges in the graph as well as its validity as a Hamiltonian cycle. Repeating the Grover algorithm with an oracle that finds successively lower cost each time allows to transform the decision problem to an optimization problem, finding the minimum cost of Hamiltonian cycles. N log₂ K qubits are put into an equiprobablistic superposition by applying the Hadamard gate on each qubit. Within these N log₂ K qubits, the method uses an encoding in which every node is mapped to a set of its encoded edges. The oracle consists of several blocks of circuits: a custom-written edge weight adder, node index calculator, uniqueness checker, and comparator, which were all created using only quantum Toffoli gates, including its special forms, which are Feynman and Pauli X. The oracle begins by using the edge encodings specified by the qubits to calculate each node that this path visits and adding up the edge weights along the way. Next, the oracle uses the calculated nodes from the previous step and check that all the nodes are unique. Finally, the oracle checks that the calculated cost is less than the previously-calculated cost. By performing the oracle an optimal number of times, a correct answer can be generated with very high probability. The oracle of the Grover Algorithm is modified using the recalculated minimum cost value, and this procedure is repeated until the cost cannot be further reduced. This algorithm and circuit design have been verified, using several datasets, to generate correct outputs.

Keywords: quantum computing, quantum circuit optimization, quantum algorithms, hybrid quantum algorithms, quantum programming, Grover’s algorithm, traveling salesman problem, bounded-degree TSP, minimal cost, Q# language

Procedia PDF Downloads 190
2597 A Primary Care Diagnosis of Middle-Aged Men with Oral Cancer Who Underwent Extensive Resection and Flap Repair: A Case Report

Authors: Ching-Yi Huang, Pi-Fen Cheng, Hui-Zhu Chen, Shi Ting Huang, Heng-Hua Wang

Abstract:

This is a case of oral cancer after extensive resection and modified right lateral neck lymph node dissection followed by reconstruction with a skin flap. The nursing period lasted From September 25 to October 3, 2017, through observation, interview, physical assessment, and medical record review, the author identified the following nursing problems: acute pain, impaired oral mucous membrane, and body image change. During the nursing period, the author provided individual and overall nursing care and established mutual trust through the use of empathy. Author listened and eased the patient's physical indisposition, such as wound pain, we use medications and acupuncture massage to relieve pain. However, for oral mucosa change caused by surgery, provide continuous and complete oral care and oral exercise training to improve oral mucosal healing and restore swallowing function. In the body-image changes, guided him to express his feeling after the body-image change, and enhanced support and from the family, and encouraged him to attend head and neck cancer survivor alliance which allowed the patient to accept the altered body image and reaffirm self-worth. Hopefully, through sharing this nursing experience will help to the nursing care quality of nursing care for oral cancer patients after extensive resection and modified right lateral neck lymph node dissection followed by reconstruction with a skin flap.

Keywords: oral cancer, acute pain, impaired oral mucous membrane, body image change

Procedia PDF Downloads 187
2596 Formulation of Corrector Methods from 3-Step Hybid Adams Type Methods for the Solution of First Order Ordinary Differential Equation

Authors: Y. A. Yahaya, Ahmad Tijjani Asabe

Abstract:

This paper focuses on the formulation of 3-step hybrid Adams type method for the solution of first order differential equation (ODE). The methods which was derived on both grid and off grid points using multistep collocation schemes and also evaluated at some points to produced Block Adams type method and Adams moulton method respectively. The method with the highest order was selected to serve as the corrector. The convergence was valid and efficient. The numerical experiments were carried out and reveal that hybrid Adams type methods performed better than the conventional Adams moulton method.

Keywords: adam-moulton type (amt), corrector method, off-grid, block method, convergence analysis

Procedia PDF Downloads 626
2595 Density-based Denoising of Point Cloud

Authors: Faisal Zaman, Ya Ping Wong, Boon Yian Ng

Abstract:

Point cloud source data for surface reconstruction is usually contaminated with noise and outliers. To overcome this, we present a novel approach using modified kernel density estimation (KDE) technique with bilateral filtering to remove noisy points and outliers. First we present a method for estimating optimal bandwidth of multivariate KDE using particle swarm optimization technique which ensures the robust performance of density estimation. Then we use mean-shift algorithm to find the local maxima of the density estimation which gives the centroid of the clusters. Then we compute the distance of a certain point from the centroid. Points belong to outliers then removed by automatic thresholding scheme which yields an accurate and economical point surface. The experimental results show that our approach comparably robust and efficient.

Keywords: point preprocessing, outlier removal, surface reconstruction, kernel density estimation

Procedia PDF Downloads 344
2594 On a Continuous Formulation of Block Method for Solving First Order Ordinary Differential Equations (ODEs)

Authors: A. M. Sagir

Abstract:

The aim of this paper is to investigate the performance of the developed linear multistep block method for solving first order initial value problem of Ordinary Differential Equations (ODEs). The method calculates the numerical solution at three points simultaneously and produces three new equally spaced solution values within a block. The continuous formulations enable us to differentiate and evaluate at some selected points to obtain three discrete schemes, which were used in block form for parallel or sequential solutions of the problems. A stability analysis and efficiency of the block method are tested on ordinary differential equations involving practical applications, and the results obtained compared favorably with the exact solution. Furthermore, comparison of error analysis has been developed with the help of computer software.

Keywords: block method, first order ordinary differential equations, linear multistep, self-starting

Procedia PDF Downloads 306
2593 The Prognostic Prediction Value of Positive Lymph Nodes Numbers for the Hypopharyngeal Squamous Cell Carcinoma

Authors: Wendu Pang, Yaxin Luo, Junhong Li, Yu Zhao, Danni Cheng, Yufang Rao, Minzi Mao, Ke Qiu, Yijun Dong, Fei Chen, Jun Liu, Jian Zou, Haiyang Wang, Wei Xu, Jianjun Ren

Abstract:

We aimed to compare the prognostic prediction value of positive lymph node number (PLNN) to the American Joint Committee on Cancer (AJCC) tumor, lymph node, and metastasis (TNM) staging system for patients with hypopharyngeal squamous cell carcinoma (HPSCC). A total of 826 patients with HPSCC from the Surveillance, Epidemiology, and End Results database (2004–2015) were identified and split into two independent cohorts: training (n=461) and validation (n=365). Univariate and multivariate Cox regression analyses were used to evaluate the prognostic effects of PLNN in patients with HPSCC. We further applied six Cox regression models to compare the survival predictive values of the PLNN and AJCC TNM staging system. PLNN showed a significant association with overall survival (OS) and cancer-specific survival (CSS) (P < 0.001) in both univariate and multivariable analyses, and was divided into three groups (PLNN 0, PLNN 1-5, and PLNN>5). In the training cohort, multivariate analysis revealed that the increased PLNN of HPSCC gave rise to significantly poor OS and CSS after adjusting for age, sex, tumor size, and cancer stage; this trend was also verified by the validation cohort. Additionally, the survival model incorporating a composite of PLNN and TNM classification (C-index, 0.705, 0.734) performed better than the PLNN and AJCC TNM models. PLNN can serve as a powerful survival predictor for patients with HPSCC and is a surrogate supplement for cancer staging systems.

Keywords: hypopharyngeal squamous cell carcinoma, positive lymph nodes number, prognosis, prediction models, survival predictive values

Procedia PDF Downloads 154
2592 Effect of Manual Progressive Ischemic Pressure versus Post Isometric Facilitation in the Treatment of Latent Myofascial Trigger Points in Mechanical Neck Pain

Authors: Mohamed M. Diab, Fahmy E. Mohamed, Alaa Balbaa

Abstract:

Background: Myofascial pain syndrome a common type of non-articular musculoskeletal pain, is a condition associated with regional pain and muscle tenderness characterized by the presence of hypersensitive nodules. Objectives: the purpose of this study is to compare between the effects of manual progressive ischemic pressure versus the effect of post isometric facilitation in the treatment of Rhomboid latent myofascial trigger points. Methods: six patients had participated in this study. Patients divided into two groups. Group A treated by manual progressive ischemic pressure and traditional physical therapy program. Group B treated by post isometric facilitation and traditional physical therapy program. Treatment program was for 6 sessions over two week’s period. Result: Statistical analysis revealed that there is no significant difference in post treatment from pretreatment in pain severity (VAS) in myofascial trigger points with Rhomboid muscles) and Pain pressure threshold (PPT) for tenderness at both groups (A,B). Conclusion: ischemic pressure technique appear to be no more effective than post isometric facilitation in treatment of rhomboids latent myofacial trigger point.

Keywords: Rhmoiboid trigger point, myofacila trigger point, ischemic pressure, post isometric facilitation

Procedia PDF Downloads 312
2591 Robust Variable Selection Based on Schwarz Information Criterion for Linear Regression Models

Authors: Shokrya Saleh A. Alshqaq, Abdullah Ali H. Ahmadini

Abstract:

The Schwarz information criterion (SIC) is a popular tool for selecting the best variables in regression datasets. However, SIC is defined using an unbounded estimator, namely, the least-squares (LS), which is highly sensitive to outlying observations, especially bad leverage points. A method for robust variable selection based on SIC for linear regression models is thus needed. This study investigates the robustness properties of SIC by deriving its influence function and proposes a robust SIC based on the MM-estimation scale. The aim of this study is to produce a criterion that can effectively select accurate models in the presence of vertical outliers and high leverage points. The advantages of the proposed robust SIC is demonstrated through a simulation study and an analysis of a real dataset.

Keywords: influence function, robust variable selection, robust regression, Schwarz information criterion

Procedia PDF Downloads 139
2590 A Source Point Distribution Scheme for Wave-Body Interaction Problem

Authors: Aichun Feng, Zhi-Min Chen, Jing Tang Xing

Abstract:

A two-dimensional linear wave-body interaction problem can be solved using a desingularized integral method by placing free surface Rankine sources over calm water surface and satisfying boundary conditions at prescribed collocation points on the calm water surface. A new free-surface Rankine source distribution scheme, determined by the intersection points of free surface and body surface, is developed to reduce numerical computation cost. Associated with this, a new treatment is given to the intersection point. The present scheme results are in good agreement with traditional numerical results and measurements.

Keywords: source point distribution, panel method, Rankine source, desingularized algorithm

Procedia PDF Downloads 365
2589 A Sectional Control Method to Decrease the Accumulated Survey Error of Tunnel Installation Control Network

Authors: Yinggang Guo, Zongchun Li

Abstract:

In order to decrease the accumulated survey error of tunnel installation control network of particle accelerator, a sectional control method is proposed. Firstly, the accumulation rule of positional error with the length of the control network is obtained by simulation calculation according to the shape of the tunnel installation-control-network. Then, the RMS of horizontal positional precision of tunnel backbone control network is taken as the threshold. When the accumulated error is bigger than the threshold, the tunnel installation control network should be divided into subsections reasonably. On each segment, the middle survey station is taken as the datum for independent adjustment calculation. Finally, by taking the backbone control points as faint datums, the weighted partial parameters adjustment is performed with the adjustment results of each segment and the coordinates of backbone control points. The subsections are jointed and unified into the global coordinate system in the adjustment process. An installation control network of the linac with a length of 1.6 km is simulated. The RMS of positional deviation of the proposed method is 2.583 mm, and the RMS of the difference of positional deviation between adjacent points reaches 0.035 mm. Experimental results show that the proposed sectional control method can not only effectively decrease the accumulated survey error but also guarantee the relative positional precision of the installation control network. So it can be applied in the data processing of tunnel installation control networks, especially for large particle accelerators.

Keywords: alignment, tunnel installation control network, accumulated survey error, sectional control method, datum

Procedia PDF Downloads 191
2588 Boosting Crime Scene Investigations Capabilities through Crime Script Analysis

Authors: Benoit Leclerc

Abstract:

The concept of scripts and the role that crime scripts has been playing in criminology during the last decade is reviewed. Particularly illuminating is the potential use of scripts not only to understand and disrupt offender scripts (e.g., commonly referred as crime scripts) but to capture victim and guardian scripts to increase the likelihood of preventing crime. Similarly, the concept of scripts is applied to forensic science – another field that can benefit from script analysis. First, similar to guardian scripts, script analysis can illuminate the process of completing crime scene investigations for those who investigate (crime scene investigators or other professionals involved in crime scene investigations), and as a result, provide a range of intervention-points to improve the success of these investigations. Second, script analysis can also provide valuable information on offenders’ crime-commission processes for crime scene investigators and highlight a number of ‘contact points’ that could be targeted during investigations.

Keywords: crime scripts, crime scene investigation, script analysis, situational crime prevention

Procedia PDF Downloads 275
2587 Anatomical Investigation of Superficial Fascia Relationships with the Skin and Underlying Tissue in the Greyhound Rump, Thigh, and Crus

Authors: Oday A. Al-Juhaishi, Sa`ad M. Ismail, Hung-Hsun Yen, Christina M. Murray, Helen M. S. Davies

Abstract:

The functional anatomy of the fascia in the greyhound is still poorly understood, and incompletely described. The basic knowledge of fascia stems mainly from anatomical, histological and ultrastructural analyses. In this study, twelve specimens of hindlimbs from six fresh greyhound cadavers (3 male, 3 female) were used to examine the topographical relationships of the superficial fascia with the skin and underlying tissue. The first incision was made along the dorsal midline from the level of the thoracolumbar junction caudally to the level of the mid sacrum. The second incision was begun at the level of the first incision and extended along the midline of the lateral aspect of the hindlimb distally, to just proximal to the tarsus, and, the skin margins carefully separated to observe connective tissue links between the skin and superficial fascia, attachment points of the fascia and the relationships of the fascia with blood vessels that supply the skin. A digital camera was used to record the anatomical features as they were revealed. The dissections identified fibrous septa connecting the skin with the superficial fascia and deep fascia in specific areas. The presence of the adipose tissue was found to be very rare within the superficial fascia in these specimens. On the extensor aspects of some joints, a fusion between the superficial fascia and deep fascia was observed. This fusion created a subcutaneous bursa in the following areas: a prepatellar bursa of the stifle, a tarsal bursa caudal to the calcaneus bone, and an ischiatic bursa caudal to the ischiatic tuberosity. The evaluation of blood vessels showed that the perforating vessels passed through fibrous septa in a perpendicular direction to supply the skin, with the largest branch noted in the gluteal area. The attachment points between the superficial fascia and skin were mainly found in the region of the flexor aspect of the joints, such as caudal to the stifle joint. The numerous fibrous septa between the superficial fascia and skin that have been identified in some areas, may create support for the blood vessels that penetrate fascia and into the skin, while allowing for movement between the tissue planes. The subcutaneous bursae between the skin and the superficial fascia where it is fused with the deep fascia may be useful to decrease friction between moving areas. The adhesion points may be related to the integrity and loading of the skin. The attachment points fix the skin and appear to divide the hindlimb into anatomical compartments.

Keywords: attachment points, fibrous septa, greyhound, subcutaneous bursa, superficial fascia

Procedia PDF Downloads 359
2586 Stochastic Multicast Routing Protocol for Flying Ad-Hoc Networks

Authors: Hyunsun Lee, Yi Zhu

Abstract:

Wireless ad-hoc network is a decentralized type of temporary machine-to-machine connection that is spontaneous or impromptu so that it does not rely on any fixed infrastructure and centralized administration. As unmanned aerial vehicles (UAVs), also called drones, have recently become more accessible and widely utilized in military and civilian domains such as surveillance, search and detection missions, traffic monitoring, remote filming, product delivery, to name a few. The communication between these UAVs become possible and materialized through Flying Ad-hoc Networks (FANETs). However, due to the high mobility of UAVs that may cause different types of transmission interference, it is vital to design robust routing protocols for FANETs. In this talk, the multicast routing method based on a modified stochastic branching process is proposed. The stochastic branching process is often used to describe an early stage of an infectious disease outbreak, and the reproductive number in the process is used to classify the outbreak into a major or minor outbreak. The reproductive number to regulate the local transmission rate is adapted and modified for flying ad-hoc network communication. The performance of the proposed routing method is compared with other well-known methods such as flooding method and gossip method based on three measures; average reachability, average node usage and average branching factor. The proposed routing method achieves average reachability very closer to flooding method, average node usage closer to gossip method, and outstanding average branching factor among methods. It can be concluded that the proposed multicast routing scheme is more efficient than well-known routing schemes such as flooding and gossip while it maintains high performance.

Keywords: Flying Ad-hoc Networks, Multicast Routing, Stochastic Branching Process, Unmanned Aerial Vehicles

Procedia PDF Downloads 123