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

13th Computing: The Australasian Theory Symposium, CATS2007

作者： Cheong, Otfried Haverkorty, Herman Lee, Mira Dept. of Computer Science Korea Advanced Inst. of Science and Technology Daejeon Korea Republic of Department of Mathematics and Computing Science TU Eindhoven Eindhoven Netherlands

ISBN: (纸本)1920682465

Given a set S of n points in the plane, a minimum-dilation spanning tree of S is a tree with vertex set S of smallest possible dilation. We show that given a set S of n points and a dilation δ > 1, it is NP-hard to determine whether a spanning tree of S with dilation at most δ exists. © 2007, Australian computer Society, Inc.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient algorithm for scheduling problem with batching and common due window

An efficient algorithm for scheduling problem with batching ...

引用

2007 International Conference on Computational Intelligence and Security Workshops, CIS 2007

作者： Hongluan, Zhao Guojun, Li Jiqiang, Wang Guoyong, Han School of Computer Science and Technology Shandong Jianzhu Univ. Jinan China School of Mathematics and System Science Shandong Univ. Jinan China Computational Systems and Biology Lab. Department of Biochemistry and Molecular Biology Univ. of Georgia United States School of Statistics and Mathematics Shandong Finance Inst. Jinan China

ISBN: (纸本)0769530737

Jobs share a common due window and belong to distinct families with sequence-independent setup tasks on a single machine. The window location and size are decision variables with linear penalties. Our objective is to find a schedule minimizing the sum of the weighted number of early and tardy jobs, together with the determination cost of the due window. Following several properties of an optimal schedule, a polynomial algorithm is firstly proposed and range it to P-problem. © 2007 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Weighted Centroid Localization in Zigbee-based Sensor Networks

Weighted Centroid Localization in Zigbee-based Sensor Networ...

引用

IEEE International Symposium on Intelligent Signal Processing

作者： Jan Blumenthal Ralf Grossmann Frank Golatowski Dirk Timmermann Faculty of Computer Science and Electrical Engineering Institute of Applied Microelectronics and CE Warnemunde Germany Inst. of Appl. Microelectron. & CE Rostock CELISCA Center for Life Science Automation University of Rostock Germany

ISBN: (纸本)9781424408290;1424408296

Localization in wireless sensor networks gets more and more important, because many applications need to locate the source of incoming measurements as precise as possible. Weighted centroid localization (WCL) provides a fast and easy algorithm to locate devices in wireless sensor networks. The algorithm is derived from a centroid determination which calculates the position of devices by averaging the coordinates of known reference points. To improve the calculated position in real implementations, WCL uses weights to attract the estimated position to close reference points provided that coarse distances are available. Due to the fact that Zigbee provides the link quality indication (LQI) as a quality indicator of a received packet, it can also be used to estimate a distance from a node to reference points.

关键词： Wireless sensor networks ZigBee Time measurement Intelligent sensors Signal processing Automation computer science Microelectronics Application software Electric variables measurement

来源：评论

学校读者我要写书评

暂无评论

Web Services Interfaces and Open Standards Integration into the European UNICORE 6 Grid Middleware

Web Services Interfaces and Open Standards Integration into ...

引用

International Workshop on Enterprise Distributed Object Computing, EDOCW

作者： M. Riedel B. Schuller D. Mallmann R. Menday A. Streit B. Tweddell M. Shahbaz Memon A. Shiraz Memon B. Demuth T. Lippert D. Snelling S. van den Berghe V. Li M. Drescher A. Geiger G. Ohme A. Vanni C. Cacciari S. Lanzarini P. Malfetti K. Benedyczak P. Bala R. Ratering A. Lukichev Central Institute for Applied Mathematics John von Neumann Institute of Computing Forschungszentrum Julich Julich Germany John von Neumann Inst. for Comput. Forschungszentrum Julich Central Inst. for Appl. Math. Julich Fujitsu Laboratories Limited Hayes UK Solutions for Research T-Systems Corporation Wessling Germany High Performance Computing Department CINECA Bologna Italy Faculty of Mathematics and Computer Science Torun Nicolaus Copernicus University Torun Poland Software and Solutions Group Intel Corporation Bruhl Germany

The UNICORE grid system provides a seamless, secure and intuitive access to distributed grid resources. In recent years, UNICORE 5 is used as a well-tested grid middleware system in production grids (e.g. DEISA, D-Grid) and at many supercomputer centers world-wide. Beyond this production usage, UNICORE serves as a solid basis in many European and International research projects and business scenarios from T-Systems, Philips Research, Intel, Fujitsu and others. To foster ongoing developments in multiple projects, UNICORE is open source under BSD license at SourceForge. More recently, the new Web services-based UNICORE 6 has become available that is based on open standards such as the Web services addressing (WS-A) and the Web services resource framework (WS-RF) and thus conforms to the open grid services architecture (OGSA) of the open grid forum (OGF). In this paper we present the evolution from production UNICORE 5 to the open standards-based UNICORE 6 and its various Web services-based interfaces. It describes the interface integration of emerging open standards such as OGSA-BES and OGSA-RUS and thus provides an overview of UNICORE 6.

关键词： Web services Middleware Service oriented architecture Space technology mathematics Grid computing High performance computing Supercomputers Production facilities Paramagnetic resonance

来源：评论

学校读者我要写书评

暂无评论

Reliable adaptive multicast protocol in wireless Ad hoc networks

引用

Journal of Systems Engineering and Electronics 2006年第1期17卷 187-192页

作者： Sun Baolin Li Layuan School of Computer Science and Technology Wuhan Univ. of Technology Wuhan 430063 P. R. China Dept. of Mathematics and Physics Wuhan Inst. of Science and Technology Wuhan 430073 P. R. China

