Search results for: optimal center distance

Authors: Barenten Suciu, Yuya Nakamoto

Abstract:

Power generation effect, obtained by inserting a piezo- electric sheet in the backlash clearance of a circular arc helical gear, is evaluated. Such type of screw gear is preferred since, in comparison with the involute tooth profile, the circular arc profile leads to reduced stress-concentration effects, and improved life of the piezoelectric film. Firstly, geometry of the circular arc helical gear, and properties of the piezoelectric sheet are presented. Then, description of the test-rig, consisted of a right-hand thread gear meshing with a left-hand thread gear, and the voltage measurement procedure are given. After creating the tridimensional (3D) model of the meshing gears in SolidWorks, they are 3D-printed in acrylonitrile butadiene styrene (ABS) resin. Variation of the generated voltage versus time, during a meshing cycle of the circular arc helical gear, is measured for various values of the center distance. Then, the change of the maximal, minimal, and peak-to-peak voltage versus the center distance is illustrated. Optimal center distance of the gear, to achieve voltage maximization, is found and its significance is discussed. Such results prove that the contact pressure of the meshing gears can be measured, and also, the electrical power can be generated by employing the proposed technique.

Keywords: circular arc helical gear, contact problem, optimal center distance, piezoelectric sheet, power generation

Procedia PDF Downloads 167

Authors: Skezeer John B. Paz, Ederlina G. Nocon

Abstract:

Finding an optimal binary linear code is a central problem in coding theory. A binary linear code C = [n, k, d] is called optimal if there is no linear code with higher minimum distance d given the length n and the dimension k. There are bounds giving limits for the minimum distance d of a linear code of fixed length n and dimension k. The lower bound which can be taken by construction process tells that there is a known linear code having this minimum distance. The upper bound is given by theoretic results such as Griesmer bound. One way to find an optimal binary linear code is to make the lower bound of d equal to its higher bound. That is, to construct a binary linear code which achieves the highest possible value of its minimum distance d, given n and k. Some optimal binary linear codes were presented by Andries Brouwer in his published table on bounds of the minimum distance d of binary linear codes for 1 ≤ n ≤ 256 and k ≤ n. This was further improved by Markus Grassl by giving a detailed construction process for each code exhibiting the lower bound. In this paper, we construct new optimal binary linear codes by using some construction processes on existing binary linear codes. Particularly, we developed an algorithm applied to the codes already constructed to extend the list of optimal binary linear codes up to 257 ≤ n ≤ 300 for k ≤ 7.

Keywords: bounds of linear codes, Griesmer bound, construction of linear codes, optimal binary linear codes

Procedia PDF Downloads 757

Authors: Yiqiong Yuan, Jun Sun, Dongmei Zhou, Jianan Sun

Abstract:

In this paper, we presented a Multi-Objective Random Drift Particle Swarm Optimization algorithm (MORDPSO-CD) based on RDPSO and crowding distance sorting to improve the convergence and distribution with less computation cost. MORDPSO-CD makes the most of RDPSO to approach the true Pareto optimal solutions fast. We adopt the crowding distance sorting technique to update and maintain the archived optimal solutions. Introducing the crowding distance technique into MORDPSO can make the leader particles find the true Pareto solution ultimately. The simulation results reveal that the proposed algorithm has better convergence and distribution

Keywords: multi-objective optimization, random drift particle swarm optimization, crowding distance sorting, pareto optimal solution

Procedia PDF Downloads 255

Authors: Abdolreza Noroozi Chakoli

Abstract:

This study aims to examine the impact of five effective factors on the success of the managers of distance knowledge sharing centers in Iran. To conduct it, 3 centers, including the National Library and Archives of Iran (NLAI), Scientific Information Database Center (SID), and Islamic World Science Citation Center (ISC), were selected to study the effect of five factors 'infrastructure of information technology', 'experienced staff', 'specialized staff', 'employee public relations' and 'the geographical location of the establishment' on the success of the centers. ANOVA test, Scheffe test, and Pearson's correlation test were used to analyze the data. The findings confirmed the effect of all 5 factors on the success of these centers. However, their effects are not the same on each factor. The results show each of these factors is not only individually but also together affect the success of centers for distance knowledge sharing. Moreover, it was demonstrated that there is a correlation between these factors. The results of this study show what factors determine the success of the centers and their efficiency in distance knowledge sharing in Iran.

