-
461
Extracellular matrix shapes cancer stem cell behavior in breast cancer: a mini review
Published 2025-01-01“…Meanwhile, our understanding of the extracellular matrix (ECM) has changed considerably over the last decade. A lot of studies have bit by bit complemented human knowledge regarding how the ECM greatly shapes the behaviors of BCSCs. …”
Get full text
Article -
462
W-Band Vector Millimeter Wave Signal Generation Based on Intensity Modulators Without DAC
Published 2025-01-01“…The measured bit error rate (BER) performance can reach below 7% hard-decision forward-error-correction (HD-FEC) threshold of 3.8 × 10<sup>−3</sup>.…”
Get full text
Article -
463
Method of data interleaving for H.264 video communication
Published 2007-01-01“…According to the NALU of H.264 and the characteristic of real-time video communication,a method of data interleaving for H.264 video communication was presented.Using forward erasure correction,this method could provide the unequal protection mechanism to the H.264 video stream.The more important the H.264 video stream,the stronger protection it could provide.Furthermore,a novel format of RTP payload and encapsulation was also proposed.Simulation results show that the quality of the reconstructed video can be greatly increased with similar bit rates by using the presented method.…”
Get full text
Article -
464
Chosen message attacks method against ECC implementations
Published 2014-05-01“…Chosen-message side-channel analysis attacks for public-key cryptosystems based on scalar multiplications was proposed, where special input point P is chosen to have the features of special y-coordinate to generate noticeable variations on power consumption or other side-channel information, between point doubling and addition operations, rendering distinguishable key bit information. Experimental results demonstrate that the proposed chosen message with simple side channel analysis method could effectively generate the noticeable variations. …”
Get full text
Article -
465
On a clock-controlled keystream generator and its cryptographic properties
Published 2007-01-01“…A new clock-controlled keystream generator was proposed,which was composed of three shift registers: two clock-controlled linear feedback shift registers A,B,and one clock-controlling nonlinear feedback shift register C.Let l1,l2 and l3 denote the length of A,B and C,respectively.The clock-control information is from two bit strings of feedback shift register C,and the times A and B shift are according to the Hamming weights of the two strings,respectively.The period,the linear complexity and the k error linear complexity of the keystream generator are studied,and its security was analyzed.…”
Get full text
Article -
466
Segmentation-based on-demand scalable address assignment algorithm in ZigBee networks
Published 2012-05-01“…Segmentation-based on-demand scalable address assignment algorithm was proposed,which segmented the 16bit address space according to a value predefined by DAAM.When a router lacks addresses,it extended its address space to a new segment.Thus,more addresses could be attained and assigned to children.Meanwhile,the present tree routing protocol was improved to suit the extended addresses.Theoretical and simulation analysis show that our algorithm outperforms DAAM and one of its present improvements in terms of the success rate of address assignment,communication overhead,etc.…”
Get full text
Article -
467
Multi-component network product coding for cooperative relaying
Published 2013-06-01“…Network product coding, a promising and anti-fading technology, can not only outperform the conventional XOR based network coding scheme in bit error rate performance, but also reduce the number of relays required in the network. …”
Get full text
Article -
468
A STEGENOGRAPHY IN 3D MESH BY REARRANGING THE ORDER OF VERTEX PRESENTATION
Published 2013-06-01“…This method also ensures the safety of data; each application can embed a little bit per vertex that not changes to the cover objects.…”
Get full text
Article -
469
Best performance of the UNB modulation VMSK in AWGN channel
Published 2008-01-01“…The detecting method with the lowest bit error rate is analyzed according to the Bayesian criterion using the basic probability method. …”
Get full text
Article -
470
Intersection-based geographical perception routing protocol in VANET
Published 2017-01-01“…In order to solve the problem of the communication performance of degradation,which caused by multi-intersections in city environment and no sensitivity to individual node movements,an intersection-based geographical perception routing protocol in vehicular Ad Hoc network was proposed.The network gateways select road intersections to form the backbone of the route,ensuring a high probability of communication and meeting delay and bit error rate requirements.Mathematical formula of the average delay and the average number of hops were obtained on the basis of a two-way road model.Simulation results show that the transmission delay of IGPR is smaller,the number of hops of IGPR is less,and the communication performance of IGPR is better compared with the FRGR protocols and VRR protocols.…”
Get full text
Article -
471
Design of single-symbol-decodable QOSTBC with full diversity based on pre-processing
Published 2010-01-01“…The method of pre-processing was applied to G-QOSTBC in order to reduce the complexity of decoding,which was single-symbol-decodable.Furthermore,an improved transmit strategy was proposed to achieve full diversity as well as maximum coding gain by constellation rotating and symbol interleaving.Simulation results show that the pro-posed code remarkably decreases the decoding complexity of G-QOSTBC while keeping the similar performance.In ad-dition,the proposed code has the same bit-error-rate(BER) performance as coordinate interleaved orthogonal design(CIOD),but with a lower peak-to-average ratio(PAR).…”
Get full text
Article -
472
On the Performance of Rate-Compatible LDPC Codes under All-Integer Quantization Decoding
Published 2022-01-01“…It is found in this work that the utilization of 4-bit all-integer quantization for MSA-based LDPC decoder is adequate to achieve the decoding performance of the nonquantized case which can be considered as the lower bound on the decoding performance. …”
Get full text
Article -
473
Inter layer up-sampling filtering scheme applied in SVC
Published 2008-01-01“…The experiment results show that our proposed scheme maintains the performances of coded bit-rate and PSNR value without any noticeable loss,and provides significant reduction in computational complexity. …”
Get full text
Article -
474
Round reduction-based fault attack on SM4 algorithm
Published 2016-10-01“…A novel method of fault attack based on round reduction against SM4 algorithm was proposed.Faults were in-jected into the last four rounds of the SM4 encryption algorithm,so that the number of the algorithm's rounds can be re-duced.In known-ciphertext scenario,four traces are enough to recover the total 128 bit master key by screening these faults easily.The proposed attack is made to an unprotected SM4 smart card.Experiment shows that this attack method is efficient,and which not only simplifies the existing differential fault attack,but also improves the feasibility of the attack.…”
Get full text
Article -
475
Further research on public-key cryptosystems based on third-order recurrence sequence
Published 2005-01-01“…At last efficiency analysis of the proposed schemes were provided, and these two encryption schemes need to transfer 2logN and 4logN- bit respectively.…”
Get full text
Article -
476
Shopping for Health: A Menu for One
Published 2013-04-01“…Whether you pop a dish into the microwave after a busy day or spend time cooking a special meal for yourself, shopping for and preparing healthy, low-cost meals for one can be easy and enjoyable with just a little bit of planning. This 4-page fact sheet was written by Morgan Denhard and Wendy Dahl and published by the UF Department of Food Science and Human Nutrition, February 2013. …”
Get full text
Article -
477
An Efficient Code-Based One-Time Blind Signature Scheme for Electronic Forensics
Published 2024-01-01“…The analysis proves that the scheme is secure and meets the requirements of completeness, blindness, and one-more unforgeability. Under the 128-bit security level, our scheme can achieve a signature length of 2.1 kB. …”
Get full text
Article -
478
Lagrange multiplier selection based on SATD for H.265/HEVC
Published 2017-06-01“…In order to improve the coding performance of intra rough mode decision,a SATD-based Lagrange multiplier selection algorithm was proposed for H.265/HEVC.The characteristic of Hadamard transform was first analyzed,and following the new Lagrange multiplier calculation approach based on the distortion measurement of SATD was constructed according to the rate-distortion theory.Then combing the principle of discrete cosine transform,the related parameters were obtained by the formula derivation.Experimental results show that the proposed method supports more accurately intra prediction mode decision,and the reconstruction video quality is improved in average while keeping the same bit-rate.…”
Get full text
Article -
479
New family of multilength multi-wavelength reed-solomon code of OCDMA system
Published 2006-01-01“…These features allow large capacity multimedia transmission with different bit-rate and qual- ity-of-service requirements accommodated simultaneously in OCDMA network system.…”
Get full text
Article -
480
Soft value flipping decoding algorithm for LDPC codes based on adjoint vectors sum
Published 2009-01-01“…By analyzing the soft value distribution while belief propagation defeated, a soft value flipping decoding algo-rithm based on adjoint vectors sum was presented.With translating the error times of check equation which obtained by adjoint vectors sum into error bits distribution parameter and flipping some bit nodes soft value only once at certain itera-tion by a selection regulation, the frame error rate of the proposed algorithm for LDPC codes which have much more correlative rows can be reduced to a larger extent without complexity increase nearly(only O(N)).…”
Get full text
Article