57 results about "IMG" patented technology

The invention is suitable for the technical field of cloud Android system development, and provides a Magisk installation method, device, storage medium and system without guiding mapping, and the method comprises the steps: based on a virtualization interface of the system, injecting and constructing a virtualization environment of Magisk; after a command for starting the system is obtained, dynamically loading a kernel module of the Magisk; creating a virtual mounting layer in the dynamic loading to obtain a virtualized partition; the modification of the Magisk is redirected to the virtualization partition, so that the modification of the Magisk is all limited in the virtualization environment; and configuring an automatic mounting script to regularly and automatically check the mounting state of the virtualized partition, and immediately remounting the virtualized partition when the mounting fails. Through a virtualization technology and a dynamic loading mechanism, the function integration of Magisk is realized on the premise of not modifying boot.img, the installation process is simplified, and the system security and stability are improved.

Example computer-implemented methods and systems for secure random noise generation are disclosed. One example method includes generating, by a first party, n random first bits and n -bit strings. The first party generates, based on the n -bit strings and the n random first bits, n pairs of -bit input messages. The first party performs n 1-out-of-2 oblivious transfers (OTs) of the n pairs of -bit input messages from the first party to a second party. The first party generates, based on the n -bit strings, a first random number. The first party performs, based on the first random number, secure multiparty computation (MPC) that involves the first party and the second party.

A computer-implemented method for processing, on a non-quantum computer, quantum data that represent one or more tensor products of a Pauli operator basis n of size n∈, wherein comprises all the possible tensor products of n matrices of the set S={I, X, Y, Z}, wherein I is a 2×2 identity matrix, and X, Y, Z are the following Pauli matrices:X=[0110],Y=[0-ii0],and⁢ Z=[100-1],is proposed, which comprises: generating a data tree as a data structure that represents the one or more tensor products of the Pauli operator basis n, wherein the one or more tensor products respectively correspond to one or more paths of the data tree each running from a root node of the data tree to a leaf of the data tree, and determining the one or more tensor products of the Pauli operator basis n by performing a tree exploration of the generated data tree.

Embodiments of the present application provide a system, a device, and a method for approximate homomorphic ring encryption. A message z, which is an (n / 4)×(n / 2) matrix may be encoded to a polynomial M(X, Y) in a polynomial ring =[X, Y] / Xn / 2+1, Yn / 2−(Xn / 8−X3n / 8). The polynomial M(X, Y) may then be encrypted to a ciphertext and sent to a target device. Encoding in the polynomial ring allows at least approximate homomorphic manipulation of the subsequent ciphertext for improved security.

Embodiments of the present application provide a system, a device, and a method for approximate homomorphic ring encryption. A message z, which is an (n / 4)×(n / 2) matrix may be encoded to a polynomial M(X, Y) in a polynomial ring =[X, Y] / Xn / 2+1, Yn / 2−(Xn / 8−X3n / 8). The polynomial M(X, Y) may then be encrypted to a ciphertext and sent to a target device. Encoding in the polynomial ring allows at least approximate homomorphic manipulation of the subsequent ciphertext for improved security.

The invention relates to methods and apparatuses for reconstructing phase information in a time series, the time series being derived from a time evolution of an input state acted on by a Hamiltonian, H. First, an input state, |ψ, a total time evolution time, T, and the Hamiltonian, H are received. Next a time evolution of the input state is enacted, using H to generate an absolute value of a first time series, |f1|. In addition at least one additional family of absolute values of time series is generated, each time series being a discrete or continuous function of time t, for t∈[0,T]. Finally, phase information is extracted for the time series of the input state from the absolute values of the first time series and the at least one additional family of absolute values of time series.

