By Jing-bo He, Sheng-liang Hu, Zhong Liu (auth.), Xingui He, Ertian Hua, Yun Lin, Xiaozhu Liu (eds.)

ISBN-10: 9400718381

ISBN-13: 9789400718388

ISBN-10: 940071839X

ISBN-13: 9789400718395

The convention on desktop, Informatics, Cybernetics and purposes 2011 goals to facilitate an alternate of data on most sensible practices for the newest study advances within the zone of computing device, informatics, cybernetics and functions, which customarily contains machine technology and engineering, informatics, cybernetics, regulate structures, verbal exchange and community platforms, applied sciences and functions, others and rising new topics.

Show description

Read or Download Computer, Informatics, Cybernetics and Applications: Proceedings of the CICA 2011 PDF

Similar nonfiction_7 books

Get Nonlinear Crack Models for Nonmetallic Materials PDF

During this quantity a survey of the main proper nonlinear crack types is equipped, with the aim of interpreting the nonlinear mechanical results taking place on the tip of macrocracks in quasi-brittle fabrics - akin to concrete, rocks, ceramics, polymers, high-strength steel alloys - and in brittle-matrix fibre-reinforced composites.

Extra info for Computer, Informatics, Cybernetics and Applications: Proceedings of the CICA 2011

Sample text

Duan S, Cao Z, Lu R (2004) Robust ID-based threshold signcryption scheme from pairings. International conference on information security, Shanghai, pp 33–37 24. Peng C, Li X (2005) An identity-based threshold signcryption scheme with semantic security. Computational intelligence and security 2005. LNAI, vol 3902. Springer, Berlin, pp 173–179 25. Libert B, Quisquater JJ (2003) Anew identity based signcryption schemes from pairings. IEEE information theory workshop, Paris, pp 155–158 26. Li F, Yu Y (2008) An efficient and provably secure ID-based threshold signcryption scheme, ICCCAS.

2, m), …, (M, m) (region C) and saving the same element (n, l,…). If K(2)[N-2, so two codes are chosen, continue next step, else k = k ? 1, and return to (2); (4) Calculate the values of P/C between code n and code n ? 1, n ? 2, …, M, through judging if P/C [ V, respectively put 1 or 0 to the relevant position of matrix (n ? 1, n), (n ? 2, n), …, (M, n), calculating K(3) which denotes the number of the same element whose value is 1 between (k, n ? 1),(k, n ? 2),ÁÁÁ(k, M) (region F) and (n ? 1, n), (n ?

1, and return to (2); (5) Next step is the same as 3 or 4, and terminate until N codes are chosen. 4 shows the process of searching, ellipses show the region of codes needed to be filled with appropriate value 1 or 0 in every step. The algorithm reduces effectively the unnecessary calculating time by judging the possibility of finding enough optical codes in next steps when every new code is added to the selected code set, and promises that P/C of the code set is beyond threshold by judging the P/C between every new code and the chosen codes.

Download PDF sample

Computer, Informatics, Cybernetics and Applications: Proceedings of the CICA 2011 by Jing-bo He, Sheng-liang Hu, Zhong Liu (auth.), Xingui He, Ertian Hua, Yun Lin, Xiaozhu Liu (eds.)


by Christopher
4.4

Rated 4.27 of 5 – based on 10 votes