Abstract: The present disclosure provides compounds of Formula (I) or a salt, enantiomer, stereoisomer, solvate, isotopically enriched analog, prodrug, or polymorph thereof, and uses thereof. The present disclosure also provides pharmaceutical compositions comprising, as an active ingredient, the compound of Formula (I) or a salt, enantiomer, stereoisomer, solvate, isotopically enriched analog, prodrug, or polymorph thereof, and uses thereof. The series of compounds designed and synthesized in the present disclosure can effectively prevent and/or treat diseases or disorders associated with NAMPT.

Abstract: A method for implementing formal verification of an optimized multiplier via symbolic computer algebra (SCA)-satisfiability (SAT) synergy includes: systematically recovering, by a reverse engineering algorithm, an adder tree from an optimized multiplier; 2) generating, by a constraint satisfaction algorithm, a reference multiplier only by using an adder based on a constraint condition; and 3) combining, by an SCA-based and SAT-based verification method, complementary advantages of SCA and SAT. In the verification framework, the method introduces a reference multiplier generator for generating a correct reference multiplier. The correct reference multiplier has both a structure similar to a structure of the optimized multiplier and a clear adder boundary. The clear adder boundary allows proving correctness of the correct reference multiplier through SCA-based verification.

Abstract: A fast and energy-efficient K-nearest neighbors search accelerator for a large-scale point cloud is provided. A nearest sub-voxel-selection (NSVS) framework that performs search based on a double-segmentation-voxel-structure (DSVS) search structure is constructed, and a K-nearest neighbors search algorithm for a large-scale point cloud map is implemented on a field programmable gate array (FPGA). The K-nearest neighbors search accelerator is configured for constructing the DSVS search structure, and searching for K-nearest neighbors based on the DSVS search structure. An experimental result on a KITTI dataset shows that the K-nearest neighbors search accelerator has a search speed 9.1 times faster than a state-of-the-art FPGA implementation. In addition, the K-nearest neighbors search accelerator also achieves an optimal energy efficiency, and the optimal energy efficiency is 11.5 times and 13.5 times higher than state-of-the-art FPGA and GPU implementations respectively.

Abstract: Disclosed are a cyclopiperidine compound, a preparation method therefor, and a use thereof. The cyclopiperidine compound of the present invention is represented by formula I?. The cyclopiperidine compound of the present invention has a better effect for suppressing depression and has good application prospects.

Abstract: Described herein are systems and methods for training machine learning models to generate three-dimensional (3D) motions based on light detection and ranging (LiDAR) point clouds. In various embodiments, a computing system can encode a machine learning model representing an object in a scene. The computing system can train the machine learning model using a dataset comprising synchronous LiDAR point clouds captured by monocular LiDAR sensors and ground-truth three-dimensional motions obtained from IMU devices. The machine learning model can be configured to generate a three-dimensional motion of the object based on an input of a plurality of point cloud frames captured by a monocular LiDAR sensor.

Abstract: Provided are antibodies or fragments thereof having binding specificity to anti-IL-18 receptor alpha or beta. Methods of using the antibodies or fragments thereof for treating and diagnosing diseases such as cancer and inflammatory and autoimmune diseases are also provided.

Abstract: The present disclosure relates to compounds of formula (I) and their anti-tumor uses, and their intermediates of formula (III), and uses of the intermediates. The compound of formula (I) has a degrading effect on a specific target protein, which is mainly composed of three parts. The first part is a small molecule compound (SMBP, Small Molecules Binding Protein) that can bind to a protein, the second part LIN is a linker, and the three-part ULM is a ubiquitin ligand (ULM, Ubiquitin Ligase Binding Moiety), wherein SMBP is covalently bound to LIN, and LIN is covalently bound to ULM. A series of compounds designed and synthesized in the present disclosure have a wide range of pharmacological activities, including the functions of degrading specific proteins and/or inhibiting activities of specific proteins, and thus can be used in related tumor treatments.