A method, system, and computer program product for implementing noise mitigation in dynamic quantum circuits. A condition in a dynamic quantum circuit is identified. A condition refers to a situation or circumstance used to identify or detect a source of noise in the dynamic quantum circuit that may result in an error occurring in the dynamic quantum circuit. For example, the condition may correspond to the idling times, spectator qubits, and idling qubits in cross-talk resistant states (quantum states and in the dynamic quantum circuit. Based on the identified condition, a context-dependent dynamical decoupling sequence is inserted in the dynamic quantum circuit. A context-dependent dynamical decoupling sequence refers to a dynamical decoupling sequence that is inserted in the dynamic quantum circuit based on the context, such as the occurrence of a particular operation (e.g., mid-circuit measurement, the occurrence of a feed-forward operation, the occurrence of qubit shuttling).

A method for changing a bitwidth of an FPGA configuration for an FPGA, the FPGA configuration having a plurality of at least 2n bit-containing data signals with nε and ≥3, and the method having the step: when a threshold of a current consumption and / or a temperature of the FPGA is exceeded and / or a replacement signal is present, replacing k least significant bits of the data signals in each case with a zero with kε and ≥2 during an execution of the FPGA configuration on the FPGA.

Described are various embodiments of a system and method for minimizing a storage mode dephasing error caused by a reset of the auxiliary qubit. In one embodiment, the method comprises the steps of performing on the auxiliary qubit a first ηge pulse causing a |g↔|e transition in said auxiliary qubit, waiting for a designated echo time duration; and performing on the auxiliary qubit a second ηge pulse. The method may further comprise performing a f0g1 reset on the auxiliary qubit.

The application discloses a kind of based on the safe processing and transmission method of DICOM file, client and server, comprising: obtaining DICOM file, the DICOM file includes metadata info and image data img;The metadata info is de-sensitized and is handled, and sensitive data is obtained;The sensitive data is encrypted, and the sensitive data after encryption is written in image data img;The metadata info after de-sensitization processing and the image data img of writing encrypted sensitive data are generated new DICOM file according to preset format, and the new DICOM file is sent to server.The application retains the IMG data and META data of original file, and is stored in somewhere of file itself by safe encryption means, and processed DICOM cannot view METADATA and other private information by ordinary method, but using corresponding authorized reverse method can still analyze and view relevant information.Therefore, the method retains META information under encryption mode, while patient privacy is maximally protected.

This invention discloses a low-dose CT image denoising method, comprising the following steps: S1: establishing a dataset, defining a set of noisy LDCT images x, and a set of high-quality NDCT images y corresponding to the LDCT image set x; S2: constructing a denoising model with parameter θ. Use templates to build Mapping; S3: Training the denoising model using hybrid loss Set the learning rate and momentum parameters, and use error backpropagation to train the denoising model. S4: Image denoising; After preprocessing the LDCT images in the test set, the images are input into the trained denoising model to obtain the corresponding denoised images. The denoising method proposed in this application takes into account the denoising difficulty of different regions of the image, and adaptively balances them by adding weights. It also promotes the generation of image texture details by losing high-frequency information, thus avoiding the denoised image from becoming overly smooth.

The present disclosure relates to error correction coding based on generalized concatenated codes with restricted error values for code-based cryptography. The error correction encoding comprises encoding the information according to a McEliece cryptosystem or according to a Niederreiter cryptosystem, in each case using an error vector containing at most t ε non-zero error values; and a combination of: a permutation operation, a scrambling operation; and a coding operation involving a p-ary generalized concatenated code, GCC, having an error correction capability t up to which it can correct all possible error patterns. The GCC comprises multiple outer codes A(1) with different dimensions n1 and 1=0, . . . ,N, and an inner code B, the inner code B being one of an error correction code over Gaussian integers, an error correction code over Eisenstein integers, or a binary BCH error correction code, wherein q is a natural number with q>2 in the case of an error correction code over Gaussian integers or Eisenstein integers and with q=2 in the case of a binary BCH error correction code. A corresponding decoding method comprises applying erase decoding such that all decoding errors, if any, are recognized during the decoding of the GCC.

A quantum circuit is configured to implement a quantum gradient algorithm when executed on qubits of a quantum computing system. The quantum gradient algorithm includes a phase oracleOSfmdefined by a finite difference approximation with an order greater than zero, and a complexity of the quantum gradient algorithm scales as (√{square root over (k)} / ϵ). The quantum circuit is repeatedly executed on qubits of a quantum computing system to determine a k-dimensional gradient of a function ƒ(x) within an error ϵ at point x0, where ƒ(x) is not a Gevrey class G1 / 2 function.

This disclosure relates to a spoken language understanding (SLU) system and method for training the same. The method comprises: generating a vector ei to represent an ith word token wi based on n word tokens; generating an intent-specific matrix EI and a slot-specific matrix ES based on a sequence of vectors e1:n; generating an intent label-specific matrix VI and slot label-specific matrices VS,K based on the intent-specific matrix EI and the slot-specific matrix ES, respectively; generating a multiple intent representing matrix 1 and a slot representing matrix +2 based on the slot-specific matrix ES, the intent label-specific matrix VI and the slot label-specific matrices VS,k; generating final intent outputs based on the multiple intent representing matrix 1 and the intent label-specific matrix VI; generating final slot output based on the slot representing matrix +2 and the slot-specific matrix ES; adjusting the SLU system based on an objective loss .

An RTOS-based, (Real-Time Operating System-based) multi-application development method and apparatus are provided. The method comprises: compiling and packaging an AWTK, (Toolkit Any Where) engine, a Jerryscript engine, and .c files through a GNU, (Gnu's Not Unix) compiler suite to generate a system.bin file; compiling and packaging xml files, js (JavaScript) files, and image files required by multiple applications through the AWTK engine to generate a fat.img containing the multiple applications; and burning the fat.img containing the multiple applications and the system.bin file into a POS (point of sale) machine with an RTOS. The Jerryscript engine and the AWTK engine support the development of JS language, then resource data (data) are generated from all images, XML (describing image elements and coordinates), and JS files used in the development of APPS, and finally, the resource data are compiled by GCC, (GNU Compiler Collection) to generate an APP.bin, thereby achieving multi-application development.

The invention discloses a time synchronization information security identification method and system based on a self-attention mechanism, and relates to a time synchronization and high-precision clock technology, and the system comprises a data collection and processing module which is used for receiving, caching and processing original time information data, converting the original time information data into variable input of a self-attention matrix calculation module, and outputting the variable input of the self-attention matrix calculation module; the variable input is a preprocessed clock error sequence; the self-attention matrix calculation module is used for receiving the preprocessed clock error sequence, calculating context correlation of clock error data and outputting a probability matrix; the security identification decision module is used for averaging all time points represented by the sequence so as to aggregate and obtain global features; global features are mapped into abnormal probabilities through weights and offsets, and sequence judgment results are divided into normal results and abnormal results through binary decision. According to the invention, illegal information embedded in a complex modulation mode can be effectively identified, and the perception and defense capability of the system to hidden attacks is significantly improved.

A processing system configured to execute one or more processing operations, the execution of the one or more processing operations involving the evaluation of at least one Boolean function. The processing system includes an evaluation device configured to evaluate each Boolean function ƒ defined from 2n over 2, in a variable x of length n over 2n. The evaluation device includes: a differential calculation unit configured to calculate differentials Δƒ(y)=ƒ(y)⊕ƒ(y−1) for each integer intermediary variable y ranging from 1 to 2n−1; an accumulation unit configured to sum, using the XOR operator, the product of the differential Δƒ(y) and cn2<sup2>n< / sup2>−y(x) for each value of y ranging from 1 to 2n−1, according to the following XOR accumulation term ⊕y=12<sup2>n< / sup2>−1(Δƒ(y))cn2<sup2>n< / sup2>−y(x), where cnz(x) is the function associating x to the outbound carry of arithmetic summation x+z; a XOR adder configured to add ƒ(0) to the result of the accumulation unit, wherein the output of the XOR adder provides the result of the evaluation of the Boolean function ƒ.

A method for processing data, comprising receiving a folder attached request at a virtual media service operating on a processor, creating a virtual image data file and lookup table in response to the folder attached request at the virtual media service, preparing content to be populated into a master boot record region in response to the folder attached request and generating a virtual USB device in response to the populated master boot record.

A system for matrix-based public key homomorphic encryption, including a processor of a computing node configured to host a homomorphic encryption module and connected to at least one cloud server and a memory on which are stored machine-readable instructions that when executed by the processor, cause the processor to: acquire plaintext x required to be encrypted; select a size of a matrix and modulus n; select invertible × matrix S over n, wherein n is a residue ring modulo n; compute an invertible × matrix S−1 over n; select two random secret keys (S, S−1) and (K, K−1) of a homomorphic encryption scheme Σ(m), where S and K belong to a ring of ×-matrix Ml(m) over residue ring m with modulus m=pq, where p, q are primes; select (K, K−1) as a master key; use the master key to encrypt all elements of matrices S and S−1; obtain two ciphertexts P1=EncK(S) and P2=EncK(S−1), which both form public key of the Σ(m) including pk=(P1, P2), wherein a secret key is sk=((S, S−1), (K, K−1)); and apply the pk and the sk for encryption and decryption of the plaintext x.

Techniques for secure remote digital storage or transmission of a ciphertext message include determining a maximum storage capacity of an adversary, determining a security parameter k, wherein 1<<k<<m, and determining a prime number n, such that ≤0.3kn. A current public portion of random string α, comprising n random elements, is read from a public site. A secret key z, wherein z has 2k elements, comprising k additive co-primes of n and k multiplicative co-primes of n is shared with a receiving site. An encryption key X, based on the secret key and the current public string, is determined and applied to a plaintext message M of length ≤m to encrypt the plaintext message as Y=M⊕X, thereby creating the ciphertext message Y, which can be placed on a public forum for receiving by a receiving node.

A storage unit stores evaluation function information of an evaluation function of a combinatorial optimization problem including a sum of an objective function and one or more constraint functions including a first constraint function weighted by a first coefficient (t) representing a weight of a first constraint condition. When repeatedly executing a local search for searching for a solution candidate (x*) of the combinatorial optimization problem using the evaluation function information while changing a value of t, a processing unit changes the value of t in a direction in which a value (V(x*)) of the first constraint function corresponding to x* obtained by the local search using each value of t approaches a target value (Vtarget) that is a positive value.

Example computer-implemented methods and systems for secure random noise generation are disclosed. One example method includes generating, by a first party, n random first bits and n -bit first strings. The first party generates, based on the n -bit first strings and the n random first bits, n pairs of -bit input messages. The first party receives n pairs of -bit second strings. The first party performs n 1-out-of-2 random oblivious transfers (ROTs) of the n pairs of -bit input messages from the first party to a second party. The first party generates, based on the n -bit first strings, a first random number. The first party performs, based on the first random number, secure multiparty computation (MPC) that involves the first party and the second party.

A method for processing homomorphic ciphertexts and a computing device, the method comprising: obtaining a sequence of a plurality of first RLWE ciphertexts, a plaintext corresponding to each first RLWE ciphertext comprising a first monomial expression using each coefficient of a first polynomial as a first index; group key ciphertexts are obtained, each group key ciphertext comprises a plurality of RGSW ciphertexts which are binary bits of a second index of a second monomial expression, the binary bits are larger than or equal to 2, and the ith group key ciphertext corresponds to the value of the ith bit in the second index; based on the group key ciphertext, secondary rotation processing is carried out on the sequence of the multiple first RLWE ciphertexts to obtain a sequence of multiple second RLWE ciphertexts, the rotation mode is selected based on the ith group key ciphertext in the ith rotation processing, and the plaintext corresponding to each second RLWE ciphertext comprises a third monomial expression using each coefficient of a second polynomial as a third index; the second polynomial is obtained by multiplying the first polynomial by the second monomial.

The present invention relates to a method for estimating a bit error probability using an error rate ratio of a frame synchronization word. The method comprises the steps of a) defining error rate ratios of frame synchronization words, b) setting a cost function ƒ(pe) in a weighted least squares (WLS) form, c) obtaining a value of γ, and d) deriving an estimated bit error probability value .

