Semiotics is one of the theories of reading literary texts.  This theory systematically studies the causes and factors involved in the process of production and interpretation of the signs. One of the main topics in semiotics deals with implicit meaning wherein the scholars examine the implied significance of the signs in addition to their explicit significance. Sadegh Chubak’s Tangsir is one o...

Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessing, and search. It is often argued that by encoding arbitrary Boolean formulas in conjunctive normal form (CNF), structural properties of the original problem are not reflected in the CNF. This should result in the fact...

We investigated whether attention could be modulated through the implicit learning of temporal information in a rapid serial visual presentation (RSVP) task. Participants identified two target letters among numeral distractors. The stimulus-onset asynchrony immediately following the first target (SOA1) varied at three levels (70, 98, and 126 ms) randomly between trials or fixed within blocks of...

Current methods for building models using implicit volume techniques present problems defining accurate and controllable blend shapes between implicit primitives. We present new methods to extend the freedom and controllability of implicit volume modeling. The main idea is to use a free-form curve to define the profile of the blend region between implicit primitives. The use of a free-form impl...

In theory and practice of modern SAT solving, clause-elimination procedures are essential for simplifying formulas in conjunctive normal form (CNF). Such procedures identify redundant clauses and faithfully remove them, either before solving in a preprocessing phase or during solving, resulting in a considerable speed up of the SAT solver. A wide number of effective clause-elimination procedure...

We study the problem of disentangling locked processes via code refactoring. We identify and characterise a class of processes that is not lock-free; then we formalise an algorithm that statically detects potential locks and propose refactoring procedures that disentangle detected locks. Our development is cast within a simple setting of a finite linear CCS variant — although it suffices to ill...

Due to improvements in computational resources, interest has recently increased in using implicit scheme for solving flow equations on 3D unstructured grids. However, most of the implicit schemes produce greater numerical diffusion error than their corresponding explicit schemes. This stems from the fact that in linearizing implicit fluxes, it is conventional to replace the Jacobian matrix in t...