ISI-2006 Call for Papers

<Apologies if you receive this more than once>

======================================================================
                           CALL FOR PAPERS
======================================================================
=======================================================================
                     IEEE International Conference on
	     Intelligence and Security Informatics (ISI-2006)
  -----------------------------------------------------------------
	     Conference Web site: http://www.isiconference.org
	       May 22-24, 2006, Southern California, U.S.A.

***************
Important Dates
***************
 - Paper submission due	        January 20, 2006
 - Notification of acceptance	February 15, 2006
 - Camera-ready copy due	February 28, 2006
 - Tutorial/workshop proposals  February 15, 2006

************************
Hosts and Major Sponsors
************************
Hosts:
  -     University of California, Irvine
  -     University of Arizona
  -     University of Texas, Dallas

Major Sponsors:
  -     Institute of Electrical and Electronics Engineers

BCS IRSG Industry Day

CALL FOR ABSTRACTS

                     BCS IRSG Industry Day
                      in association with
        28th European Conference on Information Retrieval (ECIR 2006)

     13th April 2006, British Computer Society Headquarters, London, UK

             http://ecir2006.soi.city.ac.uk/index.php?page=indust

DESCRIPTION:
For the first time in its history, ECIR will be followed by a special
day devoted to the interests and needs of Information Retrieval
practitioners. The Industry Day after ECIR 2006 is devoted to the
challenges involved in designing and developing operational IR products
and services, and aims to build bridges between IR specialists in
industry and academia. This forum presents an opportunity for commercial
organisations and individuals to share their work with a wider audience,
and for researchers to learn more about the issues and problems faced by
IR practitioners in developing practical solutions for the information
search and retrieval industry.

