Multiple-Valued Structures of Intellectual Systems

The basic construction concepts of many-valued intellectual systems, which are adequate to primal problems of person activity and using hybrid tools with many-valued intellectual systems being two-place, but simulating neuron processes of space toting which are different on a level of actions, inertial and threshold of properties of neuron diaphragms, and also frequency modification of the following transmitted messages are created. All enumerated properties and functions in point of fact are essential not only are discrete on time, but also many-valued.

Henselian Discrete Valued Fields Admitting One-Dimensional Local Class Field Theory

2000 Mathematics Subject Classification: 11S31 12E15 12F10 12J20.

BOWL:augmenting the semantic web with beliefs

As the Semantic Web is an open, complex and constantly evolving medium, it is the norm, but not exception that information at different sites is incomplete or inconsistent. This poses challenges for the engineering and development of agent systems on the Semantic Web, since autonomous software agents need to understand, process and aggregate this information. Ontology language OWL provides core language constructs to semantically markup resources on the Semantic Web, on which software agents interact and cooperate to accomplish complex tasks. However, as OWL was designed on top of (a subset of) classic predicate logic, it lacks the ability to reason about inconsistent or incomplete information. Belief-augmented Frames (BAF) is a frame-based logic system that associates with each frame a supporting and a refuting belief value. In this paper, we propose a new ontology language Belief-augmented OWL (BOWL) by integrating OWL DL and BAF to incorporate the notion of confidence. BOWL is paraconsistent, hence it can perform useful reasoning services in the presence of inconsistencies and incompleteness. We define the abstract syntax and semantics of BOWL by extending those of OWL. We have proposed reasoning algorithms for various reasoning tasks in the BOWL framework and we have implemented the algorithms using the constraint logic programming framework. One example in the sensor fusion domain is presented to demonstrate the application of BOWL.

Rethinking Professional Practice: The Logic of Competition and the Crisis of Identity in Housing Practice

The relationship between professionalism, education and housing practice has become increasingly strained following the introduction of austerity measures and welfare reforms across a range of countries. Focusing on the development of UK housing practice, this article considers how notions of professionalism are being reshaped within the context of welfare retrenchment and how emerging tensions have both affected the identity of housing professionals and impacted on the delivery of training and education programmes. The article analyses the changing knowledges and skills valued in contemporary housing practice and considers how the sector has responded to the challenges of austerity. The central argument is that a dominant logic of competition has culminated in a crisis of identity for the sector. Although the focus of the article is on UK housing practice, the processes identified have a wider relevance for the analysis of housing and welfare delivery in developed economies.

Mental logic and its difficulties with disjunction

The mental logic theory does not accept the disjunction introduction rule of standard propositional calculus as a natural schema of the human mind. In this way, the problem that I want to show in this paper is that, however, that theory does admit another much more complex schema in which the mentioned rule must be used as a previous step. So, I try to argue that this is a very important problem that the mental logic theory needs to solve, and claim that another rival theory, the mental models theory, does not have these difficulties.

Fuzzy Logic Foundations and Industrial Applications (ed. D. Ruan), Springer US, 1996, ISBN: 978-0-7923-9774-8 [Book review]

Abstract not available

Data structures for SIMD logic simulation

