Search

We describe the development of specific measurement protocols to improve the accuracy of surface metrology of x-ray mirrors using a dedicated commercial instrument based on wavefront sensing techniques. This instrument, SHARPeR, uses measurements from a Shack–Hartmann wavefront sensor combined with a sub-aperture stitching method to provide two-dimensional maps of the surface slope errors and can measure curved mirrors above 1 m radii. In this paper, we describe the results of measurement methods developed on a SHARPeR system installed at the European Synchrotron (ESRF) to reduce the contribution of systematic errors to measurements of strongly curved spherical and aspherical x-ray mirrors with intrinsic slope errors of the order of 100–200 nrad rms. We demonstrate how this commercial integrated instrument can provide measurements of these mirrors with comparable accuracy to those measured with a long trace profiler.

Reversible logic is a computing paradigm that has attracted significant attention in recent years due to its properties that lead to ultra-low power and reliable circuits. Reversible circuits are fundamental, for example, for quantum computing .Since addition is a fundamental operation, designing efficient adders is a cornerstone in the research of reversible circuits. Residue Number Systems (RNS) has been as a powerful tool toprovide parallel and fault-tolerant implementations of computations where additions and multiplications are dominant. In this paper, for the first time in the literature, we propose the combination of RNS and reversible logic. The parallelism of RNS is leveraged to increase the performance of reversible computational circuits. Being the most fundamental part in any RNS, in this work we propose the implementation of different adders, namely ripple carry adder, carry save adder, carry look ahead adder using reversible logic. Analysis and comparison with different adders for modular addition are designed using reversible gates with minimum overhead in comparison to regular Brunt Kung modulo-adders.

The technologies like quantum computing, Nanotechnology is emerging due to the greater research in reversible logic. It has the power reduction capability the same mechanism is also having in the quantum computing. Designing a quantum circuit among various combinational circuits the decoder has capability to change binary information of input lines to distinct output lines and also there are many applications where decoder is the main basic component. In this paper a comprehensive introduction of basic gates used to design n to 2n Universal Quantum decoder, here n represents the no of inputs are mentioned. The proposed 2:4 decoder circuit is designed using a universal reversible Fredkin gates and Feynman gate. The proposed work is simulated using IBM Quantum Composer. In comparison to existing quantum decoders the proposed decoder design has optimum values in all the parameters considered.

Sequence alignment is common nowadays as it is used in computational biology or Bioinformatics to determine how closely two sequences are similar. There are many computational algorithms developed over the course of time to not only align two sequences. The first algorithms developed were based on a technique called Dynamic Programming which rendered them slow but produce optimal alignment. Today, however heuristic approach algorithms are popular as they are faster and yet produce near optimal alignment. In this paper, we are going to improve on a heuristic algorithm called MASAA (Multiple Anchor Staged Local Sequence Alignment Algorithm) - which we published previously. This new algorithm appropriately called MASAA - S stands for MASAA Sensitive. The algorithm is based on suffix tree data structure to identify anchors first, but to improve sensitivity, we employ adaptive seeds, and shorter perfect match seeds in between the already identified anchors. When the Anchors are separated by a greater distance than a threshold 'd', we exclude such anchors. We tested this algorithm on a randomly generated sequences, and Rosetta dataset where the sequence length ranged up to 500 thousand.

Automation systems with applied robotics have already been established in industrial applications for many years. In the field of life sciences, a comparable high level of automation can be found in the areas of bioscreening and high-throughput screening. Strong deficits still exist in the development of flexible and universal fully automated systems in the field of analytical measurement. Reasons are the heterogeneous processes with complex structures, which include sample preparation and transport, analytical measurements using complex sensor systems, and suitable data analysis and evaluation. Furthermore, the use of nonstandard sample vessels with various shapes and volumes results in an increased complexity. The direct use of existing automation solutions from bioscreening applications is not possible. A flexible automation system for sample preparation, analysis, and data evaluation is presented in this article. It is applied for the determination of cholesterol in biliary endoprosthesis using gas chromatography-mass spectrometry (GC-MS). A dual-arm robot performs both transport and active manipulation tasks to ensure human-like operation. This general robotic concept also enables the use of manual laboratory devices and equipment and is thus suitable in areas with a high standardization grade.

In the present research work the output responsesMaterial Removal Rate (MRR) and Surface Roughness (SR)are studied and analyzed by varying the turning parameterslike cutting speed, feed and depth of cut. The conventionalturning of Stainless steel, Normalized steel and Aluminiumwork materials is carried out by using different cutting toolinserts. The data was compiled into MINITAB ® 17 foranalysis. Design of Experiments (DOE) was conducted toanalyze the impact of cutting parameters on the MaterialRemoval Rate (MRR) and Surface Roughness (SR) by usingTaguchi method. By conducting Analysis of Variance(ANOVA) the results are optimized to determine minimumsurface roughness and maximum MRR. Response SurfaceOptimizer was used for obtaining optimum settings to carryout the machining operations effectively.

