The popularity of enterprise resource planning is globally increasing for being the magical word to integrate and automate all areas of business operations. However, many organizations are still having hard times to s...
详细信息
ISBN:
(纸本)9781467328234
The popularity of enterprise resource planning is globally increasing for being the magical word to integrate and automate all areas of business operations. However, many organizations are still having hard times to select the proper ERP package. Selection of an ERP system is a crucial decision since implementing ERP is complex, very expensive and time-consuming. Furthermore, the problem of ERP system selection was classified as a complex multiple-criteria decision-making (MCDM) problem due to the multiplicity of conflicting criteria that need to be evaluated in making the selection decision. The study started by determining the ultimate evaluation criteria and business goals of ERP, and then defined 185 sub-criteria and attributes for evaluating ERP packages. The study proposed a comprehensive framework for the process of ERP system selection that uses fuzzy logic as a method to deal with the ambiguous and conflicting opinions of the decision makers. In addition, intelligent rule chaining was constructed to reduce the number of rules used for evaluation. At last, a real-world case study for an Egyptian garments manufacturer was conducted to demonstrate the feasibility of the proposed framework. The study found out that applying ERP systems in a manufacturing environment needed special industrial requirements that may lead to ERP failure in case of selecting the improper ERP package using the traditional selection techniques.
Lanzhou Penning Trap (LPT) is now being developed for precise mass measurements in Institute of Modern Physics (IMP). Homogeneity of magnetic field in LPT was about 3 ppm when without active shimming, while the requir...
详细信息
Lanzhou Penning Trap (LPT) is now being developed for precise mass measurements in Institute of Modern Physics (IMP). Homogeneity of magnetic field in LPT was about 3 ppm when without active shimming, while the required value is less than 0.5 ppm. Linear programming algorithm was employed to design a 9-coil cylindrical shim set for main magnet in LPT. First, mesh on the cylinder and current paths are expressed by connectings between the grid nodes. Then current paths are calculated to compensate the high order components of magnet field through linear programming algorithm optimization. The resulting designs are relatively sparse and can be readily constructed. The method has good flexibility, which can uses current paths on any given surface to generate any order shim field and set allowable errors separately over different arbitrary regions of interest (ROI). Software simulation is used to evaluate the influence on field due to bend corners and limited current density for actual windings.
Broadly speaking, my research concerns combining logic of action and POMDP theory in a coherent, theoretically sound language for agent programming. We have already developed a logic for specifying partially observabl...
详细信息
ISBN:
(纸本)9781577355120
Broadly speaking, my research concerns combining logic of action and POMDP theory in a coherent, theoretically sound language for agent programming. We have already developed a logic for specifying partially observable stochastic domains. A logic for reasoning with the models specified must still be developed. An agent programming language will then be developed and used to design controllers for robots.
programming languages based on dependent type theory promise two great advances: flexibility and security. With the type-level computation afforded by dependent types, algorithms can be more generic, as the type syste...
详细信息
ISBN:
(纸本)9783939897309
programming languages based on dependent type theory promise two great advances: flexibility and security. With the type-level computation afforded by dependent types, algorithms can be more generic, as the type system can express flexible interfaces via programming. Likewise, type-level computation can also express data structure invariants, so that programs can be proved correct through type checking. Furthermore, despite these extensions, programmers already know everything. Via the Curry-Howard isomorphism, the language of type-level computation and the verification logic is the programming language itself. There are two current approaches to the design of dependently-typed languages: Coq, Epigram, Agda, which grew out of the logics of proof assistants, require that all expressions terminate. These languages provide decidable type checking and strong correctness guarantees. In contrast, functional programming languages, like Haskell and Omega mega, have adapted the features dependent type theories, but retain a strict division between types and programs. These languages trade termination obligations for more limited correctness assurances. In this talk, I present a work-in-progress overview of the TRELLYS project. TRELLYS is new core language, designed to provide a smooth path from functional programming to dependently-typed programming. Unlike traditional dependent type theories and functional languages, TRELLYS allows programmers to work with total and partial functions uniformly. The language itself is composed of two fragments that share a common syntax and overlapping semantics: a simple logical language that guarantees total correctness and an expressive call-by-value programming language that guarantees types safety but not termination. Importantly, these two fragments interact. The logical fragment may soundly reason about effectful, partial functions. Program values may be used as evidence by the logic. We call this principle freedom of speech: whereas
This paper studies a computational logic for dishonest reasoning. We introduce logic programs with disinformation to represent and reason with dishonesty. We then consider two different cases of dishonesty: deductive ...
详细信息
ISBN:
(纸本)9781577355120
This paper studies a computational logic for dishonest reasoning. We introduce logic programs with disinformation to represent and reason with dishonesty. We then consider two different cases of dishonesty: deductive dishonesty and abductive dishonesty. The former misleads another agent to deduce wrong conclusions, while the latter interrupts another agent to abduce correct explanations. In deductive or abductive dishonesty, an agent can perform different types of dishonest reasoning such as lying, bullshitting, and withholding information. We show that these different types of dishonest reasoning are characterized by extended abduction, and address their computational methods using abductive logicprogramming.
A study on fuzzy relational visualization in system development aspects is presented. The front-end enables dynamic and scalable changes in visualization according to user's expertise and inspiration. Integrative ...
详细信息
A study on fuzzy relational visualization in system development aspects is presented. The front-end enables dynamic and scalable changes in visualization according to user's expertise and inspiration. Integrative management of various data and knowledge is handled by the back-end at any scale in cloud computing environment. Extended logicprogramming is used as the core of fuzzy relational management in the back-end, and is capable of consistent uncertainty management among probabilistic reasoning and fuzzy logic while maintaining asymptotically equivalent run-time with the ordinary logicprogramming. A multi-view relational visualization is being implemented and important graphical features are highlighted in this paper.
The Boolean network is a mathematical model of biological systems, and has attracted much attention as a qualitative tool for analyzing the regulatory system. The stable states and dynamics of Boolean networks are cha...
详细信息
ISBN:
(纸本)9781577355120
The Boolean network is a mathematical model of biological systems, and has attracted much attention as a qualitative tool for analyzing the regulatory system. The stable states and dynamics of Boolean networks are characterized by their attractors, whose properties have been analyzed computationally, yet not much work has been done from the viewpoint of logical inference systems. In this paper, we show direct translations of Boolean networks into logic programs, and propose new methods to compute their trajectories and attractors based on inference on such logic programs. In particular, point attractors of both synchronous and asynchronous Boolean networks are characterized as supported models of logic programs so that SAT techniques can be applied to compute them. Investigation of these relationships suggests us to view Boolean networks as logic programs and vice versa.
The notion of inductive theorems is well-established in first-order term rewriting. In higher-order term rewriting, in contrast, it is not straightforward to extend this notion because of extensionality (Meinke, 1992)...
详细信息
ISBN:
(纸本)9783939897309
The notion of inductive theorems is well-established in first-order term rewriting. In higher-order term rewriting, in contrast, it is not straightforward to extend this notion because of extensionality (Meinke, 1992). When extending the term rewriting based program transformation of Chiba et al. (2005) to higher-order term rewriting, we need extensibility, a property stating that inductive theorems are preserved by adding new functions via macros. In this paper, we propose and study a new notion of inductive theorems for higher-order rewriting, natural inductive theorems. This allows to incorporate properties such as extensionality and extensibility, based on simply typed S-expression rewriting (Yamada, 2001).
We show how Finite Model Computation (FMC) of first-order theories can efficiently and transparently be solved by taking advantage of an extension of Answer Set programming, called incremental Answer Set programming (...
详细信息
ISBN:
(纸本)9781577355120
We show how Finite Model Computation (FMC) of first-order theories can efficiently and transparently be solved by taking advantage of an extension of Answer Set programming, called incremental Answer Set programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We developed a system based on the iASP solver iClingo and demonstrate its competitiveness.
In this paper we present a logic-based approach for querying business process repositories. The proposed solution is based on a synergic use of an ontological framework (OPAL) aimed at capturing the semantics of a bus...
详细信息
暂无评论