Application of computer technologies for calculation of gears at studying of a course " Details of machines"

The computer program GearKURT has been created to calculate mechanical gears. The program allows you to calculate gears: - closed cylindrical spur gear - closed cylindrical helical gear - open cylindrical spur gear - Novikov's gear - closed bevel spur gear - closed bevel gear with indirect teeth - open bevel gear - worm-gear. The computer program has a dialog interface written in the object-oriented programming language Delphi and compiled into an exe-file. The program allows you to choose the necessary material and method of heat treatment for the manufacture of gears, to calculate the optimal geometric dimensions and transmission parameters, to determine the design of gears. The program provides all the necessary reference materials in the form of tables and graphs, which must be used to select the coefficients and other values necessary for calculations. The program provides access to the theoretical material of the course "Machine Parts" and the ability to save the results of calculations in a separate file. Recommendations for using this program are given.

Combining Digital Signature with Local Binary Pattern-Least Significant Bit Steganography Techniques for Securing Medical Images

The image authentication is generally based on two different types of techniques: watermarking and digital signature. In watermarking methods, embedded watermarking is often imperceptible and it contains either a specific ID of producer or codes related to content that are used for authentication. Normally a separate file is stored, digital signature is a non-repudiation and encrypted version of the information extracted from the data. A digital signature can be attached to the data to prove the originality and integrity. The proposed work presents a new approach to steganography of medical images that uses modified Least Significant Bit (LSB) based on the Local Binary Pattern (LBP) pattern. As a first step, cover image has been divided as blocks of 3×3 non overlapping masks. Then, the pixel embedding position (clock wise or anti-clock wise) has to be identified using LBP operator. The value of the LBP operator determines how and where to embed secret image pixel. Later, using LSB method, pixel values will be embedded in the cover image pixel. In order to provide the integrity of the data, the proposed work also presents Reversible Watermarking (RW), a Digital Signature (DS) technique. The proposed algorithm of steganography experimented on few medical images and achieved better efficiency with respect to MSE and PSNR values and same is reported in this paper.

Enhancing the drug ontology with semantically-rich representations of National Drug Codes and RxNorm unique concept identifiers

Background The Drug Ontology (DrOn) is a modular, extensible ontology of drug products, their ingredients, and their biological activity created to enable comparative effectiveness and health services researchers to query National Drug Codes (NDCs) that represent products by ingredient, by molecular disposition, by therapeutic disposition, and by physiological effect (e.g., diuretic). It is based on the RxNorm drug terminology maintained by the U.S. National Library of Medicine, and on the Chemical Entities of Biological Interest ontology. Both national drug codes (NDCs) and RxNorm unique concept identifiers (RXCUIS) can undergo changes over time that can obfuscate their meaning when these identifiers occur in historic data. We present a new approach to modeling these entities within DrOn that will allow users of DrOn working with historic prescription data to more easily and correctly interpret that data. Results We have implemented a full accounting of national drug codes and RxNorm unique concept identifiers as information content entities, and of the processes involved in managing their creation and changes. This includes an OWL file that implements and defines the classes necessary to model these entities. A separate file contains an instance-level prototype in OWL that demonstrates the feasibility of this approach to representing NDCs and RXCUIs and the processes of managing them by retrieving and representing several individual NDCs, both active and inactive, and the RXCUIs to which they are connected. We also demonstrate how historic information about these identifiers in DrOn can be easily retrieved using a simple SPARQL query. Conclusions An accurate model of how these identifiers operate in reality is a valuable addition to DrOn that enhances its usefulness as a knowledge management resource for working with historic data.

Fastq-pair: efficient synchronization of paired-end fastq files

