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

International Conference on Power, Control and Embedded systems (ICPCES)

作者： Atul Patel Anupam Dubey Ajitesh Pandey Siddharth Dutt Choubey Electronics and Communication Engineering Gyan Ganga Institute of Technology and Sciences Jabalpur India Information Technology IPM Kanpur India Electronics and Communication Engineering Oriental Engineering College Jabalpur India System Software SRIT Jabalpur India

In a number of applications, the problem of determining the optimum path occurs, to be specific we shall look at the case of finding the optimum path for mobile robots. This paper presents a shortest path estimation scheme utilizing the overhead video capturing device, for mobile robot path planning. The presented scheme applies the floodfill technique to evaluate shortest path on the maze of dimension (7×7 junction wise). The overhead camera takes continuous snapshot of the maze and accordingly the path planning and computations are done. All the complex calculations and shortest path evaluations are accomplished using MATLAB®. The simulation results that have been taken shows, the mobile robot travels successfully from starting point and reaching its goal point. All obstacles that are located in its way have been avoided and shortest path estimation is done successfully.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multi-criteria optimization of steel alloys for crankshafts production

Multi-criteria optimization of steel alloys for crankshafts ...

引用

IEEE International Symposium on Innovations in Intelligent systems and Applications (INISTA)

作者： Petia Koprinkova-Hristova Nikolay Tontchev Silviya Popova Institute of Information and Communication Technologies Bulgarian Academy of Sciences Sofia Bulgaria Department of Transport Management University of Transport Sofia Bulgaria Institute of System Engineering and Robotics Bulgarian Academy of Sciences Sofia Bulgaria

The paper presents application of multi-criteria optimization to steel alloy composition determination aimed at obtaining improved properties material for crankshafts production. Neural network model of steel mechanical characteristics in dependence on amounts of its alloying elements were used for simulation purpose. Then several Pareto optimal solutions were found based on obtained by simulation numerous compositions in the investigated region of interest.

关键词： Steel Optimization Materials Neural networks Production Alloying

来源：评论

学校读者我要写书评

暂无评论

P2PAV: Anti-virus through P2P

P2PAV: Anti-virus through P2P

引用

IEEE Symposium on Robotics and Applications (ISRA)

作者： Li Zhang Zhao Wang Zhong Chen China Information Technology Security Evaluation Center Beijing China Institute of Software School of Electronics Engineering and Computer Science Peking University Key laboratory of High Confidence Software Technologies Ministry of Education Peking University Beijing China

Antivirus software is one of the most widely installed software for protecting computer from malicious attacks. However, traditional host-based antivirus needs to store all viruses' pattern or sample, which not only needs large local storage, but also fails to detect modern threats in time. The newly come cloud-based antivirus, which needs no extra local storage and compares virus' pattern on provider's cloud servers, has the disadvantages of being more likely to be attacked when offline. This paper advocates P2PAV, a new model for malware detection through P2P network, which takes advantages of traditional ones and cloud antivirus, reduces local storage, and meanwhile, improves the ability of detecting modern virus than traditional ways, and combating virus when offline than cloud-based antivirus.

关键词： Cloud computing Engines Databases Malware

来源：评论

学校读者我要写书评

暂无评论

Nine Years Challenge of In-process Measurement Platform for software Development Project: Distribution of a New Generation Platform and a Collaborative Research Proposal

Nine Years Challenge of In-process Measurement Platform for ...

引用

Joint Conference of the Int'l Workshop on and International Conference on software Process and Product Measurement software Measurement

作者： Yoshiki Mitani Yutaka Ohwada Go Maeda Kenichi Matsumoto Graduate School of Information Science Nara Institute of Science and Technology Tokyo Japan Software Engineering Center (SEC/IPA) Information-technology Promotion Agency Japan Tokyo Japan FAR END Technologies Corporation Matsue Japan Graduate School of Information Science Nara Institute of Science and Technology Nara Japan