The scope of Industry Day 2006 covers all the areas addressed by ECIR
2006 (http://ecir2006.soi.city.ac.uk/index.php?page=call), but we are
particularly interested in presentations and demonstrations of the
following:

* search engines (web & enterprise) 
* information architecture & navigation 
* knowledge & content management 

HLT-NAACL 2006 Call for Papers

Search engine evaluation

Dear IR folks,

Does anyone have any practical experience of using the results of one 
search engine to "validate" the results of another? 

We are developing a prototype engine and want to measure its performance on 
an agreed test set. We have some suitable queries, but won't be in a 
position to manually generate any qrels (i.e. relevance judgements) for 
quite some time. So, in the meantime, would comparing the results against 
those of another engine (or engines) tell us anything valuable? Is there a 
quick way to achieve a reliable set of "Gold Standard" results? Or is 
waiting for the qrels the most meaningful option?

BTW I am aware of a couple of academic papers that describe how in 
principle you can eliminate system pooling, but what I'm really after is 
practical advice on what's doable within in a short timeframe, i.e. a 
couple of days or so.

Thanks,
Tony

Student travel awards for P2PIR 2005 workshop (co-located with CIKM)

     Call for Participation and Student travel awards for

                  CIKM workshop on 
  Information Retrieval in Peer-to-Peer-Networks (P2PIR)"

           Bremen, Germany, November 4, 2005

    http://p2pir.is.informatik.uni-duisburg.de/2005/

It is our great pleasure to invite you to the 2th Workshop on
Information Retrieval in Peer-to-Peer Networks - P2PIR 2005,
co-located with CIKM 2005 (it is possible to register for the workshop
only).

Students who have no other funding for the workshop visit can apply
for further a reimbursement of 100 EUR for the workshop fees. Please
note that only a limited number of reimbursement grants are possible.

Registration infos are available at:
http://p2pir.is.informatik.uni-duisburg.de/2005/registration.html 

About the workshop:

This year's workshop aims at bringing together young researchers from
Information Retrieval and Database Systems working on peer-to-peer
information systems. Both communities have their own strategies at
solving the problem of efficient and effective query routing in
peer-to-peer networks, and a closer collaboration could have a large
impact on future P2PIR research. As such, this proposed workshop
continues the efforts from an SIGIR workshop last year on the same
topic, and the primary goal is to foster the collaboration process
started there.

In addition to 6 accepted papers, the program includes two discussion
sessions in order to benefit from different views in the two research
communities. One discussion session will deal with problems and
potential solutions in evaluating large-scale peer-to-peer
networks. The topic of the second discussion session will be fixed
together with the participants.

Workshop programme:

 8:45 -  9:00:  Workshop opening

 9:00 - 10:30:  Paper Session 1: 

      Hans Friedrich Witschel, Thomas Böhme: Evaluating Profiling and
      Query Expansion Methods for P2P Information Retrieval

      Roberto Castiglion, Massimo Melucci: An Evaluation of a
      Recursive Weighing Scheme for Information Retrieval in
      Peer-to-Peer Networks

      Paul-Alexandru Chirita, Andrei Damian, Wolfgang Nejdl, Wolf
      Siberski: Search Strategies for Scientific Collaboration
      Networks

10:30 - 10:45:  Coffee break

10:45 - 12:00:  Discussion Session 1: 

      Problems and Potential Solutions in Evaluating Large-Scale
      Peer-to-Peer Networks

12:00 - 13:30:  Lunch break

13:30 - 15:00:  Paper Session 2:

      Gudrun Fischer and André Nurzenski: Towards Scatter/Gather
      Bowsing in a Hierarchical Peer-to-Peer Network

      Felix Heine, Matthias Hovestadt, Odej Kao: Processing Complex
      RDF Queries over P2P Networks

      Haizheng Zhang, Victor Lesser: A Queueing Theory Based Analysis
      Of Agent Control Mechanism in Peer-to-Peer Information Retrieval
      Systems

15:00 - 15:30:  Coffee break

15:30 - 16:30:  Discussion Session 2:

      TAlgorithmic and methodological problems

Organizers:

* Henrik Nottelmann, University of Duisburg-Essen, Germany
* Karl Aberer, EPFL Lausanne, Switzerland
* Jamie Callan, Carnegie Mellon University, USA
* Wolfgang Nejdl, University of Hannover, Germany

--

-- 
   Henrik Nottelmann           Contact:
  Information Systems	       Lotharstr. 65, 47057 Duisburg, Germany
Institute of Informatics       fon:  +49 203 379-2281, fax: -2549
 and Interactive Systems       nottelmann@...
 University of Duisburg        www.is.informatik.uni-duisburg.de/~nottelmann

Re: Search engine evaluation

Re: Search engine evaluation

In the paper:

Dominich, S., and Skrop, A. (2005). Measuring the identification capability of
acronyms on the World Wide Web: a comparative study. Journal of Web
Engineering. vol, no. 3&4, pp: 220-215, ISSN  1540-9589

you will find a method you might find applicable to you needs.

Quoting Mark Sanderson <m.sanderson@...>:

> If I understand your request correctly, you want to evaluate the
> search engine against a set of agreed topics. If it is a search task
> where recall isn't all that important, then according to this paper
>
>
> http://dis.shef.ac.uk/mark/cv/publications/papers/my_papers/SIGIR2005.pdf
>
> all you need to do is examine the top 10 returned for each topic and
> measure the precision at 10. You will actually get a pretty good idea
> of the effectiveness of the system that way.
>
>
> All you need to do is At 19:41 19/10/2005, Tony Rose wrote:
> >Dear IR folks,
> >
> >Does anyone have any practical experience of using the results of one
> >search engine to "validate" the results of another?
> >
> >We are developing a prototype engine and want to measure its performance on
> >an agreed test set. We have some suitable queries, but won't be in a
> >position to manually generate any qrels (i.e. relevance judgements) for
> >quite some time. So, in the meantime, would comparing the results against
> >those of another engine (or engines) tell us anything valuable? Is there a
> >quick way to achieve a reliable set of "Gold Standard" results? Or is
> >waiting for the qrels the most meaningful option?
> >
> >BTW I am aware of a couple of academic papers that describe how in
> >principle you can eliminate system pooling, but what I'm really after is
> >practical advice on what's doable within in a short timeframe, i.e. a
> >couple of days or so.
> >
> >Thanks,
> >Tony
>
>
> http://nlp.cs.nyu.edu/hlt-naacl06/
>
>
> ____________________________________________________________________
> Mark Sanderson, Room 303               Tel: +44 (0) 114 22 22648
> Department of Information Studies      Fax: +44 (0) 114 27 80300
> University of Sheffield, Regent Court, mailto:m.sanderson@...
> Portobello St, Sheffield, S1 4DP, UK   http://dis.shef.ac.uk/mark/
> ____________________________________________________________________
> Good judgement is from experience, experience is from bad judgement
>

----------------------------------------------------------------
This message was sent using IMP, the Internet Messaging Program.

Re: Search engine evaluation

Re: Search engine evaluation

CFP INFOSCALE06: Submission Deadline: 15 Nov 2005 (EXTENDED)

First International Conference on Scalable Information Systems
(INFOSCALE 2006)
Co-sponsored by IEEE CS Society (pending approval)

30 May - 1 Jun 2006, Hong Kong

http://www.infoscale.org/

CALL FOR PAPERS

************************************************************
** Paper Submission Deadline Extended to 15 November 2005 **
************************************************************

As the data volumes continue to increase and the ways of information
dispersion across the globe continue to diversify, new scalable methods
and structures are needed for efficiently processing those distributed
and autonomous data. Grid computing, P2P technology, distributed
information retrieval technology, and networking technology all must be
merged to address the scalability concern. This forum focuses on this
key merged domain and looks for new integrated solutions for this
diversifying world of information.

Conference Scope:
	Parallel Information Retrieval
	Scalable Distributed Information Retrieval
	Scalable Grid Information Systems
	P2P Systems
	Scalable Mobile/Sensor DB Systems
	Index Compression Methods
	Architectures for Scalability
	Networking for Scalable Information Systems
	Scalable Information System Applications
	  (medicine, biology, military, etc.)
	Evaluation Metrics for Scalability
	VLDB
	Data Mining
	Information Security

Important Dates:
	Paper Submission Deadline: 15 Nov 2005 (EXTENDED)
	Notification: 15 Jan 2006
	Final Version Due: 15 Feb 2006

Publications: Original and previously unpublished technical papers
are solicited for presentation at the conference and publication in
the proceedings. The proceedings will be published by IEEE Press and
available online through IEEE Xplore. Selected papers will be
published in The International Journal of Grid Computing: Theory,
Methods and Applications (http://ees.elsevier.com/fgcs/).

General Chair
	Xiaohua Jia, City University of Hong Kong
	(jia@...)

PC Chairs
	Abdur Chowdhury, AOL (abdur@...)
	Francis Lau, The University of Hong Kong (fcmlau@...)
	Frank Zhigang Wang, Cambridge-Cranfield High Performance
	Computing Facilities (f.wang@...)

Steering Committee Chairs
	Imrich Chlamtac, CreateNet Research Consortium, Chair
	Ophir Frieder, Illinois Institute of Technology, Co-chair

Publicity Chair
	Jinli Cao, La Trobe University

Publications Chair
	Scott Huang, City University of Hong Kong

Workshops Chair
	Niki Pissinou, Florida International University, Chair
	Tirthankar Ghosh, Vice Chair
	Hao Zhu, Vice Chair	

Local Arrangement Chair
	Victor Lee, City University of Hong Kong

Program Committee
	Khalid Al-Begain, University of Glamorgan, Wales
	David Al-Dabass, University of Nottingham Trent, UK
	Mohand Boughanem, University Paul Sabatier, France
	Andrei Broder, IBM T. J. Watson Research Center, USA
	Wentong Cai, Nanyang Technological University, Singapore
	Jamie Callan, Carnegie Mellon University, USA
	David Carmel, IBM Research, Israel
	Jose Manuel Garcia Carrasco, University of Murcia, Spain
	Scott Cost, Johns Hopkins University Applied Physics Laboratory, USA
	Fabio Crestani, University of Strathclyde, UK
	Arjen de Vries, Centrum voor Wiskunde en Informatica, Netherlands
	David Doermann, University of Maryland, USA
	Tarek El-Ghazawi, George Washington University, USA
	Dan Feng, Huazhong University of Science and Technology, P. R. China
	Galal Hassan Galal-Edeen, Cairo University, Egypt
	Lee Giles, Pennsylvania State University, USA
	Nazli Goharian, Illinois Institute of Technology, USA
	Siegmar Gross, University of Applied Sciences, Germany
	David Grossman, Illinois Institute of Technology, USA
	David Hawking, Commonwealth Scientific and Industrial Research 
Organisation, Australia
	Andreas Henrich, University of Bamberg, Germany
	Otthein Herzog, University of Bremen, Germany
	Djoerd Hiemstra, University of Twente, Netherlands
	Jimmy Huang, York University, Canada
	George Ioannidis, University of Bremen, Germany
	Narayana Jayaram, London Metropolitan University, UK
	Guojun Jin, Lawrence Berkeley Laboratory, USA
	Joemon Jose, University of Glasgow, UK
	Paul Kantor, Rutgers University, USA
	Stefan Kirn, University of Hohenheim, Germany
	Aleksander Kolcz, AOL, USA
	Peter Komisarczuk, University of Wellington, New Zealand
	Axel Korthaus, University of Mannheim, Germany
	Donald Kraft, Louisiana State University, USA
	Mounia Lalmas, Queen Mary University of London, UK
	Minglu Li, Shanghai Jiaotong University, P. R. China
	Tao Li, University of Rochester, USA
	David Q. Liu, Purdue University, USA
	Andrew MacFarlane, City University London, UK
	James Mayfield, Johns Hopkins University, USA
	Massimo Melucci, University of Padova, Italy
	Lingkui Meng, Wuhan University, P. R. China
	Charles Nicholas, University of Maryland Baltimore County, USA
	Greg Pass, AOL, USA
	Yale Patt, University of Texas, USA
	Thomas Roelleke, Queen Mary University London, UK
	Heiner Stuckenschmidt, Vrije Universiteit Amsterdam, Netherlands
	Xian-He Sun, Illinois Institute of Technology, USA
	Ulrich Thiel, Fraunhofer Integrated Publication and information Systems 
Institute, Germany
	Ingo Timm, University of Bremen, Germany
	Anastasios Tombros, Queen Mary University London, UK
	Pavel Tvrdik, Czech Technical University, Czech Republic
	Herman Vandermulen, AOL, USA
	Zhichen Xu, Yahoo, USA
	Wai Gen Yee, Illinois Institute of Technology, USA
	Jim Yip, University of Huddersfield, UK
	Clement Yu, University of Illinois at Chicago, USA
	Zhu Zhang, University of Arizona, USA