Same-different reaction time to stimuli presented simultaneously to separate cerebral hemispheres

This research was concerned with same-different reaction time to two stimuli presented simultaneously, one to the left and one to the right visual field, so that they projected to separate cerebral hemispheres. In experiment 1, subjects compared two colour patches, two colour words, or a colour word with a colour patch. In experiment 2, subjects compared two geometric shapes, two shape words, or a geometric shape with a shape word. Comparisons of two colours or two shapes were faster than comparisons of words that named these attributes. Responses to colours were faster than to shapes, and responses to colour words were faster than to shape words. Within-mode comparisons were faster than between-mode comparisons. Direct access of the separate stimuli to the dominant hemispheres did not produce faster responses.     

A two-stage approach to align two surfaces of deformable objects

This paper introduces a new approach for non-rigid registration which is able to align two surfaces under large deformation. At the first stage, the two surfaces are remeshed to create two sub-meshes. Then, correspondences between the two sub-meshes are obtained by employing a robust probabilistic method. Reliable correspondences are used to find a global rigid transformation to bring the two surfaces closer. Using these correspondences and taking one sub-mesh as a deformation graph, the second stage applies a deformation model to align the two surfaces together. This stage solves for more correct correspondences as well as for a local transformation at each node simultaneously. With these two stages, the method deals robustly with large motion and preserves small details during the alignment process of the two surfaces. The efficiency of the method is demonstrated by comparing the alignment results it achieves with the results obtained by state-of-the-art methods.     

Multipartite entangled magnon states as quantum communication channels

We investigate the entanglement properties of the two magnon states and explicate conditions under which, the two magnon state becomes useful for several quantum communication protocols. We systematically study the temporal behaviour of concurrence to find out the effect of exchange interaction on entanglement. The two magnon state, which is potentially realizable in quantum dots using Heisenberg exchange interaction, is found to be suitable for carrying out deterministic teleportation of an arbitrary two qubit composite system. Further, conditions for which the channel capacity reaches “Holevo bound”, allowing four classical bits to be transmitted through two qubits are derived. Later, an unconventional protocol is given to demonstrate that this state can be used for sharing of a two qubit entangled state among two parties.     

变精度双向S-粗集及其应用

提出基于副集的双向S-粗集,变精度双向S-粗集;给出基于副集的双向S-粗集,变精度双向S-粗集的数学结构;给出变精度双向S-粗集的存在背景和意义解释。变精度双向S-粗集是对双向S-粗集理论的完善和发展。     

Conic reconstruction and correspondence from two views

Conics are widely accepted as one of the most fundamental image features together with points and line segments. The problem of space reconstruction and correspondence of two conics from two views is addressed in this paper. It is shown that there are two independent polynomial conditions on the corresponding pair of conics across two views, given the relative orientation of the two views. These two correspondence conditions are derived algebraically and one of them is shown to be fundamental in establishing the correspondences of conics. A unified closed-form solution is also developed for both projective reconstruction of conics in space from two uncalibrated camera views and metric reconstruction from two calibrated camera views. Experiments are conducted to demonstrate the discriminality of the correspondence conditions and the accuracy and stability of the reconstruction both for simulated and real images     

短波地空通信站址布局评估方法

针对短波地空通信站址布局的评估问题,给出2个评估站址布局方案的指标——覆盖度和覆盖效率,分别运用网格扫描法和蒙特卡罗方法对这2个指标进行确定。通过仿真,对正方形和正六边形2种特殊站址布局结构进行评估和比较,得出正六边形结构更合理的结论,并验证了这2个评估指标和确定方法的可行性和有效性。     

一种判断交叉物体前后景的方法

在计算机图像处理中,常常会出现两个物体在二维影像中有交叉的现象,当两个物体的灰度比较相似时,通常计算机很难辨别出交叉部分属于哪个物体,从而影响物体图像的分割。文章提出了一种通过检测交叉区域,再用模板相关的方法对交叉区域分割的算法,较好地解决了灰度相近物体图像交叉区域分割问题。     

Processing of texts and videos: A strategy‐focused analysis

This study examined strategies used across two modalities of information presentation. Students were presented with two sources on endangered species, either as two texts or two videos. Then, participants were asked to annotate the two sources either using the track changes function in Microsoft Word, for the text condition, or using the VideoAnt, video annotation platform, for the video condition. Students' annotations were coded for the strategies evidenced. More strategies were reported in association with the text condition and a greater number of higher‐level strategies and emphasis‐related strategies were reported. Moreover, students were found to report consistent strategies when processing two different sources, on two different topics, and were found to report strategies disproportionately early during processing, particularly for the video condition.     

