用于移动设备人机交互的眼动跟踪方法

传统眼动跟踪设备构造复杂、体积和重量大,通常只能以桌面固定方式使用,无法支持普适计算环境下的移动式交互.为此,提出一种面向移动式交互的眼动跟踪方法,包括眼动图像处理、眼动特征检测、眼动数据计算和眼动交互应用4个层次.首先对眼球红外图像进行滤波、二值化处理,进而基于瞳孔-角膜反射法,结合二次定位和改进的椭圆拟合方法检测瞳孔,设计缩放因子驱动的模板匹配法检测普洱钦斑;在此基础上,计算注视点坐标等眼动数据;最后设计与开发了一个基于单个红外摄像头的头戴式眼动跟踪原型系统.实际用户测试结果表明,该系统舒适度适中,并具有较高精度和鲁棒性,从而验证了文中方法在移动式交互中的可行性和有效性.     

基于Python的藏文字母打字游戏App的设计和实现

用户在使用计算机的过程中，键盘的打字输入是必不可少的技能。针对藏文初学者学习藏文困难和乏味等问题，设计了藏文字母打字游戏。该平台能够有效激发藏文初学者对藏文字母的学习兴趣。从藏文字母入手，基于PyQt5框架使用Pycharm平台，设计了基于Python的藏文字母打字游戏。该游戏采用多线程、信号和槽的连接、计时器等技术，实现了时间和速度设置、界面交互以及字体下落等模块，大大提高了程序运行效率。通过游戏时间和速度的改变，增强了初学者对藏文字母的反应速度和打字的能力，实现了教育游戏化软件的设计。     

基于LSTM的眼动行为识别及人机交互应用

眼动交互在人机交互领域中有着广泛的应用前景,针对传统的眼动交互传感设备具有普遍侵入性,校准过程复杂且价格昂贵,普通单目摄像头传感器分辨率低等问题.提出一种基于前置摄像头视频源,使用方向梯度直方图（HOG）特征+SVM+LSTM神经网络的眼动行为识别方法,进而实现了简单的人机交互应用.该方法首先定位和跟踪人脸,在人脸对齐操作后依据4个眼角关键点的坐标获取双眼区域,使用SVM模型判断眼睛的睁闭眼及非眨眼状态,再分析相邻帧之间眼球中心的位置粗略判断眼动情况,将可疑的有意眼势帧间差分视频序列输入到LSTM网络中进行预测,输出眼动行为识别结果,进而触发计算机命令完成交互.经过自制数据样本集20 000个样本（其中约10%为负样本）测试,本文方法动态眨眼识别准确率优于95%,眼动行为预测准确率为99.3%.     

应用最大熵马尔可夫模型标注阅读眼动序列

人在阅读过程中的眼球运动具有一定规律,阅读眼动模型有助于人们更好地理解和认知这些规律。针对现有阅读眼动模型建模方法复杂的问题,突破传统阅读眼动模型注视粒度处理和回视处理模式,提出了基于单词的阅读眼动注视粒度处理模式和基于熟练读者的阅读眼动回视处理模式,利用阅读眼动注视序列标注与自然语言序列标注的高度相似性,形成了阅读眼动注视序列标注方法,从而把复杂的阅读眼动建模过程转化成了简单的语言序列标注过程,并使用最大熵马尔可夫模型实现了所提出的方法。实验结果表明,所提出的方法可以较好地描述阅读眼动任务,并且较易用机器学习模型进行实现。     

多用户眼动跟踪数据的可视化共享与协同交互

随着数字图像处理技术的发展,以及计算机支持的协同工作研究的深入,眼动跟踪开始应用于多用户协同交互.但是已有的眼动跟踪技术主要针对单个用户,多用户眼动跟踪计算架构不成熟、标定过程复杂,眼动跟踪数据的记录、传输以及可视化共享机制都有待深入研究.为此,建立了基于梯度优化的协同标定模型,简化多用户的眼动跟踪标定过程;然后提出面向多用户的眼动跟踪计算架构,优化眼动跟踪数据的传输和管理.进一步地,探索眼动跟踪数据的可视化形式在协同交互环境下对用户视觉注意行为的影响,具体设计了圆点、散点、轨迹这3种可视化形式,并验证了圆点形式能够有效地提高多用户协同搜索任务的完成效率.在此基础上,设计与开发了基于眼动跟踪的代码协同审查系统,实现了代码审查过程中多用户眼动跟踪数据的同步记录、分发,以及基于实时注视点、代码行边框和背景灰度、代码行之间连线的可视化共享.用户实验结果表明,代码错误的平均搜索时间比没有眼动跟踪数据可视化分享时减少了20.1%,显著提高了协同工作效率,验证了该方法的有效性.     

