February 2007 - Haskell

Announcing Djinn, version 2004-12-11, a coding wizard
by Lennart Augustsson 07 Apr '11

07 Apr '11

Howdy, y'all! I've written a small program that takes a (Haskell) type and gives you back a function of that type if one exists. It's kind of fun, so I thought I'd share it. It's probably best explained with a sample session. calvin% djinn Welcome to Djinn version 2005-12-11. Type :h to get help. # Djinn is interactive if not given any arguments. # Let's see if it can find the identity function. Djinn> f ? a->a f :: a -> a f x1 = x1 # Yes, that was easy. Let's try some tuple munging. Djinn> sel ? ((a,b),(c,d)) -> (b,c) sel :: ((a, b), (c, d)) -> (b, c) sel ((_, v5), (v6, _)) = (v5, v6) # We can ask for the impossible, but then we get what we # deserve. Djinn> cast ? a->b -- cast cannot be realized. # OK, let's be bold and try some functions that are tricky to write: # return, bind, and callCC in the continuation monad Djinn> type C a = (a -> r) -> r Djinn> returnC ? a -> C a returnC :: a -> C a returnC x1 x2 = x2 x1 Djinn> bindC ? C a -> (a -> C b) -> C b bindC :: C a -> (a -> C b) -> C b bindC x1 x2 x3 = x1 (\ c15 -> x2 c15 (\ c17 -> x3 c17)) Djinn> callCC ? ((a -> C b) -> C a) -> C a callCC :: ((a -> C b) -> C a) -> C a callCC x1 x2 = x1 (\ c15 _ -> x2 c15) (\ c11 -> x2 c11) # Well, poor Djinn has a sweaty brow after deducing the code # for callCC so we had better quit. Djinn> :q Bye. To play with Djinn do a darcs get http://darcs.augustsson.net/Darcs/Djinn or get http://darcs.augustsson.net/Darcs/Djinn/Djinn.tar.gz Then just type make. (You need a Haskell 98 implementation and some libraries.) And then start djinn. For the curious, Djinn uses a decision procedure for intuitionistic propositional calculus due to Roy Dyckhoff. It's a variation of Gentzen's LJ system. This means that (in theory) Djinn will always find a function if one exists, and if one doesn't exist Djinn will terminate telling you so. This is the very first version, so expect bugs. :) Share and enjoy. -- Lennart

8 13

Haskell-mode 2.0
by Stefan Monnier 02 Feb '09

02 Feb '09

I have recently taken over maintainership of Haskell-mode, and after making a bunch of changes, I figured it would be a good idea to make a new release. You can find this new release at: http://www-perso.iro.umontreal.ca/~monnier/elisp/ If you think it should also be found at http://www.haskell.org/haskell-mode/, then please tell John Peterson to get back to me (my email to him seem to go straight to the bitbucket. John?). This release has several changes that have all been only lightly tested, especially w.r.t compatibility with various Emacsen. See appended the NEWS file that describes some of the notewirthy changes. Stefan Changes since 1.45: * keybindings C-c <char> have been replaced by C-c C-<char> so as not to collide with minor modes. * The following modules are now automatically activated without having to add anything to haskell-mode-hook: haskell-font-lock (just turn on global-font-lock-mode). haskell-decl-scan (just bind `imenu' to some key). * In recent Emacsen, haskell-doc hooks into eldoc-mode. * haskell-hugs and haskell-ghci are superceded by inf-haskell. * Indentation rules have been improved when using layout inside parens/braces. * Symbols like -> and \ can be displayed as actual arrows and lambdas. See haskell-font-lock-symbols. * Tweaks to the font-lock settings. Among other things paren-matching with things like \(x,y) should work correctly now. * New maintainer <monnier(a)gnu.org>.

3 6

CfP: 2nd CEFP Functional Programming School, June 23-30, 2007
by HORVATH Zoltan 11 Jun '07

11 Jun '07

