FCS 2007: Las Vegas, Nevada, USA
Hamid R. Arabnia, Pei Li Zhou (Eds.): Proceedings of the 2007 International Conference on Foundations of Computer Science, FCS 2007, June 25-28, 2007, Las Vegas, Nevada, USA. CSREA Press 2007 ISBN 1-60132-049-3
Algorithms and Applications
J. Renze Steenhuisen, Cees Witteveen: Coordinating Planning Agents for Moderately and Tightly-Coupled Tasks. 3-9
Katsumi Wasaki, Ken-ichi Arai: A Case Study of Formal Verification for Multi-level Pipeline Logic Circuit by using Mizar Proof Checker. 10-16
Jennifer Hui-Chan Tsai, Justie Su-tzu Juan: A Simple Multi-Secret Sharing Scheme to Achieve Both Optimal Improvement Ratios. 17-20
Bruno Bauwens, Bart Wyns, Dieter Devlaminck, Georges Otte, Luc Boullart, Patrick Santens: Mutual information and algorithmic information transfer as ideal undirected and directed independence tests. 21-26
Andras Farago: Sampling from Independence Systems. 27-33
Takeshi Tateishi, Akihiro Fujiwara: Data structures for storing binary numbers in DNA computing. 34-40
Emanuele Covino, Giovanni Pani, Daniele Scrimieri: Static Computation of Polynomial-time Functions in C++. 41-45
Ying Jin: Rule Update Algorithms for Active Rule Scheduling. 46-51
Yijie Han: Maximum Flow with a Faster Way of Computing a Blocking Flow. 52-56
Jinshuo Liu, Dengyi Zhang, Shubo Liu, Yu Yao: High Noisy Cell Image Segmentation Using Regional Template. 57-60
Chih-Chiang Yu, Yong-Hsian Hsieh, Biing-Feng Wang: Optimal Algorithms for the Segment Location Problem with Range Constraints on Length and Average. 61-67
Chekad Sarami: A Mass Formula for Cyclic Self-Orthogonal Codes. 68-72
Chekad Sarami: On Classification of Generalized Hadamard Matrices. 73-78
Kam Kong: The Majority Rule and String-and-Spinner Implementation of Logic Gates. 79-81
Nicolas Gauvrit: A Locally Logical Model for Natural Semantics. 89-93
J. Ulisses Ferreira: The Probable Decidability of the Halting Problem. 94-102
Graphs and Networks + Automata + Logic
Yi-Chun Wang, Justie Su-tzu Juan: A Perfect Secret Sharing Scheme for (r-1, r)-Uniform Hypergraph-Based Access Structures. 103-109
Wangsen Feng, Wanling Qu, Hanpin Wang: Lower bounds on the cardinality of maximum matchings in graphs with bounded degrees. 110-113
Douglas Harris: Patterns of Protocols. 114-120
Ruzayn Quaddoura: Linear Time Recognition Algorithms for Three Variants of Vertex Series Parallel Digraphs. 121-131

Qutaibah M. Malluhi, Sungbum Hong: An Efficient Algorithm for Determining the Relationship between Two Nodes on DAG. 144-147
Jaroslav Lajos, Mansur H. Samadzadeh: A Survey and a Taxonomy of Automata-Theoretic Modeling Techniques. 148-156
Interesting Results, New Models, and Methodologies

Yu-fen Weng, Justie Su-tzu Juan, Yi-Chun Wang: On the Verifiable and Detectable Multi-Use General Perfect Secret Sharing Schemes. 164-170
Naveed Ali, Shoab A. Khan, Naveed Sarfraz Khattak: Equivalence Verification of Arithmetic Data Paths With Multiple Word-Length Operands. 171-176
Hitoshi Yoshida, Hisayasu Kuroda, Yasumasa Kanada: Parameter Selection for Fast Computation of Pi(x). 177-182
Shengyuan Wu: Introduction to Multilevel Mark Coding Theory. 183-192
Workshop on Pansystems and Computer Science
Jinghong Pan, Dinghe Guo, Yongli Li, Joe Peili Zhou, Xuemou Wu: Pansystems Relativity: Vitality, Intelligence and Computer. 193-198
Xuemou Wu, Dinghe Guo, Dejun Chen, Joe Peili Zhou: Pansystems Extremum Theorems: Cybernetics. 199-205
Xiaolu Zhou, Joe Peili Zhou, Jinghong Pan, Xuemou Wu: Pansystems Approach : Relativity, World Systems, Cognition, Linquistics, Aesthetics. 206-212
Yongli Li, Zhilin Li, Jing Qu, Xiaoyan Wang: The Sorites Paradox from the View of Pansystems. 219-223
Zhenfang Li, Yongli Li, Shiqun Tao: The Extending of Panweighted Network in Pansystems and XML-based Realization. 229-234
Haixia Li, He Lin, Jiajia Wang: Rough Set Approximation and Rough Set Attribute Reduction Based on Pansystems Topology. 235-239
Tao Yang, Yongli Li, Xiaoxia Li: Application of Pansystems Theory in Object-Oriented System. 245-250
Haibo Li, Yongli Li, Xinjian Wei: A Rough Set Model of Binary Relation Based on Product and Pansystems. 251-245


Dejun Chen, Xiaolu Zhou, Xuemou Wu, Joe Peili Zhou: Modeling Distributed Virtual Enterprise Based on Pansystems Economics. 273-279
Xuemou Wu, Pei Li Zhou, Jeffrey Yi-Lin Forrest: Pansystems Exploration: A Transfield Internet-like Approach. 280-286
P. L. Zhou, Thalerngsak Kijthaweesinpoon: The Use of Pansystems Relation Operators in Rough Sets. 287-292
Pei Li Zhou, Salahadin Mohammed: A Pansystems Approach to Sorting Based on Binary Relations. 293-299
Dinghe Guo, Pei Li Zhou, Jinghong Pan: Pansystems Extremum: Scales, Approximation, Equivalence and 0**-Theorems. 300-312
Theoretical Foundations for Distributed and Concurrent Systems and Computations
Norman R. Howes: Distributed System Architecture and Specification with TLB. 313-320
Mark Burgin: Interactive Hypercomputation. 328-336
Late Papers
Toshinori Yamada, Hiroyuki Ishii: Algorithm for Finding a Nash Equilibrium of a Two-Player Game in the Strategic Form Using Convex Hull. 337-343
Janusz Jacak, Ireneusz J. Jozwiak, Lucjan Jacak: Application of braid groups for information processing. 344-348
Bing Yang, S. Q. Zheng, Enyue Lu: Finding Two Disjoint Paths in a Network with MinSum-MinMin Objective Function. 356-361
N. Messaadi, Hajer Bouzaouache, Naceur Benhadj Braiek: Nonlinear Optimization Algorithms for Hybrid Controller Design of Switched Systems. 362-368
Masaki Murakami: Compilation of Higher-Order Concurrent Programs into First-Order Programs on Recursive Graph Rewriting Model. 369-



