检索结果-内蒙古大学图书馆

An hybrid model through the fusion of sensitivity based linear learning method and type-2 fuzzy logic systems for modeling PVT properties of crude oil systems

An hybrid model through the fusion of sensitivity based line...

引用

2011 5th Malaysian Conference in software engineering, MySEC 2011

作者： Olatunji, Sunday Olusanya Selamat, Ali Raheem, Abdul Azeez Abdul Intelligent Software Engineering Laboratory Faculty of Computer Science and Information Systems University Teknologi Malaysia 81310 UTM Skudai Johor Malaysia Centre for Petroleum and Minerals Research Institute King Fahd University of Petroleum and Mineral Dhahran 31261 Saudi Arabia

ISBN: (纸本)9781457715310

Sensitivity based linear learning method (SBLLM) has recently been used as predictive tool due to its unique characteristics and performance, particularly its high stability and consistency during predictions. However, the generalization capability of SBLLM is sometimes limited depending on the nature of the dataset, particularly on whether uncertainty is present in the dataset or not. In order to reduce the effects of uncertainties in SBLLM prediction and improve its generalization ability, this paper proposes a hybrid system through the unique combination of type-2 fuzzy logic systems (type-2 FLS) and SBLLM;thereafter the hybrid system was used to model PVT properties of crude oil systems. In the proposed hybrid, the type-2 FLS is used to handle uncertainties in reservoir data so that the final output from the type-2 FLS is then passed to the SBLLM for training and then final prediction using testing dataset follows. Comparative studies have been carried out to compare the performance of the proposed T2-SBLLM hybrid system with each of the constituent type-2 FLS and SBLLM. Empirical results from simulation show that the proposed T2-SBLLM hybrid model greatly improved upon the performance of SBLLM. © 2011 IEEE.

关键词： Feedforward neural networks

来源：评论

学校读者我要写书评

暂无评论

Implementation of stepwise satisfiability checker for reactive system specifications using distributed objects technology

Computer Software

引用

computer software 2011年第4期28卷 262-281页

作者： Ando, Takahiro Miyamoto, Yuuki Hagihara, Shigeki Yonezaki, Naoki National Institute of Advanced Industrial Science and Technology Japan Software Division Hitachi Ltd. Japan Dept. of Computer Science Graduate School of Information Science and Engineering Tokyo Institute of Technology Japan

The realizability is a well known property for reactive system specification, and it shows that there exists a system which reacts properly against any environment following the specification. In system development process, we can reduce reversions if realizability for specification is verified before implementation of system. However, the verification cost is too high to verify the realizability of a real scale system specification. On the other hand, stepwise satisfiability which is a necessary condition for the realizability has been proposed. Its verification cost is less than that of realizability, and verification of the property is useful to find the incompleteness of specification. Even if the verification of stepwise satisfiability, the required cost is too high. In order to overcome this problem, this paper proposes methods of implementing the stepwise satisfiability checker using a distributed object technology on the parallel distributed environment. Then, we implement the stepwise satisfiability checker in Java based on our methods, and confirm the effectiveness of our methods by experiments. In this paper, we present our ideas and methods of the implementations for three parts of our checker. The first is how our checker compose a tableau graph on the parallel distributed environment. The second is the implementation method to determinize the distributed graph. The third is the dead end checking method for the deterministic distributed graph.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Symbolic model checking the knowledge in Herbivore protocol

Symbolic model checking the knowledge in Herbivore protocol

引用

Lecture Notes in computer science

作者： Luo, Xiangyu Su, Kaile Gu, Ming Wu, Lijun Yang, Jinji College of Computer Science and Technology Huaqiao University Xiamen China School of Software Tsinghua University Beijing China College of Mathmatics Physics and Information Engineering Zhejiang Normal University Jinhua China Institute for Integrated and Intelligent Systems Griffith University Brisbane QLD Australia School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China School of Computer South China Normal University Guangzhou China

ISBN: (纸本)9783642206733

The importance of anonymity has increased over the past few years in many applications. Herbivore is a distributed anonymous communication system, providing private file sharing and messaging over the Internet. In this paper, we utilize MCTK to model the round protocol of the Herbivore system and verify the anonymity and other knowledge properties that the protocol should provide, where MCTK is an OBDD-based symbolic model checker for temporal logic of knowledge developed by us, under the semantics of interpreted systems with local propositions. We model the round protocol of the Herbivore system in MCTK under the assumption that all agents have perfect recall of all observations. We implement the round protocol of the Herbivore system in MCTK and another epistemic model checker MCK. The encouraging experimental results show the validity of our MCTK. © 2011 Springer-Verlag.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

A drum-buffer-rope based scheduling method for semiconductor manufacturing system

A drum-buffer-rope based scheduling method for semiconductor...

引用

