基于Zigbee和GPRS的多参数水质监测系统设计

针对传统水质监测存在的实时性差、覆盖范围窄、网络布局困难等问题,设计出一种基于Zigbee无线传感网络和GPRS技术的远程实时水质监测系统.文中重点阐述该系统的硬件设计和软件实现过程.该系统将水质传感器采集的各项参数传送给CC2530芯片后,经Zigbee网络发送给网络协调器,再通过GPRS无线通信模块SIM300传送到Internet或移动终端,最后用户可通过PC机或手机终端查看水质参数信息,实现了水质信息的远程实时监测.实验应用表明,该系统监测范围广、使用方便、快捷,具有较为广阔的应用前景.     

Development of ceramic floor tile compositions based on quartzite and granite sludges

In the present work, industrial sludges derived from cutting and polishing natural stones (granite and quartzite) were characterised in terms of particles size distribution, chemical and mineralogical composition, and thermal behaviour and their potential to be incorporated as main components in red-clay-based stoneware tiles was evaluated. High levels (60–70 wt.%) of incorporation were attempted aiming at designing new formulations intended to be less expensive and possess better final properties (lower water absorption and higher flexural strength) in comparison to an industrial reference body used in the production of rustic tiles by extrusion, characterised 8–9% water absorption and a flexural strength of 17–18 MPa. Extruded rods of different formulations were produced and fired at 1100 °C, 1125 °C, 1150 °C and 1200 °C. The experimental results showed that all the new formulations performed better with the most significant improvements being obtained with incorporation of granite sludge. Flexural strength values more than triplicate and water absorption decreased by more than one order of magnitude in comparison to the reference paste. The new products fulfil the requirements of the ISO 13006 standard, group BIa (porcelain tiles).     

基于排列熵和支持向量机的癫痫发作预测研究

针对癫痫发作给病人带来的巨大伤害,为临床治疗留下足够空余时间,提出一个可以预测癫痫发作的系统模型。对21名癫痫病人进行研究,提取具有较低算法复杂度的排列熵构成特征向量,将其输入支持向量机（support vector machine,SVM）训练出学习模型,用来识别发作期样本,利用投票机制充分考虑病人差异来判断所处状态,最终实现癫痫的实时预测。结果表明,其中81%的发作可以提前平均50多分钟预测到,且具有较低的误报率。为癫痫发作预测系统的理论研究打下坚实基础。     

高效液相色谱法在氟铃脲标准样品制备中的应用研究

标准样品是农残分析巾的必要条件。应用高效液相色谱法进行氟铃脲的纯化、制得氟铃脲标准样品，用DELTA PAK C18柱，以乙腈-水(68：32)为流动相，在波长254nm，室温下进行了保留值定性、定值分析、均匀性及稳定性考察，效果良好。     

药用中间体苯丙酮含量的气相色谱/质谱分析

苯丙酮是合成利胆药苯丙醇的重要中间体。本文建立了用气相色谱 /质谱法 (GC/MS)测定苯丙酮含量的方法。组分的定性依靠GC/MS联用技术和NIST谱库标准质谱图对照分析。以苯乙酮为内标 ,苯丙酮含量在 1.0× 10 -5～ 2 .0× 10 -4g/mL范围内呈线性 ,线性相关系数r =0 .994 9,苯丙酮最低检测浓度为 1.0× 10 -8g/mL。该法操作简便、快速 ,结果准确可靠 ,且具有很好的实用价值     

Secure and robust image hashing via compressive sensing

Image hash functions find extensive applications in content authentication, database search. This paper develops a novel algorithm for generating a secure and robust image hash based on compressive sensing and Fourier-Mellin transform. Firstly, we incorporate Fourier-Mellin transform into our method to improve its performance under rotation, scale, transition attacks. Secondly, we exploit the property of dimension reduction inherent in compressive sensing for hash design. The statistic structure and sparse of the wavelet coefficients assure efficient compression in situation of including maximum the image features. The hashing method is computationally secure without additional randomization process. Such a combined approach is capable of tackling all types of attacks and thus can yield a better overall performance in multimedia identification. To demonstrate the superior performance of the proposed schemes, receiver operating characteristics analysis over a large image database is performed. Experimental results show that the proposed image hashing is robust to a wide range of distortions and attacks. When compared with the current state-of-the-art methods, the proposed method yields better identification performances under geometric attacks such as rotation attacks and brightness changes.     

XML keyword search with promising result type recommendations

Keyword search enables inexperienced users to easily search XML database with no specific knowledge of complex structured query languages and XML data schemas. Existing work has addressed the problem of selecting data nodes that match keywords and connecting them in a meaningful way, e.g., SLCA and ELCA. However, it is time-consuming and unnecessary to serve all the connected subtrees to the users because in general the users are only interested in part of the relevant results. In this paper, we propose a new keyword search approach which basically utilizes the statistics of underlying XML data to decide the promising result types and then quickly retrieves the corresponding results with the help of selected promising result types. To guarantee the quality of the selected promising result types, we measure the correlations between result types and a keyword query by analyzing the distribution of relevant keywords and their structures within the XML data to be searched. In addition, relevant result types can be efficiently computed without keyword query evaluation and any schema information. To directly return top-k keyword search results that conform to the suggested promising result types, we design two new algorithms to adapt to the structural sensitivity of the keyword nodes over the keyword search results. Lastly, we implement all proposed approaches and present the relevant experimental results to show the effectiveness of our approach.     

The min-dist location selection and facility replacement queries

We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing facilities, we select a location from a given set of potential locations for establishing a new facility, so that the average distance between a client and her nearest facility is minimized. The problem has a wide range of applications in urban development simulation, massively multiplayer online games, and decision support systems. We also investigate a variant of the problem, where we consider replacing (instead of adding) a facility while achieving the same optimization goal. We call this variant the min-dist facility replacement problem. We explore two common approaches to location optimization problems and present methods based on those approaches for solving the min-dist location selection problem. However, those methods either need to maintain an extra index or fall short in efficiency. To address their drawbacks, we propose a novel method (named MND), which has very close performance to the fastest method but does not need an extra index. We then utilize the key idea behind MND to approach the min-dist facility replacement problem, which results in two algorithms names MSND and RID. We provide a detailed comparative cost analysis and conduct extensive experiments on the various algorithms. The results show that MND and RID outperform their competitors by orders of magnitude.     

Evolutionary robustness analysis for multi-objective optimization: benchmark problems

This paper presents a new approach to robustness analysis in multi-objective optimization problems aimed at obtaining the most robust Pareto front solutions and distributing the solutions along the most robust regions of the optimal Pareto set. A new set of test problems accounting for the different types of robustness cases is presented in this study. Non-dominated solutions are classified according to their degree of robustness and are distributed along the Pareto front according to specific algorithm parameter values. Verification of the proposed method is carried out using the developed test problems and artificial and real world benchmark test problems present in the literature.