Abstract: The present disclosure relates to compounds of formula (I) and their anti-tumor uses, and their intermediates of formula (III), intermediates of formula (IV), and uses of the intermediates. The compound of formula (I) has a degrading effect on a specific target protein, which is mainly composed of three parts. The first part is a small molecule compound (SMBP, Small Molecules Binding Protein) that can bind to a protein, the second part LIN is a linker, and the three-part ULM is a ubiquitin ligand (ULM, Ubiquitin Ligase Binding Moiety), wherein SMBP is covalently bound to LIN, and LIN is covalently bound to ULM. A series of compounds designed and synthesized in the present disclosure have a wide range of pharmacological activities, including the functions of degrading specific proteins and/or inhibiting activities of specific proteins, and thus can be used in related tumor treatments.

Abstract: A max-flow/min-cut solution algorithm for early terminating a push-relabel algorithm is provided. The max-flow/min-cut solution algorithm is used for an application that does not require an exact maximum flow, and includes: defining an early termination condition of the push-relabel algorithm by a separation condition and a stable condition; determining that the separation condition is satisfied if there is no source node s, s?S, in the set T at any time in an operation process of the push-relabel algorithm; determining that the stable condition is satisfied if there is no active node in the set T; and terminating the push-relabel algorithm if both the separation condition and the stability condition are satisfied. The early termination technique is proposed to greatly reduce redundant computations and ensure that the algorithm terminates correctly in all cases.

Abstract: The provided is a stream processing-based non-blocking oriented FAST and rotated BRIEF (ORB) feature extraction accelerator implemented by a field programmable gate array (FPGA), which mainly includes two innovations: A stream processing-based non-blocking hardware architecture and a cache management algorithm are provided. The accelerator precisely controls and buffers each column of an rBRIEF descriptor computation window by using an algorithm, allowing to receive a new input pixel stream while computing a descriptor, thereby achieving non-blocking processing. An efficient hardware sorting design embedded in an accelerator is provided. Based on a count sorting algorithm, minimal resources are used to implement rBRIEF sorting on hardware, and the rBRIEF sorting is embedded in the accelerator. The accelerator ensures quality of a feature point while achieving high-speed feature point extraction, without significantly reducing accuracy of ORB_SLAM and other algorithms.

Abstract: Provided are base editors containing a cytidine and a catalytically inactive version of Lachnospiraceae bacterium Cpf1 (LbCpf1). The new base editors have greatly improved editing efficiency and fidelity as compared to Cas9-based base editors, and have different editing windows.

Abstract: An automatic overclocking controller based on circuit delay measurement is provided, including a central processing unit (CPU), a clock generator, and a timing delay monitor (TDM) controller. Compared with the prior art, the present disclosure has following innovative points: A two-dimension-multi-frame fusion (2D-MFF) technology is used to process a sampling result, to eliminate sampling noise, and an automatic overclocking controller running on a heterogeneous field programmable gate array (FPGA) can automatically search for a highest frequency at which an accelerator can operate safely.

Abstract: Described herein are methods and non-transitory computer-readable media of a computing system configured to obtain a plurality of images of an object from a plurality of orientations at a plurality of times. A machine learning model is encoded to represent a continuous density field of the object that maps a spatial coordinate to a density value. The machine learning model comprises a deformation module configured to deform the spatial coordinate in accordance with a timestamp and a trained deformation weight. The machine learning model further comprises a neural radiance module configured to derive the density value in accordance with the deformed spatial coordinate, the timestamp, a direction, and a trained radiance weight. The machine learning model is trained using the plurality of images. A three-dimensional structure of the object is constructed based on the trained machine learning model.

Abstract: An image rendering system for rendering two-dimensional images in real-time. The image rendering system can receive an implicit representation model of a three-dimensional image. The image rendering system can construct, based on voxel coordinates, a three-dimensional image based on the implicit representation model. The image rendering system can rotate the three-dimensional image to an orientation in a computing space based on a user input. The image rendering system can generate a two-dimensional image based on the rotated three-dimensional image.

