For the power system of a certain small enterprise, different start up modes of the induction motor are analyzed by simulation. The dynamic curve of motor slip, motor torque motor current and bus bar voltage in different starting modes are obtained through simulation. The effect of different start up modes on start-up time, starting torque, power grid voltage and the stability of the power system are further analyzed. After all the simulation results are obtained, the advantages and disadvantages of different start up mode and the scope of application can be compared and analyzed, and the reasonable start up mode can be selected. The motor starting simulation analysis with ETAP software has the advantage of fast and accurate. The simulation results provide the base for the safe and reliable operation of practical power systems.
{"title":"The Simulation Analysis of Motor Startup Based on the ETAP Platform","authors":"Hui Zhu, Ximei Liu, N. Mastorakis","doi":"10.1109/MCSI.2014.36","DOIUrl":"https://doi.org/10.1109/MCSI.2014.36","url":null,"abstract":"For the power system of a certain small enterprise, different start up modes of the induction motor are analyzed by simulation. The dynamic curve of motor slip, motor torque motor current and bus bar voltage in different starting modes are obtained through simulation. The effect of different start up modes on start-up time, starting torque, power grid voltage and the stability of the power system are further analyzed. After all the simulation results are obtained, the advantages and disadvantages of different start up mode and the scope of application can be compared and analyzed, and the reasonable start up mode can be selected. The motor starting simulation analysis with ETAP software has the advantage of fast and accurate. The simulation results provide the base for the safe and reliable operation of practical power systems.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117219114","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper exposes features a fuzzy inference system General focused on educational evaluation, constructed from a data base relational, with the objectives of, first, generate discussion about fuzzy logic as a new tool to interpret the educational process through information technologies and communication, and second, exposing the virtues and drawbacks of these data structures in the development of models of complex phenomena. First is the introduction with the theoretical bases is exposed, Later, the technical characteristics of the application with the successes and difficulties rose by this, and finally presents the conclusions of the authors.
{"title":"Fundamentals of a Fuzzy Inference System for Educational Evaluation","authors":"M. Gabriel, P. William, D. L. Vargas Juan","doi":"10.1109/MCSI.2014.58","DOIUrl":"https://doi.org/10.1109/MCSI.2014.58","url":null,"abstract":"This paper exposes features a fuzzy inference system General focused on educational evaluation, constructed from a data base relational, with the objectives of, first, generate discussion about fuzzy logic as a new tool to interpret the educational process through information technologies and communication, and second, exposing the virtues and drawbacks of these data structures in the development of models of complex phenomena. First is the introduction with the theoretical bases is exposed, Later, the technical characteristics of the application with the successes and difficulties rose by this, and finally presents the conclusions of the authors.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"09 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127179602","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper the possibility of using artificial neural network (ANN) in the classification of force profiles of different striking techniques is deeply analyzed and discussed. Classification of direct punch force profiles is presented in this paper alongside with results of previous research of kick techniques classification. The results are summarized in tables and followed by discussion.
{"title":"Using Artificial Neural Network for Force Profile Analysis in Professional Defence","authors":"Dora Lapkova, Michal Pluhacek, M. Adamek","doi":"10.1109/MCSI.2014.61","DOIUrl":"https://doi.org/10.1109/MCSI.2014.61","url":null,"abstract":"In this paper the possibility of using artificial neural network (ANN) in the classification of force profiles of different striking techniques is deeply analyzed and discussed. Classification of direct punch force profiles is presented in this paper alongside with results of previous research of kick techniques classification. The results are summarized in tables and followed by discussion.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"10 14-15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122911013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Gabriel Jaime Páramo Bermúdez, Adrian Jose BENITEZ LOZANO, Juan Alejandro García
The new manufacturing technologies of the world are increasingly demanding the design and redesign of new alternative products and processes that can be useful and low cost term. The alternative solution and methodology to innovate in manufacturing processes of incremental sheet metal forming is shown in this paper. Through the methodology Product design specification (PDS) as a practical and effective solution, describes the design step, specific requirements, materials and building process to achieve a device's architecture for a sheet metal deformation by two-point method Dieless - DPIF. The selection, simplification and functionality becomes a fundamental objective for design engineers.
{"title":"Application Design Methodology for Building a Device Foil Incremental Deformation by Double Point Method Dieless-DPIF","authors":"Gabriel Jaime Páramo Bermúdez, Adrian Jose BENITEZ LOZANO, Juan Alejandro García","doi":"10.1109/MCSI.2014.23","DOIUrl":"https://doi.org/10.1109/MCSI.2014.23","url":null,"abstract":"The new manufacturing technologies of the world are increasingly demanding the design and redesign of new alternative products and processes that can be useful and low cost term. The alternative solution and methodology to innovate in manufacturing processes of incremental sheet metal forming is shown in this paper. Through the methodology Product design specification (PDS) as a practical and effective solution, describes the design step, specific requirements, materials and building process to achieve a device's architecture for a sheet metal deformation by two-point method Dieless - DPIF. The selection, simplification and functionality becomes a fundamental objective for design engineers.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129497119","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The formulation of algorithms from sparse linear algebra is often based on suitable concepts from graph theory. However, conversely, the formulation of algorithms from graph theory is rarely based on suitable concepts from sparse linear algebra. Here, we present an illustrating example of a standard graph algorithm that is expressed in the language of sparse linear algebra. More precisely, we reformulate a breadth-first search (BFS) algorithm on an undirected graph using sparse matrix-vector products. In addition, we demonstrate that the performance of this matrix-based BFS algorithm on an Intel Core 2 Duo CPU E8400 is improved as compared to a traditional graph-based BFS algorithm.
{"title":"Reformulating a Breadth-First Search Algorithm on an Undirected Graph in the Language of Linear Algebra","authors":"H. M. Bucker, Christian Sohr","doi":"10.1109/MCSI.2014.40","DOIUrl":"https://doi.org/10.1109/MCSI.2014.40","url":null,"abstract":"The formulation of algorithms from sparse linear algebra is often based on suitable concepts from graph theory. However, conversely, the formulation of algorithms from graph theory is rarely based on suitable concepts from sparse linear algebra. Here, we present an illustrating example of a standard graph algorithm that is expressed in the language of sparse linear algebra. More precisely, we reformulate a breadth-first search (BFS) algorithm on an undirected graph using sparse matrix-vector products. In addition, we demonstrate that the performance of this matrix-based BFS algorithm on an Intel Core 2 Duo CPU E8400 is improved as compared to a traditional graph-based BFS algorithm.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131536934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents the implementation of curve on FPGA circuit (Field Programmable Gate Array) Spartan 3 of Xilinx, it based on Taylor approximation by segment, used third order polynomial in order to reduce the maximum error. First of all, we have stocked all coefficients, computing with Mat lab tool, in the block memory. After that, an architecture is proposed and implemented under ISE9.2i environment (Integrated Software Environment) of Xilinx for a description, and Mentor Graphics Model Sim XEIII 6.3c for a simulation.
{"title":"Curvature Circuit Implementation on Xilinx FPGA","authors":"F. Alim-Ferhat, S. Seddiki, B. Hachemi, F. Talbi","doi":"10.1109/MCSI.2014.18","DOIUrl":"https://doi.org/10.1109/MCSI.2014.18","url":null,"abstract":"This paper presents the implementation of curve on FPGA circuit (Field Programmable Gate Array) Spartan 3 of Xilinx, it based on Taylor approximation by segment, used third order polynomial in order to reduce the maximum error. First of all, we have stocked all coefficients, computing with Mat lab tool, in the block memory. After that, an architecture is proposed and implemented under ISE9.2i environment (Integrated Software Environment) of Xilinx for a description, and Mentor Graphics Model Sim XEIII 6.3c for a simulation.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126598275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper explicitly computes the characteristic polynomials and the number of rational points or the order of rational point group of a class of the Jacobi quartic curves over the finite field.
本文显式地计算了有限域上一类雅可比四次曲线的特征多项式和有理点群的阶数或有理点群的阶数。
{"title":"Characteristic Polynomials of a Class of Jacobi Quartic Curves over Finite Field","authors":"Dongqin Wang, Lin You","doi":"10.1109/MCSI.2014.30","DOIUrl":"https://doi.org/10.1109/MCSI.2014.30","url":null,"abstract":"This paper explicitly computes the characteristic polynomials and the number of rational points or the order of rational point group of a class of the Jacobi quartic curves over the finite field.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125910732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Enhanced Multivariance Products Representation (EMPR) is a function decomposition method formed by generalization of High Dimensional Model Representation (HDMR). EMPR may be utilized as a matrix decomposer also. The method here builds upon recursive EMPR and it decomposes a matrix into a product of three matrices: an orthonormal matrix, a rectangular tridiagonal matrix and another orthonormal matrix. The initial vectors of the recursion of the formulation are two normalized support vectors. This work focuses on implementation of the method and the choice of these support vectors.
增强多方差积表示(Enhanced Multivariance product Representation, EMPR)是在高维模型表示(High Dimensional Model Representation, HDMR)的基础上推广形成的一种函数分解方法。EMPR也可用作基质分解器。这种方法建立在递归EMPR的基础上，它将一个矩阵分解成三个矩阵的乘积:一个标准正交矩阵，一个矩形三对角矩阵和另一个标准正交矩阵。该公式递归的初始向量是两个归一化的支持向量。这项工作的重点是方法的实现和这些支持向量的选择。
{"title":"The Influence of Initial Vector Selection on Tridiagonal Matrix Enhanced Multivariance Products Representation","authors":"Cosar Gozukirmizi, M. Demiralp","doi":"10.1109/MCSI.2014.12","DOIUrl":"https://doi.org/10.1109/MCSI.2014.12","url":null,"abstract":"Enhanced Multivariance Products Representation (EMPR) is a function decomposition method formed by generalization of High Dimensional Model Representation (HDMR). EMPR may be utilized as a matrix decomposer also. The method here builds upon recursive EMPR and it decomposes a matrix into a product of three matrices: an orthonormal matrix, a rectangular tridiagonal matrix and another orthonormal matrix. The initial vectors of the recursion of the formulation are two normalized support vectors. This work focuses on implementation of the method and the choice of these support vectors.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126101777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Edisson Sávio de Goes Maciel, E. M. Ferreira, Amilcar Porto Pimenta, N. Mastorakis
In this work, first part of this study, the high resolution numerical schemes of Lax and Wend off, of Yee, Warming and Harten, of Yee, and of Harten and Osher are applied to the solution of the Euler and Navier-Stokes equations in two-dimensions. With the exception of the Lax and Wend off and of the Yee schemes, which are symmetrical ones, all others are flux difference splitting algorithms. All schemes are second order accurate in space and first order accurate in time. The Euler and Navier-Stokes equations, written in a conservative and integral form, are solved, according to a finite volume and structured formulations. A spatially variable time step procedure is employed aiming to accelerate the convergence of the numerical schemes to the steady state condition. It has proved excellent gains in terms of convergence acceleration as reported by Maciel. The physical problems of the supersonic shock reflection at the wall and the supersonic flow along a compression corner are solved, in the in viscid case. For the viscous case, the supersonic flow along a compression corner is solved. In the in viscid case, an implicit formulation is employed to marching in time, whereas in the viscous case, a time splitting approach is used. The results have demonstrated that the Yee, Warming and Harten algorithm has presented the best solution in the in viscid shock reflection problem, the Harten and Osher algorithm, in its ENO version, and the Lax and Wend off TVD algorithm, in its Van Leer variant, have yielded the best solutions in the in viscid compression corner problem, and the Lax and Wend off TVD algorithm, in its Minmod1 variant, has presented the best solution in the viscous compression corner problem.
在本研究的第一部分中，将Lax和Wend off、Yee、Warming和Harten、Yee和Harten和Osher的高分辨率数值格式应用于二维Euler和Navier-Stokes方程的求解。除了Lax和Wend off以及Yee格式是对称格式外，其他格式都是通量差分分裂算法。所有方案在空间上是二阶精度，在时间上是一阶精度。欧拉和纳维-斯托克斯方程，写在一个保守和积分形式，求解，根据有限的体积和结构化的公式。为了加速数值格式收敛到稳态状态，采用了一种空间变时步处理方法。正如Maciel所报告的那样，它在收敛加速方面已经证明了出色的收益。在无粘情况下，解决了壁面超声速激波反射和压缩转角超声速流动的物理问题。对于粘性情况，求解了沿压缩角的超声速流动。在无粘性情况下，采用隐式公式进行时间推进，而在粘性情况下，采用时间分裂方法。结果表明，Yee、Warming和Harten算法在无粘冲击反射问题中具有最佳解，Harten和Osher算法在ENO版本中具有最佳解，Lax和Wend off TVD算法在Van Leer版本中具有最佳解，Lax和Wend off TVD算法在Minmod1版本中具有最佳解。
{"title":"TVD and ENO Applications to Supersonic Flows in 2D","authors":"Edisson Sávio de Goes Maciel, E. M. Ferreira, Amilcar Porto Pimenta, N. Mastorakis","doi":"10.1109/MCSI.2014.19","DOIUrl":"https://doi.org/10.1109/MCSI.2014.19","url":null,"abstract":"In this work, first part of this study, the high resolution numerical schemes of Lax and Wend off, of Yee, Warming and Harten, of Yee, and of Harten and Osher are applied to the solution of the Euler and Navier-Stokes equations in two-dimensions. With the exception of the Lax and Wend off and of the Yee schemes, which are symmetrical ones, all others are flux difference splitting algorithms. All schemes are second order accurate in space and first order accurate in time. The Euler and Navier-Stokes equations, written in a conservative and integral form, are solved, according to a finite volume and structured formulations. A spatially variable time step procedure is employed aiming to accelerate the convergence of the numerical schemes to the steady state condition. It has proved excellent gains in terms of convergence acceleration as reported by Maciel. The physical problems of the supersonic shock reflection at the wall and the supersonic flow along a compression corner are solved, in the in viscid case. For the viscous case, the supersonic flow along a compression corner is solved. In the in viscid case, an implicit formulation is employed to marching in time, whereas in the viscous case, a time splitting approach is used. The results have demonstrated that the Yee, Warming and Harten algorithm has presented the best solution in the in viscid shock reflection problem, the Harten and Osher algorithm, in its ENO version, and the Lax and Wend off TVD algorithm, in its Van Leer variant, have yielded the best solutions in the in viscid compression corner problem, and the Lax and Wend off TVD algorithm, in its Minmod1 variant, has presented the best solution in the viscous compression corner problem.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134200594","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This work is devoted to the decomposition of a univariate function by using very recently developed Tridiagonal Vector Enhanced Multivariance Products Representation (TVEMPR). To this end the target function is expressed as a bilinear form over the power vector of the independent variable and the function's coefficient vector. Both vectors are composed of denumerable infinite number of elements. The power vector of the independent variable is decomposed via Tridiagonal Vector Enhanced Multivariance Products Representation. The core matrix of the decomposition contains a 2×2 type left uppermost block as the only nonzero agent. Then the bilinear form, and therefore the function can be expressed thoroughly to get a decomposition as a linear combination of certain functions which are in fact derived from the original target function. This is the simplest case. Some other but complicated cases which start with multi outer products are left to future works. The support vectors have been chosen as proportional to certain power vectors of some given parameters to proceed from rather simplicity.
{"title":"Univariate Function Decomposition via Tridiagonal Vector Enhanced Multivariance Products Representation (TVEMPR)","authors":"Ercan Gurvit, N. A. Baykara, M. Demiralp","doi":"10.1109/MCSI.2014.24","DOIUrl":"https://doi.org/10.1109/MCSI.2014.24","url":null,"abstract":"This work is devoted to the decomposition of a univariate function by using very recently developed Tridiagonal Vector Enhanced Multivariance Products Representation (TVEMPR). To this end the target function is expressed as a bilinear form over the power vector of the independent variable and the function's coefficient vector. Both vectors are composed of denumerable infinite number of elements. The power vector of the independent variable is decomposed via Tridiagonal Vector Enhanced Multivariance Products Representation. The core matrix of the decomposition contains a 2×2 type left uppermost block as the only nonzero agent. Then the bilinear form, and therefore the function can be expressed thoroughly to get a decomposition as a linear combination of certain functions which are in fact derived from the original target function. This is the simplest case. Some other but complicated cases which start with multi outer products are left to future works. The support vectors have been chosen as proportional to certain power vectors of some given parameters to proceed from rather simplicity.","PeriodicalId":202841,"journal":{"name":"2014 International Conference on Mathematics and Computers in Sciences and in Industry","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：