2nd Central-European Functional Programming School CEFP 2007 Cluj-Napoca, June 23-30, 2007 http://cs.ubbcluj.ro/cefp2007/ First Announcement - Call for participation - Call for PhD student presentation Aims and Scopes: The Central-European Functional Programming School (CEFP) is an intensive summer school series in the field of functional programming. The main goal is to bring together computer scientists, researchers, graduate and especially PhD students. The school would like to promote the research and the education of the functional programming languages, software technologies and programming methodologies. The second CEFP school will be organized by the Babeş-Bolyai University (Cluj-Napoca / Kolozsvár / Klausenburg) between 23-30 June, 2007. The previous school was held in Budapest, Hungary, July, 2005. The invited lecturers are prominent researchers in the field, and they will present state-of-the-art functional programming techniques. Beside the lectures practical courses will be held. The school includes a workshop for PhD students to present their work and get feed-back from the lecturers. Invited Lecturers: Rinus Plasmeijer (Radboud University Nijmegen, The Netherlands): iTasks: Defining Interactive Workflows for the Web Werner Kluge (Christian-Albrechts-Universität zu Kiel, Germany): Abstract Lambda Calculus Machines Marko van Eekelen (Radboud University Nijmegen, The Netherlands): Proving Properties of Lazy Functional Programs Tim Sheard (Portland State University, USA): The Omega Programming Language Ralf Hinze (Universität Bonn, Germany): Generics Three additional short courses will be given: Zoltán Horváth (Eötvös Loránd University, Budapest, Hungary): Refactoring Erlang Programs Zoltán Csörnyei (Eötvös Loránd University, Budapest, Hungary): Lambda-Calculus Horia F. Pop (Babeş-Bolyai University, Cluj-Napoca, Romania): A Tutorial on Object Orientedness in Functional Programming Submissions: PhD students are invited to submit the abstract of their presentations to be included in the workshop programme. Each presentation can be of max. 25 minutes. The full paper version can be submitted after the summer school. It is under negotiation to publish the revised lectures and the selected and reviewed papers in LNCS Volume. Venue: Cluj-Napoca / Kolozsvár / Klausenburg, formerly the capital of Transylvania, is one of the most beautiful medieval cities with a huge multicultural and historical inheritance. Surrounded by marvelous hills and mountains, the city provides fascinating environment for experiencing the unique ambience of a diversified culture, society and nature. Registration and costs: The registration fee (260 Euro) includes the course materials distributed during the school, the post-school volume, lunches, the excursion and the summer school banquet. For further information, accommodation possibilities and registration please visit the web-page of the event: http://www.cs.ubbcluj.ro/cefp2007. The deadline for registration and submissions is 1 June 2007.

1 2

TFP 2007: Last Call for Participation
by TFP 2007 28 Feb '07

28 Feb '07

Dear Colleagues, The deadline to register for TFP 2007 is quickly approaching. You may register at: http://cs.shu.edu/tfp2007/registration.html . Also, please be advised that the deadline to make hotel reservations at the guaranteed rate for TFP 2007 participants is also quickly approaching. Hotel information can be found at: http://cs.shu.edu/tfp2007/accomodations.html . You may browse the program and schedule for TFP 2007 at: http://cs.shu.edu/tfp2007/schedule.html . We look forward to seeing you in NYC!!! Cheers, Marco ************************************************************************************ Dr. Marco T. Morazan TFP 2007 Program Committee Chair http://cs.shu.edu/tfp2007/

1 0

ANNOUNCE: Gtk2Hs version 0.9.11 released
by Duncan Coutts 28 Feb '07

28 Feb '07

