Assessment of a simple obstacle detection device for the visually impaired

A simple obstacle detection device, based upon an automobile parking sensor, was assessed as a mobility aid for the visually impaired. A questionnaire survey for mobility needs was performed at the start of this study. After the detector was developed, five blindfolded sighted and 15 visually impaired participants were invited to conduct travel experiments under three test conditions: (1) using a white cane only, (2) using the obstacle detector only and (3) using both devices. A post-experiment interview regarding the usefulness of the obstacle detector for the visually impaired participants was performed. The results showed that the obstacle detector could augment mobility performance with the white cane. The obstacle detection device should be used in conjunction with the white cane to achieve the best mobility speed and body protection.     

红外激光笔遥指虚拟触摸系统

为了在商务、会议、教学演示过程中使用激光笔实现除上下翻页之外的点击功能,设计一种红外激光笔遥指虚拟触摸系统.使用者手持红外激光笔对任意的显示屏进行远距离触摸指示和点击控制,由图像获取装置拍摄显示屏,获取包括红外激光笔发出的红外激光点在内的显示屏图像,再由图像处理模块处理显示屏图像识别出红外激光点及其在显示屏中的位置,根据红外激光点的时间长短和次数区分鼠标移动、鼠标单击,鼠标双击等操作类型,并控制计算机系统在显示屏对应位置上显示出表示光点的光标图形,完成相应操作,实现虚拟触摸功能.     

基于改进马尔可夫链的航线预测算法

在交通领域,研究分析旅客的出行目的地会产生很多商业价值。针对旅客出行目的地的不确定性造成研究困难的问题,现有方法利用熵衡量移动的不确定性来描述个体的出行特性,并同时考虑个体轨迹的时空相关性,并不能达到理想的预测精度,因此,提出了基于改进马尔可夫链的航线预测算法来对旅客的出行目的地进行预测。首先对旅客历史出行的距离分布、地点分布和时间规律特性进行了分析;然后又分析了人类移动对历史行为和当前地点的依赖性;最后将旅客的常住地特性和新航线的探索概率加入到转移矩阵的计算中,提出并实现了改进的马尔可夫链航线预测算法,进而对旅客的下一次出行进行预测。实验结果显示,该模型可以达到66.4%的平均预测精度。研究成果可以应用在航空领域的用户出行分析中,使航空公司更好地了解和预测旅客的出行,提供个性化的出行服务。     

个性化三维虚拟试衣系统研究

为满足用户对虚拟试衣的个性化需求和提高虚拟试衣体验，提出一种包括自动化蒙皮、基于单张图片人脸三维自动重建、人体参数化变形以及服装模型穿透处理等模块的个性化虚拟试衣系统。设计了自动化蒙皮算法，解决已有虚拟试衣服装模型制作成本高的问题；通过基于单张图片的三维人脸自动重建和人体参数化变形，满足消费者个性化需求;运用基于自动透明贴图计算的服装穿透处理方法，改进系统试衣效果。实验表明，所提出的系统能够以较低的构建与运行成本实现较好的试衣效果，提供良好的个性化虚拟试衣体验。     

A new memory allocation method for shared memory multiprocessors with large virtual address space

This paper proposes a new memory allocation method for shared memory multiprocessors with large virtual address spaces. An evaluation of its performance is also presented. For effective use of shared memory multiprocessors, it is important that no processor's execution is blocked. If several processors simultaneously access a shared variable, their processes are blocked and access to the variable is serialized. Thus, frequent access to shared variables reduces the parallelism. In particular, the parallelism is significantly reduced when a special shared variable – the ‘allocation pointer’ – is frequently accessed in the dynamic object allocation by an application program. In this paper, we propose a new method for allocating physical memory pages where the allocation pointer is monotonically increased in the virtual address space in contrast to the conventional method. This allows the critical sections for access to the allocation pointer to be executed effectively and atomically by using the fetch-and-add primitive. Our method improves the application program's parallelism by access to the allocation pointer with considerably short blocking time to the process. © 1997 John Wiley & Sons, Ltd.     

Personality assessment using multiple online social networks

