Search results for: Saddle point problem
4419 An Improved Method to Compute Sparse Graphs for Traveling Salesman Problem
Authors: Y. Wang
Abstract:
The Traveling salesman problem (TSP) is NP-hard in combinatorial optimization. The research shows the algorithms for TSP on the sparse graphs have the shorter computation time than those for TSP according to the complete graphs. We present an improved iterative algorithm to compute the sparse graphs for TSP by frequency graphs computed with frequency quadrilaterals. The iterative algorithm is enhanced by adjusting two parameters of the algorithm. The computation time of the algorithm is O(CNmaxn2) where C is the iterations, Nmax is the maximum number of frequency quadrilaterals containing each edge and n is the scale of TSP. The experimental results showed the computed sparse graphs generally have less than 5n edges for most of these Euclidean instances. Moreover, the maximum degree and minimum degree of the vertices in the sparse graphs do not have much difference. Thus, the computation time of the methods to resolve the TSP on these sparse graphs will be greatly reduced.
Keywords: Frequency quadrilateral, iterative algorithm, sparse graph, traveling salesman problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 9974418 A Robust Method for Finding Nearest-Neighbor using Hexagon Cells
Authors: Ahmad Attiq Al-Ogaibi, Ahmad Sharieh, Moh’d Belal Al-Zoubi, R. Bremananth
Abstract:
In pattern clustering, nearest neighborhood point computation is a challenging issue for many applications in the area of research such as Remote Sensing, Computer Vision, Pattern Recognition and Statistical Imaging. Nearest neighborhood computation is an essential computation for providing sufficient classification among the volume of pixels (voxels) in order to localize the active-region-of-interests (AROI). Furthermore, it is needed to compute spatial metric relationships of diverse area of imaging based on the applications of pattern recognition. In this paper, we propose a new methodology for finding the nearest neighbor point, depending on making a virtually grid of a hexagon cells, then locate every point beneath them. An algorithm is suggested for minimizing the computation and increasing the turnaround time of the process. The nearest neighbor query points Φ are fetched by seeking fashion of hexagon holistic. Seeking will be repeated until an AROI Φ is to be expected. If any point Υ is located then searching starts in the nearest hexagons in a circular way. The First hexagon is considered be level 0 (L0) and the surrounded hexagons is level 1 (L1). If Υ is located in L1, then search starts in the next level (L2) to ensure that Υ is the nearest neighbor for Φ. Based on the result and experimental results, we found that the proposed method has an advantage over the traditional methods in terms of minimizing the time complexity required for searching the neighbors, in turn, efficiency of classification will be improved sufficiently.
Keywords: Hexagon cells, k-nearest neighbors, Nearest Neighbor, Pattern recognition, Query pattern, Virtually grid
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 27824417 A Family of Distributions on Learnable Problems without Uniform Convergence
Authors: César Garza
Abstract:
In supervised binary classification and regression problems, it is well-known that learnability is equivalent to uniform convergence of the hypothesis class, and if a problem is learnable, it is learnable by empirical risk minimization. For the general learning setting of unsupervised learning tasks, there are non-trivial learning problems where uniform convergence does not hold. We present here the task of learning centers of mass with an extra feature that “activates” some of the coordinates over the unit ball in a Hilbert space. We show that the learning problem is learnable under a stable RLM rule. We introduce a family of distributions over the domain space with some mild restrictions for which the sample complexity of uniform convergence for these problems must grow logarithmically with the dimension of the Hilbert space. If we take this dimension to infinity, we obtain a learnable problem for which the uniform convergence property fails for a vast family of distributions.
Keywords: Statistical learning theory, learnability, uniform convergence, stability, regularized loss minimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3114416 Power Allocation in User-Centric Cell-Free Massive MIMO Systems with Limited Fronthaul Capacity
Authors: Siminfar Samakoush Galougah
Abstract:
In this paper, we study two power allocation problems for an uplink user-centric (UC) cell-free massive multiple-input multiple-output (CF-mMIMO) system. Besides, we assume each access point (AP) is connected to a central processing unit (CPU) via fronthaul link with limited capacity. To efficiently use the fronthaul capacity, two strategies for transmitting signals from APs to the CPU are employed; namely: compress-forward-estimate (CFE), estimate-compress-forward (ECF). The capacity of the aforementioned strategies in user-centric CF-mMIMO are drived. Then, we solved the two power allocation problems with minimum Spectral Efficiency (SE) and sum-SE maximization objectives for ECF and CFE strategies.
Keywords: Cell-free massive MIMO, limited capacity fronthaul, spectral efficiency, power allocation problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 314415 Genetic Algorithms with Oracle for the Traveling Salesman Problem
Authors: Robin Gremlich, Andreas Hamfelt, Héctor de Pereda, Vladislav Valkovsky
Abstract:
By introducing the concept of Oracle we propose an approach for improving the performance of genetic algorithms for large-scale asymmetric Traveling Salesman Problems. The results have shown that the proposed approach allows overcoming some traditional problems for creating efficient genetic algorithms.
Keywords: Genetic algorithms, Traveling Salesman Problem, optimal decision distribution, oracle.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17094414 Optimization Approach to Estimate Hammerstein–Wiener Nonlinear Blocks in Presence of Noise and Disturbance
Authors: Leili Esmaeilani, Jafar Ghaisari, Mohsen Ahmadian
Abstract:
Hammerstein–Wiener model is a block-oriented model where a linear dynamic system is surrounded by two static nonlinearities at its input and output and could be used to model various processes. This paper contains an optimization approach method for analysing the problem of Hammerstein–Wiener systems identification. The method relies on reformulate the identification problem; solve it as constraint quadratic problem and analysing its solutions. During the formulation of the problem, effects of adding noise to both input and output signals of nonlinear blocks and disturbance to linear block, in the emerged equations are discussed. Additionally, the possible parametric form of matrix operations to reduce the equation size is presented. To analyse the possible solutions to the mentioned system of equations, a method to reduce the difference between the number of equations and number of unknown variables by formulate and importing existing knowledge about nonlinear functions is presented. Obtained equations are applied to an instance H–W system to validate the results and illustrate the proposed method.Keywords: Identification, Hammerstein-Wiener, optimization, quantization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7884413 REDUCER – An Architectural Design Pattern for Reducing Large and Noisy Data Sets
Authors: Apkar Salatian
Abstract:
To relieve the burden of reasoning on a point to point basis, in many domains there is a need to reduce large and noisy data sets into trends for qualitative reasoning. In this paper we propose and describe a new architectural design pattern called REDUCER for reducing large and noisy data sets that can be tailored for particular situations. REDUCER consists of 2 consecutive processes: Filter which takes the original data and removes outliers, inconsistencies or noise; and Compression which takes the filtered data and derives trends in the data. In this seminal article we also show how REDUCER has successfully been applied to 3 different case studies.
Keywords: Design Pattern, filtering, compression.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14794412 Conceptual Multidimensional Model
Authors: Manpreet Singh, Parvinder Singh, Suman
Abstract:
The data is available in abundance in any business organization. It includes the records for finance, maintenance, inventory, progress reports etc. As the time progresses, the data keep on accumulating and the challenge is to extract the information from this data bank. Knowledge discovery from these large and complex databases is the key problem of this era. Data mining and machine learning techniques are needed which can scale to the size of the problems and can be customized to the application of business. For the development of accurate and required information for particular problem, business analyst needs to develop multidimensional models which give the reliable information so that they can take right decision for particular problem. If the multidimensional model does not possess the advance features, the accuracy cannot be expected. The present work involves the development of a Multidimensional data model incorporating advance features. The criterion of computation is based on the data precision and to include slowly change time dimension. The final results are displayed in graphical form.Keywords: Multidimensional, data precision.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14404411 Steady State Simulation and Experimental Study of an Ethane Recovery Unit in an Iranian Natural Gas Refinery
Authors: Arash Esmaeili, Omid Ghabouli
Abstract:
The production and consumption of natural gas is on the rise throughout the world as a result of its wide availability, ease of transportation, use and clean-burning characteristics. The chief use of ethane is in the chemical industry in the production of Ethene (ethylene) by steam cracking. In this simulation, obtained ethane recovery percent based on Gas sub-cooled process (GSP) is 99.9 by mole that is included 32.1% by using de-methanizer column and 67.8% by de-ethanizer tower. The outstanding feature of this process is the novel split-vapor concept that employs to generate reflux for de-methanizer column. Remain amount of ethane in export gas cause rise in gross heating value up to 36.66 MJ/Nm3 in order to use in industrial and household consumptions.Keywords: Ethane recovery, Hydrocarbon dew point, Simulation, Water dew point
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 30434410 Fundamental Problems in the Operation of the Automotive Parts Industry Small and Medium Businesses in Bangkok and Surrounding Provinces
Authors: P. Thepnarintra
Abstract:
The purposes of this study were to: 1) investigate operation conditions of SME automotive part industry in Bangkok and vicinity and 2) to compare operation problem levels of SME automotive part industry in Bangkok and vicinity according to the sizes of the enterprises. Samples in this study included 196 entrepreneurs of SME automotive part industry in Bangkok and vicinity derived from simple random sampling and calculation from R. V. Krejcie and D. W. Morgan’s tables. Research statistics included frequency, percentage, mean, standard deviation, and T-test. The results revealed that in general the problem levels of SME automotive part industry in Bangkok and vicinity were high. When considering in details, it was found that the problem levels were high at every aspect, i.e. personal, production, export, finance, and marketing respectively. The comparison of the problem levels according to the sizes of the enterprises revealed statistically significant differences at .05. When considering on each aspect, it was found that the aspect with the statistical difference at .05 included 5 aspects, i.e. production, marketing, finance, personal, and export. The findings also showed that small enterprises faced more severe problems than those of medium enterprises.Keywords: Automotive part industry, operation problems, SME, perimeter.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15814409 Heuristic Set-Covering-Based Postprocessing for Improving the Quine-McCluskey Method
Authors: Miloš Šeda
Abstract:
Finding the minimal logical functions has important applications in the design of logical circuits. This task is solved by many different methods but, frequently, they are not suitable for a computer implementation. We briefly summarise the well-known Quine-McCluskey method, which gives a unique procedure of computing and thus can be simply implemented, but, even for simple examples, does not guarantee an optimal solution. Since the Petrick extension of the Quine-McCluskey method does not give a generally usable method for finding an optimum for logical functions with a high number of values, we focus on interpretation of the result of the Quine-McCluskey method and show that it represents a set covering problem that, unfortunately, is an NP-hard combinatorial problem. Therefore it must be solved by heuristic or approximation methods. We propose an approach based on genetic algorithms and show suitable parameter settings.
Keywords: Boolean algebra, Karnaugh map, Quine-McCluskey method, set covering problem, genetic algorithm.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 27854408 Combining Ant Colony Optimization and Dynamic Programming for Solving a Dynamic Facility Layout Problem
Authors: A. Udomsakdigool, S. Bangsaranthip
Abstract:
This paper presents an algorithm which combining ant colony optimization in the dynamic programming for solving a dynamic facility layout problem. The problem is separated into 2 phases, static and dynamic phase. In static phase, ant colony optimization is used to find the best ranked of layouts for each period. Then the dynamic programming (DP) procedure is performed in the dynamic phase to evaluate the layout set during multi-period planning horizon. The proposed algorithm is tested over many problems with size ranging from 9 to 49 departments, 2 and 4 periods. The experimental results show that the proposed method is an alternative way for the plant layout designer to determine the layouts during multi-period planning horizon.Keywords: Ant colony optimization, Dynamicprogramming, Dynamic facility layout planning, Metaheuristic
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19334407 Starting Pitcher Rotation in the Chinese Professional Baseball League based on AHP and TOPSIS
Authors: Chih-Cheng Chen, Meng-Lung Lin, Yung-Tan Lee, Tien-Tze Chen
Abstract:
The rotation of starting pitchers is a strategic issue which has a significant impact on the performance of a professional team. Choosing an optimal starting pitcher from among many alternatives is a multi-criteria decision-making (MCDM) problem. In this study, a model using the Analytic Hierarchy Process (AHP) and Technique for Order Performance by Similarity to the Ideal Solution (TOPSIS) is proposed with which to arrange the starting pitcher rotation for teams of the Chinese Professional Baseball League. The AHP is used to analyze the structure of the starting pitcher selection problem and to determine the weights of the criteria, while the TOPSIS method is used to make the final ranking. An empirical analysis is conducted to illustrate the utilization of the model for the starting pitcher rotation problem. The results demonstrate the effectiveness and feasibility of the proposed model.Keywords: AHP, TOPSIS, starting pitcher rotation, CPBL
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 23434406 Maximizing Sum-Rate for Multi-User Two-Way Relaying Networks with ANC Protocol
Authors: Muhammad Abrar, Xiang Gui, Amal Punchihewa
Abstract:
In this paper we study the resource allocation problem for an OFDMA based cooperative two-way relaying (TWR) network. We focus on amplify and forward (AF) analog network coding (ANC) protocol. An optimization problem for two basic resources namely, sub-carrier and power is formulated for multi-user TWR networks. A joint optimal optimization problem is investigated and two-step low complexity sub-optimal resource allocation algorithm is proposed for multi-user TWR networks with ANC protocol. The proposed algorithm has been evaluated in term of total achievable system sum-rate and achievable individual sum-rate for each userpair. The good tradeoff between system sum-rate and fairness is observed in the two-step proportional resource allocation scheme.Keywords: Relay Network, Relay Protocols, Resource Allocation, Two –way relaying.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16464405 Analysis of Flow in Cylindrical Mixing Chamber
Authors: Václav Dvořák
Abstract:
The article deals with numerical investigation of axisymmetric subsonic air to air ejector. An analysis of flow and mixing processes in cylindrical mixing chamber are made. Several modes with different velocity and ejection ratio are presented. The mixing processes are described and differences between flow in the initial region of mixing and the main region of mixing are described. The lengths of both regions are evaluated. Transition point and point where the mixing processes are finished are identified. It was found that the length of the initial region of mixing is strongly dependent on the velocity ratio, while the length of the main region of mixing is dependent on velocity ratio only slightly.
Keywords: Air ejector, mixing chamber, CFD.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 39524404 Comparison of the Distillation Curve Obtained Experimentally with the Curve Extrapolated by a Commercial Simulator
Authors: Lívia B. Meirelles, Erika C. A. N. Chrisman, Flávia B. de Andrade, Lilian C. M. de Oliveira
Abstract:
True Boiling Point distillation (TBP) is one of the most common experimental techniques for the determination of petroleum properties. This curve provides information about the performance of petroleum in terms of its cuts. The experiment is performed in a few days. Techniques are used to determine the properties faster with a software that calculates the distillation curve when a little information about crude oil is known. In order to evaluate the accuracy of distillation curve prediction, eight points of the TBP curve and specific gravity curve (348 K and 523 K) were inserted into the HYSYS Oil Manager, and the extended curve was evaluated up to 748 K. The methods were able to predict the curve with the accuracy of 0.6%-9.2% error (Software X ASTM), 0.2%-5.1% error (Software X Spaltrohr).Keywords: Distillation curve, petroleum distillation, simulation, true boiling point curve.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16034403 Contact Stress on the Surface of Gear Teeth with Different Profile
Authors: K. Farhangdoost, H. Heirani
Abstract:
Contact stress is an important problem in industry. This is a problem that in the first attention may be don-t appears, but disregard of these stresses cause a lot of damages in machines. These stresses occur at locations such as gear teeth, bearings, cams and between a locomotive wheel and the railroad rail. These stresses cause failure by excessive elastic deformation, yielding and fracture. In this paper we intend show the effective parameters in contact stress and ponder effect of curvature. In this paper we study contact stresses on the surface of gear teeth and compare these stresses for four popular profiles of gear teeth (involute, cycloid, epicycloids, and hypocycloid). We study this problem with mathematical and finite element methods and compare these two methods on different profile surfaces.Keywords: Contact stress, Cycloid, Epicycloids, Finite element, Gear, Hypocycloid, Involute, Radius of curvature.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16564402 Fade Dynamics Investigation Applying Statistics of Fade Duration and Level Crossing Rate
Authors: Balázs Héder, Róbert Singliar, János Bitó
Abstract:
The impact of rain attenuation on wireless communication signals is predominant because of the used high frequency (above 10 GHz). The knowledge of statistics of attenuation is very important for planning point-to-point microwave links operating in high frequency band. Describing the statistics of attenuation is possible for instance with fade duration or level crossing rate. In our examination we determine these statistics from one year measured data for a given microwave link, and we are going to make an attempt to transform the level crossing rate statistic to fade duration statistic.
Keywords: Rain attenuation measurement, fade duration, level crossing rate.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16494401 Simulink Approach to Solve Fuzzy Differential Equation under Generalized Differentiability
Authors: N. Kumaresan , J. Kavikumar, Kuru Ratnavelu
Abstract:
In this paper, solution of fuzzy differential equation under general differentiability is obtained by simulink. The simulink solution is equivalent or very close to the exact solution of the problem. Accuracy of the simulink solution to this problem is qualitatively better. An illustrative numerical example is presented for the proposed method.Keywords: Fuzzy differential equation, Generalized differentiability, H-difference and Simulink.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 24224400 Thermal Analysis of a Transport Refrigeration Power Pack Unit Using a Coupled 1D/3D Simulation Approach
Authors: A. Kospach, A. Mladek, M. Waltenberger, F. Schilling
Abstract:
In this work, a coupled 1D/3D simulation approach for thermal protection and optimization of a trailer refrigeration power pack unit was developed. With the developed 1D/3D simulation approach thermal critical scenarios, such as summer, high-load scenarios are investigated. The 1D thermal model was built up consisting of the thermal network, which includes different point masses and associated heat transfers, the coolant and oil circuits, as well as the fan unit. The 3D computational fluid dynamics (CFD) model was developed to model the air flow through the power pack unit considering convective heat transfer effects. In the 1D thermal model the temperatures of the individual point masses were calculated, which served as input variables for the 3D CFD model. For the calculation of the point mass temperatures in the 1D thermal model, the convective heat transfer rates from the 3D CFD model were required as input variables. These two variables (point mass temperatures and convective heat transfer rates) were the main couple variables for the coupled 1D/3D simulation model. The coupled 1D/3D model was validated with measurements under normal operating conditions. Coupled simulations for summer high-load case were than performed and compared with a reference case under normal operation conditions. Hot temperature regions and components could be identified. Due to the detailed information about the flow field, temperatures and heat fluxes, it was possible to directly derive improvement suggestions for the cooling design of the transport refrigeration power pack unit.
Keywords: Coupled thermal simulation, thermal analysis, transport refrigeration unit, 3D computational fluid dynamics, 1D thermal modelling, thermal management systems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1654399 Collaborative E-Learning with Multiple Imaginary Co-Learner: Design, Issues and Implementation
Authors: Melvin Ballera, Mosbah Mohamed Elssaedi, Ahmed Khalil Zohdy
Abstract:
Collaborative problem solving in e-learning can take in the form of discussion among learner, creating a highly social learning environment and characterized by participation and interactivity. This paper, designed a collaborative learning environment where agent act as co-learner, can play different roles during interaction. Since different roles have been assigned to the agent, learner will assume that multiple co-learner exists to help and guide him all throughout the collaborative problem solving process, but in fact, alone during the learning process. Specifically, it answers the questions what roles of the agent should be incorporated to contribute better learning outcomes, how agent will facilitate the communication process to provide social learning and interactivity and what are the specific instructional strategies that facilitate learner participation, increased skill acquisition and develop critical thinking.Keywords: Collaborative e-learning, collaborative problem solving, , imaginary co-learner, social learning.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15844398 2 – Block 3 - Point Modified Numerov Block Methods for Solving Ordinary Differential Equations
Authors: Abdu Masanawa Sagir
Abstract:
In this paper, linear multistep technique using power series as the basis function is used to develop the block methods which are suitable for generating direct solution of the special second order ordinary differential equations of the form y′′ = f(x,y), a < = x < = b with associated initial or boundary conditions. The continuaous hybrid formulations enable us to differentiate and evaluate at some grids and off – grid points to obtain two different three discrete schemes, each of order (4,4,4)T, which were used in block form for parallel or sequential solutions of the problems. The computational burden and computer time wastage involved in the usual reduction of second order problem into system of first order equations are avoided by this approach. Furthermore, a stability analysis and efficiency of the block method are tested on linear and non-linear ordinary differential equations whose solutions are oscillatory or nearly periodic in nature, and the results obtained compared favourably with the exact solution.Keywords: Block Method, Hybrid, Linear Multistep Method, Self – starting, Special Second Order.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19314397 Proposing Problem-Based Learning as an Effective Pedagogical Technique for Social Work Education
Authors: Christine K. Fulmer
Abstract:
Social work education is competency based in nature. There is an expectation that graduates of social work programs throughout the world are to be prepared to practice at a level of competence, which is beneficial to both the well-being of individuals and community. Experiential learning is one way to prepare students for competent practice. The use of Problem-Based Learning (PBL) is a form experiential education that has been successful in a number of disciplines to bridge the gap between the theoretical concepts in the classroom to the real world. PBL aligns with the constructivist theoretical approach to learning, which emphasizes the integration of new knowledge with the beliefs students already hold. In addition, the basic tenants of PBL correspond well with the practice behaviors associated with social work practice including multi-disciplinary collaboration and critical thinking. This paper makes an argument for utilizing PBL in social work education.
Keywords: Constructivist theoretical approach, experiential learning, pedagogy, problem-based learning, social work education.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13154396 Cryptography Over Elliptic Curve Of The Ring Fq[e], e4 = 0
Authors: Chillali Abdelhakim
Abstract:
Groups where the discrete logarithm problem (DLP) is believed to be intractable have proved to be inestimable building blocks for cryptographic applications. They are at the heart of numerous protocols such as key agreements, public-key cryptosystems, digital signatures, identification schemes, publicly verifiable secret sharings, hash functions and bit commitments. The search for new groups with intractable DLP is therefore of great importance.The goal of this article is to study elliptic curves over the ring Fq[], with Fq a finite field of order q and with the relation n = 0, n ≥ 3. The motivation for this work came from the observation that several practical discrete logarithm-based cryptosystems, such as ElGamal, the Elliptic Curve Cryptosystems . In a first time, we describe these curves defined over a ring. Then, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. In anther article we study their cryptographic properties, an attack of the elliptic discrete logarithm problem, a new cryptosystem over these curves.
Keywords: Elliptic Curve Over Ring, Discrete Logarithm Problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 35634395 Estimation of Relative Self-Localization Based On Natural Landmark and an Improved SURF
Authors: Xing Xiong, Byung-Jae Choi
Abstract:
It is important for an autonomous mobile robot to know where it is in any time in an indoor environment. In this paper, we design a relative self-localization algorithm. The algorithm compare the interest point in two images and compute the relative displacement and orientation to determent the posture. Firstly, we use the SURF algorithm to extract the interest points of the ceiling. Second, in order to reduce amount of calculation, a replacement SURF is used to extract orientation and description of the interest points. At last, according to the transformation of the interest points in two images, the relative self-localization of the mobile robot will be estimated greatly.Keywords: Relative Self-Localization Posture, SURF, Natural Landmark, Interest Point.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15614394 Further the Effectiveness of Software Testability Measure
Authors: Liang Zhao, Feng Wang, Bo Deng, Bo Yang
Abstract:
Software testability is proposed to address the problem of increasing cost of test and the quality of software. Testability measure provides a quantified way to denote the testability of software. Since 1990s, many testability measure models are proposed to address the problem. By discussing the contradiction between domain testability and domain range ratio (DRR), a new testability measure, semantic fault distance, is proposed. Its validity is discussed.
Keywords: Software testability, DRR, Domain testability.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20354393 Completion Latin Square for Wavelength Routing
Authors: Ali Habiboghli, Rouhollah Mostafaei, Vasif Nabiyev
Abstract:
Optical network uses a tool for routing called Latin router. These routers use particular algorithms for routing. For example, we can refer to LDF algorithm that uses backtracking (one of CSP methods) for problem solving. In this paper, we proposed new approached for completion routing table (DRA&CRA algorithm) and compare with pervious proposed ways and showed numbers of backtracking, blocking and run time for DRA algorithm less than LDF and CRA algorithm.Keywords: Latin Router, Constraint Satisfaction Problem, Wavelength Routing.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16414392 Development of EN338 (2009) Strength Classes for Some Common Nigerian Timber Species Using Three Point Bending Test
Authors: Abubakar Idris, Nabade Abdullahi Muhammad
Abstract:
The work presents a development of EN338 strength classes for Strombosia pustulata, Pterygotama crocarpa, Nauclea diderrichii and Entandrophragma cyclindricum Nigerian timber species. The specimens for experimental measurements were obtained from the timber-shed at the famous Panteka market in Kaduna in the northern part of Nigeria. Laboratory experiments were conducted to determine the physical and mechanical properties of the selected timber species in accordance with EN 13183-1 and ASTM D193. The mechanical properties were determined using three point bending test. The generated properties were used to obtain the characteristic values of the material properties in accordance with EN384. The selected timber species were then classified according to EN 338. Strombosia pustulata, Pterygotama crocarpa, Nauclea diderrichii and Entandrophragma cyclindricum were assigned to strength classes D40, C14, D40 and D24 respectively. Other properties such as tensile and compressive strengths parallel and perpendicular to grains, shear strength as well as shear modulus were obtained in accordance with EN 338.
Keywords: Mechanical properties, Nigerian timber, strength classes, three-point bending test.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 40554391 Multimachine Power System Stabilizers Design Using PSO Algorithm
Authors: H. Shayeghi, A. Safari, H. A. Shayanfar
Abstract:
In this paper, multiobjective design of multi-machine Power System Stabilizers (PSSs) using Particle Swarm Optimization (PSO) is presented. The stabilizers are tuned to simultaneously shift the lightly damped and undamped electro-mechanical modes of all machines to a prescribed zone in the s-plane. A multiobjective problem is formulated to optimize a composite set of objective functions comprising the damping factor, and the damping ratio of the lightly damped electromechanical modes. The PSSs parameters tuning problem is converted to an optimization problem which is solved by PSO with the eigenvalue-based multiobjective function. The proposed PSO based PSSs is tested on a multimachine power system under different operating conditions and disturbances through eigenvalue analysis and some performance indices to illustrate its robust performance.
Keywords: PSS Design, Particle Swarm Optimization, Dynamic Stability, Multiobjective Optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 26294390 Existence and Uniqueness of Positive Solution for Nonlinear Fractional Differential Equation with Integral Boundary Conditions
Authors: Chuanyun Gu
Abstract:
By using fixed point theorems for a class of generalized concave and convex operators, the positive solution of nonlinear fractional differential equation with integral boundary conditions is studied, where n ≥ 3 is an integer, μ is a parameter and 0 ≤ μ < α. Its existence and uniqueness is proved, and an iterative scheme is constructed to approximate it. Finally, two examples are given to illustrate our results.Keywords: Fractional differential equation, positive solution, existence and uniqueness, fixed point theorem, generalized concave and convex operator, integral boundary conditions.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1106