Effect of sulfinate salt on bonding and polymerization of adhesive to intracoronally bleached dentin by Napatsorn Piyanuluk, Kittisak Sanon, Pasiree Thongthai, Pharsiri Sirirangsee, Raju Botta, Thitaphat Ngernsutivorakul, Varinee Srimahachota, Citra Kusumasari, Dini Asrianti, Junji Tagami

Get full text

Research on strong robustness watermarking algorithm based on dynamic difference expansion by Tianqi WANG, Yingzhou ZHANG, Yunlong DI, Dingwen LI, Linlin ZHU

“…A surge in the amount of information comes with the rapid development of the technology industry.Across all industries, there is a need to collect and utilize vast amounts of data.While this big data holds immense value, it also poses unprecedented challenges to the field of data security.As relational databases serve as a fundamental storage medium for data, they often contain large-scale data rich in content and privacy.In the event of a data leak, significant losses may occur, highlighting the pressing need to safeguard database ownership and verify data ownership.However, existing database watermarking technologies face an inherent tradeoff between improving watermark embedding capacity and reducing data distortion.To address this issue and enhance watermark robustness, a novel robust database watermarking algorithm based on dynamic difference expansion was introduced.The QR code was employed as the watermark, the SVD decomposition of the low frequency part of the image was utilized after Haar wavelet transform.By extracting specific feature values and using residual feature values as the watermark sequence, it was ensured that the same-length watermark sequence contains more information and the embedded watermark length can be reduced.Furthermore, by combining the adaptive differential evolution algorithm and the minimum difference algorithm, the optimal embedding attribute bits were selected to alleviate the problems of low computational efficiency, high data distortion and poor robustness of traditional difference expansion techniques in embedding watermarks, and to improve the embedding capacity of watermarks while reducing the distortion of data.Experimental results demonstrate that the proposed algorithm achieves a high watermark embedding rate with low data distortion.It is resilient against multiple attacks, exhibiting excellent robustness and strong traceability.Compared to existing algorithms, it offers distinct advantages and holds great potential for broad application in the field of data security.…”
Get full text

Taming large-scale genomic analyses via sparsified genomics by Mohammed Alser, Julien Eudine, Onur Mutlu

“…Abstract Searching for similar genomic sequences is an essential and fundamental step in biomedical research. State-of-the-art computational methods performing such comparisons fail to cope with the exponential growth of genomic sequencing data. …”
Get full text

Homomorphic encryption location privacy-preserving scheme based on Markov model by Kai ZHOU, Chang-gen PENG, Yi-jie ZHU, Jian-qiong HE

“…So the user's location privacy and query privacy can be protected. Meanwhile, the computability and confidentiality of homomorphic encryption ciphertext were used to realize the statistical analysis of cipher-text-oriented data and the secure storage of private data.…”
Get full text

Improved integral attack——random linear distinguish and key recovery attack by Shaoyu DU

“…Based on the integral attack and collision attack of four rounds of AES, a random linear distinguish attack against four rounds of SP block ciphers was proposed, which took advantage of the non-uniformity of linear biases’ distribution between some blocks of plaintext and inner state.Combined with precomputation, a key recovery attack against four rounds of AES-like block ciphers was proposed.For LED-64, the results of distinguish attack and key recovery attack were given.Therein for LED-64 of 1-Step, the probability of successful distinguish attack is 85% under the condition that the data complexity is 2⁸ and the computational complexity is 2¹⁶ basic operation.For LED-64 of 2-Step, the calculation complexity of the key recovery attack under the condition of related key is 2¹⁴ basic operation, the data complexity is 2⁸, and the precomputation storage complexity is 2³⁸ half bytes.…”
Get full text

Mapeamento ambiental integrado: município de Porto Alegre, RS by Heloise Canal, Roberto Verdum

“…The storage, processing, and output data were performed using application specific computational manipulation of geographic information - Geographic Information System (GIS). …”
Get full text

Multi-authority attribute-based encryption with efficient revocation by Kai ZHANG, Jian-feng MA, Hui LI, Jun-wei ZHANG, Tao ZHANG

