Search results for: subspace rotation algorithm

Authors: Chaghoub Soraya, Zhang Xiaoyan

Abstract:

This research presents the first constant approximation algorithm to the p-median network design problem with multiple cable types. This problem was addressed with a single cable type and there is a bifactor approximation algorithm for the problem. To the best of our knowledge, the algorithm proposed in this paper is the first constant approximation algorithm for the p-median network design with multiple cable types. The addressed problem is a combination of two well studied problems which are p-median problem and network design problem. The introduced algorithm is a random sampling approximation algorithm of constant factor which is conceived by using some random sampling techniques form the literature. It is based on a redistribution Lemma from the literature and a steiner tree problem as a subproblem. This algorithm is simple, and it relies on the notions of random sampling and probability. The proposed approach gives an approximation solution with one constant ratio without violating any of the constraints, in contrast to the one proposed in the literature. This paper provides a (21 + 2)-approximation algorithm for the p-median network design problem with multiple cable types using random sampling techniques.

Keywords: approximation algorithms, buy-at-bulk, combinatorial optimization, network design, p-median

Procedia PDF Downloads 203

Authors: Kaili Wang, Botao Zhang, Enming Zhang

Abstract:

Background: Low back pain (LBP) is a common problem affecting athletes' training and competition. Although the association between a limited hip range of motion and prevalence of low back pain has been studied extensively, it has not been studied in table tennis. Aim: The main purposes of this study in table tennis players were (1) to investigate if there is a difference in hip internal rotation (HIR) and external rotation (HER) range of motion (ROM) between players with LBP and players without LBP and (2) to analyze the association between HIR and HER ROM and LBP. Methods: Forty-six table tennis players from the Chinese table tennis team were evaluated for passive maximum HIR and HER ROM. LBP was retrospectively recorded for the last 12 months before the date of ROM assessment by a physical therapist. The data were analyzed the difference in HIR and HER ROM between players with LBP and players without LBP by Mann-Whitney U test, and the association between the difference in HIR and HER ROM and LBP was analyzed via a binary logistic regression. Results: The 54% of players had developed LBP during the retrospective study period. Significant difference between LBP group and the asymptomatic group for HIR ROM (z=4.007, p<0.001) was observed. Difference between LBP group and asymptomatic group for HER ROM (z=1.117, p=0.264) was not significant. Players who had HIR ROM deficit had an increased risk of LBP compared with players without HIR ROM deficit (OR=5.344, 95%CI: 1.006-28.395, P=0.049). Conclusion: HIR ROM of a table tennis player with LBP was less than a table tennis player without LBP. Compared with player whose HIR ROM was normal, player who had HIR ROM deficit appeared to have a higher risk for LBP.

Keywords: assessment, injury prevention, low back pain, table tennis players

Procedia PDF Downloads 111

Authors: J. Yang, Y. Ma, X. Zhang, S. Li, Y. Zhang

Abstract:

The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm often converges to local minima for the reason that it is sensitive to the initial cluster centers. In this paper, an algorithm for selecting initial cluster centers on the basis of minimum spanning tree (MST) is presented. The set of vertices in MST with same degree are regarded as a whole which is used to find the skeleton data points. Furthermore, a distance measure between the skeleton data points with consideration of degree and Euclidean distance is presented. Finally, MST-based initialization method for the k-means algorithm is presented, and the corresponding time complexity is analyzed as well. The presented algorithm is tested on five data sets from the UCI Machine Learning Repository. The experimental results illustrate the effectiveness of the presented algorithm compared to three existing initialization methods.

Keywords: degree, initial cluster center, k-means, minimum spanning tree

Procedia PDF Downloads 411

Authors: Rajendra Kanojia

Abstract:

Femoral components with inbuilt rotation require thicker flexion resection of the lateral femoral condyle and could potential risk to damage the popliteus tendon especially in the smaller Asian knees. We prospectively evaluated 10 patients with bilateral varus osteoarthritis knee to size the cuts and their location in relation to the popliteus tendon. Two different types of implant were used on either side, one side requires resection in 3° external rotation (group A) and other side femoral component with inbuilt external roation (group B). We had popliteus tendon injury in 3 knees all from group B. Risk of damaging the popliteus tendon was found higher in group B.

