Picture or it didn’t happen: catch the truth for events

Multimedia Tools and Applications - Pictures spreading on the Internet are essential for the authenticity of events. Each day, huge amounts of data are published on social media, and many of them...     

桌面虚拟交付系统在高校机房中的应用

操作系统的重构更新、软件的安装升级、数据同传以及日常计算机系统的维护管理等问题常见于各大高校机房实验室的管理当中,解决这类问题不仅费时费力,而且缺乏创新.作者以桌面虚拟交付系统为切入点,通过实际案例与数据说明桌面虚拟交付系统在实验室建设当中的应用,实际使用该技术的优劣以及需要注意的问题.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

有机化合物立体异构体自动解析专家系统的研究——立体中心的确认

提出了一种查找化合物中立体中心的算法 ,通过该算法可以找到和确认化合物中由于不对称碳和碳碳双键等产生的所有的立体中心。     

用于高性能锁相环的CMOS电荷泵的设计

一般的CMOS电荷泵有充放电流失配的问题.电流失配导致了相位偏差.本文研究了一般CMOS电荷泵电流失配产生的原因,提出了一种新型的电荷泵.利用误差放大器和参考电流源以获得良好的电流匹配特性,降低了锁相环的相位噪声;利用电荷移除管有效地抑制了电荷共享.采用chartered 0.35umCOMS工艺进行仿真.仿真结果显示该电路有很好的电流匹配特性.     

用水信用与风险管理系统

系统采用Oracle数据库作为开发平台,VB.net为开发工具研制而成。系统借鉴银行和电力企业信用等级评价的规则,结合水司水费收缴的历史纪录及各客户的实际情况,运用自动采集程序,从原有的营销系统和财务系统自动录入数据,再通过优化的模糊概率、神经网络程序,对用户进行交纳水费信用等级评定,建立客户交纳水费风险预警机制。     

Blind Source Extraction for Noisy Mixtures by Combining Gaussian Moments and Generalized Autocorrelations

In the blind source extraction problem, the concept of generalized autocorrelations has been successfully used when the desired signal has special temporal structures. However, their applications are only limited to noise-free mixtures, which is not realistic. Therefore, this paper addresses the extraction of the noisy model based on these temporal characteristics of sources. An objective function, which combines Gaussian moments and generalized autocorrelations, is proposed. Maximizing this objective function, we present a blind source extraction algorithm for noisy mixtures. Simulations on synthesized signals, images, artificial electrocardiogram (ECG) data and the real-world ECG data show the better performance of the proposed algorithm. Moreover, comparisons with the existing algorithms further indicate its validity and also show its robustness to the estimated error of time delay.     

A Fast Search Algorithm for a Large Fuzzy Database

In this paper, we propose a fast search algorithm for a large fuzzy database that stores iris codes or data with a similar binary structure. The fuzzy nature of iris codes and their high dimensionality render many modern search algorithms, mainly relying on sorting and hashing, inadequate. The algorithm that is used in all current public deployments of iris recognition is based on a brute force exhaustive search through a database of iris codes, looking for a match that is close enough. Our new technique, Beacon Guided Search (BGS), tackles this problem by dispersing a multitude of ldquobeaconsrdquo in the search space. Despite random bit errors, iris codes from the same eye are more likely to collide with the same beacons than those from different eyes. By counting the number of collisions, BGS shrinks the search range dramatically with a negligible loss of precision. We evaluate this technique using 632,500 iris codes enrolled in the United Arab Emirates (UAE) border control system, showing a substantial improvement in search speed with a negligible loss of accuracy. In addition, we demonstrate that the empirical results match theoretical predictions.