Gtk2Hs - A GUI Library for Haskell based on Gtk+ Version 0.9.11 is now available from: http://haskell.org/gtk2hs/download/ The source tarball and an installer for Windows are available. Packages are available for Gentoo and FreeBSD. Packages for various other platforms should become available soon (hopefully including Fedora, Debian and Darwin). Changes since 0.9.10: * works with GHC 6.6 and Gtk+ 2.10.x * new typed tree/list widget API * new OpenGL widget added * new cairo SVG package (for rendering SVG images on cairo surfaces) * new implementation of the Graphics.SOE API * new glade tutorial * many more demo programs (clock, graph, traffic congestion sim, fonts, noughts & crosses, opengl, svg and updated profile viewer and other tree/list demos) * much smaller binaries (thanks to the ghc 'split objs' feature) * many bugs fixed * new functions for working with the threaded RTS * various minor documentation improvements Gtk2Hs feature highlights: * automatic memory management * Unicode support * nearly full coverage of Gtk+ 2.8 API * support for several additional Gtk+/Gnome modules: * Glade visual GUI builder * cairo vector graphics library * SVG rendering for cairo * OpenGL extension (works with HOpenGL) * GConf, Gnome's system for storing app preferences * SourceView, code editor widget with syntax highlighting * the Mozilla browser rendering engine in a widget * an implementation of the Graphics.SOE API * extensive haddock API reference documentation * multi-platform support with native look * LGPL licence Platforms and requirements: * builds from source on Linux, Windows, MacOS X, FreeBSD and Solaris * builds with GHC 6.2 - 6.6 * works with Gtk+ version 2.0 through to 2.10 * SVG support requires librsvg version 2.16 or later Please report all problems to gtk2hs-devel(a)sourceforge.net Contributions and feedback are also most welcome. Windows release notes: The installer expects GHC 6.6 or 6.4.2. Support for GHCi is only available with GHC-6.6. Profiling libs are included (though you do not need to install them if you want to save disk space) The installer now comes bundled with Gtk+ itself so there's no need to download it separately. Hopefully this should also make the installation process a bit more reliable if only by reducing the number of configuration combinations. The windows build does not include the svgcairo, sourceview, gconf or mozembed packages since they introduce rather a large number of dependencies and would make the installer a much bigger download. Duncan (on behalf of the Gtk2Hs team)

1 0

Re: [Haskell] [Fwd: Re: Computer Language Shootout]
by Andrzej Jaworski 27 Feb '07

27 Feb '07

The examples I pointed to seem to share strong and relatively consistent logic of a program. In case of large GA (e.g. Royal Road Problem) and IFP (e.g. ADATE) SML was exhaustively proved to predict this logic much better. In case of Algebraic Dynamic Programming C compiler seems to address specific properties of a program more adequately which leads to substantial improvements in optimization. It is important to stress that we deal in ADP with strong logic of the domain application. Handcrafting C code for regular applications does not show that kind of advantage, so it wouldn't leave Haskell in the dust. In general declarative nature has the edge over C craftsmanship (see: http://www.clip.dia.fi.upm.es/papers/carro06:stream-interpreter-TR.pdf)

5 9

[Fwd: Re: Computer Language Shootout]
by Simon Marlow 27 Feb '07

27 Feb '07

Forwarding on behalf of Andrzej Jaworski <himself(a)poczta.nom.pl>: -------- Original Message -------- From: Andrzej Jaworski <himself(a)poczta.nom.pl> Dear fellows, It is ironic that just after SPJ disclosed Comments from Brent Fulgham on Haskell and the shootout the situation has radically changed for the worse. Without knowing that I committed a blunder referring to the damn benchmark http://shootout.alioth.debian.org/gp4/benchmark.php?test=all&lang=all together with multicore support arguments when trying to convert a prominent OCaml programmer to Haskell. Now they know more of us:-) What a language it is that jumps 30% up and down on benchmark while other languages gracefully stay in line? Can any of you explain the reason for this disgraceful degradation in Computer Language Shootout? Clean has also declined in these benchmarks but not that much as Haskell. According to John van Groningen Clean's binary-trees program in the previous shootout version used lazy data structure which resulted in lower memory usage and much faster execution. That was removed by the maintainer of the shootout and replaced by a much slower one using strict data structure. I fear that if laziness accounted for previous good scores of GHC then algorithms where laziness is downplayed must be responsible for that anecdotal opinion that Haskell can be extremely slow. For example: on Royal Road Problem in genetic algorithms http://www.dcs.ed.ac.uk/home/stg/sfpw/book/Garmendia-Doval/cameraready.ps Haskell was found to be on average over 500 times slower than SML implementation! If such extreme variations in performance are inherent for Haskell then the support for multicore rather than boosting its relative performance (against e.g. one-core-bound OCaml) may merely amplify Haskell unevenness to the point where programming becomes more of an art than a science like it is in Prolog. Perhaps making a collective effort towards benchmarking Haskell programs and analyzing the results in some methodic way could prove helpful? Regards, Andrzej Jaworski

