Advances in Data and Web Management (eBook)

Preface 6
Organization 8
Table of Contents 16
Data Mining Using Fractals and Power Laws 24
Exploring the Power of Links in Data Mining 25
Community Systems: The World Online 26
A New DBMS Architecture for DB-IR Integration 27
Study on Efficiency and Effectiveness of KSORD 29
Discovering Web Services Based on Probabilistic Latent Factor Model 41
SCORE: Symbiotic Context Oriented Information Retrieval 53
Process Aware Information Systems: A Human Centered Perspective 62
IMCS: Incremental Mining of Closed Sequential Patterns 73
Mining Time-Shifting Co-regulation Patterns from Gene Expression Data 85
Tight Correlated Item Sets and Their Efficient Discovery 97
Improved Prediction of Protein Secondary Structures Using Adaptively Weighted Profiles 106
Framework for Building a High-Quality Web Page Collection Considering Page Group Structure 118
Multi-document Summarization Using Weighted Similarity Between Topic and Clustering-Based Non-negative Semantic Feature 131
A Fair Load Balancing Algorithm for Hypercube-Based DHT Networks 139
LINP: Supporting Similarity Search in Unstructured Peer-to-Peer Networks 150
Generation and Matching of Ontology Data for the Semantic Web in a Peer-to-Peer Framework 159
Energy-Efficient Skyline Queries over Sensor Network Using Mapped Skyline Filters 167
An Adaptive Dynamic Cluster-Based Protocol for Target Tracking in Wireless Sensor Networks 180
Distributed, Hierarchical Clustering and Summarization in Sensor Networks 191
A New Similarity Measure for Near Duplicate Video Clip Detection 199
Efficient Algorithms for Historical Continuous kNN Query Processing over Moving Object Trajectories 211
Effective Density Queries for Moving Objects in Road Networks 223
An Efficient Spatial Search Method Based on SG-Tree 235
Getting Qualified Answers for Aggregate Queries in Spatio-temporal Databases 243
Dynamic Adaptation Strategies for Long-Term and Short-Term User Profile to Personalize Search 251
Using Structured Tokens to Identify Webpages for Data Extraction 264
Honto? Search: Estimating Trustworthiness of Web Information by Search Results Aggregation and Temporal Analysis 276
A Probabilistic Reasoning Approach for Discovering Web Crawler Sessions 288
An Exhaustive and Edge-Removal Algorithm to Find Cores in Implicit Communities 296
Active Rules Termination Analysis Through Conditional Formula Containing Updatable Variable 304
Computing Repairs for Inconsistent XML Document Using Chase 316
An XML Publish/Subscribe Algorithm Implemented by Relational Operators 328
Retrieving Arbitrary XML Fragments from Structured Peer-to-Peer Networks 340
Combining Smooth Graphs with Semi-supervised Learning 352
Extracting Trend of Time Series Based on Improved Empirical Mode Decomposition Method 364
Spectral Edit Distance Method for Image Clustering 373
Mining Invisible Tasks from Event Logs 381
The Selection of Tunable DBMS Resources Using the Incremental/Decremental Relationship 389
Hyperclique Pattern Based Off-Topic Detection 397
An Energy Efficient Connected Coverage Protocol in Wireless Sensor Networks 405
A Clustered Routing Protocol with Distributed Intrusion Detection for Wireless Sensor Networks 418
Continuous Approximate Window Queries in Wireless Sensor Networks 430
A Survey of Job Scheduling in Grids 442
Relational Nested Optional Join for Efficient Semantic Web Query Processing 451
Efficient Processing of Relational Queries with Sum Constraints 463
A Theoretical Framework of Natural Computing – M Good Lattice Points (GLP) Method 475
Building Data Synopses Within a Known Maximum Error Bound 486
Exploiting the Structure of Update Fragments for Efficient XML Index Maintenance 494
Improvements of HITS Algorithms for Spam Links 502
Efficient Keyword Search over Data-Centric XML Documents 514
Promotional Ranking of Search Engine Results: Giving New Web Pages a Chance to Prove Their Values 526
Adaptive Scheduling Strategy for Data Stream Management System 534
A QoS-Guaranteeing Scheduling Algorithm for Continuous Queries over Streams 545
A Simple But Effective Event-Driven Model for Data Stream Queries 557
Efficient Difference NN Queries for Moving Objects 565
APCAS: An Approximate Approach to Adaptively Segment Time Series Stream 577
Continuous k-Nearest Neighbor Search Under Mobile Environment 589
Record Extraction Based on User Feedback and Document Selection 597
Density Analysis of Winnowing on Non-uniform Distributions 609
Error-Based Collaborative Filtering Algorithm for Top-N Recommendation 617
A PLSA-Based Approach for Building User Profile and Implementing Personalized Recommendation 629
CoXML: A Cooperative XML Query Answering System 637
Concept-Based Query Transformation Based on Semantic Centrality in Semantic Peer-to-Peer Environment 645
Mining Infrequently-Accessed File Correlations in Distributed File System 653
Learning-Based Trust Model for Optimization of Selecting Web Services 665
SeCED-FS: A New Approach for the Classification and Discovery of Significant Regions in Medical Images 673
Context-Aware Search Inside e-Learning Materials Using Textbook Ontologies 681
Activate Interaction Relationships Between Students Acceptance Behavior and E-Learning 693
Semantic-Based Grouping of Search Engine Results Using WordNet 701
Static Verification of Access Control Model for AXML Documents 710
SAM: An EÆcient Algorithm for F& B-Index Construction
BUXMiner: An Efficient Bottom-Up Approach to Mining XML Query Patterns 732
A Web Service Architecture for Bidirectional XML Updating 744
(a, k)-anonymity Based Privacy Preservation by Lossy Join 756
Achieving k-Anonymity Via a Density-Based Clustering Method 768
k-Anonymization Without Q-S Associations 776
Protecting and Recovering Database Systems Continuously 788
Towards Web Services Composition Based on the Mining and Reasoning of Their Causal Relationships 800
A Dynamically Adjustable Rule Engine for Agile Business Computing Environments 808
A Formal Design of Web Community Interactivity 820
Towards a Type-2 Fuzzy Description Logic for Semantic Search Engine 828
A Type-Based Analysis for Verifying Web Application 836
Homomorphism Resolving of XPath Trees Based on Automata 844
An Efficient Overlay Multicast Routing Algorithm for Real-Time Multimedia Applications 852
Novel NonGaussianity Measure Based BSS Algorithm for Dependent Signals 860
HiBO: Mining Web’s Favorites 868
Frequent Variable Sets Based Clustering for Artificial Neural Networks Particle Classification 880
Attributes Reduction Based on GA-CFS Method 891
Towards High Performance and High Availability Clusters of Archived Stream 899
Continuously Matching Episode Rules for Predicting Future Events over Event Streams 907
Author Index 915

