Predictive and content-aware load balancing algorithm for peer-service area based IPTV networks

Load balancing is a crucial factor in IPTV delivery networks. Load balancing aims at utilizing the resources efficiently, maximizing the throughput, and minimizing the request rejection rate. The peer-service area is the recent architecture for IPTV delivery networks that overcomes the flaws of the previous architectures. However, it still suffers from the load imbalance problem. This paper investigates the load imbalance problem, and tries to augment the peer-service area architecture to overcome this problem. To achieve the load balancing over the proposed architecture, we suggest a new load-balancing algorithm that considers both the expected and the current load of both contents and servers. The proposed load-balancing algorithm consists of two stages. The first stage is the contents replication according to their expected load, while the second stage is the content-aware request distribution. To test the effectiveness of the proposed algorithm, we have compared it with both the traditional Round Robin algorithm and Cho algorithm. The experimental results depict that the proposed algorithm outperforms the two other algorithms in terms of load balance, throughput, and request rejection rate.     

Who and what links to the Internet Archive

The Internet Archive’s (IA) Wayback Machine is the largest and oldest public Web archive and has become a significant repository of our recent history and cultural heritage. Despite its importance, there has been little research about how it is discovered and used. Based on Web access logs, we analyze what users are looking for, why they come to IA, where they come from, and how pages link to IA. We find that users request English pages the most, followed by the European languages. Most human users come to Web archives because they do not find the requested pages on the live Web. About 65 % of the requested archived pages no longer exist on the live Web. We find that more than 82 % of human sessions connect to the Wayback Machine via referrals from other Web sites, while only 15 % of robots have referrers. Most of the links (86 %) from Websites are to individual archived pages at specific points in time, and of those 83 % no longer exist on the live Web. Finally, we find that users who come from search engines browse more pages than users who come from external Web sites.     

Remarks on the Surface Area and Equality Conditions in Regular Forms. Part I: Triangular Prisms

This work presents four mathematical remarks concluded from the mathematical analysis for the interrelationships between the dependent and independent variables that control the measures: perimeter, floor area, walls surface area and total surface area in the regular forms that have a given volume. Such forms include prismatic and pyramidal forms. The work consists of four parts, of which this first part presents the remarks of the isosceles triangular right prism. The first remark examines the effect of θ, the angle of the triangular base, on the total surface area. The second remark calculates the minimum total surface area in two cases, depending on whether angle θ is constant or variable. The third remark calculates the walls ratio and the critical walls ratio. The last remark studies the required conditions for the numerical equality in two cases, where the perimeter is equal to the area, and where the total surface area is equal to the volume.     

Oil thermal annealed nano‐structured indium tin oxide thin films for display applications

Indium tin oxide‐coated thin films (200 nm) are deposited on glass substrates by using R.f. sputtering technique. Here, we investigate the influence of new technique of treatment, which is called as “oil thermal annealing” on the nano‐structured indium tin oxide thin films at fixed temperature (150 °C) which improves adhesion strength, electrical conductivity and optical properties (transmittance) of the films. Oil thermal annealing is used to reduce inherent defects that may be introduced during the prepared thin film and cooling processes. Proposed technique is highly suitable for liquid crystal displays, solar cells and organic light emitting diodes, and many other display‐related applications.     

Thermodynamics of ionic-association in aqueous solutions of Ca and Mg organic salts using ion-selective electrode technique—II. benzoate, o-toloate, o-chlorobenzoate and salycylate

The stoichiometric association constants, K, the thermodynamic association constant, K_A, and the other thermodynamic parameters such as ΔS°, ΔH° and ΔG° for the association between each of the Ca and Mg ions with benzoate, o-toloate, o-chlorobenzoate and salycylate have been determined at 25°C, 35°C and 45°C in aqueous media. Ion-selective electrode technique has been used in the measurements of Ca and Mg ion activitiesThe trend of association behavior of both Ca and Mg aromatic salts could not be explained on the basis of pK_a of the mother organic acids but could be explained based on the trend of Hammet function σ of these salts themselves relative to the corresponding benzoate salt.     

MIRRE approach: nonlinear and multimodal exploration of MIR aggregated search results