The invention discloses a virtual machine encryption method based on Libvirt and QEMU (quick empirical mode unit). The method belongs to the technical field of cloud computing and virtualization. According to the method, the QEMU is expanded, the support of the QEMU for national cryptographic algorithms SM1 and SM4 is increased, a QEMU module is modified, and when a qemu-img command is executed, echoes of-object parameter information are set to be xxxxxxx according to a-object parameter address, and the echoes are used for hiding a disk encryption key. The method comprises the following steps: expanding Libvirt, realizing one-machine one-password of a virtual machine by applying a national password algorithm SM9, generating a secret key pair by using a UUID of the virtual machine as a national password SM9 public key, storing a private key of the SM9 in an encryption chip, encrypting an encryption secret key of the virtual machine and an XML (Extensible Markup Language) by using the SM9 public key, and decrypting the encryption secret key of the virtual machine and the XML by calling an encryption chip interface. According to the method, the problem that the Secret of Libvirt and the XML of the virtual machine leak sensitive information is solved, the problem that the secret key is leaked when the QEMU creates and encrypts the QCOW2 file is solved, and the encryption and decryption performance of the disk file of the virtual machine is improved.

Hybrid embedded system for road vehicles, method and corresponding program The present invention relates to an embedded computer system (SiE) within a road vehicle, which comprises an embedded electronic device (D1) comprising a processor (Px), a RAM (Mem) of predefined size and a mass memory (MS) within which a software image (IMG) is recorded for the execution of an automotive operating system and applications.The automotive operating system is compiled according to a first architecture and the applications are divided into two groups, a first group of applications compiled and optimized for operation according to said first architecture and a second group of applications compiled and optimized for operation according to a second architecture distinct from the first architecture, said software image (IMG) having been constructed to take into account available execution resources of said on-board electronic device (D1). Figure for abstract: Figure 1.

