the aim of this paper is to initiate and investigate new soft sets over semihypergroups, named special soft sets and transitive soft sets and denoted by $s_{h}$ and  $t_{h},$ respectively. it is shown that $t_{h}=s_{h}$ if and only if $beta=beta^{*}.$ we also introduce the derived semihypergroup from a special soft set and study some properties of this class of semihypergroups.

The present study examined the relationship between novice learners' counterfactual thinking (i.e. generating what if and if only thoughts) about their initial training experience with a computer application and subsequent improvement in task performance. The role of anticipated emotions towards goal attainment in task performance was also assessed. Undergraduate students (N = 42) with minimal ...

This study reports the different documentation that teachers encounter in four countries: England, Scotland, Northern Ireland and Wales. It considers the influence of this documentation on teachers’ implementations of ICT in early years practice. This influence is analysed in light of Seymour Papert’s ‘new forms of learning’ (1996). Early years’ teachers need to decide ‘how best’ computers can ...

Yet, behind the scenes, a very strong assumption—or belief— resides: that there is a fixed single population parameter. In this case, the mean value of weights for teenagers in the city is a single value. Therefore, without a serious flaw in the sampling process, the parameter is constant, though unknown, across all possible samples [2]. However, what if the parameter is not fixed but rather ha...

Let us assume that some businessmen wish to have a meeting. For this to happen, they usually have to meet somewhere. If they cannot meet physically, then they can take part in a video (or audio) conference to discuss whatever needs to be discussed. But what if their meeting is meant to be private? In this case they need a cryptographic protocol that allows them to exchange their ideas remotely,...

Reputation concerns can discipline agents to take costly effort and generate good outcomes. But what if outcomes are not always observed? We consider a model of reputation with shifting observability, and ask how this affects agents’ incentives. We identify a novel and intuitive mechanism by which infrequent observation or inattention can actually strengthen reputation incentives and encourage ...

Let $R$ be a commutative ring and $mathbb{A}(R)$ be the set of all ideals with non-zero annihilators. Assume that $mathbb{A}^*(R)=mathbb{A}(R)diagdown {0}$ and $mathbb{F}(R)$ denote the set of all finitely generated ideals of $R$. In this paper, we introduce and investigate the {it finitely generated subgraph} of the annihilating-ideal graph of $R$, denoted by $mathbb{AG}_F(R)$. It is the (undi...

A frame $L$ is called {it coz-dense} if $Sigma_{coz(alpha)}=emptyset$ implies $alpha=mathbf 0$. Let $mathcal RL$ be the ring of real-valued continuous functions on a coz-dense and completely regular frame $L$. We present a description of the socle of the ring $mathcal RL$ based on minimal ideals of $mathcal RL$ and zero sets in pointfree topology. We show that socle of $mathcal RL$ is an essent...

let $p$ be a prime number and $n$ be a positive integer. the graph $g_p(n)$ is a graph with vertex set $[n]={1,2,ldots ,n}$, in which there is an arc from $u$ to $v$ if and only if $uneq v$ and $pnmid u+v$. in this paper it is shown that $g_p(n)$ is a perfect graph. in addition, an explicit formula for the chromatic number of such graph is given.

the degree set of a graph is the set of its degrees. kapoor et al. [degree sets for graphs, fund. math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. furthermore, the minimum order of such a graph is determined. a graph is 2-self- centered if its radius and diameter are two. in this paper for ...