43,015 research outputs found
Cryptanalysis of Yang-Wang-Chang's Password Authentication Scheme with Smart Cards
In 2005, Yang, Wang, and Chang proposed an improved timestamp-based password
authentication scheme in an attempt to overcome the flaws of Yang-Shieh_s
legendary timestamp-based remote authentication scheme using smart cards. After
analyzing the improved scheme proposed by Yang-Wang-Chang, we have found that
their scheme is still insecure and vulnerable to four types of forgery attacks.
Hence, in this paper, we prove that, their claim that their scheme is
intractable is incorrect. Also, we show that even an attack based on Sun et
al._s attack could be launched against their scheme which they claimed to
resolve with their proposal.Comment: 3 Page
Empat atlet Sukan SEA FSKTM dirai
SERDANG, 29 Dis – Empat atlet negara yang merupakan pelajar Fakulti Sains Komputer dan Teknologi Maklumat (FSKTM) Universiti Putra Malaysia (UPM) diraikan dalam majlis penghargaan kerana kecemerlangan pada Sukan SEA 2011 Indonesia bulan lalu.
Tiga daripadanya yang meraih pingat emas ialah atlet lawan pedang, Liong Ming Chang, S. Kannathasan (olahraga), K. Thegarajan (karate-do), sementara Koo Chee Zhong (wusyu) pula meraih pingat perak
A Research on Chang Chiens Reform ideas
Chang Chien 1853-1926 was a native of Nant ung Kiangsu In spite of the Various works on Chang Chien which testify to the significance of his role in modern China Chang Chien s Reform ideas is still not well-researched The purposes of this paper are firstly to analyze Chang Chien s Reform ideas systematically and clearly in the hope that it may become a useful reference for researchers on modern Chinese political thought and secondly to stimulate scholars for further research This paper depends more on basic source materials rather than second-hand data Among various source materials Chang Chien s Diary The Nine Records of Chang Chien and The Complete Work of Chang Chien are the most important Chang Chien s Reform ideas may be summarized as follows 1 taking notice of both economic basis and superstructure 2 elitism 3 pragmatism 4 concept of limited change 5 gradualism 6 golden means and 7 government by the peopl
MB 780 Cross-Cultural Christian Discipling
Chang, K. C. 1977 “Introduction.” In Food in Chinese Culture: Anthropological and Historical Perspectives. K. C. Chang, ed. Pp. 3-21. New Haven and London: Yale University Press. Located in the custom course packet. Eliade, Mircea 1959 The Sacred and the Profane: The ature of Religion. Trans. Willard R. Trask. New York: Harcourt, Brace & World. Folkert, Kendall W., ed. by John E. Cort 1991 “A Thematic Course in the Study of Religion.” Tracing Common Themes: Comparative Courses in the Study of Religion. Studies in the Humanities. John B. Carman and Steven P. Hopkins, eds. Pp. 19-36. Atlanta, GA: Scholars Press. Located in the custom course packet. Neihardt, John G. 1988 [1932] Black Elk Speaks. Lincoln and London: University of Nebraska Press. Turner, Victor 1977 [1969] The Ritual Process: Structure and Anti-Structure. Ithaca, NY: Cornell University Press. Visser, Margaret 1991 “Behaving.” In The Rituals of Dinner: The Origins, Evolution, Eccentricities, and Meaning of Table Manners. Idem. Pp. 1-37. Toronto: Harper Collins. Located in the custom course packet. Zahniser, A. H. Mathias 1997 Symbol and Ceremony: Making Disciples Across Cultures. Monrovia, CA: MARC Publications.https://place.asburyseminary.edu/syllabi/1462/thumbnail.jp
New Classes of Distributed Time Complexity
A number of recent papers -- e.g. Brandt et al. (STOC 2016), Chang et al.
(FOCS 2016), Ghaffari & Su (SODA 2017), Brandt et al. (PODC 2017), and Chang &
Pettie (FOCS 2017) -- have advanced our understanding of one of the most
fundamental questions in theory of distributed computing: what are the possible
time complexity classes of LCL problems in the LOCAL model? In essence, we have
a graph problem in which a solution can be verified by checking all
radius- neighbourhoods, and the question is what is the smallest such
that a solution can be computed so that each node chooses its own output based
on its radius- neighbourhood. Here is the distributed time complexity of
.
The time complexity classes for deterministic algorithms in bounded-degree
graphs that are known to exist by prior work are , , , , and . It is also known
that there are two gaps: one between and , and
another between and . It has been conjectured
that many more gaps exist, and that the overall time hierarchy is relatively
simple -- indeed, this is known to be the case in restricted graph families
such as cycles and grids.
We show that the picture is much more diverse than previously expected. We
present a general technique for engineering LCL problems with numerous
different deterministic time complexities, including
for any , for any , and
for any in the high end of the complexity
spectrum, and for any ,
for any , and
for any in the low end; here
is a positive rational number
Results of Archaeological Excavations Conducted at the Rakhat Monument in Almaty Region (Based on the Reporting Materials for 2015-2016)
In the article was described the geographical location of the settlement area andunique features of the region Rakhat During 1994-2005 settlement area was carried out archaeological excavation of the joint Kazakh-American expedition under the leadership by K M Baipakov F P Grigoriev K Chang There were done expertise and description to the archaeological excavation of monuments which located in settlement area of Rakhat in the Institute of Archaeology named after A Kh Margulan in 2004 As well as in the Upper Paleolithic place the various levels of mineral excavation exploration work were characterized fully by the leadership of O N Artyukova in the location of Rakhat in 2006-200
- …