Marker versus inkdot over three-dimensional patterns

A multi-marker automaton is a finite automaton which keeps marks as pebbles in the finite control, and cannot rewrite any input symbols but can make marks on its input with the restriction that only a bounded number of these marks can exist at any given time. An improvement of picture recognizability of the finite automaton is the reason why the multi-marker automaton was introduced. On the other hand, a multi-inkdot automaton is a conventional automaton capable of dropping an inkdot on a given input tape for a landmark, but unable to further pick it up. This paper deals with marker versus inkdot over threedimensional input tapes, and investigates some properties. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Real realization: Dennett’s real patterns versus Putnam’s ubiquitous automata

Both Putnam and Searle have argued that that every abstract automaton is realized by every physical system, a claim that leads to a reductio argument against Cognitivism or Strong AI: if it is possible for a computer to be conscious by virtue of realizing some abstract automaton, then by Putnam’s theorem every physical system also realizes that automaton, and so every physical system is conscious—a conclusion few supporters of Strong AI would be willing to accept. Dennett has suggested a criterion of reverse engineering for identifying “real patterns,” and I argue that this approach is also very effective at identifying “real realizations.” I focus on examples of real-world implementations of complex automata because previous attempts at answering Putnam’s challenge have been overly restrictive, ruling out some realizations that are in fact paradigmatic examples of practical automaton realization. I also argue that some previous approaches have at the same time been overly lenient in accepting counter-intuitive realizations of trivial automata. I argue that the reverse engineering approach avoids both of these flaws. Moreover, Dennett’s approach allows us to recognize that some realizations are better than others, and the line between real realizations and non-realizations is not sharp.     

AUTOCAD使用的基本原则与图层设置原则

进行工程设计实际上都是要将某些设计思想或者是设计内容,表达、反映到设计文件上.而图纸,就是一种直观、准确、醒目、易于交流的表达形式.而使用AUTOCAD进行计算机制图的原则就是要达到清晰、准确、高效.     

Principles of mathmodelica

Standard rules for the creation of an equation set are proposed. This set of equations is used for the solution of textual tasks in sciences that have a strong system of formulas. These rules make the employment of computer technique noticeably easier. A user fills only the column of task parameters with numerical values. This simplifies the complex solution of complicated problems.     

Principles for principals

The experience of the last 50 years in the engineering, acquisition and integration of large, complex electronic systems in both the civilian and military sectors has not been good, and there is considerable room for improvement. In an attempt to provide lessons learned and to summarize and codify some 40+ years of experience in this field, a set of ten principles are presented. They cover such topics as planning, leadership, organization, modularization and testing.The keynote speech delivered at the Second International Conference on Systems Integration, Morristown, New Jersey, June 15–18, 1992.     

GENI Design Principles

GENI, a major planned initiative of the US National Science Foundation to build an experimental facility for evaluating new network architectures, can lead to a future Internet that is more secure, available, manageable, and efficient.     

简单的营销法则

在无限的市场竞争中．有限的客户资源变得越来越宝贵。众多企业不惜下大力气，通过了解客户需求，确定目标市场，做好产品定位，以最终赢得客户。于是，企业十分注重营销知识的培训和营销人才的培养。门类繁多的营销理论、经营战略也不断问世。从4P到4C，再到4V及现在又流行一     

桥梁设计原则解析

桥梁作为一种能够跨越障碍、为车辆提供通行的建筑,在基础建设中占有十分重要的地位。由于桥梁建设涉及很多重要的技术问题,因此,其设计也涉及多方面的问题。那么,怎样设计经久耐用的桥梁？在桥梁设计中要遵循哪些基本原则？现对此展开详细的论述。     

Principles of remote attestation

Remote attestation is the activity of making a claim about properties of a target by supplying evidence to an appraiser over a network. We identify five central principles to guide development of attestation systems. We argue that (i) attestation must be able to deliver temporally fresh evidence; (ii) comprehensive information about the target should be accessible; (iii) the target, or its owner, should be able to constrain disclosure of information about the target; (iv) attestation claims should have explicit semantics to allow decisions to be derived from several claims; and (v) the underlying attestation mechanism must be trustworthy. We illustrate how to acquire evidence from a running system, and how to transport it via protocols to remote appraisers. We propose an architecture for attestation guided by these principles. Virtualized platforms, which are increasingly well supported on stock hardware, provide a natural basis for our attestation architecture.     

Principles of Chemical Programming

The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical models use the multiset as their basic data structure. Computation proceeds by rewritings of the multiset which consume elements according to reaction conditions and produce new elements according to specific transformation rules. Since the introduction of Gamma in the mid-eighties, many other chemical formalisms have been proposed such as the Cham, the P-systems and various higher-order extensions. The main objective of this paper is to identify a basic calculus containing the very essence of the chemical paradigm and from which extensions can be derived and compared to existing chemical models.     

Principles of sequential-equivalence verification

Traditionally, designers use simulation to check the functional equivalence of specification and implementation models. Although simulation can eliminate some or most design errors, it can never completely certify design correctness. Formal equivalence verification (FEV) is a viable alternative that has gained wide industrial acceptance. FEV, which uses automata theory and mathematical logic to formally reason about the correctness of design transformations, is broadly divided into two categories: combinational and sequential. This article is a general survey of conceptual and algorithmic approaches to sequential equivalence checking. Although this fundamental problem is very complex, recent advances in satisfiability solvers and ATPG approaches are making good headway.     

校园网络设计原则

校园网络已经成为学校必备的基础设施,在设计校园网络时应分析学校的实际应用需求、考虑学校的经济承受能力、预计学校未来的发展规划,建设一个具有实用性、先进性、安全性的校园网络。