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

A decomposition-based approach to layered manufacturing

COMPUTATIONAL GEOMETRY-THEORY AND applications 2002年第2期23卷 117-151页

作者： Ilinkin, I Janardan, R Majhi, J Schwerdt, J Smid, M Sriram, R Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA Synopsys Corp Mountain View CA 94043 USA Algorithm Solut Software GmbH D-66041 Saarbrucken Germany Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada Natl Inst Stand & Technol Gaithersburg MD 20899 USA

This paper introduces a new approach for improving the performance and versatility of Layered Manufacturing (LM), which is an emerging technology that makes it possible to build physical prototypes of 3D parts directly from their computer models using a "3D printer" attached to a personal computer. Current LM processes work by viewing the computer model as a single, monolithic unit. By contrast, the approach proposed here decomposes the model into a small number of pieces, by intersecting it with a suitably chosen plane, builds each piece separately using LM, and then glues the pieces together to obtain the physical prototype. This approach allows large models to be built quickly in parallel. Furthermore, it is very efficient in its use of so-called support structures that are generated by the LM process. This paper presents the first provably correct and efficient geometric algorithms to decompose polyhedral models so that the support requirements (support volume and area of contact) are minimized. algorithms based on the plane-sweep paradigm are first given for convex polyhedra. These algorithms run in O(n log n) time for n-vertex convex polyhedra and work by generating expressions for the support volume and contact-area as a function of the height of the sweep plane, and optimizing them during the sweep. These algorithms are then generalized to nonconvex polyhedra, which are considerably more difficult due to the complex structure of the supports. It is shown that, surprisingly, non-convex polyhedra can be handled by first identifying certain critical facets using a technique called cylindrical decomposition, and then applying the algorithm for convex polyhedra to these critical facets. The resulting algorithms run in O(n(2) log n) time. Also given is a method for controlling the size of the decomposition, so that the number of pieces generated is within a user-specified limit. Experimental results show that the proposed approach can achieve significant reduction

关键词： computational geometry cylindrical decomposition layered manufacturing optimization plane sweep rapid prototyping

来源：评论

学校读者我要写书评

暂无评论

Memory-constrained block processing for DSP software optimization

引用

JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY 2008年第2期50卷 163-177页

作者： Ko, Ming-Yung Shen, Chung-Ching Bhattacharyya, Shuvra S. Sandbridge Technol Inc White Plains NY USA Univ Maryland Dept Elect & Comp Engn College Pk MD 20742 USA

Digital signal processing (DSP) applications involve processing long streams of input data. It is important to take into account this form of processing when implementing embedded software for DSP systems. Task-level vectorization, or block processing, is a useful dataflow graph transformation that can significantly improve execution performance by allowing subsequences of data items to be processed through individual task invocations. In this way, several benefits can be obtained, including reduced context switch overhead, increased memory locality, improved utilization of processor pipelines, and use of more efficient DSP oriented addressing modes. On the other hand, block processing generally results in increased memory requirements since it effectively increases the sizes of the input and output values associated with processing tasks. In this paper, we investigate the memory-performance trade-off associated with block processing. We develop novel block processing algorithms that carefully take into account memory constraints to achieve efficient block processing configurations within given memory space limitations. Our experimental results indicate that these methods derive optimal memory-constrained block processing solutions most of the time. We demonstrate the advantages of our block processing techniques on practical kernel functions and applications in the DSP domain.

关键词： block processing dataflow embedded systems vectorization block diagram compiler activation overhead context switch memory management

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 17th IEEE international Conference on Embedded and Real-Time Computing Systems and applications, RTCSA 2011

Proceedings - 17th IEEE International Conference on Embedded...

引用

1st international workshop on Cyber-Physical Systems, Networks, and applications, CPSNA 2011, Co-located with the 17th IEEE international Conference on Embedded and Real-Time Computing Systems and applications, RTCSA 2011

ISBN: (纸本)9780769545028

The proceedings contain 68 papers. The topics discussed include: reducing preemptions and migrations in real-time multiprocessor scheduling algorithms by releasing the fairness;mode transition for online scheduling of adaptive real-time systems on multiprocessors;utilization-controlled task consolidation for power optimization in multi-core real-time systems;a reliability enhancement mechanism for high-assurance MLC flash-based storage systems;limiting worst-case end-to-end latency when traffic increases in a switched avionics network;design and implementation of on-chip adaptive router with predictor for regional congestion;HW resource componentizing for addressing the mega-complexity of cyber-physical systems;Virtual Lock: a smartphone application for personal surveillance using camera sensor networks;dynamic activation timing configuration for product line development;and stabilization of projected image for wearable walking support system using Pico-projector.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Use of Optimized Models for Energy Management System in Multi Energy Hydrogen and Electric Vehicle applications 3