2011 7th IEEE International Conference on Automation science and engineering, CASE 2011

作者： Cao, Zhengcai Peng, Yazhen Wang, Yongji College of Information Science and Technology Beijing University of Chemical Technology Beijing 100029 China State Key Laboratory of Manufacturing Systems Engineering Xi'an Jiaotong University Xi'an 710054 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781457717307

Scheduling in semiconductor manufacturing system is an important task for the industries faced with a large amount of resource competitions. Effective scheduling can improve the overall system performance and customer satisfaction. In this paper, a scheduling method with the core of bottleneck equipment control is designed referring to Drum-Buffer-Rope (DBR) theory. In order to identify the main-bottleneck, the relative load which takes the feature of reentrance into consideration is applied. For the avoidance of local blocking, the management of sub-bottleneck is presented. As both releasing and dispatching are taken into account, a scheduling method based on the compound priority is formed. Finally, HP-24 semiconductor wafer fabrication is used as an example to demonstrate the effectiveness of the proposed method. © 2011 IEEE.

关键词： Customer satisfaction

来源：评论

学校读者我要写书评

暂无评论

Research of an optimized mobile IPv6 real-time seamless handover technology

引用

Journal of Networks 2011年第9期6卷 1373-1378页

作者： Zhuang, Lei Wang, Chao Song, Wei Department of Computer Science and Technology School of Information Engineering Zhengzhou University Zhengzhou China Department of Network Engineering School of Software Nanyang Institute of Technology Nanyang China

Mobile IPv6 provides mobility support for hosts connecting to the Internet, it solves addressable problems of the mobile terminal, and the mobile terminals can obtain network services without changing IP addresses. But MIPv6 can introduce substantial network expenses and lengthy handoff delay during the mobile handover process, meanwhile, more and more delay sensitive real-time applications require a packet lossless QoS guarantee during a handoff. It proposes an optimized seamless handover mechanism on the basis of existing handoff methods in this paper, it builds on top of the hierarchical method and the fast handoff mechanism and adopts a decision engine-based dynamic distributed architecture, at last it verifies that using this new handoff scheme can reduce packet loss and handoff delay efficiently and improve handoff efficiency by doing simulation experiments. © 2011 ACADEMY PUBLISHER.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Developing applications with aspect-oriented change realization

Developing applications with aspect-oriented change realizat...

引用

Lecture Notes in computer science

作者： Vranić, Valentino Bebjak, Michal Menkyna, Radoslav Dolog, Peter Institute of Informatics and Software Engineering Faculty of Informatics and Information Technologies Slovak University of Technology Ilkovičova 3 84216 Bratislava 4 Slovakia Department of Computer Science Aalborg University Selma Lagerlöfs Vej 300 DK-9220 Aalborg East Denmark

ISBN: (纸本)9783642223853

An approach to aspect-oriented change realization is proposed in this paper. With aspect-oriented programming changes can be treated explicitly and directly at the programming language level. Aspect-oriented change realizations are mainly based on aspect-oriented design patterns or themselves constitute pattern-like forms in connection to which domain independent change types can be identified. However, it is more convenient to plan changes in a domain specific manner. Domain specific change types can be seen as subtypes of generally applicable change types. This relationship can be maintained in a form of a catalog. Further changes can actually affect the existing aspect-oriented change realizations, which can be solved by adapting the existing change implementation or by implementing an aspect-oriented change realization of the existing change without having to modify its source code. Separating out the changes this way can lead to a kind of aspect-oriented refactoring beneficial to the application as such. As demonstrated partially by the approach evaluation, the problem of change interaction may be avoided to the large extent by using appropriate aspect-oriented development tools, but for a large number of changes, dependencies between them have to be tracked, which could be supported by feature modeling. © 2011 IFIP International Federation for information Processing.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Automatic FFT Performance Tuning on OpenCL GPUs

Automatic FFT Performance Tuning on OpenCL GPUs

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yan Li Yunquan Zhang Haipeng Jia Guoping Long Ke Wang Laboratory of Parallel Software and Computational Science Institute of Software State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing China School of Information Science and Engineering Ocean University of China Qingdao China Laboratory of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences Beijing China

Many fields of science and engineering, such as astronomy, medical imaging, seismology and spectroscopy, have been revolutionized by Fourier methods. The fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. The emerging class of high performance computing architectures, such as GPU, seeks to achieve much higher performance and efficiency by exposing a hierarchy of distinct memories to programmers. However, the complexity of GPU programming poses a significant challenge for programmers. In this paper, based on the Kronecker product form multi-dimensional FFTs, we propose an automatic performance tuning framework for various OpenCL GPUs. Several key techniques of GPU programming on AMD and NVIDIA GPUs are also identified. Our OpenCL FFT library achieves up to 1.5 to 4 times, 1.5 to 40 times and 1.4 times the performance of clAmdFft 1.0 for 1D, 2D and 3D FFT respectively on an AMD GPU, and the overall performance is within 90% of CUFFT 4.0 on two NVIDIA GPUs.