Keywords: distance knowledge sharing centers, Iran’s knowledge centers, knowledge sharing centers, staff success

Procedia PDF Downloads 146

Authors: David Nkurunziza, Rahman Tafahomi

Abstract:

The population growth rate of the city of Kigali is increasing annually. In 1960 the population was six thousand, in 1990 it became two hundred thousand and is supposed to be 4 to 5 million incoming twenty years. With the increase in the residents living in the city of Kigali, there is also a need for an increase in social and economic infrastructures connected by the road networks to serve the residents effectively. A road network is a route that connects people to their needs and has to facilitate people to reach the social and economic facilities easily. This research analyzed the social and economic aspects of three selected roads networks passing through all three districts of the city of Kigali, whose center is the city center roundabout, thorough evaluation of the proximity of the social and economic facilities to the road network. These road networks are the city center to nyabugogo to karuruma, city center to kanogo to Rwanda to kicukiro center to Nyanza taxi park, and city center to Yamaha to kinamba to gakinjiro to kagugu health center road network. This research used a methodology of identifying and quantifying the social and economic facilities within a limited distance of 300 meters along each side of the road networks. Social facilities evaluated are the health facilities, education facilities, institution facilities, and worship facilities, while the economic facilities accessed are the commercial zones, industries, banks, and hotels. These facilities were evaluated and graded based on their distance from the road and their value. The total scores of each road network per kilometer were calculated and finally, the road networks were ranked based on their percentage score per one kilometer—this research was based on field surveys and interviews to collect data with forms and questionnaires. The analysis of the data collected declared that the road network from the city center to Yamaha to kinamba to gakinjiro to the kagugu health center is the best performer, the second is the road network from the city center to nyabugogo to karuruma, while the third is the road network from the city center to kanogo to rwandex to kicukiro center to nyaza taxi park.

Keywords: social economical aspect, road network functionality, urban road network, economic and social facilities

Procedia PDF Downloads 162

Authors: Soner Nandappa D., Ahmed Mohammed Naji

Abstract:

In a graph G = (V, E), the distance from a vertex v to a vertex u is the length of shortest v to u path. The eccentricity e(v) of v is the distance to a farthest vertex from v. The diameter diam(G) is the maximum eccentricity. The k-distance neighborhood of v, for 0 ≤ k ≤ e(v), is Nk(v) = {u ϵ V (G) : d(v, u) = k}. In this paper, we introduce a new distance degree based topological polynomial of a graph G is called a k- distance neighborhood polynomial, denoted Nk(G, x). It is a polynomial with the coefficient of the term k, for 0 ≤ k ≤ e(v), is the sum of the cardinalities of Nk(v) for every v ϵ V (G). Some properties of k- distance neighborhood polynomials are obtained. Exact formulas of the k- distance neighborhood polynomial for some well-known graphs, Cartesian product and join of graphs are presented.

Keywords: vertex degrees, distance in graphs, graph operation, Nk-polynomials

Procedia PDF Downloads 552

Authors: Leila Goosen, Toppie N. Mukasa-Lwanga

Abstract:

The purpose of this paper relates to exploring academics’ use of distance education technologies for empowerment and equity in an Information Technology environment. Literature was studied on academics’ technology use towards effective teaching and meaningful learning in a distance education Information Technology environment. Main arguments presented center on formulating and situating significant concepts within an appropriate theoretical and conceptual framework, including those related to distance education, throughput and other measures of academic efficiency. The research design, sampling, data collection instrument and the validity and reliability thereof, as well as the data analysis method used is described. The paper discusses results related to academics’ use of technology towards effective teaching and meaningful learning in a distance education Information Technology environment. Conclusions are finally presented on the way in which this paper makes a significant and original contribution regarding academics’ use of technology towards effective teaching and meaningful learning in a distance education Information Technology environment.

