Wyniki wyszukiwania - BazTech

1

Underwater target direction of arrival estimation by small acoustic sensor array based on sparse bayesian learning

Wang B., He C.

Polish Maritime Research

|

2017

|

S 2

95--102

EN

Assuming independently but identically distributed sources, the traditional DOA (direction of arrival) estimation method of underwater acoustic target normally has poor estimation performance and provides inaccurate estimation results. To solve this problem, a new high-accuracy DOA algorithm based on sparse Bayesian learning algorithm is proposed in terms of temporally correlated source vectors. In novel method, we regarded underwater acoustic source as a first-order auto-regressive process. And then we used the new algorithm of multi-vector SBL to reconstruct the signal spatial spectrum. Then we used the CS-MMV model to estimate the DOA. The experiment results have shown the novel algorithm has a higher spatial resolution and estimation accuracy than other DOA algorithms in the cases of less array element space and less snapshots.

2

Minimizing total completion time for preemptive scheduling with release dates and deadline constraints

He C., Lin H., Lin Y., Dou J.

Foundations of Computing and Decision Sciences

|

2014

|

Vol. 39, No. 1

17--26

EN

It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP-hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2) time. In this paper we give an O(n2) algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm.

3

Rhodamine-6G hydrazide probe for selective determination of Cu(II) in aqueous media

Wang P., Wu G., Gu Z., Wu D., He C.

Chemia Analityczna

|

2009

|

Vol. 54, No. 2

151-162

EN

A new fluorescence method for selective determination of Cu24 using rhodamine 6G hydra-zide (R6GH) as a probe has been developed. The probe has shown selective and sensitive fluorescence response toward Cu2+ in aqueous media. In the proposed reaction mechanism the hydrazide group of R6GH binds to Cu2+ exhibiting a behavior similar to a-amino esters, which results in a redox hydrolysis of the hydrazide moiety with the release of highly fluorescent rhodamine 6G. Under the optimal conditions the fluorescence enhancement at 545 nm was linearly related to the concentration of Cu2+ in the range 0.1-10 μ mol L-1 The proposed method has been applied to the determination of trace Cu-2 in water samples with satisfactory results.

PL

Opracowano nową fluorescencyjną metodę selektywnego oznaczania Cu-2 używając hydrazydku rodaminy 6G (R6GH) jako sondy. Sonda wykazała selektywną i czułą fluoroscencyjną reakcję na obecność Cu-2 w wodnym roztworze. Zaproponowano mechanizm reakcji, w którym grupa hydrazydkowa w R6GH łączy się z Cu-1 i wykazuje zachowanie podobne do a-amino estrów co prowadzi do hydrolizy red-oks i wydzielenia wysoko fluoryzującej rodaminy 6G. W warunkach optymalnych wzrost fluorescencji przy 545 nm był liniowo zależny od stężenia Cu-2 w zakresie 0,1-10 μ mol L-1. Zaproponowaną metodę zastosowano do oznaczania śladów Cu-2 w próbkach wód uzyskując dobre wyniki.

4

Bicriteria scheduling of minimizing maximum lateness and makespan on a serial-batching machine

He C., Lin Y., Yuan J.

Foundations of Computing and Decision Sciences

|

2008

|

Vol. 33, No. 4

369-376

EN

This paper studies the bicriteria problem of scheduling n jobs on a serial-batching machine to minimize maximum lateness and makespan simultaneously. A serial-batching machine is a machine that can handle up to b jobs in a batch and jobs in a batch start and complete respectively at the same time and the processing time of a batch is equal to the sum of the processing times of jobs in the batch. When a new batch starts, a constant setup time s occurs. We concentrate on the unbounded model, where 6 > n. We present an O(n2) algorithm for finding all Pareto optimal solutions of this bicriteria scheduling problem.