A SECURE FRAMEWORK FOR PROTECTING IN PERSONALIZED WEB SEARCH Mrs. M.Sowjanya 1, Dr. P. Harini 2
|
|
- Leona Barker
- 8 years ago
- Views:
Transcription
1 A SECURE FRAMEWORK FOR PROTECTING IN PERSONALIZED WEB SEARCH Mrs. M.Sowjanya 1, Dr. P. Harini 2 1 II M.Tech. - II Sem., Dept. of CSE, St. Ann s College of Engineering. & Technology. Chirala, Andhra Pradesh -, INDIA, majetisowjanya@gmail.com 2 Professor &Head, Dept. of CSE, St. Ann s College of Engg. & Tech., Chirala, A. P, INDIA drharinicse@gmail.com ABSTRACT:- Present Days personalized web INTRODUCTION:- Search (PWS) has demonstrated its ability in alluring the way of distinctive inquiry advantages on the Internet. One of the decisions open to shoppers is customized web angle which shows question thing in perspective of the individual data of customer gave to the request supplier. It recommends a structure rang UPS which plans profile meanwhile keeping up insurance basically chose by buyer.even thus, confirmations accept that shoppers' reluctance to uncover their private information among pursuit has transform into a noteworthy trouble for the wide improvement of PWS. We reflect security barrier in PWS prerequisites that model customer inclinations as cutting edge buyer profiles. We propose a PWS framework called UPS that can adaptively total up profiles by inquiries while concerning customer decided security necessities. Our runtime suspicion goes for remarkable an assertion between two touchy estimations that measure the estimation of personalization and the security threat of disclosure the summed up profile. We demonstrate two covetous estimations, particularly GreedyDP and GreedyIL, for runtime presumption. We just as give an online figure framework to picking whether changing an inquiry is productive. Wide studies demonstrate the capacity of our framework. The investigative results likewise reveal that GreedyIL fundamentally assault from behind GreedyDP in regards to productivity. The web pilgrim has long transform into the most hazardous appearance for ordinary people looking for supportive information on the web. Notwithstanding, customers may experience disillusionment when web registries return immaterial results that don't meet their unaffected points. Such inconsequentiality is to an extraordinary level as a result of the mind blowing blended sack of customers' associations and establishments [12], furthermore the imprecision of literary works. Altered web look (PWS) is a [6] general arrangement of quest methodology going for giving better ordered records, which are specially designed for individual customer needs. As the expense, customer information must be collected and isolated to understand the customer likelihood behind the dispersed investigation. The clarifications to PWS can normally be considered into two types Click-log-based methods and Profile-based methods Click-log-based methods The clock log based techniques are direct they basically force predisposition to clicked pages in the client's inquiry history. 117
2 It can just chip away at rehashed inquiries from the same client, which is an in number constraint limiting its material. This policy has been performance well but it work on repetitive queries from same user which is a solid control to its applicability. Profile-based methods Profile-based techniques can be possibly successful for a wide range of questions, however are accounted for to be unpredictable under a few conditions. Enhance the search contribution with entangled client awareness models created from client summarizing procedures. PWS has shown more feasibility in attractive the nature of web inquiry as of late, with increasing utilization of individual and conduct data to profile its clients, which is generally accumulated definitely from question history, scanning history, navigate information bookmarks, client records et cetera. RELATED WORK:- Past works has focused on appealing inquiry yield on profile-based PWS. A few delineations for profile are accessible, some of them are term records/vectors or pack of words to identify with their profile while late work makes profile in different smoothed structure. The propelled representations are fabricated with existing weighted subject request/diagram, for instance, [22] Wikipedia or the different leveled profile is created by method for term-reiteration examination on the customer data. UPS framework can get any best in class exhibition. Two classes of security assurance issues for PWS are perceived. One class views security as extraordinary evidence of individual. Diverse considers data affectability as the security. Common written work lives up to expectations in for class one endeavor to challenge the security issue on individual levels, [7] which incorporates the pseudo personality, the social event character, no identity, [2],[18]and [16] no individual information. The primary level readiness is set up to fragile and the third and fourth levels are preposterous as a consequence of high cost in correspondence and cryptography. In this way, the present exercises focus on the second level. Online anonymity for PWS gives mystery by delivering a social event profile of k customers. Using this approach, [17 ]the association between the request and a single customer is broken. The pointless client profile (UUP) assertion blend questions among a social occasion of customers who issue them. In like manner no component can profile a recognized individual. The inadequacies of class one association are the high cost. In Class two arrangements, customers just conviction themselves and don't experience the acquaintance of their complete profiles with irrelevance server. Krause and Horvitz use genuine systems to take in a probabilistic model and after that utilization this model to make the nearby perfect deficient profile. Insurance Attractive altered web request anticipated a security assurance answer for PWS in light of cutting edge profiles. Utilizing a customer unfaltering edge, a summed up profile is created in a broad sense as a built up speak to realistic of the complete profile. This paper gives changed assurance security in PWS.[26] A 118
3 man can assign the level of security protection for her/his delicate qualities by designating "guarding center points" in the exploratory characterization of the tender property. In this way, this paper grants customer to re-try security basics in different smoothed customer profiles. representation taking into account a scientific categorization of information. Concerning the execution measures of PWS in the writing, Normalized Discounted Cumulative Gain (NDCG) [18] is a typical measure of the viability of a data recovery framework. In this section, we overview the related works. We focus on the literature of profile-based personalization and privacy protection in PWS system. Profile-Based Personalization Past takes a shot at profile-construct PWS basically center with respect to enhancing the hunt utility. The essential thought of these works is to tailor the query items by alluding to, frequently verifiably, a client profile that uncovers a person data objective. In the rest of this segment, we audit the past answers for PWS on two viewpoints, to be specific the representation of profiles, and the measure of the viability of personalization. Numerous profile representations are accessible in the writing to encourage diverse personalization procedures. Prior procedures use term records/vectors [5] or pack of words [2] to speak to their profile. In any case, latest works fabricate profiles in various leveled structures because of their more grounded distinct capacity, better versatility, and higher access productivity. Most of the various leveled representations are developed with existing weighted point chain of command/diagram, for example, ODP 1 [1], [14], [3], [15].Another work in [10] fabricates the various leveled profile consequently through term-recurrence investigation on the client information. In our proposed UPS system, we try not to concentrate on the usage of the client profiles. Really, our system can possibly embrace any various leveled Privacy Protection in PWS System For the most part there are two classes of security assurance issues for PWS. One class incorporates those treat protection as the ID of a person, as portrayed [20]. Alternate incorporates those consider the affectability of the information, especially the client profiles, presented to the PWS server. Average works in the writing of ensuring client IDs (class one) attempt to tackle the protection issue on distinctive levels, including the pseudo identity, the gathering character, no character, and no individual data [11]. Answer for the primary level is demonstrated to delicate the third and fourth levels are unreasonable because of high cost in correspondence what's more, cryptography. Accordingly, the current endeavors concentrate on the second level. Both [21] and [22] give online secrecy on client profiles by creating a gathering profile of k clients. Utilizing this approach, the linkage between the inquiry and a solitary client is broken. In [23] the pointless client profile (UUP) convention is proposed to rearrange inquiries among a gathering of clients who issue them. Thus any substance can't profile a specific person. These works expect the presence of a dependable outsider anonymizer, which is not promptly accessible over the Internet at vast. Viejo and Castell a-roca [24]use legacy informal organizations rather than the outsider to give a contorted client profile to the web crawler. In the plan, each client goes about as a pursuit 119
4 organization of his or her neighbors. They can choose to present the question for the benefit of who issued it, or forward it to different neighbors. The deficiencies of current arrangements in class one is the high cost acquainted due with the cooperation and correspondence. The arrangements in class two don't oblige outsider help or joint efforts between informal organization sections. In these arrangements, clients just trust themselves and can't endure the presentation of their complete profiles a namelessness server. In [12] Krause and Horvitz utilize factual systems to take in a probabilistic model, and afterward utilize this model to create the close ideal halfway profile. One primary impediment in this work is that it assembles the client profile as a limited arrangement of characteristics, and the probabilistic model is prepared through predefined regular inquiries. These suspicions are unreasonable in the connection of PWS [10] proposed a security insurance answer for PWS based on various leveled profiles. Utilizing a client determined edge, a summed up profile is gotten as a result as an established sub tree found that personalization may have distinctive impacts on distinctive inquiries. Inquiries with littler snap entropies, to be specific particular inquiries, are relied upon to advantage more from personalization, while those with bigger qualities (equivocal ones) are most certainly not. Additionally, the last may even bring about security exposure. In this way, the requirement for personalization gets to be faulty for such inquiries. Tee van gathers a set of elements of the inquiry to order questions by their click entropy. While these works are motivate in addressing whether to customize or not to, they accept the accessibility of enormous client inquiry logs (on the server side) and client input. In our UPS structure, we separate particular inquiries from vague ones taking into account a customer side arrangement utilizing the prescient inquiry utility metric. This paper is an expansion to our preparatory study reported. In the past work, we have proposed the model of UPS, together with an avaricious calculation GreedyDP (named as Greedy Utility) to bolster web profiling in light of prescient measurements of personalization utility and security hazard. In this paper, we expand and subtle element the execution of UPS. We broaden the metric of personalization utility to catch our three new perceptions. We additionally refine the assessment model of security danger to bolster client altered sensitivities. Besides, we propose another profile speculation calculation called GreedyIL. In light of three heuristics recently included the extension, the effectiveness and strength of the new calculation beats the old one altogether. of the complete profile. Sadly, this work does not address the inquiry utility, which is urgent for the administration nature of PWS. For examination, our methodology takes both the security necessity and the inquiry utility into record. A more vital property that recognizes our work is that we give customized security insurance in PWS. The idea of customized security insurance is first presented by Xiao and Tao [25] in Privacy-Preserving Data Distributed (PPDP). A man can indicate the level of security insurance for her/his touchy qualities by indicating "guarding hubs" in the scientific categorization of the delicate characteristic. Propel by this, we permit clients to tweak protection needs in their progressive client profiles. Beside the above works, a few late studies have brought up an intriguing issue that concerns the security assurance in PWS. 120
5 METHODOLOGY Client-side Networking question mediator. Finally, the delegate shows the basic result or reruns them with customer profile. Fig. Attack model of personalized web search. Fig. System architecture of UPS. As demonstrated in figure UPS contains number of clients/customers and a server for adequate client s request. In client's machine,[1],[26] the online profiler is executed as pursuit middle person whom keeps up customers profile in cutting edge arrangement of centers moreover keep up the customer fearless security crucial as a plan of touchy centers. There are two stage, particularly Offline and Online stage for the structure. Among Offline, a different leveled customer profile is made and customer decided security condition is stamped on it. The request let pass by customer is dealt with in the online stage as: Right when customer flames an inquiry on to the client, middle of the road produces customer profile in run time. The benefit is summed up customer profile considering the security essentials. By then, the request nearby summed up profile of customer is sent to PWS server for adjusted web look for. The yield is redone and the response is sent back to In this Attack Model defense against a typical model of privacy attack, namely snooping. As shown in Fig, to corrupt Alice s privacy, the observer Eve successfully intercepts the communication between Alice and the PWS-server via some measures, such as man-in-them idle attack,[22]attacking the server, and so on. Subsequently, whenever Alice concerns a query q, the entire copy of q together with a runtime profile G will be captured by Eve. Based on G, Eve will attempt to touch the complex nodes of Alice by improving the sections hidden from the original H and computing a assurance for each recovered topic, trusting on the background knowledge in the publicly available classification source R. Note that in our attack model, Eve is viewed as an opposition satisfying the following conventions: Knowledge restricted. The background knowledge of the supporter is limited to the classification source R. Both the profile H and privacy are defined based on R, Session bounded. None of previously captured information is available for copying the same object in a long duration. In other words, [13 ]the snooping will be started and ended within a single query session. The above assumptions seem strong, but are sensible in repetition. This is due to the fact that the 121
6 majority of privacy attacks on the web are assumed by some automatic programs for sending under attack (spam) ads to a large amount of PWS-users. These programs rarely act as a real person that collects prolific information of a specific object for a long time as the latter is much more costly. If we consider the sensitivity of each sensitive topic as the cost of improving it, the privacy risk can be defined as the total (probabilistic) sensitivity of the sensitive nodes, which the adversary can probably recover from G. For fairness s among different users, we can normalize the privacy risk with, which stands for the total wealth of the user. Our approach to privacy protection of personalized web search has to keep this privacy risk under control. GREEDY ALGORITHM A greedy algorithm is an algorithm that follows the problem solving experimental of making the locally ideal choice at each stage with the hope of finding a global optimum. Greedy algorithm reflects easy to implement and simple method and decides next step that provide valuable result. In many problems, a greedy policy does not produce an ideal solution, but greedy inspective products locally ideal solutions that approximate a global optimal solution in a sensible time. GREEDY DISCRIMINATING POWER (DP) ALGORITHM This algorithm works in a bottom up manner. Starting with the leaf node, for every repetition, it chooses leaf topic for clipping thus trying to maximize convenience of output. During repetition a best profile-so- far is maintained satisfying the Risk constriction. The repetition stops when the root topic is reached. The best profile-so-far is the final result. GreedyDp algorithms require recompilation of profiles which adds up to computational cost and memory requirement. GREEDY INFORMATION LOSS(IL) ALGORITHM GreedyIL algorithm is advances simplification productivity. GreedyIL continues importance queue for candidate clip leaf operator in descending order. This decreases the computational cost. GreedyIL states to dismiss the repetition when Risk is satisfied or when there is a single leaf left. Since, there is less computational cost compared to GreedyDP, GreedyIL out performs GreedyDP. CONCLUSION:- A customer side protection security structure called UPS i.e. Client movable Privacy sparing Search is introduced in the paper. Any PWS can modify UPS for making customer profile in different leveled investigative order. UPS grants customer to assign the security necessity and accordingly the individual information of customer profile is kept private without exchanging the pursuit brilliance. UPS structure speaks to two ravenous calculations thus, to be particular GreedyDP and GreedyIL. For future work, we will attempt to oppose foes with more extensive foundation learning, for example, wealthier relationship among themes (e.g., selectiveness, sequentially, etc.), on the other hand capacity to catch a progression of questions from the casualty. We will likewise look for more complex system to construct the client profile, and better measurements to foresee the execution (particularly the utility) of UPS. REFERENCES:- [1] Z. Dou, R. Song, and J.-R. Wen, A Large- Scale Evaluation and Analysis of Personalized Search Strategies, Proc. Int l Conf. World Wide Web (WWW), pp ,
7 [2] J. Teevan, S.T. Dumais, and E. Horvitz, Personalizing Search via Automated Analysis of Interests and Activities, Proc. 28th Ann. Int l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR), pp , [3] M. Spertta and S. Gach, Personalizing Search Based on User Search Histories, Proc. IEEE/WIC/ACM Int l Conf. Web Intelligence (WI), [4] B. Tan, X. Shen, and C. Zhai, Mining Long- Term Search History to Improve Search Accuracy, Proc. ACM SIGKDD Int l Conf. Knowledge Discovery and Data Mining (KDD), [5] K. Sugiyama, K. Hatano, and M. Yoshikawa, Adaptive Web Search Based on User Profile Constructed without any Effort from Users, Proc. 13th Int l Conf. World Wide Web (WWW), [6] X. Shen, B. Tan, and C. Zhai, Implicit User Modeling for Personalized Search, Proc. 14th ACM Int l Conf. Information and Knowledge Management (CIKM), [7] X. Shen, B. Tan, and C. Zhai, Context- Sensitive Information Retrieval Using Implicit Feedback, Proc. 28th Ann. Int l ACM SIGIR Conf. Research and Development Information Retrieval (SIGIR), [8] F. Qiu and J. Cho, Automatic Identification of User Interest for Personalized Search, Proc. 15th Int l Conf. World Wide Web (WWW), pp , [9] J. Pitkow, H. Schu tze, T. Cass, R. Cooley, D. Turnbull, A. Edmonds, E. Adar, and T. Breuel, Personalized Search, Comm. ACM, vol. 45, no. 9, pp , [10] Y. Xu, K. Wang, B. Zhang, and Z. Chen, Privacy-Enhancing Personalized Web Search, Proc. 16th Int l Conf. World Wide Web (WWW), pp , Dr. P.Harini is presently working as Professor & Head, Department of Computer science & Engineering in St. Ann s College of Engineering and Technology, Chirala. She Completed Ph.D. in Distributed and Mobile Computing from JNTUA. She guided many U.G. & P.G projects. She has more than 19 Years of Teaching and 2 Years of Industry Experience. She published more than 20 International Journals and 25 research Oriented Papers in various areas. She was awarded Certificate of Merit by JNTUK., Kakinada on the University Formation day, 21st August AUTHORS : Mrs. M.Sowjanya Studying II M.Tech (CSE) in St. Ann s College of Engineering & Technology, Chirala,She completed B.Tech.(IT) in 2011 in St. Ann s College of Engineering & Technology, Chirala. 123
Supporting Privacy Protection in Personalized Web Search
Supporting Privacy Protection in Personalized Web Search Kamatam Amala P.G. Scholar (M. Tech), Department of CSE, Srinivasa Institute of Technology & Sciences, Ukkayapalli, Kadapa, Andhra Pradesh. ABSTRACT:
More informationInternational Journal of Engineering Research-Online A Peer Reviewed International Journal Articles available online http://www.ijoer.
REVIEW ARTICLE ISSN: 2321-7758 UPS EFFICIENT SEARCH ENGINE BASED ON WEB-SNIPPET HIERARCHICAL CLUSTERING MS.MANISHA DESHMUKH, PROF. UMESH KULKARNI Department of Computer Engineering, ARMIET, Department
More informationSustaining Privacy Protection in Personalized Web Search with Temporal Behavior
Sustaining Privacy Protection in Personalized Web Search with Temporal Behavior N.Jagatheshwaran 1 R.Menaka 2 1 Final B.Tech (IT), jagatheshwaran.n@gmail.com, Velalar College of Engineering and Technology,
More informationPersonalization of Web Search With Protected Privacy
Personalization of Web Search With Protected Privacy S.S DIVYA, R.RUBINI,P.EZHIL Final year, Information Technology,KarpagaVinayaga College Engineering and Technology, Kanchipuram [D.t] Final year, Information
More informationA UPS Framework for Providing Privacy Protection in Personalized Web Search
A UPS Framework for Providing Privacy Protection in Personalized Web Search V. Sai kumar 1, P.N.V.S. Pavan Kumar 2 PG Scholar, Dept. of CSE, G Pulla Reddy Engineering College, Kurnool, Andhra Pradesh,
More informationPrivacy Protection in Personalized Web Search- A Survey
Privacy Protection in Personalized Web Search- A Survey Greeshma A S. * Lekshmy P. L. M.Tech Student Assistant Professor Dept. of CSE & Kerala University Dept. of CSE & Kerala University Thiruvananthapuram
More informationLDA Based Security in Personalized Web Search
LDA Based Security in Personalized Web Search R. Dhivya 1 / PG Scholar, B. Vinodhini 2 /Assistant Professor, S. Karthik 3 /Prof & Dean Department of Computer Science & Engineering SNS College of Technology
More informationProfile Based Personalized Web Search and Download Blocker
Profile Based Personalized Web Search and Download Blocker 1 K.Sheeba, 2 G.Kalaiarasi Dhanalakshmi Srinivasan College of Engineering and Technology, Mamallapuram, Chennai, Tamil nadu, India Email: 1 sheebaoec@gmail.com,
More informationPrivacy Protection in Personalized Web Search Via Taxonomy Structure
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 17, Issue 4, Ver. I (July Aug. 2015), PP 54-65 www.iosrjournals.org Privacy Protection in Personalized Web Search
More informationA PREDICTIVE MODEL FOR QUERY OPTIMIZATION TECHNIQUES IN PERSONALIZED WEB SEARCH
International Journal of Computer Science and System Analysis Vol. 5, No. 1, January-June 2011, pp. 37-43 Serials Publications ISSN 0973-7448 A PREDICTIVE MODEL FOR QUERY OPTIMIZATION TECHNIQUES IN PERSONALIZED
More informationSECURED AN IMPLEMENTATION OF PERSONALIZED WEB SEARCH
SECURED AN IMPLEMENTATION OF PERSONALIZED WEB SEARCH 1 Mr. A. MANIKANDAN, 2 Dr. A.VIJAYA KATHIRAVAN 1 Research Scholar, 2 Assistant Professor in Computer Science, 1 Dept of Computer Science, 2 Dept of
More informationAdvances in Natural and Applied Sciences
AENSI Journals Advances in Natural and Applied Sciences ISSN:1995-0772 EISSN: 1998-1090 Journal home page: www.aensiweb.com/anas Privacy Protection in Personalized Web Search 1 M. Abinaya and 2 D. Vijay
More informationSUSTAINING PRIVACY PROTECTION IN PERSONALIZED WEB SEARCH WITH TEMPORAL BEHAVIOR
International Journal of Latest Research in Science and Technology Volume 4, Issue 5: Page No.73-77, September-October 2015 http://www.mnkjournals.com/ijlrst.htm ISSN (Online):2278-5299 SUSTAINING PRIVACY
More informationIEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING VOL:26 NO:2 YEAR 2014. Supporting Privacy Protection in Personalized Web Search
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING VOL:26 NO:2 YEAR 2014 Supporting Privacy Protection in Personalized Web Search Lidan Shou, He Bai, Ke Chen, and Gang Chen Abstract Personalized web search
More informationImplementation of P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains
Implementation of P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains P.Satheesh Associate professor Dept of Computer Science and Engineering MVGR college of
More informationDynamical Clustering of Personalized Web Search Results
Dynamical Clustering of Personalized Web Search Results Xuehua Shen CS Dept, UIUC xshen@cs.uiuc.edu Hong Cheng CS Dept, UIUC hcheng3@uiuc.edu Abstract Most current search engines present the user a ranked
More informationA FRAMEWORK FOR SECURE ACCESS OF HEALTH DATA WITH AUDIT ABILITY IN CLOUD
A FRAMEWORK FOR SECURE ACCESS OF HEALTH DATA WITH AUDIT ABILITY IN CLOUD Ch. Kousalya Devi 1, B Dada Khalande 2, G.Rama Subba Reddy 3 1 M.tech Scholar (CSE), 2 Asst.Professor, Dept. of CSE, Vignana Bharathi
More informationHow To Cluster On A Search Engine
Volume 2, Issue 2, February 2012 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: A REVIEW ON QUERY CLUSTERING
More informationEXAMINING OF HEALTH SERVICES BY UTILIZATION OF MOBILE SYSTEMS. Dokuri Sravanthi 1, P.Rupa 2
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE EXAMINING OF HEALTH SERVICES BY UTILIZATION OF MOBILE SYSTEMS Dokuri Sravanthi 1, P.Rupa 2 1 M.Tech Student, Dept of CSE, CMR Institute
More informationISSN 2278-3091. Index Terms Cloud computing, outsourcing data, cloud storage security, public auditability
Outsourcing and Discovering Storage Inconsistencies in Cloud Through TPA Sumathi Karanam 1, GL Varaprasad 2 Student, Department of CSE, QIS College of Engineering and Technology, Ongole, AndhraPradesh,India
More informationViral Marketing in Social Network Using Data Mining
Viral Marketing in Social Network Using Data Mining Shalini Sharma*,Vishal Shrivastava** *M.Tech. Scholar, Arya College of Engg. & I.T, Jaipur (Raj.) **Associate Proffessor(Dept. of CSE), Arya College
More informationInformation Security in Big Data using Encryption and Decryption
International Research Journal of Computer Science (IRJCS) ISSN: 2393-9842 Information Security in Big Data using Encryption and Decryption SHASHANK -PG Student II year MCA S.K.Saravanan, Assistant Professor
More informationResearch and Development of Data Preprocessing in Web Usage Mining
Research and Development of Data Preprocessing in Web Usage Mining Li Chaofeng School of Management, South-Central University for Nationalities,Wuhan 430074, P.R. China Abstract Web Usage Mining is the
More informationData quality in Accounting Information Systems
Data quality in Accounting Information Systems Comparing Several Data Mining Techniques Erjon Zoto Department of Statistics and Applied Informatics Faculty of Economy, University of Tirana Tirana, Albania
More informationA Novel Multi Ring Forwarding Protocol for Avoiding the Void Nodes for Balanced Energy Consumption
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-4 E-ISSN: 2347-2693 A Novel Multi Ring Forwarding Protocol for Avoiding the Void Nodes for Balanced Energy
More informationAccessing Private Network via Firewall Based On Preset Threshold Value
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 16, Issue 3, Ver. V (May-Jun. 2014), PP 55-60 Accessing Private Network via Firewall Based On Preset Threshold
More information131-1. Adding New Level in KDD to Make the Web Usage Mining More Efficient. Abstract. 1. Introduction [1]. 1/10
1/10 131-1 Adding New Level in KDD to Make the Web Usage Mining More Efficient Mohammad Ala a AL_Hamami PHD Student, Lecturer m_ah_1@yahoocom Soukaena Hassan Hashem PHD Student, Lecturer soukaena_hassan@yahoocom
More informationAchieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services
Achieve Better Ranking Accuracy Using CloudRank Framework for Cloud Services Ms. M. Subha #1, Mr. K. Saravanan *2 # Student, * Assistant Professor Department of Computer Science and Engineering Regional
More informationAN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE AN EFFICIENT STRATEGY OF AGGREGATE SECURE DATA TRANSMISSION K.Anusha 1, K.Sudha 2 1 M.Tech Student, Dept of CSE, Aurora's Technological
More informationOptimized Offloading Services in Cloud Computing Infrastructure
Optimized Offloading Services in Cloud Computing Infrastructure 1 Dasari Anil Kumar, 2 J.Srinivas Rao 1 Dept. of CSE, Nova College of Engineerng & Technology,Vijayawada,AP,India. 2 Professor, Nova College
More informationData Mining in Web Search Engine Optimization and User Assisted Rank Results
Data Mining in Web Search Engine Optimization and User Assisted Rank Results Minky Jindal Institute of Technology and Management Gurgaon 122017, Haryana, India Nisha kharb Institute of Technology and Management
More informationPRIVACY PRESERVING AUTHENTICATION WITH SHARED AUTHORITY IN CLOUD
PRIVACY PRESERVING AUTHENTICATION WITH SHARED AUTHORITY IN CLOUD Kopparthi Lakshmi Narayana 1, M.Purushotham Reddy 2, G.Rama Subba Reddy 3 1 M.tech Scholar (CSE), 2 Asst.professor, Dept. of CSE, Vignana
More informationCONSIDERATION OF DYNAMIC STORAGE ATTRIBUTES IN CLOUD
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE CONSIDERATION OF DYNAMIC STORAGE ATTRIBUTES IN CLOUD Ravi Sativada 1, M.Prabhakar Rao 2 1 M.Tech Student, Dept of CSE, Chilkur Balaji
More informationEFFECTIVE DATA RECOVERY FOR CONSTRUCTIVE CLOUD PLATFORM
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE EFFECTIVE DATA RECOVERY FOR CONSTRUCTIVE CLOUD PLATFORM Macha Arun 1, B.Ravi Kumar 2 1 M.Tech Student, Dept of CSE, Holy Mary
More informationBlog Post Extraction Using Title Finding
Blog Post Extraction Using Title Finding Linhai Song 1, 2, Xueqi Cheng 1, Yan Guo 1, Bo Wu 1, 2, Yu Wang 1, 2 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing 2 Graduate School
More informationSPATIAL DATA CLASSIFICATION AND DATA MINING
, pp.-40-44. Available online at http://www. bioinfo. in/contents. php?id=42 SPATIAL DATA CLASSIFICATION AND DATA MINING RATHI J.B. * AND PATIL A.D. Department of Computer Science & Engineering, Jawaharlal
More informationDELEGATING LOG MANAGEMENT TO THE CLOUD USING SECURE LOGGING
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IJCSMC, Vol. 3, Issue.
More informationEntropy-Based Collaborative Detection of DDoS Attacks on Community Networks
Entropy-Based Collaborative Detection of DDoS Attacks on Community Networks Krishnamoorthy.D 1, Dr.S.Thirunirai Senthil, Ph.D 2 1 PG student of M.Tech Computer Science and Engineering, PRIST University,
More informationIJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS
IJCSES Vol.7 No.4 October 2013 pp.165-168 Serials Publications BEHAVIOR PERDITION VIA MINING SOCIAL DIMENSIONS V.Sudhakar 1 and G. Draksha 2 Abstract:- Collective behavior refers to the behaviors of individuals
More informationSEARCH ENGINE OPTIMIZATION USING D-DICTIONARY
SEARCH ENGINE OPTIMIZATION USING D-DICTIONARY G.Evangelin Jenifer #1, Mrs.J.Jaya Sherin *2 # PG Scholar, Department of Electronics and Communication Engineering(Communication and Networking), CSI Institute
More informationCloud Information Accountability Framework for Auditing the Data Usage in Cloud Environment
International Journal of Computational Engineering Research Vol, 03 Issue, 11 Cloud Information Accountability Framework for Auditing the Data Usage in Cloud Environment D.Dhivya 1, S.CHINNADURAI 2 1,M.E.(Cse),
More informationFiltering Noisy Contents in Online Social Network by using Rule Based Filtering System
Filtering Noisy Contents in Online Social Network by using Rule Based Filtering System Bala Kumari P 1, Bercelin Rose Mary W 2 and Devi Mareeswari M 3 1, 2, 3 M.TECH / IT, Dr.Sivanthi Aditanar College
More informationAN APPROACH TOWARDS FUNCTIONING OF PUBLIC AUDITABILITY FOR CLOUD ENRICHMENT
INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE AN APPROACH TOWARDS FUNCTIONING OF PUBLIC AUDITABILITY FOR CLOUD ENRICHMENT Mohd Abdul Shoaib 1, Akheel Mohammed 2, Ayesha 3
More informationIMPLEMENTATION OF RELIABLE CACHING STRATEGY IN CLOUD ENVIRONMENT
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE IMPLEMENTATION OF RELIABLE CACHING STRATEGY IN CLOUD ENVIRONMENT M.Swapna 1, K.Ashlesha 2 1 M.Tech Student, Dept of CSE, Lord s Institute
More informationSelective dependable storage services for providing security in cloud computing
Selective dependable storage services for providing security in cloud computing Gade Lakshmi Thirupatamma*1, M.Jayaram*2, R.Pitchaiah*3 M.Tech Scholar, Dept of CSE, UCET, Medikondur, Dist: Guntur, AP,
More informationDecision Trees for Mining Data Streams Based on the Gaussian Approximation
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-3 E-ISSN: 2347-2693 Decision Trees for Mining Data Streams Based on the Gaussian Approximation S.Babu
More informationExtension of Decision Tree Algorithm for Stream Data Mining Using Real Data
Fifth International Workshop on Computational Intelligence & Applications IEEE SMC Hiroshima Chapter, Hiroshima University, Japan, November 10, 11 & 12, 2009 Extension of Decision Tree Algorithm for Stream
More informationIMPLEMENTATION OF RESPONSIBLE DATA STORAGE IN CONSISTENT CLOUD ENVIRONMENT
IJRRECS/November 2014/Volume-2/Issue-11/3699-3703 ISSN 2321-5461 INTERNATIONAL JOURNAL OF REVIEWS ON RECENT ELECTRONICS AND COMPUTER SCIENCE IMPLEMENTATION OF RESPONSIBLE DATA STORAGE IN CONSISTENT CLOUD
More informationIaas for Private and Public Cloud using Openstack
Iaas for Private and Public Cloud using Openstack J. Beschi Raja, Assistant Professor, Department of CSE, Kalasalingam Institute of Technology, TamilNadu, India, K.Vivek Rabinson, PG Student, Department
More informationPERFORMANCE OF BALANCED STORAGE SERVICES IN CLOUD SYSTEM
INTERNATIONAL JOURNAL OF ADVANCED RESEARCH IN ENGINEERING AND SCIENCE PERFORMANCE OF BALANCED STORAGE SERVICES IN CLOUD SYSTEM Byagari Kumar 1, K.Pradeep Kumar 2 1 M.Tech Student, Dept of CSE, RRS College
More informationPublic Auditing for Shared Data in the Cloud by Using AES
Public Auditing for Shared Data in the Cloud by Using AES 1 Syagamreddy Subbareddy, 2 P.Tejaswi, 3 D.Krishna 1 M.Tech(CSE) Pursuing, 2 Associate Professor, 3 Associate Professor,HOD, 1,2,3 Dept. of Computer
More informationThe Power Marketing Information System Model Based on Cloud Computing
2011 International Conference on Computer Science and Information Technology (ICCSIT 2011) IPCSIT vol. 51 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V51.96 The Power Marketing Information
More informationAUCTION SWINDLE DISCOVERY FOR PROACTIVE SELF-DISCIPLINED SYSTEMS
IJCITP Volume.8* Number 2* December 2013, pp. 95-99 Serials Publications AUCTION SWINDLE DISCOVERY FOR PROACTIVE SELF-DISCIPLINED SYSTEMS D. C. Venkateswarlu 1 and V. Premalatha 2 1 M.Tech. Student, Department
More informationHorizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
IOSR Journal of Computer Engineering (IOSRJCE) ISSN: 2278-0661, ISBN: 2278-8727 Volume 6, Issue 5 (Nov. - Dec. 2012), PP 36-41 Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
More informationSurvey On: Nearest Neighbour Search With Keywords In Spatial Databases
Survey On: Nearest Neighbour Search With Keywords In Spatial Databases SayaliBorse 1, Prof. P. M. Chawan 2, Prof. VishwanathChikaraddi 3, Prof. Manish Jansari 4 P.G. Student, Dept. of Computer Engineering&
More informationMonitoring Performances of Quality of Service in Cloud with System of Systems
Monitoring Performances of Quality of Service in Cloud with System of Systems Helen Anderson Akpan 1, M. R. Sudha 2 1 MSc Student, Department of Information Technology, 2 Assistant Professor, Department
More informationClient Perspective Based Documentation Related Over Query Outcomes from Numerous Web Databases
Beyond Limits...Volume: 2 Issue: 2 International Journal Of Advance Innovations, Thoughts & Ideas Client Perspective Based Documentation Related Over Query Outcomes from Numerous Web Databases B. Santhosh
More informationA Systematic Security Approach in Software Requirements Engineering
A Systematic Security Approach in Software Requirements Engineering (1) P.Mahizharuvi, Research Scholar, Dept of MCA, Computer Center, Madurai Kamaraj University, Madurai. (2) Dr.K.Alagarsamy, Associate
More informationBusiness Intelligence and Decision Support Systems
Chapter 12 Business Intelligence and Decision Support Systems Information Technology For Management 7 th Edition Turban & Volonino Based on lecture slides by L. Beaubien, Providence College John Wiley
More informationFramework for Injecting the Attacks and Analyzing the Behaviour of Vulnerability on Server s
Framework for Injecting the Attacks and Analyzing the Behaviour of Vulnerability on Server s Panchamukesh Ch #1, Kumar.J *2, Neelima.S *3, Sailaja.D *4 #1 Department of CSE, HITAM, Gowdavally, Hyderabad,
More informationAn Integrated CyberSecurity Approach for HEP Grids. Workshop Report. http://hpcrd.lbl.gov/hepcybersecurity/
An Integrated CyberSecurity Approach for HEP Grids Workshop Report http://hpcrd.lbl.gov/hepcybersecurity/ 1. Introduction The CMS and ATLAS experiments at the Large Hadron Collider (LHC) being built at
More informationCOURSE RECOMMENDER SYSTEM IN E-LEARNING
International Journal of Computer Science and Communication Vol. 3, No. 1, January-June 2012, pp. 159-164 COURSE RECOMMENDER SYSTEM IN E-LEARNING Sunita B Aher 1, Lobo L.M.R.J. 2 1 M.E. (CSE)-II, Walchand
More informationA Review of Anomaly Detection Techniques in Network Intrusion Detection System
A Review of Anomaly Detection Techniques in Network Intrusion Detection System Dr.D.V.S.S.Subrahmanyam Professor, Dept. of CSE, Sreyas Institute of Engineering & Technology, Hyderabad, India ABSTRACT:In
More informationWHEN YOU CONSULT A STATISTICIAN... WHAT TO EXPECT
WHEN YOU CONSULT A STATISTICIAN... WHAT TO EXPECT SECTION ON STATISTICAL CONSULTING AMERICAN STATISTICAL ASSOCIATION 2003 When you consult a statistician, you enlist the help of a professional who is particularly
More informationImproving data integrity on cloud storage services
International Journal of Engineering Science Invention ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 2 Issue 2 ǁ February. 2013 ǁ PP.49-55 Improving data integrity on cloud storage services
More informationOnline Credit Card Application and Identity Crime Detection
Online Credit Card Application and Identity Crime Detection Ramkumar.E & Mrs Kavitha.P School of Computing Science, Hindustan University, Chennai ABSTRACT The credit cards have found widespread usage due
More informationChapter 5. Regression Testing of Web-Components
Chapter 5 Regression Testing of Web-Components With emergence of services and information over the internet and intranet, Web sites have become complex. Web components and their underlying parts are evolving
More informationA Time Efficient Algorithm for Web Log Analysis
A Time Efficient Algorithm for Web Log Analysis Santosh Shakya Anju Singh Divakar Singh Student [M.Tech.6 th sem (CSE)] Asst.Proff, Dept. of CSE BU HOD (CSE), BUIT, BUIT,BU Bhopal Barkatullah University,
More informationDr. U. Devi Prasad Associate Professor Hyderabad Business School GITAM University, Hyderabad Email: Prasad_vungarala@yahoo.co.in
96 Business Intelligence Journal January PREDICTION OF CHURN BEHAVIOR OF BANK CUSTOMERS USING DATA MINING TOOLS Dr. U. Devi Prasad Associate Professor Hyderabad Business School GITAM University, Hyderabad
More informationB.Sc (Computer Science) Database Management Systems UNIT-V
1 B.Sc (Computer Science) Database Management Systems UNIT-V Business Intelligence? Business intelligence is a term used to describe a comprehensive cohesive and integrated set of tools and process used
More informationMobile Adaptive Opportunistic Junction for Health Care Networking in Different Geographical Region
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 4, Number 2 (2014), pp. 113-118 International Research Publications House http://www. irphouse.com /ijict.htm Mobile
More informationEfficient Iceberg Query Evaluation for Structured Data using Bitmap Indices
Proc. of Int. Conf. on Advances in Computer Science, AETACS Efficient Iceberg Query Evaluation for Structured Data using Bitmap Indices Ms.Archana G.Narawade a, Mrs.Vaishali Kolhe b a PG student, D.Y.Patil
More informationAn Effective Analysis of Weblog Files to improve Website Performance
An Effective Analysis of Weblog Files to improve Website Performance 1 T.Revathi, 2 M.Praveen Kumar, 3 R.Ravindra Babu, 4 Md.Khaleelur Rahaman, 5 B.Aditya Reddy Department of Information Technology, KL
More informationA Large scale Evaluation and Analysis of Personalized Search Strategies
A Large scale Evaluation and Analysis of Personalized Search Strategies Zhicheng Dou Nankai University Tianjin 30007, China douzc@yahoo.com.cn Ruihua Song Microsoft Research Asia Beijing 00080, China rsong@microsoft.com
More informationMALLET-Privacy Preserving Influencer Mining in Social Media Networks via Hypergraph
MALLET-Privacy Preserving Influencer Mining in Social Media Networks via Hypergraph Janani K 1, Narmatha S 2 Assistant Professor, Department of Computer Science and Engineering, Sri Shakthi Institute of
More informationOptimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2
Optimization of Search Results with Duplicate Page Elimination using Usage Data A. K. Sharma 1, Neelam Duhan 2 1, 2 Department of Computer Engineering, YMCA University of Science & Technology, Faridabad,
More informationMining Signatures in Healthcare Data Based on Event Sequences and its Applications
Mining Signatures in Healthcare Data Based on Event Sequences and its Applications Siddhanth Gokarapu 1, J. Laxmi Narayana 2 1 Student, Computer Science & Engineering-Department, JNTU Hyderabad India 1
More informationOptimized Mobile Search Engine
Optimized Mobile Search Engine E.Chaitanya 1, Dr.Sai Satyanarayana Reddy 2, O.Srinivasa Reddy 3 1 M.Tech, CSE, LBRCE, Mylavaram, 2 Professor, CSE, LBRCE, Mylavaram, India, 3 Asst.professor,CSE,LBRCE,Mylavaram,India.
More informationDesign & Implementation about Mining Enterprise EAM (Enterprise Asset Management) System
Design & Implementation about Mining Enterprise EAM (Enterprise Asset Management) System Wang Huan, Li Changliang, Wang Dianlong Anshan Iron and Steel Group Corporation Mining Industry Company Abstract:
More informationExtend Table Lens for High-Dimensional Data Visualization and Classification Mining
Extend Table Lens for High-Dimensional Data Visualization and Classification Mining CPSC 533c, Information Visualization Course Project, Term 2 2003 Fengdong Du fdu@cs.ubc.ca University of British Columbia
More informationRetrofitting Security into a Web-Based Information System
Retrofitting Security into a Web-Based Information System David Bettencourt da Cruz, Bernhard Rumpe, Guido Wimmel Software & Systems Engineering, Technische Universität München 85748 Munich/Garching, Germany
More informationAn Efficient Data Correctness Approach over Cloud Architectures
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 8, Issue 12 (October 2013), PP. 33-37 An Efficient Data Correctness Approach over
More informationA Vague Improved Markov Model Approach for Web Page Prediction
A Vague Improved Markov Model Approach for Web Page Prediction ABSTRACT Priya Bajaj and Supriya Raheja Department of Computer Science & Engineering, ITM University Gurgaon, Haryana 122001, India Today
More informationAnalyze & Classify Intrusions to Detect Selective Measures to Optimize Intrusions in Virtual Network
Analyze & Classify Intrusions to Detect Selective Measures to Optimize Intrusions in Virtual Network 1 T.Ganesh, 2 K.Santhi 1 M.Tech Student, Department of Computer Science and Engineering, SV Collge of
More informationInternational Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 11, November 2015 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
More informationAN APPROACH TO ANTICIPATE MISSING ITEMS IN SHOPPING CARTS
AN APPROACH TO ANTICIPATE MISSING ITEMS IN SHOPPING CARTS Maddela Pradeep 1, V. Nagi Reddy 2 1 M.Tech Scholar(CSE), 2 Assistant Professor, Nalanda Institute Of Technology(NIT), Siddharth Nagar, Guntur,
More informationInternational Journal of Computer Science Trends and Technology (IJCST) Volume 2 Issue 3, May-Jun 2014
RESEARCH ARTICLE OPEN ACCESS A Survey of Data Mining: Concepts with Applications and its Future Scope Dr. Zubair Khan 1, Ashish Kumar 2, Sunny Kumar 3 M.Tech Research Scholar 2. Department of Computer
More informationSecurity Saving Open Examining for Secure Cloud storage
ISSN (Online): 2349-7084 GLOBAL IMPACT FACTOR 0.238 INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING IN RESEARCH TRENDS VOLUME 1, ISSUE 3, SEPTEMBER 2014, PP 131-136 Security Saving Open Examining for Secure
More informationUnderstanding Web personalization with Web Usage Mining and its Application: Recommender System
Understanding Web personalization with Web Usage Mining and its Application: Recommender System Manoj Swami 1, Prof. Manasi Kulkarni 2 1 M.Tech (Computer-NIMS), VJTI, Mumbai. 2 Department of Computer Technology,
More informationVolume 2, Issue 2, February 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 2, February 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Paper / Case Study Available online at: www.ijarcsms.com ISSN: 2321-7782
More informationNatural Language to Relational Query by Using Parsing Compiler
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 4, Issue. 3, March 2015,
More informationEffective User Navigation in Dynamic Website
Effective User Navigation in Dynamic Website Ms.S.Nithya Assistant Professor, Department of Information Technology Christ College of Engineering and Technology Puducherry, India Ms.K.Durga,Ms.A.Preeti,Ms.V.Saranya
More informationWeb Applications Access Control Single Sign On
Web Applications Access Control Single Sign On Anitha Chepuru, Assocaite Professor IT Dept, G.Narayanamma Institute of Technology and Science (for women), Shaikpet, Hyderabad - 500008, Andhra Pradesh,
More informationRANKING WEB PAGES RELEVANT TO SEARCH KEYWORDS
ISBN: 978-972-8924-93-5 2009 IADIS RANKING WEB PAGES RELEVANT TO SEARCH KEYWORDS Ben Choi & Sumit Tyagi Computer Science, Louisiana Tech University, USA ABSTRACT In this paper we propose new methods for
More informationEnhancing Accountability for Distributed Data Sharing in the Cloud
Enhancing Accountability for Distributed Data Sharing in the Cloud MdMasoomRabbani M.Sc(Computer Sc.), Final Year School of Computing Science & Engineering, VIT University, Vellore - 632014, Tamil Nadu,
More information1. What is PRINCE2? Projects In a Controlled Environment. Structured project management method. Generic based on proven principles
1. What is PRINCE2? Projects In a Controlled Environment Structured project management method Generic based on proven principles Isolates the management from the specialist 2 1.1. What is a Project? Change
More informationFlexible Deterministic Packet Marking: An IP Traceback Scheme Against DDOS Attacks
Flexible Deterministic Packet Marking: An IP Traceback Scheme Against DDOS Attacks Prashil S. Waghmare PG student, Sinhgad College of Engineering, Vadgaon, Pune University, Maharashtra, India. prashil.waghmare14@gmail.com
More informationEvaluate the Usability of Security Audits in Electronic Commerce
Evaluate the Usability of Security Audits in Electronic Commerce K.A.D.C.P Kahandawaarachchi, M.C Adipola, D.Y.S Mahagederawatte and P Hewamallikage 3 rd Year Information Systems Undergraduates Sri Lanka
More informationContents WEKA Microsoft SQL Database
WEKA User Manual Contents WEKA Introduction 3 Background information. 3 Installation. 3 Where to get WEKA... 3 Downloading Information... 3 Opening the program.. 4 Chooser Menu. 4-6 Preprocessing... 6-7
More informationImproving Web Page Retrieval using Search Context from Clicked Domain Names
Improving Web Page Retrieval using Search Context from Clicked Domain Names Rongmei Li School of Electrical, Mathematics, and Computer Science University of Twente P.O.Box 217, 7500 AE, Enschede, the Netherlands
More information