14 14

AOSD 2007: call for participation
by Oege.de.Moor＠comlab.ox.ac.uk 26 Feb '07

26 Feb '07

AOSD 2007 International Conference on Aspect-Oriented Software Development Vancouver, BC, March 12-16 AOSD is the premier conference on software modularity that crosscuts traditional abstraction boundaries. This year's programme includes several papers from related communities, and a schedule of the research track is included below. The full proceedings can already be accessed in the ACM digital library at: http://portal.acm.org/toc.cfm?id=1218563&idx=SERIES10702&type=proceeding&co… Furthermore citation details are available on DBLP at http://www.informatik.uni-trier.de/~ley/db/conf/aosd/aosd2007.html For further information on AOSD 2007 and to register, visit http://aosd.net/conference The deadline for the hotel discount is this Friday. -------------------------------------------------- AOSD 2007: RESEARCH PROGRAM Session 1: Applications Wednesday, 11:00-12:30 Session Chair: Laurie Hendren Aspect-Oriented Application-Level Scheduling for J2EE Servers Kenichi Kourai, Tokyo Institute of Technology Hideaki Hibino, Tokyo Institute of Technology Shigeru Chiba, Tokyo Institute of Technology Framework Specialization Aspects André Santos, Tampere University of Technology Antónia Lopes, University of Lisbon Kai Koskimies, Tampere University of Technology An Aspect-Oriented Approach to Bypassing Middleware Layers Omer Demir, University of California Davis Premkumar Devanbu, University of California Davis Eric Wohlstadter, University of British Columbia Stefan Tai, IBM Research Session 2: Early aspects, models and design Wednesday, 14:00-15:30 Session Chair: Eric Eide Semantics-Based Composition for Aspect-Oriented Requirements Engineering Ruzanna Chitchyan, Lancaster University Awais Rashid, Lancaster University Paul Rayson, Lancaster University Robert Waters, Lancaster University >From Aspect-Oriented Design to Aspect-Oriented Programs: tool-supported translation of JPDDs into Code Stefan Hanenberg, University of Duisburg-Essen Dominik Stein, University of Duisburg-Essen Rainer Unland, University of Duisburg-Essen A Static Aspect Language for Checking Design Rules Clint Morgan, University of British Columbia Kris De Volder, University of British Columbia Eric Wohlstadter, University of British Columbia Session 3: Tools Wednesday, 16:00-17:30 Session Chair: Mik Kersten Expressive Programs through Presentation Extension Andrew D. Eisenberg, University of British Columbia Gregor Kiczales, University of British Columbia A Graph-Based Approach to Modelling and Detecting Composition Conflicts Related to Introductions Wilke Havinga, University of Twente Istvan Nagy, ASML Lodewijk Bergmans, University of Twente Mehmet Aksit, University of Twente Debugging with Control-Flow Breakpoints Rick Chern, University of British Columbia Kris De Volder, University of British Columbia Session 4: Programming language semantics Thursday, 11:00-12:30 Session Chair: Hidehiko Masuhara Open Bisimulation for Aspects Radha Jagadeesan, School of CTI, DePaul University Corin Pitcher, School of CTI, DePaul University James Riely, School of CTI, DePaul University Tribe: A simple Virtual Class Calculus Dave Clarke, Centrum voor Wiskunde en Informatica (CWI) Sophia Drossopoulou, Imperial College London James Noble, Victoria University of Wellington Tobias Wrigstad, Stockholm University Fully Abstract Semantics of Additive Aspects by Translation Sam Sanjabi, Oxford University Computing Laboratory Luke Ong, Oxford University Computing Laboratory Session 5: Programming languages Thursday, 14:00-16:00 Session Chair: Awais Rashid Conservative Aspect-Orientated Programming with the e-language Matan Vax, Cadence Design SCOPE: an AspectJ Compiler for Supporting User-Defined Analysis-Based Pointcuts Tomoyuki Aotani, University of Tokyo, Japan Hidehiko Masuhara, University of Tokyo Declarative Failure Recovery for Sensor Networks Ramakrishna Gummadi, Univerity of Southern California Nupur Kothari, Univerity of Southern California Todd Millstein, University of California at Los Angeles Ramesh Govindan, Univerity of Southern California cJ: Enhancing Java with Safe Type Conditions Shan Shan Huang, Georgia Institute of Technology David Zook, Georgia Institute of Technology Yannis Smaragdakis, University of Oregon Panel: Beyond AspectJ: AOP languages in 2017 Thursday, 16:30-18:00 What will the next generation of aspect-oriented programming languages look like? How will they be different from AspectJ? Must they support obliviousness? How will aspect interfaces be specified? In what form will open classes be present? Or will aspects turn out to be an instance of a more general and elegant modularisation mechanism? panelists: Theo d'Hondt, Vrije Universiteit Brussels, Belgium Hidehiko Masuhara, University of Tokyo, Japan Klaus Ostermann, Technical University Darmstadt, Germany Yannis Smaragdakis, University of Oregon, USA Session 6: Aspect mining Friday, 11:00-12:30 Session Chair: Yvonne Coady Simple Cross-Cutting Concerns are not so Simple Magiel Bruntink, Centrum voor Wiskunde en Informatica Arie van Deursen, Delft University of Technology Maja D'Hondt, Centrum voor Wiskunde en Informatica Tom Tourwé, Eindhoven University of Technology Using Natural Language Program Analysis to Locate and Understand Action-Oriented Concerns David Shepherd, University of Delaware Zachary Fry, University of Delaware Emily Hill, University of Delaware K. Vijay-Shanker, University of Delaware Lori Pollock, University of Delaware Efficiently Mining Crosscutting Concerns Through Random Walks Charles Zhang, University of Toronto Hans-Arno Jacobsen, University of Toronto

