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

IEEE Symposium on Interactive Ray Tracing 2006

作者： Reshetov, Alexander Intel Corp Santa Clara CA 95051 USA

We propose a new kd-tree traversal algorithm for incoherent groups of rays which reduces number of intersection tests by more than 1.5X compared with splitting the group into coherent subgroups.

ISBN: (纸本)9781424406937

We propose a new kd-tree traversal algorithm for incoherent groups of rays which reduces number of intersection tests by more than 1.5X compared with splitting the group into coherent subgroups.

关键词： ray-tracing kd-trees traversal algorithm coherence

来源：评论

学校读者我要写书评

暂无评论

Automotive Digital Twins: A traversal algorithm for Virtual Testing of Software over-the-air Updates

Automotive Digital Twins: A Traversal Algorithm for Virtual ...

引用

IEEE International Conference on Mechatronics (ICM)

作者： Fuchs, Till Zinser, Matthias Renatus, Kevin Baeker, Bernard Dr Ing hcF Porsche AG Dev Verificat & Validat Integrat Management & Ele Weissach Germany Dr Ing hcF Porsche AG Dev Entire Vehicle Elect Elect Architecture & Inf Weissach Germany Tech Univ Dresden Chair Vehicle Mechatron Dresden Germany

ISBN: (纸本)9781665466615

The CASE (Connected, Automated, Services, Electrification) trends are shaping the automotive industry, leading to new disruptive innovations and challenges. Besides level 4/5 automated driving or shared mobility, one major factor for the success of CASE are software over-the-air (SOTA) updates. Even though map updates are common, feature updates throughout the vehicle's life cycle are not yet. This results partially from non-existent virtual respectively hardware free test methods as well as environments for SOTA updates. Therefore, this paper presents a digital twin concept for virtual testing of software updates for mechatronic systems. Firstly, it allows to set up and load Software-in-the-Loop (SiL) test environments including individual vehicle configurations. Secondly, a graph based weighting algorithm enables the use of operational vehicle field data in combination with behaviour-based data from virtual test environments in order to enrich the test quality. Lastly, a traversal algorithm can detect the functions control flow and propagate test cases alongside it.

关键词： Digital Twin Over-the-Air Software Updates traversal algorithm Virtual Testing

来源：评论

学校读者我要写书评

暂无评论

Non-Deterministic Use Case Map traversal algorithm for Scenario Simulation and Debugging 27

Non-Deterministic Use Case Map Traversal Algorithm for Scena...

引用

IEEE 27th International Requirements Engineering Conference (REW)

作者： Negash, Gabriel Liang, Chun Ming Al Taha, Feras Khzam, Nadin Bou Mussbacher, Gunter McGill Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781728151656

The User Requirements Notation (URN) is a Requirements Engineering modeling language published by the International Telecommunication Union (ITU) to formally specify and analyze what a user would expect from a system. In particular, URN allows the modeling of use cases and scenarios of a system with Use Case Maps (UCM). A key benefit of formalizing these models is the added ability to better analyze them;thus gaining insight to improve quality and understanding of the requirements of the system and its capabilities. Existing traversal mechanisms which analyze UCM do not well reflect the inherent stochasticity of system or user interactions, because they are typically designed for visualization purposes rather than simulation and debugging. We propose a novel traversal mechanism that (i) better reflects real systems by incorporating non-determinism, (ii) considers multiple independent scenarios running concurrently, (iii) implements the UCM concept of map instances, and (iv) consequently enables automated simulation and execution as well as user-driven forward and backward debugging of UCM. We validate the novel traversal mechanism by applying it to a crisis response mobile app that allows a first responder to step forwards and backwards through crisis response actions.

关键词： Debugging Non determinism Simulation traversal algorithm UCM URN Use Case Maps User Requirements Notation

来源：评论

学校读者我要写书评

暂无评论

A NOTE ON traversal algorithmS FOR TRIPLY LINKED BINARY-TREES

引用

BIT 1981年第2期21卷 153-156页

作者： FENNER, TI LOIZOU, G Department of Computer Science Birkbeck College University of London Malet Street WC1E 7HX London England

