84 results about "AN codes" patented technology

Embodiments of the present invention recite a method and system for pre-loading and executing code within the cache. In one embodiment, an indication to operate an electronic device in a sleep state is received. At least one instance of code is loaded into a cache memory in response to receiving the indication. The at least one instance of code is for causing the electronic device to operate in said sleep state. In embodiments of the present invention, the at least one instance of code further comprises a registry setting for a memory controller. The at least one instance of code is then accessed from the cache memory.

A method for determining a delay of a spread data symbol stream comprises the steps of at least partially correlating a signal, which comprises at least first and second spread data symbol streams (300, 301) that are obtained by spreading at least a first and second data symbol stream with a respective first (302) and second code, with said first code (302) to obtain at least two portions (303-1, 303-2) of a Cross-Correlation Function CCF (303), and combining said at least two portions (303-1, 303-2) of said CCF (303) to obtain a combined CCF portion from which a first delay of said first spread data symbol stream is determined, wherein said first code (302) and said second code are composed of chips and wherein the number of chips of said first code (302) is different from the number of chips of said second code. The invention further relates to a computer program, a computer program product, a device and a system.

Error correction and error detection related to DRAM chip failures, particularly adapted server memory subsystems. The application of a code for 128 bit memories is applied to a 20 bit directory store to improve reliability of the directory store memory of the computer system. The code uses ×4 bit DRAM devices organized in a code word of 20 data bit words and 12 check bits. These 12 check bits provide a code capable of 4 bit adjacent error correction within a family (i.e., in a ×4 DRAM) and double bit non-adjacent error detection across the entire 20 bit word, with single bit correction across the word as well. Each device can be though of as a separate family of bits, errors occurring in more than one family are not correctable, but may be detected if only one bit in each of two families is in error. Syndrome generation and regeneration are used together with a specific large code word. Decoding the syndrome and checking it against the regenerated syndrome yield data sufficient for providing the features described.

Embodiments of the invention provide a detection method and apparatus for an Android package. The detection method for the Android package provided by the embodiment of the invention comprises the steps of analyzing a to-be-detected apk (Android package) to obtain the source code of the apk; determining at least one code block of the apk and all code block paths of the apk according to the source code of the apk, wherein all the code block paths comprise at least one path of each code block and other code blocks in at least one code block; determining a code block execution list of the apk according at least one code block and all the code block paths, wherein the code block execution list of the apk comprises the code block execution sequence of each code block on all the code block paths; and performing vulnerability detection on the apk according to each code block and the code block execution sequence of each code block on all the code block paths. By adoption of the embodiments of the invention, the detection accuracy of vulnerability detection of the apk can be improved.

A system and method for MIMO communications is provided. A method includes receiving a data block of P matrices from a transmitter, and determining if operating conditions are met. The method also includes if operating conditions are not met, computing a test position, selecting a codeword based on the test position, and computing a metric. The metric may then be compared with an error radius to determine a validity of the codeword. If the codeword is invalid, another codeword is selected. If the codeword is valid, then the codeword is stored if all matrices have been evaluated, else another matrix is selected for evaluation. If matrices earlier in the data block have untested codewords while all codewords for a matrix being evaluated have been tested, backtracking may be performed. After the codewords for the data block have been found, the stored data may be outputted and processed.

Multiple-access codes are generated using an asymptotically optimal decoding algorithm, such as the Viterbi algorithm. A trellis may be constructed using a number of desired users, at least one code length, and a number of code-chip parameters. A fitness function is derived from a mathematical relationship between the multiple-access codes, and may include some measure of correlation of the codes. The multiple-access codes correspond to paths having optimal path metrics derived from the fitness function. Multiple iterations through the trellis may be performed to refine a selection of multiple-access codes.

The need for separate CRC bits is eliminated by taking advantage of what has been determined to be an embedded error detection capability in a turbo code itself to perform error detection following turbo decoding. Specifically, since the two constituent encoders of a turbo encoder that are used to encode a data packet produce two systematic codes that share the same systematic bits one code, one is used to serve as the parity check for the other. The sign of the log likelihood ratio (LLR) of each systematic bit in a block of decoded data calculated at the end of a turbo decoding cycle is compared with the sign of the LLR of each corresponding bit that was calculated at a previous turbo decoding cycle. If the signs of the LLRs for each comparison do not agree, then a packet error is determined to have occurred; otherwise no packet error is detected.

