close
1.

図書

図書
Rémi Bastide, Philippe Palanque, Jörg Roth (eds.)
出版情報: Berlin ; Tokyo : Springer, c2005  xii, 400 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3425
所蔵情報: loading…
2.

図書

図書
Uffe Kock Wiil (ed.)
出版情報: Berlin ; Heidelberg : Springer, c2005  viii, 219 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3511
所蔵情報: loading…
3.

図書

図書
Claire J. Tomlin, Mark R. Greenstreet (eds.)
出版情報: Berlin : Springer, c2002  xiii, 480 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2289
所蔵情報: loading…
4.

図書

図書
Sergio Rajsbaum (ed.)
出版情報: Berlin : Springer, c2002  xiii, 630 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2286
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks and Tutorials
Phase Transitions in Computer Science / Jennifer Chayes
The Internet, the Web, and Algorithms / Christos H. Papadimitriou
Erd&odacute;s Magic / Joel Spencer
Open Problems in Computational Geometry / Jorge Urrutia
Quantum Algorithms / Umesh Vazirani
Testing and Checking of Finite State Systems / Mihalis Yannakakis
From Algorithms to Cryptography / Fabrizio Luccio ; Linda Pagli
Dihomotopy as a Tool in State Space Analysis / Éric Goubault ; Martin Raussen
Regular Contributions
Algorithms for Local Alignment with Length Constraints / Abdullah N. Arslan ; Ömer Eğecioğlu
An Algorithm That Builds a Set of Strings Given Its Overlap Graph / Marília D.V. Braga ; João Meidanis
Conversion between Two Multiplicatively Dependent Linear Numeration Systems / Christiane Frougny
Star Height of Reversible Languages and Universal Automata / Sylvain Lombardy ; Jacques Sakarovitch
Weakly Iterated Block Products of Finite Monoids / Howard Straubing ; Denis Thérien
The Hidden Number Problem in Extension Fields and Its Applications / María Isabel González Vasco ; Mats Näslund ; Igor E. Shparlinski
The Generalized Weil Pairing and the Discrete Logarithm Problem on Elliptic Curves / Theodoulos Garefalakis
Random Partitions with Non Negative rth Differences / Rod Canfield ; Sylvie Corteel ; Pawel Hitczenko
Beta-Expansions for Cubic Pisot Numbers / Frédérique Bassino
Facility Location Constrained to a Polygonal Domain / Prosenjit Bose ; Qingda Wang
A Deterministic Polynomial Time Algorithm for Heilbronn's Problem in Dimension Three / Hanno Lefmann ; Niels Schmitt
A Metric Index for Approximate String Matching / Edgar Chávez ; Gonzalo Navarro
On Maximal Suffices and Constant-Space Linear-Time Versions of KMP Algorithm / Wojciech Rytter
On the Power of BFS to Determine a Graphs Diameter / Derek G. Corneil ; Feodor F. Dragan ; Ekkehard Köhler
k-pseudosnakes in Large Grids / Martín Matamala ; Erich Prisner ; Ivan Rapaport
L(2, 1)-Coloring Matrogenic Graphs / Tiziana Calamoneri ; Rossella Petreschi
Pipeline Transportation of Petroleum Products with No Due Dates / Ruy Luiz Milidiú ; Artur Alves Pessoa ; Eduardo Sany Laber
Ancestor Problems on Pure Pointer Machines / Enrico Pontelli ; Desh Ranjan
Searching in Random Partially Ordered Sets / Renato Carmo ; Jair Donadelli ; Yoshiharu Kohayakawa ; Eduardo Laber
Packing Arrays / Brett Stevens ; Eric Mendelsohn
Generalized Shannon Code Minimizes the Maximal Redundancy / Michael Drmota ; Wojciech Szpankowski
An Improved Algorithm for Sequence Comparison with Block Reversals / S. Muthukrishnan ; S. Cenk &Sbdot;ahinalp
Pattern Matching and Membership for Hierarchical Message Sequence Charts / Blaise Genest ; Anca Muscholl
Improved Exact Algorithms for Max-Sat / Jianer Chen ; Iyad A. Kanj
Characterising Strong Normalisation for Explicit Substitutions / Steffen van Bakel ; Mariangiola Dezani-Ciancaglini
Parameters in Pure Type Systems / Roel Bloo ; Fairouz Kamareddine ; Twan Laan ; Rob Nederpelt
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications / Rūsiņš Freivalds ; Carl H. Smith
Verification of Embedded Reactive Fiffo Systems / Frédéric Herbreteau ; Franck Cassez ; Alain Finkel ; Olivier Roux ; Grégoire Sutre
Electronic Jury Voting Protocols / Alejandro Hevia ; Marcos Kiwi
Square Roots Modulo p / Gonzalo Tornaría
Finding Most Sustainable Paths in Networks with Time-Dependent Edge Reliabilities / Goran Konjevod ; Soohyun Oh ; Andréa W. Richa
Signals for Cellular Automata in Dimension 2 or Higher / Jean-Christophe Dubacq ; Véronique Terrier
Holographic Trees / Paolo Boldi ; Sebastiano Vigna
On the Spanning Ratio of Gabriel Graphs and β-skeletons / Luc Devroye ; William Evans ; David Kirkpatrick
In-Place Planar Convex Hull Algorithms / Hervé Brönnimann ; John Iacono ; Jyrki Katajainen ; Pat Morin ; Jason Morrison ; Godfried Toussaint
The Level Ancestor Problem Simplified / Michael A. Bender ; Martín Farach-Colton
Flow Metrics / Claudson F. Bornstein ; Santosh Vempala
On Logical Descriptions of Regular Languages
Computing Boolean Functions from Multiple Faulty Copies of Input Bits / Mario Szegedy ; Xiaomin Chen
Inapproximability Results on Stable Marriage Problems / Magnús Halldórsson ; Kazuo Iwama ; Shuichi Miyazaki ; Yasufumi Morita
Tight Bounds for Online Class-Constrained Packing / Hadas Shachnai ; Tami Tamir
On-line Algorithms for Edge-Disjoint Paths in Trees of Rings / R. Sai Anand ; Thomas Erlebach
Massive Quasi-Clique Detection / James Abello ; Mauricio G.C. Resende ; Sandra Sudarsky
Improved Tree Decomposition Based Algorithms for Domination-like Problems / Jochen Alber ; Rolf Niedermeier
Author Index
Invited Talks and Tutorials
Phase Transitions in Computer Science / Jennifer Chayes
The Internet, the Web, and Algorithms / Christos H. Papadimitriou
5.