“…Multi-authority attribute-based encryption was very suitable for data access control in a cloud storage environment.However,efficient user revocation in multi-authority attribute-based encryption remains a challenging problem that prevents it from practical applications.A multi-authority ciphertext-policy attribute-based encryption scheme with efficient revocation was proposed in prime order bilinear groups,and was further proved statically secure and revocable in the random oracle model.Extensive efficiency analysis results indicate that the proposed scheme significantly reduce the computation cost for the users.In addition,the proposed scheme supports large universe and any monotone access structures,which makes it more flexible for practical applications.…”
Get full text

التخزین السحابی للبیانات وأمن المعلومات " دراسة تقییمیة by د. ممدوح علی محمود

“…Cloud storing is a basic factor in cloud computing that reducescosts for individuals and institutions, saves time and effort in seeking data fromany place in the world. …”
Get full text

Privacy-perserving scheme for social networks by Zhi-quan LV, Cheng HONG, Min1 ZHANG, Deng-guo FENG, Kai-qu CHEN

“…Analyses show that PPSNS is secure, and gives a better performance in computing and storage costs compared to most related works.…”
Get full text

Digital Twin Satellite Internet: Architecture and Key Technologies by Yaoqi LIU, Hongguang LI, Yiqing ZHOU, Jinglin SHI, Yongtao SU, Jinxi QIAN

“…A digital twin satellite internet (DTSI) architecture was proposed, which provided support for the whole life cycle of satellite internet through the three-dimensional closed-loop mechanism of parallel twin, security endogenous and intelligent evolution.Then, the key problems and technologies of DTSI were discussed.Aiming at the complex and changeable satellite internet system, a standardized model processing and generation method based on mechanism and data driving was proposed.In the face of the data torrent formed by massive information and uneven distribution, a pool computing-storage strategy of three-level diversion strategy was proposed.In order to achieved high fi delity with the characteristics of the actual system, an intelligent orchestration and distributed heterogeneous processing platform was designed to classifi ed and quickly calculated diff erent models and events.In order to achieved high fi delity with the characteristics of the actual system, an intelligent orchestration and distributed heterogeneous processing platform was designed to classifi ed and quickly calculated diff erent models and events, the satellite internet twin cycle evolution system of observation-orientationdecision-act was formed, so as to realized the stable development of the whole life cycle of satellite internet.…”
Get full text

Research on Business Requirement Analysis and Network Architecture of CDN for Power Grid by Yirong Wang, Sining Wang, Ying Zou, Botao Yu

“…Based on the electric power information system architecture and the electric power data network，the electric power CDN network system was put forward，which had two levels network architecture and three layers CDN network storage architecture. …”
Get full text

An efficient way to represent the processors and their connections in omega networks by Savari Prabhu, T. Jenifer Janany, Paul Manuel

“…This characteristic helps reduce congestion and improve overall system performance, especially in large-scale parallel computing environments where data communication is a critical factor. …”
Get full text

An Efficient GPU-Accelerated Algorithm for Solving Dynamic Response of Fluid-Saturated Porous Media by Wancang Lin, Qinglong Zhou, Xinyi Chen, Wenhao Shi, Jie Ai

“…Regarding the iterative solution of equations, a novel algorithm based on the CUDA kernel function is proposed. For a data set with two million degrees of freedom, it takes only about 0.05 s to compute an iterative step and transfer the data to the CPU. …”
Get full text

Uncertainty quantification of CT regularized reconstruction within the Bayesian framework by Negin Khoeiniha, Patricio Guerrero, Wim Dewulf

“… Computed Tomography (CT) reconstruction is an important inverse problem in industrial imaging, requiring robust methods to address different sources of error in the data and model. …”
Get full text

ODC: a method for online detecting ＆ classifying network-wide traffic anomalies by QIAN Ye-kui1, CHEN Ming1, HAO Qiang2, LIU Feng-rong2, SHANG Wen-zhong2

