Photolithographic Encoding of Metal Complexes

A platform technology for the creation of spatially resolved surfaces encoded with a monolayer consisting of different metal complexes was developed. The concept entails the light‐triggered activation of a self‐ assembled monolayer (SAM) of UV‐labile anchors, that is, phenacylsulfides, and the subsequent cycloaddition of selected diene‐functionalized metal complexes at defined areas on the surface. The synthesis and characterization of the metal complexes for the UV‐light assisted anchoring on the surface and a detailed study of a short‐chain oligomer model system in solution confirm the high efficiency of the photoreaction. The hybrid materials obtained by this concept can potentially be utilized for the design of highly valuable catalytic or (opto‐)electronic devices.     

具有遗传性疾病和性状的遗传位点分析

随着信息技术的进步和发展,现代生物学越来越多地将这些技术用于大规模生物数据的收集、分析、挖掘等过程.大量计算机技术,特别是统计方法被用来进行复杂疾病的分析.大量研究表明,人体的许多表型性状差异以及对药物和疾病的易感性等都可能与某些位点相关联,或和包含有多个位点的基因相关联.因此,定位与性状或疾病相关联的位点在染色体或基因中的位置,能帮助研究人员了解性状和一些疾病的遗传机理,也能使人们对致病位点加以干预,防止一些遗传病的发生.利用随机森林方法、Bootstrap重抽样、logistic回归等大数据分析方法,意在解决优化生物学位点关联性分析中单一致病位点识别、多位点相互作用和多性状位点关联性分析等子问题.     

Solvable <Emphasis Type="Italic">D</Emphasis><Subscript>2</Subscript>-groups

Let G be a finite group, Irr¹(G) be the set of nonlinear irreducible characters of G and cd¹(G) the set of degrees of the characters in Irr¹(G). A group G is said to be a D₂-group if|cd¹(G)|=|Irr¹(G)|-2. In this paper, we give a complete classification of solvable D₂-groups.     

Positions of characters in finite groups and the Taketa inequality

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: position reducible (PR)-groups, inductively position reducible (IPR)-groups and weak IPR-groups. We show that IPR-groups and weak IPR-groups are solvable and satisfy the Taketa inequality (ie, that the derived length of the group is at most the number of degrees of irreducible complex characters of the group), and we show that any M-group is a weak IPR-group. We also show that even though PR-groups need not be solvable, they cannot be perfect.     

Signal enhancement of a novel multi-address coding lidar backscatters based on a combined technique of demodulation and wavelet de-noising

Multi-address coding (MAC) lidar is a novel lidar system recently developed by our laboratory. By applying a new combined technique of multi-address encoding, multiplexing and decoding, range resolution is effectively improved. In data processing, a signal enhancement method involving laser signal demodulation and wavelet de-noising in the downlink is proposed to improve the signal to noise ratio (SNR) of raw signal and the capability of remote application. In this paper, the working mechanism of MAC lidar is introduced and the implementation of encoding and decoding is also illustrated. We focus on the signal enhancement method and provide the mathematical model and analysis of an algorithm on the basis of the combined method of demodulation and wavelet de-noising. The experimental results and analysis demonstrate that the signal enhancement approach improves the SNR of raw data. Overall, compared with conventional lidar system, MAC lidar achieves a higher resolution and better de-noising performance in long-range detection.     

基于ZigBee技术的信息交互系统设计与实现

基于生物电的人-机交互（HCI）技术作为特殊场景下常规人-机交互方法的一种补充,具有非常广阔的应用前景。为了解决基于生物电的HCI系统中多用户通信问题,文章设计并实现了一种基于ZigBee技术的信息交互系统。该系统主要由ZigBee无线通信模块、信息生成/处理模块、串口通信模块三部分组成,用以实现多用户间使用眼电信号（EOG）进行无线信息交互。在实验室环境下,眼电信号有效检出率98.2%,传输距离在无遮挡、无路由的情况下可达到70m。实验结果表明该系统具有识别率高、稳定性好、配置简单、使用方便等优点,具有较强的实际应用价值。     

改进的布谷鸟算法求解考虑运输时间的分布式柔性流水车间调度问题

针对分布式制造环境下多车间调度问题特点,结合企业实际生产情况,考虑相邻工序间的运输时间,建立以最小化最大完工时间为优化目标的分布式柔性流水车间调度模型,提出一种改进布谷鸟算法用于求解该模型。算法改进包括设计了一种基于工序、车间和机器的三层编码方案;根据问题特点设计了混合种群初始化策略以提高种群质量;改进了布谷鸟搜索操作使其适用于求解该模型;设计了一种种群进化策略以提高算法收敛速度及解的质量。最后通过仿真实验,与多种算法对比,验证所提算法的有效性和优越性。     

Character sums and nonlinear recurrence sequences

We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over arbitrary finite rings.     

Fitting Height and Character Degree Graphs

Given a group G, Γ(G) is the graph whose vertices are the primes that divide the degree of some irreducible character and two vertices p and q are joined by an edge if pq divides the degree of some irreducible character of G. By a definition of Lewis, a graph Γ has bounded Fitting height if the Fitting height of any solvable group G with Γ(G)=Γ is bounded (in terms of Γ). In this note, we prove that there exists a universal constant C such that if Γ has bounded Fitting height and Γ(G)=Γ then h(G)≤C. This solves a problem raised by Lewis. Research supported by the Spanish Ministerio de Educación y Ciencia, MTM2004-06067-C02-01 and MTM2004-04665, the FEDER and Programa Ramón y Cajal.