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

Asia-Pacific Signal and information Processing Association Annual Summit and Conference (APSIPA)

作者： Wencheng Wang Liming Yang Dongxu Wang State Key Laboratory of Computer Science Institute of Software CAS Beijing China College of Information Engineering Xiangtan University Xiangtan China

ISBN: (纸本)9781467348638

Canonical views are referred to the classical three-quarter views of a 3D object, always preferred by human beings, because they are stable and able to produce more meaningful and understandable images for the viewer. Unlike existing methods to measure features in the 3D space for view selection, this paper proposes to measure features on the viewing plane, taking into account the influence of feature deformation due to perspective projection on view evaluation. Meanwhile, we try to have more features perceptible instead of having preferred features displayed more in a good view, which is aimed by existing methods. As a result, we can effectively obtain canonical views with only geometry computation, without troublesome semantic computation, which are always needed in existing techniques for obtaining good views.

关键词： Standards Semantics Entropy Computational modeling Humans Geometry Feature extraction

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm to maintain the Binary Search Tree dynamically

An improved algorithm to maintain the Binary Search Tree dyn...

引用

IEEE International Conference on Multi Topic

作者： Inayat-ur-Rehman Zeeshan Mehta Manzoor Elahi Saif ur Rehman Khan Department of Computer Science COMSATS Institute of information technology Islamabad Pakistan Department of Software Engineering University of Malaya Kuala Lumpur Malaysia

Binary Search Tree (BST) is an acyclic graph that is widely used to arrange the data for optimal search. In order to maintain the binary search tree in optimal shape several algorithms have been proposed. A recently proposed technique [1] applies single and double rotations to balance the binary search tree. However, due to double rotation it takes almost double time as compared to single rotation; ultimately increasing the demand for memory and processor. In this paper we propose a new technique which solves the double rotation problem in almost half of the steps of existing algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Improving linear drawing Concerning Stylized Sketch

Improving linear drawing Concerning Stylized Sketch

引用

中国电子学会第十八届青年学术年会

作者： Wen-Jing Guo Yan-Qiu Zhang Cui-Xia Ma Yong-Jin Liu Tsinghua National Laboratory for Information Science and Technology Department of Computer Science a Intelligence Engineering Laboratory Institute of SoftwareChinese Academy of Sciences Beijing Chi

Generally speaking,sketch takes advantage in conciseness and storage *** with the cognitive features of users,sketch maybe a better choice to communicate image message,which contains the least information but sufficiently satisfies the general needs of users and *** the paper,we propose a novel sketch stylized method,which improves the approach of Kang et al.[1] to get rid of some abundant points and eliminate the hard edges of the sketch,and finally modify the existing algorithm to redraw the sketch to reach better visual *** method based on existing approach and our own algorithm is easy to implement,and the effect is *** order to examine the satisfaction,we design a questionnaire and invite some volunteers to evaluate the sketch generated by the integrated method,and finally reach a high evaluation score.

关键词： sketch redundant points hard borders redrawing

来源：评论

学校读者我要写书评

暂无评论

On the Weak State in GGHN-like Ciphers

On the Weak State in GGHN-like Ciphers

引用

International Conference on Availability, Reliability and Security, ARES

作者： Aleksandar Kircanski Amr M. Youssef Department of Computer Science and Software Engineering Concordia University Montreal QUE Canada Concordia Institute for Information Systems Engineering Concordia University Montreal QUE Canada

RC4 is a stream cipher that makes use of aninternal state table, S, which represents a permutation over Z 2 8 . GGHN is a relatively more efficient stream cipher whose design is inspired from RC4 but whose S table, however, does not represent a permutation over Z 2 m. In this paper, we point out one challenging aspect of the latter design principle. In particular, we assess GGHN-like algorithms with respect to weak states, in which all internal state words and output elements are even. Once GGHN is absorbed in a weak state, the least significant bit of the plaintext words will be revealed only by looking at the ciphertext. By modelling the algorithm by a Markov chain and calculating chain's absorption time, we show that the average number of steps required by these algorithms to enter this weak state can be lower than expected at first glance and hence caution should be exercised when estimating this number.

关键词： Markov processes Absorption Radiation detectors Generators software

来源：评论

学校读者我要写书评

暂无评论

