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

2011 8th International Conference on Fuzzy systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Jan, Sadaqat Li, Maozhen Al-Sultany, Ghaidaa Al-Raweshidy, Hamed School of Engineering and Design Brunel University Uxbridge Middlesex UB8 3PH United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University China

ISBN: (纸本)9781612841816

Recent advances in mobile technologies have emerged new challenges for researchers. File management and retrieval on resource-limited devices has become a challenging problem as these devices are now equipped with larger storage capacities. This paper presents an overview about the possibilities of implementing Semantic Web Technologies in order to facilitate the file retrieval on resource-limited devices. We have proposed a semantic based file retrieval framework which utilizes a generic ontology in file search process. The search module is implemented in Java ME platforms as a case study. Performance of the proposed search module is evaluated through experimental tests along with probabilistic evaluations. The implemented module not only automates file retrieval process but also shows significant improvement in file retrieval efficiency by utilizing the knowledge of employed ontology in the search module. © 2011 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

A New MPI Parallel computing Environment Based on Fibre-channel Token-Routing Network for Materials Simulation Research

A New MPI Parallel Computing Environment Based on Fibre-chan...

引用

2011 International Conference on Advanced Materials in Microwaves and Optics（AMMO 2011）

作者： Xiaohui ZENG Dongsheng LIU Wenlang LUO Lixin FU school of Electronics and Information Engineering Jinggangshan University The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

In order to apply our high efficiency fibre-channel token-routing network(shortened as FC-TR network) to the field of materials simulation research, a new MPI parallel computing environment is proposed and designed, and independently developed a parallel programming environment FC-TR-MPI based on FC-TR network. In FC-TR-MPI, a new method was applied to point-to-point communication that the network communications between processes in the same computing node were changed into memory operations;moreover, according to the underlying software and hardware features of FC-TR network, new algorithms were proposed to optimize the communication performance of some collective communications. Experimental results show that, compared with Sca MPI parallel programming environment, FC-TR-MPI has a higher parallel efficiency and speedup.

关键词： MPI,parallel computing environment,fibre-channel,materials simulation

来源：评论

学校读者我要写书评

暂无评论

Multi-label Learning for Protein Subcellular Location Prediction

Multi-label Learning for Protein Subcellular Location Predic...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xiao Wang Guo-Zheng Li Jia-Ming Liu Rui-Wei Zhao The Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Control Science and Engineering Tongji University Shanghai China

Protein subcellular localization aims at predicting the location of a protein within a cell using computational methods. Knowledge of subcellular localization of proteins indicates protein functions and helps in identifying drug targets. Prediction of protein subcellular localization is an important but challenging problem, particularly when proteins may simultaneously exist at, or move between, two or more different subcellular location sites. Most of the existing protein subcellular localization methods are only used to deal with the single-location proteins. To better reflect the characteristics of multiplex proteins, we formulate prediction of subcellular localization of multiplex proteins as a multi-label learning problem. We present and compare two multi-label learning approaches, which exploit correlations between labels and leverage label-specific features, respectively, to induce a high quality prediction model. Experimental results on six protein data sets under various organisms show that our described methods achieve significantly higher performance than any of the existing methods. Among the different multi-label learning methods, we find that methods exploiting label correlations performs better than those leveraging label-specific features.

关键词： Proteins Correlation Protein engineering Multiplexing Machine learning Humans Learning systems

来源：评论

学校读者我要写书评

暂无评论

Designing and Analysis of a New Book-Lending system Based on Logic Petri Nets

Designing and Analysis of a New Book-Lending System Based on...

引用

International Conference on Electric Information and Control Engineering

作者： Xia Jiang WenJing Luan Department of Computer Laiwu Vocational and Technical College The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University

A new book-lending system is designed and analyzed based on logic Petri nets in this paper. The batch processing function and indeterminacy of readers are included in the system. Its logic Petri net model is establish... 详细信息

ISBN: (纸本)9781424480364

关键词： Book-lending system Batch processing Designing Verification Logic Petri net

来源：评论

学校读者我要写书评

暂无评论

Research on a Remote Network Monitoring Model for Large-scale Materials Manufacturing

Research on a Remote Network Monitoring Model for Large-scal...

引用

2011 International Conference on Advanced Materials and Computer Science(ICAMCS 2011)

作者： Xiaohui ZENG Manhua LI Wenlang LUO Department of Computer Science and Technology Jinggangshan University The Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji University

A remote network monitoring model for large-scale materials manufacturing is proposed, including five modules: center control module, data collection and fault alarm module, graph drawing module and data storage module. The center control module not only interacts with users, but also controls the other four modules to work together in harmony. According to this monitoring model, a remote network monitoring platform is designed and realized. The user can interact with the control center module through an Internet browser, and the information about the monitored manufacturing machines and devices can be displayed by means of text, chart, graphic and sound, etc. Moreover, the details about the problems or faults from the monitored objects can be obtained in time. The experimental results indicate that the network monitoring platform can accurately get the information of the monitored objects, and users can conveniently get the online running state of those monitored objects.

关键词： remote network monitoring data storage fault alarm materials manufacturing

来源：评论

学校读者我要写书评

暂无评论

SelectCast: Scalable data aggregation scheme in wireless sensor networks