安全判定两组数据对应成比例的新方法

针对秘密判定两组数据对应成比例问题提出一种新的解决方案,即运用同态加密方案设计一个安全求解两组数据中对应成比例个数协议,并利用此协议进一步设计出安全判定两组数据对应成比例协议和安全判定空间中两平面的位置协议。该方法不但解决了安全判定两组数据对应成比例问题,还解决了空间两平面的相对位置判定问题。与以前的解决方案相比,设计方案不但提高了协议的效率,还降低了通信量。     

Estimation of the epipole using optical flow at antipodal points

We present algorithms for estimating the epipole or direction of translation of a moving camera. We use constraints arising from two points that are antipodal on the image sphere in order to decouple rotation from translation. One pair of antipodal points constrains the epipole to lie on a plane, and two such pairs will correspondingly give two planes. The intersection of these two planes is an estimate of the epipole. This means we require image motion measurements at two pairs of antipodal points to obtain an estimate. Two classes of algorithms are possible and we present two simple yet extremely robust algorithms representative of each class. These are shown to have comparable accuracy with the state of the art when tested in simulation under noise and with real image sequences.     

传感器网络的可定位性条件

针对两个节点集合,提出了一组可定位性条件.可定位性条件包含两部分:两个集合之间需要的连接边的数目,以及如何布置这些连接边.本文将每组节点和它们的内部连接边刻画成一个距离图.两个节点集合之间的可定位性判定等同于两个融合图的全局刚性测试.针对两个融合图的可定位性,给出了一系列的充要条件.     

求解简单多边形间最小距离的一个线性时间算法

计算简单多边形间的最小距离,在所有与几何图形计算有关的领域中,一直以来都是一个基本问题。为了更快地求解简单多边形的最小距离,提出了一个基于关联多边形三角化分割的简单多边形间最小距离的求解算法。该算法的主要思想是:首先构造一个关联多边形把两个多边形联系起来,其目的是把最小距离限制在这个关联多边形内;然后根据两个多边形的最小边界矩形包围框间的不同位置关系,详细阐述了关联多边形的构造过程,同时论述了关联多边形是一个简单多边形。为了计算最小距离,首先要对关联多边形进行三角化分割,并使最小距离位于三角化分割结果中某一个三角形区域内,或者至多位于两个相邻三角形区域内;之后通过对所有三角形进行遍历来找出最小距离及其所在的位置。该算法的时间复杂度是线性的。     

基于遗传算法的高维数据模糊聚类

提出了一种基于遗传算法的高维数据模糊聚类方法。引入了一个模糊非相似矩阵来表示高维样本之间的非相似程度,并将高维样本初始化到二维平面。利用遗传算法进行迭代优化二维样本的坐标值,实现二维样本之间的欧氏距离向样本间的模糊非相似度的趋近,使高维样本映射到二维平面。最后将得到的最优的二维样本利用模糊C-均值聚类（FCM）算法聚类,克服了聚类有效性对高维样本空间分布的依赖。实验仿真表明利用该方法有较好的聚类效果,且比用FCM算法直接聚类收敛速度快。     

基于几何配准的三维模型几何比对方法研究

针对设计师在进行协同建模时无法快速查看模型变更信息的问题,提出了快速比 对两个模型几何差异的方法。首先,通过等步长采点获取两个模型的点云数据;然后,利用主 元分析法计算两个点云的特征向量从而获取点云的参考坐标系,推导两个点云参考坐标系的坐 标变换,将两个点云调整到一致,即可实现点云的初始配准;最后,利用最近点迭代法对两个 点云进行精确配准,记录配准后两个点云中的非重叠区域,可获取两个点云的几何差异区域。 测试结果表明该方法可以有效识别两个模型的几何差异。     

New EWMA control charts for monitoring process dispersion

There exist two EWMA-type dispersion charts for monitoring dispersion increases in the literature. One resets the EWMA statistic to zero whenever it is below zero. The other one truncates negative normalized observations to zero in the EWMA statistic. This paper proposes two one-sided EWMA charts for detecting dispersion increases and decreases, respectively, and one two-sided EWMA chart for monitoring dispersion increases or decreases simultaneously. Simulation studies show that the proposed upper-sided EWMA chart performs better than the two existing counterparts for detecting increases in dispersion, and that the proposed lower-sided EWMA chart significantly outperforms the two lower-sided EWMA charts developed similar to their two existing upper-sided EWMA charts for detecting decreases in dispersion. Moreover, the proposed two-sided EWMA chart provides much better sensitivity than the two two-sided EWMA charts generalized from the two existing upper-sided EWMA charts for detecting overall changes in dispersion.     