桌面虚拟装配系统中眼动跟踪技术的应用

人机交互是虚拟装配的本质特性和技术瓶颈,本文分析了中虚拟装配中的眼动特征,提出了基于空间和情景的眼动模式;将眼动跟踪与直接操作相结合,研究了眼动跟踪技术在桌面虚拟装配系统中的应用。     

基于曲线拟合和SVM的眼动信号分类算法研究

为提高基于EOG的眼动信号分类算法精度,改进基于EOG的人—机交互系统性能,提出了一种基于曲线拟合(curve fitting)与支持向量机(SVM)的眼动信号分类算法(CF-SVM),并设计了新的实验范式,增加了“扫视保持”环节.该算法采用曲线拟合方法进行特征提取,在此基础上,使用SVM分类器对眼动信号进行分类.实验室环境下,对9名眼部活动正常的受试者进行了眼动数据采集与识别,CF-SVM算法的平均分类准确率达到98.3％,与其他几种眼动识别方法相比较,其平均正确率分别提升了9.4％、5.9％、1.0％.实验结果表明,CF-SVM算法在眼动信号识别中表现了良好的性能,具有高的分类精度和鲁棒性.     

简单计算机视频游戏引擎的设计及应用

由于传统的计算机游戏设计方法在维护与更新上有很大的局限性，而计算机游戏引擎是将具有共性的游戏功能抽象、独立出采，形成一个通用的、独立于具体游戏逻辑的框架，是一个游戏的心脏．可以驱动游戏的运行。同时设计了一个简单计算机视频游戏引擎，包括图形引擎、声音引擎、交互引擎、网络引擎等。该游戏引擎依附于一个宿主游戏主程序，可以设计游戏基本对象以度游戏环境所需的对象管理器、资源管理器、系统对象等。该游戏引擎具有很好的可扩展性，可以添加新组件，支持更丰富、更实用的功能。     

基于心智模型的儿童移动端编程平台研究

针对移动端市场,虽然培养儿童编程思维平台的种类比较繁多,但是由于对儿童认知心理学的忽视以及平台界面展示形式的单一,导致此类软件平台的儿童体验较差。因此,提出一种基于心智模型的游戏编程创作平台。在符合儿童心理学的基础上,结合心智模型分析儿童的需求,来设计平台交互界面,使得按钮、图片等元素不仅简单易懂,并且可以极大地吸引儿童的注意。与此同时,为了能让儿童快速地设计出具备简单交互功能的游戏,提出一种基于单链表结构的交互逻辑表达方法。在该平台中,儿童只需要拖拽图形元素,并设置其相关参数就可以完成游戏的开发。实验表明,该平台具有良好的实用性,大部分儿童都可以快速地开发出具有简单交互功能的游戏。该平台不仅调动了儿童主动交互的积极性,而且也提高了人机交互的易用性。     

基于多模态感官体验的儿童音画交互设计研究

为解决儿童图画教育的单一灌输形式和传统图画绘制方式引起的儿童思维受限、互动不足等问题，构建基于多模态感官体验的儿童音画交互系统。该系统基于儿童感官行为能力特征，融合视听感官属性并根据交互设计中人与物的关系匹配儿童音画交互的设计需求，构建儿童音画交互行为；应用可视化技术方法，建立声音与图画的映射和儿童音画交互平台。通过创新绘画体验，使儿童音画创作方式更加丰富、多元，扩展儿童认知能力边界。运用模糊德尔菲法收集和筛选影响儿童绘画的指标因素并确定发声绘画体验指标模型，模糊层次分析法计算各项指标要素权重，采用访谈形式结合模糊综合评价进行儿童用户相关实验，验证平台的可行性。以儿童发声作为图画创作的介质，改变传统图画手、脑、眼并用的绘制方式，从而优化儿童的绘画互动体验与提高图画创作兴趣。     