Keywords: popliteaus tendon injury, TKA, orthopaedic surgery, biomechanics and clinical applications

Procedia PDF Downloads 334

Authors: Archana Singh, Jyoti Agarwal, Ajay Rana

Abstract:

Data Mining is an efficient technology to discover patterns in large databases. Association Rule Mining techniques are used to find the correlation between the various item sets in a database, and this co-relation between various item sets are used in decision making and pattern analysis. In recent years, the problem of finding association rules from large datasets has been proposed by many researchers. Various research papers on association rule mining (ARM) are studied and analyzed first to understand the existing algorithms. Apriori algorithm is the basic ARM algorithm, but it requires so many database scans. In DIC algorithm, less amount of database scan is needed but complex data structure lattice is used. The main focus of this paper is to propose a new optimized algorithm (Friendly Algorithm) and compare its performance with the existing algorithms A data set is used to find out frequent itemsets and association rules with the help of existing and proposed (Friendly Algorithm) and it has been observed that the proposed algorithm also finds all the frequent itemsets and essential association rules from databases as compared to existing algorithms in less amount of database scan. In the proposed algorithm, an optimized data structure is used i.e. Graph and Adjacency Matrix.

Keywords: association rules, data mining, dynamic item set counting, FP-growth, friendly algorithm, graph

Procedia PDF Downloads 421

Authors: Ji Eun Shin, Dong Hoon Lim

Abstract:

Data clustering is a common technique used in data analysis and is used in many applications, such as artificial intelligence, pattern recognition, economics, ecology, psychiatry and marketing. K-means clustering is a well-known clustering algorithm aiming to cluster a set of data points to a predefined number of clusters. In this paper, we implement K-means algorithm based on MapReduce framework with RHadoop to make the clustering method applicable to large scale data. RHadoop is a collection of R packages that allow users to manage and analyze data with Hadoop. The main idea is to introduce a combiner as a function of our map output to decrease the amount of data needed to be processed by reducers. The experimental results demonstrated that K-means algorithm using RHadoop can scale well and efficiently process large data sets on commodity hardware. We also showed that our K-means algorithm using RHadoop with combiner was faster than regular algorithm without combiner as the size of data set increases.

Keywords: big data, combiner, K-means clustering, RHadoop

Procedia PDF Downloads 438

Authors: J. Kaabi, Y. Harrath

Abstract:

This paper studied the flow shop scheduling problem under machine availability constraints. The machines are subject to flexible preventive maintenance activities. The nonresumable scenario for the jobs was considered. That is, when a job is interrupted by an unavailability period of a machine it should be restarted from the beginning. The objective is to minimize the total tardiness time for the jobs and the advance/tardiness for the maintenance activities. To solve the problem, a genetic algorithm was developed and successfully tested and validated on many problem instances. The computational results showed that the new genetic algorithm outperforms another earlier proposed algorithm.

Keywords: flow shop scheduling, genetic algorithm, maintenance, priority rules

Procedia PDF Downloads 471

Authors: Omar Dib, Alexandre Caminada, Marie-Ange Manier

Abstract:

The purpose of this study is to introduce a novel approach to solve the one-to-one shortest path problem. A directed connected graph is assumed in which all edges’ weights are positive. Our method is based on a memetic algorithm in which we combine a genetic algorithm (GA) and a variable neighborhood search method (VNS). We compare our approximate method with two exact algorithms Dijkstra and Integer Programming (IP). We made experimentations using random generated, complete and real graph instances. In most case studies, numerical results show that our method outperforms exact methods with 5% average gap to the optimality. Our algorithm’s average speed is 20-times faster than Dijkstra and more than 1000-times compared to IP. The details of the experimental results are also discussed and presented in the paper.

Keywords: shortest path problem, Dijkstra’s algorithm, integer programming, memetic algorithm