Keywords: distance, education, technologies, Information Technology Environment

Procedia PDF Downloads 525

Authors: Artiya Sopharak, Tosaphol Ratniyomchai, Thanatchai Kulworawanichpong

Abstract:

This paper presents an energy-saving study of Mass Rapid Transit (MRT) using an optimal train coasting operation. For the dynamic train movement with four modes of operation, including accelerating mode, constant speed or cruising mode, coasting mode, and braking mode are considered in this study. The acceleration rate, the deceleration rate, and the starting coasting point are taken into account the optimal train speed profile during coasting mode with considering the energy saving and acceptable travel time comparison to the based case with no coasting operation. In this study, the mathematical method as a Quadratic Search Method (QDS) is conducted to carry out the optimization problem. A single train of MRT services between two stations with a distance of 2 km and a maximum speed of 80 km/h is taken to be the case study. Regarding the coasting mode operation, the results show that the longer distance of costing mode, the less energy consumption in cruising mode and the less braking energy. On the other hand, the shorter distance of coasting mode, the more energy consumption in cruising mode and the more braking energy.

Keywords: energy saving, coasting mode, mass rapid transit, quadratic search method

Procedia PDF Downloads 302

Authors: Nathakhun Wiroonsri

Abstract:

There are various cluster validity measures used for evaluating clustering results. One of the main objectives of using these measures is to seek the optimal unknown number of clusters. Some measures work well for clusters with different densities, sizes and shapes. Yet, one of the weaknesses that those validity measures share is that they sometimes provide only one clear optimal number of clusters. That number is actually unknown and there might be more than one potential sub-optimal option that a user may wish to choose based on different applications. We develop two new cluster validity indices based on a correlation between an actual distance between a pair of data points and a centroid distance of clusters that the two points are located in. Our proposed indices constantly yield several peaks at different numbers of clusters which overcome the weakness previously stated. Furthermore, the introduced correlation can also be used for evaluating the quality of a selected clustering result. Several experiments in different scenarios, including the well-known iris data set and a real-world marketing application, have been conducted to compare the proposed validity indices with several well-known ones.

Keywords: clustering algorithm, cluster validity measure, correlation, data partitions, iris data set, marketing, pattern recognition

Procedia PDF Downloads 103

Authors: Karthikeyan Kalirajan, Ashok Joshi

Abstract:

An optimization problem is to setup to maximize the terminal kinetic energy of a maneuverable reentry vehicle (MaRV). The target location, the impact angle is given as constraints. The MaRV uses an explicit guidance law called Vector guidance. This law has two gains which are taken as decision variables. The problem is to find the optimal value of these gains which will result in minimum miss distance and impact angle error. Using a simple 3DOF non-rotating flat earth model and Lockheed martin HP-MARV as the reentry vehicle, the nature of solutions of the optimization problem is studied. This is achieved by carrying out a parametric study for a range of closed loop gain values and the corresponding impact angle error and the miss distance values are generated. The results show that there are well defined lower and upper bounds on the gains that result in near optimal terminal guidance solution. It is found from this study, that there exist common permissible regions (values of gains) where all constraints are met. Moreover, the permissible region lies between flat regions and hence the optimization algorithm has to be chosen carefully. It is also found that, only one of the gain values is independent and that the other dependent gain value is related through a simple straight-line expression. Moreover, to reduce the computational burden of finding the optimal value of two gains, a guidance law called Diveline guidance is discussed, which uses single gain. The derivation of the Diveline guidance law from Vector guidance law is discussed in this paper.

Keywords: Marv guidance, reentry trajectory, trajectory optimization, guidance gain selection

Procedia PDF Downloads 429

Authors: H. V. H. De Soysa, N. D. Hiripitiya, H. S. U. Thrimavithana, B. R. Epitawala, K. A. D. D. Kuruppu, D. J. K. Lokupathirage

Abstract:

