Click is a new software architecture for building flexible and configurable routers. A Click router is assembled from packet processing modules called elements. Individual elements implement simple router functions like packet classification, queueing, scheduling, and interfacing with network devices. Complete configurations are built by connecting elements into a graph; packets flow along the ...

for any lacunary sequence $theta = (k_{r})$, we define the concepts of $s_{theta}-$limit point and $s_{theta}-$cluster point of a sequence of fuzzy numbers $x = (x_{k})$. we introduce the new sets  $lambda^{f}_{s_{theta}}(x)$, $gamma^{f}_{s_{theta}}(x)$ and prove some inclusion relaions between these and the sets $lambda^{f}_{s}(x)$, $gamma^{f}_{s}(x)$ introduced in ~cite{ayt:slpsfn} by aytar [...

this study aimed at investigating the effect of graphic organizer strategy on improving iranian efl learners’ vocabulary learning. fifty students participated in this study which lasted for one academic semester. the students were divided into two groups: one experimental group in which students were taught new vocabulary items through graphic organizers in form of clusters and pictures, and on...

The search of Tandem Repeats in a genomic sequence is of growing interest but unfortunately the existing tools have the drawback of producing cumbersome results that require a painstaking interpretation. In order to help users interpret the results at first glance, we implemented JSTRING that shows the results also in a very clear graphic format, thus allowing their immediate survey. The softwa...

A sequence S is potentially Km−Pk graphical if it has a realization containing a Km −Pk as a subgraph. Let σ(Km −Pk, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km−Pk, n) is potentially Km−Pk graphical. In this paper, we prove that σ(Km−Pk, n) ≥ (2m−6)n−(m−3)(m−2)+2, for n ≥ m ≥ k + 1 ≥ 4. We conjectured that equality holds for n ≥ m ≥ k + 1 ≥ 4. ...

A sequence S is potentially Km−Pk graphical if it has a realization containing a Km −Pk as a subgraph. Let σ(Km −Pk, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km−Pk, n) is potentially Km−Pk graphical. In this paper, we prove that σ(Km−Pk, n) ≥ (2m−6)n−(m−3)(m−2)+2, for n ≥ m ≥ k + 1 ≥ 4. We conjecture that equality holds for n ≥ m ≥ k + 1 ≥ 4. W...

In the present study we report several findings which indicate that subjects exploit elasticity of muscles and tendons as a biomechanical property of the motor system in the execution of graphic stroke sequences. The drawing movements of 15 right-handed subjects were analyzed, who copied a geometrical pattern consisting of four line segments. Three of these segments were connected by an acute a...

Abstract Drawing on existing research with a holistic stance toward multimodal meaning-making, this paper takes an analytic approach to integrating eye-tracking data study the perception and use of multimodality by teachers learners. To illustrate approach, we analyse two webconference tutoring sessions from telecollaborative project involving pre-service learners Mandarin Chinese. The were rec...

This paper is grounded in the empirical reality of a growing use of the ICTs in public administrations. Generally, informationand communication technologies (ICTs) are being introduced in an organization in order to increase operational efficiency, quality, and transparency. But, besides these intended effects, the introduction of the ICTs also leads to substantial changes in the power relation...

The techniques used to enforce Internet Censorship vary, and as a consequence the users can experience different results while accessing the same censored content in different contexts. While the corpus of Internet censorship studies is growing, to the best of our knowledge we are the first to focus on censorship detection on 3G/4G (hereafter mobile) network operators. After an introduction on ...