Predicting and interpreting identification errors in military vehicle training using multidimensional scaling

We compared methods for predicting and understanding the source of confusion errors during military vehicle identification training. Participants completed training to identify main battle tanks. They also completed card-sorting and similarity-rating tasks to express their mental representation of resemblance across the set of training items. We expected participants to selectively attend to a subset of vehicle features during these tasks, and we hypothesised that we could predict identification confusion errors based on the outcomes of the card-sort and similarity-rating tasks. Based on card-sorting results, we were able to predict about 45% of observed identification confusions. Based on multidimensional scaling of the similarity-rating data, we could predict more than 80% of identification confusions. These methods also enabled us to infer the dimensions receiving significant attention from each participant. This understanding of mental representation may be crucial in creating personalised training that directs attention to features that are critical for accurate identification.

Practitioner Summary: Participants completed military vehicle identification training and testing, along with card-sorting and similarity-rating tasks. The data enabled us to predict up to 84% of identification confusion errors and to understand the mental representation underlying these errors. These methods have potential to improve training and reduce identification errors leading to fratricide.     

基于Wiener结构的软测量模型及辨识算法

Wiener模型结构能有效地表征系统的动态和静态特性, 因此这里首先基于这一结构建立软测量模型, 利用动态与静态子模型分别建立辅助变量与主导变量间的动态与静态关系, 并说明该软测量模型的可行性, 给出模型具体表达式. 其次, 针对所提模型, 提出分步辨识方式获得最优模型参数, 说明其可行性. 再次, 为了减少计算和实现模型在线更新, 这里提出参数辨识递推算法, 并给出软测量模型参数的收敛性结论. 通过实例仿真, 可以看出本文提出模型的可行性, 以及分步辨识方式与递推算法的有效性.     

Semantic weak signal tracing

The weak signal concept according to Ansoff has the aim to advance strategic early warning. It enables to predict the appearance of events in advance that are relevant for an organization. An example is to predict the appearance of a new and relevant technology for a research organization. Existing approaches detect weak signals based on an environmental scanning procedure that considers textual information from the internet. This is because about 80% of all data in the internet are textual information. The texts are processed by a specific clustering approach where clusters that represent weak signals are identified. In contrast to these related approaches, we propose a new methodology that investigates a sequence of clusters measured at successive points in time. This enables to trace the development of weak signals over time and thus, it enables to identify relevant weak signal developments for organization’s decision making in strategic early warning environment.     

PRIVACY LEAKAGE IN HEALTH SOCIAL NETWORKS

Members of health social networks may be susceptible to privacy leaks by the amount of information they leave behind. The threat to privacy increases when members of these networks reuse their pseudonyms in other social networks. The risk of re‐identifying users from such networks requires quantitative estimates to evaluate its magnitude. The estimates will enable managers and members of health social communities to take corrective measures. We introduce a new re‐identification attack, the social network attack, that takes advantage of the fact that users reuse their pseudonyms. To demonstrate the attack, we establish links between MedHelp and Twitter (two popular social networks) based on matching pseudonyms. We used Bayesian networks to model the re‐identification risk and used stylometric techniques to identify the strength of the links. On the basis of our model 7‐11. 8% of the MedHelp members in the sample population who reused their pseudonyms in Twitter were re‐identifiable compared with 1% who did not. The risk estimates were measured at the 5% risk threshold. Our model was able to re‐identify users with a sensitivity of 41% and specificity of 96%. The potential for re‐identification increases as more data is accumulated from these profiles, which makes the threat of re‐identification more serious.     

Bootstrapping a robot’s kinematic model

We present a system that is able to autonomously build a 3D model of a robot’s hand, along with a kinematic model of the robot’s arm, beginning with very little information. The system starts by using exploratory motions to locate and centre the robot’s hand in the middle of its field of view, and then progressively builds the 3D and kinematic models. The system is flexible, and easy to integrate with different robots, because the model building process does not require any fiducial markers to be attached to the robot’s hand. To validate the models built by the system we perform a number of experiments. The results of the experiments demonstrate that the hand model built by the system can be tracked with a precision in the order of 1 mm, and that the kinematic model is accurate enough to reliably position the hand of the robot in camera space.     

