scholarly journals A Fast and Scalable Algorithm for Prior Art Search

IEEE Access ◽  
2022 ◽  
pp. 1-1
Author(s):  
Juhyun Lee ◽  
Sangsung Park ◽  
Junseok Lee
Keyword(s):  
Scalable Algorithm ◽  
Prior Art

Synthesis, Analytical Characterization and Spectroscopic Investigation of Chloramphenicol Impurity A for the Quality Control of Chloramphenicol and its Formulation as Per International Compendium

2020 ◽  
Vol 17 (5) ◽  
pp. 382-388
Author(s):  
Aparna Wadhwa ◽  
Faraat Ali ◽  
Sana Parveen ◽  
Robin Kumar ◽  
Gyanendra N. Singh
Keyword(s):  
Quality Control ◽  
Synthesis Method ◽  
Analytical Techniques ◽  
International Markets ◽  
Therapeutic Effects ◽  
Reference Standard ◽  
Working Standard ◽  
Prior Art ◽  
New Synthesis ◽  
Synthetic Procedure

Objective: The main aim of the present work is to synthesize chloramphenicol impurity A (CLRMIMP- A) in the purest form and its subsequent characterization by using a panel of sophisticated analytical techniques (LC-MS, DSC, TGA, NMR, FTIR, HPLC, and CHNS) to provide as a reference standard mentioned in most of the international compendiums, including IP, BP, USP, and EP. The present synthetic procedure has not been disclosed anywhere in the prior art. Methods: A simple, cheaper, and new synthesis method was described for the preparation of CLRM-IMP-A. It was synthesized and characterized by FTIR, DSC, TGA, NMR (1H and 13C), LC-MS, CHNS, and HPLC. Results: CLRM-IMP-A present in drugs and dosage form can alter the therapeutic effects and adverse reaction of a drug considerably, it is mandatory to have a precise method for the estimation of impurities to safeguard the public health. Under these circumstances, the presence of CLRM-IMP-A in chloramphenicol (CLRM) requires strict quality control to satisfy the specified regulatory limit. The synthetic impurity obtained was in the pure form to provide a certified reference standard or working standard to stakeholders with defined potency. Conclusion: The present research describes a novel technique for the synthesis of pharmacopoeial impurity, which can help in checking/controlling the quality of the CLRM in the international markets.

scholarly journals High Area-Efficient Parallel Encoder with Compatible Architecture for 5G LDPC Codes

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 700
Author(s):  
Yufei Zhu ◽  
Zuocheng Xing ◽  
Zerun Li ◽  
Yang Zhang ◽  
Yifan Hu
Keyword(s):  
High Performance ◽  
Ldpc Codes ◽  
Low Complexity ◽  
Cmos Technology ◽  
Area Efficiency ◽  
Prior Art ◽  
New Radio ◽  
High Area ◽  
Significant Area ◽  
Area Efficient

This paper presents a novel parallel quasi-cyclic low-density parity-check (QC-LDPC) encoding algorithm with low complexity, which is compatible with the 5th generation (5G) new radio (NR). Basing on the algorithm, we propose a high area-efficient parallel encoder with compatible architecture. The proposed encoder has the advantages of parallel encoding and pipelined operations. Furthermore, it is designed as a configurable encoding structure, which is fully compatible with different base graphs of 5G LDPC. Thus, the encoder architecture has flexible adaptability for various 5G LDPC codes. The proposed encoder was synthesized in a 65 nm CMOS technology. According to the encoder architecture, we implemented nine encoders for distributed lifting sizes of two base graphs. The eperimental results show that the encoder has high performance and significant area-efficiency, which is better than related prior art. This work includes a whole set of encoding algorithm and the compatible encoders, which are fully compatible with different base graphs of 5G LDPC codes. Therefore, it has more flexible adaptability for various 5G application scenarios.

scholarly journals FastSK: fast sequence analysis with gapped string kernels

2020 ◽  
Vol 36 (Supplement_2) ◽  
pp. i857-i865
Author(s):  
Derrick Blakely ◽  
Eamon Collins ◽  
Ritambhara Singh ◽  
Andrew Norton ◽  
Jack Lanchantin ◽  
...  
Keyword(s):  
Sequence Analysis ◽  
Dna Sequences ◽  
English Language ◽  
Computation Time ◽  
Entity Recognition ◽  
Supplementary Information ◽  
Support Vector ◽  
Homology Detection ◽  
Scalable Algorithm ◽  
String Kernels

