AI 2011: Advances in Artificial Intelligence

Name: AI 2011: Advances in Artificial Intelligence | 24th Australasian Joint Conference, Perth, Australia, December 5-8, 2011, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

24th Australasian Joint Conference, Perth, Australia, December 5-8, 2011, Proceedings

Dianhui Wang Mark Reynolds(Herausgeber*in)

Springer (Verlag)

Erschienen am 3. Dezember 2011

XVII, 821 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-25832-9 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Title page
Preface
Organization
Table of Contents
Session 1: Data Mining and Knowledge Discovery
Guided Rule Discovery in XCS for High-Dimensional Classification Problems
Introduction
Background
XCS Overview
Related Work
Model
Experiments
Data Sets
Parameters
Results
Conclusions
References
Motif-Based Method for Initialization the K-Means Clustering for Time Series Data
Introduction
Background
Dimensionality Reduction
Clustering for Time Series Data
locations are often termed the seeds for the k-Means algorithm.2.3 Time Series Motifs and the Brute-Force Algorithm for Finding Motifs
The Proposed Clustering Method for Time Series Data
How to Speed Up the Brute-Force Algorithm for Finding 1-Motifs
How to Derive Initial Centers from Results of K-Means Clustering on 1-Motifs
Experimental Evaluation
Conclusions
References
Semi-Supervised Classification Using Tree-Based Self-Organizing Maps
Introduction
The Tree-Based Topology Oriented SOM
The TTOSOM-Based Classifier
Experimental Setup
Results
Conclusions
References
The Discovery and Use of Ordinal Information on Attribute Values in Classifier Learning
Introduction
Value of Ordinal Information
Testing
Results
Discovering Orders
Developing Methods
Testing Order Discovery
Random Orders for Ensemble Classifiers
Conclusions and Further Work
References
Beyond Trees: Adopting MITI to Learn Rules and Ensemble Classifiers for Multi-Instance Data
Introduction
The MITI Algorithm
Experimental Results
MIRI: Using MITI to Learn Rule Sets
Experimental Results
Building Ensemble Classifiers
Experimental Results
Conclusions
References
Automatically Measuring the Quality of User Generated Content in Forums
Introduction
Problem Definition
UGCQ Assessment Model
Experiment
Datasets
Feature Selection
Performance Evaluation
Post Quality Classification
Results
Friedman Test
Nemenyi Test
Discussion
Related Work
Conclusion
References
Genetically Enhanced Feature Selection of Discriminative Planetary Crater Image Features
Introduction
Related Work
Genetically Enhanced Feature Selection
Genetic Representation
Wrapped Classifier Fitness Function
Random Crossover
Mutation
Highest Fitness (Greedy) Selection
Weighted Random Selection
Weighted Random Selection with Simulated Annealing
Complexity
Experimental Results
Conclusion
References
Penalized Least Squares for Smoothing Financial Time Series
Introduction
Current Methods
Our Proposed Method
Experiment Description
Data
Smoothness (Noise) Function
Lag Function
Cross Validation
Results
Conclusions
References
Logistic Regression with the Nonnegative Garrote
Introduction
Nonnegative Garrote
Simulation
Simulated Data
Path Consistency
Initial Estimates for the NNG
Real Data
Discussion and Recommendations
References
Identification of Breast Cancer Subtypes Using Multiple Gene Expression Microarray Datasets
Introduction
The Consensus Clustering Problem
Objective Function
The Genetic Algorithm
The Breast Cancer Datasets
Results
Comparison with Existing Subtypes
Conclusion
References
Combining Instantaneous and Time-Delayed Interactions between Genes - A Two Phase Algorithm Based on Information Theory
Introduction
Background
Bayesian Network (BN)
Dynamic Bayesian Network (DBN)
Information Theoretic Quantities
The Method
The Framework for Representation
Finding the Appropriate Search Strategy
Finding the Intra-slice Arc Directions
Simulation and Results
Synthetic Network
Real-Life Biological Data
Conclusion
References
A Sparse-Grid-Based Out-of-Sample Extension for Dimensionality Reduction and Clustering with Laplacian Eigenmaps
Introduction
Laplacian Eigenmaps and Spectral Clustering
Sparse Grids
Sparse-Grid-Based Out-of-Sample Extension
Experiments
Conclusion
References
Distribution Based Data Filtering for Financial Time Series Forecasting
Introduction
Related Work
Distribution Based Samples Removing Algorithm
Distance Value - Threshold Based Decision
Distance Value - Percentage Based Decision
Datasets
Experiments
Conclusion
References
Sequential Feature Selection for Classification
Introduction
Framework
General Idea
Sequential Classification
Action Selection without Replacement
Solving the POMDP
Experiments and Discussion
Handwritten MNIST Digit Classification
Diabetes Dataset with Naive Bayes Classification
Discussion
Conclusion
References
Long-Tail Recommendation Based on Reflective Indexing
Introduction
Novelty as an Important Value of Long-Tail Recommendations
Methodological Assumptions
Contribution of the Paper
Algebraic Model for PRI
Modeling User-Item Dependencies as a Probability Space
Reflective Data Processing
The PRI Algorithm
Evaluation
Data Sets
Recommendation Quality Evaluation
Conclusions
References
Author Name Disambiguation for Ranking and Clustering PubMed Data Using NetClus
Introduction
Related Work
The Challenges of Author Name Disambiguation on PubMed
Related Work on Disambiguation of PubMed Authors
A Multi-evidence Author Disambiguation System
Disambiguation Using Organisation Names and Addresses
Disambiguation Using Co-author Network
Evaluation of the Disambiguation Technique
Accuracy of the Proposed Disambiguation Technique
Evaluation of NetClus Results
Conclusion and Future Work
References
Self-Organizing Maps for Translating Health Care Knowledge: A Case Study in Diabetes Management
Introduction
Background: Mining Diabetic Patient Data
Application
Chronic Disease Management (CDM)
Chronic Disease Management Network (cdmNet)
Chronic Disease Management Network - Business Intelligence (cdmNet-BI) Module
The Self-Organizing Map (SOM)
The Growing Self-Organizing Map (GSOM)
Patterns in Diabetes Management
Analysis of Features Common to Any Individual
Analysis of Common Features with Diabetes Specific Medical Features
Patterns Recognised from Diabetes Data: Outcomes
Conclusions and Future Work
References
Distance-Based Feature Selection on Classification of Uncertain Objects
Introduction
Related Work
Problem Definition
UK-Means
Supervised UK-Means
Algorithms
Averaging Approach
Distribution-Based Approach
Experimental Results
Data Sets
Performance Evaluation
Conclusion
References
Session 2: Machine Learning
Closure Spaces of Isotone Galois Connections and Their Morphisms
Introduction
Preliminaries: Matrices, Decompositions, Concept Lattices
Closure Spaces Induced by (^,V)
Morphisms of c-Closure Spaces
Isomorphic c-Closure Spaces
Conclusions
References
Ensemble Learning and Pruning in Multi-Objective Genetic Programming for Classification with Unbalanced Data
Introduction
Related Work: Ensemble Learning for Class Imbalance
Multi-Objective GP (MOGP) for Evolving Ensembles
GP Framework for Classification
MOGP Fitness
MOGP Search
MOGP Ensemble Performance
Evolutionary Parameters and Unbalanced Data Sets
MOGP Ensemble Results
Ensemble Pruning
Fitness-Based Pruning
GP for Evolving Composite Voting Trees
Performance of Ensembles Using Puning Methods
Conclusions
References
Compiling Bayesian Networks for Parameter Learning Based on Shared BDDs
Introduction
Preliminary
Bayesian Networks
Parameter Learning Problem for BNs
Proposed Method
Encoding and Compiling
Learning
Experiments
Conclusion and Related Work
References
An Empirical Study of Bagging Predictors for Imbalanced Data with Different Levels of Class Distribution
Introduction
Designed Framework
Evaluation Metrics
Experimental Setting
Selection of Base Learners
Data-Sets
Experimental Results Analysis
Statistical Test
Comparison between Bagging and Single Learners
Comparison between Bagging Predictors
Conclusion
References
A Simple Bayesian Algorithm for Feature Ranking in High Dimensional Regression Problems
Introduction
Bayesian Feature Ranking (BFR) Algorithm
Discussion and Results
Simulated Data
Real Data
Conclusion
References
Semi-random Model Tree Ensembles: An Effective and Scalable Regression Method
Introduction
Random Model Trees
Experiments
Linear Regression
Gaussian Process Regression
Additive Groves
Random Model Trees
Results
Relative Mean Absolute Error
Conclusions
References
Supervised Subspace Learning with Multi-class Lagrangian SVM on the Grassmann Manifold
Introduction
Proposed Method
Multi-class Lagrangian SVM
Learning the Projection
Experiments
Conclusion
References
Bagging Ensemble Selection
Introduction
Bagging Ensemble Selection
Experimental Results
Comparison of Bagging Ensemble Selection Algorithms to the Forward Ensemble Selection Algorithms
Comparison of Bagging Ensemble Selection Algorithms to Other Ensemble Learning Algorithms
Conclusions
References
Augmented Spatial Pooling
Introduction
Spatial Pooling
Modifications
Experimental Evaluation and Discussion
Conclusions
References
Session 3: Evolutionary Computation and Optimization
An Analysis of Sub-swarms in Multi-swarm Systems
Introduction
Multi-swarm Systems
Experimental Design
Effects of Initial Velocities
Effects of Smaller Constriction Factors
Effects of Swarm Size
Recommended Parameters
Discussion
Summary
References
A Simple Strategy to Maintain Diversity and Reduce Crowding in Particle Swarm Optimization
Introduction
Background
Particle Swarm Optimization
A New Update Strategy for PSO
Results on Multi-modal Functions
Results on Other Functions
Discussion
Summary
References
Weighted Preferences in Evolutionary Multi-objective Optimization
Introduction
Preliminaries
Algorithms
Weighted NSGA-II
Weighted SPEA2
Experimental Results
Conclusions
References
Genetic Programming for Edge Detection Based on Accuracy of Each Training Image
Introduction
Background
Edge Detection
Related Work to Genetic Programming for Edge Detection
The New Approach
Main Idea
Sets of Terminals and Primitive Functions
Fitness Function
Experimental Design
Experimental Results and Discussion
Conclusions
References
Improving Robustness of Multiple-Objective Genetic Programming for Object Detection
Introduction
Background
Validation and Sampling Methods
Experimental Design
Experimental Results
Conclusions
References
DE/isolated/1: A New Mutation Operator for Multimodal Optimization with Differential Evolution
Introduction
Differential Evolution
Initialization
Mutation
Crossover
Selection
Proposed Method: DE/isolated/1
Isolated Vector-Based Mutation
Immediate Update of the Population
Escape from Local Optima
Experiments
Benchmark Functions
Performance Measure
Parameter Setup
Results
Conclusion
References
The Effects of Diversity Maintenance on Coevolution for an Intransitive Numbers Problem
Introduction
Coevolutionary Algorithms
Hall of Fame
Diversity
Quality
Experiments
Algorithms Tested
Results and Analysis
Conclusion
References
Eliminating Useless Object Detectors Evolved in Multiple-Objective Genetic Programming
Introduction
Background
Improvements to the MOGP Approach
Experimental Design and Results
Conclusions
References
Asymmetric Pareto-adaptive Scheme for Multiobjective Optimization
Introduction
apa: Asymmetric Pareto-adaptive
apa for 2-Dimensional Pareto Front
Curve Function for Asymmetric Pareto Front
apa for Decomposition and -Dominance
apa: apa for Decomposition
apa-Dominance: apa for -Dominance
Experimental Results and Discussion
Benchmark Problems and Experimental Setting
Discussions on Statistical Results
Conclusion and Future Research
References
Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function
Introduction
Royal Roads Function
Past Work
Analyzed Algorithm:(µ + ?)EA1BS
Model Setup and Assumptions
Improvement Process
Population and Elitism Assumptions
Derivation of the Expectation of Convergence Time
Exact Expression
Approximate and Asymptotic Expressions
Conclusions and Future Work
References
Simplex Model Based Evolutionary Algorithm for Dynamic Multi-Objective Optimization
Introduction
Background
Problem Definition
Performance Criteria
Previous Work
A New Simplex Model Based Evolutionary Algorithm for DMOPs
A Modified Simplex Model for Prediction
PSO Based Evolutionary Algorithm for DMOPs
Experiment Design
Test Functions
Parameter Settings
Simulation Results
Overall Results
Evolved Pareto Fronts
Conclusions and Future Work
References
Color Quantization Using Modified Artificial Fish Swarm Algorithm
Introduction
Artificial Fish Swarm Algorithm
Proposed Algorithm
Prey Behavior
Follow Behavior
Modified AFSA Procedure
MAFSA Configuration for CQ
Experiments
Conclusion
References
Session 4: Intelligent Agent Systems
Coordinated Learning for Loosely Coupled Agents with Sparse Interactions
Introduction
Learning to Coordinate
Problem Description and Definitions
Learning the Coordinated States
Learning for Coordination
Experiment
Experimental Setting
Results and Analysis
Related Work
Conclusion and Future Work
References
TATM: A Trust Mechanism for Social Traders in Double Auctions
Introduction
Related Work: Trust and Reputation Mechanisms
The Trading Agent Trust Model
Returning Updating Policy
Action-Choosing and Decision-Making Policies
Experimental Setup
Traders
Experiment Variables and Parameters
Results
Discussion and Conclusions
References
Sequential Single-Cluster Auctions for Robot Task Allocation
Introduction
Multi-robot Task-Allocation
Sequential Auctions with Clusters
Properties
Experiment Setup
Results
Conclusions and Further Work
References
Correlation between Genetic Diversity and Fitness in a Predator-Prey Ecosystem Simulation
Introduction
The Model
Entropy as a Measure of Genetic Diversity
Measuring Correlation between Entropy and Fitness
Building Classifier for Inference
Conclusion
References
Is Revision a Special Kind of Update?
Introduction
Need for Selection Mechanisms
Global Selection Mechanisms and Belief Revision
Local Selection Mechanisms and Belief Update
Distance Function as a Selection Mechanism
Belief Revision as a Special Type of Belief Update
Concluding Remarks
References
A Parallel, Multi-issue Negotiation Model in Dynamic E-Markets
Introduction
E-Market and Negotiation Issue
E-Market Change and Agent's Response
Issue's Significance and Relationship
Offer Evaluation
Counter-Offer Generation
Experiment
Experimental Settings
Experimental Results
Related Work
Conclusion and Future Work
References
Parallel Monte Carlo Tree Search Scalability Discussion
Introduction
MCTS Algorithm Overview
MCTS Iteration Steps
Parallelization of Monte-Carlo Tree Search
Some of the Existing Parallel Approaches
Methodology
MPI Usage
Reversi
Samegame
Results and Analysis
CPU MPI Implementation
Multi GPU Implementation
Scalability Analysis
Random Sampling with Replacement
Conclusions
References
How Questions Guide Choices: A Preliminary Logical Investigation
How Questions Guide Choices
A Simple Logic of Rational Choice
Ceteris Paribus Preference Logic: The Atomic Case
Adding Questions as Dynamic Operators
Closing Remarks
References
Session 5: Logic and Reasoning
A Defeasible Logic for Clauses
Introduction
Overview of Clausal Defeasible Logic (CDL)
Clausal Defeasible Logic (CDL)
Example
Results
Summary
References
Applying Multiple Classification Ripple Round Rules to a Complex Configuration Task
Introduction and Previous Work
Ripple Down Rules
Using Classifications as Conditions
Method
Knowledge Representation
Inference
Knowledge Acquisition
Task
Results and Discussion
Nature of the Knowledge Base
Time Taken
Cycles
Conclusions and Further Work
References
Semantic Foundation for Preferential Description Logics
Introduction
Description Logics
Propositional Preferential and Rational Consequence
Semantics for DL Preferential Subsumption
Rational Closure
Related Work
Conclusion and Future Work
References
From Approximate Clausal Reasoning to Problem Hardness
Introduction
Background
S-3 Logics
Logics of Limited Bivalence
DPLL and Restricted Branching
Problem Hardness and Strong Backdoors
Clausal LB() Reasoning
LB($S*$) Semantics
Clausal Tableau
Characterising RDPLL
Approximate Logics to Problem Hardness
Summary and Future Research
References
A Logic for Knowledge Flow in Social Networks
Introduction
Preliminaries
Social Network Logic
Theoretical Results
Conclusion
References
Session 6: Vision and Graphics
Object Detection by Admissible Region Search
Introduction
Overview of Admissible Region Search
Admissible Region Search on Matrices
Object Detection by Admissible Region Search
Experimental Results
A Toy Data
PASCAL VOC 2006
Conclusion and Discussion
References
Structured Light-Based Shape Measurement System of Human Body
Introduction
System Overview
Proposed Approach
Calibration
Stripe Detection
Outlier Detection
Adaptively Iteration of Belief Propagation
Experiment Results
Conclusions
References
Fast Sub-window Search with Square Shape
Introduction
Efficient Sub-window Search (ESS) Algorithms
ESS
?2-ESS (Chi-Square ESS)
A-ESS (Alternating ESS)
Proposed Algorithms
Square ESS
Square ?2-ESS
Combination Square ESS and A-ESS
Experiments
Square ESS
Square ?2-ESS
Combination Square ESS and A-ESS
Conclusions
References
Binocular Structured Light Stereo Matching Approach for Dense Facial Disparity Map
Introduction
Problem Formulation and Previous Work
Binocular Structured Light Approach for Facial Disparity Map
Selection of Stereo Matching Algorithm
Simulated Experimental Results
Conclusion and Future Work
References
Fast Object Detection with Foveated Imaging and Virtual Saccades on Resource Limited Robots
Introduction
Saliency Scan
Field Edge Detection Using the Saliency Scan
Multi-modal Object Analysis in Foveated Regions
Ball Detection
Goal Post Detection
Performance in RoboCup
Related Work
Conclusion
References
Fast Multi-view Graph Kernels for Object Classification
Introduction
Inter- and Intra- view Linkage Graphs
Segmenting Each View Image
Constructing Inter- and Intra- view Linkage Graphs
Multi-view Region Graphs
Fast Multi View Graph Kernel
Direct Walk Kernels
Multi-view Region Product Graph
Analysis of Computational Complexity
Experimental Results and Analysis
Classifying Multi View Images on ETH-80
Discussions the Time Consumption
Conclusions
References
Session 7: Image Processing
Image Feature Selection Based on Ant Colony Optimization
Introduction
The ACO Algorithm for Image Feature Selection
Implementation of the Algorithm
Pheromone Updating
The Fitness Function
Experimental Results
Conclusions
References
Realistic Smile Expression Recognition Using Biologically Inspired Features
Introduction
Biologically Inspired Model
Modified BIM for Smile Classification
A More Effective Pooling Operation Method
Feature Selection by AdaBoost
Other Strategies
Classification System Using Boosted MBIF
Experiments and Results
GENKI Datasets
Performance Comparison of MBIM against BIM
Performance of MBIF against BIF, Gabor Feature and PHOG Feature
Performance When Extracting Patches from Specified Area
Performance of Clustering Patches
Conclusion
References
Learning Colours from Textures by Sparse Manifold Embedding
Introduction
Related Works
Colourising Images by Sparse Manifold Embedding
Problem Formulation
Manifold of Patches
Estimating the Colours with Sparsity Constraints
Experiment
Representing Patches in Feature Vectors
Experiment Results
Conclusion
References
Investigating Particle Swarm Optimisation Topologies for Edge Detection in Noisy Images
Introduction
Background
Particle Swarm Optimisation
Neighbourhood Topologies
PSO-Based Edge Detection Algorithm
Experiment Design
Results
Conclusions
References
Adaptive Binarization Method for Enhancing Ancient Malay Manuscript Images
Introduction
State of the Art
The Proposed Method
The Experimen tal Results and Discussion
Conclusion
References
Session 8: Natural Language Processing
A New Approach to Use Concepts Definitions for Semantic Relatedness Measurement
Introduction
Related Work
Proposed Method
Definition-Based Relations
Semantic Relatedness Measurement
Evaluation
Extraction of the Relations
Evaluation Method and Results
Discussion
Conclusion and Future Work
References
Using a Lexical Dictionary and a Folksonomy to Automatically Construct Domain Ontologies
Introduction
Building Domain-Specific MKBs
Evaluation
Conclusions and Future Work
References
Generality Evaluation of Automatically Generated Knowledge for the Japanese ConceptNet
Introduction
Related Work
Commonsense Knowledge Generation
Definition
System Overview
Japanese WordNet
Retrieving Sister Terms and Generating Sentences
Noise Elimination Methods
Co-occurrences in Snippets (a)
Exact Match Ratio (b)
Conjugated Keywords Hit Ratio
Preliminary Experiments for Setting Noise Elimination Thresholds
Evaluation Experiment and Its Results
Conclusions and Future Work
References
Processing Coordinated Structures in PENG Light
Introduction
PENG Light
The Language Processor
Discourse Representation Structures (DRSs)
Building Basic and Complex DRSs
Building DRSs for Coordinated Structures
Evaluation
Conclusions
References
A Malay Stemmer for Jawi Characters
Introduction
Related Works
Malay Affixes
The Jawi Stemmer
The Algorithm for the Malay Stemmer for Jawi Characters
Experimental and the Results
Conclusion
References
Session 9: Cognitive Modeling and Simulation Technology
Executability in the Situation Calculus
Introduction
Background
DFA-Literal-Based BAT Equivalence
Lattice DFA-Context-Free BAT Equivalence
Conclusion
References
Birdsong Acquisition Model by Sexual Selection Focused on Habitat Density
Introduction
Conventional Model
Sasahara and Ikegami's Model
Ritchie and Kirby's Model
Composition of Computational Model
Agent
Song Set
Song Pool
Habitat Density
The Life Cycle of an Agent
Agent in Childhood
Male Agent in Adulthood
Female Agent in Adulthood
Simulation and Discussion
Results
Comparison to the Greenish Warbler
Conclusion
References
Speeding Up Bipartite Graph Visualization Method
Introduction
Problem Framework
Proposed Method
Proposed Algorithm
Convergence Proof
Evaluation by Experiments
Network Data
Brief Description of Other Visualization Methods Used for Comparison
Experimental Results
Conclusion
References
Enhancement of Learning Experience Using Skill-Challenge Balancing Approach
Introduction
Learning Experience and Flow Theory
Skill-Challenge Balancing Approach
Evaluation of Skill-Challenge Balancing Approach
Method
Results and Discussions
Conclusion and Future Works
References
A Divide-and-Conquer Tabu Search Approach for Online Test Paper Generation
Introduction
Related Work
Problem Specification
Proposed Approach
R-Tree Index Construction
Content Constraint Satisfaction
Assessment Constraint Optimization
Tabu Search
Performance Evaluation
Conclusion
References
On the Interactions of Awareness and Certainty
Introduction
The Logics of Dynamic Knowledge and Awareness
Language
Implicit Knowledge
Strong Implicit Knowledge
Latent Knowledge
Tacit Knowledge
Comparative Analysis of Latent, Tacit and Strong Implicit Knowledge
Related Approaches
Conclusion and Future Work
References
On the Implementation of a Theory of Perceptual Mapping
Introduction
A Theory of Perceptual Mapping
Implementations and Results
Algorithm #1
Algorithm #2
Discussions
Conclusion
References
Session 10: AI Applications
Robotic Communications and Surveillance - The DARPA LANdroids Program
Introduction
The Challenging Urban RF Environment
The LANdroids System Concept
Landroids Software and Hardware
LANdroids Software Capabilities and Development Efforts
LANdroids Hardware Requirements and Prototype Platforms
LANdroids Testing
Phase I Formal Evaluation
Phase II Formal Evaluation
Phase II Field Demonstration
Conclusions: Issues and Next Steps
References
Data Extraction for Search Engine Using Safe Matching
Introduction
Related Work
SafeMatch Wrapper
Overview of SafeMatch
SafeMatch Extraction Module
Experimental Tests
Conclusions
References
Automatic Static Feature Generation for Compiler Optimization Problems
Introduction
Related Work
Our Approach
Frequency Thresholding
Information Gain(IG)
2 Statistics (CHI)
Experimental Setup
Compiler
Flags
Plateforms
Benchmarks
Experiments
Experimental Results
Conclusion and Future Work
References
Multi-objective Optimisation of Power Restoration in Electricity Distribution Systems
Introduction
The Network Reconfiguration Problem
Multi-objective Approach
Genetic Algorithm Approach
Pseudocode
Objective Function and Pareto's Dominance
Representation and Initialization
Recombination - Selection, Crossover and Mutation
Acceptance Policy
Computational Results
Conclusion
References
Reasoning over OWL/SWRL Ontologies under CWA and UNA for Industrial Applications
Introduction
Technical Details
Concept Framework
Building Rule Base
Reasoning Algorithm
Handling Special Rules and Atoms
Experiments
Conclusion
References
Tracking the Preferences of Users Using Weak Estimators
Introduction
State of the Art
SLWE-Based Solution to Adaptation to User's Interests Drift
Profile Representation
Profile Updating Method
Experimental Results
Conclusions
References
Dynamic Auction for Efficient Competitive Equilibrium under Price Rigidities
Introduction
The Market Model
Dynamic Auction Procedure under Price Rigidities
Calculation and Comparison
Conclusion and Related Work
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken