Download - Academy Publisher

More documents

Recommendations

Info

interpolated image using the proposed method has the best performance. It has higher contrast, little zigzag artifact, and little ringing noise. Figure 4. The local area of interpolated images V. CONCLUSION An interpolation method based on parabola interpolation with an adaptive error compensation has been proposed. It has better performance than EASE and bilinear interpolation. An appropriate gradient direction is discussed to predict 2-D pixels. It is simpler than EASE and introduces little artifacts on the 2-D images. Simulation results show the superior performance of the proposed method in terms of artifact and contrast. REFERENCES [1] R.G. Keys, “Cubic convolution interpolation for digital image processing,” IEEE Trans. acoustics, speech, and signal processing, vol. assp-29, NO.6, pp:1153-1160, Dec. 1981. [2] Y. Cha and S. Kim, “The error-amended sharp edge (EASE) scheme for image zooming”, IEEE Trans. Image processing, vol.16, NO.6,pp:1496-1505,Jun.2007 [3] F. Pan, X. Lin, Susanto Ragardja , “Fast mode decision algorithm for intraprediction in H.264/AVC video coding,” IEEE Trans. Circuits and systems for video technology, vol.15, NO.7,pp:813-822 Jul.2005. [4] R. R. Schultz and R.L. Stevenson, ”A Bayesian approach to image expansion for improved definition,” IEEE Trans. Image processing, vol.3, NO.3, pp:233-241, May.1994. [5] Q.Y. LI, N.C. Wang, and D.Y. Yi, “Numeric analysis” fourth edition, Tsinghua University Press,pp:23-30. (in Chinese) [6] L. Zhang and X.L. Wu, “An edge-guided image interpolation algorithm via directional filtering and data fusion,” IEEE Trans. Image processing, vol.15, NO.8,pp:2226-2238, Aug,2006. [7] H .W. Park and Y.L. Lee, “A postprocessing method for reducing quantization effects in low bit-rate moving picture coding,” IEEE Trans. Circuits and systems for video technology, vol.9, NO.1,pp:161-171,Feb,1999. [8] Z. Wang, A.C. Bovik and H. R. Sheikh, “Image quanlity assessment : from error visibility to structural similarity,”IEEE trans. Image processing,vol.13,NO.4,pp:600-612,Apr,2004 270
ISBN 978-952-5726-09-1 (Print) Proceedings of the Second International Symposium on Networking and Network Security (ISNNS ’10) Jinggangshan, P. R. China, 2-4, April. 2010, pp. 271-274 Cloud Trust Model in E-Commerce Min Wu Jiaxing College, Jia Xing, China Email: swjtu_wm@163.com Abstract—Trust is one of the most important concerns in the E-commerce’development. In view of the significance of trust management in E-commerce, a model of trust in Electronic commerce based on the cloud computing is prospered in the paper. The Cloud Trust Model (CTM) offers cloud trust services to solve the issues of trust management in E-commerce,such as the computing of . social network analysis (SNA). Index Terms—Electronic Commerce , Trust Model , Cloud Computing , SNA I. INTRODUCTION During the Internet age, online environment is now part of everyday life. As a result, Web applications have become a major tool for connecting consumers, partners, and employees to company applications using the Internet as an open and global network.E-commerce is a popular and growing Web application which enables customers to achieve a variety of purposes and services. Electronic commerce lets companies integrate internal and external business processes through information and communication technologies. Companies conduct these business processes over intranets, extranets, and the Internet. E-commerce lets businesses reduce costs, attain greater market reach, and develop closer partner relationships. Numerous e-commerce companies have created very profitable businesses since pioneering e-commerce traders (such as Amazon.com) emerged. However, using the Internet as the underlying backbone network has led to new risks and concerns. Often, industry analysts cite trust and security as the main hurdles in growing e-commerce.[1][2] In the abstract sense, trust is the extent to which one party measures the other party’s willingness and ability to act in the measuring party’s interest.[3] The notion of trust varies in different contexts. Broadly speaking, there are two classes of trust computing: security-oriented trust computing and non-security-oriented trust computing. [4] In consequence, security can be regarded as one of the trust issues. In security-oriented trust computing, trust provides a mechanism for enhancing security, covering issues of authentication, authorization, access control, and privacy. [4]Trust is the degree by which a target object (such as software, a device, a server, or any data they deliver) is considered secure. Reputation-based trust evaluation correlates to non-security-oriented trust computing. In general, a service gains a good reputation after it has accumulated good quality services over a long time period. The evaluation is usually based on customer ratings. However, to compute the final reputation value correctly, studies on relationships among raters and ratees are necessary, and might help reduce the rating noise (which we discuss further later on) and obtain more objective trust results.[5] We can view security-oriented trust and non-security-oriented trust as the trust in EC respectively from a technological perspective and a systemic perspective. In this paper, we will discuss mainly the latter. II. CATEGORY OF TRUST EVALUATION Three are three types of trust management in EC according to trust management architecture. A. Centralized Trust Management Centralized trust management system puts up a centralized management server, in which service clients or buyers report ratings to a trust authority after transactions. The server manages service providers’ and clients’ portfolio data as well as service providers’ trust data. Some well-known e-commerce websites have taken Centralized trust management system to build up trust, such as eBay and Taobao set forth internal credit rating mechanisms. For purposes of E-Commerce, we can define a trusted third party as a widely accepted, reliable, independent, and highly secure entity that generates trust through attestation or certification.[2]Compared with the legal mechanism, credit mechanism is a kind of lower-cost mechanism, which can also apply to E-Commerce environment. [6] To guarantee security and reliability of e-commerce, dozens of third-party online authorities has been fostered out of the legal framework, among which the online authentication institution through guarantee or implementation supervision by a third party to prevent deceptive acts is the most effective. One of the most typical third-party payment method is ‘Zhi-Fu-Bao’, which has applied by many web sites. At Taobao, after each transaction, a buyer can give feedback to the system about the seller’s service quality that can be positive, neutral, or negative. Taobao stores this rating at a centralized management location. It calculates the feedback score via S = P – N, where P is the number of positive ratings left by members (customers) and N is the number of negative ratings. Taobao displays the S value on the seller’s Web page. Another value R = (P – N)/(P + N) (1 ≥ R ≥ 0) is the positive feedback rate. B. Decentralized Trust Management A decentralized (such as P2P) architecture trust management, which also has its benefits.[7]The typic example of the decentraliazed trust management of © 2010 ACADEMY PUBLISHER AP-PROC-CS-10CN006 271
Page 1 and 2:
Proceedings The Second Internationa
Page 3 and 4:
Table of Contents Message from the
Page 5 and 6:
Zuming Xiao, Zhan Guo, Bin Tan, and
Page 7 and 8:
Message from the Symposium Chairs T
Page 9 and 10:
Second International Symposium on N
Page 11 and 12:
ISBN 978-952-5726-09-1 (Print) Proc
Page 13 and 14:
model that can deal with time serie
Page 15 and 16:
ISBN 978-952-5726-09-1 (Print) Proc
Page 17 and 18:
training for the Wushu competition
Page 19 and 20:
ISBN 978-952-5726-09-1 (Print) Proc
Page 21 and 22:
information, called weak uncertain
Page 23 and 24:
Student side Student side Student s
Page 25 and 26:
ISBN 978-952-5726-09-1 (Print) Proc
Page 27 and 28:
If we define element of student as
Page 29 and 30:
ISBN 978-952-5726-09-1 (Print) Proc
Page 31 and 32:
QoS, each frame data is divided int
Page 33 and 34:
ISBN 978-952-5726-09-1 (Print) Proc
Page 35 and 36:
for Imaging Two and Three Phase Flo
Page 37 and 38:
ISBN 978-952-5726-09-1 (Print) Proc
Page 39 and 40:
A. Profiling&following control algo
Page 41 and 42:
Research and Realization about Conv
Page 43 and 44:
PDF document structure is a tree st
Page 45 and 46:
ISBN 978-952-5726-09-1 (Print) Proc
Page 47 and 48:
support 10 Mb / s. But ENC28J60 onl
Page 49 and 50:
ISBN 978-952-5726-09-1 (Print) Proc
Page 51 and 52:
condition the first byte output of
Page 53 and 54:
ISBN 978-952-5726-09-1 (Print) Proc
Page 55 and 56:
According to maximum membership deg
Page 57 and 58:
ISBN 978-952-5726-09-1 (Print) Proc
Page 59 and 60:
ubber according to the mass ratio o
Page 61 and 62:
Ⅲ. AN IMPROVED DNA ALGORITHM FOR
Page 63 and 64:
Ⅴ.CONCLUSION REMARKS DNA computer
Page 65 and 66:
its first child q 1 on the left, th
Page 67 and 68:
chains can greatly improve efficien
Page 69 and 70:
II. RELATED WORK A. Mobile Service
Page 71 and 72:
special services. SOAP is used to b
Page 73 and 74:
detection methods of DDoS attacks m
Page 75 and 76:
Step4 calculate the new subordinate
Page 77 and 78:
Figure 1. An analysis of the partit
Page 79 and 80:
ISBN 978-952-5726-09-1 (Print) Proc
Page 81 and 82:
The preceding three formulas can be
Page 83 and 84:
ISBN 978-952-5726-09-1 (Print) Proc
Page 85 and 86:
And the decay speed of buffer seque
Page 87 and 88:
ISBN 978-952-5726-09-1 (Print) Proc
Page 89 and 90:
distance of view point. Given that
Page 91 and 92:
ISBN 978-952-5726-09-1 (Print) Proc
Page 93 and 94:
Ⅳ. EVALUATION OF BLENDED LEARNING
Page 95 and 96:
ISBN 978-952-5726-09-1 (Print) Proc
Page 97 and 98:
symmetric with respect to the origi
Page 99 and 100:
ISBN 978-952-5726-09-1 (Print) Proc
Page 101 and 102:
each sample belongs to each categor
Page 103 and 104:
ISBN 978-952-5726-09-1 (Print) Proc
Page 105 and 106:
A. Data Preparing To generate our t
Page 107 and 108:
ISBN 978-952-5726-09-1 (Print) Proc
Page 109 and 110:
oth α and β . determination of Qu
Page 111 and 112:
ISBN 978-952-5726-09-1 (Print) Proc
Page 113 and 114:
Strong earthquake 0.1< M L
Page 115 and 116:
ISBN 978-952-5726-09-1 (Print) Proc
Page 117 and 118:
indirect causes, and the logical re
Page 119 and 120:
egression. Granger causality test i
Page 121 and 122:
B. Evaluation We have evaluated thi
Page 123 and 124:
used as a source and neighboring ce
Page 125 and 126:
Figure 3. Drainage networks generat
Page 127 and 128:
Combinational logic unit failures i
Page 129 and 130:
Tabal.1 Combinational fault logic t
Page 131 and 132:
under the endorsement of both the m
Page 133 and 134:
TABLE I. DESCRIPTION OF PROPOSITION
Page 135 and 136:
Figure 2. The process of the invers
Page 137 and 138:
Figure 9. (a)the original image.(b)
Page 139 and 140:
ISBN 978-952-5726-09-1 (Print) Proc
Page 141 and 142:
In order to reduce to the number of
Page 143 and 144:
ISBN 978-952-5726-09-1 (Print) Proc
Page 145 and 146:
that studying being going to be to
Page 147 and 148:
Reference[10] analyzed the evolutio
Page 149 and 150:
module, communication module, apper
Page 151 and 152:
After the comprehensive performance
Page 153 and 154:
system testing can be seen that the
Page 155 and 156:
III. AUTONOMIC RESOURCE ALLOCATION
Page 157 and 158:
The QoE i (T i ) is the ith user’
Page 159 and 160:
ISBN 978-952-5726-09-1 (Print) Proc
Page 161 and 162:
nodes will be formed one cluster, t
Page 163 and 164:
ISBN 978-952-5726-09-1 (Print) Proc
Page 165 and 166:
Where n is the number of data point
Page 167 and 168:
ISBN 978-952-5726-09-1 (Print) Proc
Page 169 and 170:
Keyboard event Application User mod
Page 171 and 172:
ISBN 978-952-5726-09-1 (Print) Proc
Page 173 and 174:
SQL Azure will eventually include a
Page 175 and 176:
ISBN 978-952-5726-09-1 (Print) Proc
Page 177 and 178:
The nodes in the suffix tree are dr
Page 179 and 180:
[3] Y. Li, S. M. Chung, and J. D. H
Page 181 and 182:
some drilling fluid produces hydrog
Page 183 and 184:
"normalization", whose membership b
Page 185 and 186:
and minimum structural elements in
Page 187 and 188:
esults of the spatial transform par
Page 189 and 190:
B. Research on protocol actions Com
Page 191 and 192:
ACKNOWLEDGMENT This work is funded
Page 193 and 194:
A. Problem Description In a small b
Page 195 and 196:
[4] Huang, Hung, and J. Y. jen Hsu.
Page 197 and 198:
Further by calculating, the followi
Page 199 and 200:
TABLE II. THE CONCENTRATION BETWEEN
Page 201 and 202:
private key that obtained by using
Page 203 and 204:
ISBN 978-952-5726-09-1 (Print) Proc
Page 205 and 206:
ontology, and the domain dictionary
Page 207 and 208:
ISBN 978-952-5726-09-1 (Print) Proc
Page 209 and 210:
Eq.4 is NP-hard and can be solved b
Page 211 and 212:
ISBN 978-952-5726-09-1 (Print) Proc
Page 213 and 214:
Where: G i is the selection field o
Page 215 and 216:
If there is X j in a generation, wh
Page 217 and 218:
Theorem 2.4([10]). Let L 1 and L 2
Page 219 and 220:
The relation between the lattice im
Page 221 and 222:
Figure 2. Example of single-step de
Page 223 and 224:
evocation and the fourth group stor
Page 225 and 226:
focused mainly on rule-based forms
Page 227 and 228:
Ⅵ. CONCLUSION Figure 6. The Flask
Page 229 and 230: EDCF in comparison with DCF, has so
Page 231 and 232: B. Simulation results and analysis
Page 233 and 234: ISBN 978-952-5726-09-1 (Print) Proc
Page 235 and 236: in routing table. When search resou
Page 239 and 240: others through the selective emotio
Page 241 and 242: such as weather information, techno
Page 243 and 244: the opening window, a related page
Page 245 and 246: 1) Process context storage areas. I
Page 247 and 248: V. CONCLUSION In this thesis, sCPU-
Page 249 and 250: main types of horizontal search env
Page 251 and 252: Enterprise Portal security provides
Page 253 and 254: () t = [ S () t S () t ] T N S ,...
Page 255 and 256: [2] Kumaravel, N., and Kavitha, V.,
Page 257 and 258: output, so BP network has been wide
Page 259 and 260: input to the artificial neural netw
Page 261 and 262: (2) In a process (tokens from outsi
Page 263 and 264: The reduction process consists of t
Page 265 and 266: all eight normal vectors are identi
Page 267 and 268: is B object , and the number of emp
Page 269 and 270: xi, j y' = εα ( (1 + tanh( )) −
Page 271 and 272: Error 8000 7000 6000 5000 4000 3000
Page 273 and 274: Architecture (AMBA) a new bus archi
Page 275 and 276: In order to ensure the smooth proce
Page 279: In this paper, we adopt two Sobel o
Page 283 and 284: four layers.The far right of the gr
Page 287 and 288: TABLE II. OPERATIONAL EMPLOYEE TABL
Page 289 and 290: A. Object-relational Type To audit
Page 291 and 292: to execution time. Also, DBA would
Page 293 and 294: Liping Chen .......................
show all

Download - Academy Publisher

Create successful ePaper yourself

Delete template?

Save as template?