There are two "barriers" in the research of software engineering. One is "the barrier of individuality" and other one is "the barrier of secret". These have obstructed prosperity of the software engineering. For these nine years, the authors considered overthrowing these barriers. The authors realized the powerful in process measurement platform for software development project and challenged to get empirical evidence of its usefulness and its propagation. Up to now, the authors realized two generations of measurement platform and distributed them to the industry, and also carried several empirical evaluation projects. Then the authors realized the new generation of in-process measurement platform, as for it, all the former days experiences were reflected. It was utilizing the structure of remarkable progressed software development environment in recent years. And the authors stated its distribution to the industrial society. This paper looks down former day's empirical evaluation activities and clarifies requirements for in-process measurement platform which were obtained from those activities. It also describes the new generation measurement platform which realized those former researches. Add to them, this paper proposes the broad participation in the empirical collaborative research using this platform. Finally it is introduced related research, and positioning of this research is shown.

关键词： software software measurement Companies Collaboration Data visualization software engineering

来源：评论

学校读者我要写书评

暂无评论

CitySee: Urban CO2 monitoring with sensors

CitySee: Urban CO2 monitoring with sensors

引用

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

作者： Xufei Mao Xin Miao Yuan He Xiang-Yang Li Yunhao Liu Department of Computer Science and Engineering HKUST Hong Kong China MOE Key Laboratory for Information System Security School of Software TNLIST Tsinghua University China Computer Science Department Illinois Institute of Technology USA

ISBN: (纸本)9781467307734;9781467307758

Motivated by the needs of precise carbon emission measurement and real-time surveillance for CO 2 management in cities, we present CitySee, a real-time CO 2 -monitoring system using sensor networks for an urban area (around 100 square kilometers). In order to conduct environment monitoring in a real-time and long-term manner, CitySee has to address the following challenges, including sensor deployment, data collection, data processing, and network management. In this discussion, we mainly focus on the sensor deployment problem so that necessary requirements like connectivity, coverage, data representability are satisfied. We also briefly go through the solutions for the remaining challenges. In CitySee, the sensor deployment problem can be abstracted as a relay node placement problem under hole-constraint. By carefully taking all constraints and real deployment situations into account, we propose efficient and effective approaches and prove that our scheme uses additional relay nodes at most twice of the minimum. We evaluate the performance of our approach through extensive simulations resembling realistic deployment. The results show that our approach outperforms previous strategies. We successfully apply this design into CitySee, a large-scale wireless sensor network consisting of 1096 relay nodes and 100 sensor nodes in Wuxi City, China.

关键词： Sensors Wireless sensor networks Wireless communication Joining processes Relays Steiner trees Carbon dioxide

来源：评论

学校读者我要写书评

暂无评论

Mechanism design for finding experts using locally constructed social referral web

Mechanism design for finding experts using locally construct...

引用

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

作者： Lan Zhang Xiang-Yang Li Yunhao Liu QiuYuan Huang Shaojie Tang MOE Key Laboratory for Information System Security School of Software Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science Illinois Institute of Technology USA Department of Computer Science and Engineering HKUST Hong Kong China Department of Electrical Engineering University of Florida USA

ISBN: (纸本)9781467307734;9781467307758

In this work, we address the problem of finding experts using chains of social referrals and profile matching with only local information in online social networks. By assuming that users are selfish, rational, and have privately known cost of participating in the referrals, we design a novel truthful efficient mechanism in which an expert-finding query will be relayed by intermediate users. When receiving a referral request, a participant will locally choose among her neighbors some user to relay the request. In our mechanism, several closely coupled methods are carefully designed to improve the search performance, including, profile matching, social acquaintance prediction, score function for locally choosing relay neighbors, and budget estimation. We conduct extensive experiments on several datasets of online social networks. The extensive study of our mechanism shows that the success rate of our mechanism is about 90% in finding closely matched experts using only local search and limited budget, which significantly improves the previously best rate 20%. The overall cost of finding an expert by our truthful mechanism is about 20% of the untruthful method and only about 2% of the method that always selects high-degree neighbors. The median length of social referral chains is 6 using our localized search decision, which surprisingly matches the well-known small-world phenomenon of global social structures.

