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

INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS 1996年第2期6卷 169-185页

作者： Dwyer, RA Eddy, WF N CAROLINA STATE UNIV DEPT COMP SCIRALEIGHNC 27695 CARNEGIE MELLON UNIV DEPT STATPITTSBURGHPA 15213

The task of finding the largest empty ellipsoid defined by a set of n point sites in R(d) is investigated. It is shown that this can be solved by enumerating the facets of the convex hull of the sites projected onto a manifold in R([d(d+3)/2]). While O(n([d(d+3)/4])) time is required in the worst case, it is found that O(n(d)) suffices on average for independent uniform points when d is fixed and n increases without bound. The effects on the running time caused by imposing certain restrictions on the orientation and shape of the ellipsoid are also described. Applications to motion planning and design centering are considered briefly.

关键词： geometric probability integral geometry computational geometry convex hulls algorithm analysis motion planning

来源：评论

学校读者我要写书评

暂无评论

Scheduling Model and algorithm of Construction Equipment under Milestone Constraint

引用

Meteorological and Environmental Research 2024年第3期15卷 32-35,41页

作者： Miao HU College of Science and Technology of China Three Gorges University Yichang 443002China

The scheduling of construction equipment is a means to realize network *** the large-scale and low-cost requirements of engineering construction,the cooperation among members of the engineering supply chain has become very important,and effective coordination of project plans at all levels to optimize the resource management and scheduling of a project is helpful to reduce project duration and *** this paper,under the milestone constraint conditions,the scheduling problems of multiple construction devices in the same sequence of operation were described and hypothesized mathematically,and the scheduling models of multiple equipment were *** Palmer algorithm,CDS algorithm and Gupta algorithm were respectively used to solve the optimal scheduling of construction equipment to achieve the optimization of the construction *** optimization scheduling of a single construction device and multiple construction devices was solved by using sequencing theory under milestone constraint,and these methods can obtain reasonable results,which has important guiding significance for the scheduling of construction equipment.

关键词： Milestone Equipment scheduling Resource constraint algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Research of Encrpytion Techniques in Information Security

Research of Encrpytion Techniques in Information Security

引用

2012 International Conference on Intelligent Control and Information Processing (ICIP 2012)

作者： Chunmei Du Jingshuang Lu Qiuyan Li Xin Guo Air Force Aviation University

The encryption techniques in the information security are introduced, which are mainly symmetrical encryption technique(DES) and dissymmetrical encryption technique(public key RSA), etc.;The encryption algorithms are ... 详细信息

关键词： Encrpytion technique Information security algorithm analysis

来源：评论

学校读者我要写书评

暂无评论

Bringing Real-World Data, Interactive Games and Visualizations into Early CS Courses 20

Bringing Real-World Data, Interactive Games and Visualizatio...

引用

Proceedings of the 51st ACM Technical Symposium on Computer Science Education

作者： Kalpathi Subramanian Erik Saule Jamie Payton The University of North Caroline at Charlotte Charlotte NC USA Temple University Philadelphia PA USA

ISBN: (纸本)9781450367936

This workshop provides instructors with a hands-on introduction to BRIDGES, a software infrastructure for programming assignments in early computer science courses, including introductory programming (CS1, CS2), data structures, and algorithm analysis. BRIDGES provides capabilities for creating more engaging programming assignments, including: (1) a simplified API for accessing real-world data sets, including from social networks; scientific, government, and civic organizations; and movie, music, and literature collections; (2) interesting visualizations of the data, (3) an easy to use API that supports creation of games that leverage real-world data, and, (4) algorithm benchmarking. Workshop attendees will engage in hands-on experience with BRIDGES with multiple datasets and will have the opportunity to discuss how BRIDGES can be used in their own courses.

关键词： algorithm analysis data structures interactive games visualization, real-world data

来源：评论

学校读者我要写书评

暂无评论

Packet Scheduling for On-Demand Data Services to High-Speed Trains over Wireless Links

Packet Scheduling for On-Demand Data Services to High-Speed ...

引用

IEEE Global Communications Conference

作者： Tianyi Chen Hangguan Shan Xin Wang Department of Communication Science and Engineering Fudan University Department of Information Science and Electronic Engineering Zhejiang University

ISBN: (纸本)9781479913510

In this paper, we consider a cellular/infostation integrated network which supports on-demand data service delivery over a wireless link to users in a high-speed train. For the requests with different lifetimes and prices that they are willing to pay, we develop the optimal packet schedule that aims at earning the maximum revenue. To this end, we formulate the problem as an integer linear program (ILP) which is in general NP-hard. However, by exploring the special structure of the formulated ILP, we show that this problem can be turned into a P problem that admits efficient solvers. Specifically, we propose a novel Checker algorithm and prove that this algorithm is guaranteed to find the offline optimal schedule for the intended problem in polynomial time, when the number of total requests is proportional to the length of the total transmission time span. Based on the relevant insights, a class of efficient online Checker algorithms are then developed to approach the optimal schedule when a-priori knowledge of service demands and/or wireless channel capacities is not available in practical systems. It is shown that these online algorithms have a competitive ratio of 1/2, i.e., total revenue earned by them is at least half as much as the revenue earned by offline optimal schedule. Simulation results are provided to demonstrate the merit of the proposed algorithms.

关键词： On-demand services Packet schedule Wireless link Integer linear program algorithm analysis analysis of algorithm wireless high-speed train Integer linear programming Radio links data services packet schedule REVENUE algorithms checker