This research was based on developing a mechanism in order to optimize the landing distance. Short distance braking and long distance braking may cause several issues for the aircraft including tyre wearing. The worst case occurs with short distance landing. The issues related to short distance landing were identified after conducting interviews with pilots, aeronautical engineers and technicians. A model was constructed in order to optimize the landing distance. The device started to function at the point where the main wheels of the aircraft touchdown the runway. It was found that implementing this device to the aircraft benefits to optimize the landing distance. This could lead to rectifying several issues occurred due to improper braking distances.

Keywords: aircraft, mechanism, optimize landing distance, runway

Procedia PDF Downloads 318

Authors: Vinai K. Singh

Abstract:

For reducing impulsive noise without degrading image contours, median filtering is a powerful tool. In multiband images as for example colour images or vector fields obtained by optic flow computation, a vector median filter can be used. Vector median filters are defined on the basis of a suitable distance, the best performing distance being the Euclidean. Euclidean distance is evaluated by using the Euclidean norms which is quite demanding from the point of view of computation given that a square root is required. In this paper an optimal piece-wise linear approximation of the Euclidean norm is presented which is applied to vector median filtering.

Keywords: euclidean norm, quasi euclidean norm, vector median filtering, applied mathematics

Procedia PDF Downloads 474

Authors: Ritu Vashistha, Jitender Kumar

Abstract:

Clustering using the K-means algorithm is a very common way to understand and analyze the obtained output data. When a similar object is grouped, this is called the basis of Clustering. There is K number of objects and C number of cluster in to single cluster in which k is always supposed to be less than C having each cluster to be its own centroid but the major problem is how is identify the cluster is correct based on the data. Formulation of the cluster is not a regular task for every tuple of row record or entity but it is done by an iterative process. Each and every record, tuple, entity is checked and examined and similarity dissimilarity is examined. So this iterative process seems to be very lengthy and unable to give optimal output for the cluster and time taken to find the cluster. To overcome the drawback challenge, we are proposing a formula to find the clusters at the run time, so this approach can give us optimal results. The proposed approach uses the Euclidian distance formula as well melanosis to find the minimum distance between slots as technically we called clusters and the same approach we have also applied to Ant Colony Optimization(ACO) algorithm, which results in the production of two and multi-dimensional matrix.

Keywords: ant colony optimization, data clustering, centroids, data mining, k-means

Procedia PDF Downloads 128

Authors: A. Torokhti

Abstract:

A new method of mathematical modeling of the distributed nonlinear system is developed. The system is represented by a combination of the set of spatially distributed sensors and the fusion center. Its mathematical model is obtained from the iterative procedure that converges to the model which is optimal in the sense of minimizing an associated cost function.

Keywords: mathematical modeling, non-linear system, spatially distributed sensors, fusion center

Procedia PDF Downloads 383

Authors: M. Meftahi, M. Hoseinzadeh, S. A. Naeini

Abstract:

Selection of soil bearing capacity is an important issue that should be investigated under different conditions. The bearing capacity of foundation around of soil slope is based on the active and passive forces. On the other hand, due to extension of urban structures, it is inevitable to put the foundations together. Concerning the two cases mentioned above, investigating the behavior of adjacent foundations which are constructed besides soil slope is essential. It should be noted that, according to the conditions, the bearing capacity of adjacent foundations can be less or more than mat foundations. Also, soil reinforcement increases the bearing capacity of adjacent foundations, and the amount of its increase depends on the distance between foundations. In this research, based on numerical studies, a method is presented for evaluating ultimate bearing capacity of adjacent foundations at different intervals. In the present study, the effect of foundation width, the center to center distance of adjacent foundations and reinforced soil has been investigated on the bearing capacity of adjacent foundations beside soil slope. The results indicate that, due to interference of failure surfaces created under foundation, it depends on their intervals and the ultimate bearing capacity of foundation varies.

Keywords: adjacent foundation, bearing capacity, reinforcements, settlement, numerical analysis

Procedia PDF Downloads 171

Authors: Tosaporn Mahamud

Abstract:

The foundation of the Islamic center of Thailand plays a vital role in order to bring diverse Muslim communities in a common place. The center itself is a bridge between Muslims in Thailand and Islamic world. The operational task of the center runs by many organizations through the funds and funds use for different activities for empowerment of Thai society in general and Muslim community in particular. This paper aims to focus on the role of the foundation of the Islamic center of Thailand to the Thai society. This paper also finds out the historical background of the center in term of building structure and design and functions.