A technique for monitoring SO2 in combustion exhausts: Use of a non-Nernstian sensing element in combination with an upstream catalytic filter

Detection of sulfur dioxide (SO₂) at high temperature (600–750 °C) in the presence of some interferents found in combustion exhausts (NO₂, NO, CO₂, CO, and hydrocarbon (C₃H₆)) is described. The detection scheme involves use of a catalytic filter in front of a non-Nernstian (mixed-potential) sensing element. The catalytic filter was a Ni:Cr powder bed operating at 850 °C, and the sensing elements were pairs of platinum (Pt) and oxide (Ba-promoted copper chromite ((Ba,Cu)_xCr_yO_z) or Sr-modified lanthanum ferrite (LSF)) electrodes on yttria-stabilized zirconia. The Ni:Cr powder bed was capable of reducing the sensing element response to NO₂, NO, CO, and C₃H₆, but the presence of NO₂ or NO (“NO_x”, at 100 ppm by volume) still interfered with the SO₂ response of the Pt–(Ba,Cu)_xCr_yO_z sensing element at 600 °C, causing approximately a 7 mV (20%) reduction in the response to 120 ppm SO₂ and a response equivalent to about 20 ppm SO₂ in the absence of SO₂. The Pt–LSF sensing element, operated at 750 °C, did not suffer from this NO_x interference but at the cost of a reduced SO₂ response magnitude (120 ppm SO₂ yielded 10 mV, in contrast to 30 mV for the Pt-(Ba,Cu)_xCr_yO_z sensing element). The powder bed and Pt–LSF sensing element were operated continuously over approximately 350 h, and the response to SO₂ drifted downward by about 7%, with most of this change occurring during the initial 100 h of operation.     

Constructing the nearly shortest path in crossed cubes

A graph G is panconnected if each pair of distinct vertices u,v∈V(G) are joined by a path of length l for all d_G(u,v)?l?|V(G)|-1, where d_G(u,v) is the length of a shortest path joining u and v in G. Recently, Fan et. al. [J. Fan, X. Lin, X. Jia, Optimal path embedding in crossed cubes, IEEE Trans. Parall. Distrib. Syst. 16 (2) (2005) 1190-1200, J. Fan, X. Jia, X. Lin, Complete path embeddings in crossed cubes, Inform. Sci. 176 (22) (2006) 3332-3346] and Xu et. al. [J.M. Xu, M.J. Ma, M. Lu, Paths in Möbius cubes and crossed cubes, Inform. Proc. Lett. 97 (3) (2006) 94-97] both proved that n-dimensional crossed cube, CQ_n, is almost panconnected except the path of length d_CQn(u,v)+1 for any two distinct vertices u,v∈V(CQ_n). In this paper, we give a necessary and sufficient condition to check for the existence of paths of length d_CQn(u,v)+1, called the nearly shortest paths, for any two distinct vertices u,v in CQ_n. Moreover, we observe that only some pair of vertices have no nearly shortest path and we give a construction scheme for the nearly shortest path if it exists.     

Influence of doping BiYO3 and Nb2O5 on PTCR characteristics of BaTiO3 thermistor ceramics

Nb₂O₅-doped (1 − x)Ba_0.96Ca_0.04TiO₃-xBiYO₃ (where x = 0.01, 0.02, 0.03 and 0.04) lead-free PTC thermistor ceramics were prepared by a conventional solid state reaction method. X-ray diffraction, scanning electron microscope, Agilent E4980A and resistivity-temperature measurement instrument, were used to characteristic the lattice distortion, microstructure, temperature dependence of permittivity and resitivity-temperature dependence. It was revealed that the tetragonality c/a of the perovskite lattice, the microstructure and the Curie temperature changed with the BiYO₃ content. In order to decrease the room temperature resistivity, the effect of Nb₂O₅ on the room temperature resistivity was also studied, and its optimal doping content was finally chosen as 0.2 mol%. The 0.97Ba_0.96Ca_0.04TiO₃-0.03BiYO₃-0.002Nb₂O₅ thermistor ceramic exhibited a low ρ_RT of 3.98 × 10³ Ω cm, a typical PTCR effect of ρ_max/ρ_min > 10³ and a T_c of 153 °C.     