Braille is a vital technique of learning for visually challenged individuals. It is the method which empowers them to get educated. To make the braille cell low cost, energy efficient and minimum latency an attempt is made in this paper. This system can be used for applications like braille keypads and braille monitors. In this system there are two outputs in the form of an audio and the tactile. This helps visually challenged individual to sense the output and listen to it simultaneously. In this work serial communication is used to send and receive data.

To increase the energy and spectral efficiency in the field of communication, a new technique named Device to Device Communication (D2D) is proposed. This is very essential as there has been a massive growth in the number of connected devices now a days. D2D takes advantage of the physical proximity of communication devices and enables direct communications between them (i.e.) devices communicate with each other without the intermediate nodes. This proximity of devices helps in achieving extremely high bit rates, low delays, and low power consumption. Although there are many benefits of D2D, the implementation of it is very strenuous. There are a number of challenges need to be addressed before establishing a successful D2D connection. One among those is the clustering of devices. Clustering is the grouping of devices based on a particular criteria. In this paper, we first created nodes, found which devices are capable of forming a D2D link, divided them into clusters and then found the cluster head (CH) for each cluster. Finally we plotted graphs for throughput versus the threshold SNR and the distance between the links.

This paper proposes an unsupervised debate stance classification algorithm. In other words, finding the side a post author is taking in an online debate. Stance detection has a complementary role in information retrieval, opinion mining, text summarization, etc. Existing stance detection techniques are not able to effectively handle two challenges: determine whether a given post is a debate or not? If the post is a debate on a given topic, correctly classify the side that the post author is taking. In this paper, we propose techniques that addresses both the above issues. Compared to existing technique, our technique gives 30% improvement in detection of whether a post is a debate or not. Our technique is able to find the side that an author is taking in a debate by 10% higher F1 score compared to existing work. We achieve this improvement by using new syntactic rules, better aspect popularity detection, co-reference resolution, and a novel integer linear programming model to solve the problem.

In this paper, we present TRAFAN, a system to analyze traffic activities of various cities in India. Traffic information is publicly available on various social networking sites. We aim to analyze the transportation data moving through the most popular social networking site Facebook. We take the data from various Facebook traffic pages as input to our system. Our system performs three important functions: fast browsing through keyword search result, compare Facebook pages and get statistical summaries about the Facebook pages. Our system can assist the government organizations to know the most chaotic traffic issue in a city. Organizations can retrieve all the problems in a city related to a traffic issue. The system also allows to compare the severity of an issue across the cities. We perform our experiment on Facebook pages containing 21,000 posts and 0.5 million reactions. We show through experimental results that our system effectively analyzes the traffic activities of cities. We present the results using information visualization techniques to improve the usability of our proposed TRAFAN interface.

An intrusion detection system (IDS) is hardware, software or a combination of two, for monitoring network or system activities to detect malicious signs. In computer security, designing a robust intrusion detection system is one of the most fundamental and important problems. The primary function of system is detecting intrusion and gives alerts when user tries to intrusion on timely manner. In these techniques when IDS find out intrusion it will send alert massage to the system administrator. Anomaly detection is an important problem that has been researched within diverse research areas and application domains. This survey tries to provide a structured and comprehensive overview of the research on anomaly detection. From the existing anomaly detection techniques, each technique has relative strengths and weaknesses. The current state of the experiment practice in the field of anomaly-based intrusion detection is reviewed and survey recent studies in this. This survey provides a study of existing anomaly detection techniques, and how the techniques used in one area can be applied in another application domain.

We present in this paper a new approach towards detection and correction of security vulnerabilities in Java Web applications using program slicing and transformation. Our vulnerability detector is based on an extended program slicing algorithm and handles taint propagation through strings. Our prototype is implemented as an Eclipse plug-in and leverages the WALA library to fix XSS Vulnerabilities in an interactive manner. We also show that our approach offers a good performance, both computationally and in terms of vulnerabilities found.

Pairwise sequence alignment is a fundamental compute-intensive problem in bioinformatics that has helped researchers analyse biological sequences. The analysis has helped biologists detect pathogens, develop drugs, and identify common genes. The biological sequence database has been growing rapidly due to new sequences being discovered. This has brought many new challenges including sequence database searching and aligning long sequences. To solve these problems, many sequence alignment algorithms have been developed. These algorithms employ various techniques to efficiently find optimal or nearly-optimal alignments. In this paper, we present the popular past and recent work on both local and global pairwise sequence alignment algorithms. In addition to identifying the techniques used, the advantages and limitations of the algorithms are also presented.

DNA pairwise sequence alignment has been a subject of great interest in the past and still evokes large interest. Recent algorithms have either been slow and sensitive or fast and less sensitive. Here, we present a new algorithm which is fast and at the same time relatively sensitive. To increase the speed, we first build a suffix tree for both sequences and the alignment is triggered by the maximum matching substring. The algorithm employs mismatch seeds to increase both sensitivity and speed in the later stages. We tested our algorithm on randomly generated sequences of length up to 500 thousand and used Rosetta dataset to test the sensitivity of the algorithm.