Paired end DNA sequencing provides additional information about the sequence data that is used in sequence assembly, mapping, and other downstream bioinformatics analysis. Paired end reads are usually provided as two fastq-format files, with each file representing one end of the read. Many commonly used downstream tools require that the sequence reads appear in each file in the same order, and reads that do not have a pair in the corresponding file are placed in a separate file of singletons. Although most sequencing instruments capable of generating paired end reads produce files where each read has a corresponding mate, many downstream bioinformatics manipulations break the one-to-one correspondence between reads, and paired-end sequence files loose synchronicity, and contain either unordered sequences or sequences in one or other file without a mate. Trivial solutions to this problem require reading one or both of the DNA sequence files into memory but quickly become limited by computational resources for moderate to large sized sequence files that are common nowadays. Here, we introduce a fast and memory efficient solution, written in C for portability, that synchronizes paired-end fastq files for subsequent analysis and places unmatched reads into singleton files.Fastq-pair is freely available from https://github.com/linsalrob/fastq-pair and is released under the MIT license.

Design and Analysis of an Intelligent Integrity Checking Watermarking Scheme for Ubiquitous Database Access

As a result of the highly distributed nature of ubiquitous database accessing, it is essential to develop security mechanisms that lend themselves well to the delicate properties of outsourcing databases integrity and copyright protection. Researchers have begun to study how watermarking computing can make ubiquitous databases accessing more confident work environments. One area where database context may help is in supporting content integrity. Initially, most of the research effort in this field was depending on distortion based watermark while the few remaining studies concentrated on distortion-free. But there are many disadvantages in previous studies; most notably some rely on adding watermark as an extra attributes or tuples, which increase the size of the database. Other techniques such as permutation and abstract interpretation framework require much effort to verify the watermark. The idea of this research is to adapt an optimized distortion free watermarking based on fake tuples that are embedded into a separate file not within the database to validate the content integrity for ubiquitous database accessing. The proposed system utilizes the GA, which boils down its role to create the values of the fake tuples as watermark to be the closest to real values. So that it's very hard to any attacker to guess the watermark. The proposed technique achieves more imperceptibility and security. Experimental outcomes confirm that the proposed algorithm is feasible, effective and robust against a large number of attacks.

Comparative study of postoperative complications of Lichtenstein Tension Free Repair and Pure Tissue Repairs like Modified Bassini or Shouldice at Nishtar Hospital Multan

The objective of this study is to compare the postoperative complications of Lichtenstein tension free repair and pure tissue repairs like modified Bassini or Shouldice. This was an interventional (quasi experimental) study. This study was carried out on 100 patients having primary inguinal hernia. After taking detail history, examination and necessary investigations, only tit patients were included in the study and rest were excluded. A separate file was maintained for each patient to note the complication rate of different hernia`s repairs. Patients in group I underwent modified Bassini (35%) and Shouldice repair (15%). Patients in group II underwent Lichtenstein repair (50%).30 (30%) complications were observed. Out of these 23(23%) were in group I and 7(7%) were in group II. All were managed conservatively. The main complications were wound hematoma (9%), Wound infection (3%), scrotal edema (1%), postoperative neuralgia (6%), retention of urine (8%) and recurrence (3%). Wound infection, wound hematoma and recurrence were seen more in group I. Post operative neuralgia was more common in group II. Although follow up was for a shorter period of time and complications like recurrence and post operative neuralgia could not be assessed accurately. It was concluded that Lichtenstein tension free repair is simple and effective method of repairing inguinal hernia, with low complication rates and low recurrence rate. The method is much easier and should be considered in majority of patients with inguinal hernia.

Introducing Fatigue Contour Plot in LS-Pre Post LSDYNA Finite Element Crash Simulation Software

In this study, a computer program for calculating fatigue life of component is developed and introduced in LS-PrePost software. The program is written in Fortran programming language and the fatigue life equations used is taken from well-published literature. The materials covered are steel and aluminum. The developed program is able to read stress, strain and element values from d3plot and the keyword file. Having extracted the output from d3plot and keyword file, the fatigue life is then calculated and presented into a separate file called FATIGUE. The integration of output from FATIGUE will is displayed in LS-PrePost. Finally, the results of fatigue life contour are successfully displayed through LS-PrePost.