At the IPCO VI conference Cornuéjols and Dawande proposed a set of 0-1 linear programming instances that proved to be very hard to solve by traditional methods, and in particular by linear programming based branc...
详细信息
Orthogonal persistence is based on three principles that have been understood for nearly 20 years. PJama is a publically available prototype of a Java platform that supports orthogonal persistence. It is already capab...
详细信息
ISBN:
(纸本)3540654526
Orthogonal persistence is based on three principles that have been understood for nearly 20 years. PJama is a publically available prototype of a Java platform that supports orthogonal persistence. It is already capable of supporting substantial applications. the experience of applying the principles of orthogonal persistence to the Java programming language is described in the context of PJama. For example, issues arise over achieving orthogonality when there are classes that have a special relationship withthe Java Virtual Machine. the treatment of static variables and the definition of reachability for classes and the handling of the keyword transient also pose design problems. the model for checkpointing the state of a computation, including live threads, is analyzed and related to a transactional approach. the problem of dealing with state that is external to the PJama environment is explained and the solutions outlined. the difficult problem of system evolution is identified as a major barrier to deploying orthogonal persistence for the Java language. the predominant focus is on semantic issues, but with concern for reasonably efficient implementation. We take the opportunity throughout the paper and in the conclusions to identify directions for further work.
the proceedings contain 68 papers. the special focus in this conference is on Rough Computing, Rough Set theory and Its Applications. the topics include: Decision rules, bayes’ rule and rough sets;from computation wi...
ISBN:
(纸本)3540666451
the proceedings contain 68 papers. the special focus in this conference is on Rough Computing, Rough Set theory and Its Applications. the topics include: Decision rules, bayes’ rule and rough sets;from computation with measurements to computation with perceptions;on text mining techniques for personalization;a road to discovery science;approximate distributed synthesis and granular semantics for computing with words;discovery of rules about complications;rough genetic algorithms;a rough-fuzzy neural computational approach;toward spatial reasoning in the framework of rough mereology;an algorithm for finding equivalence relations from tables with non-deterministic information;on the extension of rough sets under incomplete information;an alternative formulation;formal rough concept analysis;noise reduction in telecommunication channels using rough sets and neural networks;rough set analysis of electrostimilation test database for the prediction of post-operative profits in cochlear implanted patients;a rough set-based approach to text classification;modular rough fuzzy MLP;correspondence and complexity results;handling missing values in rough set analysis of multi-attribute and multi-criteria decision problems;the generic rough set inductive logic programming model and motifs in strings;rough problem settings for inductive logic programming;using rough sets with heuristics to feature selection;the discretization of continuous attributes based on compatibility rough set and genetic algorithm;level cut conditioning approach to the necessity measure specification;four c-regression methods and classification functions and context-free fuzzy sets in data mining context.
Given an undirected graph G = (V, E) and three specified terminal nodes t1, t2, t3, a 3-cutis a subset A of Esuch that no two terminals are in the same component of G\A. If a non-negative edge weight ce is specified f...
详细信息
We consider the problem Max FS: For a given infeasible linear system, determine a largest feasible subsystem. this problem has interesting applications in linear programming as well as in fields such as machine learni...
详细信息
the subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dep...
详细信息
ISBN:
(纸本)3540654623
the subject of groundness analysis for (constraint) logic programs has been widely studied, and interesting domains have been proposed. Pos has been recognized as the most suitable domain for capturing the kind of dependencies arising in groundness analysis, and Reduced Ordered Binary Decision Diagrams (ROBDDs) are generally accepted to be the most efficient representation for Pos. Unfortunately, the size of an ROBDDs is, in the worst case, exponential in the number of variables it depends upon. Earlier work [2] has shown that a hybrid representation that separates the definite information from the dependency information is considerably more efficient than keeping the two together. the aim of the present paper is to push this idea further, also separating out certain dependency information, in particular all pairs of variables that are always either both ground or neither ground. We find that this new hybrid representation is a significant improvement over previous work.
We describe Nestor, a library to easily manipulate Fortran programs through a high level internal representation based on C++ classes. Nestor is a research tool that can be used to quickly implement source to source t...
详细信息
ForkLight is an imperative, task-parallel programming language for massively parallel shared memory machines. It is based on ANSI C, follows the SPMD model of parallel program execution, provides a sequentially consis...
详细信息
the authors propose the Mark Flow Graph (MFG) for theoretical systematization of sequential control. the MFG is derived from the Petri net and is suitable for designing and analyzing sequential control systems. We app...
详细信息
the authors propose the Mark Flow Graph (MFG) for theoretical systematization of sequential control. the MFG is derived from the Petri net and is suitable for designing and analyzing sequential control systems. We apply the MFG to practical examples. We explain how to use the MFG in hierarchical programming of the systems and show its effectiveness. the MFG can be easily translated to the SFC for programming PCs.
Notio [1] is a Java API for constructing conceptual graph tools and systems. Rather than attempting to provide a comprehensive toolset, Notio attempts to address the widely varying needs of the CG community by providi...
详细信息
暂无评论