A method of generating a code sequence comprises populating at least one buffer with initial values based on a received spreading factor and desired code index; receiving a timing strobe; changing the values in the at least one buffer upon receipt of the timing strobe based on an algorithm that is independent of any count value associated with the timing strobe; and outputting at least one code sequence value based on the values in the at least one buffer. An apparatus for generating a code sequence comprises means for populating at least one buffer with initial values based on a received spreading factor and desired code index; means for receiving a timing strobe; means for changing the values in the at least one buffer upon receipt of the timing strobe based on an algorithm that is independent of any count value associated with the timing strobe; and means for outputting at least one code sequence value based on the values in the at least one buffer.

One embodiment provides a method, including: receiving a request to merge at least one code branch with a first code branch, wherein the at least one code branch and the first code branch comprise different versions of software code; and simulating the merge via: identifying the differences between the at least one code branch and the first code branch; generating a differences list comprising a list of (i) added code snippets, (ii) deleted code snippets, and (iii) changed code snippets, wherein code snippets are clustered in the differences list by difference chunks comprising connected code snippets; and building a relationship graph comprising a plurality of nodes and a plurality of edges, wherein each of the plurality of nodes represent a difference chunk and wherein each of the plurality of edges comprise a relationship between two of the plurality of nodes; each of the plurality of edges comprise a cost vector.

The present invention provides a mixed video fault-tolerance method based on multiple description coding and fault concealment. In the method, the imported image sequence firstly undergoes multiple description coding to form N independent video compression coding code streams; the N descriptions are simultaneously transmitted via independent channels; after a receiving end receives the N descriptions, the N descriptions are sent into a decoder for being decoded in order to obtain N image subsequences. According to packet loss, the decoder demarcates an image area; the image subsequences are merged, and finally, a reconstructed image sequence is obtained. Because the present invention exerts the complementarity between the multiple description coding technology and the fault concealment technology, the better effect of system performance is achieved in comparison with the sole utilization of one of the two technologies; wherein, the framework of the multiple description coding of an coding end carries out processing aiming at a sampling environment and can be combined with the newest coding standards, thus resolving the problems of the low-efficiency coding and the complex realization of most prior multiple description coding systems and the defects of the inadequate compatibility of the prior coding criteria.

Method and apparatus for decoding block-coded data which has been transmitted by means of differential modulation. The method first attempts to decode all codewords using an error correcting code, and if at least one codeword is still not decoded, uses a correctly decoded codeword to locate a possibly erroneous code symbol in the at least one codeword, alters the possibly erroneous code symbol, and again attempts to decode the at least one codeword. The invention recognizes that errors in such data typically occur in pairs, and utilizes this property to improve the decoding process.

The invention relates to structure code Chinese character input method. The code includes structure code and stroke code. Structure code is used to encode complex character. Separating different zone according the start stroke of each component of the complex character and classifying according to the structure of every component and its afterward component every combination has a code called structure code. Strode code is used to encode simple character. The invention is easy to be memorized and has a reasonable key mapping. Moreover, it has low coincident code ratio and the input speed is very fast.

The invention discloses a solid real three-dimension voxel coding and transmission method based on a dual-channel DVI interface. The method is characterized in that a computer system codes real three-dimension display data in 2048*1536 pixels per frame, and the RGB gray value and depth value of a display voxel are respectively coded to pixels in even-numbered rows and pixels in odd-numbered rows of an coding frame. When data is transmitted in DVI dual channels, the even channel and the odd channel are respectively used for transmitting the RGB gray value and depth value. Display voxel coding of which the sum of the RGB gray value and depth value is greater than 24 bits is realized, the dual channels are separated and respectively used for transmitting the RGB gray value and depth value to facilitate rear-end data receiving and processing, the display data transmission frame frequency is multiplied, and the method adapts to the constantly-improving color bit depth coding and transmission requirement of a solid real three-dimension system.

A code converting unit(150, 250, 350) encodes input text data based on an code assignment table stored in a storage device that defines a conversion rule for encoding text data, wherein; the code assignment table being generated by assigning a part of character strings assigned to a 1-byte region of a first code assignment table to a 2-byte region of the code assignment table, and by assigning one or more codes each having two or more bytes to at least a part of character strings assigned to the 2-byte region of the code assignment table.

Building a unikernel is disclosed. Code is retrieved from a code repository. One or more unikernel build configuration options are identified. The code is analyzed to determine portions of an operating system required to execute the code. The code is compiled with the determined portions of the operating system into a unikernel that is deployable on a virtual machine to execute the code.