Personality plays an important role in various aspects of our daily life. It is being used in many application scenarios such as i) personalized marketing and advertisement of commercial products, ii) designing personalized ambient environments, iii) personalized avatars in virtual world, and iv) by psychologists to treat various mental and personality disorders. Traditional methods of personality assessment require a long questionnaire to be completed, which is time consuming. On the other hand, several works have been published that seek to acquire various personality traits by analyzing Internet usage statistics. Researchers have used Facebook, Twitter, YouTube, and various other websites to collect usage statistics. However, we are still far from a successful outcome. This paper uses a range of divergent features of Facebook and LinkedIn social networks, both separately and collectively, in order to achieve better results. In this work, the big five personality trait model is used to analyze the five traits: openness to experience, conscientiousness, extroversion, agreeableness, and neuroticism. The experimental results show that the accuracy of personality detection improves with the use of complementary features of multiple social networks (Facebook and LinkedIn, in our case) for openness, conscientiousness, agreeableness, and neuroticism. However, for extroversion we found that the use of only LinkedIn features provides better results than the use of only Facebook features or both Facebook and LinkedIn features.     

嵌入式环境指针式仪表快速识别算法研究

论文在对已有的各种使用图像处理手段进行仪表指针识别方案进行研究的基础上,根据工控环境中指针式仪表所具有特点,设计了基于多分辨率处理、霍夫变换的快速、准确的指针识别算法,该算法是已有识别方案的改进与融合。为了对算法性能进行测试,论文在所提算法的基础上,设计了简单并且容易部署的指针识别系统。识别系统的运行数据证明,论文所提算法可在资源有限的嵌入式系统中对工控环境中的指针式仪表读数进行快速而准确的识别。     

DLS: A dynamic local stitching mechanism to rectify transmitting path fragments in wireless sensor networks

In this paper, a pair of novel rectification algorithms (greedy negative pressure push algorithm and dynamic local stitching algorithm) is proposed to cooperatively repair broken transmitting paths in Wireless Sensor Networks. Our approach is to overcome the poor data validity in WSNs, specifically for harsh application environments – such as unattended sensor nodes or frail wireless transmitting channels – where fault tolerant becomes a vital aspect. Using adjacency information, Greedy negative pressure push algorithm can efficiently grow the transmitting path to achieve the minimum energy consumption for relays model. Here, we measured packet travel time and the expectation of relay distance to set this model's key parameters to achieve the lowest possible end-to-end transmitting delay. Dynamic local stitching algorithm has a major difference with other existing routing algorithms in rectifying broken paths; despite others that reroute whole paths, our algorithms only stitch broken fragments of the original path spending minimum amount of energy as well as recovery time. Based on mathematical computing and simulation, our novel rectification algorithm could effectively (1) reduce the total number of routing overheads, (2) improve net throughput, and (3) increase system fault tolerant much better than four already designed routing algorithms. Results were also very promising to motivate other algorithms in this field.     

Android平台基于Google Map Api的导航应用技术研究和实现

Google公司于2007年11月发布Android系统以来,短短四年时间,Android已经占据了智能手机市场的半壁江山,是目前最为炙手可热的智能手机操作系统。Android走进了越来越多人的生活,成为他们获取信息主要设备。随着拥有私家车的家庭越来越多,大部分司机朋友都希望能接收到导航服务,为自己的旅程提供准确便利的信息。除了购买导航仪以外,导航软件的出现为司机朋友增加了一个选择,通过手机就能实现导航功能,不但节省了一笔导航仪的费用,还能为获得除了导航服务以外的更多信息。目前市面上大部分导航软件都存在如占用空间大,地图数据不全面等弊端,一部分用户体验可能就不是很好。Google Map作为最先推出的网上地图,各种数据信息最为全面和准确,本系统通过Google Map Api设计一个能够实现定位、导航和交通信息发布等等功能的在线导航软件。在Android设备上具有良好的用户界面、响应速度和用户体验。     

User-adapted travel planning system for personalized schedule recommendation

Recently, the Internet has made a lot of services and products appear online provided by many tourism sectors. By this way, many information such as timetables, routes, accommodations, and restaurants are easily available to help travelers plan their travels. However, how to plan the most appropriate travel schedule under simultaneously considering several factors such as tourist attractions visiting, local hotels selecting, and travel budget calculation is a challenge. This gives rise to our interest in exploring the recommendation systems with relation to schedule recommendation. Additionally, the personalized concept is not implemented completely in most of travel recommendation systems. One notable problem is that they simply recommended the most popular travel routes or projects, and cannot plan the travel schedule. Moreover, the existing travel planning systems have limits in their capabilities to adapt to the changes based on users’ requirements and planning results. To tackle these problems, we develop a personalized travel planning system that simultaneously considers all categories of user requirements and provides users with a travel schedule planning service that approximates automation. A novel travel schedule planning algorithm is embedded to plan travel schedules based on users’ need. Through the user-adapted interface and adjustable results design, users can replace any unsatisfied travel unit to specific one. The feedback mechanism provides a better accuracy rate for next travel schedule to new users. An experiment was conducted to examine the satisfaction and use intention of the system. The results showed that participants who used the system with schedule planning have statistical significant on user satisfaction and use intention. We also analyzed the validity of applying the proposed algorithm to a user preference travel schedule through a number of practical system tests. In addition, comparing with other travel recommendation systems, our system had better performance on the schedule adjustment, personalization, and feedback giving.     

