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

DOSIMETRY OF HIGH-ENERGY ELECTRON THERAPY TO THE PAROTID REGION

RADIOTHERAPY AND ONCOLOGY 1994年第2期33卷 148-156页

作者： OSTWALD, PM COOPER, SG DENHAM, JW HAMILTON, CS Department of Radiation Oncology Newcastle Mater Misericordiae Hospital Waratah 2298 NSW Australia

Well-known inadequacies in currently available electron planning systems, and two cases of temporal lobe necrosis following electron therapy of the parotid stimulated a comprehensive head and neck phantom dosimetric study of the use of high energy electrons for parotid treatments. A typical electron field employed for the treatment of parotid malignancy was examined in an anthropomorphic head phantom from which air cavities had been excavated. Thermoluminescent dosimeter measurements were compared with predicted point doses obtained from a Theraplan Treatment planning system (V05). Data was examined for three different electron energies: 12, 16 and 20 MeV and with the addition of contoured bolus for 20 MeV. A number of significant discrepancies between the measured and predicted dose were observed. Measured doses were seen to exceed predicted doses by up to 23% in the temporal lobe. Further under-predictions of dose were found behind the mandible and in the nasal cavity. Over-predictions of dose by the planning algorithm of up to 22% were observed beside the oropharynx. Some of these discrepancies were found to relate to Theraplan under-estimation of the dose in the fall-off region. Other errors are attributable to the difficulties in predicting dose at density interfaces. Localised over- and under-predictions of this magnitude must be accounted for by the clinician prescribing treatment in terms of possible late effects on the temporal lobe and, in particular, the nominated dose specification point.

关键词： ELECTRON BEAM RADIOTHERAPY planning algorithms ANTHROPOMORPHIC PHANTOM THERMOLUMINESCENCE DOSIMETRY

来源：评论

学校读者我要写书评

暂无评论

planning and design of urban low-voltage DC grids

引用

ELECTRIC POWER SYSTEMS RESEARCH 2022年第0期211卷

作者： Saat, Julian Stein, Sebastian Muellender, Maxim Ulbig, Andreas Rhein Westfal TH Aachen Inst High Voltage Equipment & Grids Digitalizat & Aachen Germany

Accompanied by further cost degression and technological development in the field of power electronic devices and DC technology, low-voltage DC (LVDC) grids for public power supply gain practical relevance for the future grid design, promising a solution to the technical challenges in the course of energy transition and digitization. In this paper, a comprehensive planning framework for urban public power supply LVDC grids is presented. Based on an analysis of degrees of freedom in such systems including potential for power flow control, the structural design of LVDC grids is investigated by explicitly planning radial, ring and meshed structures applying heuristic and metaheuristic algorithms on georeferenced supply data. Key to accuracy of the developed line courses is the orientation to existing traffic routes, establishing additional practical significance of the proposed approach. Three optimized LVDC grids as result of the case study are compared in terms of technical and economic aspects.

关键词： Future energy systems LVDC grids Structural grid planning planning algorithms Hybrid genetic search

来源：评论

学校读者我要写书评

暂无评论

Description logics and planning

引用

AI MAGAZINE 2005年第2期26卷 73-84页

作者： Gil, YL Univ So Calif Inst Sci Informat Los Angeles CA 90089 USA

This article surveys previous work on combining planning techniques with expressive representations of knowledge in description logics to reason about tasks, plans, and goals. Description logics can reason about the logical definition of a class and automatically infer class-subclass subsumption relations as well as classify instances into classes based on their definitions. Descriptions of actions, plans, and goals can be exploited during plan generation, plan recognition, or plan evaluation. These techniques should be of interest to planning practitioners working on knowledge-rich application domains. Another emerging use of these techniques is the semantic web, where current ontology languages based on description logics need to be extended to reason about goals and capabilities for web services and agents.

关键词： .web services plan generation Description Logics plan recognition infer planning algorithms planning systems subsumption plans and goals goals and capabilities

来源：评论

学校读者我要写书评

暂无评论

A Novel Multi-Agent planning System for Digital Interactive Storytelling

引用

COMPUTERS IN ENTERTAINMENT 2016年第1期14卷 3-3页

作者： Goudoulakis, Efstathios El Rhalibi, Abdennour Merabti, Madjid Liverpool John Moores Univ Dept Comp Sci James Parsons BldgByrom St Liverpool L3 3AF Merseyside England Liverpool John Moores Univ Liverpool L3 5UX Merseyside England Univ Sharjah Coll Sci Sharjah U Arab Emirates