基于粒子群算法的三维CAD模型相似性计算

为了更加准确地度量两个模型之间的形状差异,提出了一种基于粒子群的模型相似性计算方法。利用面的组成边数来构造面相似度矩阵,通过粒子群算法对该矩阵进行搜索,得到了两个模型之间的最优面匹配序列。根据这个最优面匹配序列,从面相似度矩阵中提取对应的面相似性值。通过累积面之间的相似性来计算模型之间的整体相似性。以此为基础来度量模型之间的差异。实验结果表明：该方法能够准确地度量两个模型之间的相似程度。     

Multisurface proximal support vector machine classification via generalized eigenvalues

A new approach to support vector machine (SVM) classification is proposed wherein each of two data sets are proximal to one of two distinct planes that are not parallel to each other. Each plane is generated such that it is closest to one of the two data sets and as far as possible from the other data set. Each of the two nonparallel proximal planes is obtained by a single MATLAB command as the eigenvector corresponding to a smallest eigenvalue of a generalized eigenvalue problem. Classification by proximity to two distinct nonlinear surfaces generated by a nonlinear kernel also leads to two simple generalized eigenvalue problems. The effectiveness of the proposed method is demonstrated by tests on simple examples as well as on a number of public data sets. These examples show the advantages of the proposed approach in both computation time and test set correctness.     

面向问句复述识别的语义正交化匹配方法研究

问句复述识别任务旨在判断两个自然问句的语义是否等价。问句的语义理解与交互是解决该任务的关键因素。现有工作通常基于问句的语义级编码,通过融合或交互的方式,抽取问句的浅层语义特征,以此支持复述问句之间的语义计算。但是如果能找到两个问句的相同点和不同点,就可以基于这些信息得到更为准确的判断结果。基于此想法,该文提出了语义正交化匹配方法,将语义正交化引入到问句复述识别任务中。通过语义正交化方法将每个问句拆分为与另一个问句的相似表示和差异表示,这不仅丰富了问句的语义表示,而且实现了问句的多粒度特征语义融合。该文在中文数据集LCQMC和英文数据集Quora上进行实验,证明了语义正交化匹配方法在问句复述识别任务中的有效性。     

Managing Radical Innovation as an Innovative Design Process: Generative Constraints and Cumulative Sets of Rules

This paper focuses on the organization of design processes and the difficulty of simultaneously achieving control and exploration while aiming to achieve radical innovation. After a first generation of works that tended to oppose new product development (NPD) processes (with controlled convergence and very limited exploration) to innovation processes (with poorly controlled convergence and random (uncontrolled) exploration), the new generation of works proposed ways to combine control and convergence either through concept shift or through stable architectures. Relying on a generic analytical framework (design space/value management), it appears that each model makes restrictive hypotheses (respectively smart leadership or stable architecture) to address two critical questions: How can one increase the efficiency of exploration? How can one ensure forms of cumulative convergence? Relying on the same analytical framework, we analyse two cases that explore the unknown in a controlled way and still do not correspond two either of the two models. We show that these two anomalies and the two models actually have two critical features in common: a focus on generative constraint and a logic of cumulative design rules. As a consequence, these two features might lead to several processes where teams have to explore the unknown and still have to keep a rigorous control of exploration and convergence.     

Least squares twin support vector machines for pattern classification

In this paper we formulate a least squares version of the recently proposed twin support vector machine (TSVM) for binary classification. This formulation leads to extremely simple and fast algorithm for generating binary classifiers based on two non-parallel hyperplanes. Here we attempt to solve two modified primal problems of TSVM, instead of two dual problems usually solved. We show that the solution of the two modified primal problems reduces to solving just two systems of linear equations as opposed to solving two quadratic programming problems along with two systems of linear equations in TSVM. Classification using nonlinear kernel also leads to systems of linear equations. Our experiments on publicly available datasets indicate that the proposed least squares TSVM has comparable classification accuracy to that of TSVM but with considerably lesser computational time. Since linear least squares TSVM can easily handle large datasets, we further went on to investigate its efficiency for text categorization applications. Computational results demonstrate the effectiveness of the proposed method over linear proximal SVM on all the text corpuses considered.