Assembly simulations in virtual environments with optimized haptic path and sequence

Virtual assembly and disassembly simulations can be accomplished in intuitive and effective ways using haptic information in virtual environments (VEs). Potential problems in a given assembly scheme can be predicted by a user who may be able to suggest an alternative scheme in the VE. This paper describes an intelligent virtual assembly system in which an optimal assembly algorithm is used to allow haptic interactions during virtual assembly operations. This algorithm provides optimal paths for haptic guidance as well as an assembly sequence of the parts to be assembled. The performance of the given assembly schemes was simulated using a virtual assembly system. Experimental results showed that the haptic-path sequence-guidance (HSG) mode gave the best performance improvement in terms of accumulated assembly time (28.33%) and travel distance (15.05%) compared to the unguided mode, while the sequence-guidance (SG) mode alone increased performance by 15.33% for assembly time and 11.36% for travel distance. The experimental results were analyzed by the sub-tasks of gripper selection, inter-part movement, and part assembly. For the HSG mode, the greatest contributor to the time and distance reductions was the optimized haptic path, while for the SG mode, the reduced numbers of gripper exchanges and orientation change made the greatest contributions to reducing the assembly time and the travel distance. As a result, the optimized haptic path, as well as sequence guidance, enhanced the working performance of virtual assembly tasks.     

指针式仪表读数的机器视觉智能识别方法

为快速准确地自动识别指针式仪表读数,采用机器视觉技术,结合减影法和Hough变换法对仪表读数进行智能识别.对指针式仪表图像进行图像二值化、形态学处理和边缘检测预处理;利用Hough变换检测仪表中的指针,计算得到指针方向和定位圆形,实现指针式仪表的智能识别.实验结果表明:读数识别的平均相对误差为0.91%,精度较高,能较好地识别指针式仪表读数.     

虚拟仪器开发环境的比较研究

虚拟仪器开发环境非常多,需要十分慎重取舍才能获得最佳效果.为使虚拟仪器开发者能更快更高效地选择适当的开发环境,对当前流行的各种开发环境进行了分类、分析和比较研究.首先将其总体分为两类:基于通用编程软件和基于图形化语言,然后根据各类开发环境在虚拟仪器开发方面的特点进行论述,同时给出了一个相关实例,最后得出对于虚拟仪器的开发,常需要根据开发项目的实际,结合各种开发环境各自的优势进行混合编程,方可达到良好的效果.     

改进Faster R-CNN的汽车仪表指针实时检测

针对产业化的汽车仪表指针人工视觉检测效果差、检测速度慢和实时性低等问题,本文提出了一种改进的Faster R-CNN汽车仪表指针实时检测算法。通过改进原始的RoI网络层结构,实现小目标高低层特征之间的完整传递;采用双线性内插算法替代两次量化操作,使得特征聚集变成连续的过程,能够有效减少计算时间;最后将工业机采集的视频数据,预处理成VOC格式数据集进行训练,调整超参数得到改进汽车仪表指针检测模型。实验结果表明:所提出的方法能够快速、准确地实现汽车仪表指针检测,单张图片的平均检测时间为0.197 s,平均检测精度可达92.7%。在不同类别仪表指针的迁移实验中,展示了良好的泛化性能。     

基于扫描线处理的指针式仪表快速读数算法

针对光照不均匀、指针检测速度过慢等因素造成指针式仪表读数算法无法快速、准确读取示数的问题,提出一种基于扫描线处理的快速准确读数新算法。新算法首先利用单尺度Retinex提取光照鲁棒性特征图像,然后应用提出的扫描线处理算法快速抽取进行Hough变换的特征像素点,最后用双阈值Hough变换检测直线。实验表明,所提算法创新性地将指针图像细化与双阈值Hough变换等相结合,不仅解决了光照变化的影响以及检测速度慢等问题,而且具有读数精度高、读取速度可调节等特点。     