Digital Interactive Storytelling (DIS) is a relatively novel area of computer entertainment that aims at investigating interactive applications capable of generating consistent, emergent, and rich stories. To provide new solutions for DIS, we designed and are implementing and evaluating a novel multi-agent DIS framework, DIEGESIS, which includes agents' coordination and new planning and re-planning solutions. In this article, we discuss the design and implementation of DIEGESIS, explaining in detail the mechanisms of our planning algorithms, and the story execution and agent coordination algorithms, along with a planning methods evaluation and agent planning and coordination examples. We are currently in the process of creating a large DIS scenario, involving the story of Homer's Troy, with several levels that will allow us to further evaluate and expand our system.

关键词： Interactive storytelling planning algorithms multi-agents

来源：评论

学校读者我要写书评

暂无评论

Collective Mobile Sequential Recommendation: A Recommender System for Multiple Taxicabs 31

Collective Mobile Sequential Recommendation: A Recommender S...

引用

31st IEEE International Conference on Tools with Artificial Intelligence (ICTAI)

作者： Wu, Tongwen Zhang, Zizhen Li, Yanzhi Wang, Jiahai Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou Peoples R China City Univ Hong Kong Dept Management Sci Kowloon Hong Kong Peoples R China

ISBN: (纸本)9781728137988

Mobile sequential recommendation was originally designed to find a promising route for a single taxicab. Directly applying it for multiple taxicabs may cause an excessive overlap of recommended routes. The multi-taxicab recommendation problem is challenging and has been less studied. In this paper, we first formalize a collective mobile sequential recommendation problem based on a classic mathematical model, which characterizes time-varying influence among competing taxicabs. Next, we propose a new evaluation metric for a collection of taxicab routes aimed to minimize the sum of potential travel time. We then develop an efficient algorithm to calculate the metric and design a greedy recommendation method to approximate the solution. Finally, numerical experiments show the superiority of our methods. In trace-driven simulation, the set of routes recommended by our method significantly outperforms those obtained by conventional methods.

关键词： planning algorithms planning under Uncertainty Recommender System

来源：评论

学校读者我要写书评

暂无评论

A coverage algorithm for multi-robot boundary inspection

A coverage algorithm for multi-robot boundary inspection

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Easton, K Burdick, J CALTECH Div Engn & Appl Sci Pasadena CA 91125 USA

ISBN: (纸本)078038914X

This paper introduces the multi-robot boundary coverage problem, wherein a group of k robots must inspect every point on the boundary of a 2-dimensional test environment. Using a simplified sensor model, this inspection problem is converted to an equivalent graph representation. In this representation, the coverage problem can be posed as the k-Rural Postman Problem (kRPP). We present a constructive heuristic which finds a solution to the kRPP, then use that solution to plan the robots' inspection routes. These routes provide complete coverage of the boundary and also balance the inspection load across the k robots. Simulations illustrate the algorithm's performance and characteristics.

关键词： robot coverage multiple robots planning algorithms

来源：评论

学校读者我要写书评

暂无评论

COORDINATION IN OPEN AND UNSTRUCTURED INTELLIGENT AGENT SOCIETIES Using Distributed Planners on Top of a Semantic Overlay Network

COORDINATION IN OPEN AND UNSTRUCTURED INTELLIGENT AGENT SOCI...

引用

2nd International Conference on Agents and Artificial Intelligence (ICAART 2010)

作者： Lopes, Antonio Luis Botelho, Luis Miguel Inst Telecomunicacoes Ave Rovisco Pais 1 P-1049001 Lisbon Portugal

ISBN: (纸本)9789896740221

Collaborative environments, where multiple heterogeneous agents (managing several resources) can cooperate in pursuing common and individual goals, are a step forward in creating real-world agent societies. However, current research in agent negotiation and in service coordination is still not enough for building such an agent-based society, capable of jointly solving complex planning problems and still achieve overall good performance. Most often, current work relies on either some centralised component or pre-defined social structure, which can compromise the system in terms of scalability, openness and robustness, and fails to address general problems. By using efficient network search algorithms and network evolution techniques it is possible to build and maintain a semantic overlay network from a totally unstructured distributed network, which in turn will simplify and optimize the distributed planning process amongst heterogeneous agents. We developed distributed versions of well-known planners that operate on top of the referred semantic overlay network and through a set of tests (using different scenarios) we were able to determine which is the best algorithm.

关键词： Multi-agent coordination planning algorithms Graphplan Peer-to-peer networks Semantic overlay networks

来源：评论

学校读者我要写书评

暂无评论

