scholarly journals Computational structure in three-valued nearness relations

Author(s):  
Matt Duckham ◽  
Michael Worboys
2019 ◽  
Vol 57 (2) ◽  
pp. 233
Author(s):  
Nguyen Thu Anh ◽  
Tran Thai Son

The real-world-semantics interpretability concept of fuzzy systems introduced in [1] is new for the both methodology and application and is necessary to meet the demand of establishing a mathematical basis to construct computational semantics of linguistic words so that a method developed based on handling the computational semantics of linguistic terms to simulate a human method immediately handling words can produce outputs similar to the one produced by the human method. As the real world of each application problem having its own structure which is described by certain linguistic expressions, this requirement can be ensured by imposing constraints on the interpretation assigning computational objects in the appropriate computational structure to the words so that the relationships between the computational semantics in the computational structure is the image of relationships between the real-world objects described by the word-expressions. This study will discuss more clearly the concept of real-world-semantics interpretability and point out that such requirement is a challenge to the study of the interpretability of fuzzy systems, especially for approaches within the fuzzy set framework. A methodological challenge is that it requires both the computational expression representing a given linguistic fuzzy rule base and an approximate reasoning method working on this computation expression must also preserve the real-world semantics of the application problem. Fortunately, the hedge algebra (HA) based approach demonstrates the expectation that the graphical representation of the rule of fuzzy systems and the interpolation reasoning method on them are able to preserve the real-world semantics of the real-world counterpart of the given application problem.


2018 ◽  
Vol 54 (77) ◽  
pp. 10812-10815 ◽  
Author(s):  
Mohammad Wahiduzzaman ◽  
Sujing Wang ◽  
Benjamin J. Sikora ◽  
Christian Serre ◽  
Guillaume Maurin

A structure prediction tool has been developed to guide the discovery of MOF materials.


Author(s):  
I. I. Levin ◽  
M. D. Chekina

The developed fractal image compression method, implemented for reconfigurable computing systems is described. The main idea parallel fractal image compression based on parallel execution pairwise comparison of domain and rank blocks. Achievement high performance occurs at the expense of simultaneously comparing maximum number of pairs. Implementation fractal image compression for reconfigurable computing systems has two critical resources, as number of input channels and FPGA Look-up Table (LUT). The main critical resource for fractal image compression is data channels, and implementation this task for reconfigurable computing systems requires parallel-pipeline computations organization replace parallel, preliminarily produced performance reduction parallel computational structure. The main critical resource for fractal image compression is data channels, and implementation this task for reconfigurable computing systems requires parallel-pipeline computations organization replace parallel computations organiation. For using parallel-pipeline computations organization, preliminarily have produce performance reduction parallel computational structure. Each operator has routed to computational structure sequentially (bit by bit) to save computational resources and reduces equipment downtime. Storing iterated functions system coefficients for image encoding has been introduced in data structure, which correlates between corresponding parameters the numbers of rank and domain blocks. Applying this approach for parallel-pipeline programs allows scaling computing structure to plurality programmable logic arrays (FPGAs). Task implementation on the reconfigurable computer system Tertius-2 containing eight FPGAs 15 000 times provides performed acceleration relatively with universal multi-core processor, and 18 – 25 times whit to existing solutions for FPGAs.


2019 ◽  
pp. 210-229
Author(s):  
Michael Weisberg

Michael Weisberg’s book Simulation and Similarity argued that although mathematical models are sometimes described in narrative form, they are best understood as interpreted mathematical structures. But how can a mathematical structure be causal, as many models described in narrative seem to be? This chapter argues that models with apparently narrative form are actually computational structures. It explores this suggestion in detail, examining what computational structure consists of, the resources it offers modelers, and why attempting to re-describe computational models as imaginary concrete systems fails even more dramatically than it does for mathematical models.


2019 ◽  
Vol 126 ◽  
pp. 139-149
Author(s):  
P. Guru Vishnu ◽  
T.K. Bhattacharya ◽  
Bharat Bhushan ◽  
Pushpendra Kumar ◽  
R.N. Chatterjee ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document