図書

図書
Hartmut Schmeck, Theo Ungerer, Lars Wolf (eds.)
出版情報: Berlin : Springer, c2002  xiv, 286 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2299
所蔵情報: loading…
目次情報: 続きを見る
Invited Program
Keynote Communicating Cars: A Case for Ubiquitous Computing in the Automotive Domain / Ralf Guido Herrtwich
Keynote Microprocessor Architectures for the Mobile Internet Era / Marc Fleischmann
Context-Aware Systems / I:
An Architecture for the Integration of Physical and Informational Spaces / Scott M. Thayer ; Peter Steenkiste
A Context System for a Mobile Service Platform / Fritz Hohl ; Lars Mehrmann ; Amen Hamdan
Detecting Context in Distributed Sensor Networks by Using Smart Context-Aware Packets / Florian Michahelles ; Michael Samulowitz ; Bernt Schiele
System Aspects / II:
A Ubiquitous Control Architecture for Low Power Systems / James ôWezö Weatherall ; Duncan Grisby
Software Architecture-Based Adaptation for Pervasive Systems / Shang-Wen Cheng ; David Garlan ; Bradley Schmerl ; Joao Pedro Sousa ; Bridget Spitznagel ; Ningning Hu
KECho - Event Communication for Distributed Kernel Services / Christian Poellabauer ; Karsten Schwan ; Greg Eisenhauer ; Jiantao Kong
Networking 1 / III:
A Fine-Grained Addressing Concept for GeoCast / Peter Coschurba ; Kurt Rothermel ; Frank Durr
Data Paths in Wearable Communication Networks / Christian Decker ; Michael Beigl
Location and Network Quality Issues in Local Area Wireless Networks / Georgi Tonev ; Vaidy Sunderam ; Roger Loader ; James Pascoe
Processor Architecture / IV:
Design Tradeoffs for Embedded Network Processors / Tilman Wolf ; Mark A. Franklin
Reconfigurable RISC - A New Approach for Space-Efficient Superscalar Microprocessor Architecture / Sascha Wennekers ; Christian Siemers
Cached Two-Level Adaptive Branch Predictors with Multiple Stages / Colin Egan ; Gordon Steven ; Lucian Vintan
Middleware and Verification / V:
On the Combination of Assertions and Virtual Prototyping for the Design of Safety-Critical Systems / Tim Oodes ; Holger Krisp ; Christian Muller-Schloer
Ubiquitous Access to Wide-Area High-Performance Computing / Frank Burchert ; Stephan Gatzka ; Christian Hochberger ; Chang-Kun Lee ; Ulrike Lucke ; Djamshid Tavangarian
Filter Similarities in Content-Based Publish/Subscribe Systems / Gero Muhl ; Ludger Fiege ; Alejandro Buchmann
Networking 2 / VI:
A Bluetooth Remote Control System / Fridtjof Feldbusch ; Alexander Paar ; Manuel Odendahl ; Ivan Ivanov
Rendezvous Layer Protocols for Bluetooth-Enabled Smart Devices / Frank Siegemund ; Michael Rohs
A Robust Header Compression Simulator & Visualizer / Xiaoyuan Gu ; Hannes Hartenstein ; Stefan Fischer
Author Index
Invited Program
Keynote Communicating Cars: A Case for Ubiquitous Computing in the Automotive Domain / Ralf Guido Herrtwich
Keynote Microprocessor Architectures for the Mobile Internet Era / Marc Fleischmann
6.

