首页 > 最新文献

2011 IEEE International Conference on Cloud Computing and Intelligence Systems最新文献

英文 中文
Application of memetic algorithm in control of linear inverted pendulum 模因算法在线性倒立摆控制中的应用
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045041
Jing Zhang, Lixiang Zhang, Jingjing Xie
The inverted pendulum is a kind of system with multi-variables, non-linearity, strong coupling and instinct instability, for which efficient and effective control strategies are needed to keep the pendulum stable at the position of dynamic balance. This paper applies memetic algorithm (MA) to obtain the optimal parameter settings for the LQR controller for the inverted pendulum system. By contrast with the results of the traditional LQR controlling system, a conclusion could be drawn that MA performs better in terms of effectiveness.
倒立摆是一种多变量、非线性、强耦合和本能不稳定性的系统,需要有效的控制策略来保持倒立摆在动平衡位置的稳定。本文应用模因算法求解倒立摆系统LQR控制器的最优参数设置。通过与传统LQR控制系统的结果对比,可以得出结论,在有效性方面,MA具有更好的效果。
{"title":"Application of memetic algorithm in control of linear inverted pendulum","authors":"Jing Zhang, Lixiang Zhang, Jingjing Xie","doi":"10.1109/CCIS.2011.6045041","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045041","url":null,"abstract":"The inverted pendulum is a kind of system with multi-variables, non-linearity, strong coupling and instinct instability, for which efficient and effective control strategies are needed to keep the pendulum stable at the position of dynamic balance. This paper applies memetic algorithm (MA) to obtain the optimal parameter settings for the LQR controller for the inverted pendulum system. By contrast with the results of the traditional LQR controlling system, a conclusion could be drawn that MA performs better in terms of effectiveness.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120889905","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}
引用次数: 8
Japanese named entity recognition for question answering system 日语命名实体识别问答系统
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045098
Ye Liu, F. Ren
Current question answering (QA) systems usually contain named entity recognizer (NER) as a core component. NER is an important and difficult task in computational linguistics. It plays an important role in natural language processing application such as Question Answering, Machine Translation, and Information Retrieval etc. NER includes the identification and classification of certain proper nouns (like location, organization, person, data, money and others) in a text. The purpose of our study is to recognize and extract the exact Japanese sightseeing domain named entities. It is a basic step for the following processing: question analysis and keyword extraction information retrieval. As well as, through doing the named entity recognition, we consider that it can mine exact information from text document to respond to user. This paper describes how to do the Japanese sightseeing named entity recognition due to we are constructing a Japanese sightseeing question answering system. We adopt the hybrid method which combined with machine learning and rule-base method. In the experiment of Japanese sightseeing domain named entity recognition we have got excellent precision and recalling rates. It shows that our method is effective and can be used in a practical question answering system.
当前的问答系统通常包含命名实体识别器(NER)作为核心组件。NER是计算语言学中一项重要而又困难的任务。它在问答、机器翻译、信息检索等自然语言处理应用中发挥着重要作用。NER包括对文本中某些专有名词(如位置、组织、人员、数据、金钱等)的识别和分类。本研究的目的是识别和提取准确的日语观光域名实体。这是后续处理的基本步骤:问题分析和关键词提取信息检索。同时,通过对命名实体的识别,可以从文本文档中挖掘出准确的信息来响应用户。由于我们正在构建一个日本观光问答系统,本文介绍了如何对日本观光命名实体进行识别。我们采用机器学习和基于规则的方法相结合的混合方法。在日语观光域名实体识别实验中,我们取得了很好的准确率和召回率。结果表明,该方法是有效的,可用于实际的问答系统。
{"title":"Japanese named entity recognition for question answering system","authors":"Ye Liu, F. Ren","doi":"10.1109/CCIS.2011.6045098","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045098","url":null,"abstract":"Current question answering (QA) systems usually contain named entity recognizer (NER) as a core component. NER is an important and difficult task in computational linguistics. It plays an important role in natural language processing application such as Question Answering, Machine Translation, and Information Retrieval etc. NER includes the identification and classification of certain proper nouns (like location, organization, person, data, money and others) in a text. The purpose of our study is to recognize and extract the exact Japanese sightseeing domain named entities. It is a basic step for the following processing: question analysis and keyword extraction information retrieval. As well as, through doing the named entity recognition, we consider that it can mine exact information from text document to respond to user. This paper describes how to do the Japanese sightseeing named entity recognition due to we are constructing a Japanese sightseeing question answering system. We adopt the hybrid method which combined with machine learning and rule-base method. In the experiment of Japanese sightseeing domain named entity recognition we have got excellent precision and recalling rates. It shows that our method is effective and can be used in a practical question answering system.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"31 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120918591","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}
引用次数: 10
Chirp extraction of wave-breaking-free soliton in a passively mode-locked Yb-doped fiber laser based on STFT and WVD 基于STFT和WVD的被动锁模掺镱光纤激光器中无破波孤子的啁啾提取
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045133
Ge Wu, X. Tian, Bo Gao, Jiangdong Shan
In this contribution, we obtain self-similar propagation of high-energy, ultrashort, parabolic pulses in a passively mode-locked Yb-doped fiber laser by numerical simulation using our non-distributed model. For extracting the chirp of these wave-breaking-free self-similar solitons to research characteristics of them, we propose several methods to accomplish the extraction and then discuss the advantages and disadvantages of these time-frequency analysis methods in this particular application.
在这篇论文中,我们利用我们的非分布模型,通过数值模拟获得了高能、超短、抛物型脉冲在被动锁模掺镱光纤激光器中的自相似传播。为了提取这些无破波自相似孤子的啁啾,研究它们的特性,我们提出了几种完成提取的方法,然后讨论了这些时频分析方法在这种特定应用中的优缺点。
{"title":"Chirp extraction of wave-breaking-free soliton in a passively mode-locked Yb-doped fiber laser based on STFT and WVD","authors":"Ge Wu, X. Tian, Bo Gao, Jiangdong Shan","doi":"10.1109/CCIS.2011.6045133","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045133","url":null,"abstract":"In this contribution, we obtain self-similar propagation of high-energy, ultrashort, parabolic pulses in a passively mode-locked Yb-doped fiber laser by numerical simulation using our non-distributed model. For extracting the chirp of these wave-breaking-free self-similar solitons to research characteristics of them, we propose several methods to accomplish the extraction and then discuss the advantages and disadvantages of these time-frequency analysis methods in this particular application.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"242 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121332286","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
Efficient resource arbitration and allocation strategies in cloud computing through virtualization 基于虚拟化的云计算高效资源仲裁与分配策略
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045097
Daniel Warneke, O. Kao
Resource Arbitration and allocation are some of the very critical management issues in cloud computing, because IT services are to be provisioned on subscriptions based on the consumer computing requirements. Enabling the optimal utilization of the requested resources by the consumers is a challenge, and any failure of it can possibly lead to a serious performance degradation of the cloud system. Here, we focus on the dynamic distribution and optimal utilization of the resources in the cloud architecture in a specific time period. We have proposed a Rule Based Resource allocation model (RBRAM) along with a Supply-Demand analysis of the resources in a time marching paradigm. Within the framework of this approach, the analysis shows an improved performance of the system, achieved through efficiently allocating the resources to the jobs submitted to the cloud.
资源仲裁和分配是云计算中一些非常关键的管理问题,因为IT服务是根据消费者计算需求在订阅上提供的。使使用者能够最优地利用所请求的资源是一项挑战,任何失败都可能导致云系统的严重性能下降。在这里,我们将重点关注特定时间段内云架构中资源的动态分布和最佳利用。我们提出了一个基于规则的资源分配模型(RBRAM),并在时间推进范式中对资源进行供需分析。在此方法的框架内,分析显示了系统性能的改进,这是通过有效地将资源分配给提交给云的作业来实现的。
{"title":"Efficient resource arbitration and allocation strategies in cloud computing through virtualization","authors":"Daniel Warneke, O. Kao","doi":"10.1109/CCIS.2011.6045097","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045097","url":null,"abstract":"Resource Arbitration and allocation are some of the very critical management issues in cloud computing, because IT services are to be provisioned on subscriptions based on the consumer computing requirements. Enabling the optimal utilization of the requested resources by the consumers is a challenge, and any failure of it can possibly lead to a serious performance degradation of the cloud system. Here, we focus on the dynamic distribution and optimal utilization of the resources in the cloud architecture in a specific time period. We have proposed a Rule Based Resource allocation model (RBRAM) along with a Supply-Demand analysis of the resources in a time marching paradigm. Within the framework of this approach, the analysis shows an improved performance of the system, achieved through efficiently allocating the resources to the jobs submitted to the cloud.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"99 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126032374","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}
引用次数: 27
Robust COA planning with varying durations 具有不同持续时间的健壮的COA计划
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045104
Luohao Tang, Cheng Zhu, Weiming Zhang, Zhong Liu
COA (Course of Action) planning involves resource allocation and task scheduling. Traditionally, this problem is tackled with the assumption that task duration is constant and with the objective to minimize the makespan. In contrast to this, this paper assumes task duration can vary in a time interval and the objective is to maximize the RM (Robustness Measure) given the deadline, which makes sense to deal with the duration uncertainty. A COA planning method based on GA (Genetic Algorithm) and STN (Simple Temporal Network) is proposed and a COA planning instance is presented to illustrate the usefulness of this method.
COA(行动过程)计划包括资源分配和任务调度。传统上,解决这个问题的假设是任务持续时间是恒定的,目标是最小化完工时间。与此相反,本文假设任务持续时间可以在一个时间间隔内变化,目标是在给定截止日期的情况下最大化RM(鲁棒性度量),这对处理持续时间的不确定性是有意义的。提出了一种基于遗传算法(GA)和简单时态网络(STN)的COA规划方法,并通过实例说明了该方法的有效性。
{"title":"Robust COA planning with varying durations","authors":"Luohao Tang, Cheng Zhu, Weiming Zhang, Zhong Liu","doi":"10.1109/CCIS.2011.6045104","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045104","url":null,"abstract":"COA (Course of Action) planning involves resource allocation and task scheduling. Traditionally, this problem is tackled with the assumption that task duration is constant and with the objective to minimize the makespan. In contrast to this, this paper assumes task duration can vary in a time interval and the objective is to maximize the RM (Robustness Measure) given the deadline, which makes sense to deal with the duration uncertainty. A COA planning method based on GA (Genetic Algorithm) and STN (Simple Temporal Network) is proposed and a COA planning instance is presented to illustrate the usefulness of this method.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127896044","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}
引用次数: 6
A CPU-GPU hybrid computing framework for real-time clothing animation 一种用于实时服装动画的CPU-GPU混合计算框架
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045096
Hanwen Li, Y. Wan, Guanghui Ma
Real-time clothing animation has wide applications in many areas such as the design industry and e-commerce. Existing cloth simulation techniques based on the physical model can produce realistic animation effect. But they often incur a high computational load and hence are very time-consuming. GPU has become more widely used for high performance computing for its parallel processing capability. However, in the clothing animation problem, some tasks may not be suitable for GPU. In order to achieve the real-time realistic animation effect, this paper proposes a CPU-GPU hybrid computing framework. It is found that this framework can significantly improve bandwidth utilization. In this framework, the GPU is mainly in charge of high level parallel modules such as force calculation, collision detection and position update for each cloth vertex, while the CPU deals with the serial over-stretching process and other related computing. The implemented system achieves 10 times performance increase compared to the CPU mode, and can generate about 100 clothing animation key frames per second, thus meeting the real-time requirement for clothing animation.
服装实时动画在设计行业、电子商务等领域有着广泛的应用。现有的基于物理模型的布料仿真技术可以产生逼真的动画效果。但是它们通常会产生很高的计算负载,因此非常耗时。GPU以其并行处理能力在高性能计算中得到越来越广泛的应用。然而,在服装动画问题中,有些任务可能不适合GPU。为了实现实时逼真的动画效果,本文提出了一种CPU-GPU混合计算框架。结果表明,该框架可以显著提高带宽利用率。在该框架中,GPU主要负责每个布顶点的力计算、碰撞检测和位置更新等高级并行模块,CPU负责串行过伸处理和其他相关计算。与CPU模式相比,实现了10倍的性能提升,每秒可生成约100个服装动画关键帧,满足了服装动画的实时性要求。
{"title":"A CPU-GPU hybrid computing framework for real-time clothing animation","authors":"Hanwen Li, Y. Wan, Guanghui Ma","doi":"10.1109/CCIS.2011.6045096","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045096","url":null,"abstract":"Real-time clothing animation has wide applications in many areas such as the design industry and e-commerce. Existing cloth simulation techniques based on the physical model can produce realistic animation effect. But they often incur a high computational load and hence are very time-consuming. GPU has become more widely used for high performance computing for its parallel processing capability. However, in the clothing animation problem, some tasks may not be suitable for GPU. In order to achieve the real-time realistic animation effect, this paper proposes a CPU-GPU hybrid computing framework. It is found that this framework can significantly improve bandwidth utilization. In this framework, the GPU is mainly in charge of high level parallel modules such as force calculation, collision detection and position update for each cloth vertex, while the CPU deals with the serial over-stretching process and other related computing. The implemented system achieves 10 times performance increase compared to the CPU mode, and can generate about 100 clothing animation key frames per second, thus meeting the real-time requirement for clothing animation.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114250916","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}
引用次数: 13
Execution flow control: Simplified design of parallel applications 执行流控制:简化并行应用程序的设计
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045074
Jing-Wen Jin, Xin Li, Shanzhi Chen, Yan Wang
Google's MapReduce enables program automatic parallelization by partitioning input data and replicating functions, but it does not directly support complex parallel modes like pipeline. However, many parallel modes are helpful to optimize solution of parallel computing problem. In this paper, we propose EFC (Execution Flow Control), a novel programming model and related implementation. It supports an execution-flow control interface which makes the model more compatible with different parallel modes. It allows user to modify execution flow as needed. The new model enables simple compact design of most parallel modes.
Google的MapReduce通过划分输入数据和复制函数来实现程序自动并行化,但它不直接支持复杂的并行模式,比如流水线。然而,许多并行模式有助于并行计算问题的优化求解。本文提出了一种新的编程模型EFC (Execution Flow Control)及其实现方法。它支持一个执行流控制接口,使模型与不同的并行模式更加兼容。它允许用户根据需要修改执行流。新模型使大多数并行模式的设计简单紧凑。
{"title":"Execution flow control: Simplified design of parallel applications","authors":"Jing-Wen Jin, Xin Li, Shanzhi Chen, Yan Wang","doi":"10.1109/CCIS.2011.6045074","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045074","url":null,"abstract":"Google's MapReduce enables program automatic parallelization by partitioning input data and replicating functions, but it does not directly support complex parallel modes like pipeline. However, many parallel modes are helpful to optimize solution of parallel computing problem. In this paper, we propose EFC (Execution Flow Control), a novel programming model and related implementation. It supports an execution-flow control interface which makes the model more compatible with different parallel modes. It allows user to modify execution flow as needed. The new model enables simple compact design of most parallel modes.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126531319","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 PaaS based metadata-driven ETL framework 基于PaaS的元数据驱动ETL框架
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045113
Liutong Xu, Jia Liao, Ruixue Zhao, Bin Wu
Knowledge discovery has often used as a background application to motivate many technical problems in ETL research. However, traditional ETL tools face new challenges include tremendous amount of data and limitation of computing ability and so on. Meanwhile, MapReduce parallel computing model has been widely used in recent years. In This paper, we first analyze the problems of existing ETL tools and propose a metadata-driven ETL service model, and then summarize the types of metadata and their application scopes. Based on this metadata-driven ETL service model, we put forward a concrete ETL framework combined ETL with MapReduce algorithm framework and provided as PaaS to meet the requirements. Afterwards, many significant services are also discussed. At last, we illustrate some strategies for advancing the flexibility, extensibility of the framework and promote the reusability of ETL components and ETL application. In conclusion, practices have proved that the model and the framework proposed in this paper have advantages that open-source or commercial ETL tools do not have and can deal the problem of processing large scale data.
在ETL研究中,知识发现经常被用作激发许多技术问题的后台应用。然而,传统的ETL工具面临着巨大的数据量和计算能力的限制等新的挑战。同时,MapReduce并行计算模型近年来得到了广泛的应用。本文首先分析了现有ETL工具存在的问题,提出了一种元数据驱动的ETL服务模型,然后总结了元数据的类型及其应用范围。基于这种元数据驱动的ETL服务模型,我们提出了ETL与MapReduce算法框架相结合的具体ETL框架,并作为PaaS提供以满足需求。随后,还讨论了许多重要的服务。最后,提出了提高ETL框架的灵活性和可扩展性、提高ETL组件和ETL应用的可重用性的策略。总之,实践证明,本文提出的模型和框架具有开源或商业ETL工具所不具备的优势,能够处理大规模数据的处理问题。
{"title":"A PaaS based metadata-driven ETL framework","authors":"Liutong Xu, Jia Liao, Ruixue Zhao, Bin Wu","doi":"10.1109/CCIS.2011.6045113","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045113","url":null,"abstract":"Knowledge discovery has often used as a background application to motivate many technical problems in ETL research. However, traditional ETL tools face new challenges include tremendous amount of data and limitation of computing ability and so on. Meanwhile, MapReduce parallel computing model has been widely used in recent years. In This paper, we first analyze the problems of existing ETL tools and propose a metadata-driven ETL service model, and then summarize the types of metadata and their application scopes. Based on this metadata-driven ETL service model, we put forward a concrete ETL framework combined ETL with MapReduce algorithm framework and provided as PaaS to meet the requirements. Afterwards, many significant services are also discussed. At last, we illustrate some strategies for advancing the flexibility, extensibility of the framework and promote the reusability of ETL components and ETL application. In conclusion, practices have proved that the model and the framework proposed in this paper have advantages that open-source or commercial ETL tools do not have and can deal the problem of processing large scale data.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130610085","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}
引用次数: 5
Development of servers in cloud computing to solve issues related to security and backup 开发云计算服务器,解决安全和备份相关问题
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045052
P. Hemant, N. P. Chawande, Avinash Sonule, Hemant Wani
Cloud computing makes an aim come true for the users to get all the resources instantly from various locations that are not known. But there are lot of hurdles in accomplishing this idea in the form of security parameters and backup issues. In this paper we have discussed the solution to there issue by integrating the encryption and server management techniques in order to make a smooth transaction between the user and the server. We propose a new prototype system where we have introduced a governance body which will handle all the transactions from the user to the actual server from where the user is requesting. We have introduced routing table at each end server and middle server (Governance server) so as to get the database of client to server connectivity.
云计算实现了用户从各种未知位置即时获取所有资源的目标。但是在实现这个想法的过程中存在很多障碍,比如安全参数和备份问题。在本文中,我们讨论了通过集成加密和服务器管理技术来解决这一问题,以使用户和服务器之间的事务能够顺利进行。我们提出了一个新的原型系统,在这个系统中,我们引入了一个治理主体,它将处理从用户到用户发出请求的实际服务器的所有事务。我们在每个端服务器和中间服务器(治理服务器)上引入了路由表,以获得客户端数据库到服务器的连通性。
{"title":"Development of servers in cloud computing to solve issues related to security and backup","authors":"P. Hemant, N. P. Chawande, Avinash Sonule, Hemant Wani","doi":"10.1109/CCIS.2011.6045052","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045052","url":null,"abstract":"Cloud computing makes an aim come true for the users to get all the resources instantly from various locations that are not known. But there are lot of hurdles in accomplishing this idea in the form of security parameters and backup issues. In this paper we have discussed the solution to there issue by integrating the encryption and server management techniques in order to make a smooth transaction between the user and the server. We propose a new prototype system where we have introduced a governance body which will handle all the transactions from the user to the actual server from where the user is requesting. We have introduced routing table at each end server and middle server (Governance server) so as to get the database of client to server connectivity.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130371754","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}
引用次数: 33
Two novel 60 GHz coplanar waveguide structure filters with electric and magnetic coupling 两种新型60ghz共面波导结构的电磁耦合滤波器
Pub Date : 2011-10-13 DOI: 10.1109/CCIS.2011.6045139
H. Wang, Xiuping Li
The theory of asymmetric λ/2 coupling filter is presented. According to the both coupling modes of electric and magnetic, two novel coplanar waveguide (CPW) structure filters, the center frequency is 60GHz, is obtained based on the theory of asymmetric λ/2 coupling. The harmonic suppression technology is introduced in the design process. The parasitic frequency and second harmonic are effectively suppressed by the harmonic suppression technology. The bandwidth of the electric coupling filter is 1.5GHz and the insertion loss is 0.6 dB. The bandwidth of the magnetic coupling filter is 12GHz and the insertion loss is 0.3 dB.
介绍了非对称λ/2耦合滤波器的原理。根据电、磁两种耦合模式,基于非对称λ/2耦合理论,得到了两个中心频率为60GHz的新型共面波导(CPW)结构滤波器。在设计过程中引入了谐波抑制技术。谐波抑制技术有效地抑制了系统的寄生频率和二次谐波。电耦合滤波器的带宽为1.5GHz,插入损耗为0.6 dB。磁耦合滤波器的带宽为12GHz,插入损耗为0.3 dB。
{"title":"Two novel 60 GHz coplanar waveguide structure filters with electric and magnetic coupling","authors":"H. Wang, Xiuping Li","doi":"10.1109/CCIS.2011.6045139","DOIUrl":"https://doi.org/10.1109/CCIS.2011.6045139","url":null,"abstract":"The theory of asymmetric λ/2 coupling filter is presented. According to the both coupling modes of electric and magnetic, two novel coplanar waveguide (CPW) structure filters, the center frequency is 60GHz, is obtained based on the theory of asymmetric λ/2 coupling. The harmonic suppression technology is introduced in the design process. The parasitic frequency and second harmonic are effectively suppressed by the harmonic suppression technology. The bandwidth of the electric coupling filter is 1.5GHz and the insertion loss is 0.6 dB. The bandwidth of the magnetic coupling filter is 12GHz and the insertion loss is 0.3 dB.","PeriodicalId":128504,"journal":{"name":"2011 IEEE International Conference on Cloud Computing and Intelligence Systems","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133251980","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
期刊
2011 IEEE International Conference on Cloud Computing and Intelligence Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1