Concise well-structured non-recursive algorithms for traversing triply linked binary trees in the three principal orders are presented and shown to be closely related.

关键词： Computational Mathematic Binary Tree traversal algorithm Principal Order

来源：评论

学校读者我要写书评

暂无评论

A rapid approach based on empirical formulas and graph traversal algorithms to automatic generation of fragrance formulas

引用

Heliyon 2024年第24期10卷 e40873页

作者： Cai, Jiaxiao Tuo, Suxing Li, Yanchun Lu, Hongbing Wu, Yizi Zou, You Ma, Zhen Cui, Yuqi Kong, Bo Zhong, Kejun Technology Center of China Tobacco Hunan Industrial Co. Ltd. Changsha 410007 China Information and Network Center of Central South University Changsha 410083 China China Tobacco Hunan Industrial Co. Ltd. Changsha 410007 China

This article proposes a novel approach for improving the efficiency of fragrance designing and the accuracy of automatic fragrance formula creation based on empirical fragrance formulas and graph traversal algorithms. By effectively extracting the composition information and further analyzing the combination of fragrance materials in 210 fragrance formulas, a relational network model was constructed in the form of a graph to illustrate the relationship between the ingredients used in the formulas. Additionally, a fragrance ingredients information database of 344 common ingredients was constructed and used as a reference for perfumers when setting algorithmic constraints based on their experience. Finally, an automatic fragrance formula creation algorithm was established by constructing a relational network subgraph and finding fragrance formula solutions with the help of depth-first search algorithm that satisfies the constraint conditions and combining with appropriate statistical strategy that could determine the usage of each component in the new fragrance formula. By testing the algorithm with the goal of creating a floral fragrance, the resulting formula well fulfilled our expectations and had practical application value. © 2024

关键词： Automatic formula creation Fragrance formula Olfactory profiles traversal algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-objective Optimal Adjustment Strategy with Multiple Constraints for Three-Phase Imbalance Loads

引用

JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY 2023年第1期18卷 213-228页

作者： Ren, Siyuan Tao, Yuan Jia, Zhaopeng Liu, Zhibin Zhou, Xianzi Wei, Menggang North China Inst Aerosp Engn Langfang 065000 Hebei Peoples R China Huaneng Yangtze Environm Technol Co Ltd Beijing 100031 Peoples R China Beijing Zhiyuxin Power Technol Co Ltd Beijing 102200 Peoples R China China EPRI Sci & Technol Co Ltd Beijing 102200 Peoples R China

In low-voltage distribution network, the problem of three-phase imbalance which seriously affect the quality of power supply has existed for a long time, and has become the most common and intractable problem to solve at the end of low-voltage distribution network. To reduce the harm of three-phase imbalance to power grids, in this paper, a three-phase imbalance load adjustment system using commutation switches is proposed. Compared to previous studies that mostly focus on the effect of three-phase imbalance regulation. In particular, by considering switch failure, commutation frequency, and switch lifetime, an optimal allocation strategy with multiple constraints that alleviates the effect of three-phase imbalance on the distribution network is also presented. A new multi-objective functional is proposed to convert the original three-phase imbalance-adjustment task into an optimization problem. The traversal algorithm method is applied to ensure the comprehensiveness and stability of the commutation scheme selection in practical applications. A fractional step computing solution that simultaneously considers the insufficient computational capabilities of hardware and out-of-memory errors is proposed to deal with the huge amount of data caused by complex power grids. Simulated studies and grid connection tests were conducted to validate the feasibility and effectiveness of the proposed method. The maximum unbalance degree might not reach the initial target of 10% in some cases, which is caused by the complexity of power grid operation and the randomness of load. But other solutions with unbalance degree less than 15% could be found by the self-adjustment of the commutation adjustment strategy to reduce the harm of three-phase unbalance to power grid. Consequently, a promising approach was introduced for three-phase imbalance adjustment.

关键词： Three-phase imbalance Multi-objective functional traversal algorithm

来源：评论

学校读者我要写书评

暂无评论

THE NEW DESIGN OF THE THREADED BINARY-TREES

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1993年第3-4期49卷 177-186页