In wireless ad hoe network environments, every link is wireless and every node is mobile. Those features make data lost easily as well as multicasting inefficient and unreliable. Moreover, Efficient and reliable multicast in wireless ad hoe network is a difficult issue. It is a major challenge to transmission delays and packet losses due to link changes of a multicast tree at the provision of high delivery ratio for each packet transmission in wireless ad hoe network environment. In this paler, we propose and evaluate Reliable Adaptive Multicast Protocol （RAMP） based on a relay node concept. Relay nodes are placed along the multieast tree. Data recovery is done between relay nodes. RAMP supports a reliable multicasting suitable for mobile ad hoe network by reducing the number of packet retransmissions. We compare RAMP with SRM （Scalable Reliable Multicast）. Simulation results show that the RAMP has high delivery ratio and low end-to-end delay for packet transmsission.

关键词： muhicast multicast protocol reliable muhicast wireless ad hoc networks.

来源：评论

学校读者我要写书评

暂无评论

Petri nets for task supervision in humanoid robots

Petri nets for task supervision in humanoid robots

引用

作者： Lehmann, Arne Mikut, Ralf Asfour, Tamim Inst. of Applied Computer Science Forschungszentrum Karlsruhe Germany University Karlsruhe Germany Institute of Applied Computer Science Forschungszentrum Karlsruhe P.O. Box 3640 76021 Karlsruhe Germany

The application of petri nets for task supervision in humanoid robots is described. In contrast to industrial applications, humanoid robots act in complex, permanently changing environments. It require a fully functional control architecture for task planning, coordination, execution, and supervision. Many robot control architectures base on a hierarchical three-layered concept including levels for planning, coordination, and execution. Most of the routine tasks and some expected exceptional circumstances during the execution of a task are planned in advance. Petri nets are used to describe such robot tasks with sequential and parallel actions.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A Secure Session Key Distribution Scheme for Group Communications

引用

Journal of Shanghai Jiaotong university(science) 2006年第2期11卷 192-196页

作者：林仁宏詹进科 Inst. of Applied Mathematics National Chung Hsing Univ Inst. of Computer Science National Chung Hsing Univ. Taichung 402 Taiwan China

In a secure group communication system, messages must be encrypted before being transmitted to group members to prevent unauthorized access. In many secure group communication schemes, whenever a member leaves or joins the group, group center (GC) immediately changes the common encryption key and sends the new key to all valid members for forward and backward secrecy. If valid members are not on-line, they will miss the re-keying messages and will not be able to decrypt any ciphertext. Therefore, group members must be able to store the state of the system. In some applications, like global positioning systems (GPS) or pay-per-view systems, it is not reasonable to ask group members to stay on-line all the time and save the changes to the system. A hierarchical binary tree-based key management scheme are proposed for a secure group communication. This scheme reduces the key storage requirement of GC to a constant size and the group members are not required to be on-line constantly (stateless).

关键词： key management symmetric encryption group communication pseudo-random function

来源：评论

学校读者我要写书评

暂无评论

Cross-lingual question answering by answer translation

Cross-lingual question answering by answer translation

引用

2006 Cross Language Evaluation Forum Workshop, CLEF 2006, co-located with the 10th European Conference on Digital Libraries, ECDL 2006

作者： Bos, Johan Nissim, Malvina Linguistic Computing Laboratory Department of Computer Science University of Rome la Sapienza Italy Laboratory for Applied Ontology Inst. for Cognitive Science and Technology National Research Council Rome Italy

We approach cross-lingual question answering by using a mono-lingual QA system for the source language and by translating resulting answers into the target language. As far as we are aware, this is the first cross-lingual QA system in the history of CLEF that uses this method-all other cross-lingual QA systems known to us use translation of the question or query inst.ad. We demonstrate the feasibility of this approach by using a mono-lingual QA system for English, and translating answers and finding appropriate documents in Italian and Dutch. For factoid and definition questions, we achieve overall accuracy scores ranging from 13% (EN→NL) to 17% (EN→IT) and lenient accuracy figures from 19% (EN→NL) to 25% (EN→IT). The advantage of this strategy to cross-lingual QA is that translation of answers is easier than translating questions-the disadvantage is that answers might be missing from the source corpus and additional effort is required for finding supporting documents of the target language.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Secure session key distribution scheme for group communications

引用

Journal of Shanghai Jiaotong University (science) 2006年第2期11 E卷 192-196页

作者： Lin, Ren-Hung Jan, Jinn-Ke Inst. of Applied Mathematics National Chung Hsing Univ. Taichung 402 Taiwan Inst. of Computer Science National Chung Hsing Univ. Taichung 402 Taiwan

关键词： Security of data

来源：评论

学校读者我要写书评

暂无评论

On universal quadratic identities for minors of quantum matrices 29

On universal quadratic identities for minors of quantum matr...

引用

29th international conference on Formal Power Series and Algebraic Combinatorics, FPSAC 2017

作者： Danilov, Vladimir I. Karzanov, Alexander V. Central Inst. of Economics and Mathematics of RAS 47 Nakhimovskii Prosp. Moscow117418 Russia Inst. for System Analysis FRC Computer Science and Control of RAS 9 Prosp. 60 Let Oktyabrya Moscow117312 Russia

We give a complete combinatorial characterization of homogeneous quadratic identities of "universal character" valid for minors of quantum matrices over a field. This is obtained as a consequence of a study of quantized minors of the so-called path matrices associated with certain planar graphs generalizing Cauchon graphs. © 29th international conference on Formal Power Series and Algebraic Combinatorics. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：