Keywords: design, empowerment, islamic, society

Procedia PDF Downloads 376

Authors: Ayça Utkan Karasu, Elif Balevi Batur, Gülçin Kaymak Karataş

Abstract:

The aim of this study was to examine the efficiency of virtual reality exercises with Nintendo Wii system on balance and independence in motor functions. This randomized controlled assessor-blinded study included 23 stroke inpatients with hemiparesis all within 12 months poststroke. Patients were randomly assigned to control group (n=11) or experimental group (n=12) via block randomization method. Control group participated in a conventional balance rehabilitation programme. Study group received a four-week balance training programme five times per week with a session duration of 20 minutes in addition to the conventional balance rehabilitation programme. Balance was assessed by the Berg’s balance scale, the functional reach test, the timed up and go test, the postural assessment scale for stroke, the static balance index. Also, displacement of centre of pressure sway and centre of pressure displacement during weight shifting was calculated by Emed-SX system. Independence in motor functions was assessed by The Functional Independence Measure (FIM) ambulation and FIM transfer subscales. The outcome measures were evaluated at baseline, 4th week (posttreatment), 8th week (follow-up). Repeated measures analysis of variance was performed for each of the outcome measure. Significant group time interaction was detected in the scores of the Berg’s balance scale, the functional reach test, eyes open anteroposterior and mediolateral center of pressure sway distance, eyes closed anteroposterior center of pressure sway distance, center of pressure displacement during weight shifting to effected side, unaffected side and total centre of pressure displacement during weight shifting (p < 0.05). Time effect was statistically significant in the scores of the Berg’s balance scale, the functional reach test, the timed up and go test, the postural assessment scale for stroke, the static balance index, eyes open anteroposterior and mediolateral center of pressure sway distance, eyes closed mediolateral center of pressure sway distance, the center of pressure displacement during weight shifting to effected side, the functional independence measure ambulation and transfer scores (p < 0.05). Virtual reality exercises with Nintendo Wii system combined with a conventional balance rehabilitation programme enhances balance performance and independence in motor functions in stroke patients.

Keywords: balance, hemiplegia, stroke rehabilitation, virtual reality

Procedia PDF Downloads 221

Authors: Abdelsalam Omar

Abstract:

This paper presents simulation-based case study that indicate the need for accurate dynamic modeling of distance protection relay. In many cases, a static analysis based on current and voltage phasors may be sufficient to assess the performance of distance protection. There are several circumstances under which such a simplified study does not provide the depth of analysis necessary to obtain accurate results, however. This letter present study of the influences of magnetizing inrush and power swing on the performance of distance protection relay. One type of numerical distance protection relay has been investigated: 7SA511. The study has been performed in order to demonstrate the relay response when dynamic model of distance relay is utilized.

Keywords: distance protection, magnitizing inrush, power swing, dynamic model of protection relays, simulatio

Procedia PDF Downloads 489

Authors: Beom-Ryeol Choi, Won-Poong Lee, Jin-Young Choi, Young-Hak Shin, Dong-Jun Won

Abstract:

A Microgrid (MG) has a major role in power system. There are numerous benefits, such as ability to reduce environmental impact and enhance the reliability of a power system. Hence, Multi-MG (MMG) consisted of multiple MGs is being studied intensively. This paper proposes the optimal power exchange of MMG with hierarchical coordination. The whole system architecture consists of two layers: 1) upper layer including MG of MG Center (MoMC) which is in charge of the overall management and coordination and 2) lower layer comprised of several Microgrid-Energy Management Systems (MG-EMSs) which make a decision for own schedule. In order to accomplish the optimal power exchange, the proposed coordination algorithm is applied to MMG system. The objective of this process is to achieve optimal operation for improving economics under the grid-connected operation. The simulation results show how the output of each MG can be changed through coordination algorithm.

Keywords: microgrids, multi-microgrids, power exchange, hierarchical coordination

Procedia PDF Downloads 372