作者： HE, DK Department of Applied Mathematics Xidian University Xi'an 710071 China

The LNR/LRN New-type Threaded Binary Tree (LNR/LRN NTBT for short) is first proposed in this paper. It is shown that n, the number of nodes of the binary tree, is the time complexity* of the LNR-NTBT traversal algorithm, if there is a special pointer pointing to the first node in LNR order. But under the same condition, the time complexity of ordinary traversal algorithms for traditional LNR threaded binary trees is approximate to 2n. So the LNR-NTBT and its traversal algorithm are the best. The LRN-NTBT and its traversal algorithm are also very efficient.

关键词： DATA STRUCTURES THREADED BINARY TREE traversal algorithm algorithm COMPLEXITY DIRECTED GRAPH

来源：评论

学校读者我要写书评

暂无评论

VCSEL array thermal-distribution optimized by mesas rearrangement

引用

OPTIK 2019年 186卷 443-448页

作者： Liu, Yingying Huang, Youwen Zhong, Chuyu Zhang, Xing Zhang, Jianwei Hofmann, Werner Ning, Yongqiang Wang, Lijun Chinese Acad Sci Changchun Inst Opt Fine Mech & Phys Changchun 130033 Jilin Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Zhejiang Univ Hangzhou 310058 Zhejiang Peoples R China Tech Univ Berlin Sch Solid State Phys D-10623 Berlin Germany

A traversal algorithm considering both of the mesa interval and the entire area of the mesas was applied to find a vertical cavity surface emitting laser (VCSEL) array with minimal heat coupling factor. An optimized array was obtained and modeled in finite element software to simulate the thermal distribution. A conventional circular and an optimized array were fabricated. The maximum output power of optimized array is 14.3% higher than the conventional array and reaches 1.6 W operating in continuous wave (CW) mode. The wavelength shift of optimized VCSEL array is slightly slower than the reference device although its higher power.

关键词： VCSEL array Thermal optimization traversal algorithm Thermal cross-talk factor

来源：评论

学校读者我要写书评

暂无评论

Rule-based generation of HVAC duct routing

引用

AUTOMATION IN CONSTRUCTION 2022年 139卷 1页

作者： Chen, Zhisen Guan, Hang Yuan, Xiaolei Xie, Tian Xu, Peng Tongji Univ Sch Mech Engn Shanghai Peoples R China Chongqing Univ Sch Civil Engn Chongqing Peoples R China

Traditional manual duct design can result in fan energy waste due to ducts network imbalance and human design error. This paper aims to develop an automated duct routing method, which is able to connect air diffusers across space with the consideration of duct pressure balance, construction obstacles, air resistance reduction and minimising construction costs. Treating air diffusers as nodal connections of a graph, the method uses a rulebased traversal algorithm (RBTA) and a fast resistance calculation model (FRCM) to generate the duct network. The methodology is tested on six different building layouts for the automatic design of ducts in a room and the results meet designer's requirements. Compared with the traditional manually designed duct network, the new duct network is more balanced and costs less. The automated approach cuts design time by more than ten folds and avoid human mistake and error in the traditional design process.

关键词： Duct routing Automation traversal algorithm Optimization Fast resistance calculation Obstacle avoidance

来源：评论

学校读者我要写书评

暂无评论

LOOP-FREE algorithmS FOR TRAVERSING BINARY-TREES

引用

BIT 1984年第1期24卷 33-44页

作者： FENNER, TI LOIZOU, G UNIV LONDON BIRKBECK COLL DEPT COMP SCILONDON WC1E 7HXENGLAND

We survey and classify the various algorithms for traversing binary trees in the three principal orders and the related two- and three-visit traversal orders. For each class of algorithms we determine which of the traversal orders may be effected by means ofloop-free traversal algorithms. Although, in general, these are multi-visit traversal orders, we indicate how the algorithms may be modified to yield loop-freesingle-visit traversal algorithms in “non-standard” orders. We also exhibit and discuss the close relationship between the various stack-based algorithms and the other classes of algorithms.

关键词： Computational Mathematic Binary Tree traversal algorithm Principal Order traversal Order

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：