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

2014 International Conference on Multisensor Fusion and information Integration for Intelligent systems, MFI 2014

作者： Ma, Hengtai Yi, Xiaowei Wu, Xiaohui Gu, Dingfeng Pan, Hui Zheng, Changwen Sci. and Tech. on Integrated Information System Lab Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Information Security Institute of Info. Engineering Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781479967322

information hiding based on error correcting code is one of the difficulties in information hiding research. Current information hiding algorithms cannot confirm the upper bound of covert channel capacity when channels are interfered. In this paper, a capacity self-adaption information hiding algorithm based on RS code is proposed to solve this problem. Firstly, Channel covert communication model is designed to describe the realization of information hiding algorithms based on the m-sequence. Secondly, the upper bound of embedding capacity of secret information based on block code and RS code is separately analyzed in theory. Thirdly, simulation verification is implemented under the supposed channel environment. Experimental results demonstrated that experimental values are consistent with the theoretical values, and in terms of the embedding rate, the performance of the RS code is better than the performance of recurrent code and block code. © 2014 IEEE.

关键词： Channel capacity

来源：评论

学校读者我要写书评

暂无评论

Statistical method of improving efficiency on sequential patterns

引用

Jisuanji Gongcheng/Computer engineering 2005年第16期31卷 69-70+91页

作者： Lu, Shen Li, Chunping Lab. of Information System and Engineering Tsinghua University Beijing 100084 China School of Software Tsinghua University Beijing 100084 China

This paper analyzes some features of discovering frequent patterns on large set of transactions. On this basis, it gives an improved algorithm (called AprioriAdjust) with the development of two techniques: (1) applying the compressive processing of the transaction set for mining sequential patterns;(2) presenting a method based on the statistical mechanism to evaluate the sequence's support, in which the convergence of average value of the support in the whole procedure is considered, so as to effectively prune the candidate set of the frequent patterns. Furthermore, it discusses the results of the experiments. Compared to the AprioriTID algorithm, it shows that the AprioriAdjust algorithm is more efficient and scalable over the large sets of transactions.

关键词： Data mining Largest frequent item set Sequential pattern mining Statistical model

来源：评论

学校读者我要写书评

暂无评论

Towards energy-fairness in asynchronous duty-cycling sensor networks

Towards energy-fairness in asynchronous duty-cycling sensor ...

引用

IEEE Conference on Computer Communications, INFOCOM 2012

作者： Li, Zhenjiang Mo, Li Liu, Yunhao School of Computer Engineering Nanyang Technological University Singapore Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong MOE Key Lab. for Information System Security School of Software Tsinghua University China

ISBN: (纸本)9781467307758

In this paper, we investigate the problem of controlling node sleep intervals so as to achieve the min-max energy fairness in asynchronous duty-cycling sensor networks. We propose a mathematical model to describe the energy efficiency of such networks and observe that traditional sleep interval setting strategy, i.e., operating sensor nodes with identical sleep intervals, or intuitive control heuristics, i.e., greedily increasing sleep intervals of sensor nodes with high energy consumption rates, hardly perform well in practice. There is an urgent need to develop an efficient sleep interval control strategy for achieving fair and high energy efficiency. To this end, we theoretically formulate the Sleep Interval Control (SIC) problem and find it a convex optimization problem. By utilizing the convex property, we decompose the original problem and propose a distributed algorithm, called GDSIC. In GDSIC, sensor nodes can tune sleep intervals through a local information exchange such that the maximum energy consumption rate in the network approaches to be minimized. The algorithm is self-adjustable to the traffic load variance and is able to serve as a unified framework for a variety of asynchronous duty-cycling MAC protocols. We implement our approach in a prototype system and test its feasibility and applicability on a 50-node testbed. We further conduct extensive trace-driven simulations to examine the efficiency and scalability of our algorithm with various settings. © 2012 IEEE.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A Study of Two Types of Introductory Exercise Problems for Network Programming Learning with Python 23

A Study of Two Types of Introductory Exercise Problems for N...

引用

11th International Conference on Computer and Communications Management, ICCCM 2023

作者： Lu, Xiqin Funabiki, Nobuo Ueda, Kiyoshi Kao, Wen-Chung Department of Information and Communication Systems Distributed System Design Lab. Okayama University Okayama Japan Department of Computer Science Control Software Lab. Nihon University Koriyama Japan Department of Electrical Engineering National Taiwan Normal University Taipei Taiwan

ISBN: (纸本)9798400707735