1 0

Dutch Functional Programming Day 2008
by Johan Jeuring 24 Feb '07

24 Feb '07

[Apologies for the following posting in Dutch. This message will only be sent once. In the email I ask interested people (presumably Dutch) to attend a (yearly) meeting about functional programming in the Netherlands, and to register to a Dutch mailing list about functional programming.] --- Eerste (en wat vroege) aankondiging: De functioneel programmeren dag 2008 vindt plaats op: 11 januari 2008 bij de Open Universiteit op het studiecentrum Utrecht: http://www.ou.nl/eCache/DEF/1/931.html Aanmelden, zowel voor deelname als voor het geven van een presentatie, is nu al mogelijk! Zie ook: http://www.cs.uu.nl/~johanj/FPDag2008/ Ik heb deze email gestuurd naar zowel de fp-nl lijst, als een redelijk groot aantal andere mogelijk geinteresseerden. Ik ben van plan om na deze email de aankondigingen alleen maar meer naar fp-nl te sturen, dus: meld je aan bij de fp-nl lijst op https://mail.cs.uu.nl/mailman/listinfo/fp-nl als je verdere aankondigingen van deze dag wilt ontvangen (fp-nl is een lijst met erg weinig verkeer, en wat dat betreft dus redelijk onschuldig). Programma: 10:00-10:30 Koffie 10:30-12:00 Presentaties 12:00-13:00 Lunch 13:00-14:30 Presentaties 14:30-15:00 Thee 15:00-16:00 Presentaties 16:00-? borrel Met vriendelijke groet, Johan Jeuring

1 0

CFP: IEEE/WIC/ACM IAT 2007 (Silicon Valley, USA)
by Jia Hu 24 Feb '07

24 Feb '07