UNIQUENESS CONDITIONS OF CL-STRUCTURES IN GL-STRUCTURE EQUIVALENCE CLASSES OF SYSTEM RECONSTRUCTABILITY ANALYSIS

This paper first introduces the basic notions of overall systems with logical relations, their subsystems, structure representation graphs, sets of H-structures and G-structures with logical relations S _H ^L and S _G ^L, immediate refinement and aggregate with logical relations, structure-graph mappings r_V ^L, r_G ^L, etc., and the notions of inclusiveness with logical relations, upper bounding and lower bounding with logical relations. Then it proves the sufficient conditions under which representation graphs R ^L form a lattice. By defining the least upper bound and largest lower bound of (R^L, ) and recommending a lemma on distributivity, this paper proves the sufficient conditions under which G-structures with logical relations form Boolean lattices. Finally after defining the M-structures and C-structures with logical relations, i.e. M-structures and C-structures, this paper proposes the sufficient conditions for the uniqueness of C-structures in G-structure equivalence classes, and proves that the C ^L-structure is the least refined GL-structure in equivalence class S _G ^L/r _G ^L.     

A rounding algorithm for approximating minimum Manhattan networks

For a set T$T$ of n$n$ points (terminals) in the plane, a Manhattan network   on T$T$ is a network N(T)=(V,E)$N\left(T\right)=(V,E)$ with the property that its edges are horizontal or vertical segments connecting points in V⊇T$V\supseteq T$ and for every pair of terminals, the network N(T)$N\left(T\right)$ contains a shortest _l1$l_1$-path between them. A minimum Manhattan network   on T$T$ is a Manhattan network of minimum possible length. The problem of finding minimum Manhattan networks has been introduced by Gudmundsson, Levcopoulos, and Narasimhan [J. Gudmundsson, C. Levcopoulos, G. Narasimhan, Approximating a minimum Manhattan network, Nordic Journal of Computing 8 (2001) 219–232. Proc. APPROX’99, 1999, pp. 28–37] and its complexity status is unknown. Several approximation algorithms (with factors 8, 4, and 3) have been proposed; recently Kato, Imai, and Asano [R. Kato, K. Imai, T. Asano, An improved algorithm for the minimum Manhattan network problem, ISAAC’02, in: LNCS, vol. 2518, 2002, pp. 344–356] have given a factor 2-approximation algorithm, however their correctness proof is incomplete. In this paper, we propose a rounding 2-approximation algorithm based on an LP-formulation of the minimum Manhattan network problem.     

Restricted arc-connectivity of digraphs

Since interconnection networks are often modeled by graphs or digraphs, the edge-connectivity of a graph or arc-connectivity of a digraph are important measurements for fault tolerance of networks.The restricted edge-connectivity λ^′(G) of a graph G is the minimum cardinality over all edge-cuts S in a graph G such that there are no isolated vertices in G−S. A connected graph G is called λ^′-connected, if λ^′(G) exists.In 1988, Esfahanian and Hakimi [A.H. Esfahanian, S.L. Hakimi, On computing a conditional edge-connectivity of a graph, Inform. Process. Lett. 27 (1988), 195-199] have shown that each connected graph G of order n?4, except a star, is λ^′-connected and satisfies λ^′(G)?ξ(G), where ξ(G) is the minimum edge-degree of G.If D is a strongly connected digraph, then we call in this paper an arc set S a restricted arc-cut of D if D−S has a non-trivial strong component D₁ such that D−V(D₁) contains an arc. The restricted arc-connectivity λ^′(D) is the minimum cardinality over all restricted arc-cuts S.We observe that the recognition problem, whether λ^′(D) exists for a strongly connected digraph D is solvable in polynomial time. Furthermore, we present some analogous results to the above mentioned theorem of Esfahanian and Hakimi for digraphs, and we show that this theorem follows easily from one of our results.     

On path bipancyclicity of hypercubes