The invention provides a code processing method and device, a server and a storage medium, and belongs to the technical field of computers. The method comprises: based on at least one code branch of any code processing item and a first code processing operation executed on the code branch, determining a first workflow type from at least one standard workflow type, and the first workflow type corresponding to at least one operation specification; for any code branch of the code processing project, obtaining any second code processing operation performed on the code branch, determining a first target operation specification corresponding to the second code processing operation from the at least one operation specification, and comparing the second code processing operation with the first target operation specification; and if the second code processing operation is not matched with the first target operation specification, outputting a monitoring result. In the application, the server can assist the development team to apply the standard workflow more accurately and efficiently, so that the collaborative development efficiency of the development team is higher.

Multiple-access codes are generated using an asymptotically optimal decoding algorithm, such as the Viterbi algorithm. A trellis may be constructed using a number of desired users, at least one code length, and a number of code-chip parameters. A fitness function is derived from a mathematical relationship between the multiple-access codes, and may include some measure of correlation of the codes. The multiple-access codes correspond to paths having optimal path metrics derived from the fitness function. Multiple iterations through the trellis may be performed to refine a selection of multiple-access codes.

Using synthetic inputs to determine if different versions of executable code execute equivalently. First and second versions of code are accessed. Based on recorded execution(s), a first code path is identified in the first code version that lacks execution coverage. A second code path is identified in the second code version that maps to the first code path. Synthetic inputs are generated for the first code path. The first and second code paths are emulated using the generated synthetic inputs, resulting in first outputs for the first code path and second outputs for the second code path. It is determined if there are any differences between the first and second outputs. If so, it is reported that the first and second code paths do not execute equivalently when supplied with the synthetic inputs. Otherwise, it is reported that the first and second code paths execute equivalently.

Emulating execution of second code of a second instruction set architecture (ISA) using a trace of execution of first code of a first ISA. The stores data of an input that was consumed by the first code when executing on the first ISA. It is determined that the stored data of the input is usable as an input to the second code. Difference(s) in location / size / format of the stored data as used by the first code, compared to a location / size / format expected by the second code, is identified. Based on the identified difference(s), transformation(s) are determined that would enable the second code to access and consume the stored data when being emulated on the second ISA. Execution of the second code is emulated on the second ISA using the stored data, including projecting the transformation(s) to enable the second code to access and consume the stored data.

The invention discloses a continuous integration task optimization method and device. The method comprises the following steps: in a software development process, obtaining a source code in a softwareversion library, determining actual consumed time of continuous task integration of at least one code module included in the source code; determining theoretical time consumption of continuous task integration of the at least one code module based on the code quantity of the at least one code module and the actual time consumption, and judging whether the difference between the actual time consumption and the theoretical time consumption of the continuous integration task of the code module in the at least one code module is greater than a preset threshold, and if so, optimizing the continuous integration task of the code module based on a task optimization strategy, so that the time consumption of the continuous integration task of the code module is reduced. The technical problem that in the prior art, the software continuous delivery efficiency is low is solved.

The invention provides a method for improving annotation rate and annotation quality of open source codes. The method comprises the following steps of 1, establishing a code data server, and preprocessing the open source codes; 2, grading difficulty levels of code segments; 3, grading knowledge mastery levels of users; 3, pushing the code segments to the users of the corresponding levels accordingto the levels, thereby enabling the users to perform corresponding operations; and 5, pushing questions automatically generated for the code segments by a system to the users, performing answering bythe users, and if the answering is correct, displaying that the answering of the users is correct, and highlighting answers of the users; and if the answering is not correct, displaying that the answering of the users is wrong, and providing reference answers. According to the method, a batch of code segments with annotations and high-quality code annotations are formed after multi-time cyclic pushing; rich resources are provided for code reuse; the code retrieval efficiency of developers and the code reuse rate in a software development process are effectively improved; and the development efficiency is greatly improved.

Subversive DSV (SDSV) sequences of data symbols having a large absolute value of DSV are extremely valuable in the copy protection of optical discs as they can induce uncorrectable read errors. However, very few SDSV sequences of data symbols can be found in multimodal codes such as Eight-to-Sixteen Modulation (ESM) utilised in DVDs. It is required to select data symbols, for encoding using a multimodal code, which are capable of forcing an encoder to produce at least one subversive sequence of code words. A possible code word for a data symbol is selected if the code word has a large absolute value of DSV and there are no alternative code words, or all alternative code words are equivalent, or all alternatives except one are ruled out by RLL rules.