发布求助
文献互助 智能选刊 最新文献

2010 Third International Joint Conference on Computational Science and Optimization最新文献

筛选
英文 中文
Optimization of Ultra High Pressure Preparation Parameters of Ursolic Acid: Beta-Cyclodextrin Inclusion Compound by Orthogonal Array Designs 正交设计优化熊果酸-环糊精包合物超高压制备工艺
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.93
W. Zong, Yanhong Bai, Rongcheng Miao
{"title":"Optimization of Ultra High Pressure Preparation Parameters of Ursolic Acid: Beta-Cyclodextrin Inclusion Compound by Orthogonal Array Designs","authors":"W. Zong, Yanhong Bai, Rongcheng Miao","doi":"10.1109/CSO.2010.93","DOIUrl":"https://doi.org/10.1109/CSO.2010.93","url":null,"abstract":"In order to get the ultra high pressure (UHP) preparation parameters of ursolic acid (UA)-cyclodextrin (β-CD) inclusion compound, an orthogonal experiment L9(3)4 was applied to optimize the best preparation conditions. Inclusion pressure, inclusion time, inclusion temperature and ratio of β--CD and UA were the main factors to influence the inclusion ratio of the UHP preparation. The four factors chosen for the present investigation were based on the results of a single-factor test. The optimum preparation parameters were determined as follows: inclusion pressure 200Mpa, inclusion temperature 25???, inclusion time 10min, ratio of β-CD and UA. Under optimized conditions, the inclusion ratio was 78.4%. All the results indicated that UHP preparation of UA : β-CD inclusion compound was a suitable method for it has shorter time and higher inclusion ratio.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125764949","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}
引用次数: 1
Three-Part-Pricing Model for Digital Content when the Supply is Limited 供应有限时数字内容的三部分定价模型
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.99
Chengxiong Zhou, Lanxiang Zhao, Zhuojun Liu
{"title":"Three-Part-Pricing Model for Digital Content when the Supply is Limited","authors":"Chengxiong Zhou, Lanxiang Zhao, Zhuojun Liu","doi":"10.1109/CSO.2010.99","DOIUrl":"https://doi.org/10.1109/CSO.2010.99","url":null,"abstract":"In this paper, it will be discussed that the digital content manufactures put to use three-part-pricing model to distinguish the consumers when the supply is limited, which divides the consumers into the consumers with urgent needs and the consumers with general needs in order to get more consumers supply. For those consumers with urgent needs, it also can increase the effectiveness of their consumption.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125046228","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
Using Condor Glideins for Distributed Testing of Network Facing Services 使用秃鹰滑翔机进行面向网络服务的分布式测试
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.90
I. Sfiligoi, F. Würthwein, C. Theissen
{"title":"Using Condor Glideins for Distributed Testing of Network Facing Services","authors":"I. Sfiligoi, F. Würthwein, C. Theissen","doi":"10.1109/CSO.2010.90","DOIUrl":"https://doi.org/10.1109/CSO.2010.90","url":null,"abstract":"Many compute environments rely on centralized, network-facing services in order to work properly; examples are Web servers, Grid Compute Elements and Grid Storage Elements. Testing such services requires a large amount of geographically dispersed compute resources all interacting concurrently with the service to test. Grid resources provide an obvious candidate for such testing, but to the best of our knowledge there is no readily available tool for such testing. In this paper we present one such tool, based on Condor glideins.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121701997","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}
引用次数: 4
Measurement Method of Background Noise in Theatre Based on Stage Machinery 基于舞台机械的剧院背景噪声测量方法
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.165
Hui Ren, Jingjing Zhang, Wei Jiang, Zhibin Su
{"title":"Measurement Method of Background Noise in Theatre Based on Stage Machinery","authors":"Hui Ren, Jingjing Zhang, Wei Jiang, Zhibin Su","doi":"10.1109/CSO.2010.165","DOIUrl":"https://doi.org/10.1109/CSO.2010.165","url":null,"abstract":"Stage machinery is the main operating equipment in theatre. It is the main noise source which directly affects the performance effects. To analysis the stage machinery noise, theater background noise is an important part. In this paper, the source of background noise was analyzed. A specific method on how to measure background noise was proposed. Experimental data shows that our method is efficient and feasibility.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131451111","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}
引用次数: 1
The Combined Homotopy Method for Solving a Class of Programming Problems with a Bounded Feasible Set 一类有界可行集规划问题的组合同伦方法
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.179
Xiuyu Wang, T. Yang, Xingwu Jiang, Qing-huai Liu
{"title":"The Combined Homotopy Method for Solving a Class of Programming Problems with a Bounded Feasible Set","authors":"Xiuyu Wang, T. Yang, Xingwu Jiang, Qing-huai Liu","doi":"10.1109/CSO.2010.179","DOIUrl":"https://doi.org/10.1109/CSO.2010.179","url":null,"abstract":"In this paper, we study the following nonlinear nonconvex programming problem: in f(x);s:t:gi(x) · 0; i 2 M; M = f1; 2; ¢ ¢ ¢ ;mg: Under the condition that the feasible set is bounded and connected, but it has a point that the boundary is not regular at this point, we propose the combined homotopy method to solve this problem by constructing a new constraint function and a combined homotopy equation. The convergence of the method is proved and the existence of a smooth homotopy path from any interior point to a solution of the problem is established. Our method is very different from previous homotopy method. Numerical examples show that this method is feasible and effective.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131352919","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
Dynamic Analysis of Tall-Pier Aqueduct Using ODE Solver 基于ODE求解的高墩渡槽动力分析
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.117
Shaowei Hu, Ri You, Zhiguo Niu, Jun Lu
{"title":"Dynamic Analysis of Tall-Pier Aqueduct Using ODE Solver","authors":"Shaowei Hu, Ri You, Zhiguo Niu, Jun Lu","doi":"10.1109/CSO.2010.117","DOIUrl":"https://doi.org/10.1109/CSO.2010.117","url":null,"abstract":"A new method using ordinary differential equation (ODE) solver is applied in order to ease the dynamic analysis of tall-pier aqueduct. By simplifying the boundary conditions associated with fluid-structure interaction at pier top and considering the pier as a continuous beam instead of discretized elements, this paper converts the dynamic analysis of tall-pier aqueduct into standard forms of ODE eigenproblem and general boundary value problem, which can be solved by ODE solver based on the presented ODE eigenvalue algorithm, modal superposition and Newmark-β semi-discretization method. For illustration, two numerical examples are utilized to show the feasibility of this method to obtain dynamic characteristic, elastic seismic response and nonlinear vibration isolation response of tall-pier aqueduct. The results show that compared to the finite element method, the model and method in this paper is not only reliable, but time-saving.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121087058","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}
引用次数: 2
Dynamic Fair Cache Partitioning for Chip Multiprocessor 芯片多处理器动态公平缓存分区
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.29
Juan Fang, Jiang Pu
{"title":"Dynamic Fair Cache Partitioning for Chip Multiprocessor","authors":"Juan Fang, Jiang Pu","doi":"10.1109/CSO.2010.29","DOIUrl":"https://doi.org/10.1109/CSO.2010.29","url":null,"abstract":"Fairness is a critical issue because of some serious problems, such as thread starvation and priority inversion, it can arise and render the Operating System (OS) scheduler ineffective if no fair cache sharing which provided by the hardware. In order to improve the fairness of shared cache between threads in a chip multiprocessor, a dynamic fair partitioning policy of shared cache is proposed in this paper. There are threads sharing cache and simulating that it runs alone with a dedicated cache. At the end of each time interval T, policy evaluates the metrics of threads on shared and dedicated cache, then repartition cache to improve the fairness. Experimental data show that the dynamic fair partitioning policy of shared cache compared with LRU or other partitioning of shared cache can effectively enhance fairness and throughput has slightly increased for chip multiprocessor.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115088942","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}
引用次数: 2
Cellular Automaton Simulation of Emergent Evacuation Considering the Classroom Seats Arrangement 考虑教室座位安排的紧急疏散的元胞自动机仿真
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.210
Q. Tian, Yihang Xu
{"title":"Cellular Automaton Simulation of Emergent Evacuation Considering the Classroom Seats Arrangement","authors":"Q. Tian, Yihang Xu","doi":"10.1109/CSO.2010.210","DOIUrl":"https://doi.org/10.1109/CSO.2010.210","url":null,"abstract":"An improved CA model is adopted to simulate the evacuation process in a classroom. It is found that the funnel shape aisle is most efficient, which is consistent with previous studies. Two evacuation time indicators, namely the average evacuation time (AT) and the longest evacuation time (LT), are used in simulations to show the effectiveness and efficiency of the system.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130736738","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}
引用次数: 2
On the Max-geometric Mean Powers of a Fuzzy Matrix 模糊矩阵的最大几何平均幂
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.164
Chia-Cheng Liu, Yung-Yih Lur, Yan-Kuen Wu
{"title":"On the Max-geometric Mean Powers of a Fuzzy Matrix","authors":"Chia-Cheng Liu, Yung-Yih Lur, Yan-Kuen Wu","doi":"10.1109/CSO.2010.164","DOIUrl":"https://doi.org/10.1109/CSO.2010.164","url":null,"abstract":"Fuzzy matrices provide convenient representations for fuzzy relations on finite universes. In the literature, the powers of a fuzzy matrix with max-min/ max-product/ max-Archimedean t-norm compositions/ max-arithmetic mean composition have been studied. It turns out that the limiting behavior of the powers of a fuzzy matrix depends on the composition involved. In this paper, the max-geometric mean composition is considered for the fuzzy relations. We proposed a simple and effective characterization for the limiting behavior with the notion of asymptotic period of a fuzzy matrix with the max-geometric mean composition. Moreover, if a fuzzy matrix A is primitive then we show that the max-geometric mean powers of A are always convergent.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130892103","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
A New Smooth Method for the l1 Exact Penalty Function for Inequality Constrained Optimization 不等式约束优化l1精确惩罚函数的光滑化新方法
2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI: 10.1109/CSO.2010.157
Zhijie Wang, Sanming Liu
{"title":"A New Smooth Method for the l1 Exact Penalty Function for Inequality Constrained Optimization","authors":"Zhijie Wang, Sanming Liu","doi":"10.1109/CSO.2010.157","DOIUrl":"https://doi.org/10.1109/CSO.2010.157","url":null,"abstract":"Exact penalty function methods for the solution of constrained optimization problem are based on the construction of a function whose unconstrained minimizing points are also solution of the constrained problem. One of the popular exact penalty functions is l1 exact penalty function. However l1 exact penalty function is not a smooth function. In this paper, we propose a new method for smoothing the l1 exact penalty function for inequality constrained optimization. Error estimations are obtained among the optimal objective function values of the smoothed penalty problem, of the nonsmooth penalty problem problem and of the original optimization problem. We develop an efficient algorithm for solving the optimization problem based the smoothed penalty function and prove the convergence of the algorithm.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134242255","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信