Flow profile measurement in microchannel using the optical feedback interferometry sensing technique

The need to accurately measure flow profiles in microfluidic channels is well recognised. In this work, we present a new optical feedback interferometry (OFI) flow sensor that accurately measures local velocity in fluids and enables reconstruction of a velocity profile inside a microchannel. OFI is a self-aligned interferometric technique that uses the laser as both the transmitter and the receiver thus offering high sensitivity, fast response, and a simple and compact optical design. The system described here is based on a commercial semiconductor laser and has been designed to achieve a micrometer-range spatial resolution. The sensor performance was validated by reconstructing the velocity profile inside a circular cross-section flow-channel with 320  $\upmu $ m internal diameter, with a relative error smaller than 1.8 %. The local flow velocity is directly measured, thus avoiding the need for model based profile calculation and uncertainties inherent to this approach. The system was validated by successfully extracting the flow profiles in both Newtonian and shear-thinning liquids.     

Adaptive content-based music retrieval system

This paper presents a tunable content-based music retrieval (CBMR) system suitable the for retrieval of music audio clips. The audio clips are represented as extracted feature vectors. The CBMR system is expert-tunable by altering the feature space. The feature space is tuned according to the expert-specified similarity criteria expressed in terms of clusters of similar audio clips. The main goal of tuning the feature space is to improve retrieval performance, since some features may have more impact on perceived similarity than others. The tuning process utilizes our genetic algorithm. The R-tree index for efficient retrieval of audio clips is based on the clustering of feature vectors. For each cluster a minimal bounding rectangle (MBR) is formed, thus providing objects for indexing. Inserting new nodes into the R-tree is efficiently performed because of the chosen Quadratic Split algorithm. Our CBMR system implements the point query and the n-nearest neighbors query with the O(logn) time complexity. Different objective functions based on cluster similarity and dissimilarity measures are used for the genetic algorithm. We have found that all of them have similar impact on the retrieval performance in terms of precision and recall. The paper includes experimental results in measuring retrieval performance, reporting significant improvement over the untuned feature space.     

Convex combinations of strict t-norms

Alsina, Frank, and Schweizer posed a question whether a non-trivial convex combination of triangular norms can ever be a triangular norm. In this paper we deal with the class of strict t-norms with well-defined first partial derivatives along their zero borders. We show that the answer to the question is negative for certain couples of such t-norms and we state out possible further research.     

Designing fast LTL model checking algorithms for many-core GPUs

Recent technological developments made various many-core hardware platforms widely accessible. These massively parallel architectures have been used to significantly accelerate many computation demanding tasks. In this paper, we show how the algorithms for LTL model checking can be redesigned in order to accelerate LTL model checking on many-core GPU platforms. Our detailed experimental evaluation demonstrates that using the NVIDIA CUDA technology results in a significant speedup of the verification process. Together with state space generation based on shared hash-table and DFS exploration, our CUDA accelerated model checker is the fastest among state-of-the-art shared memory model checking tools.     

A novel split-and-merge algorithm for hierarchical clustering of Gaussian mixture models

The paper presents a novel split-and-merge algorithm for hierarchical clustering of Gaussian mixture models, which tends to improve on the local optimal solution determined by the initial constellation. It is initialized by local optimal parameters obtained by using a baseline approach similar to k-means, and it tends to approach more closely to the global optimum of the target clustering function, by iteratively splitting and merging the clusters of Gaussian components obtained as the output of the baseline algorithm. The algorithm is further improved by introducing model selection in order to obtain the best possible trade-off between recognition accuracy and computational load in a Gaussian selection task applied within an actual recognition system. The proposed method is tested both on artificial data and in the framework of Gaussian selection performed within a real continuous speech recognition system, and in both cases an improvement over the baseline method has been observed.     

Observation of a half-quantum-flux periodicity pattern in an rf SQUID with small critical currents

We have found experimentally that rf SQUID's working in a nonhysteretic mode with small critical currents give exactly at resonance and at very low rf bias a triangular pattern with a period equal to half of one elementary quantum of magnetic flux. We discuss a possible explanation of this peculiar result.     

An upgraded artificial bee colony (ABC) algorithm for constrained optimization problems

Artificial bee colony (ABC) algorithm developed by Karaboga is a nature inspired metaheuristic based on honey bee foraging behavior. It was successfully applied to continuous unconstrained optimization problems and later it was extended to constrained design problems as well. This paper introduces an upgraded artificial bee colony (UABC) algorithm for constrained optimization problems. Our UABC algorithm enhances fine-tuning characteristics of the modification rate parameter and employs modified scout bee phase of the ABC algorithm. This upgraded algorithm has been implemented and tested on standard engineering benchmark problems and the performance was compared to the performance of the latest Akay and Karaboga’s ABC algorithm. Our numerical results show that the proposed UABC algorithm produces better or equal best and average solutions in less evaluations in all cases.     

基于MPPMSG的混合高压直流风电系统故障穿越技术

为解决传统风电系统变换级数多的问题,文中提出了一种基于多相永磁同步电机(MPPMSG)的混合高压直流风电系统拓扑。电机多套绕组分别连接单极性变流器并在直流侧串联形成高压直接接入直流母线,一套绕组向电机注入无功功率以改善电机调速和稳态性能。岸上变电站采用电网换相换流器,直流母线短路时可阻断短路电流。为解决多绕组耦合问题,MPPMSG采用了反馈解耦的控制策略。根据发电机短路特性分析,提出了直流母线短路时限制电机短路电流以及直流故障穿越的控制策略。最后,利用PSCAD/EMTDC搭建风电系统开关电路仿真模型,验证了所提控制策略的有效性。