Assume that P is any path in a bipartite graph G of length k with 2?k?h, G is said to be h-path bipancyclic if there exists a cycle C in G of every even length from 2k to |V(G)| such that P lies in C. Based on Lemma 5, the authors of [C.-H. Tsai, S.-Y. Jiang, Path bipancyclicity of hypercubes, Inform. Process. Lett. 101 (2007) 93-97] showed that the n-cube Qn with n?3 is (2n−4)-path bipancyclicity. In this paper, counterexamples to the lemma are given, therefore, their proof fails. And we show the following result: The n-cube Qn with n?3 is (2n−4)-path bipancyclicity but is not (2n−2)-path bipancyclicity, moreover, and a path P of length k with 2?k?2n−4 lies in a cycle of length 2k−2 if and only if P contains two edges of dimension i for some i, 1?i?n. We conjecture that if 2n−4 is replaced by 2n−3, then the above result also holds.     

Forest carbon densities and uncertainties from Lidar, QuickBird, and field measurements in California

Greenhouse gas inventories and emissions reduction programs require robust methods to quantify carbon sequestration in forests. We compare forest carbon estimates from Light Detection and Ranging (Lidar) data and QuickBird high-resolution satellite images, calibrated and validated by field measurements of individual trees. We conducted the tests at two sites in California: (1) 59 km² of secondary and old-growth coast redwood (Sequoia sempervirens) forest (Garcia-Mailliard area) and (2) 58 km² of old-growth Sierra Nevada forest (North Yuba area). Regression of aboveground live tree carbon density, calculated from field measurements, against Lidar height metrics and against QuickBird-derived tree crown diameter generated equations of carbon density as a function of the remote sensing parameters. Employing Monte Carlo methods, we quantified uncertainties of forest carbon estimates from uncertainties in field measurements, remote sensing accuracy, biomass regression equations, and spatial autocorrelation. Validation of QuickBird crown diameters against field measurements of the same trees showed significant correlation (r = 0.82, P < 0.05). Comparison of stand-level Lidar height metrics with field-derived Lorey's mean height showed significant correlation (Garcia-Mailliard r = 0.94, P < 0.0001; North Yuba R = 0.89, P < 0.0001). Field measurements of five aboveground carbon pools (live trees, dead trees, shrubs, coarse woody debris, and litter) yielded aboveground carbon densities (mean ± standard error without Monte Carlo) as high as 320 ± 35 Mg ha^− 1 (old-growth coast redwood) and 510 ± 120 Mg ha^− 1 (red fir [Abies magnifica] forest), as great or greater than tropical rainforest. Lidar and QuickBird detected aboveground carbon in live trees, 70-97% of the total. Large sample sizes in the Monte Carlo analyses of remote sensing data generated low estimates of uncertainty. Lidar showed lower uncertainty and higher accuracy than QuickBird, due to high correlation of biomass to height and undercounting of trees by the crown detection algorithm. Lidar achieved uncertainties of < 1%, providing estimates of aboveground live tree carbon density (mean ± 95% confidence interval with Monte Carlo) of 82 ± 0.7 Mg ha^− 1 in Garcia-Mailliard and 140 ± 0.9 Mg ha^− 1 in North Yuba. The method that we tested, combining field measurements, Lidar, and Monte Carlo, can produce robust wall-to-wall spatial data on forest carbon.     

Constructing a Tree from Homeomorphic Subtrees, with Applications to Computational Evolutionary Biology

This paper discusses how to count and generate strings that are ``distinct' in two senses: p -distinct and b -distinct. Two strings x on alphabet A and x' on alphabet A' are said to be p -distinct iff they represent distinct ``patterns'; that is, iff there exists no one—one mapping from A to A' that transforms x into x' . Thus aab and baa are p -distinct while aab and ddc are p -equivalent. On the other hand, x and x' are said to be b -distinct iff they give rise to distinct border (failure function) arrays: thus aab with border array 010 is b -distinct from aba with border array 001 . The number of p -distinct (resp. b -distinct) strings of length n formed using exactly k different letters is the [k,n] entry in an infinite p' (resp. b' ) array. Column sums p[n] and b[n] in these arrays give the number of distinct strings of length n . We present algorithms to compute, in constant time per string, all p -distinct (resp. b -distinct) strings of length n formed using exactly k letters, and we also show how to compute all elements p'[k,n] and b'[k,n] . These ideas and results have application to the efficient generation of appropriate test data sets for many string algorithms. Received December 21, 1995; revised April 28, 1997.