図書

図書
Tobias Nipkow, Lawrence C. Paulson, Markus Wenzel
出版情報: Berlin : Springer, c2002  xiii, 218 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2283
所蔵情報: loading…
目次情報: 続きを見る
Elementary Techniques / Part I:
The Basics / 1:
Introduction / 1.1:
Theories / 1.2:
Types, Terms, and Formulae / 1.3:
Variables / 1.4:
Interaction and Interfaces / 1.5:
Getting Started / 1.6:
Functional Programming in HOL / 2:
An Introductory Theory / 2.1:
An Introductory Proof / 2.2:
Some Helpful Commands / 2.3:
Datatypes / 2.4:
Lists / 2.4.1:
The General Format / 2.4.2:
Primitive Recursion / 2.4.3:
Case Expressions / 2.4.4:
Structural Induction and Case Distinction / 2.4.5:
Case Study: Boolean Expressions / 2.4.6:
Some Basic Types / 2.5:
Natural Numbers / 2.5.1:
Pairs / 2.5.2:
Datatype option / 2.5.3:
Definitions / 2.6:
Type Synonyms / 2.6.1:
Constant Definitions / 2.6.2:
The Definitional Approach / 2.7:
More Functional Programming / 3:
Simplification / 3.1:
What Is Simplification? / 3.1.1:
Simplification Rules / 3.1.2:
The simp Method / 3.1.3:
Adding and Deleting Simplification Rules / 3.1.4:
Assumptions / 3.1.5:
Rewriting with Definitions / 3.1.6:
Simplifying let-Expressions / 3.1.7:
Conditional Simplification Rules / 3.1.8:
Automatic Case Splits / 3.1.9:
Tracing / 3.1.10:
Induction Heuristics / 3.2:
Case Study: Compiling Expressions / 3.3:
Advanced Datatypes / 3.4:
Mutual Recursion / 3.4.1:
Nested Recursion / 3.4.2:
The Limits of Nested Recursion / 3.4.3:
Case Study: Tries / 3.4.4:
Total Recursive Functions / 3.5:
Defining Recursive Functions / 3.5.1:
Proving Termination / 3.5.2:
Simplification and Recursive Functions / 3.5.3:
Induction and Recursive Functions / 3.5.4:
Presenting Theories / 4:
Concrete Syntax / 4.1:
Infix Annotations / 4.1.1:
Mathematical Symbols / 4.1.2:
Prefix Annotations / 4.1.3:
Syntax Translations / 4.1.4:
Document Preparation / 4.2:
Isabelle Sessions / 4.2.1:
Structure Markup / 4.2.2:
Formal Comments and Antiquotations / 4.2.3:
Interpretation of Symbols / 4.2.4:
Suppressing Output / 4.2.5:
Logic and Sets / Part II:
The Rules of the Game / 5:
Natural Deduction / 5.1:
Introduction Rules / 5.2:
Elimination Rules / 5.3:
Destruction Rules: Some Examples / 5.4:
Implication / 5.5:
Negation / 5.6:
Interlude: The Basic Methods for Rules / 5.7:
Unification and Substitution / 5.8:
Substitution and the subst Method / 5.8.1:
Unification and Its Pitfalls / 5.8.2:
Quantifiers / 5.9:
The Universal Introduction Rule / 5.9.1:
The Universal Elimination Rule / 5.9.2:
The Existential Quantifier / 5.9.3:
Renaming an Assumption: rename_tac / 5.9.4:
Reusing an Assumption: frule / 5.9.5:
Instantiating a Quantifier Explicitly / 5.9.6:
Description Operators / 5.10:
Definite Descriptions / 5.10.1:
Indefinite Descriptions / 5.10.2:
Some Proofs That Fail / 5.11:
Proving Theorems Using the blast Method / 5.12:
Other Classical Reasoning Methods / 5.13:
Forward Proof: Transforming Theorems / 5.14:
Modifying a Theorem Using of and THEN / 5.14.1:
Modifying a Theorem Using OF / 5.14.2:
Forward Reasoning in a Backward Proof / 5.15:
The Method insert / 5.15.1:
The Method subgoal_tac / 5.15.2:
Managing Large Proofs / 5.16:
Tacticals, or Control Structures / 5.16.1:
Subgoal Numbering / 5.16.2:
Proving the Correctness of Euclid's Algorithm / 5.17:
Sets, Functions, and Relations / 6:
Sets / 6.1:
Finite Set Notation / 6.1.1:
Set Comprehension / 6.1.2:
Binding Operators / 6.1.3:
Finiteness and Cardinality / 6.1.4:
Functions / 6.2:
Function Basics / 6.2.1:
Injections, Surjections, Bijections / 6.2.2:
Function Image / 6.2.3:
Relations / 6.3:
Relation Basics / 6.3.1:
The Reflexive and Transitive Closure / 6.3.2:
A Sample Proof / 6.3.3:
Well-Founded Relations and Induction / 6.4:
Fixed Point Operators / 6.5:
Case Study: Verified Model Checking / 6.6:
Propositional Dynamic Logic - PDL / 6.6.1:
Computation Tree Logic - CTL / 6.6.2:
Inductively Defined Sets / 7:
The Set of Even Numbers / 7.1:
Making an Inductive Definition / 7.1.1:
Using Introduction Rules / 7.1.2:
Rule Induction / 7.1.3:
Generalization and Rule Induction / 7.1.4:
Rule Inversion / 7.1.5:
Mutually Inductive Definitions / 7.1.6:
The Reflexive Transitive Closure / 7.2:
Advanced Inductive Definitions / 7.3:
Universal Quantifiers in Introduction Rules / 7.3.1:
Alternative Definition Using a Monotone Function / 7.3.2:
A Proof of Equivalence / 7.3.3:
Another Example of Rule Inversion / 7.3.4:
Case Study: A Context Free Grammar / 7.4:
Advanced Material / Part III:
More about Types / 8:
Numbers / 8.1:
Numeric Literals / 8.1.1:
The Type of Natural Numbers, nat / 8.1.2:
The Type of Integers, int / 8.1.3:
The Type of Real Numbers, real / 8.1.4:
Pairs and Tuples / 8.2:
Pattern Matching with Tuples / 8.2.1:
Theorem Proving / 8.2.2:
Records / 8.3:
Record Basics / 8.3.1:
Extensible Records and Generic Operations / 8.3.2:
Record Equality / 8.3.3:
Extending and Truncating Records / 8.3.4:
Axiomatic Type Classes / 8.4:
Overloading / 8.4.1:
Axioms / 8.4.2:
Introducing New Types / 8.5:
Declaring New Types / 8.5.1:
Defining New Types / 8.5.2:
Advanced Simplification, Recursion, and Induction / 9:
Advanced Features / 9.1:
How the Simplifier Works / 9.1.2:
Advanced Forms of Recursion / 9.2:
Beyond Measure / 9.2.1:
Recursion over Nested Datatypes / 9.2.2:
Partial Functions / 9.2.3:
Advanced Induction Techniques / 9.3:
Massaging the Proposition / 9.3.1:
Beyond Structural and Recursion Induction / 9.3.2:
Derivation of New Induction Schemas / 9.3.3:
CTL Revisited / 9.3.4:
Case Study: Verifying a Security Protocol / 10:
The Needham-Schroeder Public-Key Protocol / 10.1:
Agents and Messages / 10.2:
Modelling the Adversary / 10.3:
Event Traces / 10.4:
Modelling the Protocol / 10.5:
Proving Elementary Properties / 10.6:
Proving Secrecy Theorems / 10.7:
Appendix / A:
Bibliography
Index
Elementary Techniques / Part I:
The Basics / 1:
Introduction / 1.1:
7.

