18.451 new publication

From: Humanist Discussion Group (by way of Willard McCarty willard.mccarty_at_kcl.ac.uk>
Date: Fri, 31 Dec 2004 06:41:13 +0000

               Humanist Discussion Group, Vol. 18, No. 451.
       Centre for Computing in the Humanities, King's College London
                     Submit to: humanist_at_princeton.edu

         Date: Fri, 31 Dec 2004 06:36:18 +0000
         From: Willard McCarty <willard.mccarty_at_kcl.ac.uk>
         Subject: new publications

Volume 3381/2005 (SOFSEM 2005: Theory and Practice of Computer Science)
of Lecture Notes in Computer Science is now available on the
SpringerLink web site at http://springerlink.metapress.com.

This issue contains:

Discovering Treewidth p. 1
Hans L. Bodlaender

  From Research Prototypes to Industrial Strength Open Source Products - The
ObjectWeb Experience p. 17
Emmanuel Cecchet

How Hard Is It to Take a Snapshot? p. 28
Faith Ellen Fich

Logical Foundations for Data Integration p. 38
Maurizio Lenzerini

Recent Advances in Graph Drawing p. 41
Petra Mutzel

The Hyperdatabase Network - New Middleware for Searching and Maintaining
the Information Space p. 42
Hans-Jörg Schek

Architecture of a Business Framework for the .NET Platform and Open Source
Environments p. 47
Thomas Seidmann

Progress on Crossing Number Problems p. 53
László A. Székely

Greedy Differential Approximations for Min Set Cover p. 62
C. Bazgan, J. Monnot, V. Th. Paschos, F. Serričre

A Methodology of Visual Modeling Language Evaluation p. 72
Anna Bobkowska

Local Computations on Closed Unlabelled Edges: The Election Problem and the
Naming Problem (Extended Abstract) p. 82
Jérémie Chalopin

A Hierarchical Markovian Mining Approach for Favorite Navigation
Patterns p. 92
Jiu Jun Chen, Ji Gao, Jun Hu, Bei Shui Liao

Non-planar Orthogonal Drawings with Fixed Topology Extended Abstract p. 96
Markus Chimani, Gunnar W. Klau, René Weiskircher

A Topology-Driven Approach to the Design of Web Meta-search Clustering
Engines p. 106
Emilio Di Giacomo, Walter Didimo, Luca Grilli, Giuseppe Liotta

Computing Upward Planar Drawings Using Switch-Regularity Heuristics p. 117
Walter Didimo

Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers p. 127
Kayhan Erciyes, Ali Alp, Geoffrey Marshall

Two-Layer Planarization: Improving on Parameterized Algorithmics p. 137
Henning Fernau

On the Stability of Approximation for Hamiltonian Path Problems p. 147
Luca Forlizzi, Juraj Hromkovic, Guido Proietti, Sebastian Seibert

Robustness of Composed Timed Systems p. 157
Hacčne Fouchal, Antoine Rollet, Abbas Tarhini

Topology Generation for Web Communities Modeling p. 167
György Frivolt, Mária Bieliková

Recursion Versus Replication in Simple Cryptographic Protocols p. 178
Hans Hüttel, Jirí Srba

Modeling Data Integration with Updateable Object Views p. 188
Piotr Habela, Krzysztof Kaczmarski, Hanna Kozankiewicz, Kazimierz Subieta

Fixed-Parameter Tractable Algorithms for Testing Upward Planarity p. 199
Patrick Healy, Karol Lynch

Read/Write Based Fast-Path Transformation for FCFS Mutual Exclusion p. 209
Prasad Jayanti, Srdjan Petrovic, Neha Narula

Adjustment of Indirect Association Rules for the Web p. 219
Przemyslaw Kazienko, Mariusz Matrejek

Anonymous Communication with On-line and Off-line Onion Encoding p. 229
Marek Klonowski, Miroslaw Kutylowski, Filip Zagórski

Characteristic Patterns for LTL p. 239
Antonín Kucera, Jan Strejcek

Planar Straight-Line Drawing in an Grid with Angular Resolution O(1/ n) p.
Maciej Kurowski

Modeling Nested Relationships in XML Documents Using Relational
Databases p. 259
Olli Luoma

RAQ: A Range-Queriable Distributed Data Structure p. 269
Hamid Nazerzadeh, Mohammad Ghodsi

On Some Weighted Satisfiability and Graph Problems p. 278
Stefan Porschen

On the Security and Composability of the One Time Pad p. 288
Dominik Raub, Rainer Steinwandt, Jörn Müller-Quade

Lower Bounds on the OBDD Size of Graphs of Some Popular Functions p. 298
Daniel Sawitzki

XML-Based Declarative Access Control p. 310
Robert Steele, William Gardner, Tharam S. Dillon, Abdelkarim Erradi

VCD: A Visual Formalism for Specification of Heterogeneous Software
Architectures p. 320
David Safránek, Jiri Simsa

Cost-Constrained Minimum-Delay Multicasting (Extended Abstract) p. 330
Satoshi Tayu, Turki Ghazi Al-Mutairi, Shuichi Ueno

Ontology-Based Inconsistency Management of Software Requirements
Specifications p. 340
Xuefeng Zhu, Zhi Jin

Suffix Tree Based Data Compression p. 350
Martin Senft

Tier Aspect Model Based on Updatable Views p. 360
Radoslaw Adamus, Kazimierz Subieta

Well-Founded Metamodeling for Model-Driven Architecture p. 364
Liliana Favre

Stepwise Optimization Method for k-CNN Search for Location-Based
Service p. 368
Jun Feng, Naoto Mukai, Toyohide Watanabe

An Approach for Integrating Analysis Patterns and Feature Diagrams into
Model Driven Architecture p. 372
Roman Filkorn, Pavol Návrat

Outerplanar Crossing Numbers of 3-Row Meshes, Halin Graphs and Complete
p-Partite Graphs p. 376
Radoslav Fulek, Hongmei He, Ondrej Sýkora, Imrich Vrto

Fast Bit-Vector Algorithms for Approximate String Matching Under Indel
Distance p. 380
Heikki Hyyrö, Yoan Pinzon, Ayumi Shinohara

Feature Selection by Reordering p. 385
Marcel Jirina, Marcel Jirina Jr.

A Management Scheme for the Basic Types in High Level Languages p. 390
Fritz Mayer-Lindenberg

Bayesian Networks in Software Maintenance Management p. 394
Ana C.V. de Melo, Adilson de J. Sanchez

A Multiagent System Aiding Information Retrieval in Internet Using
Consensus Methods p. 399
Ngoc Thanh Nguyen, Adam Blazowski, Michal Malowiecki

Interval-Valued Data Structures and Their Application to e-Learning p. 403
Adam Niewiadomski

Boolean Functions with a Low Polynomial Degree and Quantum Query
Algorithms p. 408
Raitis Ozols, Rusins Freivalds, Jevgenijs Ivanovs, Elina Kalnina, Lelde
Lace, Masahiro Miyakawa, Hisayuki Tatsumi, Daina Taimina

Representation of Extended RBAC Model Using UML Language p. 413
Aneta Poniszewska-Maranda, Gilles Goncalves, Fred Hemery

A Methodology for Writing Class Contracts p. 418
Nele Smeets, Eric Steegmans

Volumes of 3D Drawings of Homogenous Product Graphs (Extended Abstract) p.
Lubomir Torok

[NB: If you do not receive a reply within 24 hours please resend]
Dr Willard McCarty | Senior Lecturer | Centre for Computing in the
Humanities | King's College London | Strand | London WC2R 2LS || +44 (0)20
7848-2784 fax: -2980 || willard.mccarty_at_kcl.ac.uk
Received on Fri Dec 31 2004 - 01:52:46 EST

This archive was generated by hypermail 2.2.0 : Fri Dec 31 2004 - 01:52:50 EST