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

2014 IEEE 5th International Conference on Software Engineering and Service Science

作者： Guoqiang Li Dandan Song Lejian Liao Fuzhen Sun Jianguang Du Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of Technology

Service-oriented computing is a widely adopted paradigm in real *** the continuous evolution of services,adaptive service composition has always been a major *** is a big challenge to adjust the composition to be optimal in *** this paper,a learning automata-based approach is proposed to attack this *** consists of two important components: random environment and a learning *** former can be mapped to the service’s execution *** latter is responsible for the adaptation achievement using reward and penalty functions,while we take the service composition structures into account to compute the usefulness value of all *** last,simulation study has shown that our approach is efficient to find the optimal（sub-optimal） composition.

关键词： web service learning automata self-adaptive web service composition

来源：评论

学校读者我要写书评

暂无评论

Learning automata-based adaptive web services composition

Learning automata-based adaptive web services composition

引用

IEEE International Conference on Software Engineering and Service Sciences (ICSESS)

作者： Guoqiang Li Dandan Song Lejian Liao Fuzhen Sun Jianguang Du School of informatics Linyi University Linyi China Language Information Processing & Cloud Computing Applications Beijing Institute of Technology Beijing China Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of Technology Beijing China

ISBN: (纸本)9781479932801

Service-oriented computing is a widely adopted paradigm in real applications. Considering the continuous evolution of services, adaptive service composition has always been a major concern. It is a big challenge to adjust the composition to be optimal in real-time. In this paper, a learning automata-based approach is proposed to attack this problem. It consists of two important components: random environment and a learning automaton. The former can be mapped to the service's execution environment. The latter is responsible for the adaptation achievement using reward and penalty functions, while we take the service composition structures into account to compute the usefulness value of all services. At last, simulation study has shown that our approach is efficient to find the optimal (sub-optimal) composition.

关键词： Learning automata Quality of service Web services Adaptation models Automata Conferences Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A multi-channel SSVEP-based brain-computer interface using a canonical correlation analysis in the frequency domain

Advances in Intelligent Systems and Computing

引用

Advances in Intelligent Systems and computing 2014年 215卷 603-616页

作者： Chen, Guang Song, Dandan Liao, Lejian Beijing Eng. Research Center of High Volume Language Inf. Processing and Cloud Computing App. Beijing Lab of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing China

Brain-computer interface (BCI) is a new way for man-machine interaction with wide applications, in which steady-state visual evoked potentials (SSVEP) is a promising option. However, many characteristics of SSVEP show great user variation. So parameter optimization and channel selection for each subject were applied to improve the performance of BCI. These optimizations limit the practical applicability of the SSVEP-based BCI. The use of a canonical correlation analysis (CCA) method for multi-channel SSVEP in the time domain detection showed highly increased detection accuracy, but it is sensitive to the noise when the stimulate frequency is low. In this paper, a method of CCA in the frequency domain is presented for classifying multi-channel SSVEPs. First overlapping average is conducted on the original training signals. Then fast Fourier transform (FFT) is used to transform the signals from time domain to frequency domain to produce the reference data. Finally, according to the correlation coefficients of the new data and the references in the frequency domain, the SSVEP is classified. The experimental results show the enhanced accuracy of our method when applied to low stimulate frequencies. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Brain computer interface

来源：评论

学校读者我要写书评

暂无评论

Self-Adaptive Topic Model： A Solution to the Problem of ＂Rich Topics Get Richer＂

引用

China Communications 2014年第12期11卷 35-43页

作者： FANG Ying School of Computer Science and Technology Beijing Institute of Technology Beijing 100081 R R. China Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Beijing 100081 P. R. China School of computer & technology ShangQiu Normal College ShangQiu HeNan 476000 P. R. China