Procedia PDF Downloads 466

Authors: Arman S. Kussainov, Altynbek K. Beisekov

Abstract:

This work focuses on building an efficient universal procedure to construct a single density of states from the multiple pieces of data provided by the parallel implementation of the Wang Landau Monte Carlo based algorithm. The Ising and Pott models were used as the examples of the two-dimensional spin lattices to construct their densities of states. Sampled energy space was distributed between the individual walkers with certain overlaps. This was made to include the latest development of the algorithm as the density of states replica exchange technique. Several factors of immediate importance for the seamless stitching process have being considered. These include but not limited to the speed and universality of the initial parallel algorithm implementation as well as the data post-processing to produce the expected smooth density of states.

Keywords: density of states, Monte Carlo, parallel algorithm, Wang Landau algorithm

Procedia PDF Downloads 412

Authors: Tayfun Çay, Yasar İnceyol, Abdurrahman Özbeyaz

Abstract:

Land reallocation is one of the most important steps in land consolidation projects. Many different models were proposed for land reallocation in the literature such as Fuzzy Logic, block priority based land reallocation and Spatial Decision Support Systems. A model including four parts is considered for automatic block reallocation with genetic algorithm method in land consolidation projects. These stages are preparing data tables for a project land, determining conditions and constraints of land reallocation, designing command steps and logical flow chart of reallocation algorithm and finally writing program codes of Genetic Algorithm respectively. In this study, we designed the first three steps of the considered model comprising four steps.

Keywords: land consolidation, landholding, land reallocation, optimization, genetic algorithm

Procedia PDF Downloads 431

Authors: Mark Daniel De Luna, Ma. Katreena Pillejera, Wei-Hsin Chen

Abstract:

The raw bamboo (Phyllostachys mankinoi), with a moisture content of 13.54 % and a higher heating value (HHV) of 17.657 MJ/kg, was subjected to torrefaction under a high gravity (higee) environment using a rotating packed bed. The performance of the higee torrefaction was explored in two parts: (1) effect of rotation and temperature and (2) effect of duration on the solid yield, HHV and energy yield. By statistical analyses, the results indicated that the rotation, temperature and their interaction has a significant effect on the three responses. Same remarks on the effect of duration where when the duration (temperature and rotation) increases, the HHV increases, while the solid yield and energy yield decreases. Graphical interpretations showed that at 300 °C, the rotating speed has no evident effect on the responses. At 30-min holding time, the highest HHV reached (28.389 MJ/kg) was obtained in the most severe torrefaction condition (the rotating speed at 1800 rpm and temperature at 300 °C) with an enhancement factor of HHV corresponding to 1.61 and an energy yield of 63.51%. Upon inspection, the recommended operating condition under a 30-min holding time is at 255 °C-1800 rpm since the enhancement factor of HHV (1.53), HHV (26.988 MJ/kg), and energy yield (65.21%) values are relatively close to that of the aforementioned torrefaction condition. The Van Krevelen diagram of the torrefied biomass showed that the ratios decrease as the torrefaction intensifies, hence improving the hydrophobicity of the product. The spreads of the results of the solid yield, enhancement factor (EF) of HHV, energy yield, and H/C and O/C ratios were in accordance with the trends of the responses. Overall, from the results presented, it can be concluded that the quality of the product from the process is at par to that of coal (i.e. HHV of coal is 21-35 MJ/kg). The Fourier transform infrared (FTIR) spectroscopy results indicated that cellulose and lignin may have been degraded at a lower temperature accompanied with a high rotating speed. The results suggested that torrefaction under higee environment indicates promising process for the utilization of bamboo.

Keywords: heat transfer, high gravity environment, FTIR, rotation, rotating speed, torrefaction

Procedia PDF Downloads 272

Authors: Dimitri Golenko-Ginzburg

Abstract:

A CPM network project with deterministic activity durations, in which activities require homogenous resources with fixed capacities, is considered. The problem is to determine the optimal schedule of starting times for all network activities within their maximal allowable limits (in order not to exceed the network's critical time) to minimize the maximum required resources for the project at any point in time. In case when a non-critical activity may start only at discrete moments with the pregiven time span, the problem becomes NP-complete and an optimal solution may be obtained via a look-over algorithm. For the case when a look-over requires much computational time an approximate algorithm is suggested. The algorithm's performance ratio, i.e., the relative accuracy error, is determined. Experimentation has been undertaken to verify the suggested algorithm.

Keywords: resource smoothing problem, CPM network, lookover algorithm, lexicographical order, approximate algorithm, accuracy estimate

Procedia PDF Downloads 302

Authors: Haiming Wen

Abstract:

Grain growth is an important and consequential phenomenon that generally occurs in the presence of thermal and/or stress/strain fields. Thermally activated grain growth has been extensively studied and similarly, there are numerous experimental and theoretical studies published describing stress-induced grain growth in single-phase materials. However, studies on grain growth during the simultaneous presence of an elevated temperature and an external stress are very limited, and moreover, grain growth phenomena in materials containing second-phase particles and solute segregation at GBs have received limited attention. This lecture reports on a study of grain growth in the presence of second-phase particles and solute/impurity segregation at grain boundaries (GBs) during high-temperature deformation of an ultra-fine grained (UFG) Al alloy synthesized via consolidation of mechanically milled powders. The mechanisms underlying the grain growth were identified as GB migration and grain rotation, which were accompanied by dynamic recovery and geometric dynamic recrystallization, while discontinuous dynamic recrystallization was not operative. A theoretical framework that incorporates the influence of second-phase particles and solute/impurity segregation at GBs on grain growth in presence of both elevated temperature and external stress is formulated and discussed. The effect of second-phase particles and solute/impurity segregation at GBs on GB migration and grain rotation was quantified using the proposed theoretical framework, indicating that both second-phase particles and solutes/impurities segregated GBs reduce the velocities of GB migration and grain rotation as compared to those in commercially pure Al. Our results suggest that grain growth predicted by the proposed theoretical framework is in agreement with experimental results. Hence, the developed theoretical framework can be applied to quantify grain growth in simultaneous presence of external stress, elevated temperature, GB segregation and second-phase particles, or in presence of one or more of the aforementioned factors.

Keywords: nanocrystalline materials, ultra-fine grained materials, grain growth, grain boundary migration, grain rotation

Procedia PDF Downloads 325

Authors: Aishik Deb, Rituparna Sinha

Abstract:

We have developed an algorithm to detect the abnormal segment/"structural variation in the genome across a number of samples. We have worked on simulated as well as real data from the BAM Files and have designed a segmentation algorithm where abnormal segments are detected. This algorithm aims to improve the accuracy and performance of the existing CNV-CH algorithm. The next-generation sequencing (NGS) approach is very fast and can generate large sequences in a reasonable time. So the huge volume of sequence information gives rise to the need for Big Data and parallel approaches of segmentation. Therefore, we have designed a map-reduce approach for the existing CNV-CH algorithm where a large amount of sequence data can be segmented and structural variations in the human genome can be detected. We have compared the efficiency of the traditional and map-reduce algorithms with respect to precision, sensitivity, and F-Score. The advantages of using our algorithm are that it is fast and has better accuracy. This algorithm can be applied to detect structural variations within a genome, which in turn can be used to detect various genetic disorders such as cancer, etc. The defects may be caused by new mutations or changes to the DNA and generally result in abnormally high or low base coverage and quantification values.

Keywords: cancer detection, convex hull segmentation, map reduce, next generation sequencing

Procedia PDF Downloads 136

Authors: Khaled Suleiman Mohammed Al-Mashrafi

Abstract:

A compositional plume is a fluid flow in a directional channel of finite width in another fluid of different material composition. The study of the dynamics of compositional plumes plays an essential role in many real-life applications like industrial applications (e.g., iron casting), environmental applications (e.g., salt fingers and sea ice), and geophysical applications (e.g., solidification at the inner core boundary (ICB) of the Earth, and mantle plumes). The dynamics of compositional plumes have been investigated experimentally and theoretically. The experimental works observed that the plume flow seems to be stable, although some experiments showed that it can be unstable. At the same time, the theoretical investigations showed that the plume flow is unstable. This is found to be true even if the plume is subject to rotation or/and in the presence of a magnetic field and even if another plume of different composition is also present. It is noticeable that all the theoretical studies on the dynamics of compositional plumes are conducted in unbounded domains. The present work is to investigate theoretically the influence of vertical walls (boundaries) on the dynamics of compositional plumes in the absence/presence of a rotation field. The mathematical model of the dynamics of compositional plumes used the equations of continuity, motion, heat, concentration of light material, and state. It is found that the presence of boundaries has a strong influence on the basic state solution as well as the stability of the plume, particularly when the plume is close to the boundary, but the compositional plume remains unstable.

Keywords: compositional plumes, stability, bounded domain, vertical boundaries

Procedia PDF Downloads 31

Authors: Manal Azzidani

Abstract:

This research consideres the extension of special functions called Positive Linear Operators. the bounded linear operator which defined from normed space to Banach space will extend to the closure of the its domain, And extend identified linear functional on a vector subspace by Hana-Banach theorem which could be generalized to the positive linear operators.

Keywords: extension, positive operator, Riesz space, sublinear function

Procedia PDF Downloads 517

Authors: Adesuyi Ayodeji Steve, Zahn Munch

Abstract:

This study investigates the use of MODIS NDVI to identify agricultural land cover change areas on an annual time step (2007 - 2012) and characterize the trend in the study area. An ISODATA classification was performed on the MODIS imagery to select only the agricultural class producing 3 class groups namely: agriculture, agriculture/semi-natural, and semi-natural. NDVI signatures were created for the time series to identify areas dominated by cereals and vineyards with the aid of ancillary, pictometry and field sample data. The NDVI signature curve and training samples aided in creating a decision tree model in WEKA 3.6.9. From the training samples two classification models were built in WEKA using decision tree classifier (J48) algorithm; Model 1 included ISODATA classification and Model 2 without, both having accuracies of 90.7% and 88.3% respectively. The two models were used to classify the whole study area, thus producing two land cover maps with Model 1 and 2 having classification accuracies of 77% and 80% respectively. Model 2 was used to create change detection maps for all the other years. Subtle changes and areas of consistency (unchanged) were observed in the agricultural classes and crop practices over the years as predicted by the land cover classification. 41% of the catchment comprises of cereals with 35% possibly following a crop rotation system. Vineyard largely remained constant over the years, with some conversion to vineyard (1%) from other land cover classes. Some of the changes might be as a result of misclassification and crop rotation system.

Keywords: change detection, land cover, modis, NDVI

Procedia PDF Downloads 402

Authors: Kristian Bautista, Ruben A. Idoy

Abstract:

A bio-inspired metaheuristic algorithm inspired by the theory of collective animal behavior (CAB) was integrated to density-based clustering modeled as multimodal optimization problem. The algorithm was tested on synthetic, Iris, Glass, Pima and Thyroid data sets in order to measure its effectiveness relative to CDE-based Clustering algorithm. Upon preliminary testing, it was found out that one of the parameter settings used was ineffective in performing clustering when applied to the algorithm prompting the researcher to do an investigation. It was revealed that fine tuning distance δ3 that determines the extent to which a given data point will be clustered helped improve the quality of cluster output. Even though the modification of distance δ3 significantly improved the solution quality and cluster output of the algorithm, results suggest that there is no difference between the population mean of the solutions obtained using the original and modified parameter setting for all data sets. This implies that using either the original or modified parameter setting will not have any effect towards obtaining the best global and local animal positions. Results also suggest that CDE-based clustering algorithm is better than CAB-density clustering algorithm for all data sets. Nevertheless, CAB-density clustering algorithm is still a good clustering algorithm because it has correctly identified the number of classes of some data sets more frequently in a thirty trial run with a much smaller standard deviation, a potential in clustering high dimensional data sets. Thus, the researcher recommends further investigation in the post-processing stage of the algorithm.

Keywords: clustering, metaheuristics, collective animal behavior algorithm, density-based clustering, multimodal optimization

Procedia PDF Downloads 230

Authors: Fariborz Ahmadi, Reza Tati

Abstract:

Genetic algorithm is a soft computing method that works on set of solutions. These solutions are called chromosome and the best one is the absolute solution of the problem. The main problem of this algorithm is that after passing through some generations, it may be produced some chromosomes that had been produced in some generations ago that causes reducing the convergence speed. From another respective, most of the genetic algorithms are implemented in software and less works have been done on hardware implementation. Our work implements genetic algorithm in hardware that doesn’t produce chromosome that have been produced in previous generations. In this work, most of genetic operators are implemented without producing iterative chromosomes and genetic diversity is preserved. Genetic diversity causes that not only do not this algorithm converge to local optimum but also reaching to global optimum. Without any doubts, proposed approach is so faster than software implementations. Evaluation results also show the proposed approach is faster than hardware ones.

Keywords: hardware, genetic algorithm, computer science, engineering

Procedia PDF Downloads 506

Authors: Anjan Naidu

Abstract:

In this paper we first discuss the minimum spanning tree, then we use the Kruskal algorithm to obtain minimum spanning tree. Based on Kruskal algorithm we propose Kruskal algorithm to apply an application to find minimum cost applying the concept of spanning tree.

Keywords: Minimum Spanning tree, algorithm, Heuxistic, application, classification of Sub 97K90

Procedia PDF Downloads 444

Authors: Ajay Sidana, Kulbir Singh Sandhu, Balwinder Singh Sidhu

Abstract:

Joining of dissimilar non-ferrous alloys like aluminium and magnesium alloys becomes important in various automobile and aerospace applications due to their low density and good corrosion resistance. Friction Stir Welding (FSW), a solid state joining process, successfully welds difficult to weld similar and dissimilar aluminum and magnesium alloys. Two tool rotation speeds were selected by keeping the transverse speed constant to weld similar and dissimilar alloys. Similar(Al to Al) and Dissimilar(Al to Mg) weld joints were obtained by FSW. SEM scans revealed that higher tool rotation fragments the coarse grains of base material into fine grains in the weld zone. Also, there are less welding defects in weld joints obtained with higher tool rotation speed. The material of dissimilar alloys was mixed with each other forming recrystallised new intermetallics. There was decrease in hardness of similar weld joint however there is significant increase in hardness of weld zone in case of dissimilar weld joints due to stirring action of tool and formation of inter metallics. Tensile tests revealed that there was decrease in percentage elongation in both similar and dissimilar weld joints.

Keywords: aluminum alloys, magnesium alloys, friction stir welding, microstructure, mechanical properties

Procedia PDF Downloads 455

Authors: Vahid Rashtchi, Ashkan Pirooz

Abstract:

This paper applies the Imperialist Competitive Algorithm (ICA) to find the optimal place and size of Static Compensator (STATCOM) in power systems. The output of the algorithm is a two dimensional array which indicates the best bus number and STATCOM's optimal size that minimizes all bus voltage deviations from their nominal value. Simulations are performed on IEEE 5, 14, and 30 bus test systems. Also some comparisons have been done between ICA and the famous Particle Swarm Optimization (PSO) algorithm. Results show that how this method can be considered as one of the most precise evolutionary methods for the use of optimum compensator placement in electrical grids.

Keywords: evolutionary computation, imperialist competitive algorithm, power systems compensation, static compensators, voltage profile

Procedia PDF Downloads 605

Authors: Guangyuan Zhao, Nan Huang, Xuesong Han, Xu Huang

Abstract:

In order to solve the problem of sample dilution in the traditional particle filter algorithm and achieve accurate state estimation in a nonlinear system, a particle filter method based on an improved artificial bee colony (ABC) algorithm was proposed. The algorithm simulated the process of bee foraging and optimization and made the high likelihood region of the backward probability of particles moving to improve the rationality of particle distribution. The opposition-based learning (OBL) strategy is introduced to optimize the initial population of the artificial bee colony algorithm. The convergence factor is introduced into the neighborhood search strategy to limit the search range and improve the convergence speed. Finally, the crossover and mutation operations of the genetic algorithm are introduced into the search mechanism of the following bee, which makes the algorithm jump out of the local extreme value quickly and continue to search the global extreme value to improve its optimization ability. The simulation results show that the improved method can improve the estimation accuracy of particle filters, ensure the diversity of particles, and improve the rationality of particle distribution.

Keywords: particle filter, impoverishment, state estimation, artificial bee colony algorithm

Procedia PDF Downloads 151

Authors: Alexey V. Klyuev, Valery P. Samarin, Viktor F. Klyuev, Andrey V. Klyuev

Abstract:

A power measurement algorithm of the input mix components of the noise signal and pulse interference is considered. The algorithm efficiency analysis has been carried out for different interference to signal ratio. Algorithm performance features have been explored by numerical experiment results.

Keywords: noise signal, pulse interference, signal power, spectrum width, detection

Procedia PDF Downloads 337

Authors: Doga Erisik, Ahmet Karaman, Gulfem Alptekin, Ozlem Durmaz Incel

Abstract:

Augmented reality (AR) is a type of virtual reality aiming to duplicate real world’s environment on a computer’s video feed. The mobile application, which is built for this project (called SARAS), enables annotating real world point of interests (POIs) that are located near mobile user. In this paper, we aim at introducing a robust and simple algorithm for placing labels in an augmented reality system. The system places labels of the POIs on the mobile device screen whose GPS coordinates are given. The proposed algorithm is compared to an existing one in terms of energy consumption and accuracy. The results show that the proposed algorithm gives better results in energy consumption and accuracy while standing still, and acceptably accurate results when driving. The technique provides benefits to AR browsers with its open access algorithm. Going forward, the algorithm will be improved to more rapidly react to position changes while driving.

Keywords: accurate tagging algorithm, augmented reality, localization, location-based AR

Procedia PDF Downloads 373

Authors: Diogen Babuc

Abstract:

The question that is a motivation of writing is how many devote themselves to discovering something in the world of science where much is discerned and revealed, but at the same time, much is unknown. Methods: The insightful elements of this algorithm are the ciphering and deciphering algorithms of Playfair, Caesar, and Vigenère. Only a few of their main properties are taken and modified, with the aim of forming a specific functionality of the algorithm called Latin Djokovic. Specifically, a string is entered as input data. A key k is given, with a random value between the values a and b = a+3. The obtained value is stored in a variable with the aim of being constant during the run of the algorithm. In correlation to the given key, the string is divided into several groups of substrings, and each substring has a length of k characters. The next step involves encoding each substring from the list of existing substrings. Encoding is performed using the basis of Caesar algorithm, i.e., shifting with k characters. However, that k is incremented by 1 when moving to the next substring in that list. When the value of k becomes greater than b+1, it’ll return to its initial value. The algorithm is executed, following the same procedure, until the last substring in the list is traversed. Results: Using this polyalphabetic method, ciphering and deciphering of strings are achieved. The algorithm also works for a 100-character string. The x character isn’t used when the number of characters in a substring is incompatible with the expected length. The algorithm is simple to implement, but it’s questionable if it works better than the other methods from the point of view of execution time and storage space.

Keywords: ciphering, deciphering, authentic, algorithm, polyalphabetic cipher, random key, methods comparison

Procedia PDF Downloads 103

Authors: Mohamed Mahmoud

Abstract:

This paper has developed an effect-cause analysis technique for fault diagnosis in digital circuits. The main algorithm of our technique is based on the Enhanced Deduction Algorithm, which processes the real response of the CUT to the applied test T to deduce the values of the internal lines. An experimental version of the algorithm has been implemented in C++. The code takes about 7592 lines. The internal values are determined based on the logic values under the permanent stuck-fault model. Using a backtracking strategy guarantees that the actual values are covered by at least one solution, or no solution is found.

Keywords: enhanced deduction algorithm, backtracking strategy, automatic test equipment, verfication

Procedia PDF Downloads 120

Authors: Aashutosh A. Tadse, Kush Mehta, Hardik Vyas

Abstract:

Friction Stir Welding is a process in which an FSW tool produces friction heat and thus penetrates through the junction and upon rotation carries out the weld by exchange of material within the 2 metals being welded. It involves holding the workpieces stiff enough to bear the force of the tool moving across the junction to carry out a successful weld. The weld that has flat plates as workpieces, has a quite simpler geometry in terms of fixture holding them. In the case of FSW of pipes, the pipes need to be held firm with the chucks and jaws according to the diameter of the pipes being welded; the FSW tool is then revolved around the pipes to carry out the weld. Machine requires a larger area and it becomes more costly because of such a setup. To carry out the weld on the Milling machine, the newly designed fixture must be set-up on the table of milling machine and must facilitate rotation of pipes by the motor being shafted to one end of the fixture, and the other end automatically rotated because of the rotating jaws held tight enough with the pipes. The set-up has tapered cones as the jaws that would go in the pipes thus holding it with the help of its knurled surface providing the required grip. The process has rotation of pipes with the stationary rotating tool penetrating into the junction. The FSW on pipes in this process requires a very low RPM of pipes to carry out a fine weld and the speed shall change with every combination of material and diameter of pipes, so a variable speed setting motor shall serve the purpose. To withstand the force of the tool, an attachment to the shaft is provided which will be diameter specific that will resist flow of material towards the center during the weld. The welded joint thus carried out will be proper to required standards and specifications. Current industrial requirements state the need of space efficient, cost-friendly and more generalized form of fixtures and set-ups of machines to be put up. The proposed design considers every mentioned factor and thus proves to be positive in the same.

Keywords: force of tool, friction stir welding, milling machine, rotation of pipes, tapered cones

Procedia PDF Downloads 114

Authors: Hossein Mottaghi T., Amir R. Masoodi

Abstract:

This study presents a finite curved element for analyzing the static behavior of curved beams within the elastic range. The objective is to enhance accuracy while reducing the number of elements by incorporating first-order shear deformations of Timoshenko beams. Initially, finite element formulations are developed by considering polynomial initial functions for axial, shear, and rotational deformations for a three-node element. Subsequently, nodal interpolation functions for this element are derived, followed by the construction of the element stiffness matrix. To enable the utilization of the stiffness matrix in the static analysis of curved beams, the constructed matrix in the local coordinates of the element is transformed to the global coordinate system using the rotation matrix. A numerical benchmark example is investigated to assess the accuracy and effectiveness of this method. Moreover, the influence of spring stiffness on the rotation of the endpoint of a clamped beam is examined by substituting each support reaction of the beam with a spring. In the parametric study, the effect of the central angle of the beam on the rotation of the beam's endpoint in a cantilever beam under a concentrated load is examined. This research encompasses various mechanical, geometrical, and boundary configurations to evaluate the static characteristics of curved beams, thus providing valuable insights for their analysis and examination.

Keywords: curved beam, finite element method, first-order shear deformation theory, elastic support

Procedia PDF Downloads 70

Authors: Michael Zaidman, Naum Simanovsky

Abstract:

The most of brachial birth palsies are transient. Children with incomplete recovery almost always develop an internal rotation and adduction contracture. The muscle imbalance around the shoulder results in glenohumeral joint deformity and functional limitations. Natural history of glenohumeral deformity is it’s progression with worsening of function. Anteversion glenoid osteotomy with latissimus dorsi and teres major tendon transfers could be an alternative procedure of proximal humeral external rotation osteotomy for patients with severe glenohumeral dysplasia secondary to brachial plexus birth palsy. We will discuss pre-operative planning and stepped operative technique of the procedure on clinical example.

Keywords: obstetric brachial plexus palsy, glenoid anteversion osteotomy, tendon transfer, operative technique

Procedia PDF Downloads 74