Abstract Motivation Gapped k-mer kernels with support vector machines (gkm-SVMs) have achieved strong predictive performance on regulatory DNA sequences on modestly sized training sets. However, existing gkm-SVM algorithms suffer from slow kernel computation time, as they depend exponentially on the sub-sequence feature length, number of mismatch positions, and the task’s alphabet size. Results In this work, we introduce a fast and scalable algorithm for calculating gapped k-mer string kernels. Our method, named FastSK, uses a simplified kernel formulation that decomposes the kernel calculation into a set of independent counting operations over the possible mismatch positions. This simplified decomposition allows us to devise a fast Monte Carlo approximation that rapidly converges. FastSK can scale to much greater feature lengths, allows us to consider more mismatches, and is performant on a variety of sequence analysis tasks. On multiple DNA transcription factor binding site prediction datasets, FastSK consistently matches or outperforms the state-of-the-art gkmSVM-2.0 algorithms in area under the ROC curve, while achieving average speedups in kernel computation of ∼100× and speedups of ∼800× for large feature lengths. We further show that FastSK outperforms character-level recurrent and convolutional neural networks while achieving low variance. We then extend FastSK to 7 English-language medical named entity recognition datasets and 10 protein remote homology detection datasets. FastSK consistently matches or outperforms these baselines. Availability and implementation Our algorithm is available as a Python package and as C++ source code at https://github.com/QData/FastSK Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Scalable algorithm for solving 3D contact problems with friction

PAMM ◽  
2007 ◽  
Vol 7 (1) ◽  
pp. 1025201-1025202
Author(s):  
Radek KucÌŒera ◽  
Jaroslav Haslinger ◽  
Zdeněk Dostál
Keyword(s):  
Contact Problems ◽  
Scalable Algorithm

scholarly journals A scalable algorithm for the optimization of neural network architectures

2021 ◽  
pp. 102788
Author(s):  
Massimiliano Lupo Pasini ◽  
Junqi Yin ◽  
Ying Wai Li ◽  
Markus Eisenbach
Keyword(s):  
Neural Network ◽  
Network Architectures ◽  
Scalable Algorithm ◽  
Neural Network Architectures

scholarly journals Giving Credit Where Credit Is Due: Properly Citing Relevant Prior Art

2021 ◽  
Author(s):  
Craig W. Lindsley ◽  
Jacob M. Hooker ◽  
Dennis C. Liotta
Keyword(s):  
Prior Art

scholarly journals Reconfigurable Multiband Operation for Wireless Devices Embedding Antenna Boosters

Electronics ◽  
2021 ◽  
Vol 10 (7) ◽  
pp. 808
Author(s):  
Jaume Anguera ◽  
Aurora Andújar ◽  
José Luis Leiva ◽  
Oriol Massó ◽  
Joakim Tonnesen ◽  
...  
Keyword(s):  
Ground Plane ◽  
Wireless Devices ◽  
Matching Network ◽  
Smart Meters ◽  
Efficient Operation ◽  
Frequency Bands ◽  
Tunable Capacitor ◽  
Prior Art ◽  
Wireless Device ◽  
Reconfigurable Matching Network

Wireless devices such as smart meters, trackers, and sensors need connections at multiple frequency bands with low power consumption, thus requiring multiband and efficient antenna systems. At the same time, antennas should be small to easily fit in the scarce space existing in wireless devices. Small, multiband, and efficient operation is addressed here with non-resonant antenna elements, featuring volumes less than 90 mm3 for operating at 698–960 MHz as well as some bands in a higher frequency range of 1710–2690 MHz. These antenna elements are called antenna boosters, since they excite currents on the ground plane of the wireless device and do not rely on shaping complex geometric shapes to obtain multiband behavior, but rather the design of a multiband matching network. This design approach results in a simpler, easier, and faster method than creating a new antenna for every device. Since multiband operation is achieved through a matching network, frequency bands can be configured and optimized with a reconfigurable matching network. Two kinds of reconfigurable multiband architectures with antenna boosters are presented. The first one includes a digitally tunable capacitor, and the second one includes radiofrequency switches. The results show that antenna boosters with reconfigurable architectures feature multiband behavior with very small sizes, compared with other prior-art techniques.

Sign in / Sign up

Export Citation Format

Share Document