WWW2007 Program Guide
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
DEWS: a Decentralized Engine for Web Search
DEWS: A Decentralized Engine for Web Search Reaz Ahmed, Rakibul Haque, Md. Faizul Bari, Raouf Boutaba David R. Cheriton School of Computer Science, University of Waterloo [r5ahmed|m9haque|mfbari|rboutaba]@uwaterloo.ca Bertrand Mathieu Orange Labs, Lannion, France [email protected] (Technical Report: CS-2012-17) Abstract The way we explore the Web is largely governed by centrally controlled, clustered search engines, which is not healthy for our freedom in the Internet. A better solution is to enable the Web to index itself in a decentralized manner. In this work we propose a decentralized Web search mechanism, named DEWS, which will enable the existing webservers to collaborate with each other to form a distributed index of the Web. DEWS can rank the search results based on query keyword relevance and relative importance of websites. DEWS also supports approximate matching of query keywords and incremental retrieval of search results in a decentralized manner. We use the standard LETOR 3.0 dataset to validate the DEWS protocol. Simulation results show that the ranking accuracy of DEWS is very close to the centralized case, while network overhead for collaborative search and indexing is logarithmic on network size. Simulation results also show that DEWS is resilient to changes in the available pool of indexing webservers and works efficiently even in presence of heavy query load. 1 Introduction Internet is the largest repository of documents that man kind has ever created. Voluntary contributions from millions of Internet users around the globe, and decentralized, autonomous hosting infrastructure are the sole factors propelling the continuous growth of the Internet. -
Rich Internet Applications
Rich Internet Applications (RIAs) A Comparison Between Adobe Flex, JavaFX and Microsoft Silverlight Master of Science Thesis in the Programme Software Engineering and Technology CARL-DAVID GRANBÄCK Department of Computer Science and Engineering CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG Göteborg, Sweden, October 2009 The Author grants to Chalmers University of Technology and University of Gothenburg the non-exclusive right to publish the Work electronically and in a non-commercial purpose make it accessible on the Internet. The Author warrants that he/she is the author to the Work, and warrants that the Work does not contain text, pictures or other material that violates copyright law. The Author shall, when transferring the rights of the Work to a third party (for example a publisher or a company), acknowledge the third party about this agreement. If the Author has signed a copyright agreement with a third party regarding the Work, the Author warrants hereby that he/she has obtained any necessary permission from this third party to let Chalmers University of Technology and University of Gothenburg store the Work electronically and make it accessible on the Internet. Rich Internet Applications (RIAs) A Comparison Between Adobe Flex, JavaFX and Microsoft Silverlight CARL-DAVID GRANBÄCK © CARL-DAVID GRANBÄCK, October 2009. Examiner: BJÖRN VON SYDOW Department of Computer Science and Engineering Chalmers University of Technology SE-412 96 Göteborg Sweden Telephone + 46 (0)31-772 1000 Department of Computer Science and Engineering Göteborg, Sweden, October 2009 Abstract This Master's thesis report describes and compares the three Rich Internet Application !RIA" frameworks Adobe Flex, JavaFX and Microsoft Silverlight. -
Taeho Jung 1/5
Taeho Jung 1/5 Contact Department of Computer Science and Engineering Phone: (773) 431-3225 Information University of Notre Dame Email: [email protected] Notre Dame, IN 46556 USA Website: sites.nd.edu/taeho-jung Research Cybersecurity, big data security, user privacy, privacy-preserving computation, accountability Interests Working University of Notre Dame, Department of Computer Science and Engineering, Notre Dame, IN Experience Assistant Professor Aug. 2017 - Present Illinois Institute of Technology, Department of Computer Science, Chicago, IL Teaching Assistant Aug. 2011 - May. 2017 • CS330 | Discrete Structures: Spring'15, Spring'14, Fall'13, Spring'13, Fall'12 • CS430 | Introduction to Algorithms: Spring'17, Fall'16, Spring'16, Fall'15, Fall'14 • CS331, CS485, CS561, CS595: Spring'12, Fall'11 Research Assistant Aug. 2011 - May. 2017 • Studied information security and user privacy implications in big data life cycle. Adjunct Instructor May. 2016 - July 2016 • CS330 | Discrete Structures Instructor Evaluation 5.0/5.0, Course Evaluation 4.75/5.0 Education Illinois Institute of Technology, Chicago, IL USA Ph.D. Candidate, Computer Science. 2017 • Dissertation: \Ensuring Security and Privacy in Big Data Sharing, Trading, and Computing" • Adviser: Dr. Xiang-Yang Li and Dr. Peng-Jun Wan Tsinghua University, Beijing, China B.E., Computer Software, 2011 • Thesis: \Design and Implementation of Anonymous Access Control Protocol for Cloud Envi- ronment | AnonyABE" • Thesis score tied at 2nd place out of 26 students. • Adviser: Dr. Zhiguo Wan Honors and Runner up for Best Paper Award, BigCom 2015 Awards Teaching Assistant of the Year, Department of C.S., Illinois Tech. 2015 • Nominated by Prof. Edward M. Reingold and Prof. -
WWW 2013 22Nd International World Wide Web Conference
WWW 2013 22nd International World Wide Web Conference General Chairs: Daniel Schwabe (PUC-Rio – Brazil) Virgílio Almeida (UFMG – Brazil) Hartmut Glaser (CGI.br – Brazil) Research Track: Ricardo Baeza-Yates (Yahoo! Labs – Spain & Chile) Sue Moon (KAIST – South Korea) Practice and Experience Track: Alejandro Jaimes (Yahoo! Labs – Spain) Haixun Wang (MSR – China) Developers Track: Denny Vrandečić (Wikimedia – Germany) Marcus Fontoura (Google – USA) Demos Track: Bernadette F. Lóscio (UFPE – Brazil) Irwin King (CUHK – Hong Kong) W3C Track: Marie-Claire Forgue (W3C Training, USA) Workshops Track: Alberto Laender (UFMG – Brazil) Les Carr (U. of Southampton – UK) Posters Track: Erik Wilde (EMC – USA) Fernanda Lima (UNB – Brazil) Tutorials Track: Bebo White (SLAC – USA) Maria Luiza M. Campos (UFRJ – Brazil) Industry Track: Marden S. Neubert (UOL – Brazil) Proceedings and Metadata Chair: Altigran Soares da Silva (UFAM - Brazil) Local Arrangements Committee: Chair – Hartmut Glaser Executive Secretary – Vagner Diniz PCO Liaison – Adriana Góes, Caroline D’Avo, and Renato Costa Conference Organization Assistant – Selma Morais International Relations – Caroline Burle Technology Liaison – Reinaldo Ferraz UX Designer / Web Developer – Yasodara Córdova, Ariadne Mello Internet infrastructure - Marcelo Gardini, Felipe Agnelli Barbosa Administration– Ana Paula Conte, Maria de Lourdes Carvalho, Beatriz Iossi, Carla Christiny de Mello Legal Issues – Kelli Angelini Press Relations and Social Network – Everton T. Rodrigues, S2Publicom and EntreNós PCO – SKL Eventos -
Build Reliable Cloud Networks with Sonic and ONE
Build Reliable Cloud Networks with SONiC and ONE Wei Bai 白巍 Microsoft Research Asia OCP China Technology Day, Shenzhen, China 1 54 100K+ 130+ $15B+ REGIONS WORLDWIDE MILES OF FIBER AND SUBSEA CABLE EDGE SITES Investments Two Open Source Cornerstones for High Reliability Networking OS: SONiC Network Verification: ONE 3 Networking OS: SONiC 4 A Solution to Unblock Hardware Innovation Monitoring, Management, Deployment Tools, Cutting Edge SDN SONiC SONiC SONiC SONiC Switch Abstraction Interface (SAI) Merchant Silicon Switch Abstraction Interface (SAI) NetworkNetwork ApplicationsApplicationsNetwork Applications Simple, consistent, and stable Hello network application stack Switch Abstraction Interface Help consume the underlying complex, heterogeneous частный 你好 नमते Bonjour hardware easily and faster https://github.com/opencomputeproject/SAI 6 SONiC High-Level Architecture Switch State Service (SWSS) • APP DB: persist App objects • SAI DB: persist SAI objects • Orchestration Agent: translation between apps and SAI objects, resolution of dependency and conflict • SyncD: sync SAI objects between software and hardware Key Goal: Evolve components independently 8 SONiC Containerization 9 SONiC Containerization • Components developed in different environments • Source code may not be available • Enables choices on a per- component basis 10 SONiC – Powering Microsoft At Cloud Scale Tier 3 - Regional Spine T3-1 T3-2 T3-3 T3-4 … … … Tier 2 - Spine T2-1-1 T2-1-2 T2-1-8 T2-4-1 T2-4-2 T2-4-4 Features and Roadmap Current: BGP, ECMP, ECN, WRED, LAG, SNMP, -
Microsoft 2012 Citizenship Report
Citizenship at Microsoft Our Company Serving Communities Working Responsibly About this Report Microsoft 2012 Citizenship Report Microsoft 2012 Citizenship Report 01 Contents Citizenship at Microsoft Serving Communities Working Responsibly About this Report 3 Serving communities 14 Creating opportunities for youth 46 Our people 85 Reporting year 4 Working responsibly 15 Empowering youth through 47 Compensation and benefits 85 Scope 4 Citizenship governance education and technology 48 Diversity and inclusion 85 Additional reporting 5 Setting priorities and 16 Inspiring young imaginations 50 Training and development 85 Feedback stakeholder engagement 18 Realizing potential with new skills 51 Health and safety 86 United Nations Global Compact 5 External frameworks 20 Supporting youth-focused 53 Environment 6 FY12 highlights and achievements nonprofits 54 Impact of our operations 23 Empowering nonprofits 58 Technology for the environment 24 Donating software to nonprofits Our Company worldwide 61 Human rights 26 Providing hardware to more people 62 Affirming our commitment 28 Sharing knowledge to build capacity 64 Privacy and data security 8 Our business 28 Solutions in action 65 Online safety 8 Where we are 67 Freedom of expression 8 Engaging our customers 31 Employee giving and partners 32 Helping employees make 69 Responsible sourcing 10 Our products a difference 71 Hardware production 11 Investing in innovation 73 Conflict minerals 36 Humanitarian response 74 Expanding our efforts 37 Providing assistance in times of need 76 Governance 40 Accessibility 77 Corporate governance 41 Empowering people with disabilities 79 Maintaining strong practices and performance 42 Engaging students with special needs 80 Public policy engagement 44 Improving seniors’ well-being 83 Compliance Cover: Participants at the 2012 Imagine Cup, Sydney, Australia. -
Evaluation of Edge Caching/Offloading for Dynamic
Evaluation of Edge Caching/Offloading for Dynamic Content Delivery Chun Yuan Yu Chen Zheng Zhang Microsoft Research Asia Microsoft Research Asia Microsoft Research Asia 3F Sigma Center, #49 Zhichun Road 3F Sigma Center, #49 Zhichun Road 3F Sigma Center, #49 Zhichun Road Beijing 100080, China Beijing 100080, China Beijing 100080, China 86-10-62617711 86-10-62617711 86-10-62617711 [email protected] [email protected] [email protected] ABSTRACT caching, we still lack the insight on what will be the best As dynamic content becomes increasingly dominant, it becomes offloading and caching strategies and their design/deployment an important research topic as how the edge resources such as tradeoffs. client-side proxies, which are otherwise underutilized for such In this paper, using a representative e-commerce benchmark, we content, can be put into use. However, it is unclear what will be have extensively studied many partitioning strategies. We found the best strategy and the design/deployment tradeoffs lie therein. that offloading and caching at edge proxy servers achieves In this paper, using one representative e-commerce benchmark, significant advantages without pulling database out near the client. we report our experience of an extensive investigation of different Our results show that, under typical user browsing patterns and offloading and caching options. Our results point out that, while network conditions, 2~3 folds of latency reduction can be great benefits can be reached in general, advanced offloading achieved. Furthermore, over 70% server requests are filtered at strategies can be overly complex and even counter-productive. In the proxies, resulting significant server load reduction. -
Klaus-Peter Zauner, Microsoft Research European Fellow; Ece Kamar, Microsoft Research Ph.D
INNOVATION: PRIMING THE GLOBAL TALENT PIPELINE External Research Division “We want to do everything we can to equip a new generation of technology leaders with the knowledge and tools they need to harness the magic of software to improve lives, solve problems and catalyze economic growth.” —Bill Gates Chairman, Microsoft Corporation Cover photos: Alban Rrustemi, Microsoft Research Ph.D. Scholar; Radhika Nagpal, Microsoft Research New Faculty Fellow; Rodrigo de Oliveira, Microsoft Research Ph.D. Fellow; Klaus-Peter Zauner, Microsoft Research European Fellow; Ece Kamar, Microsoft Research Ph.D. Fellow; Parul Shah, Microsoft Research Ph.D. Fellow 2 Innovation: Priming the Global Talent Pipeline INNOVATION: PRIMING THE GLOBAL TALENT PIPELINE “Our goal at Microsoft Research is to advance the state of the art in technology and through that advancement contribute to the future for society and for our planet. One important way we’re doing that is identifying talented students and early-career university faculty and providing them with tools and opportunities to pursue important discoveries across a range of research and scientific fields.” —Rick Rashid Senior Vice President, Microsoft Research { Contents Microsoft Research Builds Community . 2. Empowering Young Innovators . 4. Profiles Klaus-Peter Zauner, Microsoft Research European Fellow . 7. Parul Shah, Microsoft Research Ph .D . Fellow . 9. Xiao Zhang, Microsoft Research Ph .D . Fellow . 11 Radhika Nagpal, Microsoft Research New Faculty Fellow . 13 Alban Rrustemi, Microsoft Research Ph .D . Scholar . 15 Ece Kamar, Microsoft Research Ph .D . Fellow . 17 Rodrigo de Oliveira, Microsoft Research Ph .D . Fellow . 19 Bijendra Jain, Microsoft Research Community Partner . 21 Ignacio Casas, Microsoft Research Community Partner . -
Towards the Ontology Web Search Engine
TOWARDS THE ONTOLOGY WEB SEARCH ENGINE Olegs Verhodubs [email protected] Abstract. The project of the Ontology Web Search Engine is presented in this paper. The main purpose of this paper is to develop such a project that can be easily implemented. Ontology Web Search Engine is software to look for and index ontologies in the Web. OWL (Web Ontology Languages) ontologies are meant, and they are necessary for the functioning of the SWES (Semantic Web Expert System). SWES is an expert system that will use found ontologies from the Web, generating rules from them, and will supplement its knowledge base with these generated rules. It is expected that the SWES will serve as a universal expert system for the average user. Keywords: Ontology Web Search Engine, Search Engine, Crawler, Indexer, Semantic Web I. INTRODUCTION The technological development of the Web during the last few decades has provided us with more information than we can comprehend or manage effectively [1]. Typical uses of the Web involve seeking and making use of information, searching for and getting in touch with other people, reviewing catalogs of online stores and ordering products by filling out forms, and viewing adult material. Keyword-based search engines such as YAHOO, GOOGLE and others are the main tools for using the Web, and they provide with links to relevant pages in the Web. Despite improvements in search engine technology, the difficulties remain essentially the same [2]. Firstly, relevant pages, retrieved by search engines, are useless, if they are distributed among a large number of mildly relevant or irrelevant pages. -
Merging Multiple Search Results Approach for Meta-Search Engines
View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by D-Scholarship@Pitt MERGING MULTIPLE SEARCH RESULTS APPROACH FOR META-SEARCH ENGINES By Khaled Abd-El-Fatah Mohamed B.S-------- Cairo University, Egypt, 1995 M.A-------Cairo University, Egypt, 1999 M.A------- University of Pittsburgh 2001 Submitted to the Graduate Faculty of School of Information Sciences in Partial Fulfillment of the requirements for the degree of Doctor of Philosophy University of Pittsburgh 2004 UNIVERSITY OF PITTSBURGH INFORMATION SCIENCES This dissertation was presented by Khaled Abd-El-Fatah Mohamed It was defended on Janauary 29, 2004 and approved by Chris Tomer, PhD, Associate Professor, DLIS Jose-Marie Griffiths, PhD, Professor, DLIS Don King, Research Professor, DLIS Amy Knapp, PhD, ULS Dissertation Director: Chris Tomer, PhD, Associate Professor MERGING MULTIPLE SEARCH RESULTS APPROACH FOR META-SEARCH ENGINES Khaled A. Mohamed, PhD University of Pittsburgh, 2004 Meta Search Engines are finding tools developed for enhancing the search performance by submitting user queries to multiple search engines and combining the search results in a unified ranked list. They utilized data fusion technique, which requires three major steps: databases selection, the results combination, and the results merging. This study tries to build a framework that can be used for merging the search results retrieved from any set of search engines. This framework based on answering three major questions: 1. How meta-search developers could define the optimal rank order for the selected engines. 2. How meta-search developers could choose the best search engines combination. 3. What is the optimal heuristic merging function that could be used for aggregating the rank order of the retrieved documents form incomparable search engines. -
Organizing User Search Histories
Global Journal of Computer Science and Technology Network, Web & Security Volume 13 Issue 13 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172 & Print ISSN: 0975-4350 Organizing user Search Histories By Ravi Kumar Yandluri Gokaraju Rangaraju Institute of Engineering & Technology, India Abstract - Internet userscontinuously make queries over web to obtain required information. They need information about various tasks and sub tasks for which they use search engines. Over a period of time they make plenty of related queries. Search engines save these queries and maintain user’s search histories. Users can view their search histories in chronological order. However, the search histories are not organized into related groups. In fact there is no organization made except the chronological order. Recently Hwang et al. studied the problem of organizing historical search information of users into groups dynamically. This automatic grouping of user search histories can help search engines also in various applications such as collaborative search, sessionization, query alterations, result ranking and query suggestions. They proposed various techniques to achieve this. In this paper we implemented those techniques practically using a prototype web application built in Java technologies. The experimental results revealed that the proposed application is useful to organize search histories. Indexterms : search engine, search history, click graph, query grouping. GJCST-E Classification : H.3.5 Organizing user Search Histories Strictly as per the compliance and regulations of: © 2013. Ravi Kumar Yandluri. This is a research/review paper, distributed under the terms of the Creative Commons Attribution- Noncommercial 3.0 Unported License http://creativecommons.org/licenses/by-nc/3.0/), permitting all non-commercial use, distribution, and reproduction inany medium, provided the original work is properly cited. -
Q1 What Do You See As the Biggest Opportunity for Kent County?
2018 Comprehensive Plan Survey Q1 What do you see as the biggest opportunity for Kent County? Answered: 496 Skipped: 40 Growth management Retention of a viable... Quality education... Tourism Natural resource... 0% 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% ANSWER CHOICES RESPONSES Growth management 37.10% 184 Retention of a viable agricultural industry 24.19% 120 Quality education facilities - public, private & higher education 16.53% 82 Tourism 11.29% 56 Natural resource management 10.89% 54 TOTAL 496 1 / 60 2018 Comprehensive Plan Survey Q2 What do you consider to be the County's biggest challenge? Answered: 485 Skipped: 51 42.68% 34.43% 8.04% 8.04%6.80% 42.68% 34.43% 8.04% 8.04%6.80% 0% 10% 20% 30% 40% 50% 60% 70% 80% 90% 100% Lack of high paying/high-tech jobs Infrastructure improvements not keeping pace with development Lack of affordable housing Imbalance of residential to commercial/industrial uses Overcrowding of schools ANSWER CHOICES RESPONSES Lack of high paying/high-tech jobs 42.68% 207 Infrastructure improvements not keeping pace with development 34.43% 167 Lack of affordable housing 8.04% 39 Imbalance of residential to commercial/industrial uses 8.04% 39 Overcrowding of schools 6.80% 33 TOTAL 485 2 / 60 2018 Comprehensive Plan Survey Q3 What do you consider the biggest threat to Kent County? Answered: 501 Skipped: 35 Loss of community identityidentity Loss of community identity8.38% (42) Lack of strength Loss of 8.38% (42) Loss of inin County'sCounty's farmland/openfarmland/open spacespace Lackeconomic of strength base Loss