Network programming is the act of writing computer codes for communications between programs or processes in different computers across networks. It is crucial for applications and services using networks, including e-commerce, gaming, and social media. However, university courses of educating it are very limited. As a result, it has become important to develop and offer IT tools to support self-studies of network programming by novices. In this paper, we present a study of two types of introductory exercise problems, namely, Grammar-concept Understanding Problem (GUP) and Comment Insertion Problem (CIP), for self-studies of five basic network protocols of TCP/IP, ARP, SMTP, POP3, and SSH with Python. A GUP instance requests to answer the keyword such as a library function in the given source code that corresponds to the grammar concept described in the question. A CIP instance requests to insert the comment at each blank of the code. String matching is adopted to mark any answer at the browser-based answer interface. Through solving them, it is expected to understand the meaning of important words and the code structure for network programming. As preliminary evaluations, we generated six GUP and CIP instances respectively, and assigned them to 10 students in Okayama University, Japan. The results confirmed that the proposal is proper for novices to learn network programming with Python. © 2023 ACM.

关键词： Python

来源：评论

学校读者我要写书评

暂无评论

A collaborative method for business process oriented requirements acquisition and refining

A collaborative method for business process oriented require...

引用

2014 International Conference on software and systems Process, ICSSP 2014

作者： Lai, Han Peng, Rong Ni, Yuze State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Chongqing Key Lab. of Electronic Commerce and Supply Chain System Chongqing Technology and Business University Chongqing China School of Computer Science and Information Engineering Chongqing Technology and Business University Chongqing China

ISBN: (纸本)9781450327541

Requirements Elicitation (RE) is a critical process in system/software engineering. Its goal is to capture the stakeholders expectations, needs and constraints, which can be elicited, analyzed and specified as requirements. Gathering the requirements correctly, clearly and completely in a natural way is a typical challenging problem, because requirements analysts always play key roles in the elicitation process dominantly while stakeholders participate in passively. In this paper, we propose a collective intelligence driven business process oriented requirements acquisition and refining method. Its aim is to reduce the requirements analysts dominance and promote stakeholders self-expression and self-improvement to elicit requirements clearly and completely. It adopts the group storytelling method to promote the collaboration and communication among stakeholders, utilizes the narrative network model to enhance the associations among story fragments, and introduces dialogue game theory to guide the progressive refining. At the same time, the activity theory is adopted as the description framework to present the method and an application example is introduced. Finally, a pilot experiment is carried out to evaluate its perceived usefulness and perceived ease of use;and the actual quality of the requirements based on the degree of completeness and understandability in comparison with JAD. The results show that the requirements elicited by BPCRAR are more complete and understandable than JAD. In addition, the BPCRAR is perceived usefulness and ease of use in the experiment. © 2014 ACM.

关键词： Refining

来源：评论

学校读者我要写书评

暂无评论

Evaluating the BPCRAR Method: A Collaborative Method for Business Process Oriented Requirements Acquisition and Refining

Evaluating the BPCRAR Method: A Collaborative Method for Bus...

引用

1st Asia Pacific Requirements engineering Symposium, APRES 2014

ISBN: (纸本)9783662436097

The goal of requirements elicitation is to understand the stakeholders' needs and constraints, and form the system requirements. But gathering requirements correctly, completely and understandably in a natural way is a great challenge to traditional methods, for requirements analysts always play key roles in the elicitation process dominantly while stakeholders participate in passively. Therefore, strategies that help the identification of requirements based on reducing the requirements analysts' dominance and promoting stake-holders' self-expression and self-improvement are welcomed. This paper reports a controlled experiment to evaluate the Business Process oriented Collaborative Requirements Acquisition and Refining (BPCRAR) method. Compared to JAD, the statistical results show that the requirements elicited by BPCRAR are more complete and understandable. Besides that, the perceived usefulness, ease to learn, and ease of use of BPCRAR are all confirmed by the statistical data got from the questionnaire to the participants. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Refining

来源：评论

学校读者我要写书评

暂无评论

pService: Towards similarity search on peer-to-peer web services discovery

pService: Towards similarity search on peer-to-peer web serv...

引用

1st International Conference on Advances in P2P systems, AP2PS 2009

作者： Zhou, Gang Yu, Jianjun National Digital Switching System Engineering and Technological Research Center 450002 France State Key Lab. of Software Development Environment Beihang University 100191 China Computer Network Information Center Chinese Academy of Sciences 100190 China

ISBN: (纸本)9780769538310