Authors: Cheng Fang Hsu

Abstract:

Call center is the core of building customer relationship management system. Under the strong competitive stress, it becomes a new profiting challenge for a successful enterprise. Call center is a department not only to provide customer service but also to bring business profit. This is the qualitative case study in Taiwan bank service industry which goes on deeper exploration, and analysis by business interviews and industrial analysis. This study starts from the establishment, development, and management after the reforming of the case call center. Through SWOT analysis, and industrial analysis, this study adopted 7S model to explain how the call center reforms from service oriented to profit oriented and from cost management to profit management. The results indicated how service innovation management promotes call center to be operated as a market profit competition center. The recommendations are indicated to support the call center on marketing profit by service innovation management.

Keywords: call center, 7S model, service innovation management, bioinformatics

Procedia PDF Downloads 490

Authors: Nishant Shrivastava, D. K. Sehgal

Abstract:

In Finite Element Technique nodal stresses are calculated through displacement as nodes. In this process, the displacement calculated at nodes is sufficiently good enough but stresses calculated at nodes are not sufficiently accurate. Therefore, the accuracy in the stress computation in FEM models based on the displacement technique is obviously matter of concern for computational time in shape optimization of engineering problems. In the present work same is focused to find out unique points within the element as well as the boundary of the element so, that good accuracy in stress computation can be achieved. Generally, major optimal stress points are located in domain of the element some points have been also located at boundary of the element where stresses are fairly accurate as compared to nodal values. Then, it is subsequently concluded that there is an existence of unique points within the element, where stresses have higher accuracy than other points in the elements. Therefore, it is main aim is to evolve a generalized procedure for the determination of the optimal stress location inside the element as well as at the boundaries of the element and verify the same with results from numerical experimentation. The results of quadratic 9 noded serendipity elements are presented and the location of distinct optimal stress points is determined inside the element, as well as at the boundaries. The theoretical results indicate various optimal stress locations are in local coordinates at origin and at a distance of 0.577 in both directions from origin. Also, at the boundaries optimal stress locations are at the midpoints of the element boundary and the locations are at a distance of 0.577 from the origin in both directions. The above findings were verified through experimentation and findings were authenticated. For numerical experimentation five engineering problems were identified and the numerical results of 9-noded element were compared to those obtained by using the same order of 25-noded quadratic Lagrangian elements, which are considered as standard. Then root mean square errors are plotted with respect to various locations within the elements as well as the boundaries and conclusions were drawn. After numerical verification it is noted that in a 9-noded element, origin and locations at a distance of 0.577 from origin in both directions are the best sampling points for the stresses. It was also noted that stresses calculated within line at boundary enclosed by 0.577 midpoints are also very good and the error found is very less. When sampling points move away from these points, then it causes line zone error to increase rapidly. Thus, it is established that there are unique points at boundary of element where stresses are accurate, which can be utilized in solving various engineering problems and are also useful in shape optimizations.

Keywords: finite elements, Lagrangian, optimal stress location, serendipity

Procedia PDF Downloads 106

Authors: Dimitrios Vlachopoulos, George Tsokkas

Abstract:

Although it is not intended to identify distance education students as a homogeneous group, recent research has demonstrated that there are some demographic and personality common traits among most of them that provide the basis for the description of a typical distance learning student. The purpose of this paper is to describe these common traits and to facilitate their learning journey within a distance education program. The described research is an initiative of the Distance Education Unit at the European University Cyprus (Laureate International Universities) in the context of its action for the improvement of the students’ performance.

Keywords: distance education students, successful student performance, European University Cyprus, common traits

Procedia PDF Downloads 486

Authors: Lydia Wahid, Mona F. Ahmed, Nevin Darwish

Abstract:

The vehicle routing problem (VRP) consists of a group of customers that needs to be served. Each customer has a certain demand of goods. A central depot having a fleet of vehicles is responsible for supplying the customers with their demands. The problem is composed of two subproblems: The first subproblem is an assignment problem where the number of vehicles that will be used as well as the customers assigned to each vehicle are determined. The second subproblem is the routing problem in which for each vehicle having a number of customers assigned to it, the order of visits of the customers is determined. Optimal number of vehicles, as well as optimal total distance, should be achieved. In this paper, an approach for solving the first subproblem (the assignment problem) is presented. In the approach, a clustering algorithm is proposed for finding the optimal number of vehicles by grouping the customers into clusters where each cluster is visited by one vehicle. Finding the optimal number of clusters is NP-hard. This work presents a polynomial time clustering algorithm for finding the optimal number of clusters and solving the assignment problem.

Keywords: vehicle routing problems, clustering algorithms, Clarke and Wright Saving Method, agglomerative hierarchical clustering

Procedia PDF Downloads 394

Authors: Jae Moon Lee

Abstract:

Generally the predator will continuously aim to attack the prey, while the prey will maintain a safe distance from the predator in order to avoid it . If the predator has enough energy to chase a certain amount of distance, it will begin to attack the prey. The prey needs to approach the predator for various reasons such as getting food. However, it will also try to keep a safe distance because of the threat of predators. The safe distance is dependent on the amount of the energy of predator, and the behaviors of prey is changed according to the size of the safe distance. This paper is to simulate the behaviors of preys to avoid the pursuit of predator based on the safe distance. The simulations will be executed experimentally under single predator and multiple preys. The results of the simulations show that the amount of energy of predator gives a great influence on the behavior of the prey.

Keywords: predator, prey, energy, safe distance, simulation

Procedia PDF Downloads 266

Authors: Geetika Barman, B. S. Daya Sagar

Abstract:

In this article, we proposed a pixel-wise classification of hyperspectral images using a mathematical morphology operator-based distance metric called “dilation distance” and “erosion distance”. This method involves measuring the spatial distance between the spectral features of a hyperspectral image across the bands. The key concept of the proposed approach is that the “dilation distance” is the maximum distance a pixel can be moved without changing its classification, whereas the “erosion distance” is the maximum distance that a pixel can be moved before changing its classification. The spectral signature of the hyperspectral image carries unique class information and shape for each class. This article demonstrates how easily the dilation and erosion distance can measure spatial distance compared to other approaches. This property is used to calculate the spatial distance between hyperspectral image feature vectors across the bands. The dissimilarity matrix is then constructed using both measures extracted from the feature spaces. The measured distance metric is used to distinguish between the spectral features of various classes and precisely distinguish between each class. This is illustrated using both toy data and real datasets. Furthermore, we investigated the role of flat vs. non-flat structuring elements in capturing the spatial features of each class in the hyperspectral image. In order to validate, we compared the proposed approach to other existing methods and demonstrated empirically that mathematical operator-based distance metric classification provided competitive results and outperformed some of them.

Keywords: dilation distance, erosion distance, hyperspectral image classification, mathematical morphology

Procedia PDF Downloads 88

Authors: R. B. Patil, B. S. Kothavale, L. Y. Waghmode

Abstract:

Today, the CNC turning center becomes an important machine tool for manufacturing industry worldwide. However, as the breakdown of a single CNC turning center may result in the production of an entire plant being halted. For this reason, operations and preventive maintenance have to be minimized to ensure availability of the system. Indeed, improving the availability of the CNC turning center as a whole, objectively leads to a substantial reduction in production loss, operating, maintenance and support cost. In this paper, fault tree analysis (FTA) method is used for reliability analysis of CNC turning center. The major faults associated with the system and the causes for the faults are presented graphically. Boolean algebra is used for evaluating fault tree (FT) diagram and for deriving governing reliability model for CNC turning center. Failure data over a period of six years has been collected and used for evaluating the model. Qualitative and quantitative analysis is also carried out to identify critical sub-systems and components of CNC turning center. It is found that, at the end of the warranty period (one year), the reliability of the CNC turning center as a whole is around 0.61628.

Keywords: fault tree analysis (FTA), reliability analysis, risk assessment, hazard analysis

Procedia PDF Downloads 416

Authors: Loai AbdAllah, Mahmoud Kaiyal

Abstract:

Missing values in real-world datasets are a common problem. Many algorithms were developed to deal with this problem, most of them replace the missing values with a fixed value that was computed based on the observed values. In our work, we used a distance function based on Bhattacharyya distance to measure the distance between objects with missing values. Bhattacharyya distance, which measures the similarity of two probability distributions. The proposed distance distinguishes between known and unknown values. Where the distance between two known values is the Mahalanobis distance. When, on the other hand, one of them is missing the distance is computed based on the distribution of the known values, for the coordinate that contains the missing value. This method was integrated with Wikaya, a digital health company developing a platform that helps to improve prevention of chronic diseases such as diabetes and cancer. In order for Wikaya’s recommendation system to work distance between users need to be measured. Since there are missing values in the collected data, there is a need to develop a distance function distances between incomplete users profiles. To evaluate the accuracy of the proposed distance function in reflecting the actual similarity between different objects, when some of them contain missing values, we integrated it within the framework of k nearest neighbors (kNN) classifier, since its computation is based only on the similarity between objects. To validate this, we ran the algorithm over diabetes and breast cancer datasets, standard benchmark datasets from the UCI repository. Our experiments show that kNN classifier using our proposed distance function outperforms the kNN using other existing methods.

Keywords: missing values, incomplete data, distance, incomplete diabetes data

Procedia PDF Downloads 225

Authors: Loai Abdallah, Malik Yousef

Abstract:

A domain space for the data should reflect the actual similarity between objects. Since objects belonging to the same cluster usually share some common traits even though their geometric distance might be relatively large. In general, the Euclidean distance of data points that represented by large number of features is not capturing the actual relation between those points. In this study, we propose a new method to construct a different space that is based on clustering to form a new distance metric. The new distance space is based on ensemble clustering (EC). The EC distance space is defined by tracking the membership of the points over multiple runs of clustering algorithm metric. Over this distance, we train the decision trees classifier (DT-EC). The results obtained by applying DT-EC on 10 datasets confirm our hypotheses that embedding the EC space as a distance metric would improve the performance.

Keywords: ensemble clustering, decision trees, classification, K nearest neighbors

Procedia PDF Downloads 191

Authors: Deli Mona, Rafika Husni

Abstract:

The aim of this research is to evaluate the effect of lighting distance on surface hardness of light composite resin. We held laboratory experimental research with post-test only group design. The samples used are 30 disc-like hybrid composite resins with the diameter is 6 mm and the thickness is 2 mm, lighted by an LED for 20 seconds. They were divided into 3 groups, and every group was consisted by 10 samples, which were 0 mm, 2 mm, and 5 mm lighting distance group. Every samples group was treated with hardness test, Vicker Hardness Test, then analyzed with one-way ANOVA test to evaluate the effect of lighting distance differences on surface hardness of light composite resin. Statistic test result shown hardness mean change of composite renin between 0 mm and 2 mm lighting distance with 0.00 significance (p<0.05), between 0 mm and 5 mm lighting distance with 0.00 significance (p<0.05), and 2 mm and 5 mm lighting distance with 0.05 significance (p<0.05). According to the result of this research, we concluded that the further lighting distance, the more surface hardness decline of hybrid composite resin.

Keywords: composite resin hybrid, tip distance, microhardness, light curing LED

Procedia PDF Downloads 349

Authors: Wen Liu

Abstract:

With the rapid progress of modern cities, the railway construction must be developing quickly in China. As a typical high-density country, shopping center on the subway should be one important factor during the process of urban development. The paper discusses the influence of the layout of shopping center on the subway, and put it in the time and space’s axis of Shanghai urban development. We use the digital technology to establish the database of relevant information. And then get the change role about shopping center on subway in Shanghaiby the Kernel density estimate. The result shows the development of shopping center on subway has a relationship with local economic strength, population size, policy support, and city construction. And the suburbanization trend of shopping center would be increasingly significant. By this case research, we could see the Kernel density estimate is an efficient analysis method on the spatial layout. It could reveal the characters of layout form of shopping center on subway in essence. And it can also be applied to the other research of space form.

Keywords: Shanghai, shopping center on the subway, layout form, Kernel density estimate

Procedia PDF Downloads 316