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

International Conference on Electrical and Control Engineering (ICECE)

作者： Han-Bing Yan Ya-Shu Liu National Computer Network Emergency Response Technical Team/Coordination Center of China National Institute of Network and Information Security Beijing China Department of Computer Science Beijing University of Civil Engineering and Architecture Beijing China

With the development of Internet, Email has become an important interaction manner. At the same time, spam becomes a boring thing in our life, and people pay more and more attention to spam filter. In this paper, we propose a method that uses N-Gram to calculate characters and uses X statistical method to extract characters, and then uses incremental Native Bayes arithmetic to hold up spam. In order to arise accuracy we use the filter method over and over again. The experiments show that our method is very effective, which greatly raises the accurarcy while keeping a minor error ratio.

关键词： Information filters Emergency services Information security Internet Statistical analysis Electronic mail

来源：评论

学校读者我要写书评

暂无评论

BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems

BASIC Codes: Low-Complexity Regenerating Codes for Distribut...

引用

作者： Hou, Hanxu Shum, Kenneth W. Chen, Minghua Li, Hui Shenzhen Key Lab of Information Theory and Future Internet Architecture School of Electronic and Computer Engineering Peking University Shenzhen518055 China Department of Information Engineering Chinese University of Hong Kong Hong Kong Institute of Network Coding Chinese University of Hong Kong Hong Kong

In distributed storage systems, regenerating codes can achieve the optimal tradeoff between storage capacity and repair bandwidth. However, a critical drawback of existing regenerating codes, in general, is the high coding and repair complexity, since the coding and repair processes involve expensive multiplication operations in finite field. In this paper, we present a design framework of regenerating codes, which employ binary addition and bitwise cyclic shift as the elemental operations, named BASIC regenerating codes. The proposed BASIC regenerating codes can be regarded as a concatenated code with the outer code being a binary parity-check code, and the inner code being a regenerating code utilizing the binary parity-check code as the alphabet. We show that the proposed functional-repair BASIC regenerating codes can achieve the fundamental tradeoff curve between the storage and repair bandwidth asymptotically of functional-repair regenerating codes with less computational complexity. Furthermore, we demonstrate that the existing exact-repair product-matrix construction of regenerating codes can be modified to exact-repair BASIC product-matrix regenerating codes with much less encoding, repair, and decoding complexity from the theoretical analysis, and with less encoding time, repair time, and decoding time from the implementation results. © 2016 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Web Service Selection Algorithm Based on Particle Swarm Optimization

Web Service Selection Algorithm Based on Particle Swarm Opti...

引用

IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Hong Xia Yan Chen Zengzhi Li Haichang Gao Yanping Chen Institute of Computer System Architecture and Network Xi'an Jiaotong University Xi'an China Software Engineering Institute Xidian University Xi'an China Department of Computer Science and Technology Xi'an Institute of Post and Telecommunications Xi'an China

A novel multi-objective optimization based particle swarm optimization algorithm is presented to solve the global optimization problem for based services selecting in Web services composition technology. This algorithm takes Web services selection as a multi-objective constrained optimization problem with constraints. It introduces multi-objective PSO intelligent theory to optimize multi parameters simultaneously, and produces a set of constraints to meet the Pareto optimal solution. The experiments show that the algorithm is a feasible and efficient method for Web services selection.

关键词： Web services Particle swarm optimization Quality of service Constraint optimization computer networks Software algorithms Service oriented architecture Linear programming Optimization methods Telecommunication computing

来源：评论

学校读者我要写书评

暂无评论

Multi-Cell Coordinated Scheduling and Power Allocation in Downlink LTE-A Systems

Multi-Cell Coordinated Scheduling and Power Allocation in Do...

引用

IEEE Vehicular Technology Conference

作者： Jian Yu Geoffrey Ye Li Changchuan Yin Suwen Tang Xiaolong Zhu Beijing Key Laboratory of Network System Architecture and Convergence Beijing University of Posts and Telecommunications School of Electrical and Computer Engineering Georgia Institute of Technology Huawei Shanghai Research Institute