关键词： Vectors Probability Search problems Facebook Relays Databases

来源：评论

学校读者我要写书评

暂无评论

Fault detection on the software implementation of CLEFIA lightweight cipher

引用

Journal of Networks 2012年第8期7卷 1288-1294页

作者： Li, Wei Gu, Dawu Xia, Xiaoling Liu, Ya Liu, Zhiqiang School of Computer Science and Technology Donghua University Shanghai China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security Shanghai China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing China Department of Computer Science and Engineering Shanghai Jiao Tong University Shanghai China

CLEFIA is an efficient lightweight cipher that delivers advanced copyright protection and authentication in computer networks. It is also applied in the secure protocol for transmission including SSL and TLS. Since it was proposed in 2007, some work about its security against differential fault analysis has been devoted to reducing the number of faults and to improving the time complexity of this attack. This attack is very efficient when a single fault is injected into the last several rounds of the CLEFIA, and it allows to recover the whole secret key. Thus, it is an open question whether detecting the faults injected into the CLEFIA with low overhead of space and time tolerance. In this paper, we present a fault detection of the CLEFIA block cipher in the single-byte fault model. Our result in this study could detect the faults with negligible cost when faults are even injected into the last four rounds. © 2012 ACADEMY PUBLISHER.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

SENEKA - sensor network with mobile robots for disaster management

SENEKA - sensor network with mobile robots for disaster mana...

引用

IEEE Conference on technologies for Homeland Security

作者： Helge-Björn Kuntze Christian W. Frey Igor Tchouchenkov Barbara Staehle Erich Rome Kai Pfeiffer Andreas Wenzel Jürgen Wöllenstein Fraunhofer Institute for Optronics System Technologies and Image Exploitation (IOSB) Karlsruhe Germany Fraunhofer Institute for Integrated Circuits Nuernberg Germany Fraunhofer Institute for Intelligent Analysis and Information Systems Sankt Augustin Germany Fraunhofer Institute for Manufacturing Engineering and Automation Stuttgart Germany Fraunhofer-Anwendungszentrum Systemtechnik (AST) Ilmenau Germany Fraunhofer Institute for Physical Measurement Techniques Freiburg Germany

Developed societies have a high level of preparedness for natural or man-made disasters. But such incidents cannot be completely prevented, and when an incident like an earthquake or an accident in a chemical or nuclear plant hits a populated area, rescue teams need to be employed. In such situations it is a necessity for rescue teams to get a quick overview of the situation in order to identify possible locations of victims that need to be rescued and dangerous locations that need to be secured. Rescue forces must operate quickly in order to save lives, and they often need to operate in dangerous environments. Hence, robot-supported systems are increasingly used to support and accelerate search operations. The objective of the SENEKA concept is to network the various robots and sensor systems used by first responders in order to make the search for victims and survivors more quick and efficient. SENEKA targets the integration of the robot-sensor network into the operation procedures of the rescue teams. The aim of this paper is to inform on the goals and first research results of the ongoing joint research project SENEKA.

关键词： Robot sensing systems Robot kinematics Hazards Reconnaissance Service robots Mobile robots

来源：评论

学校读者我要写书评

暂无评论

Scaling Laws of Multicast Capacity for Power-Constrained Wireless Networks under Gaussian Channel Model

引用

IEEE Transactions on Computers 2012年第5期61卷 713-725页

作者： Cheng Wang Changjun Jiang Xiang-Yang Li Shaojie Tang Yuan He Xufei Mao Yunhao Liu Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Engineering Building of Electronics and Information Engineering University of Tongji Shanghai China Department of Computer Science Illinois Institute of Technology Chicago IL USA Tsinghua National Laboratory for Information Science and Technology (TNLIST) Tsinghua University Beijing China Department of Computer Science and Engineering University of Tongji China Department of Computer Science Hong Kong University of Science and Technology Kowloon Hong Kong China Tsinghua National Laboratory for Information Science and Technology (TNLIST) School of Software Tsinghua University Beijing China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China

We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).

关键词： Lattices Throughput Upper bound Road transportation Receivers Interference Routing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：