On the Use of Optimized Models for Energy Management System ...

引用

3rd IFAC workshop on Integrated Assessment Modeling for Environmental Systems (IAMES)

作者： Giuntoli, Marco Santarelli, Marina Almaleck, Pablo Baccino, Francesco Cosentino, Mara Serra, Pietro Furmanska, Katarzyna Hitachi Energy Res Mannheim Germany Hitachi Energy SpA Italy Genoa Italy Hitachi Energy Enterprise Software Krakow Poland

As the world transitions towards sustainable energy solutions, integrating hydrogen and Electric Vehicles (EVs) into multi-energy systems presents challenges and opportunities. This paper explores a preliminary development of an advanced Charging/Energy Management System (C/EMS) optimization model tailored for multi-energy applications, explicitly focusing on Fuel Cell and Battery Electric Vehicles. Integrating hydrogen refueling infrastructure and EV charging stations within the depot introduces additional complexities, necessitating sophisticated EMS algorithms for effective management. The proposed EMS optimization model aims at optimizing the utilization of diverse energy sources, storage systems and demand-side resources to enhance system efficiency, reliability and environmental sustainability. The authors present the design considerations, modeling techniques and optimization methodologies employed to address these challenges and maximize the benefits. Case studies and simulation results demonstrate the effectiveness of the proposed EMS optimization model in enhancing overall system performances. Copyright (C) 2024 The Authors. This is an open access article under the CC BY-NC-ND license (https://***/licenses/by-nc-nd/4.0/)

关键词： Energy Management System Hydrogen Electrolyzer Fuel Cell Electric Vehicle Battery Energy Storage Systems Distributed Energy Resource

来源：评论

学校读者我要写书评

暂无评论

A Fuzzy Approach of Sensitivity for Multiple Colonies on Ant Colony optimization 7th

A Fuzzy Approach of Sensitivity for Multiple Colonies on Ant...

引用

7th international workshop on Soft Computing applications (SOFA)

作者： Pintea, Camelia-M. Matei, Oliviu Ramadan, Rabie A. Pavone, Mario Niazi, Muaz Azar, Ahmad Taher TU Cluj Napoca Cluj Napoca Romania Cairo Univ Egypt Giza Egypt Univ Catania Catania Italy COMSATS Pakistan Islamabad Pakistan Benha Univ Fac Comp & Informat Banha Egypt Nile Univ 6th Of October City Egypt

ISBN: (纸本)9783319625249

In order to solve combinatorial optimization problem are used mainly hybrid heuristics. Inspired from nature, both genetic and ant colony algorithms could be used in a hybrid model by using their benefits. The paper introduces a new model of Ant Colony optimization using multiple colonies with different level of sensitivity to the ant's pheromone. The colonies react different to the changing environment, based on their level of sensitivity and thus the exploration of the solution space is extended. Several discussion follows about the fuzziness degree of sensitivity and its influence on the solution of a complex problem.

关键词： Ant colony optimization Stigmergy Sensitivity Uncertainty Fuzzy data Traveling salesman problem Combinatorial optimization problems

来源：评论

学校读者我要写书评

暂无评论

Generalized simulated annealing optimization used in conjunction with damped least squares techniques

Generalized simulated annealing optimization used in conjunc...

引用

Recent Trends in Optical Systems Design and Computer Lens Design workshop 1987

作者： Hearn, Gregory K. SCIOPT Enterprises P.O. Box 20637 San JoseCA95160 United States

Damped Least Squares (DLS) optimization techniques have been used in lens design programs for many years. Although capable of significant improvement in a wide range of applications DLS techniques often converge to local merit function minima. Generalized Simulated Annealing (GSA) algorithms have been suggested as an alternative to DLS in order to arrive at a global merit function minima, and to reduce the dependance on operator expertise. In this paper we describe an effort to use the preliminary results of the DLS process to provide a starting point in a semi automatic manner for the GSA algorithm. © 1987 SPIE. All rights reserved.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Maximum power point tracking of partially shading pv system using particle swarm optimization 18

Maximum power point tracking of partially shading pv system ...

引用

4th international Conference on Frontiers of Educational Technologies, ICFET 2018, Jointly with its workshop the 3rd international Conference on Knowledge Engineering and applications, ICKEA 2018

作者： Obukhov, S. Ibrahim, A. Aboelsaud, Raef National Research Tomsk Polytechnic University Tomsk Russia Electrical Power and Machines Department Faculty of Engineering Zagazig University Egypt

ISBN: (纸本)9781450364720

The partial shading condition (PSC) often occur in large photovoltaic (PV) generation system (PGS), it causes system losses and many problems in reliability of power system. The power voltage ( p-v) curve under the PSC have more peaks local and global peak and this makes the track of maximum power is very difficult and the conventional algorithms can't track the global maximum power point in this case. In this paper, the maximum power point tracking (MPPT) under PSC are evaluated using the particle swarm optimization (PSO). The proposed model tracks the global maximum power point (GMPP) very fast and in very short time and don't exceed 30 iterations under minimum solar irradiation cases. © 2018 Association for Computing Machinery.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Approximation, Randomization, and Combinatorial optimization. algorithms and Techniques 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Prasad Raghavendra Sofya Raskhodnikova Klaus Jansen José D. P. Rolim

ISBN: (数字)9783642403286

ISBN: (纸本)9783642403279

This book constitutes the proceedings of the 16th international workshop on Approximation algorithms for Combinatorial optimization Problems, APPROX 2013, and the 17th international workshop on Randomization and Computation, RANDOM 2013, held in August 2013 in the USA. The total of 48 carefully reviewed and selected papers presented in this volume consist of 23 APPROX papers selected out of 46 submissions, and 25 RANDOM papers selected out of 52 submissions. APPROX 2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems, while RANDOM 2013 focuses on applications of randomness to computational and combinatorial problems.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computation by Abstract Devices Numeric Computing Probability and Statistics in Computer Science Data Structures

来源：评论

学校读者我要写书评

暂无评论

A Review on Satellite Image Segmentation Using Metaheuristic optimization Techniques 1

引用

5th international Conference on Advances in Distributed Computing and Machine Learning, ICADCML 2024

作者： Bandikolla, Lakshmi Md Khairuzzaman, Abdul Kayom School of Electronics Engineering VIT-AP University Amaravati Andhra Pradesh Vijayawada522237 India

ISBN: (数字)9789819718412

ISBN: (纸本)9789819718405

Image segmentation is essential in digital image processing applications. multilevel thresholding is a popular technique for image segmentation. An image can be divide into multiple classes. In this paper, the image quality metrics such as peak signal-to-noise ratio (PSNR), mean squared error (MSE), mean structural similarity (SSIM), feature similarity (FSIM) are compared using metaheuristic algorithms. The CPU time of different metaheuristics is also compared to determine the time complexity of the techniques. The Otsu’s method, Kapur’s entropy, Tsallis entropy, and Masi entropy are used as objective functions. Some of the metaheuristic algorithms, adaptive Cuckoo search algorithm (ACS), chaotic coronavirus optimization algorithm (COVIDOA), dynamic quantum-inspired genetic algorithm (DQGA), a modified artificial bee colony algorithm (MABC), dynamic Harris hawks with mutation mechanism (DHHO/M), and particle swarm optimization algorithms (PSO) are compared. As per the comparison of the quality metrics, DHHO/M with Otsu was more efficient in average PSNR. CS with Tsallis provides best value in average MSE, ACS with Otsu gives best results in average SSIM, ACS with Tsallis is more efficient in average FSIM, and MABC with Kapur’s combination was more efficient in average CPU time. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Approximation, Randomization, and Combinatorial optimization. algorithms and Techniques 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Anupam Gupta Klaus Jansen José Rolim Rocco Servedio

ISBN: (数字)9783642325120

ISBN: (纸本)9783642325113

This book constitutes the joint refereed proceedings of the 15th international workshop on Approximation algorithms for Combinatorial optimization Problems, APPROX 2012, and the 16th international workshop on Randomization and Computation, RANDOM 2012, held in Cambridge, Massachusetts, USA, in August 2011. The volume contains 28 contributed papers, selected by the APPROX Program Committee out of 70 submissions, and 28 contributed papers, selected by the RANDOM Program Committee out of 67 submissions. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：