ISBN: (纸本)9781479944484

In this paper, we investigate multi-cell coordinated scheduling and power allocation in downlink long term evolution advanced (LTE-A) systems, where orthogonal frequency division multiple-access (OFDMA) is used. The proposed scheme performs joint scheduling, power allocation, and modulation and coding scheme (MCS) selection to maximize the overall weighted throughput with proportional fairness. Our scheme considers the practical constraints in LTE-A systems. Since the optimization problem is a combinatorial and non-convex one and is with high complexity, low-complexity and suboptimal algorithms are proposed, which separate the scheduling and power allocation into two subproblems. Simulation results show that the proposed scheme can improve the average system throughput by 10% and the 10th percentile throughput by 15% compared with the existing scheme.

关键词： Resource management Throughput Interference Signal to noise ratio Indexes Optimization Scheduling

来源：评论

学校读者我要写书评

暂无评论

A routing strategy for metropolis vehicular communications

引用

International Conference on Information networking, ICOIN 2004

作者： Liu, Genping Lee, Bu-Sung Seet, Boon-Chong Foh, Chuan-Heng Wong, Kai-Juan Lee, Keok-Kee Centre for Multimedia and Network Technology School of Computer Engineering Singapore Network Technology Research Centre Research TechnoPlaza Nanyang Technological University 4th Storey Nanyang Avenue 639798 Singapore Institute for Computing Systems Architecture Informatics University of Edinburgh JCMB Mayfield Road EdinburghEH9 3JZ United Kingdom

ISBN: (纸本)3540230343

One of the major issues that affect the performance of mobile ad hoc networks (MANET) is routing. Recently, position-based routing for MANET is found to be a very promising routing strategy for inter-vehicular communication systems (IVCS). However, position-based routing for IVCS in a built-up city environment faces greater challenges because of potentially more uneven distribution of vehicular nodes, constrained mobility, and difficult signal reception due to radio obstacles such as high-rise buildings. This paper proposes a new position-based routing scheme called Anchor-based Street and Traffic Aware Routing (A-STAR), designed specifically for IVCS in a city environment. Unique to A-STAR is the usage of information on city bus routes to identify an anchor path with high connectivity for packet delivery. Along with a new recovery strategy for packets routed to a local maximum, the proposed protocol shows significant performance improvement in a comparative simulation study with other similar routing approaches. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Stars

来源：评论

学校读者我要写书评

暂无评论

Performance of new broadcast forwarding criteria in MANET

引用

International Conference on Information networking, ICOIN 2004

作者： Zhu, Lijuan Lee, Bu-Sung Seet, Boon-Chong Wong, Kai-Juan Liu, Genping Huang, Shell-Ying Lee, Keok-Kee Centre for Multimedia and Network Technology School of Computer Engineering Singapore Network Technology Research Centre Research TechnoPlaza Nanyang Technological University 4th Storey Nanyang Avenue 639798 Singapore Institute for Computing Systems Architecture Informatics University of Edinburgh JCMB Mayfield Road EdinburghEH9 3JZ United Kingdom

ISBN: (纸本)3540230343

In a mobile ad hoc network (MANET), packet broadcast is common and frequently used to disseminate information. Broadcast consume large amount of bandwidth resource, which is scarce in MANET environment. The problem is to find the ideal forward node set so as to minimize the bandwidth consumed, which is a NP-Complete problem. In this paper we will investigate three dominant node approximation algorithms: dominant pruning, total dominant pruning and partial dominant pruning algorithm. An extension to the original algorithms, modified termination criteria, is proposed. Simulation results show that the new termination criteria ensure the same coverage using a reduced number of forward nodes. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Digital Campus Based on LBS and WSN

Design and Implementation of Digital Campus Based on LBS and...

引用

2010 International Conference on computer and Information Application(2010年计算机与信息应用国际会议 ICCIA 2010)

作者： Yunchen Jiang Shanshan Wan Department of Laboratory and Equipment Management Beijing Institute of Technology Beijing. China Computer and Network Department Beijing University of Civil Engineering and Architecture Beijing Ch