一种新型指纹锁电路设计

市场上主流的电子锁是基于密码设计的。密码锁的最大的缺陷是密码容易被他人窃取、猜测及遗忘。随着生物技术的发展,越来越多的活体技术应用到识别系统中,如指纹、掌纹、人脸、虹膜等。相对于其它的活体识别技术,指纹识别系统以其可实现性强,成本相对低廉,同时又具备较高的安全性,被越来越多的应用到各种场合。文章给出了一种新型的指纹锁架构,并详细论述了系统的各个组成部分以及指纹识别算法的实现流程。文章对降低系统功耗和增加保密性都提出了独特的方法。     

Controlling aliased dynamics in motion systems? An identification for sampled-data control approach

Sampled-data control systems occasionally exhibit aliased resonance phenomena within the control bandwidth. The aim of this paper is to investigate the aspect of these aliased dynamics with application to a high performance industrial nano-positioning machine. This necessitates a full sampled-data control design approach, since these aliased dynamics endanger both the at-sample performance and the intersample behaviour. The proposed framework comprises both system identification and sampled-data control. In particular, the sampled-data control objective necessitates models that encompass the intersample behaviour, i.e., ideally continuous time models. Application of the proposed approach on an industrial wafer stage system provides a thorough insight and new control design guidelines for controlling aliased dynamics.     

An EM-based identification algorithm for a class of hybrid systems with application to power electronics

In this paper we present an identification algorithm for a class of continuous-time hybrid systems. In such systems, both continuous-time and discrete-time dynamics are involved. We apply the expectation-maximisation algorithm to obtain the maximum likelihood estimate of the parameters of a discrete-time model expressed in incremental form. The main advantage of this approach is that the continuous-time parameters can directly be recovered. The technique is particularly well suited to fast-sampling rates. As an application, we focus on a standard identification problem in power electronics. In this field, our proposed algorithm is of importance since accurate modelling of power converters is required in high- performance applications and for fault diagnosis. As an illustrative example, and to verify the performance of our proposed algorithm, we apply our results to a flying capacitor multicell converter.     

Fast fingerprint identification for large databases

Fingerprint matching has emerged as an effective tool for human recognition due to the uniqueness, universality and invariability of fingerprints. Many different approaches have been proposed in the literature to determine faithfully if two fingerprint images belong to the same person. Among them, minutiae-based matchers highlight as the most relevant techniques because of their discriminative capabilities, providing precise results. However, performing a fingerprint identification over a large database can be an inefficient task due to the lack of scalability and high computing times of fingerprint matching algorithms.In this paper, we propose a distributed framework for fingerprint matching to tackle large databases in a reasonable time. It provides a general scheme for any kind of matcher, so that its precision is preserved and its time of response can be reduced.To test the proposed system, we conduct an extensive study that involves both synthetic and captured fingerprint databases, which have different characteristics, analyzing the performance of three well-known minutiae-based matchers within the designed framework. With the available hardware resources, our distributed model is able to address up to 400 000 fingerprints in approximately half a second. Additional details are provided at http://sci2s.ugr.es/ParallelMatching.     

New results on PWARX model identification based on clustering approach

This paper deals with the problem of piecewise auto regressive systems with exogenous input(PWARX) model identification based on clustering solution. This problem involves both the estimation of the parameters of the affine sub-models and the hyper planes defining the partitions of the state-input regression. The existing identification methods present three main drawbacks which limit its effectiveness. First, most of them may converge to local minima in the case of poor initializations because they are based on the optimization using nonlinear criteria. Second, they use simple and ineffective techniques to remove outliers. Third, most of them assume that the number of sub-models is known a priori. To overcome these drawbacks, we suggest the use of the density-based spatial clustering of applications with noise(DBSCAN) algorithm. The results presented in this paper illustrate the performance of our methods in comparison with the existing approach. An application of the developed approach to an olive oil esterification reactor is also proposed in order to validate the simulation results.