The invention discloses an OTA upgrading method, equipment and device for an application program and a medium, and relates to the technical field of vehicles. A part of the disk partitions in the whole disk partitions adopt the IMG upgrading mode, and compared with the mode that all the disk partitions adopt the IMG upgrading mode, the overall quantity of upgrading packages is reduced. And the other part of disk partitions adopt a file upgrading mode, so that multiple versions of redundant files are totally reduced, and the disk space is saved. And according to the partition address information of the second disk partition, constructing a virtual mirror image environment corresponding to the file upgrading mode, so that the mirror image environment under the file upgrading mode is the same as the mirror image environment under the IMG upgrading mode, and collaborative upgrading of different upgrading modes is realized. The stored application program is upgraded according to the upgrading modes of the first disk partition and the second disk partition, so that OTA upgrading is completed, the advantages and disadvantages of the two upgrading modes are considered, upgrading balance is achieved, it is guaranteed that the occupied disk space is small, and meanwhile the upgrading speed is increased.

The invention provides a method for improving AutoFocus performance, which comprises the following steps of: S1, extracting an edge value by a sobel operator: extracting image edge information through a cv2. Sobel () instruction, and representing as sobelx = cv2. Sobel (img, cv2. CV32F, 1, 0) and sobely = cv2. Sobel (img, cv2. CV32F, 0, 1); s2, solving a variance: af = (np.var (sobelx) + np.var (sobely)) * N, np.var is a function for solving the variance, the formula is that the sum of the variances of sobelx and sobely is multiplied by a coefficient N, and the obtained af is the definition value of the picture; pixel values obtained after Sobel operator processing are distributed more dispersedly, so that the variance can be used as an evaluation criterion because the variance is the measure of the dispersion degree when a random variable or a group of data is measured. Compared with the prior art, the method has the advantages that the performance is improved while the effect is better than that of the prior art, the difference value between the peak value and the peak valley of the optimized method is larger in the aspect of the effect, and therefore the peak value can be found more easily, the calculation amount is small in the aspect of the performance, and the CPU utilization rate and the memory use can be reduced.