Digital campus is one important part to the digital earth and Internet of Things. Based on the analysis of the LBS performance, structure, function and the present research status of digital campus we propose a digital campus design project based on LBS and we discuss the architecture. We take a campus as a simulation implement. Map engine is the tool of implementation of the LBS platform. GIS is used here to give the navigation and the platform is combined and advanced with virtual reality technology such as VRML. Though the platform we achieve a terminal location, map query, three-dimensional browsing, navigation and guides tracking and monitoring, and other functions. The LBS platform improves the work and study efficiency of teachers and students, accelerates the construction and application of digital campus, and provides a new idea for the future development of digital campus system.

关键词： digital campus LBS WSN VRML positioning technology

来源：评论

学校读者我要写书评

暂无评论

Knowledge discovery of decision table based on support vector machine

Knowledge discovery of decision table based on support vecto...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： Ling Wei Jian-Jun Qi Wen-Xiu Zhang Department of Mathematics Northwest University Xi'an China Xi''an Jiaotong University Xi'an China Institute of Computer Architecture & Network Xi''an Jiaotong University Xi'an China

ISBN: (纸本)0780378652

We describe how the support vector machine (SVM) technique can be applied to the knowledge discovery of decision table. In the case of decision rules acquisition, attribute set is reduced and characteristic samples are extracted by using SVM, and decision rules are then acquired based on a smaller number of support samples which could represent all samples. As a result, rules acquisition becomes faster and easier. In the case of class forecast, the samples of decision table are classified by using SVM, and a simple decision function is obtained. This decision function could forecast the sample's class and act as decision rules. It is another kind of knowledge expression. Experiments indicate that our method is simple and feasible, while it performs faster. Results also show that it has better performance for large decision table.

关键词： Support vector machines Support vector machine classification Spatial databases Information systems Mathematics computer architecture Electronic mail Mathematical model Predictive models Neural networks

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm 29

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Zeng, Yan Huang, Chengchuang Ni, Yijie Zhou, Chunbao Zhang, Jilin Wang, Jue Zhou, Mingyao Xue, Meiting Zhang, Yunquan Hangzhou Dianzi University School of Computer Science and Technology Hangzhou310018 China Ministry of Education Key Laboratory for Modeling and Simulation of Complex Systems Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China Hangzhou Dianzi University School of ITMO Joint Institute Hangzhou310018 China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing100086 China HuaWei China Institute of Computing Technology of the Chinese Academy of Sciences State Key Laboratory of Computer Architecture Beijing100086 China

ISBN: (纸本)9798350330717

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network's dataflow graph and device cluster's topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method. © 2023 IEEE.

关键词： Auto-Parallel Distributed machine learning Genetic algorithm Integer linear programming Model parallelism

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis for Dispensing Mechanism of Active Code

引用

International Journal of Plant Engineering and Management 2003年第1期8卷 28-34页

作者： WANG Jian-guo LI Zeng-zhi KOU Yan-an Department of Computer Science and Engineering Xi'an Institute of TechnologyXi'an 710032P.R.China Institute of Computer Architecture&Network Xi'an Jiaotong UniversityXi'an 710049P.R.China Air Force Engineering University Xi'an 710038P.R.China

The dispensing mechanism of active code is a key technology in an active network. Conventional capsule and programmable switch approaches have their own shortcomings. The DCCAN(distributed code caching for active network) mechanism presented in this paper overcomes these shortcomings. In this paper, capsule and programmable switch approaches are introduced, and their shortcomings are analyzed. The principle of the DCCAN mechanism is described. The theory analysis in transmit width based on the DCCAN mechanism and capsule approach are described. The theory analysis shows that the DCCAN mechanism has many good characteristics and can improve the efficiency of an active network. Key factors which affect the transmit width based on the DCCAN mechanism are discussed. The using condition of the DCCAN mechanism is also discussed.

关键词： DCCAN active code capsule programmable switch transmit width

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：