Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Ng, C. Y." wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
An identity-based broadcast encryption scheme for mobile ad hoc networks
Autorzy:
Ng, C. Y.
Mu, Y.
Susilo, W.
Powiązania:
https://bibliotekanauki.pl/articles/309104.pdf
Data publikacji:
2006
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
dynamic mobile ad hoc network
identity-based
non-interactive
secure communication protocol
group key management
Opis:
Dynamic ad hoc networks facilitate interconnections between mobile devices without the support of any network infrastructure. In this paper, we propose a secure identity-based ad hoc protocol for mobile devices to construct a group key for a setup of a secure communication network in an efficient way and support dynamic changing of network topology. Unlike group key management protocols proposed previously in the literature, mobile devices can use our protocol to construct the group key by observing the others' identity, like the MAC address, which distinguishes the device from the others. In contrast to other interactive protocols, we only need one broadcast to setup the group key and member removal is also highly efficient. Finally, we discuss the security issues and provide security proofs for our protocol.
Źródło:
Journal of Telecommunications and Information Technology; 2006, 1; 24-29
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Batch scheduling of deteriorating products
Autorzy:
Barketau, M. S.
Cheng, T. C. E.
Kovalyov, M. Y.
Ng, C. T. D.
Powiązania:
https://bibliotekanauki.pl/articles/375908.pdf
Data publikacji:
2007
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
scheduling
batching
remanufacturing
deterioration
Opis:
In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job's waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. Each batch starts from the setup time S. Jobs which are assigned to the batch are being prepared for the processing during time S0 < S. After this preparation they are ready to be processed one by one. The non-negative number bi is associated with job i. The processing time of the i-th job is equal to bi(si - (si(b) + S0)), where si(b) and si are the starting time of the b-th batch to which the i-th job belongs and the starting time of this job, respectively. The objective is to minimize the completion time of the last job. We show that the problem is NP-hard. After that we present an O(N) time algorithm solving the problem optimally for the case bi = b. We further present an O(N2) time approximation algorithm with a performance guarantee 2.
Źródło:
Decision Making in Manufacturing and Services; 2007, 1, 1-2; 25-34
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies