In recent years it has been shown that for many linear algebra operations it is possible to create families of algorithms following a very systematic procedure. We do not refer to the fine tuning of a known algorithm, but to a methodology for the actual generation of both algorithms and routines to solve a given target matrix equation. Although systematic, the methodology relies on complex algebraic manipulations and non-obvious pattern matching, making the procedure challenging to be performed by hand, our goal is the development of a fully automated system that from the sole description of a target equation creates multiple algorithms and routines. We present CL1ck, a symbolic system written in Mathematica, that starts with an equation, decomposes it into multiple equations, and returns a set of loop-invariants for the algorithms -- yet to be generated -- that will solve the equation. In a successive step each loop-invariant is then mapped to its corresponding algorithm and routine. For a large class of equations, the methodology generates known algorithms as well as many previously unknown ones. Most interestingly, the methodology unifies algorithms traditionally developed in isolation. As an example, the five well known algorithms for the LU factorization are for the first time unified under a common root.
{"title":"Automatic Generation of Loop-Invariants for Matrix Operations","authors":"Diego Fabregat-Traver, P. Bientinesi","doi":"10.1109/ICCSA.2011.41","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.41","url":null,"abstract":"In recent years it has been shown that for many linear algebra operations it is possible to create families of algorithms following a very systematic procedure. We do not refer to the fine tuning of a known algorithm, but to a methodology for the actual generation of both algorithms and routines to solve a given target matrix equation. Although systematic, the methodology relies on complex algebraic manipulations and non-obvious pattern matching, making the procedure challenging to be performed by hand, our goal is the development of a fully automated system that from the sole description of a target equation creates multiple algorithms and routines. We present CL1ck, a symbolic system written in Mathematica, that starts with an equation, decomposes it into multiple equations, and returns a set of loop-invariants for the algorithms -- yet to be generated -- that will solve the equation. In a successive step each loop-invariant is then mapped to its corresponding algorithm and routine. For a large class of equations, the methodology generates known algorithms as well as many previously unknown ones. Most interestingly, the methodology unifies algorithms traditionally developed in isolation. As an example, the five well known algorithms for the LU factorization are for the first time unified under a common root.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116788886","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}
Investigation into the interaction between oblique shock waves in porous materials and powders is a topical problem in optimization of loading conditions for obtaining, from a given sample, a compacted material with spatially uniform physical and mechanical properties. In compacting a powder in the cylindrical scheme, an irregular interaction between shock waves occurs. The compacted powder displays substantial non-uniformity in particle displacements, resulting in inhomogeneity of powder characteristics and, in some cases, even in material failure. Theoretical investigations have allowed to realize modeling of processes of a shock wave loading of powder materials. Numerical simulation of shock wave propagation and experimental assembly deformation has been performed.
{"title":"Powder Compaction in the Axisymmetric Case","authors":"A. Buzyurkin, E. Kraus","doi":"10.1109/ICCSA.2011.53","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.53","url":null,"abstract":"Investigation into the interaction between oblique shock waves in porous materials and powders is a topical problem in optimization of loading conditions for obtaining, from a given sample, a compacted material with spatially uniform physical and mechanical properties. In compacting a powder in the cylindrical scheme, an irregular interaction between shock waves occurs. The compacted powder displays substantial non-uniformity in particle displacements, resulting in inhomogeneity of powder characteristics and, in some cases, even in material failure. Theoretical investigations have allowed to realize modeling of processes of a shock wave loading of powder materials. Numerical simulation of shock wave propagation and experimental assembly deformation has been performed.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128710845","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 article presents a general outline of the approximation of digital signal using Discrete Wavelet. The technique used in [1] is a new attitude to a multi resolution digital signal analysis by discrete wavelet transforms. This article demonstrates an approximation of a digital signal using Daubechies D4 wavelets. The present technique exhibits a revised procedure of removing distortion (loss) generated from the approximated double length digital signal presented in [1]. For highly nonlinear digital signal the technique of [1] fails to approximate the signal but the proposed revised technique can approximate the signal. The proposed method not only enables approximating digital signals in a better way but also it can approximate highly nonlinear digital signals. Moreover, the energy conservation is exactly double than the original signal which is not achieved by the approximation technique discussed in [1].
{"title":"Approximation of a Digital Signal Using Estimate Wavelet Transform","authors":"A. Yajnik","doi":"10.1109/ICCSA.2011.49","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.49","url":null,"abstract":"This article presents a general outline of the approximation of digital signal using Discrete Wavelet. The technique used in [1] is a new attitude to a multi resolution digital signal analysis by discrete wavelet transforms. This article demonstrates an approximation of a digital signal using Daubechies D4 wavelets. The present technique exhibits a revised procedure of removing distortion (loss) generated from the approximated double length digital signal presented in [1]. For highly nonlinear digital signal the technique of [1] fails to approximate the signal but the proposed revised technique can approximate the signal. The proposed method not only enables approximating digital signals in a better way but also it can approximate highly nonlinear digital signals. Moreover, the energy conservation is exactly double than the original signal which is not achieved by the approximation technique discussed in [1].","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130596716","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}
A simple caloric model of the equation of state is proposed to describe thermodynamic properties of solid materials with the phase transitions being ignored and with the minimum possible number of parameters as the initial data. Thermal oscillations of the crystal lattice are described by the Debye approximation. The values of the parameters on the zero isotherm are calculated analytically from the generalized form of the Gruneisen function. Thermodynamic characteristics are calculated in wide ranges of densities and pressures. Two-dimensional problems of a high-velocity impact of a reactor of a nuclear power plant with the Earth's surface propulsion system are solved. The destruction problem of a nuclear power plant of space power installation at space debris impact in orbit (impact velocity of 16 km/s) are solved.
{"title":"A Few-Parameter Equation of State and Its Application to the High-Velocity Interaction of Solids","authors":"E. Kraus, V. Fomin, I. Shabalin","doi":"10.1109/ICCSA.2011.52","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.52","url":null,"abstract":"A simple caloric model of the equation of state is proposed to describe thermodynamic properties of solid materials with the phase transitions being ignored and with the minimum possible number of parameters as the initial data. Thermal oscillations of the crystal lattice are described by the Debye approximation. The values of the parameters on the zero isotherm are calculated analytically from the generalized form of the Gruneisen function. Thermodynamic characteristics are calculated in wide ranges of densities and pressures. Two-dimensional problems of a high-velocity impact of a reactor of a nuclear power plant with the Earth's surface propulsion system are solved. The destruction problem of a nuclear power plant of space power installation at space debris impact in orbit (impact velocity of 16 km/s) are solved.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114231331","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 paper presents a new approach for machine vibration analysis and health monitoring based on blind source separation (BSS). So, the problem is transferred from the original space of the measurements to the space of independent sources, where the reduced number of components is going to simplify the monitoring problem while the vibration analysis methods are going to be applied for scalar signals. The assessment of the approach on a real machine is presented in this paper.
{"title":"New Approach in Machine Monitoring Using Blind Source Separation","authors":"T. Popescu","doi":"10.1109/ICCSA.2011.26","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.26","url":null,"abstract":"The paper presents a new approach for machine vibration analysis and health monitoring based on blind source separation (BSS). So, the problem is transferred from the original space of the measurements to the space of independent sources, where the reduced number of components is going to simplify the monitoring problem while the vibration analysis methods are going to be applied for scalar signals. The assessment of the approach on a real machine is presented in this paper.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"1953 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121784218","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}
Yiwen Su, Zhiguo Bao, Fangfang Wang, Takahiro Watanabe
This paper proposes a new circuit design optimization method where Genetic Algorithm (GA) with parameterized uniform crossover (GApuc) is combined with Taguchi method. The purposed are (a) using Taguchi method to search for optimal fitness value and (b) evaluating the power and signal delay of logic blocks in circuit design to get an optimum circuit in complexity, power and signal delay. The present study enhances the previous results by providing a much more detailed examination of mixed constrained circuit design. Experimental results show that our proposed approach can produce a good circuit in both fitness function and CPU time.
{"title":"Efficient GA Approach Combined with Taguchi Method for Mixed Constrained Circuit Design","authors":"Yiwen Su, Zhiguo Bao, Fangfang Wang, Takahiro Watanabe","doi":"10.1109/ICCSA.2011.44","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.44","url":null,"abstract":"This paper proposes a new circuit design optimization method where Genetic Algorithm (GA) with parameterized uniform crossover (GApuc) is combined with Taguchi method. The purposed are (a) using Taguchi method to search for optimal fitness value and (b) evaluating the power and signal delay of logic blocks in circuit design to get an optimum circuit in complexity, power and signal delay. The present study enhances the previous results by providing a much more detailed examination of mixed constrained circuit design. Experimental results show that our proposed approach can produce a good circuit in both fitness function and CPU time.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134093995","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}
Wireless network is one of usuful methods for Disaster Information Network, because it is easy to recover the reconfigulation of network topolgy and strong for disaster such as earthquake. However conventinal wireless network consisted of single wireless interface has some problems such as the limitation of transmission distance or throughput because of their characterices of radio frequency. Moreover, since user demands under emergent situation are changing through time, QoS of Disaster Information Network needs to consider such as emergent user policy. Cognitive Wireless Network consisted of multiple wireless interfaces and multiple wireless routes is considered as one of the powerful technologies to solve the problems as the previous. Therefore we have studied the transimmition control methods of Congnitive Wireless Network in Distaster Information Network considering with wireless network conditions and user policy. In our proposal methods, Extend AHP is used for the optimal wireless link selection with wireless network conditions and user policy, and Extend AODV with Min-Max AHP values is applied for the optimal wireless route selection. In this paper, our proposal methods is evaluated by the simulation of rural area of Disaster Information Network, and the results of the experimentation is reported. In the simulation, ns2 is used to verify the effectiveness of the suggested transmission methods in Cognitive Wireless Network. The results showed our proposal methods make better network conditions in Disaster Information Network in rural area.
{"title":"Evaluation of Cognitive Wireless Networks in Rural Area for Disaster Information Network","authors":"Noriki Uchida, Kazuo Takahata, Y. Shibata","doi":"10.1109/ICCSA.2011.70","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.70","url":null,"abstract":"Wireless network is one of usuful methods for Disaster Information Network, because it is easy to recover the reconfigulation of network topolgy and strong for disaster such as earthquake. However conventinal wireless network consisted of single wireless interface has some problems such as the limitation of transmission distance or throughput because of their characterices of radio frequency. Moreover, since user demands under emergent situation are changing through time, QoS of Disaster Information Network needs to consider such as emergent user policy. Cognitive Wireless Network consisted of multiple wireless interfaces and multiple wireless routes is considered as one of the powerful technologies to solve the problems as the previous. Therefore we have studied the transimmition control methods of Congnitive Wireless Network in Distaster Information Network considering with wireless network conditions and user policy. In our proposal methods, Extend AHP is used for the optimal wireless link selection with wireless network conditions and user policy, and Extend AODV with Min-Max AHP values is applied for the optimal wireless route selection. In this paper, our proposal methods is evaluated by the simulation of rural area of Disaster Information Network, and the results of the experimentation is reported. In the simulation, ns2 is used to verify the effectiveness of the suggested transmission methods in Cognitive Wireless Network. The results showed our proposal methods make better network conditions in Disaster Information Network in rural area.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130959545","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 the present study molecular dynamics simulations were performed for collisions of nanoclusters with the substrate for determining the mechanism of formation of bound states depending on the cluster size, impact velocity and angle of incidence.
{"title":"Molecular Dynamics Investigation of the Surface Coating Processes","authors":"A. Utkin, I. Golovnev, V. Fomin","doi":"10.1109/ICCSA.2011.51","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.51","url":null,"abstract":"In the present study molecular dynamics simulations were performed for collisions of nanoclusters with the substrate for determining the mechanism of formation of bound states depending on the cluster size, impact velocity and angle of incidence.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114636885","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}
We proposed in a previous work an algorithm to compute the degree of satisfaction of a given conjunctive fuzzy query rewriting based on the histograms approximating, in the query result, the frequency distribution of values in the attributes to which fuzzy conditions are related. A simple way to answer a conjunctive fuzzy query is to apply one of the existing algorithms for answering classical queries using views in order to determine all the possible rewritings. Then, to compute the satisfaction degree for each rewriting and to keep and run only those with accepted scores. However, this method incurs an unnecessary cost since it determines also the useless query rewritings and waste of resources for useless scores computation. To overcome these drawbacks, we propose in this paper an efficient algorithm to generate the N best query rewritings which are likely to return the top k-tuples fitting with user preferences. The proposed algorithm discards useless rewritings from the query rewritings searching step and hence, generates the likely satisfactory ones ordered according to their satisfaction degrees of the user query. This method accelerates query processing and reduces query running time. We show in this paper the interest of this algorithm in middleware applications by using a case study in middle ware based context-aware pervasive health care where doctors, haven't enough time to fix carefully their queries in some emergency cases, require to flexibly use medical applications and need to quickly receiving best answers while treating patients in the shortest waiting time and to free resources for eventually other urgent requests.
{"title":"Answering Conjunctive Fuzzy Query Using Views: Efficient Algorithm to Return the Best k-Tuples: Middleware Based Context-Aware Pervasive Healthcare Vase Study","authors":"Wissem Labbadi","doi":"10.1109/ICCSA.2011.34","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.34","url":null,"abstract":"We proposed in a previous work an algorithm to compute the degree of satisfaction of a given conjunctive fuzzy query rewriting based on the histograms approximating, in the query result, the frequency distribution of values in the attributes to which fuzzy conditions are related. A simple way to answer a conjunctive fuzzy query is to apply one of the existing algorithms for answering classical queries using views in order to determine all the possible rewritings. Then, to compute the satisfaction degree for each rewriting and to keep and run only those with accepted scores. However, this method incurs an unnecessary cost since it determines also the useless query rewritings and waste of resources for useless scores computation. To overcome these drawbacks, we propose in this paper an efficient algorithm to generate the N best query rewritings which are likely to return the top k-tuples fitting with user preferences. The proposed algorithm discards useless rewritings from the query rewritings searching step and hence, generates the likely satisfactory ones ordered according to their satisfaction degrees of the user query. This method accelerates query processing and reduces query running time. We show in this paper the interest of this algorithm in middleware applications by using a case study in middle ware based context-aware pervasive health care where doctors, haven't enough time to fix carefully their queries in some emergency cases, require to flexibly use medical applications and need to quickly receiving best answers while treating patients in the shortest waiting time and to free resources for eventually other urgent requests.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369435","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}
KETpic is a macro package for Computer Algebra System (CAS) to convert plot data created by CAS to LaTeX picture data. We are able to draw fine pictures including 3D plots in LaTeX documents with aid of KETpic. We develop a graphical user interface (GUI) for producing 3D plots by KETpic. The GUI is implemented by Maplets package of Maple. Only small amount of input and mouse operation can produce 3D plots by the use of the GUI for KETpic. It is expected that the GUI helps many potential users of KETpic begin to use KETpic.
{"title":"Graphical User Interface for Drawing 3D Plots with KETpic","authors":"Yasuyuki Nakamura, Setsuo Takato","doi":"10.1109/ICCSA.2011.56","DOIUrl":"https://doi.org/10.1109/ICCSA.2011.56","url":null,"abstract":"KETpic is a macro package for Computer Algebra System (CAS) to convert plot data created by CAS to LaTeX picture data. We are able to draw fine pictures including 3D plots in LaTeX documents with aid of KETpic. We develop a graphical user interface (GUI) for producing 3D plots by KETpic. The GUI is implemented by Maplets package of Maple. Only small amount of input and mouse operation can produce 3D plots by the use of the GUI for KETpic. It is expected that the GUI helps many potential users of KETpic begin to use KETpic.","PeriodicalId":428638,"journal":{"name":"2011 International Conference on Computational Science and Its Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130573394","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
扫码关注我们
求助内容：
应助结果提醒方式：