Hash-Based Block Matching for Nonsquare Blocks in Screen Content Coding

2018 ◽  
Vol 32 (08) ◽  
pp. 1850027
Author(s):  
Zhi Liu ◽  
Jing Zhang ◽  
Mengmeng Zhang ◽  
Ang Zhu ◽  
Changzhi An
Keyword(s):  
Rapid Development ◽  
Random Access ◽  
Block Matching ◽  
Coding Efficiency ◽  
Low Delay ◽  
Screen Content ◽  
Multimedia Technologies ◽  
Storage Complexity ◽  
The Cost ◽  
And Storage

With the rapid development of electronic and multimedia technologies, screen contents are widely used in video related applications. However, hash-based block matching, one of the important coding tools designed to improve the coding efficiency of screen content video, is faced with the limitation of constrained block shapes. In this paper, based on the analysis of the time and storage complexity in adding nonsquare blocks to the latest block matching scheme, an improved block matching scheme is proposed by introducing two kinds of nonsquare blocks, i.e. [Formula: see text] and [Formula: see text] blocks to the coding tool, which can improve the coding efficiency and trade-off the efficiency and complexity. Compared with the latest HM-16.9[Formula: see text]SCM-8.0, the proposed scheme achieves 1.47% and 0.94% bitrate saving in low delay and random access configurations with the cost of negligible encoding time increasing for all test text sequences.

Design of Public-Key Algorithms Based on Partial Homomorphic Encryptions

2021 ◽  
pp. 204-224
Author(s):  
Marwan Majeed Nayyef ◽  
Ali Makki Sagheer
Keyword(s):  
Homomorphic Encryption ◽  
Rapid Development ◽  
Public Key ◽  
Secret Key ◽  
Customer Information ◽  
Encrypt Data ◽  
High Processing Speed ◽  
The Cost ◽  
And Storage ◽  
High Processing

With the rapid development of cloud computing, which has become a key aspect to maintain the security of user information that may be highly confidential and maintained during transport and storage process. The reliance on traditional algorithms that are used to encrypt data are not secure enough because we cannot process the data only after decrypt. In this article is proposed the use of homomorphic encryption to solve this problem because it can deal with encrypted data without the decryption, which can lead to ensuring confidentiality of the data. A number of public-key algorithms are explained, which is based on the concept of homomorphic encryption. In this article an algorithm is proposed based on HE and it is similar to Menesez-EC but with one digit as a secret key according to its advantage, whereby reducing the cost of communication, and storage and provides high processing speed when compared with other algorithms. This algorithm provides enough security for a bank's customer information and then compared with ECC, each of RSA and Piallier algorithms as evaluated.

scholarly journals Revocable Key-Aggregate Cryptosystem for Data Sharing in Cloud

2017 ◽  
Vol 2017 ◽  
pp. 1-11 ◽  
Author(s):  
Qingqing Gan ◽  
Xiaoming Wang ◽  
Daini Wu
Keyword(s):  
Access Control ◽  
Data Sharing ◽  
Key Management ◽  
Cloud Storage ◽  
Rapid Development ◽  
Cloud Server ◽  
User Revocation ◽  
User Access ◽  
The Cost ◽  
And Storage

With the rapid development of network and storage technology, cloud storage has become a new service mode, while data sharing and user revocation are important functions in the cloud storage. Therefore, according to the characteristics of cloud storage, a revocable key-aggregate encryption scheme is put forward based on subset-cover framework. The proposed scheme not only has the key-aggregate characteristics, which greatly simplifies the user’s key management, but also can revoke user access permissions, realizing the flexible and effective access control. When user revocation occurs, it allows cloud server to update the ciphertext so that revoked users can not have access to the new ciphertext, while nonrevoked users do not need to update their private keys. In addition, a verification mechanism is provided in the proposed scheme, which can verify the updated ciphertext and ensure that the user revocation is performed correctly. Compared with the existing schemes, this scheme can not only reduce the cost of key management and storage, but also realize user revocation and achieve user’s access control efficiently. Finally, the proposed scheme can be proved to be selective chosen-plaintext security in the standard model.

Design of Public-Key Algorithms Based on Partial Homomorphic Encryptions

