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

International Conference on computer Supported Cooperative Work in Design

作者： Peiying Hou Dandan Wang Xiaoping Li School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration South East University Nanjing China

In this paper, Harmony Search is applied to the blocking job shop problem with makespan minimization. According to the characteristics of the considered problem, a decoding method is introduced to generate feasible solutions. A rule is proposed to improvise new harmonies. Some approaches are developed to determine the harmony search considering rate, the pitch adjusting rate, the dynamic harmony memory. A local search is investigated to further improve quality of the solutions. Results of numerical experiments on classical benchmark instances show that the proposed algorithm can improve makespan 16.50% on average.

关键词： Educational institutions

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time

A hybrid genetic algorithm for resource-constrained multi-pr...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Zhicheng Cai Xiaoping Li School of Computer Science & Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing PR China

The RCMPSPTT (resource-constrained multi-project scheduling problem with resource transfer time) problem usually exists in distributed collaborative manufacturing systems, in which scarce resources are shared by different projects dispersed in distributed physical places. Resources are needed to be transferred among different projects with non-neglectable time. In this paper, a hybrid genetic algorithm is proposed for the considered problem. Besides standard operators, EPS (Elite population based dual Population Structure) and VNS (Variable Neighborhood Search) operators are introduced for both diversification and intensification consideration to improve effectiveness. The EPS keeps the elite solutions found during the search and they are updated using a similarity strategy. The VNS generates new solutions by a proposed local search strategy. Experiments show that 26.1% has been improved on solutions by DGAVNS compared with an existing priority rule based heuristic algorithm.

关键词： Genetic algorithms Biological cells Sociology Statistics Schedules Search problems Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Hierarchical text classification for news articles based-on named entities

Hierarchical text classification for news articles based-on ...

引用

8th International Conference on Advanced Data Mining and Applications, ADMA 2012

作者： Gui, Yaocheng Gao, Zhiqiang Li, Renyong Yang, Xin Institute of Web Science School of Computer Science and Engineering Southeast University Nanjing 211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing 211189 China Focus Technology Co. Ltd. Nanjing 210061 China

ISBN: (纸本)9783642355264

There exist a range of hierarchical text classification approaches that classify text documents into a pre-constructed hierarchy of categories. In these approaches, feature selections are often based on terms (words or phrases), which are unsuitable for hierarchically classifying news articles. Named entities are informative features in news articles which have not been studied seriously in previous hierarchical text classification approaches. This paper utilizes named entities as features for classifying news articles into a pre-constructed hierarchy about international relations. The feature selection is implemented based on named entities associated with local categories. Documents are then represented by the selected features using two types of models, which are Boolean model and Vector model. We train SVMs corresponding to both types of models based-on local information. The experimental results show that the use of named entities improves the performance of hierarchical text classification for news articles. © Springer-Verlag 2012.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

An optimal stopping strategy for opportunistic broadcast channel access

An optimal stopping strategy for opportunistic broadcast cha...

引用

IEEE International Conference on Communications (ICC)

作者： Shun Cai Sanfeng Zhang Yongqiang Dong Guoxin Wu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education South East University Nanjing China

Opportunistic routing with network coding (NCOR) has recently emerged as a promising unicast paradigm in lossy wireless multihop networks. By combining the multi-user diversity advantage of the broadcast links and the erasure-codes property of random network coding, it raises an interesting question on the broadcast channel access control algorithm, since the reliability is guaranteed by upper-layer coding and thus it is not necessary to wait for all the receivers to be ready. In this paper, we formalize it as the opportunistic broadcast channel access control problem. By appealing to the theory of optimal stopping, we develop a strategy which can balance between the access delay and instantaneous delivery ability of the broadcast link. This strategy turns out to be a threshold-based policy, which allowing fully distributed implementation. Simulation results show that the proposed strategy outperforms existing schemes significantly in terms of end to end throughput under various traffic loads.

关键词： Receivers IEEE 802.11 Standards Throughput Media Access Protocol Probes Routing

来源：评论

学校读者我要写书评

暂无评论

Estimation Packet Loss Ratios for the Two Segments of End-to-End Path on the Monitor

Estimation Packet Loss Ratios for the Two Segments of End-to...

引用

International Conference on computer Science and Service System (CSSS)

作者： Guang Cheng Zhongyao Gao School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China

ISBN: (纸本)9781467307215

Packet loss may cause the degradation of network and application performance. This paper proposes a passive measurement method called LTS to estimate end-to-end path packet loss ratio for the two segments of the path divided by the monitor node. This method can estimate the packet loss ration of each segment and infer loss ratios based on IP headers identification field, TCP headers sequence number and packets interval. The segment estimation packet loss method can be useful to evaluate the performance of core network or internet work if the monitor is put in the border of a network. The algorithm is evaluated to use a test bed simulation measurement, and is analyzed reordering ratios and loss ratios based on the traces collected from the CERNET backbone links.

关键词： Time measurement IP networks Accuracy Monitoring

来源：评论

学校读者我要写书评

暂无评论

A memory and variable neighborhood structure based complete local search for the no-wait job shop problem

A memory and variable neighborhood structure based complete ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Minmin Li Jie Zhu Xiaoping Li Key Laboratory of Computer Network and Information Integration of Ministry of Education School of Computer Science and Engineering South East University Nanjing China