We present the design of pService system for P2P Web services discovery supporting similarity earch with its locality-preserving feature based on modified Skip Graph. In pService, the most important property (e.g. service name) of a service is viewed as the indexing key of a peer node. The other properties are extracted as multiattributes which would be mapped into one-dimensional indices using HSFC (Hilbert Space Filling Curve), and assigned to membership vector of the peer node. These two features help to support similarity search in two aspects: peer nodes with similar indexing keys would be distributed neighborly, peer nodes with similar indices will connect to each other through routing table. Our evaluation showed that the pService performs considerable Web services discovery efficiency. © 2009 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

BD-LZW picture compression algorithm for WSN system

BD-LZW picture compression algorithm for WSN system

引用

2008 3rd International Conference on Pervasive Computing and Applications, ICPCA08

作者： Jinlan, Zhan Qingguo, Zhou Shuwei, Bai Li, Cuihual Bin, Hu Li, Lian Department of Computer Science Video and Image Processing Lab Xiamen University China Engineering Research Center of Open Source Software and Real-time System Ministry of Education Department of Information Science and Engineering Lanzhou University China Department of Computing University of Central England United Kingdom

ISBN: (纸本)9781424420209

In the paper, a new parallel LZW-Like algorithm, bidirectory LZW algorithm (BD-LZW) will be interpreted The new algorithm can be used in data compression/decompression system which runs on multi-microprocessor system, such as CELL, which the algorithm will be implemented on. Different from the conventional parallel LZW algorithm with one input directory, BD-LZW algorithm allows two threads reading characters from two ends of string. By this method, the data can be partitioned for compression/decompression loading between two threads fairly and easily. The most important is the compression performance can be improved by the new algorithm. Comparing running time, it's lower 10% than conventional parallel LZW (P-LZW) algorithm when there are two threads running on CELL architecture. © 2008 IEEE.

关键词： Compression algorithms Wireless sensor networks Yarn Partitioning algorithms Image coding Data compression Video compression Image processing Computer science Open source software

来源：评论

学校读者我要写书评

暂无评论

Tumor gene expressive data classification based on locally linear representation Fisher criterion

Tumor gene expressive data classification based on locally l...

引用

9th International Conference on Intelligent Computing, ICIC 2013

作者： Li, Bo Tian, Bei-Bei Liu, Jin School of Computer Science and Technology Wuhan University of Science and Technology 430081 Wuhan China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan China State Key Lab. of Software Engineering Wuhan China

ISBN: (纸本)9783642394812

In this paper, a discriminant manifold learning method based on Locally Linear Embedding (LLE), which is named Locally Linear Representation Fisher Criterion (LLRFC), is proposed for the classification of tumor gene expressive data. In the proposed LLRFC, an inter-class graph and intra-class graph is constructed based on the class information of tumor gene expressive data, where the weights between nodes in both graph are optimized using locally linear representation trick. Moreover, a Fisher criterion is modeled to maximize the inter-class scatter and minimize the intra-class scatter simultaneously. Experiments on some benchmark tumor gene expressive data validate its efficiency. © 2013 Springer-Verlag.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

The research of g-mixing and g-equicontinuity on the hyperspace of topological group action 12

The research of g-mixing and g-equicontinuity on the hypersp...

引用

12th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2020

作者： Zhan-Jiang, Ji Wei, Shi School of Information and Electronic Engineering Wuzhou University China Guangxi Colleges and Universities Key Lab. of Image Processing and Intelligent Information System Wuzhou University China Guangxi Colleges and Universities Key Laboratory of Professional Software Technology Wuzhou University China Party Committee Office Wuzhou Vocational College China

ISBN: (纸本)9781728170817

G-mixing and G-equicontinuity have an important significance in terms of theory and application. According to the definition of mixing and equicontinuity, we give the concept of G-mixing and G-equicontinuity in this paper. By inference, some conclusions of the hyperspace were extended to the hyperspace of topological group action. We have the following result: (1)Letbe the hyperspace ofandbe a pseudo equivariant map. All non-empty open set are invariable for. Ifis a G-mixing map, thenis a G-mixing map;(2)Letbe the hyperspace of andbe a equivariant map. Thenis a G-mild mixing map if and only ifis a G-mild mixing map;(3)Letbe the hyperspace ofandbe a equivariant map. Thenis a G-equicontinuity map if and only ifis a G-equicontinuity map. These results enriched the theory of the G-mixing and G-equicontinuity on the hyperspace of topological group action. © 2020 IEEE.

关键词： Mixing

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：