2019 ◽  
Vol 13 (2) ◽  
pp. 67-85
Author(s):  
Marwan Majeed Nayyef ◽  
Ali Makki Sagheer
Keyword(s):  
Homomorphic Encryption ◽  
Rapid Development ◽  
Public Key ◽  
Secret Key ◽  
Customer Information ◽  
Encrypt Data ◽  
High Processing Speed ◽  
The Cost ◽  
And Storage ◽  
High Processing

With the rapid development of cloud computing, which has become a key aspect to maintain the security of user information that may be highly confidential and maintained during transport and storage process. The reliance on traditional algorithms that are used to encrypt data are not secure enough because we cannot process the data only after decrypt. In this article is proposed the use of homomorphic encryption to solve this problem because it can deal with encrypted data without the decryption, which can lead to ensuring confidentiality of the data. A number of public-key algorithms are explained, which is based on the concept of homomorphic encryption. In this article an algorithm is proposed based on HE and it is similar to Menesez-EC but with one digit as a secret key according to its advantage, whereby reducing the cost of communication, and storage and provides high processing speed when compared with other algorithms. This algorithm provides enough security for a bank's customer information and then compared with ECC, each of RSA and Piallier algorithms as evaluated.

Run-Time Deep Learning Enhanced Fast Coding Unit Decision for High Efficiency Video Coding

2019 ◽  
Vol 29 (03) ◽  
pp. 2050046
Author(s):  
Xin Li ◽  
Na Gong
Keyword(s):  
Deep Learning ◽  
Video Coding ◽  
High Efficiency ◽  
Random Access ◽  
High Efficiency Video Coding ◽  
Decision Algorithm ◽  
Coding Efficiency ◽  
Low Delay ◽  
Cu Partition ◽  
Coding Unit

The state-of-the-art high efficiency video coding (HEVC/H.265) adopts the hierarchical quadtree-structured coding unit (CU) to enhance the coding efficiency. However, the computational complexity significantly increases because of the exhaustive rate-distortion (RD) optimization process to obtain the optimal coding tree unit (CTU) partition. In this paper, we propose a fast CU size decision algorithm to reduce the heavy computational burden in the encoding process. In order to achieve this, the CU splitting process is modeled as a three-stage binary classification problem according to the CU size from [Formula: see text], [Formula: see text] to [Formula: see text]. In each CU partition stage, a deep learning approach is applied. Appropriate and efficient features for training the deep learning models are extracted from spatial and pixel domains to eliminate the dependency on video content as well as on encoding configurations. Furthermore, the deep learning framework is built as a third-party library and embedded into the HEVC simulator to speed up the process. The experiment results show the proposed algorithm can achieve significant complexity reduction and it can reduce the encoding time by 49.65%(Low Delay) and 48.81% (Random Access) on average compared with the traditional HEVC encoders with a negligible degradation (2.78% loss in BDBR, 0.145[Formula: see text]dB loss in BDPSNR for Low Delay, and 2.68% loss in BDBR, 0.128[Formula: see text]dB loss in BDPSNR for Random Access) in the coding efficiency.

The Research of Order Picking Optimization Based on Jointown Pharmaceutical Logistics Center

2014 ◽  
Vol 701-702 ◽  
pp. 94-97
Author(s):  
Shou Wen Ji ◽  
Xiao Ting Li ◽  
Yong Wang
Keyword(s):  
Information Technology ◽  
Ant Colony Algorithm ◽  
Rapid Development ◽  
Order Picking ◽  
Ant Colony ◽  
Modern Logistics ◽  
Logistics System ◽  
Logistics Center ◽  
The Cost ◽  
And Storage

With the rapid development of modern logistics technology and automation information technology, the automation stereoscopic warehouse has been used more and more widely. As an important part of logistics system, it also plays an important role in the field of pharmaceutical logistics. In order to more effectively manage the automation stereoscopic warehouse, and improve the picking efficiency, reduce the cost of goods handling and storage, order picking optimization is required to reduce logistics costs and improve profitability. This paper adopts ant colony algorithm to build model and solve the problems of order picking optimization, and takes the Jointown pharmaceutical logistics center as an example to further verify the analysis and get more ideal optimization path simulation image.