The problem of "rich topics get richer"(RTGR) is popular to the topic models,which will bring the wrong topic distribution if the distributing process has not been *** standard LDA(Latent Dirichlet Allocation) model,each word in all the documents has the same statistical *** fact,the words have different impact towards different *** the guidance of this thought,we extend ILDA(Infinite LDA) by considering the bias role of words to divide the *** propose a self-adaptive topic model to overcome the RTGR problem *** model proposed in this paper is adapted to three questions:(1) the topic number is changeable with the collection of the documents,which is suitable for the dynamic data;(2) the words have discriminating attributes to topic distribution;(3) a selfadaptive method is used to realize the automatic *** verify our model,we design a topic evolution analysis system which can realize the following functions:the topic classification in each cycle,the topic correlation in the adjacent cycles and the strength calculation of the sub topics in the *** experiment both on NIPS corpus and our self-built news collections showed that the system could meet the given demand,the result was feasible.

关键词： topic model infinite Latent Dirichlet Allocation Dirichlet process topic evolution

来源：评论

学校读者我要写书评

暂无评论

Failure Handling of E-Business Services in an Extensible Constraint Service Model

Failure Handling of E-Business Services in an Extensible Con...

引用

2013 IEEE 4th International Conference on Software Engineering and Service Science

作者： Ruoyu Chen Lejian Liao Zhi Fang Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology

ISBN: (纸本)9781467349994

Failure handling of business transactions is essential in E-Business *** paper extends the service process specification proposed in a contract-centered constraint-based service modelling framework with failure handling *** failure in process model,generalized failure such as QoS violation can be modelled in *** semantics for failure handling in E-Business services as well as policies are discussed via a state transition system.A virtual machine is built for contracting and executing of services under this framework.

关键词： Services service Failure Handling of E-Business Services in an Extensible Constraint Service Model

来源：评论

学校读者我要写书评

暂无评论

Automatic Verification of Data-centric Web Service Specifications

引用

IERI Procedia 2013年 4卷 93-98页

作者： Zhi Fang Lejian Liao Ruoyu Chen Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications School of Computer Science Beijing Institute of TechnologyBeijing 100081 China

Amodel are proposed for modeling data-centric Web services which are powered by relational databases and interact with users according to logical formulas specifying input constraints, control-flow constraints and state/output/action rules. The Linear Temporal First-Order Logic (LTL-FO) formulas over inputs, states, outputs and actions are used to express the properties to be *** have proven that automatic verification of LTL-FO properties of data-centric Web services under input-bounded constraints is decidable by reducing Web services to data-centric Web applications. Thus, we can verify Web service specifications using existing verifier designed for Web applications.

关键词： Web Service Automatic Verification First-Order Linear Temporal Logic

来源：评论

学校读者我要写书评

暂无评论

Effective Fuzzing Based on Dynamic Taint Analysis

Effective Fuzzing Based on Dynamic Taint Analysis

引用

International Conference on Computational Intelligence and Security

作者： Guangcheng Liang Lejian Liao Xin Xu Jianguang Du Guoqiang Li Henglong Zhao Beijing Engineering Research Center of High Volume Language Information Processing & Cloud Computing Applications Beijing Institute of Technology Beijing China DISECC Beijing China

In this paper we present a new vulnerability-targeted black box fuzzing approach to effectively detect errors in the program. Unlike the standard fuzzing techniques that randomly change bytes of the input file, our approach remarkably reduces the fuzzing range by utilizing an efficient dynamic taint analysis technique. It locates the regions of seed files that affect the values used at the hazardous points. Thus it enables to pay more attention to deep errors in the core of the program. Because our approach is directly targeted to the specific potential vulnerabilities, most of the detected errors are with vulnerability signatures. Besides, this approach does not need the information of the input file format in advance. So it is especially appropriate for testing applications with complex and highly structured input file formats. We design and implement a prototype, Taint Fuzz, to realize this approach. The experiments demonstrate that Taint Fuzz can effectively expose more errors with much lower time cost and much smaller number of input samples compared with the standard fuzzer.