Due to the growth of design size and complexity, design verification is an important aspect of the Logic Circuit development process. The purpose of verification is to validate that the design meets the system requirements and specification. This is done by either functional or formal verification. The most popular approach to functional verification is the use of simulation based techniques. Using models to replicate the behaviour of an actual system is called simulation. In this thesis, a software/data structure architecture without explicit locks is proposed to accelerate logic gate circuit simulation. We call thus system ZSIM. The ZSIM software architecture simulator targets low cost SIMD multi-core machines. Its performance is evaluated on the Intel Xeon Phi and 2 other machines (Intel Xeon and AMD Opteron). The aim of these experiments is to: • Verify that the data structure used allows SIMD acceleration, particularly on machines with gather instructions ( section 5.3.1). • Verify that, on sufficiently large circuits, substantial gains could be made from multicore parallelism ( section 5.3.2 ). • Show that a simulator using this approach out-performs an existing commercial simulator on a standard workstation ( section 5.3.3 ). • Show that the performance on a cheap Xeon Phi card is competitive with results reported elsewhere on much more expensive super-computers ( section 5.3.5 ). To evaluate the ZSIM, two types of test circuits were used: 1. Circuits from the IWLS benchmark suit [1] which allow direct comparison with other published studies of parallel simulators.2. Circuits generated by a parametrised circuit synthesizer. The synthesizer used an algorithm that has been shown to generate circuits that are statistically representative of real logic circuits. The synthesizer allowed testing of a range of very large circuits, larger than the ones for which it was possible to obtain open source files. The experimental results show that with SIMD acceleration and multicore, ZSIM gained a peak parallelisation factor of 300 on Intel Xeon Phi and 11 on Intel Xeon. With only SIMD enabled, ZSIM achieved a maximum parallelistion gain of 10 on Intel Xeon Phi and 4 on Intel Xeon. Furthermore, it was shown that this software architecture simulator running on a SIMD machine is much faster than, and can handle much bigger circuits than a widely used commercial simulator (Xilinx) running on a workstation. The performance achieved by ZSIM was also compared with similar pre-existing work on logic simulation targeting GPUs and supercomputers. It was shown that ZSIM simulator running on a Xeon Phi machine gives comparable simulation performance to the IBM Blue Gene supercomputer at very much lower cost. The experimental results have shown that the Xeon Phi is competitive with simulation on GPUs and allows the handling of much larger circuits than have been reported for GPU simulation. When targeting Xeon Phi architecture, the automatic cache management of the Xeon Phi, handles and manages the on-chip local store without any explicit mention of the local store being made in the architecture of the simulator itself. However, targeting GPUs, explicit cache management in program increases the complexity of the software architecture. Furthermore, one of the strongest points of the ZSIM simulator is its portability. Note that the same code was tested on both AMD and Xeon Phi machines. The same architecture that efficiently performs on Xeon Phi, was ported into a 64 core NUMA AMD Opteron. To conclude, the two main achievements are restated as following: The primary achievement of this work was proving that the ZSIM architecture was faster than previously published logic simulators on low cost platforms. The secondary achievement was the development of a synthetic testing suite that went beyond the scale range that was previously publicly available, based on prior work that showed the synthesis technique is valid.

Measure-valued mass evolution problems with flux boundary conditions and solution-dependent velocities

In this paper we prove well-posedness for a measure-valued continuity equation with solution-dependent velocity and flux boundary conditions, posed on a bounded one-dimensional domain. We generalize the results of an earlier paper [J. Differential Equations, 259 (2015), pp. 10681097] to settings where the dynamics are driven by interactions. In a forward-Euler-like approach, we construct a time-discretized version of the original problem and employ those results as a building block within each subinterval. A limit solution is obtained as the mesh size of the time discretization goes to zero. Moreover, the limit is independent of the specific way of partitioning the time interval [0, T]. This paper is partially based on results presented in Chapter 5 of [Evolution Equations for Systems Governed by Social Interactions, Ph.D. thesis, Eindhoven University of Technology, 2015], while a number of issues that were still open there are now resolved.

A new low temperature synthesis route of fraipontite (Zn,Al)3(Si,Al)2O5(OH)4

A low temperature synthesis method based on the decomposition of urea at 90°C in water has been developed to synthesise fraipontite. This material is characterised by a basal reflection 001 at 7.44 Å. The trioctahedral nature of the fraipontite is shown by the presence of a 06l band around 1.54 Å, while a minor band around 1.51 Å indicates some cation ordering between Zn and Al resulting in Al-rich areas with a more dioctahedral nature. TEM and IR indicate that no separate kaolinite phase is present. An increase in the Al content however, did result in the formation of some SiO2 in the form of quartz. Minor impurities of carbonate salts were observed during the synthesis caused by to the formation of CO32- during the decomposition of urea.