Flavonoids of “La Alcarria” honey A study of their botanical origin

Summary The flavonoids present in ten selected samples of La Alcarria honey with different pollen compositions have been HPLC analysed in order to establish if correlations between botanical origin and flavonoid profiles are possible. A common flavonoid pattern is observed in the different samples showing that pollen is not the main source of honey flavonoids. A close correlation between the flavonoid patterns of honey flavonoids and propolis flavonoids has been found suggesting that flavonoid analysis could be more useful in geographical origin determinations than in botanical origin studies.

---

Flavonoide des La-Alcarria-Honigs Eine Studie ihres botanischen Ursprungs

Zusammenfassung Die Flavonoide in Proben in Alcarria-Honig mit unterschiedlicher Pollenzusammensetzung wurden untersucht, um Kortrelationen zwischen dem botanischen Ursprung und den möglichen Flavonoiden zu finden. In den verschiedenen Proben wurde ein Flavonoid-Muster gefunden, wobei der Pollen nicht die Hauptquelle der Honigflavonoide ist. Es wurde jedoch eine enge Korrelation zwischen den Flavonoid-Mustern des Honigs und des Bienenkittharzes gefunden, was für die geographische Herkunft wichtiger ist als die botanische.

     

Output controllability and optimal output control of state-dependent switched Boolean control networks

In the present paper, we investigate the output-controllability and optimal output control problems of a state-dependent switched Boolean control network. By using the semi-tensor product, the algebraic form of the system is obtained. Then, output-controllability problems of the system are discussed and some necessary and sufficient conditions are given. Next, the Mayer-type optimal output control issue is considered and an algorithm is provided to find out the control sequence. At last, an example is given to show the effectiveness of the main results.     

HEGM: A hierarchical elastic graph matching for hand gesture recognition

A hierarchical scheme for elastic graph matching applied to hand gesture recognition is proposed. The proposed algorithm exploits the relative discriminatory capabilities of visual features scattered on the images, assigning the corresponding weights to each feature. A boosting algorithm is used to determine the structure of the hierarchy of a given graph. The graph is expressed by annotating the nodes of interest over the target object to form a bunch graph. Three annotation techniques, manual, semi-automatic, and automatic annotation are used to determine the position of the nodes. The scheme and the annotation approaches are applied to explore the hand gesture recognition performance. A number of filter banks are applied to hand gestures images to investigate the effect of using different feature representation approaches. Experimental results show that the hierarchical elastic graph matching (HEGM) approach classified the hand posture with a gesture recognition accuracy of 99.85% when visual features were extracted by utilizing the Histogram of Oriented Gradient (HOG) representation. The results also provide the performance measures from the aspect of recognition accuracy to matching benefits, node positions correlation and consistency on three annotation approaches, showing that the semi-automatic annotation method is more efficient and accurate than the other two methods.     

3D fingerprint reconstruction system using feature correspondences and prior estimated finger model

The paper studies a 3D fingerprint reconstruction technique based on multi-view touchless fingerprint images. This technique offers a solution for 3D fingerprint image generation and application when only multi-view 2D images are available. However, the difficulties and stresses of 3D fingerprint reconstruction are the establishment of feature correspondences based on 2D touchless fingerprint images and the estimation of the finger shape model. In this paper, several popular used features, such as scale invariant feature transformation (SIFT) feature, ridge feature and minutiae, are employed for correspondences establishment. To extract these fingerprint features accurately, an improved fingerprint enhancement method has been proposed by polishing orientation and ridge frequency maps according to the characteristics of 2D touchless fingerprint images. Therefore, correspondences can be established by adopting hierarchical fingerprint matching approaches. Through an analysis of 440 3D point cloud finger data (220 fingers, 2 pictures each) collected by a 3D scanning technique, i.e., the structured light illumination (SLI) method, the finger shape model is estimated. It is found that the binary quadratic function is more suitable for the finger shape model than the other mixed model tested in this paper. In our experiments, the reconstruction accuracy is illustrated by constructing a cylinder. Furthermore, results obtained from different fingerprint feature correspondences are analyzed and compared to show which features are more suitable for 3D fingerprint images generation.     

Gravity optimised particle filter for hand tracking

This paper presents a gravity optimised particle filter (GOPF) where the magnitude of the gravitational force for every particle is proportional to its weight. GOPF attracts nearby particles and replicates new particles as if moving the particles towards the peak of the likelihood distribution, improving the sampling efficiency. GOPF is incorporated into a technique for hand features tracking. A fast approach to hand features detection and labelling using convexity defects is also presented. Experimental results show that GOPF outperforms the standard particle filter and its variants, as well as state-of-the-art CamShift guided particle filter using a significantly reduced number of particles.     

A GPU-based parallel method for evolutionary tree construction

Evolutionary trees are widely applied in various applications to show the inferred evolutionary relationships among species or entities. Neighbor-Joining is one solution for data-intensive and time-consuming evolutionary tree construction, with polynomial time complexity. However, its performance becomes poorer with the growth of massive datasets. Graphics Processing Units (GPUs) have brought about new opportunities for these time-consuming applications. Based on its high efficiency, a GPU-based parallel Neighbor-Joining method is proposed, and two efficient parallel mechanisms, data segmentation with asynchronous processing and the minimal chain model with bitonic sort, are put forward to speed up the processing. The experimental results show that an average speedup of 25.1 is achieved and even approximately 30 can be obtained with a sequence dataset ranging from 16,000 to 25,000. Moreover, the proposed parallel mechanisms can be effectively exploited in some other high performance applications.     

Robust passive autofocus system for mobile phone camera applications

A robust autofocus system is a ubiquitous function in today’s mobile phone camera applications. However, due to the power consumption and size requirements, it is difficult for the autofocus function to be implemented into the design of mobile phone cameras. This paper presents a passive autofocus system with low computational complexity. This system uses a novel contrast measurement to determine degree of image sharpness, which can better reflect the information about image discontinuities. In order to gauge the performance of this measurement, a modified peak search strategy is used in the experiments. The experimental results from several typical image sequences validate the effectiveness of the proposed method.     

A Non-Line-of-Sight mitigation localization algorithm for sensor networks using clustering analysis

Non-Line-of-Sight propagation of wireless signal has an impact on measured distances in range-based localization and will bias the final localization results. A new localization algorithm is proposed in this paper to mitigate Non-Line-of-Sight errors when there are more than enough anchor nodes deployed around the node to be located. This algorithm utilizes multi-round clustering analysis to filter the pre-located estimators which derive from all possible subsets of measured distances. In each round, the method density-based spatial clustering of applications with noise is adopted. Simulations show that the proposed algorithm can effectively improve localization accuracy not only when the measured distances with Non-Line-of-Sight error are minor but also under the condition that all of them suffer random Non-Line-of-Sight error.     

Runtime home mapping for effective memory resource usage

In tiled Chip Multiprocessors (CMPs) last-level cache (LLC) banks are usually shared but distributed among the tiles. A static mapping of cache blocks to the LLC banks leads to poor efficiency since a block may be mapped away from the tiles actually accessing it. Dynamic policies either rely on the static mapping of blocks to a set of banks (D-NUCA) or rely on the OS to dynamically load pages to statically mapped addresses (first-touch).