SelectCast: Scalable data aggregation scheme in wireless sen...

引用

IEEE INFOCOM 2011

作者： Wang, Cheng Tang, Shaojie Li, Xiang-Yang Jiang, Changjun Department of Computer Science Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL 60616 United States TNLIST School of Software Tsinghua University China

ISBN: (纸本)9781424499212

In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable. © 2011 IEEE.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

An algorithm for generating home states of Petri nets

引用

Journal of Computational Information systems 2011年第12期7卷 4225-4232页

作者： Wang, Pengwei Ding, Zhijun Chai, Hua Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai 200092 China Department of Computer Science and Technology Tongji University Shanghai 201804 China

Home states are ground markings which can be reached from any other reachable markings of a Petri net. The existence of home states is a strong property, and it is not only of important theoretical research meaning, but also of great practical value. This paper presents an algorithm for generating home states. For any bounded Petri net, the algorithm can judge whether it contains home states or not, and obtain the set of all its home states. The correctness of the algorithm is proved, and its complexity is analyzed, the result shows that it is a polynomial-time algorithm, so it is effective. Meanwhile, we implemented the algorithm in the popular Petri net tool PIPE2, which can be used for experimental purposes. Then a number of conclusions about the relationships between home state and deadlock are given, which bring great convenience to judge deadlock and exert control pointedly. Copyright © 2011 Binary Information Press.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

Block diagonal precoding based power allocation for coordinated multi-point transmission

引用

Journal of Communications 2011年第7期6卷 524-528页

作者： Han, Jing Wang, Ping Liu, Fuqiang Zhu, Yin Broadband Wireless Communications and Multimedia Laboratory Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai China Shanghai Key Laboratory of Digital Media Processing and Transmission Shanghai China

This paper studies power allocation in coordinated multi-point (CoMP) transmission of 3GPP LTE-Advanced system with remote radio units(RRUs) power constraints. We apply block diagonal (BD) precoding to downlink transmission, and assume perfect knowledge of downlink channels and transmit messages at each transmit point. We propose a modified water-filling power (MWF) allocation algorithm in order to maximize the downlink sum capacity, at the same time the low complexity is achieved. The interior-point method is also used to solve the optimization problem. Simulations show that interior-point method converges after only a few iterative steps and the system capacity is near-optimal. As for complexity and power efficiency, MWF achieves a good compromise. © 2011 ACADEMY PUBLISHER.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Capacity and delay in mobile cognitive networks with random way-point mobility model

引用

AEU - International Journal of Electronics and Communications 2011年第4期65卷 288-295页

作者： Xingzhen Bai Shu Li Changjun Jiang Juan Xu Cheng Wang Lina Han The Key Laboratory of Embedded System and Service Computing Ministry of Education Tongji University Shanghai 200092 China College of Information & Electrical Engineering Shandong University of Science & Technology Qingdao 266510China

We study the throughput and delay scaling laws of the mobile cognitive network. There are n primary users and m secondary users in the primary network and the secondary network, respectively. They are distributed uniformly and independently on the surface of a unit torus, moving according to the random way-point mobility model (RWMM). The primary users have priority to access the spectrum, and do not alter their protocol in the presence of the secondary network. The secondary users opportunistically use the licensed spectrum when it remains unused. Under the improved 2-hop relay policy, we derive the constant throughput of Θ ( 1 ) per primary source–destination (S–D) pair when the radius of the preservation region r p = Θ ( 1 / m ) . The expected delay scales as Θ ( n / v ( n ) ) , where v ( n ) is the average speed of the primary nodes. Moreover, if the secondary network is denser than the primary network, i.e., m = n γ with γ > 1 , the constant throughput of Θ ( 1 ) per secondary S–D pair and the expected delay of Θ ( m / v ( m ) ) can be derived surprisingly when the radius of the avoidance region r s = Θ ( 1 / n ) and r p = Θ ( 1 / m ) , where v ( m ) is the average speed of the secondary nodes.

关键词： Throughput Delay Scaling law Cognitive networks Mobility

来源：评论

学校读者我要写书评

暂无评论

A novel discrete particle swarm optimization algorithm for meta-task assignment in heterogeneous computing systems

引用

Microprocessors and Microsystems 2011年第1期35卷 10-17页

作者： Qinma Kang Hong He The Key Laboratory of “Embedded System and Service Computing” Ministry of Education Tongji University Shanghai 201804 PR China School of Information Engineering Shandong University at Weihai Weihai 264209 PR China

Optimal assignment of a meta-task in heterogeneous computing systems is NP-complete in the general case. Therefore, heuristic approaches must be employed to find good solutions within a reasonable time. We propose a novel discrete particle swarm optimization (DPSO) algorithm for this problem. Firstly, to make particle swarm optimization algorithm more suitable for solving task assignment problems, particles are represented as integer vectors and a new position update method is developed based on discrete domain. Secondly, an effective variable neighborhood descent algorithm is applied to emphasize exploitation. In addition, migration mechanism is introduced with the hope to escape from possible local optimum and to balance the exploration and exploitation. Computational simulations and comparisons based on a set of benchmark instances indicate that the proposed DPSO algorithm is a viable approach for the task assignment problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：