|
[1] M. Naor and A. Shamir, "Visual Cryptography" Advances in Cryptology-Eurocrypt "94, Lecture Notes in Computer Science, vol. 950, pp. 1-12, 1995. [2] G. Ateniese, C. Blundo, A. D. Santis, D. R. Stinson,"Visual Cryptography for GeneralAccess Structures", Information and Computation, vol. 129, no. 2, pp. 86-106, 1996. [3] G. Ateniese, C. Blundo, A. D. Santis, and D. R. Stinson, "Extended Schemes for VisualCryptography," Theoretical Computer Science, 1996. [4] C. Blundo, A. D. Santis, M. Naor. "Visual cryptography for grey level images," Infor-mation Processing Letters, vol. 75, pp. 255-259, 2000. [5] L. A. MacPherson, Grey Level Visual Cryptography for General Access Structures, Mas-ter Thesis, Master of Mathematics in Computer Science, Waterloo, Ontario, Canada,2002. [6] E. Verheul and H. V. Tilborg, "Constructions and Properties Of k out Of n Visual SecretSharing Schemes," Designs, Codes and Cryptography, vol. 11, No. 2, pp. 179-196, 1997. [7] G. Ateniese, C. Blundo, A. D. Santis, and D. R. Stinson,"Extended Capabilities forVisual Cryptography," Theoretical Computer Science, 1999. [8] B. Schneier, Applied Cryptography, John Wiley, second ed., 1996.[9] G.S. Vernam, “Ciper Printing Telegraph Systems for Secret Wire and Radio Telegraphic Communications," J. Amer. Inst. Elec. Eng., vol. 55, pp. 109-115, 1926. [10] M. Naor, B. Pinkas, "Visual Authentication and Identification," CRYPTO, pp. 322-336,1997. [11] T. W. Yue, A Goal-Driven Neural Network Approach for Combinatorial Optimizationand Invariant Pattern Recognition, Phd''s Thesis, Department of Computer Engineering,National Taiwan University, Taiwan, 1992. [12] J. J. Hopfield, "Neural Networks and Physical Systems with Emergent Collective Com-putational Abilities," Proc. Natl. Acad. Sci. USA, vol.79, pp. 2554-2558, April 1982. [13] J. J. Hopfield, "Neural Networks and Physical Systems with Emergent Collective Com-putational Abilities," Proc. Natl. Acad. Sci. USA, vol. 79, pp. 2554-2558, April 1982. [14] J. J. Hopfield, "Neurons with Graded Response Have Collective Computational Prop-erties Like Those of Two-State Neurons," Proc. Natl. Acad. Sci. USA, vol. 81, pp.3088-3092, May 1984. [15] R. P. Lippmann,"An Introduction to Computing with Neural Nets," IEEE ASSP Mag-azine, pp. 4-22, April 1987. [16] K. Tsutsumi and K. Nakajima, "Dynamics and local minima of a simple neural networkfor optimization,", Proceedings. IJCNN, vol. 1 , pp. 353-358, 2001. [16] E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machine, Wiley and Sons,Chichester, England, 1989. [17] D. H. Ackley, G. E. Hinton, and T. J. Sejnowski, "A Learning Algorithm for BoltzmannMachine," Cognitive Science, vol. 9, pp. 147-169, 1985. [18] H. Jeong, J. H. Park, “Lower Bounds of Annealing Schedule for Boltzmann and CauchyMachines," Proceeding IEEE International Joint Conference on Neural Networks, vol.1, pp. 581-586, 18-22 June 1989. [19] Y. Takefuji and H. Szu, “Design of Parallel Distributed Cauchy Machines," Proceedingsof IEEE International Joint Conference on Neural Networks, vol. 1, pp. 529-532, 1989. [20] Y. Akiyama, A. Yamashita, M. Kajiura, and H. Aiso, "Combinatorial Optimizationwith Gaussian Machines," Proceedings IEEE International Joint Conference on NeuralNetworks, vol. 1, pp. 533-540, 1989. [21] B. Hajek, "Cooling schedules for optimal annealing," Mathematics of Operational Re-search, vol 13, pp. 311-329, 1988. [22] S. Kirkpatrick, C. D. Gelatt and M. P. Vecchi, "Optimization by simulated annealing,"Science, vol. 220, no. 4598, pp. 671-680, May 1983. [23] M. R. Garey, R. L. Graham, and D. S. Johnson. "Some NP-Complete Geometric Prob-lems," In Conference Record of the Eighth Annual ACM Symposium on Theory of Com-puting, pp. 10-22, Hershey, Pennsylvania, 3-5 May 1976. [24] M. R. Garey and D. S. Johnson, Computer and Tntractability: A Guide to the Theoryof NP-Completeness, New York, NY: Freeman, 1979. [25] H. R. Lewis, C. H. Papadimitriou, "Elements of The Theory of Computation," pp. 275-351,Prentice Hall International Editions, 1998. [26] B. DeBacker and H. Beringer, "Combinatorial Problem Solving in Constraint LogicProgramming with Cooperating Solvers", In C. Beierle and L. Plumer, editors. LogicProgramming: Formal Methods and Practical Applications, pp. 245-272, 1996. [27] O. Eriksson, Y. Zhou, and A. Elofsson, "Side Chain-Positioning As An Integer Pro-gramming Problem," 1st Workshop on Algorithms in BioInformatics, WABI 2001, Pro-ceedings, Lecture Notes in Computer Science 2149, ISBN 3-540-42516-0, pp. 128-141,Springer 2001. [28] T. W. Yue and S. C. Chiang, "Quench, Goal-Matching and Converge | The Three-Phase Reasoning Of a Q''tron Neual Network," Proceedings of the IASTED InternationalConference on Arti_cial and Computational Intelligence, pp. 54-59, 2002. [29] A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11,pp. 612–613, 1979. [30] M. Tompa and H. Woll, "How to share a secret with cheaters," J.Cryptol., vol. 1, no. 2, pp. 133–138, 1988. [31] W.-G. Tzeng and C.-M. Hu,"Anewapproach for visual cryptography,"Designs, Codes, Cryptog., vol. 27, no. 3, pp. 207–227, 2002. [32] E. R. Verheul and H. C. A. Van Tilborg,"Constructions and propertiesof k out of n visual secret sharing schemes," Designs, Codes, Cryptog,,vol. 11, no. 2, pp. 179–196, 1997. [33] D. Q. Viet and K. Kurosawa, "Almost ideal contrast visual cryptographywith reversing," in Proc, Topics in Cryptology, 2004, vol. 2964,LNCS, pp. 353–365. [34] C.-N. Yang, "New visual secret sharing schemes using probabilisticmethod,” Pattern Recognit. Lett., vol. 25, no. 4, pp. 481–494, 2004. [35] C.-N. Yang and C.-S. Laih, "Some new types of visual secret sharingschemes,” in Proc. Nat. Computer Symp., 1999, vol. 3, pp. 260–268. [36] G.S. Vernam, "Ciper Printing Telegraph Systems for Secret Wire and Radio TelegraphicCommunications," J. Amer. Inst. Elec. Eng., vol. 55, pp. 109-115, 1926. [37] Y. Zhang, R.E. Webber, "Space Di_usion An Improved Parallel Halftoning TechniqueUsing Space_lling Curves," Proc. of SIGGRAPH 93, ACM Computer Graphics, Annual Conference Series, pp. 305-312, 1993. [38] Y. Zhang, "Adaptive Ordered Dither," CVGIP: Graphical Model and Image Processingvol. 59, no. 1, pp. 49-53, 1997. [39] Y. T. Zhou, R. Chellappa, A. Vaid, and B. K. Jenkins, "Image Resoration Using aNeural Network," IEEE Trans. Acoustics, Speech, and Signal Processing, vol. 36, pp. 1141-1151, 1998. [40] Z. Zhou, G. R. Arce, G. Di Crescenzo, "Halftone Visual Cryptography," Proceedings ofInternational Conference on Image Processings, vol. 1, pp. 521-524, 2003. [41] R. Ulichney, Digital Halftoning, Cambridge, MA: MIT Press. third ed., 1990. [42] E. Verheul and H. V. Tilborg, "Constructions and Properties Of k out Of n Visual SecretSharing Schemes," Designs, Codes and Cryptography, vol. 11, No. 2, pp. 179-196, 1997. [43] Su-Chen Chiang"Visual Cryptography Using Q’tron Neural Networks". [44] Bluetooth 1.06 Specification [45] Wireless LAN Medium Accers Control (MAC) and Physical Layer(PHY)specifications: Higher-Spccd Physical Laycr Extension in thc 2.4GHz band, IEEE Std 802.1 Ib-I999 [46]M. Hashimoto, K. Term", T. Saito, 7. Okamoto, "A Home Network
|