基于USB摄像头的激光笔辅助教学系统的设计与实现

实现一个利用激光笔与投影仪大屏幕进行互动的辅助教学系统。首先,通过USB摄像头检测激光亮点在屏幕上的位置。然后,通过计算机上的相应算法实现无线鼠标的功能,激光点轨迹的绘制,放大屏幕上的重要区域,清屏以及幻灯片的上下翻页功能。专门为这套辅助教学系统设计的激光笔使得教师在课堂里实现这种互动更为灵敏和连续。     

全数字化车辆仪表的应用研究

提出了一种新型全数字化车辆仪表系统,该数字化仪表系统采用嵌入式计算机技术,用虚拟仪表形式取代传统的指针式仪表。系统具有测量精度高,记录信息量大,显示清晰直观、车辆电子地图定位以及预设路线行进的特点;特别是具有存储、故障追忆功能,可以实时监测、记录车辆的状态,便于驾驶员及时了解车辆运行情况。本研究主要用于坦克和装甲车辆,并已进行了样车试运行,运行结果表明,系统达到了设计要求。     

QoS-aware downlink packet scheduling for LTE networks

Scheduling for flows has been studied before. However, applying the previous schemes directly for LTE networks may not achieve good performance. To have good performance, both frequency domain allocations and time domain allocations for LTE resource blocks are suggested. Our method is suitable for real-time services and it consists of three phases. In frequency domain we design our method to utilize the RBs effectively. In time domain we first manage queues for different applications and propose a mechanism for predicting the packet delays. We introduce the concept of virtual queue to predict the behavior of future incoming packets based on the packets in the current queue. Then based on the calculated results, we introduce a cut-in process to rearrange the transmission order and discard those packets which cannot meet their delay requirements. We compare our scheduling mechanism with maximum throughput, proportional fair, modified largest delay first and exponential proportional fair. Simulation results show our scheduling method can achieve better performance than other schemes.     

C＋＋对象的持久化中的问题和解决方案

多媒体智能数据库系统ＭＩＤＳ（ｍｕｌｔｉｍｅｄｉａｉｎｔｅｌｌｉｇｅｎｔｄａｔａｂａｓｅｓｙｓｔｅｍ）是一个对象数据库管理系统．它的数据库编程语言是Ｐ＋＋，Ｐ＋＋个语言是一种基于Ｃ＋＋的语言．作者在Ｐ＋＋的实现过程中遇到了以下问题：首先，Ｃ＋＋的指针有二义性，它无法在语义上区分成员指针和引用指针，以及易失性指针和持久性指针，从而给事务管理中的对象加锁及其它方面带来问题．其次，具有虚拟函数或虚拟基类的对象中含有指向内存中的指针，而这些指针不是由程序员定义的．如果Ｃ＋个对象被持久化，这些指针在不同的程序调用中有可能无效．最后，如果作者用文件系统调用来存储对象，那么必须要设计复杂的Ｃａｃｈｅ系统和做大量对象的格式转化工作，这需要大量的空间和时间，所以他们采用了另外的一种方法──基于虚拟内存空间映射的存储方案．     

The Torus Treadmill: realizing locomotion in VEs

Locomotion in virtual environments (VEs) remains one of the major problems in current virtual reality research. The most intuitive way to move about the real world is to travel on foot. People often feel a better sense of distance or direction while walking than while riding in a vehicle. This article discusses the development of a locomotion device that provides a sense of walking. In terms of natural interaction, the physical exertion of walking proves essential to locomotion. The research of my colleagues and I aims to give users a sense of walking while their position remains localized in the physical world. We've developed several prototypes of interface devices for walking. From the results of our research, we concluded that an infinite surface would offer an ideal means for giving people a sense of walking. Our device, called the Torus Treadmill, uses a torus-shaped surface to realize the locomotion interface. The surface employs 12 sets of treadmills connected side-by-side and driven in a perpendicular direction. These treadmills generate an infinite surface. We measured the motion of the users' feet with magnetic sensors. The floor moves in the opposite direction of the walker, canceling the motion of each step. The walker's position remains localized in the real world by this computer-controlled motion of the floor. The walker can freely change direction. An image of the virtual space appears in a head-mounted display corresponding to the walker's virtual position