図書

図書
Carlos A. Coello Coello...[et al.]
出版情報: Berlin : Springer, c2002  xiii, 548 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2313 . Lecture notes in artificial intelligence
所蔵情報: loading…
8.

図書

図書
Stephan Diehl (ed.)
出版情報: Berlin ; Tokyo : Springer, c2002  viii, 403 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2269
所蔵情報: loading…
目次情報: 続きを見る
Algorithm Animation with an Introduction / Andreas Kerren ; John T. Stasko1:
Specifying Algorithm Visualizations: Interesting Events or State Mapping? / Camil Demetrescu ; Irene Finocchi
Perspectives on Program Animation with Jeliot / Mordechai Ben-Ari ; Niko Myller ; Erkki Sutinen ; Jorma Tarhio
Animating Algorithms Live and Post Mortem / Stephan Diehl ; Carsten Görg
Visualising Objects: Abstraction, Encapsulation, Aliasing, and Ownership / James Noble
Algorithm Animation Using Data FlowTracing / Jaroslaw Francik
GeoWin: A Generic Tool for Interactive Visualization of Geometric Algorithms / Matthias Bäsken ; Stefan Näher
Algorithm Animation Systems for Constrained Domains / Ayellet Tal
Algorithm Animation for Teaching / Rudolf Fleischer ; Luděk Kučera
Software Engineering with an Introduction / Rym Mili ; Renee Steiner2:
Software Visualization for Reverse Engineering / Rainer Koschke
Visualizing the Execution of Java Programs / Wim De Pauw ; Erik Jensen ; Nick Mitchell ; Gary Sevitsky ; John Vlissides ; Jeaha Yang
JaVis: A UML-Based Visualization and Debugging Environment for Concurrent Java Programs / Katharina Mehner
JAVAVIS: Automatic Program Visualization with Object and Sequence Diagrams Using the Java Debug Interface (JDI) / Rainer Oechsle ; Thomas Schmitt
Visualizing Memory Graphs / Thomas Zimmermann ; Andreas Zeller
Software Visualization and Education with an Introduction / John Domingue3:
Structure and Constraints in Interactive Exploratory Algorithm Learning / Nils Faltin
A Language and System for Constructing and Presenting LowFidelity Algorithm Visualizations / Christopher Hundhausen ; Sarah Douglas
Towards a Taxonomy of Network Protocol Visualization Tools / Pilu Crescenzi ; Gaia Innocenti
Understanding Algorithms by Means of Visualized Path Testing / Ari Korhonen
Hypertextbooks: Animated, Active Learning, Comprehensive Teaching and Learning Resources for the Web / Rockford J. Ross ; Michael T. Grinder
Graphs in Software Visualization with an Introduction / Petra Mutzel ; Peter Eades4:
On the Visualization of Java Programs / Holger Eichelberger ; J. Wolff von Gudenberg
Graph Drawing Algorithm Engineering with AGD / Carsten Gutwenger ; Michael Junger ; Gunnar W. Klau ; Sebastian Leipert
An Overviewof the GXL Graph Exchange Language / Andreas Winter ; Bernt Kullbach ; Volker Riediger
Call Graph and Control FlowGraph Visualization for Developers of Embedded Applications / Alexander A. Evstiougov-Babaev
Future Perspectives with an Introduction / 5:
Visualization for the MindÆs Eye / Nelson Baloian ; Wolfram Luther
The rube Framework for Personalized 3-D Software Visualization / John F. Hopkins ; Paul A. Fishwick
Algorithm Explanation: Visualizing Abstract States and Invariants / Reinhard Wilhelm ; Tomasz Muldner ; Raimund Seidel
Visualisation and Debugging of Decentralised Information Ecosystems / Rolf Hendrik van Lengen ; Jan-Thies Bahr
Author Index
Algorithm Animation with an Introduction / Andreas Kerren ; John T. Stasko1:
Specifying Algorithm Visualizations: Interesting Events or State Mapping? / Camil Demetrescu ; Irene Finocchi
Perspectives on Program Animation with Jeliot / Mordechai Ben-Ari ; Niko Myller ; Erkki Sutinen ; Jorma Tarhio
9.