“…A method for online detecting ＆ classifying traffic anomalies（ODC for short） from a network-wide angle of view was put forward.This method constructed traffic matrix with a metric of traffic feature entropy incrementally,de-tected traffic anomalies online using incremental principal component analysis,and then classified traffic anomalies online using incremental k-means,from which network operators could benefit for taking corresponding countermeasures.Theoretical analysis and experiment analysis show that the method has lower storage and less computing time complexity,which could satisfy the requirements of real-time process.Analysis based on both measurement data from Abilene and simulation experiments demonstrate that the method has very good detection and classification performance.…”
Get full text

JUSTIFICATION OF THE STRUCTURE OF A SET OF MODELS FOR THE DEVELOPMENT AND IMPLEMENTATION OF REGIONAL PROGRAMS, TAKING INTO ACCOUNT ASSOCIATED RISKS by A. I. Denisova

“…The study considers the methods of obtaining data for the formation, correction, and evaluation of the implementation of programs. …”
Get full text

Transmission scheduling scheme based on deep Q learning in wireless network by Jiang ZHU, Tingting WANG, Yonghui SONG, Yali LIU

“…To cope with the problem of data transmission in wireless networks,a deep Q learning based transmission scheduling scheme was proposed.The Markov decision process system model was formulated to describe the state transition of the system.The Q learning algorithm was adopted to learn and explore the system states transition information in the case of unknown system states transition probability to obtain the approximate optimal strategy of the schedule node.In addition,when the system state scale was big,the deep learning method was employed to map the relation between state and behavior to solve the problem of the large amount of computation and storage space in Q learning process.The simulation results show that the proposed scheme can approach the optimal strategy based on strategy iteration in terms of power consumption,throughput,packets loss rate.And the proposed scheme has a lower complexity,which can solve the problem of the curse of dimensionality.…”
Get full text

AIS-Based Vessel Trajectory Compression: A Systematic Review and Software Development by Ryan Wen Liu, Shiqi Zhou, Shangkun Yin, Yaqing Shu, Maohan Liang

“…The massive AIS data lead to high storage requirements and computing costs, as well as low data transmission efficiency. …”
Get full text

Review of cryptographic application security evaluation techniques for new critical infrastructures by Gaolei LI, Jianhua LI, Zhihong ZHOU, Hao ZHANG

“…The construction of new critical infrastructure, represented by high-speed full-time signal coverage, intelligent and fine-grained urban management, and deep space and deep sea scientific innovation experimental fields, has entered a new stage with the deep integration and development of new technologies such as 5G/6G, artificial intelligence, and blockchain in various fields.The security evaluation of cryptography applications, as a key technological resource for ensuring the security of national information, integration, and innovation infrastructure, has risen to the level of international law and national development strategy.It is urgent to construct a comprehensive, fine-grained, and self-evolving cryptography security evaluation system throughout the data lifecycle.The typical APT attacks and ransomware attacks faced by new critical infrastructure in industries such as energy, medicine, and transportation in recent years were considered.And then the growing demand for security evaluation of cryptography applications was analyzed in the face of new business requirements such as preventing endogenous data security risks, achieving differentiated privacy protection, and supporting authenticated attack traceability.The new challenges were also examined, which were brought by new information infrastructure (including big data, 5G communication, fundamental software, etc.), integration infrastructure (including intelligent connected vehicles, intelligent connected industrial control systems, etc.), and innovation infrastructure (including big data, artificial intelligence, blockchain, etc.) to the security evaluation of cryptography applications.Furthermore, the new requirements were revealed about domestically produced cryptography algorithms and protocols deployed on high-performance computing chips, ultra-high-speed communication modules, and large-capacity storage media for cryptography application security evaluation technology.Finally, the development of automated and intelligent cryptography application security evaluation technology was explored.…”
Get full text

Combining Unity with machine vision to create low latency, flexible and simple virtual realities by Yuri Ogawa, Raymond Aoukar, Richard Leibbrandt, Jake S. Manger, Zahra M. Bagheri, Luke Turnbull, Chris Johnston, Pavan K. Kaushik, Jaxon Mitchell, Jan M. Hemmi, Karin Nordström

“…We developed a user‐friendly Unity Editor interface, CAVE, to simplify experimental design and data storage without the need for coding. We show that both the DLC‐live‐Unity and the FicTrac‐Unity configurations close the feedback loop effectively and quickly. …”
Get full text