Multimedia Tools and Applications - Nowadays, web users frequently explore multimedia contents to satisfy their information needs. The exploration approaches usually provide linear interaction...     

A novel secure solution of using mixed reality in data transmission for bowel and jaw surgical telepresence: enhanced rivest cipher RC6 block cipher

Security threats are crucial challenges that deter Mixed reality (MR) communication in medical telepresence. This research aims to improve the security by reducing the chances of types of various attacks occurring during the real-time data transmission in surgical telepresence as well as reduce the time of the cryptographic algorithm and keep the quality of the media used. The proposed model consists of an enhanced RC6 algorithm in combination. Dynamic keys are generated from the RC6 algorithm mixed with RC4 to create dynamic S-box and permutation table, preventing various known attacks during the real-time data transmission. For every next session, a new key is created, avoiding possible reuse of the same key from the attacker. The results obtained from our proposed system are showing better performance compared to the state of art. The resistance to the tested attacks is measured throughout the entropy, Pick to Signal Noise Ratio (PSNR) is decreased for the encrypted image than the state of art, structural similarity index (SSIM) closer to zero. The execution time of the algorithm is decreased for an average of 20%. The proposed system is focusing on preventing the brute force attack occurred during the surgical telepresence data transmission. The paper proposes a framework that enhances the security related to data transmission during surgeries with acceptable performance.

     

PCA-DTT 2D-DHCES based attack resilient imperceptible image watermarking

Most schemes exhibit low robustness due to LSB’s (Least Significant Bit) and MSB’s (Most Significant Bit) based information hiding in the cover image. However, most of these IW schemes have low imperceptibility as the cover image distortion reveals to the attacker due to information hiding in MSB’s. In this paper, a hybrid image watermarking scheme is proposed based on integrating Robust Principal Component Analysis (R-PCA), Discrete Tchebichef Transform (DTT), and Singular Value Decomposition (SVD). A grayscale watermark image is twisted/scrambled using a 2D Discrete Hyper-chaotic Encryption System (2D-DHCES) to boost up the robustness/heftiness and security. The original cover image is crumbled into sparse components using R-PCA and using DTT the substantial component is additionally decomposed and the watermark will be embedded in the cover image using SVD processing. In DTT, scarcer coefficients hold the utmost energy, also provide an optimum sparse depiction of the substantial image edges and features that supports proficient retrieval of the watermark image even after unadorned image distortion based channel attacks. The imperceptibility and robustness of the proposed method are corroborated against a variety of signal processing channel attacks (salt and pepper noise, multi-directional shearing, cropping, and frequency filtering, etc.). The visual and quantifiable outcomes reveal that the proposed image watermarking scheme is much effective and delivers high forbearance against several image processing and geometric attacks.

     

Studying the needed effort for identifying duplicate issues

Many recent software engineering papers have examined duplicate issue reports. Thus far, duplicate reports have been considered a hindrance to developers and a drain on their resources. As a result, prior research in this area focuses on proposing automated approaches to accurately identify duplicate reports. However, there exists no studies that attempt to quantify the actual effort that is spent on identifying duplicate issue reports. In this paper, we empirically examine the effort that is needed for manually identifying duplicate reports in four open source projects, i.e., Firefox, SeaMonkey, Bugzilla and Eclipse-Platform. Our results show that: (i) More than 50 % of the duplicate reports are identified within half a day. Most of the duplicate reports are identified without any discussion and with the involvement of very few people; (ii) A classification model built using a set of factors that are extracted from duplicate issue reports classifies duplicates according to the effort that is needed to identify them with a precision of 0.60 to 0.77, a recall of 0.23 to 0.96, and an ROC area of 0.68 to 0.80; and (iii) Factors that capture the developer awareness of the duplicate issue’s peers (i.e., other duplicates of that issue) and textual similarity of a new report to prior reports are the most influential factors in our models. Our findings highlight the need for effort-aware evaluation of approaches that identify duplicate issue reports, since the identification of a considerable amount of duplicate reports (over 50 %) appear to be a relatively trivial task for developers. To better assist developers, research on identifying duplicate issue reports should put greater emphasis on assisting developers in identifying effort-consuming duplicate issues.