Automated Holistic Service Composition: Modeling and Composition Reasoning Techniques 24

Automated Holistic Service Composition: Modeling and Composi...

引用

24th IEEE International Conference on Web Services (ICWS)

作者： Zhu, Wei Bastani, Farokh Yen, I-Ling Fu, Jicheng Zhang, Yuqun Univ Texas Dallas Richardson TX 75083 USA Univ Cent Oklahoma Edmond OK USA SUSTech Shenzhen Peoples R China

ISBN: (纸本)9781538607527

Many real-world applications are complex, involving many user "choices", such as different functionalities, different ways to achieve a goal, etc. Conventional automated service composition models do not consider such potential choices, or simply consider them independently. Also, existing service composition models do not model exceptions and automated composition approaches require that after an exception, the original system goal should still be achieved. This may not be feasible for some exceptions. Thus, the service composition model should also consider alternate goals after exceptions occur. In this paper, we first define the concept of multi-functionality and develop a holistic service composition model. Since most existing composition reasoning techniques can only handle a single functionality, we extend them and develop new algorithms for automated holistic service composition. A case study system is used to illustrate how our approach automatically generates a holistic workflow for a system with multiple functionalities.

关键词： Service-oriented computing automated service composition planning algorithms multi-functionality systems

来源：评论

学校读者我要写书评

暂无评论

A Motion Blur Resilient Fiducial For Quadcopter Imaging 15

A Motion Blur Resilient Fiducial For Quadcopter Imaging

引用

IEEE Winter Conference on Applications of Computer Vision (WACV 2015)

作者： Prasad, Meghshyam G. Chandran, Sharat Brown, Michael S. Indian Inst Technol Dept Comp Sci & Engn Bombay Maharashtra India NUS Sch Comp Singapore Singapore

ISBN: (纸本)9781479966837

Fiducials are commonly placed in environments to provide a uniquely identifiable object in the scene. In quadcopter applications, these fiducials are often used to evaluate planning algorithms given that ground truth positions can be detected from the quadcopter's camera. Low cost quadcopters, however, are subject to quick and unstable motions that can cause significant motion blur that severely affects the detection rate of existing fiducials. This problem motivated us to design a fiducial that is robust to motion blur. Our proposed design uses concentric circles with the observation that the direction perpendicular to the motion blur direction will be relatively unaffected by the blur. As a result, an appropriate fiducial code orthogonal to the blur direction can be recognized. Since the direction of motion blur is unknown, the circular design is good for all motion blur directions. We describe the design of binary fiducials, and also a detection algorithm. We show that our marker can significantly outperform existing fiducials in scenes captured with a quadcopter.

关键词： helicopters image motion analysis image restoration planning ground truth positions motion blur resilient fiducial planning algorithms quadcopter imaging Algorithm design and analysis Binary codes Detection algorithms Pattern recognition Resistance Tracking Training data Detection algorithms Algorithm design and analysis motion blur image motion analysis binary code Helicopters Training data image restoration technique Quad Pill Pattern recognition tracking

来源：评论

学校读者我要写书评

暂无评论

The Combination of Searching algorithms with Sample-Based Planner in Solving 2D Robot Navigation Problems 3

The Combination of Searching Algorithms with Sample-Based Pl...

引用

3rd International Conference on Machine Learning, Big Data and Business Intelligence (MLBDBI)

作者： Cui, Junjie BASIS Int Sch Guangzhou Guangzhou Peoples R China

ISBN: (纸本)9781665417907

A* search or other nonuniform-cost searching algorithms are always combined with samplebased planners, such as probabilistic roadmap planner (PRM), to solve 2D navigation problems. However, the combination of uniform-cost searching algorithms and sample-based planners in solving these problems was not fully explored in the past. In this study, programs were implemented to allow the combination of PRM with A* search, breadth-first search, and depth-first search. After the searching algorithms were implemented, experiments were done to test the completeness, optimality, and time of the combinations of the algorithms. In the experiments, the programs were required to find a path for a robot to navigate from the start point to the endpoint in a 2D map with obstacles. This work found that the combination of PRM with A* search was not always complete, but the combinations of PRM with breadth-first search and depth-first search were always complete. After comparing the path planned by three different algorithms, it was determined that the combinations of PRM with breadth-first search and depth-first search were not always optimal, especially when the number of sample points was large. Consequently, A* search is still the most suitable searching algorithm for sample-based planners. This study well explained the shortcomings of combining uniform-cost search algorithms with sample-based planners.

关键词： robot navigation automated planning planning algorithms searching algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：