図書

図書
Chengqi Zhang, Shichao Zhang
出版情報: Berlin : Springer, c2002  xii, 238 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2307 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Introduction / 1:
What Is Data Mining? / 1.1:
Why Do We Need Data Mining? / 1.2:
Knowledge Discovery in Databases (KDD) / 1.3:
Processing Steps of KDD / 1.3.1:
Feature Selection / 1.3.2:
Applications of Knowledge Discovery in Databases / 1.3.3:
Data Mining Task / 1.4:
Data Mining Techniques / 1.5:
Clustering / 1.5.1:
Classification / 1.5.2:
Conceptual Clustering and Classification / 1.5.3:
Dependency Modeling / 1.5.4:
Summarization / 1.5.5:
Regression / 1.5.6:
Case-Based Learning / 1.5.7:
Mining Time-Series Data / 1.5.8:
Data Mining and Marketing / 1.6:
Solving Real-World Problems by Data Mining / 1.7:
Summary / 1.8:
Trends of Data Mining / 1.8.1:
Outline / 1.8.2:
Association Rule / 2:
Basic Concepts / 2.1:
Measurement of Association Rules / 2.2:
Support-Confidence Framework / 2.2.1:
Three Established Measurements / 2.2.2:
Searching Frequent Itemsets / 2.3:
The Apriori Algorithm / 2.3.1:
Identifying Itemsets of Interest / 2.3.2:
Research into Mining Association Rules / 2.4:
Chi-squared Test Method / 2.4.1:
The FP-tree Based Model / 2.4.2:
OPUS Based Algorithm / 2.4.3:
Negative Association Rule / 2.5:
Focusing on Itemsets of Interest / 3.1:
Effectiveness of Focusing on Infrequent Itemsets of Interest / 3.3:
Itemsets of Interest / 3.4:
Positive Itemsets of Interest / 3.4.1:
Negative Itemsets of Interest / 3.4.2:
Searching Interesting Itemsets / 3.5:
Procedure / 3.5.1:
An Example / 3.5.2:
A Twice-Pruning Approach / 3.5.3:
Negative Association Rules of Interest / 3.6:
Measurement / 3.6.1:
Examples / 3.6.2:
Algorithms Design / 3.7:
Identifying Reliable Exceptions / 3.8:
Confidence Based Interestingness / 3.8.1:
Support Based Interestingness / 3.8.2:
Searching Reliable Exceptions / 3.8.3:
Comparisons / 3.9:
Comparison with Support-Confidence Framework / 3.9.1:
Comparison with Interest Models / 3.9.2:
Comparison with Exception Mining Model / 3.9.3:
Comparison with Strong Negative Association Model / 3.9.4:
Causality in Databases / 3.10:
Basic Definitions / 4.1:
Data Partitioning / 4.3:
Partitioning Domains of Attributes / 4.3.1:
Quantitative Items / 4.3.2:
Decomposition and Composition of Quantitative Items / 4.3.3:
Item Variables / 4.3.4:
Decomposition and Composition for Item Variables / 4.3.5:
Procedure of Partitioning / 4.3.6:
Dependency among Variables / 4.4:
Conditional Probabilities / 4.4.1:
Causal Rules of Interest / 4.4.2:
Algorithm Design / 4.4.3:
Causality in Probabilistic Databases / 4.5:
Problem Statement / 4.5.1:
Required Concepts / 4.5.2:
Preprocess of Data / 4.5.3:
Probabilistic Dependency / 4.5.4:
Improvements / 4.5.5:
Causal Rule Analysis / 4.6:
Related Concepts / 5.1:
Optimizing Causal Rules / 5.3:
Unnecessary Information / 5.3.1:
Merging Unnecessary Information / 5.3.2:
Merging Items with Identical Properties / 5.3.3:
Polynomial Function for Causality / 5.4:
Causal Relationship / 5.4.1:
Binary Linear Causality / 5.4.2:
N-ary Linear Propagating Model / 5.4.3:
Functions for General Causality / 5.4.4:
Approximating Causality by Fitting / 5.6:
Preprocessing of Data / 5.6.1:
Constructing the Polynomial Function / 5.6.2:
Association Rules in Very Large Databases / 5.6.3:
Instance Selection / 6.1:
Evaluating the Size of Instance Sets / 6.2.1:
Generating Instance Set / 6.2.2:
Estimation of Association Rules / 6.3:
Identifying Approximate Frequent Itemsets / 6.3.1:
Measuring Association Rules of Interest / 6.3.2:
Algorithm Designing / 6.3.3:
Searching True Association Rules Based on Approximations / 6.4:
Incremental Mining / 6.5:
Promising Itemsets / 6.5.1:
Searching Procedure / 6.5.2:
Competitive Set Method / 6.5.3:
Assigning Weights / 6.5.4:
Algorithm of Incremental Mining / 6.5.5:
Improvement of Incremental Mining / 6.6:
Conditions of Termination / 6.6.1:
Anytime Search Algorithm / 6.6.2:
Association Rules in Small Databases / 6.7:
Problems Faced by Utilizing External Data / 7.1:
Our Approach / 7.2.2:
External Data Collecting / 7.3:
Available Tools / 7.3.1:
Indexing by a Conditional Associated Semantic / 7.3.2:
Procedures for Similarity / 7.3.3:
A Data Preprocessing Framework / 7.4:
Pre-analysis: Selecting Relevant and Uncontradictable Collected Data-Sources / 7.4.1:
Post-analysis: Summarizing Historical Data / 7.4.2:
Synthesizing Selected Rules / 7.4.3:
Refining Rules Mined in Small Databases / 7.5.1:
Conclusion and Future Work / 7.7:
Conclusion / 8.1:
Future Work / 8.2:
References
Subject Index
Introduction / 1:
What Is Data Mining? / 1.1:
Why Do We Need Data Mining? / 1.2:
10.