[Apologies if you receive this more than once] ##################################################################### IEEE/WIC/ACM Intelligent Agent Technology 2007 CALL FOR PAPERS ##################################################################### 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07) Silicon Valley, USA, November 2-5, 2007 http://www.cs.sjsu.edu/wi07/iat/ (to be collocated with BIBM'07 and GrC'07) Sponsored By IEEE Computer Society Web Intelligence Consortium (WIC) Association for Computing Machinery (ACM) ##################################################################### # Conference Chair # Andrei Broder, VP, Yahoo Fellow, Yahoo! Research # # Program Chair and Co-Chairs # T.Y. Lin, San Jose State University/UC Berkeley, USA # Jeffrey M. Bradshaw, UWF/Institute for Human and Machine Cognition, USA # Matthias Klusch, German Research Center for AI, Germany # Chengqi Zhang, University of Technology, Sydney, Australia # # Organizing Chair # Howard Ho, Manager, IBM Almaden Research Center # # IAT-WI Joint Keynote Speakers (Tentative) # # Vinton G. Cerf, Turing Award Winner, # VP and Chief Internet Evangelist, Google # Anant Jhingran, VP and CTO, IBM Silicon Valley Laboratory # # (More IAT Invited Speakers will be announced) # # (Papers Due: ** June 1 **, 2007) # Accepted papers will be published in the conference proceedings # by the IEEE Computer Society Press, which are indexed by EI. ###################################################################### The 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT'07) will be jointly held with the 2007 IEEE/WIC/ACM International Conference on Web Intelligence (WI'07), the 2007 IEEE International Conference on BioInformation and BioMedicine (BIBM'07), and the 2007 IEEE International Conference on Granular Computing (GrC'07) for providing synergism among the four research areas. It will provide opportunities for technical collaboration beyond that of previous conferences. The four conferences will have a joint opening, keynote, reception, and banquet. Attendees only need to register for one conference and can attend workshops, sessions and tutorials across the four conferences. We are also planning a joint panel and joint paper sessions that discuss common problems in the four areas. IAT 2007 provides a leading international forum to bring together researchers and practitioners from diverse fields, such as computer science, information technology, business, education, human factors, systems engineering, and robotics, to (1) examine the design principles and performance characteristics of various approaches in intelligent agent technology, and (2) increase the cross-fertilization of ideas on the development of autonomous agents and multi-agent systems among different domains. By encouraging idea-sharing and discussions on the underlying logical, cognitive, physical, and sociological foundations as well as the enabling technologies of intelligent agents, IAT 2007 will foster the development of novel paradigms and advanced solutions in agent-based computing. +++++++++++ Highlights +++++++++++ The conference will be held in Silicon Valley, California. Many high-tech companies and three distinguished universities (Stanford, UC Berkely and UCSC) are just around the corner. The highlight of the conference is that a unique forum consisting of a half-day demo session and free discussion will be organized to link industries and academics. Leading IT companies like IBM, Google, and Yahoo etc will present at the conference. The area now known as Silicon Valley has been a center of technological development since the 1950's. The name Silicon Valley stems from the early 1970's, when the area had become the center for many semiconductor companies. While still hosting semiconductor and microprocessor companies, the region now hosts the headquarters of high tech companies of every kind, including many of the best known and most prestigious names in personal computers, Web search, Internet auctions, networking, storage, databases, etc. +++++++++++++++++++ Topics of Interest +++++++++++++++++++ The topics and areas include, but not limited to: * Autonomy-Oriented Computing (AOC) - Agent-Based Complex Systems Modeling and Development - Agent-Based Simulation - Autonomy-Oriented Modeling and Computation Methods - Behavioral Self-Organization - Complex Behavior Characterization and Engineering - Emergent Behavior - Hard Computational Problem Solving - Nature-Inspired Paradigms - Self-Organized Criticality - Self-Organized Intelligence - Swarm Intelligence * Autonomous Knowledge and Information Agents - Agent-Based Distributed Data Mining - Agent-Based Knowledge Discovery And Sharing - Autonomous Information Services - Distributed Knowledge Systems - Emergent Natural Law Discovery in Multi-Agent Systems - Evolution of Knowledge Networks - Human-Agent Interaction - Information Filtering Agents - Knowledge Aggregation - Knowledge Discovery - Ontology-Based Information Services * Agent Systems Modeling and Methodology - Agent Interaction Protocols - Cognitive Architectures - Cognitive Modeling of Agents - Emotional Modeling - Fault-Tolerance in Multi-Agent Systems - Formal Framework for Multi-Agent Systems - Information Exchanges in Multi-Agent Systems - Learning and Self-Adaptation in Multi-Agent Systems - Mobile Agent Languages and Protocols - Multi-Agent Autonomic Architectures - Multi-Agent Coordination Techniques - Multi-Agent Planning and Re-Planning - Peer-to-Peer Models for Multi-Agent Systems - Reinforcement Learning - Social Interactions in Multi-Agent Systems - Task-Based Agent Context - Task-Oriented Agents * Distributed Problem Solving - Agent-Based Grid Computing - Agent Networks in Distributed Problem Solving - Collective Group Behavior - Coordination and Cooperation - Distributed Intelligence - Distributed Search - Dynamics of Agent Groups and Populations - Efficiency and Complexity Issues - Market-Based Computing - Problem-Solving in Dynamic Environments * Autonomous Auctions and Negotiation - Agent-Based Marketplaces - Auction Markets - Combinatorial Auctions - Hybrid Negotiation - Integrative Negotiation - Mediating Agents - Pricing Agents - Thin Double Auctions * Applications - Agent-Based Assistants - Agent-Based Virtual Enterprise - Embodied Agents and Agent-Based Systems Applications - Interface Agents - Knowledge and Data Intensive Systems - Perceptive Animated Interfaces - Scalability - Social Simulation - Socially Situated Planning - Software and Pervasive Agents - Tools and Standards - Ubiquitous Systems and E-Technology Agents - Ubiquitous Software Services - Virtual Humans - XML-Based Agent Systems ++++++++++++++++++++++++++++++++++++ On-Line Submissions and Publication ++++++++++++++++++++++++++++++++++++ High-quality papers in all IAT related areas are solicited. Paper submissions should be limited to a maximum of 7 pages in the IEEE 2-column format, the same as the camera-ready format (see the Author Guidelines of last year at http://www.computer.org/portal/pages/cscps/cps/final/iat06.xml) All submitted papers will be reviewed by the Program Committee on the basis of technical quality, relevance, significance, and clarity. Note that IAT'07 will accept ONLY on-line submissions, containing PDF versions. Please use the Submission Form on the IAT'07 website to submit your paper. Accepted papers will be published in the conference proceedings by the IEEE Computer Society Press that are indexed by EI. Submissions accepted as regular papers will be allocated 7 pages in the proceedings and accorded oral presentation times in the main conference. Submissions accepted as short papers will be allocated 4 pages in the proceedings and will have a shorter presentation time at the conference than regular papers. All co-authors will be notified at all time, for the submission, notification, and confirmation on the attendance. Submitting a paper to the conference and workshops means that, if the paper is accepted, at least one author should attend the conference to present the paper. The acceptance list and no-show list will be openly published on-line. For no-show authors, their affiliations will receive a notification. A selected number of IAT'07 accepted papers will be expanded and revised for inclusion in Web Intelligence and Agent Systems: An International Journal (http://wi-consortium.org/journal.html) and in Annual Review of Intelligent Informatics (http://www.wi-consortium.org/annual.html) More detailed instructions and the On-Line Submission Form can be found from the IAT'07 homepage: http://www.cs.sjsu.edu/wi07/iat/. +++++++++++++++++++++++++ IAT'07 Best Paper Awards +++++++++++++++++++++++++ The best paper awards will be conferred at the conference on the authors of (1) the best research paper and (2) the best application paper. Application-oriented submissions will be considered for the best application paper award. The full author list and paper title will be announced on the Web Intelligence Consortium homepage: http://wi-consortium.org/html/wicawards.html ++++++++++++++++++++ Industry/Demo-Track ++++++++++++++++++++ We solicit Industry/Demo-Track papers by the following methods. (1) Industry papers of 4 pages can be submitted on the same schedule as the research track. (2) Separate 2 page demo proposals can submitted at a later schedule. (3) Full regular paper submissions can include a demo option. That is, a full paper submissions will be asked to specify if they would like to give a demonstration; choice of demonstrations (while utilizing information from the regular reviewing process) will be selected based on value as a demonstration. For options (1) and (2), please find more detailed instructions at the homepage: http://www.cs.sjsu.edu/wi07/wi/ We are planning to arrange the Industry/Demo track in the afternoon of November 3 (before and during the conference reception), jointly with the IAT'07 Demo sessions. Leading IT companies in Silicon Valley will be invited to attend this track. ++++++++++ Workshops ++++++++++ As an important part of the conference, the workshop program will focus on new research challenges and initiatives. All papers accepted for workshops will be included in the Workshop Proceedings published by the IEEE Computer Society Press that are indexed by EI, and will be available at the workshops. Detailed information is available at the conference homepage. Note: we will not have a separate workshop registration fee (i.e., only one conference registration covers everything). For more information, please visit the conference website at http://www.cs.sjsu.edu/wi07/iat/. ++++++++++ Tutorials ++++++++++ IAT'07 also welcomes Tutorial proposals. IAT'07 will include tutorials providing in-depth background on subjects that are of broad interest to the intelligent agent community. Both short (2 hours) and long (half day) tutorials will be considered. The tutorials will be part of the main conference technical program. Detailed information is available at the conference homepage. Note: we will not have a separate tutorials registration fee (i.e., only one conference registration covers everything). ++++++++++++++++ Important Dates ++++++++++++++++ Workshop proposal submission: March 20, 2007 Electronic submission of full papers: ** June 1, 2007 ** Tutorial proposal submission: June 15, 2007 Notification of paper acceptance: August 3, 2007 Camera-ready copies of accepted papers: August 17, 2007 Conference: November 2-5, 2007 ++++++++++++++++++++++++ Conference Organization ++++++++++++++++++++++++ Conference Chair: * Andrei Broder, Yahoo! Research, USA Program Chair: * Tsau Young (T.Y.) Lin, San Jose State University/UC Berkeley, USA IAT Program Co-Chairs: * Jeffrey M. Bradshaw, UWF/Institute for Human and Machine Cognition, USA * Matthias Klusch, German Research Center for AI, Germany * Chengqi Zhang, University of Technology, Sydney, Australia WI Program Co-Chairs: * Laura Haas, IBM Almaden Research Center, USA * Janusz Kacprzyk, Polish Academy of Science, Poland * Rajeev Motwani, Stanford University, USA Organizing Chair: * Howard Ho, IBM Almaden Research Center, USA Workshop Co-Chairs: * Vijay Raghavan, University of Louisiana, USA * Yuefeng Li, Queensland University of Technology, Australia Tutorial Chair: * Pawan Lingras, Saint Mary's University, Canada Industry/Demo-Track Chair: * Jianchang Mao, Yahoo! Inc., USA Local Accommodations Co-Chairs: * David Scot Taylor, San Jose State University, USA * Tom Qi Zhang, Google, USA Publicity Chair: * James Wang, Clemson University, USA (chair) Publicity Co-Chairs: * Martine De Cock, Ghent University, Belgium * Jia Hu, International WIC Institute, China * Debajyoti Mukhopadhyay, West Bengal University of Technology, India IEEE-CS-TCII Chair: * Ning Zhong, Maebashi Institute of Technology, Japan ACM-SIGART Chair * Maria Gini, University of Minnesota, USA WIC Co-Chairs/Directors: * Ning Zhong, Maebashi Institute of Technology, Japan * Jiming Liu, University of Windsor, Canada WIC Advisory Board: * Edward A. Feigenbaum, Stanford University, USA * Setsuo Ohsuga, Waseda University, Japan * Benjamin Wah, University of Illinois, Urbana-Champaign, USA * Philip Yu, IBM Thomas J. Watson Research Center, USA * L.A. Zadeh, University of California Berkeley, USA WIC Tech. Committee & WI/IAT Steering Committee: * Jeffrey Bradshaw, UWF/Institute for Human and Machine Cognition, USA * Nick Cercone, Dalhousie University, Canada * Dieter Fensel, National University of Ireland, Ireland * Georg Gottlob, Oxford University, UK * Lakhmi Jain, University of South Australia, Australia * Jianchang Mao, Yahoo! Inc., USA * Pierre Morizet-Mahoudeaux, Compiegne University of Technology, France * Hiroshi Motoda, Osaka University, Japan * Toyoaki Nishida, Kyoto University, Japan * Andrzej Skowron, Warsaw University, Poland * Jinglong Wu, Kagawa University, Japan * Xindong Wu, University of Vermont, USA * Yiyu Yao, University of Regina, Canada Webmaster: * Albert Sutojo, San Jose State University, USA *** Contact Information *** Jia Hu International WIC Institute, China E-mail: hujia(a)kis-lab.com

1 0