Involutions and Trivolutions in Algebras Related to Second Duals of Group Algebras

We define a trivolution on a complex algebra $A$ as a non-zero conjugate-linear, anti-homomorphism $\tau$ on $A$, which is a generalized inverse of itself, that is, $\tau^3=\tau$. We give several characterizations of trivolutions and show with examples that they appear naturally on many Banach algebras, particularly those arising from group algebras. We give several results on the existence or non-existence of involutions on the dual of a topologically introverted space. We investigate conditions under which the dual of a topologically introverted space admits trivolutions

Scheduling Algorithms in Map Reduce

Data generated in the past few years cannot be efficiently manipulated with the traditional way of storing techniques as it is a large-scale dataset, and it can be structured, semi-structured, or unstructured. To deal with this kind of enormous dataset Hadoop framework is used, which supports the processing of large dataset in a distributed computing environment. Hadoop uses a technique named as MapReduce for processing and generating a large dataset with a parallel distributed algorithm on a cluster. It automatically handles failures and data loss due to its fault-tolerance property. The scheduler is a pluggable component of the MapReduce framework. Hadoop MapReduce framework uses various scheduler as per the requirements of the task. FIFO (First In First Out) is a default algorithm used by Hadoop, in which the jobs are executed in the order of their arrival. This paper will discuss myriad of schedulers such as FIFO, Capacity Scheduler, LATE Scheduler, Fair Scheduler, Delay Scheduler, Deadline Constraint Scheduler, and Resource Aware Scheduler. Besides these schedulers, we also conducted study of comparison of schedulers like Round Robin, Weighted Round Robin, Self-adaptive Reduce Scheduling (SARS), Self-adaptive MapReduce Scheduling (SAMR), Dynamic Priority Scheduling, Learning Scheduling, Classification & Optimization-based Scheduler (COSHH), Network-Aware, Match-matching, and Energy-Aware Scheduler. Hopefully, this study will enhance the understanding of the specific schedulers and stimulate other developers and consumers to make accurate decisions for their specific research interests

Qualitative and Quantitative Estimation of Pedestrian Level of Service at Signalized Intersections

Pedestrians form the largest single road user group and also are the most vulnerable road users. Pedestrian’s movements are not restricted to lanes or specific routes however they are restricted by the physical boundaries around them such as the presence of walkways or pedestrian ways. The main objective of this study is to identify the various factors affecting pedestrian level of service (PLOS) at signalized intersections and to propose a suitable methodology for estimation of pedestrian level of service. The study carried out to develop a model for pedestrian level of service of signalized intersections in Vijayawada city and Bhubaneswar city based on pedestrian’s perception on safety and comfort. The main factors considered for the development of the model were through traffic, left turning traffic, right turning traffic, number of pedestrians, number of lanes and pedestrian delay. Pedestrian delay was one of the key performance indicators for pedestrian level of service. Total twelve crosswalks from two cities were considered for study purpose. Video graphic method was used for collection of field data. Questionnaire survey was conducted to know the perceived level of service of pedestrians. The various factors required to develop the model extracted from video graphic data. Pearson correlation analysis was done to identify the various significant factors influencing pedestrian level of service. By considering perceived LOS as dependent variable and significant factors as independent variables stepwise regression analysis was done to develop a model which suitable for urban Indian conditions. The study revealed that various factors affecting level of service under heterogeneous traffic condition were turning traffic, through traffic, number of lanes, and number of pedestrian and pedestrian delay

Effective permittivity of random plasmonic composites

An effective-medium theory (EMT) is developed to predict the effective permittivity \epsilon_eff of dense random dispersions of high optical-conductivity metals such as Ag, Au and Cu. Dependence of \epsilon_eff on the volume fraction \phi, a microstructure parameter \kappa related to the static structure factor and particle radius a is studied. In the electrostatic limit, the upper and lower bounds of \kappa correspond to Maxwell-Garnett and Bruggeman EMTs respectively. Finite size effects are significant when |\beta^2(ka/n)^3| becomes O(1) where \beta, k, and n denote the nanoparticle polarizability, wavenumber and matrix refractive index respectively. The coupling between the particle and effective medium results in a red-shift in the resonance peak, a non-linear dependence of \epsilon_eff on \phi, and Fano resonance in \epsilon_eff.Comment: Manuscript submitted to J. Opt. Soc. Am. B. 33 page