来源：评论

学校读者我要写书评

暂无评论

Pipeline-aware Logic Deduplication in High-Level Synthesis for Post-Quantum Cryptography algorithms 20

Pipeline-aware Logic Deduplication in High-Level Synthesis f...

引用

Proceedings of the 2020 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

作者： Changsu Kim Yongwoo Lee Shinnung Jeong Wen Wang Jakub Szefer Hanjun Kim POSTECH Seoul South Korea Yonsei University Seoul South Korea Yale University New Haven CT USA

ISBN: (纸本)9781450370998

With the technical advance of quantum computers that can solve intractable problems for conventional computers, many of the currently used public-key cryptosystems become vulnerable. Recently proposed post-quantum cryptography (PQC) is secure against both classical and quantum computers, but existing embedded systems such as smart card can not easily support the PQC algorithms due to their much larger key sizes and more complex arithmetics. To accelerate the PQC algorithms, embedded systems have to embed the PQC hardware blocks, which can lead to huge hardware design costs. Although High-Level Synthesis (HLS) helps significantly reduce the design costs, current HLS frameworks produce inefficient hardware design for the PQC algorithms in terms of area and performance. This work analyzes common features of the PQC algorithms and proposes a new pipeline-aware logic deduplication method in HLS. The proposed method shares commonly invoked logic across hardware design while considering load balancing in pipeline and resolving dynamic memory accesses. This work implements FPGA hardware design of seven PQC algorithms in the round 2 candidates from the National Institute of Standards and Technology (NIST) PQC standardization process. Compared to commercial HLS framework, the proposed method achieves an area-delay-product reduction by 34.5%.

关键词： pipeline processing algorithm analysis post-quantum cryptography high-level synthesis fpga resource sharing

来源：评论

学校读者我要写书评

暂无评论

Special issue - "Conference on Computational Complexity 2004" - Guest Editor's foreword

引用

COMPUTATIONAL COMPLEXITY 2005年第2期14卷 89-89页

作者： Allender, E Rutgers State Univ Dept Comp Sci Piscataway NJ 08854 USA

关键词： Computational Complexity Computational Mathematic Problem Complexity algorithm analysis Guest Editor

来源：评论

学校读者我要写书评

暂无评论

Faster exponential time algorithms for the shortest vector problem 10

Faster exponential time algorithms for the shortest vector p...

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Daniele Micciancio Panagiotis Voulgaris University of California

ISBN: (纸本)9780898717013

We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any n-dimensional lattice can be found in time 2~(3.199n) (and space 2~(1.325n)), or in space 2~(1.095n) (and still time 2~O(n)). This improves the best previously known algorithm by Ajtai, Kumar and Sivakumar [Proceedings of STOC 2001] which was shown by Nguyen and Vidick [J. Math. Crypto. 2(2):181{207} to run in time 2~(5.9n) and space 2~(2.95n). We also present a practical variant of our algorithm which provably uses an amount of space proportional to τ_n, the "kissing" constant in dimension n. No upper bound on the running time of our second algorithm is currently known, but experimentally the algorithm seems to perform fairly well in practice, with running time 2~(0.52n), and space complexity 2~(0.2n).

关键词： algorithm analysis Cryptography Shortest Vector Problem Sieving algorithms Software implementations analysis of algorithm cryptography Runtime Exponential time algorithms

来源：评论

学校读者我要写书评

暂无评论

The design of the PSI program synthesis system 76

The design of the PSI program synthesis system

引用

Proceedings of the 2nd international conference on Software engineering

作者： Cordell Green

This paper presents an overview of the current state of the PSI automatic program synthesis system and discusses the design considerations. The PSI system allows a user to specify a desired program in a dialogue using natural language and traces. PSI then synthesizes a program meeting these specifications. The target programs are simple symbolic computation programs in *** may be described as a knowledge-based program understanding system. It is organized as a collection of closely interacting modules, or experts in the areas of natural language, discourse, traces, application domain, high-level program modelling, coding, and efficiency. An implementation effort is underway and several modules are now working.

关键词： Program synthesis Program inference algorithm analysis Knowledge-based systems Automatic coding Natural language Automatic programming Program understanding Program modelling

来源：评论

学校读者我要写书评

暂无评论

Impact of algorithm Complexity on Energy Utilization of Wireless Sensor Nodes

Impact of Algorithm Complexity on Energy Utilization of Wire...

引用

International Conference on Advances in Computing, Communications and Informatics

作者： V. M. Lekshmy Rekha, P. Maneesha Vinodhini Ramesh Amrita Center for Wireless Networks and Applications Amrita School of Engineering Amritapuri Campus Amrita Vishwa Vidyapeetham Amrita University

ISBN: (纸本)9781509020300

Nowadays wireless sensor networks are implemented in a variety of fields to obtain real-time measurements. These networks are comprised of small, low cost devices called wireless sensor nodes (WSN). There are different types of wireless sensor nodes available in the market Based on the requirements, wireless sensor nodes can be selected for each application. Power consumption is a major aspect in developing wireless sensor applications. In this paper, analysis of power consumption in different sensor nodes is conducted based on algorithms with different complexities. The experimental analysis results show that at a particular input current limit, Waspmote consumes 15% less power than MICAz mote in the case of O (1), 11.04% less in the case of O (n), 7.6% less in the case of O (n2), 3.9% less in case of O (log n) and 18.06% less in case of O (m+n) complex algorithms.

关键词： Mote algorithm analysis Complexity Power consumption

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：