scholarly journals Dynamical Analysis and Optimal Control for a SEIR Model Based on Virus Mutation in WSNs

Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 929
Author(s):  
Guiyun Liu ◽  
Jieyong Chen ◽  
Zhongwei Liang ◽  
Zhimin Peng ◽  
Junqiang Li
Keyword(s):  
Optimal Control ◽  
Rapid Development ◽  
Hamiltonian Function ◽  
Propagation Model ◽  
Dynamical Analysis ◽  
Optimal Control Strategy ◽  
Epidemic Dynamics ◽  
Optimization Control ◽  
The Cost ◽  
The Pontryagin Maximum Principle

With the rapid development of science and technology, the application of wireless sensor networks (WSNs) is more and more widely. It has been widely concerned by scholars. Viruses are one of the main threats to WSNs. In this paper, based on the principle of epidemic dynamics, we build a SEIR propagation model with the mutated virus in WSNs, where E nodes are infectious and cannot be repaired to S nodes or R nodes. Subsequently, the basic reproduction number R0, the local stability and global stability of the system are analyzed. The cost function and Hamiltonian function are constructed by taking the repair ratio of infected nodes and the repair ratio of mutated infected nodes as optimization control variables. Based on the Pontryagin maximum principle, an optimal control strategy is designed to effectively control the spread of the virus and minimize the total cost. The simulation results show that the model has a guiding significance to curb the spread of mutated virus in WSNs.

scholarly journals Foundation Piles—A New Feature for Concrete 3D Printers

Materials ◽  
2021 ◽  
Vol 14 (10) ◽  
pp. 2545
Author(s):  
Marcin Hoffmann ◽  
Krzysztof Żarkiewicz ◽  
Adam Zieliński ◽  
Szymon Skibicki ◽  
Łukasz Marchewka
Keyword(s):  
3D Printing ◽  
Rapid Development ◽  
Construction Materials ◽  
Shallow Foundation ◽  
Soil Reinforcement ◽  
3D Printer ◽  
Permanent Formwork ◽  
3D Printers ◽  
New Feature ◽  
The Cost

Foundation piles that are made by concrete 3D printers constitute a new alternative way of founding buildings constructed using incremental technology. We are currently observing very rapid development of incremental technology for the construction industry. The systems that are used for 3D printing with the application of construction materials make it possible to form permanent formwork for strip foundations, construct load-bearing walls and partition walls, and prefabricate elements, such as stairs, lintels, and ceilings. 3D printing systems do not offer soil reinforcement by making piles. The paper presents the possibility of making concrete foundation piles in laboratory conditions using a concrete 3D printer. The paper shows the tools and procedure for pile pumping. An experiment for measuring pile bearing capacity is described and an example of a pile deployment model under a foundation is described. The results of the tests and analytical calculations have shown that the displacement piles demonstrate less settlement when compared to the analysed shallow foundation. The authors indicate that it is possible to replace the shallow foundation with a series of piles combined with a printed wall without locally widening it. This type of foundation can be used for the foundation of low-rise buildings, such as detached houses. Estimated calculations have shown that the possibility of making foundation piles by a 3D printer will reduce the cost of making foundations by shortening the time of execution of works and reducing the consumption of construction materials.

scholarly journals Solar Module Integrated Converters as Power Generator in Small Spacecrafts: Design and Verification Approach

Aerospace ◽  
2019 ◽  
Vol 6 (5) ◽  
pp. 61 ◽  
Author(s):  
Jesus Gonzalez-Llorente ◽  
Aleksander A. Lidtke ◽  
Ken Hatanaka ◽  
Ryo Kawauchi ◽  
Kei-Ichi Okuyama
Keyword(s):  
Failure Rate ◽  
Rapid Development ◽  
Electrical Power ◽  
Solar Array ◽  
Electrical Power System ◽  
Solar Module ◽  
Small Satellites ◽  
Frequent Failure ◽  
Verification Process ◽  
The Cost

As small satellites are becoming more widespread for new businesses and applications, the development time, failure rate and cost of the spacecraft must be reduced. One of the systems with the highest cost and the most frequent failure in the satellite is the Electrical Power System (EPS). One approach to achieve rapid development times while reducing the cost and failure rate is using scalable modules. We propose a solar module integrated converter (SMIC) and its verification process as a key component for power generation in EPS. SMIC integrates the solar array, its regulators and the telemetry acquisition unit. This paper details the design and verification process of the SMIC and presents the in-orbit results of 12 SMICs used in Ten-Koh satellite, which was developed in less than 1.5 years. The in-orbit data received since the launch reveal that solar module withstands not only the launching environment of H-IIA rocket but also more than 1500 orbits in LEO. The modular approach allowed the design, implementation and qualification of only one module, followed by manufacturing and integration of 12 subsequent flight units. The approach with the solar module can be followed in other components of the EPS such as battery and power regulators.