关键词： Graphics processing unit Instruction sets Vectors Memory management Kernel Programming

来源：评论

学校读者我要写书评

暂无评论

Strong barrier coverage using directional sensors with arbitrarily tunable orientations

Strong barrier coverage using directional sensors with arbit...

引用

2011 7th International Conference on Mobile Ad-hoc and Sensor Networks, MSN 2011

作者： Tao, Dan Mao, Xu-Fei Tang, Shao-Jie Zhang, Hai-Tao Ma, Hua-Dong Xie, Hai-Jiang School of Electronic and Information Engineering Beijing Jiaotong University Beijing China Beijing Key Laboratory of Intelligent Telecomm. Software and Multimedia Beijing University of Posts and Telecomm. Beijing China Department of Computer Science Illinois Institute of Technology Chicago IL United States Department of Computer Science and Technology Xi'An JiaoTong University Xi'An China

ISBN: (纸本)9780769546100

Barrier coverage is an important problem for sensor networks to fulfill some given sensing tasks. Barrier coverage guarantees the detection of events happened crossing a barrier of sensors. In majority study of barrier coverage using sensor networks, sensors are assumed to have an isotropic sensing model. However, in many applications such as monitoring an area using video camera, the sensors have directional sensing model. In this paper, we investigate strong barrier coverage using directional sensors, where sensors have arbitrarily tunable orientations to provide good coverage. We investigate the problem of finding appropriate orientations of directional sensors such that they can provide strong barrier coverage. By exploiting geographical relations among directional sensors and deployment region boundaries, we first introduce the concept of virtual node to reduce the solution space from continuous domain to discrete domain. We then construct a directional barrier graph (DBG) to model this barrier coverage question such that we can quickly answer whether there are directional sensors' orientations that can provide strong barrier coverage over a given belt region. If the belt region is strong barrier covered, we then develop energy-efficient solutions to find strong barrier path(s) that will approximately minimize the total or the maximum rotation angles of all directional sensors. Extensive simulations are conducted to verify the effectiveness of our solution. © 2011 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

The formal analysis of sequence diagram by an object-oriented timed transition system

引用

International Journal of Advancements in Computing Technology 2011年第3期3卷 134-144页

作者： Zhu, Meixia Wang, Hanpin Liu, Xikui Institute of Software School of Electronics Engineering and Computer Science Key Laboratory of High Confidence Software Technologies of Ministry of Education Peking University Beijing China College of Information Engineering Shandong University of Science and Technology Qingdao Shandong China

The Modeling and Analysis of Real-Time Embedded Systems specification (MARTE) provides a set of diagrams with time properties. Nowadays, they are frequently used in the preliminary developing phase of the embedded real time system;however, it is not easy to verify the system they have described because few tools can check them directly. This is mainly due to their semi-formal styles and the sequence diagram is no exception. An extended model named TTS4SD (timed transition system for sequence diagram) is advanced for describing the formal semantics of the sequence diagram with time properties which is defined in MARTE. Unlike most of the existing works, the semantics describe its intact behaviors in two aspects: event transitions when the guards are fixed and fragment transitions when the guards are changed from one to another. Moreover, by means of the push/delete instructions on stack, we transform the SD into a TTS4SD with the help of two algorithms which put the semantics from formal aspect to practical application. Then based on the TTS4SD, the sequence diagram is analyzed in a rigid way to eliminate the mistakes arising from the designing stage. An example is running through to describe the above processes.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Time Petri net model with mixed semantics

引用

Ruan Jian Xue Bao/Journal of software 2011年第6期22卷 1199-1209页

作者： Pan, Li Ding, Zhi-Jun Guo, Guan-Qi School of Information and Communication Engineering Hu'nan Institute of Science and Technology Yueyang 414006 China Department of Computer Science and Technology Tongji University Shanghai 200092 China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

This paper presents a time Petri net (TPN) model with mixed semantics that efficiently addresses the schedulability analysis problem of the existing semantics models. The proposed model associates each firable transition with a mandatory firing point that is set to the least upper bound of the transition and its non-conflicting transitions. This treatment not only eliminates the effect of conflicting transitions on the transition friability and extends the scheduling scope of the TPN model, but also ensures the time limit of the task scheduling. To determine the expressiveness of the mixed model, the study proves that the mixed semantics model has the power of Turing machines and its marking reachability problem is undecidable. The timed expressiveness of three semantics models with respect to timed language acceptance is also compared. A state class approach is then proposed for the scheduling analysis of the mixed model. Finally, a flexible manufacturing system is used as an example to compare the scheduling ability of three semantics models. ©2011 ISCAS.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：