关键词： Software Performance analysis Standards Security Instruments Testing Memory management

来源：评论

学校读者我要写书评

暂无评论

Automatic Verification of Data-Centric Web Service Specifications

Automatic Verification of Data-Centric Web Service Specifica...

引用

2013 International Conference on Electronic Engineering and Computer Science(EECS 2013)

Amodel are proposed for modeling data-centric Web services which are powered by relational databases and interact with users according to logical formulas specifying input constraints,control-flow constraints and state/output/action *** Linear Temporal First-Order Logic(LTL-FO) formulas over inputs,states,outputs and actions are used to express the properties to be *** have proven that automatic verification of LTL-FO properties of data-centric Web services under input-bounded constraints is decidable by reducing Web services to data-centric Web ***,we can verify Web service specifications using existing verifier designed for Web applications.

关键词： Web Service Automatic Verification First-Order Linear Temporal Logic

来源：评论

学校读者我要写书评

暂无评论

Design and Optimization of a Big Data computing Framework Based on CPU/GPU Cluster

Design and Optimization of a Big Data Computing Framework Ba...

引用

IEEE International Conference on high Performance computing and Communications (HPCC)

作者： Yanlong Zhai Ying Guo Qiurui Chen Kai Yang Emmanuel Mbarushimana Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Applications Beijing Institute of Technology Beijing China Beijing Simulation Center Beijing China

Big data processing is receiving significant amount of interest as an important technology to reveal the information behind the data, such as trends, characteristics, etc. MapReduce is one of the most popular distributed parallel data processing framework. However, some high-end applications, especially some scientific analyses have both data-intensive and computation intensive features. Therefore, we have designed and implemented a high performance big data process framework called Lit, which leverages the power of Hadoop and GPUs. In this paper, we presented the basic design and architecture of Lit. More importantly, we spent a lot of effort on optimizing the communications between CPU and GPU. Lit integrated GPU with Hadoop to improve the computational power of each node in the cluster. To simplify the parallel programming, Lit provided an annotation based approach to automatically generate CUDA codes from Hadoop codes. Lit hid the complexity of programming on CPU/GPU cluster by providing extended compiler and optimizer. To utilize the simplified programming, scalability and fault tolerance benefits of Hadoop and combine them with the high performance computation power of GPU, Lit extended the Hadoop by applying a GPUClassloader to detect the GPU, generate and compile CUDA codes, and invoke the shared library. For all CPU-GPU co-processing systems, the communication with the GPU is the well-known performance bottleneck. We introduced data flow optimization approach to reduce unnecessary memory copies. Our experimental results show that Lit can achieve an average speedup of 1× to 3× on three typical applications over Hadoop, and the data flow optimization approach for the Lit can achieve about 16% performance gain.

关键词： Graphics processing units Optimization Programming Java Kernel Computer architecture Data processing

来源：评论

学校读者我要写书评

暂无评论

Vertical classification of web pages for structured data extraction

Vertical classification of web pages for structured data ext...

引用

8th Asia information Retrieval Societies Conference, AIRS 2012

作者： Li, Long Song, Dandan Liao, Lejian Beijing Eng. Research Center of High Volume Language Information Processing and Cloud Computing Beijing Lab of Intelligent Information Technology School of Computer Science Beijing Institute of Technology Beijing China

ISBN: (纸本)9783642353406

We propose a general hierarchical vertical classification framework, which can automatically discover the inherent hierarchical structure of relationships among verticals based on flat datasets, and then build a hierarchical classifier. We conducted a set of comparison experiments to verify the performance of it, such as with flat vs hierarchical structure of relationships, as well as among different feature selection and classification methods. Experimental results show that the hierarchical classifiers built on the basis of the proposed framework make big improvements over the flat classifiers when classifying unseen web pages. Among them, the Support Vector Machine using Odds Ratio to select discriminative features performs best. © Springer-Verlag 2012.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：