Process Aware Information Systems: A Human Centered Perspective (p. 60)1 Introduction
A Process Aware Information System (PAIS) is a software system that manages and executes operational processes involving people, applications, and/or information sources on the basis of an explicit imbedded process model. The model is typically instantiated many times, and every instance is typically handled in a predefined way. Thus this definition shows that a typical text editor is not process aware, and likewise a typical e-mail client is not process aware.

In both of these examples, the software is performing a task, but is not aware that the task is part of a process. Note that the explicit representation of process allows automated enactment, automated verification, and automated redesign, all of which can lead to increased organizational efficiency. Other potential benefits of PAIS are elaborated in [1].

An increasingly large population of diverse humans is interacting with technology these days, it is therefore increasingly important for computerized systems to address issues of human interaction / collaboration. The incorporation of process into information systems is particularly challenging because most PAIS involve processes performed by people. People processes are complex, semi-structured, and dynamically changing. Within PAIS design, it is thus necessary to take into account factors that impinge upon the organizational structures, the social context, the cultural setting, and other dimensions.

This paper first introduces examples and concepts of collective endeavors noting characteristics that can be quite challenging to capture within process descriptions. In the following sections, a framework for analysis, enactment, and mining is described, then a multidimensional meta-model is introduced. The paper ends with summary and conclusions.

2 Collective PAIS Environments

This section discusses issues related to collective endeavors in a broad sense. It introduces the complexity and variability of collective group interactions through examples, and discusses how structure can be identified in these interactions. It remains true that "how people work is one of the best kept secrets" (David Wellman, cited by Suchman [18]). Collective work is characterized by its fluidity and complex weaving of organizational, social, political, cultural and emotional aspects. Interaction at work takes a wide variety of forms. Consider for instance the following examples:

Extreme Collaboration. Mark[12] describes a "war room" environment employed by the NASA’s Jet Propulsion Laboratory (JPL) to develop complex space mission designs in a very short time—nine hours over a single week for a complete and detailed mission plan. During these interaction sessions, sixteen specialists are physically co-located in a room that contains a network of workstations and public displays.

Collaboration is prompted by a complex combination of physical awareness, by monitoring of the parallel conversations in the noisy environment and in response to data that is published through customized networked spreadsheets that allow team members to publish data they produce and subscribe to data published by others. Team members move around the room to consult other specialists, or .ock to the public display to discuss problems of their interest.