In this paper, an effective metaheuristic is developed for the no-wait job shop problem with the objective of makespam minimization, which is strongly NP-hard. The problem is usually decomposed into a sequencing sub-problem and a timetabling one. A partial delay timetabling method is constructed by combining the "as early as possible" strategy with the "as late as possible" rule. By integratiiig the variable neighborhood structure, a new Local Search method CLMVN (Complete Local Search with Memory and Variable Neighborhood structure) is presented for the sequencing problem. Experimental results show that CLMVN outperforms CLLM (the best algorithm for the considered problem so far) on average with less computation time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Estimating the number of active flows from sampled packets

Estimating the number of active flows from sampled packets

引用

IEEE Symposium on network Operations and Management

作者： Guang Cheng School of Computer Science and Engineering South East University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China

A flow is active during a measurement period if it sends at least one packet. It is essential to control resource consumption in network monitoring by traffic sampling, so most high-end routers provide sampling network traffic function. The number of original flow is an important metrics to many network applications such as congestion control and network security. In this paper, we present a EUF algorithm that can accurately infer the number of original flow from the sampled packet traffic. Using the EUF algorithm, the number of unsampled flows can be estimated by an iteration method based on random sampling, and then the number of original flows can be precisely estimated according to both the number of the sampled flows and the unsampled flow. The EUF algorithm is also compared with the EM algorithm using multiple traffic traces collected from a Tier-1 ISP backbone networks. The result shows that the EUF algorithm is superior to EM and can provide highly accurate estimation on the number of the original flow.

关键词： Estimation IP networks Computational complexity Algorithm design and analysis Educational institutions Monitoring Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Filter-Based information Selection Mechanism in Publish/Subscribe Middleware

Filter-Based Information Selection Mechanism in Publish/Subs...

引用

2012 3rd International Conference on information Technology for Manufacturing Systems(ITMS 2012)

作者： Jigang Xiao Yunqing Chen Zhuowei Shen Systems Engineering Research Institute China State Shipbuilding Corporation Key Lab of Computer Network and Information Integration MOE School of Computer Science and Engineering Southeast University

Publish/Subscribe middleware is getting more and more attentions for its feature of loose *** some scenarios,Subscribersof a topic need not all the information belonging to that topic, but only those of interest. To fulfill this requirement,some kind of information selection mechanism is needed. In this paper, a filter-based information selection mechanism is proposed, which is compliant with OMG DDS specification. Then it is implemented in a publish/subscribe middleware prototype *** the mechanism, a publish/subscribe middleware can use the compiler generated by Flex&Bison to compile the filtering rules of the users,which are conform to SQL-like syntax,and generate the filtering syntax *** the subscriber side, when receiving a sample, the middleware substitute the values of the sample into the corresponding positions in the filtering syntax tree. By traversing the tree, the middleware makes the filtering decision. Experiment results reveal that the proposed mechanism is effective.

关键词： information Filtering Publish/Subscribe middleware Data Distribution Service Filter

来源：评论

学校读者我要写书评

暂无评论

Semantic access control for cloud computing based on e-Healthcare

Semantic access control for cloud computing based on e-Healt...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Lili Sun Hua Wang Jianming Yong Guoxin Wu Centre for Systems Biology University of Southern Queensland Toowoomba Australia School of Information Systems University of Southern Queensland Toowoomba Australia School of Computer Science and Engineering & Key Laboratory for Computer Network and Information Integration Southeast Univeristy

With the increased development of cloud computing, access control policies have become an important issue in the security filed of cloud computing. Semantic web is the extension of current Web which aims at automation, integration and reuse of data among different web applications such as clouding computing. However, Semantic web applications pose some new requirements for security mechanisms especially in the access control models. In this paper, we analyse existing access control methods and present a semantic based access control model which considers semantic relations among different entities in cloud computing environment. We have enriched the research for semantic web technology with role-based access control that is able to be applied in the field of medical information system or e-Healthcare system. This work demonstrates how the semantic web technology provides efficient solutions for the management of complex and distributed data in heterogeneous systems, and it can be used in the medical information systems as well.

关键词： Computational modeling Educational institutions Clouds Security Medical services Australia Temperature control

来源：评论

学校读者我要写书评

暂无评论

Restrictive mechanism of flow control among non-cooperative Internet users

引用

Science China(information Sciences) 2011年第1期54卷 12-22页

作者： TAO Jun1,2,ZHONG Xiao1,2 & LU YiFei1,2 1key Laboratory of computer network and information integration,Southeast University, Ministry of Education,Nanjing 210096,China 2School of computer Science and Engineering,Southeast University,Nanjing 210096,China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China School of Computer Science and Engineering Southeast University Nanjing China

The flow and congestion control methods based on one-shot game model with non-cooperative game theory can explain the non-cooperative behavior of Internet ***,the low effciency of equilibrium solutions affects their *** the behavior of flow and congestion control based on infinitely repeated game models is addressed;the repeated and infinitely repeated flow and congestion control game model is presented; the existence and optimization of the Nash equilibrium point are proved;the discount factor in repeated game is discussed;the punishment and threat strategy to users'misbehavior is studied in N-users infinitely flow control game;the punishment restrictive method of users'behavior is designed in infinitely and finitely games;finally,a flow control algorithm based on repeated game,FCAR,is provided based on the conclusions of repeated game *** results of experiment and simulation show that FCAR algorithm could regularize and restrict users' misbehavior *** algorithm can also make non-cooperative Internet users achieve cooperation in order to optimize the utility of the whole flow and congestion control system.

关键词： Nash equilibrium utility infinitely and finitely repeated game flow and congestion control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：