基于EON的虚拟化工场景优化技术的研究

利用虚拟现实技术实现化工场景,讨论了三维场景优化的技术,深入研究了场景优化技术中的LOD技术和多边形网格的简化方法.并将其作为离散LOD模型的生成方式.对于建模过程中出现的面数过多、场景巨大等问题,使用了可见性裁剪、模型简化与多分辨率造型等方法进行实验,利用EON软件对虚拟化工场景进行优化与漫游功能的实现,并提出了一种基于EON软件在视景系统中进行三维场景优化的方法.     

虚拟维修训练通用平台与EON接口实现

简要介绍了虚拟维修训练的发展现状及未来发展趋势,针对目前虚拟维修训练平台通用化程度偏低的现状,提出了某型虚拟维修训练通用平台与EON Studio接口设计的实现方法,使平台能够支持这款应用广泛的三维开发工具,最后以模型为例实现在平台上以EON为制作背景的训练操作,通过实例证明该方法能够很好的将EON融合到维修训练通用平台中去,丰富了训练手段,增强了虚拟维修训练平台的通用性。研究结果可作为其它软件在虚拟维修训练通用平台上接口实现的参考。     

“漫谈Web 3d”之大结局——Web 3D之Wiid Tangent，Atmosphere，EON Vkxoots

在上一期中，我们已经介绍了X3D、PowerSketch等技术，这期我们再来看一下面向在线游戏的Wild Tangent、平面软件资深开发公司Adobe的Atmo-sphere以及EON、Virtools等Web 3D的又一支力量。     

EON-传递电子化生活方式

IBM近期发布的全新EON(Edge of Network——网络边际)概念,在业界引起不小的波澜。EON是一个方针或宗旨,是指在目前和将来的电子商务环境下,PC产品正在不可避免地成为每个使用者接入网络的边缘设备;EON使计算“个人化”,能     

虚拟超市认知康复训练系统开发关键技术研究

基于EON Studio开发一个适用于脑卒中恢复期患者的虚拟超市认知康复训练系统,用于训练患者的上肢运动功能。在3DMAX中建立虚拟超市场景模型和虚拟手模型;通过VC++6.0开发在EON SDK中使用的 Glove和Tracker节点,以实现数据手套、位置跟踪器与系统的集成;研究了虚拟手抓取虚拟商品时的碰撞检测技术;定义虚拟手的抓取规则。临床实验表明,该系统不仅训练了患者的手指跟手臂的运动功能,也训练了患者的认知能力。     

基于词汇相似度的元素级本体匹配

随着语义Web的不断发展，本体数量日益增加。本体匹配作为本体映射、比较和集成的基础，具有重要的实际意义。由第3届国际语义Web大会(3th ISWC)主办的本体匹配竞赛(EON2004)对多种本体匹配工具进行比较和评估。该文提出了一种元素级本体匹配算法LANA(Lexical Analyzer)，该算法通过计算词汇相似度得到两本体间的元素匹配对。与EON2004中的其它元素级本体匹配方法相比，LANA在没有增加匹配复杂度的基础上，具有较好的准确率和召回率。     

Web 3D技术的应用比较

Web 3D技术有多种,都有适用的场合,介绍了有代表性的几种Web 3D技术;Vrml、Cortona、Wire Fusion、EON、Virtools、Quest3D、Flash 3D和Unity 3D,比较了它们各自的特点和应用。     

Web 3D技术的应用比较

Web 3D技术有多种,都有适用的场合,介绍了有代表性的几种Web 3D技术;Vrml、Cortona、Wire Fusion、EON、Virtools、Quest3D、Flash 3D和Unity 3D,比较了它们各自的特点和应用。     

IBM-EON亮相千禧年初

一部分将不安装微软的Windows操作系统,而代之以Linux的IBM最新款的商用PC——EON将于2000年年初亮相。这款电脑充分体现了个性化并对电子商务提供了多方面的支持.     

Evoking online consumer impulse buying through virtual layout schemes

Drawing upon the ‘stimulus-organism-response’ framework, this paper examines how the ease of navigation (EON) of a website affects consumers' online impulse buying. We also compared the effects of various virtual layouts (i.e. grid, freeform, racetrack, and mix grid–freeform) on consumers' perceptions of EON, emotional responses, and the urge to buy impulsively. Based on questionnaire responses from 216 participants in a stratified survey, we found that EON significantly influences consumers' emotional responses, pleasantness, and arousal, which subsequently affects their urge to buy impulsively. We also found that compared with the other three layouts, manifestations of navigability, freeform is the easiest to navigate, and is able to elicit the highest level of pleasantness and the strongest urge to buy impulsively. The findings of this study provide important implications for impulse buying research and practice.     

电路虚拟维修关键技术研究

利用3ds max建立三维模型,为虚拟维修提供操作对象;利用OrCAD建立电路仿真模型,为虚拟维修提供数据支撑;在EON Studio建立的虚拟场景中设置虚拟维修操作,并通过VB平台将电路仿真结果发送至虚拟场景中,实现对电子设备电路仿真结果的实时读取,为电子装备维修训练提供强有力的技术手段.     

节点与链路协同映射的生存性虚拟光网络映射算法

针对弹性光网络中单链路故障问题,提出一种基于匈牙利算法求解链路映射方案的节点与链路协同映射保护算法CMST-HA。将虚拟网络请求的节点与链路分别划分为主动类型与被动类型,把主动类型节点映射至邻接链路频谱资源丰富且邻接节点计算资源充足的物理节点上,在主动链路时使用匈牙利算法求解出最小映射开销方案并完成映射,确定被动节点的映射位置,利用KSP算法为被动链路选择映射路径,在此基础上为虚拟网络请求的最小生成树链路提供备份路径。仿真结果表明,与RVNM、CMST算法相比,CMST-HA算法不仅能够降低虚拟网络请求阻塞率,而且可增加物理网络收益。     

Distributed implementation of the adaptive kinetic Monte Carlo method

The program EON2 is a distributed implementation of the adaptive kinetic Monte Carlo method for long time scale simulations of atomistic systems. The method is based on the transition state theory approach within the harmonic approximation and the key step is the identification of relevant saddle points on the potential energy rim surrounding the energy minimum corresponding to a state of the system. The saddle point searches are carried out in a distributed fashion starting with random initial displacements of the atoms in regions where atoms have less than optimal coordination. The main priorities of this implementation have been to (1) make the code transparent, (2) decouple the master and slaves, and (3) have a well defined interface to the energy and force evaluation. The computationally intensive parts are implemented in C++, whereas the less compute intensive server-side software is written in Python. The platform for distributed computing is BOINC. A simulation of the annealing of a twist and tilt grain boundary in a copper crystal is described as an example application.     

A heuristic for placement of limited range wavelength converters in all-optical networks

Wavelength routed optical networks have emerged as a technology that can effectively utilize the enormous bandwidth of the optical fiber. Wavelength converters play an important role in enhancing the fiber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is a NP complete problem [K.C. Lee, V.O.K. Li, IEEE J. Lightwave Technol. 11 (1993) 962–970] in an arbitrary mesh network. In this paper, we investigate heuristics for placing limited range wavelength converters in arbitrary mesh wavelength routed optical networks. The objective is to achieve near optimal placement of limited range wavelength converters resulting in reduced blocking probabilities and low distortion of the optical signal. The proposed heuristic is to place limited range wavelength converters at the most congested nodes, nodes which lie on the long lightpaths and nodes where conversion of optical signals is significantly high. We observe that limited range converters at few nodes can provide almost the entire improvement in the blocking probability as the full range wavelength converters placed at all the nodes. Congestion control in the network is brought about by dynamically adjusting the weights of the channels in the link thereby balancing the load and reducing the average delay of the traffic in the entire network. Simulations have been carried out on a 12-node ring network, 14-node NSFNET, 19-node European Optical Network (EON), 28-node US long haul network, hypothetical 30-node INET network and the results agree with the analysis.     

Hop-Constrained Node Survivable Network Design: An Application to MPLS over WDM

In this paper, we address a hop-constrained node survivable network design problem that is defined in the context of multi-protocol label switching (MPLS) over wavelength division multiplexing (WDM) networks. At the lower WDM layer, we consider a maximum length constraint for optical connections between MPLS routers. At the upper MPLS layer, we consider survivability as well as maximum delay constraints. Survivability is guaranteed by routing each demand through D node-disjoint paths and maximum delay is guaranteed by constraining all paths to a maximum number of hops. An Integer Linear Programming model, based on the previous works by Gouveia et al. (Proc of IEEE INFOCOM, 2003, and Telecommunications network planning: innovations in pricing, network design and management, pp 167–180, 2006) is used to model the network design problem considering two different survivability mechanisms: path diversity (where each demand is equally split over the D paths) and path protection (where any D–1 out of the D paths have enough capacity to support the total demand). For both mechanisms, we use the NSFNet and EON real world networks to make a cost analysis of the design solutions for different values of D. In the path diversity mechanism, the results consistently show that greater values of D impose a cost penalty that is greater than the gain in the percentage of demand that is protected. In the path protection mechanism, where all traffic is totally protected, the results show that the network solutions obtained with D=3 node-disjoint paths have consistently lower costs than the network solutions obtained with D=2 node-disjoint paths. However, using values of D that are greater than 3 led to network solutions with larger costs. Supported by FCT project POCTI - ISFL - 1- 152.