Abstract: A fusion protein which may comprise a first nCas9 fragment, a chimeric insertion fragment, a second nCas9 fragment and two UGI fragments from N-terminus to C-terminus, wherein the chimeric insertion fragment is selected from APOBEC1 fragment or APOBEC3A fragment for cytosine deamination at the target site. The fusion protein may comprise a first nCas9 fragment, a chimeric insertion fragment and a second nCas9 fragment from N-terminus to C-terminus, wherein the chimeric insertion fragment is TadA-TadA* for cytosine deamination at the target site. The present disclosure provides a novel base editing tool that is compatible with insertion of various deaminases on the chimeric sites of nCas9. Compared with nCas9 terminal fusion base editor, the base editing tool of the present invention significantly reduce off-targeting on both DNA and RNA, while maintaining specific targeted base editing efficiency, with higher specificity and favorable industrialization prospects.

Abstract: A method for catalytic synthesis of ammonia under normal pressures, including: performing a reaction of hydrogen and nitrogen to synthesize ammonia under normal pressures by taking a liquid alloy as a catalyst in a reactor, where the reactor contains a molten salt, the density of the molten salt is smaller than that of the liquid alloy, and the molten salt is used for providing a reaction interface and isolating the liquid alloy from being introduced impurities. The first metal reacts with the nitrogen to produce the metal nitride, and the molten salt provides a new reaction interface for the metal nitride to react with the hydrogen to synthesize ammonia, so that ammonia is produced continuously. In addition, the molten salt prevents the liquid alloy from contacting with the oxygen and the water vapor, which prevents the liquid alloy from being oxidized, thus prolonging its service life.

Abstract: The present disclosure relates to the field of biotechnology, in particular to a base editing tool and use thereof. The present disclosure provides a fusion protein comprising a first nCas9 fragment, a chimeric insertion fragment, a second nCas9 fragment and two UGI fragments from N-terminus to C-terminus, wherein the chimeric insertion fragment is selected from APOBEC1 fragment or APOBEC3A fragment. The present disclosure provides a novel base editing tool that is compatible with insertion of various deaminases on the chimeric sites of nCas9. Compared with nCas9 terminal fusion base editor, the base editing tool of the present invention significantly reduce of off-targeting on both DNA and RNA, while maintaining specific targeted base editing efficiency, with higher specificity and favorable industrialization prospects.

Abstract: A computing system for encoding a machine learning model comprises a plurality of layers and a plurality of computation units. A first set of computation units are configured to process data at a first bit width. A second set of computation units are configured to process at a second bit width. The first bit width is higher than the second bit width. A memory is coupled to the computation units. A controller is coupled to the computation units and the memory. The controller is configured to provide instructions for encoding the machine learning model. The first set of computation units are configured to compute a first set of layers and the second set of computation units are configured to compute a second set of layers.

Abstract: A graphics processing unit (GPU)-based logic rewriting acceleration method comprising parallelizing sub-procedures of And-Inverter Graph (AIG)-based logic rewriting. A recursive sub-procedure of the AIG-based logic rewriting is redesigned to be non-recursive, to provide sufficient parallelism for a GPU. In order to parallelize a replacement step on the GPU, the present disclosure uses a lock to ensure mutually exclusive access, which inevitably damages scalability of inter-node parallelism. In order to fully utilize the inter-node parallelism on a large scale, the present disclosure proposes a work scheduler that adds nodes with non-overlapping maximum fan-out-free cones (MFFCs) to a group, such that nodes in an MFFC can be deleted simultaneously without a conflict. In order to simultaneously create and delete a same node, the present disclosure also proposes a GPU-friendly graphical data structure to support these concurrent operations.

Abstract: A computer-implemented method of generating editable free-viewport videos is provided. A plurality of video of a scene from a plurality of views is obtained. The scene comprises includes an environment and one or more dynamic entities. A 3D bounding-box is generated for each dynamic entity in the scene. A computer device encodes a machine learning model including an environment layer and a dynamic entity layer for each dynamic entity in the scene. The environment layer represents a continuous function of space and time of the environment. The dynamic entity layer represents a continuous function of space and time of the dynamic entity. The dynamic entity layer includes a deformation module and a neural radiance module. The deformation module is configured to deform a spatial coordinate in accordance with a timestamp and a trained deformation weight. The neural radiance module is configured to derive a density value and a color.