2011 International Conference on Computational Science and Its Applications最新文献

Automatic Generation of Loop-Invariants for Matrix Operations 矩阵运算循环不变量的自动生成

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.41

Diego Fabregat-Traver, P. Bientinesi

{"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}

引用次数: 22

Powder Compaction in the Axisymmetric Case 轴对称情况下的粉末压实

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.53

A. Buzyurkin, E. Kraus

引用次数: 0

Approximation of a Digital Signal Using Estimate Wavelet Transform 用估计小波变换逼近数字信号

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.49

A. Yajnik

引用次数: 3

A Few-Parameter Equation of State and Its Application to the High-Velocity Interaction of Solids 少参数状态方程及其在固体高速相互作用中的应用

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.52

E. Kraus, V. Fomin, I. Shabalin

引用次数: 0

New Approach in Machine Monitoring Using Blind Source Separation 基于盲源分离的机器监测新方法

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.26

T. Popescu

引用次数: 0

Efficient GA Approach Combined with Taguchi Method for Mixed Constrained Circuit Design 结合田口法的高效遗传算法混合约束电路设计

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.44

Yiwen Su, Zhiguo Bao, Fangfang Wang, Takahiro Watanabe

引用次数: 4

Evaluation of Cognitive Wireless Networks in Rural Area for Disaster Information Network 面向灾害信息网的农村认知无线网络评价

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.70

Noriki Uchida, Kazuo Takahata, Y. Shibata

{"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}

引用次数: 9

Molecular Dynamics Investigation of the Surface Coating Processes 表面涂层过程的分子动力学研究

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.51

A. Utkin, I. Golovnev, V. Fomin

引用次数: 0

Answering Conjunctive Fuzzy Query Using Views: Efficient Algorithm to Return the Best k-Tuples: Middleware Based Context-Aware Pervasive Healthcare Vase Study 使用视图回答连接模糊查询:返回最佳k元组的有效算法:基于上下文感知的中间件的普适医疗花瓶研究

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.34

Wissem Labbadi

{"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}

引用次数: 0

Graphical User Interface for Drawing 3D Plots with KETpic 图形用户界面绘制三维绘图与KETpic

2011 International Conference on Computational Science and Its Applications Pub Date : 2011-06-20 DOI: 10.1109/ICCSA.2011.56

Yasuyuki Nakamura, Setsuo Takato

引用次数: 0