Conductivity of N-Dimensional Composites Containing Hyperspherical Inclusion

A problem of determining the macroscopic or effective thermal conductivity of an N-dimensional composite medium containing N-dimensional nonoverlapping hyperspherical inclusions is considered. Since the macroscopic conductivity is expected to become less sensitive to the detailed spatial distribution of the inclusions for N ≥ 4, only the special case of periodic arrangement of the inclusions is considered. An expression for the macroscopic conductivity correct to O(χ3N + 8), χ being the ratio of diameter of the inclusions to the spacing between them, is derived and the numerical results for the conductivity are presented as a function of χ and N for the two special cases of perfectly conducting and insulating inclusions. The effective conductivity of the composite is found to approach that of the continuous matrix in higher dimensions

Reliable and efficient webserver management for task scheduling in edge-cloud platform

The development in the field of cloud webserver management for the execution of the workflow and meeting the quality-of-service (QoS) prerequisites in a distributed cloud environment has been a challenging task. Though, internet of things (IoT) of work presented for the scheduling of the workflow in a heterogeneous cloud environment. Moreover, the rapid development in the field of cloud computing like edge-cloud computing creates new methods to schedule the workflow in a heterogenous cloud environment to process different tasks like IoT, event-driven applications, and different network applications. The current methods used for workflow scheduling have failed to provide better trade-offs to meet reliable performance with minimal delay. In this paper, a novel web server resource management framework is presented namely the reliable and efficient webserver management (REWM) framework for the edge-cloud environment. The experiment is conducted on complex bioinformatic workflows; the result shows the significant reduction of cost and energy by the proposed REWM in comparison with standard webserver management methodology

A Method for Computing Stokes Flow Interactions Among Spherical Objects and its Application to Suspensions of Drops and Porous Particles

A method for computing Stokes flow interactions in suspensions of spherical objects is described in detail and applied to the suspensions of porous particles, drops, and bubbles to determine their hydrodynamic transport coefficients

A Family of Interleaved High Step-Up DC-DC Converters by Integrating a Voltage Multiplier and an Active Clamp Circuits

A family of interleaved current-fed high step-up dc-dc converters are introduced and analyzed here by combining a voltage multiplier (VM) and an active clamp circuit for high-voltage high-power applications. Low input currents and output voltages ripples values and high voltage-gains characteristics of these converters make them suitable for lots of dc-dc applications. All power devices operate entirely under soft switching conditions, even when wide load and input voltage variations are applied. Thus, they can be designed at high switching frequencies to reduce passive components sizes to achieve high-power density, one of the main targets of the power electronics researches. Also, their input and output ports common ground simplifies the gate-drives and control circuits. To verify the given analyses and simulations, a 120-320 V to 1 kV, 50-1300 W three-stage two-leg prototype converter has been implemented at 100 kHz. Based on the experimental results, maximum efficiency of 96.5% is achieved.Comment: 14 pages, 15 figure

Machine Learning in Application Security

Security threat landscape has transformed drastically over a period of time. Right from viruses, trojans and Denial of Service (DoS) to the newborn malicious family of ransomware, phishing, distributed DoS, and so on, there is no stoppage. The phenomenal transformation has led the attackers to have a new strategy born in their attack vector methodology making it more targeted—a direct aim towards the weakest link in the security chain aka humans. When we talk about humans, the first thing that comes to an attacker\u27s mind is applications. Traditional signature‐based techniques are inadequate for rising attacks and threats that are evolving in the application layer. They serve as good defences for protecting the organisations from perimeter and endpoint‐driven attacks, but what needs to be focused and analysed is right at the application layer where such defences fail. Protecting web applications has its unique challenges in identifying malicious user behavioural patterns being converted into a compromise. Thus, there is a need to look at a dynamic and signature‐independent model of identifying such malicious usage patterns within applications. In this chapter, the authors have explained on the technical aspects of integrating machine learning within applications in detecting malicious user behavioural pattern

Inclusion of Lubrication Forces in Dynamic Simulations

A new method is described for incorporating close-field, lubrication forces between pairs of particles into the multiparticle Stokes flow calculations. The method is applied to the suspensions of both spherical as well as cyliridrical particles, and results computed by the method are shown to be in excellent agreement with the exact known results available in the literature