scholarly journals Optimization of Network Carbon Capture and Storage System (CCS) Using Mathematical Approach

2015 ◽  
Vol 9 (7) ◽  
pp. 161
Author(s):  
David Licindo ◽  
Arinne Christin Paramudita ◽  
Renanto Handogo ◽  
Juwari Purwo Sutikno
Keyword(s):  
Carbon Capture ◽  
Storage System ◽  
Carbon Capture And Storage ◽  
Exact Result ◽  
Maximum Load ◽  
Mathematical Approach ◽  
Source To Sink ◽  
Storage Location ◽  
The Cost ◽  
And Storage

Carbon capture and storage (CCS) is one of the technologies to reduce greenhouse gas emissions (GHG) tocapture of CO2 from the flue gas of a power plant that typically use coal as a Source of energy and then store it ina suitable geological storage (in specific locations). In practice, these sites may not be readily available forstorage at the same time that the Sources (GHG producing) are operating which gives rise to multi – periodplanning problems. This study presents a mathematical approach by considering constraints limit flowratereceived by Sink, various time availability of Sink and Source and calculation with the purpose to determine theminimum cost network which is getting the maximum load that is exchanged from Source to Sink. Illustrativecase studies are given to demonstrate the application of mathematical models to obtained with the exact result ofthe exchange network from Source to Sink. Derived from network obtained from the calculation of theMaximum Load Source to Sink and results may vary in accordance with the limitations that exist in themathematical model. The case study has been prepared with 2 cases, first 6 Source and 3 Sink with value ofSource Load is greater than the amount available on the Sink. Also, second case is 2 Source and 5 Sinkwithvalue of Source Load is smaller than the amount available on the Sink. In addition, Case Studies tominimize the cost of pipeline construction and distribution of CO2 by plant and storage location determination inJava. Flowrate restriction factor that goes into Sink, Source and Sink establishment time and cost are taken intoaccount can affect the networks that can be exchanged from the Source to the Sink.

FORGERY DETECTION BY LOCAL CORRESPONDENCE

2001 ◽  
Vol 15 (04) ◽  
pp. 579-641 ◽  
Author(s):  
JINHONG KATHERINE GUO ◽  
DAVID DOERMANN ◽  
AZRIEL ROSENFELD
Keyword(s):  
Rapid Development ◽  
Personal Characteristics ◽  
Signature Verification ◽  
Forgery Detection ◽  
Good Correspondence ◽  
Value Differences ◽  
Global Statistics ◽  
The Cost ◽  
Online Verification ◽  
Interest In Research

Signatures may be stylish or unconventional and have many personal characteristics that are challenging to reproduce by anyone other than the original author. For this reason, signatures are used and accepted as proof of authorship or consent on personal checks, credit purchases and legal documents. Currently signatures are verified only informally in many environments, but the rapid development of computer technology has stimulated great interest in research on automated signature verification and forgery detection. In this paper, we focus on forgery detection of offline signatures. Although a great deal of work has been done on offline signature verification over the past two decades, the field is not as mature as online verification. Temporal information used in online verification is not available offline and the subtle details necessary for offline verification are embedded at the stroke level and are hard to recover robustly. We approach the offline problem by establishing a local correspondence between a model and a questioned signature. The questioned signature is segmented into consecutive stroke segments that are matched to the stroke segments of the model. The cost of the match is determined by comparing a set of geometric properties of the corresponding substrokes and computing a weighted sum of the property value differences. The least invariant features of the least invariant substrokes are given the biggest weights, thus emphasizing features that are highly writer-dependent. Random forgeries are detected when a good correspondence cannot be found, i.e. the process of making the correspondence yields a high cost. Many simple forgeries can also be identified in this way. The threshold for making these decisions is determined by a Gaussian statistical model. Using the local correspondence between the model and a questioned signature, we perform skilled forgery detection by examining the writer-dependent information embedded at the substroke level and try to capture unballistic motion and tremor information in each stroke segment, rather than as global statistics. Experiments on random, simple and skilled forgery detection are presented.

Sign in / Sign up

Export Citation Format

Share Document