Cloud computing is an emerging technology in distributed computing which facilitates pay per model as per user demand and requirement. Cloud consist of a collection of virtual machine which includes both computational and storage facility. The primary aim of cloud computing is to provide efficient access to remote and geographically distributed resources.Cloud is developing day by day and faces many challenges, one of them is scheduling. Scheduling refers to a set of policies to control the order of work to be performed by a computer system. A good scheduler adapts its scheduling strategy according to the changing environment and the type of task. In this research paper we presented a Generalized Priority algorithm for efficient execution of task and comparison with FCFS and Round Robin Scheduling. Algorithm should be tested in cloud Sim toolkit and result shows that it gives better performance compared to other traditional scheduling algorithm.

No abstract

No abstract

Blockchain technology is a game-changing, enhancing security for the supply chain of smart additive manufacturing. Blockchain enables the tracking and recording of the history of each transaction in a ledger stored in the cloud that cannot be altered, and when blockchain is combined with digital signatures, it verifies the identity of the participants with its non-repudiation capabilities. One of the weaknesses of blockchain is the difficulty of preventing malicious participants from gaining access to public–private key pairs. Groups of opponents often interact freely with the network, and this is a security concern when cloud-based methods manage the key pairs. Therefore, we are proposing end-to-end security schemes by both inserting tamper-resistant devices in the hardware of the peripheral devices and using ternary cryptography. The tamper-resistant devices, which are designed with nanomaterials, act as Physical Unclonable Functions to generate secret cryptographic keys. One-time use public–private key pairs are generated for each transaction. In addition, the cryptographic scheme incorporates a third logic state to mitigate man-in-the-middle attacks. The generation of these public–private key pairs is compatible with post quantum cryptography. The third scheme we are proposing is the use of noise injection techniques used with high-performance computing to increase the security of the system. We present prototypes to demonstrate the feasibility of these schemes and to quantify the relevant parameters. We conclude by presenting the value of blockchains to secure the logistics of additive manufacturing operations.

No abstract

Since the last report, two additional objective structured clinical examinations (PGY-2, PGY-3, and PGY-4, as well as incoming PGY-2) have been administered. As a result, our curriculum has been modified to strengthen physical examination skills, including specific workshops. Interrater reliability of evaluators has been tested for the first time to verify reliability, and refinements have been made in the standardized checklist grading system. The interrater grading of history-taking had good reliability (0.73-0.96), as did neurological and spine physical examination (0.84-0.88). The interrater grading reliability of small and large joint examination was more problematic (0.46-0.62) because of examiners' inability to have full visibility, evaluator's fatigue, and confusing evaluation scoring descriptions. We now use a two-point grading scale (correct or incorrect) for history but continue a three-point scale (correct, partially correct, or incorrect) for physical examination. The examination schedule is being modified to add more encounters, give time for trainee feedback, and further refinement of grading expectations for a more efficient and reliable scoring system.

No abstract

The concept of weak relative-injectivity of modules was introduced originally in [10], where it is shown that a semiperfect ring R is such that every cyclic right module is embeddable essentially in a projective right R-module if and only if R is right artinian and every indecomposable projective right R-module is uniform and weakly R-injective. We show that in the above characterization the requirement that indecomposable projective right R-modules be uniform is superfluous (Theorem 1.11). In this paper we further the study of weak relative-injectivity by considering the class of rings for which every right module is weakly injective relative to every finitely generated right module. We refer to such rings as right weakly-semisimple rings. The class of right weakly-semisimple rings includes properly all semisimple rings and is a subclass of the class of right QI-rings. A ring R is said to be a right QI-ring if every quasi-injective right R-module is injective. QI-rings have been studied in [2], [3], [4], [6], [7], [8], [11], among others.