Information security, which is becoming more crucial as information sharing plays an increasingly significant part in the day-to-day activities of today's people, one methods that may be used for security. For sake we present a method to linguistic steganography based on syntactic banks.

Traditionally, Epistemic Logic represents epistemic scenarios using a single model. This, however, covers only complete descriptions that specify truth values of all assertions. Indeed, many—and perhaps most—epistemic are not complete. Syntactic Logic, SEL, suggests viewing an situation as set syntactic conditions rather than This allows us to naturally capture incomplete descriptions; we discu...

OBJECTIVE Health-care communication skills training may be particularly needed in the Arabian Gulf countries because of the variety of cultures within the physician and patient populations. This study describes the implementation and results of a communication skills training program for physicians in Qatar that assessed previous training, and effect of previous training on participants' course...

This article describes a study on the effects of a self-instruction training programme in communication skills for psychology students at the Open University of the Netherlands in comparison to a fully supervised training. We expected both training programmes to increase students’ knowledge and skills, as well as their self-efficacy and motivation concerning the use of skills. Furthermore we ex...

A new interpretation is given to the most complex theoretical problem – relation of concepts value function. The relations in language are reflected by thinking between linguistic meanings, which turn reflect ‟substances” reality comprehended mind. term-concept linguistics includes a potential or already defined form expression has meaning that manifests itself speech as represents ‟sign conten...

We give a transparent characterization, by means of a certain syntactic semigroup, of regular languages possessing the finite power property. Then we use this characterization to obtain a short elementary proof for the uniform decidability of the finite power property for rational languages in all monoids defined by a confluent regular system of deletion rules. This result in particular covers ...