図書

図書
Nataša Jonoska, Nadrian C. Seeman (eds.)
出版情報: Berlin : Springer, c2002  xi, 392 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2340
所蔵情報: loading…
目次情報: 続きを見る
Experimental Tools
An Object Oriented Simulation of Real Occurring Molecular Biological Processes for DNA Computing and Its Experimental Verification / T. Hinze ; U. Hatnik ; M. Sturm
Towards Optimization ofPCR Protocol in DNA Computing / S. Kashiwamura ; M. Nakatsugawa ; M. Yamamoto ; T. Shiba ; A. Ohuchi
DNASequenceGenerator: A Program for the Construction of DNA Sequences / U. Feldkamp ; S. Saghafi ; W. Banzhaf ; H. Rauhe
DNA Computing in Microreactors / D. van Noort ; F.-U. Gast ; J.S. McCaskill
Cascadable Hybridisation Transfer of Specific DNA between Microreactor Selection Modules / R. Penchovsky
Theoretical Tools
Coding Properties ofDNA Languages / S. Hussini ; L. Kari ; S. Konstantinidis
Boundary Components ofThickened Graphs / N. Jonoska ; M. Saito
Probabilistic Computational Models
Population Computation and Majority Inference in Test Tube / Y. Sakakibara
DNA Starts to Learn Poker / D.H. Wood ; H. Bi ; S.O. Kimbrough ; D.-J. Wu ; J. Chen
PNA-mediated Whiplash PCR / J.A. Rose ; R.J. Deaton ; M. Hagiya ; A. Suyama
Computer Simulation and Sequence Design
Biomolecular Computation in Virtual Test Tubes / M.H. Garzon ; C. Oehmen
Developing Support System for Sequence Design in DNA Computing / F. Tanaka
The Fidelity ofthe Tag-Antitag System
PUNCH: An Evolutionary Algorithm for Optimizing Bit Set Selection / A.J. Ruben ; S.J. Freeland ; L.F. Landweber
Algorithms
Solving Knapsack Problems in a Sticker Based Model / M.J. Perez-Jimenez ; F. Sancho-Caparrini
A Clause String DNA Algorithm for SAT / V. Manca ; C. Zandron
A Proposal ofDNA Computing on Beads with Application to SAT Problems / T. Yoichi ; H. Akihiro
Experimental Solutions
Aqueous Solutions ofAlgorithmic Problems: Emphasizing Knights on a 3×3 / T. Head ; X. Chen ; M.J. Nichols ; M. Yamamura ; S. Gal
Solutions ofShortest Path Problems by Concentration Control / N. Matsuura ; Y. Kawazoe
Another Realization ofAqueous Computing with Peptide Nucleic Acid / Y. Hiroto ; T. Matoba
Experimental Conformation ofthe Basic Principles ofLength-only Discrimination / Y. Khodor ; J. Khodor ; T.F. Knight, Jr.
Experimental Construction ofVery Large Scale DNA Databases with Associative Search Capability / J.H. Reif ; T.H. LaBean ; M. Pirrung ; V.S. Rana ; B. Guo ; C. Kingsford ; G.S. Wickham
Nano-tech Devices
Operation ofa Purified DNA Nanoactuator / F.C. Simmel ; B. Yurke
DNA Scissors / J.C. Mitchell
Biomimetic Tools
A Realization ofInformation Gate by Using Enterococcus faecalis Pheromone System / K. Wakabayashi
Patterns ofMicronuclear Genes in Ciliates / A. Ehrenfeucht ; T. Harju ; I. Petre ; G. Rozenberg
Peptide Computing - Universality and Complexity / M.S. Balan ; K. Krithivasan ; Y. Sivasubramanyam
Programmed Mutagenesis Is a Universal Model ofComputation / D.K. Gifford
New Computing Models
Horn Clause Computation by Self-assembly of DNA Molecules / H. Uejima ; S. Kobayashi
DNA-based Parallel Computation ofSimple Arithmetic / H. Hug ; R. Schuler
Splicing Systems and Membranes
On P Systems with Global Rules / A. Paun
Computing with Membranes: Variants with an Enhanced Membrane Handling / M. Margenstern ; C. Martín-Vide ; G. Paun
Towards an Electronic Implementation ofMembrane Computing: A Formal Description ofNon-deterministic Evolution in Transition P Systems / A.V. Baranda ; F. Arroyo ; J. Castellanos ; R. Gonzalo
Insertion-Deletion P Systems / S.N. Krishna ; R. Rama
A Universal Time-Varying Distributed H System ofDegree 1 / Y. Rogozhin
A Note on Graph Splicing Languages / N.G. David ; K.G. Subramanian ; D.G. Thomas
Author Index
Experimental Tools
An Object Oriented Simulation of Real Occurring Molecular Biological Processes for DNA Computing and Its Experimental Verification / T. Hinze ; U. Hatnik ; M. Sturm
Towards Optimization ofPCR Protocol in DNA Computing / S. Kashiwamura ; M. Nakatsugawa ; M. Yamamoto ; T. Shiba ; A. Ohuchi
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