Exploiting constructive interference for scalable flooding in wireless networks

Exploiting constructive interference for scalable flooding i...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Yin Wang Yuan He Xufei Mao Yunhao Liu Zhiyu Huang Xiangyang Li MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Department of Computer Science and Engineering HKUST Hong Kong China Institute of Software Chinese Academy of Sciences China Department of Computer Science Illinois Institute of Technology USA

ISBN: (纸本)9781467307734;9781467307758

Exploiting constructive interference in wireless networks is an emerging trend for it allows multiple senders transmit an identical packet simultaneously. Constructive interference based flooding can realize millisecond network flooding latency and sub-microsecond time synchronization accuracy, require no network state information and adapt to topology changes. However, constructive interference has a precondition to function, namely, the maximum temporal displacement Δ of concurrent packet transmissions should be less than a given hardware constrained threshold. We disclose that constructive interference based flooding suffers the scalability problem. The packet reception performances of intermediate nodes degrade significantly as the density or the size of the network increases. We theoretically show that constructive interference based flooding has a packet reception ratio (PRR) lower bound (95:4%) in the grid topology. For a general topology, we propose the spine constructive interference based flooding (SCIF) protocol. With little overhead, SCIF floods the entire network much more reliably than Glossy [1] in high density or large-scale networks. Extensive simulations illustrate that the PRR of SCIF keeps stable above 96% as the network size grows from 400 to 4000 while the PRR of Glossy is only 26% when the size of the network is 4000. We also propose to use waveform analysis to explain the root cause of constructive interference, which is mainly examined in simulations and experiments. We further derive the closed-form PRR formula and define interference gain factor (IGF) to quantitatively measure constructive interference.

关键词： constructive interference Wireless networks Flood NECTIN1 gene ATP6AP2 gene PULSE REPETITION RATE stem cell inhibitory factor Glossy

来源：评论

学校读者我要写书评

暂无评论

Privacy preserving personalized access control service at third service provider

引用

Journal of Computational information Systems 2012年第7期8卷 3051-3058页

作者： Tian, Xiuxia Sha, Chaofeng Wang, Xiaoling Zhou, Aoying School of Computer and Information Engineering Shanghai University of Electric Power Shanghai 200090 China School of Computer Science Fudan University Shanghai 200433 China Software Engineering Institute East China Normal University Shanghai 200062 China

With the convenient connection to network, more and more individual information including sensitive information, such as contact list in Mobile Phone or PDA, can be delegated to the professional third service provider to manage and maintain. However, in this paradigm the critical problems to be resolved are to guarantee both the privacy of delegated individual information and the privacy of authorized users, and what is more important to afford the owners of communication devices to have high level of control and power to create their own particular access control policies. In this paper, we present an approach to implement the personalized access control at third service provider in a privacy preserving way. We illustrate and analysis the security properties of our approach by introducing misuse cases. © 2012 Binary information Press.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

GROOV: A geographic routing over VANETs and its performance evaluation

GROOV: A geographic routing over VANETs and its performance ...

引用

2012 IEEE Global Communications Conference (GLOBECOM)

作者： Sanjay K. Dhurandher Mohammad S. Obaidat Deepti Bhardwaj Ankush Garg Division of Information Technology Netaji Subhas Institute of Technology University of Delhi India Department of Computer Science and Software Engineering Monmouth University NJ USA

Owing to the features of erratic speeds and varying topography and requirements of minimum delay and high application reliability in terms of data delivery and security, existing MANET routing protocols prove to be inefficient in VANETs. In acknowledgment to the requirement for new VANET protocols addressing issues of routing, data dissemination, data sharing and security, this paper proposes a novel geographic routing technique called GROOV, which takes into account varying topographies and densities of highways as well as cities. To increase reliability, GROOV calculates transmission feasibility for each node, based on link quality (average acceleration), range weight (weightage to relative positions of nodes) and direction, instead of traditional greedy forwarding, in the selection of the next relay node. Taking volatility of critical city intersection scenarios into account, GROOV calculates new node coordinates of vehicles at intersections to make best route selections at intersections and thus, routes the data packet through the path directed at the intended recipient. This prevents the occurrence of a routing loop, thereby, decreasing delay and increasing packet delivery ratio. Simulation results show that GROOV achieves a high level of routing performance in terms of packet delivery ratio, end-to-end delay and average number of hops in both city straight road/highway and city intersection scenarios.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Flit Serialization Strategy to Utilize Partially Faulty Links in Networks-on-Chip

A Novel Flit Serialization Strategy to Utilize Partially Fau...

引用

International Symposium on Networks-on-Chip (NOCS)

作者： Changlin Chen Ye Lu Sorin D. Cotofana Computer Science and Engineering Software and Computer Technology Delft University of Technology Delft Netherlands The Institute of Electronic Communication and Information Technology (ECIT) Queen's University Belfast UK

Aggressive MOS transistor size scaling substantially increase the probability of faults in NoC links due to manufacturing defects, process variations, and chip wire-out effects. Strategies have been proposed to tolerate faulty wires by replacing them with spare ones or by partially using the defective links. However, these strategies either suffer from high area and power overheads, or significantly increase the average network latency. In this paper, we propose a novel flit serialization method, which divides the links and flits into several sections, and serializes flit sections of adjacent flits to transmit them on all available fault-free link sections to avoid the complete waste of defective links bandwidth. Experimental results indicate that our method reduces the latency overhead significantly and enables graceful performance degradation, when compared with related partially faulty link usage proposals, and saves area and power overheads by up to 29% and 43.1%, respectively, when compared with spare wire replacement methods.

关键词： Wires Error correction codes Receivers Registers Vectors Fault tolerance Fault tolerant systems

来源：评论

学校读者我要写书评

暂无评论

Applications of fuzzy logic and artificial neural network for solving real world problem

Applications of fuzzy logic and artificial neural network fo...

引用

1st International Conference on Advances in engineering, science and Management, ICAESM-2012

作者： Ramya, R. Anandanatarajan, R. Priya, R. Arul Selvan, G. Department of Computer Applications Bharathiyar College of Engineering and Technology Karaikal Pondicherry State India Dr.M.G.R. Educational and Research Institute Chennai India Department of Electronics and Instrumentation Engineering Pondicherry Engineering College Puducherry India Department of Software Engineering and Information Technology A.V.C. College of Engineering Mannampandal - 609305 Nagapattinam Dist. Tamil Nadu India Department of Computer Science and Engineering EGS Pillay Engineering College Nagapattinam Tamil Nadu India

ISBN: (纸本)9781467302135

Most of the neural networks in initial stage of enthusiasm, the field survived a period of frustration and disrepute. The reason for this is previous neuron doesn't do anything that conventional computers don't do already. Moreover they are observed to be too complex when noticed by humans as well as computers. Moreover we are furiously rising in fourth generation to increase the neural network standard in neurology and psychology. They are regularly used to model parts of living organisms and to investigate the internal mechanisms of the brain. At present the most exsisting aspect of neural networks is the possibility that some day conscious networks might be produced. Fuzzy logic and Neural network provide new method for desining control system and fuzzy logic and Neural networks can start with an approximate control knowledge base and refine it through inforcement learning. © 2012 Pillay engineering College.

关键词： Biology

来源：评论

学校读者我要写书评

暂无评论

An effective strategy for mining frequent itemsets from uncertain dataset

引用

Journal of Convergence information Technology 2012年第17期7卷 190-196页

作者： Liang, Shengbin Jiang, Binbin Wang, Le Zhang, Rui First Author School of Software Engineering Henan University China School of Software Nanyang Institute of Technology China School of Computer Science and Technology Faculty of Electronic Information and Electrical Engineering Dalian University of Technology China Daqing Oilfield Engineering Limited Corporation China

Mining frequent itemsets from uncertain datasets is an emerging research in the field of data mining;it differs from traditional frequent itemset mining in that each item in an uncertain dataset has a probability value associated with it. Existing algorithms in this field uses candidate generating and processing approaches to discover the frequent itemsets iteratively, but the number of candidates might be enormously huge and hence it is the bottleneck of the mining process. To reduce the number of candidates, we propose a strategy by adopting a weight value to decrease the estimated expected support of an itemset. We apply our strategy to the state of the art algorithm MBP to get a revised algorithm we call RMBP. The performance of RMBP was evaluated in comparison with MBP on sparse and dense datasets. Experimental results show that the algorithm RMBP outperforms the algorithm MBP in terms of running time and memory.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：