A robust video-bitrate adaptive scheme at client-aspect plays a significant role in keeping a good quality of video streaming technology experience. Video quality affects the amount of time the video has turned off playing due to the unfilled buffer state. Therefore to maintain a video streaming continuously with smooth bandwidth fluctuation, a video buffer structure based on adapting the video bitrate is considered in this work. Initially, the video buffer structure is formulated as an optimal control-theoretic problem that combines both video bitrate and video buffer feedback signals. While protecting the video buffer occupancy from exceeding the limited operating level can provide continuous video str

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

Objective of this work is the mixing between human biometric characteristics and unique attributes of the computer in order to protect computer networks and resources environments through the development of authentication and authorization techniques. In human biometric side has been studying the best methods and algorithms used, and the conclusion is that the fingerprint is the best, but it has some flaws. Fingerprint algorithm has been improved so that their performance can be adapted to enhance the clarity of the edge of the gully structures of pictures fingerprint, taking into account the evaluation of the direction of the nearby edges and repeat. In the side of the computer features, computer and its components like human have uniqu

Background: targeted cancer nanotherapy represents a golden goal for nanobiotechnology to overcome the severe side effects of conventional chemotherapy. Hybrid nanoliposomes (HLs) composed of L-α-dimyristoylphosphatidylcholine (DMPC) and Polyoxyethylene (23) dodecyl ether (C12 (EO)23 ) can integrate selectively into the cancer cell membrane inducing cancer cell death.
Objectives: to assess the capacity of locally (in hose) synthesized hybrid nanoliposome to inhibit the growth of cervix cancer cells (HeLa) and induce apoptosis.
Patients and Methods: hybrid nanoliposomes(nHLs) synthesized by sonication method from a mixture of 90% mol DMPC and 10% mol C12(EO)23 in tissue culture media RPMI-1640 for 6 hours at 300W and 40ºC then fil

Rivest Cipher 4 (RC4) is an efficient stream cipher that is commonly used in internet protocols. However, there are several flaws in the key scheduling algorithm (KSA) of RC4. The contribution of this paper is to overcome some of these weaknesses by proposing a new version of KSA coined as modified KSA . In the initial state of the array is suggested to contain random values instead of the identity permutation. Moreover, the permutation of the array is modified to depend on the key value itself. The proposed performance is assessed in terms of cipher secrecy, randomness test and time under a set of experiments with variable key size and different plaintext size. The results show that the RC4 with improves the randomness and secrecy with

           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η) defined on a semigraph G^* in which σ : V → [0, 1], μ : VxV → [0, 1] and η : X → [0, 1] satisfy the conditions that for all the vertices u, v in the vertex set,  μ(u, v) ≤ σ(u) ᴧ σ(v) and  η(e) = μ(u₁, u₂) ᴧ μ(u₂, u₃) ᴧ … ᴧ μ(u_n-1, u_n) ≤ σ(u₁) ᴧ σ(u_n), if e = (u₁, u₂, …, u_n), n ≥ 2 is an edge in the semigraph G