检索结果-内蒙古大学图书馆

2024 16th International Conference on Graphics and Image Processing, ICGIP 2024

作者： Yang, Ching-Nung Lu, Yu-Quan Liu, Shu-Yu Xiong, Lizhi Dept. of Computer Sci. and Inf. Engineering National Dong Hwa University Hualien Taiwan School of Computer and Software Nanjing University of Inf. Sci. & Technology Nanjing China

ISBN: (数字)9781510688780

ISBN: (纸本)9781510688773

Reversible data hiding (RDH) is one special type of data hiding, and is widely used for many intended applications. Moreover, to protect the cover image, RDH in encrypted image (RDHEI) is accordingly proposed. With the reversibility and hiding data in encrypted image, RDHEI has potential utility in fields such as military and medical image transmission, and forensic analysis. Recently, Panchikkil et al. propose a RDHEI by using pixel swapping (RDHE-PSW) to swap some pixels in a block. The pixel swapping does not change pixel values, and thus Panchikkil et al.’s RDHEI-PSW can retain entropy and histogram. The smoothness of a block is calculated to extract the hidden bits and meantime recover the cover image. Panchikkil et al.’s RDHEI-PSW only hides two secret bits in every block. Recently, Kim et al. use pixel shifting (PSH), a circular right shift on a block, instead of pixel swapping to propose a RDHEI-PSH. In this paper, we still adopt PSH approach but use it in a different way (a modified PSH) to propose an enhanced RDHEI-PSH with a higher embedding capacity than Kim et al.’s RDHEI-PSH. Our enhanced RDHEI-PSH double the patterns on a block, on which we can embed more secret bits. Experimental results demonstrate that our enhanced RDHEI-PSH surpasses Panchikkil et al.’s RDHEI-PSW and Kim et al.’s RDHEI-PSH. © 2025 SPIE.

关键词： Military photography

来源：评论

学校读者我要写书评

暂无评论

A DUAL-PULSE SCANNING ELECTRON-BEAM ANNEALER

引用

JOURNAL OF PHYSICS E-sci.NTIFIC INSTRUMENTS 1987年第7期20卷 901-905页

作者： HART, MJ EVANS, AGR BARTLETT, NK Dept. of Electron. Computer Sci. & Inf. Eng. Southampton Univ. UK

Improvements to a scanning electron beam annealer are reported which allow high temperature anneals on semiconductor samples to be carried out in less than one second. These improvements will allow the study of fast annealing effects such as dopant activation, precipitation and enhanced diffusion. The wide range of temperature-time (T(t)) schedules now possible together with accurate T(t) measurements make this simple machine ideal for use in rapid thermal annealing research. An example of an enhanced diffusion study for boron and arsenic in silicon is described.

关键词： HEAT TREATMENT

来源：评论

学校读者我要写书评

暂无评论

Using database technologies in building learning community to improve knowledge exchange

Using database technologies in building learning community t...

引用

3rd IEEE International Conference on Advanced Learning Technologies

作者： Lee, LY Liu, CC Hsu, CC Chen, GD Dept. of Comput. Sci. and Inf. Eng. NCU Taiwan Department of Computer Science and Information Engineering YZU Taiwan

ISBN: (纸本)0769519679

utilize web and database technology to construct a Journal-Based Portfolios Assessment system to realize a Legitimate Peripheral Participation (LPP)[1] learning community. In this system, we divide system to three layer, the view layer present data by Oracle Portal Server, Data layer store data by Oracle Database Server and Operating Control layer operate workflow by Oracle Database trigger and job Data analysis and questionnaire indicates that Web Journal is effective to promote knowledge exchange, Student can improve learning performance and it can form a LPP structure The purpose of using the journal approach[2] is to emulate the forming of academic societies formed by journals. At the same time, the achievement of students in a course is based on their publications in journals and the positions they played in the journals. First, students submit their work such as homeworks, learning portfolios, reports of organizing contents in the discussion, learning problems, related websites. Each submitted article would be assessed by three peers Then the reviewers will review the submitted works. The reviewers will give comments to students. The journal system will publish good articles. Articles published include submitted works and reviewer's comments hoping that students will contribute and exchange their knowledge.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Upgrading links for performance

引用

inf.rmatica 1996年第4期7卷 455-468页

作者： Lim, Andrew Chee, Yeow-Meng Hsu, Wynne Information Technology Institute Dept. of Inf. Sci. and Computer Sci. Singapore 0511 11 Science Park Road Singapore Dept. of Computer Science University of Waterloo Canada Dept. of Inf. Sci. and Computer Sci. Singapore 0511 Singapore University of Minnesota Information Technology Institute Dept. of Info. Sci. and Comp. Sci. University of Waterloo Defence Science Organization National Computer Board (Singapore) Purdue University Dept. of Info. Sci. and Comp. Sci. National University of Singapore

The performance of a computer network is commonly measured by the maximum minimum time required to move a certain amount of data between any 2 nodes in the network. Due to the advances in technology, certain links in the network may be upgraded, for instance to optical fibre links, so that better performance can be achieved. In this paper, we study the LINK UPGRADE problem for networks. We first show that the LINK UPGRADE problem is script N sign℘-complete. We also show that, a closely related problem, the MINIMUM COST LINK UPGRADE problem is script N sign℘-complete even if the underlying topology of the network is a linear array. However, for certain classes of networks, the LINK UPGRADE problem can be solved in polynomial time. For general networks, we provide effective heuristics for the above problems.

关键词： computer network Effective heuristics Link upgrade problem NP-complete problem Performance

来源：评论

学校读者我要写书评

暂无评论

On the analysis of k-secure t-conference key distribution scheme 2017

On the analysis of k-secure t-conference key distribution sc...

引用

7th International Conference on Communication and Network Security, ICCNS 2017

作者： Yang, Ching-Nung Li, Jian-Ming Chou, Yung-Shun Dept. of Computer Sci. and Inf. Eng. National Dong Hwa University Hualien Taiwan

ISBN: (纸本)9781450353496

The k-Secure t-Conference key distribution scheme (kStC-KDS) provides dynamic conferences in wireless sensor networks, which any group of t sensor nodes can derive a conference key using only its pre-distributed piece in sensor nod concept is based on a tvariate symmetric polynomial of degree k. However, the storage size of each sensor node is exponentially proportional to the size of group. Recently, Harn and Hsu used the multiplication of t onevariate polynomials of degree k instead to reduce the storage size, but the dealer should prepare various (t-1) polynomials of degree k for each sensor node. It is observed that we only need to store the polynomial terms with various coefficients for this t-variate kdegree symmetric polynomial in Blundo and De Santis's kStC-KDS. Although the number of polynomial terms with various coefficients is known from the multiset concept. In this work, we adopt partition problem to precisely determine all polynomial terms, such that we can figure out which polynomial terms should be stored in each sensor node to reduce storage size. © 2017 Association for Computing Machinery.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

SPECIFICATION OF REAL-TIME DISTRIBUTED DATABASE-SYSTEMS 6

SPECIFICATION OF REAL-TIME DISTRIBUTED DATABASE-SYSTEMS

引用

1992 ANNUAL INTERNATIONAL computer CONF IN EUROPE : computer SYSTEMS AND SOFTWARE engineering ( COMPEURO 92 )

作者： RAMANATHAN, G ALAGAR, VS Dept. of Comput. Sci. and Inf. Process. Brock Univ. St. Catharines ON Canada Dept. of Computer Science Concordia University Montreal Canada

ISBN: (纸本)0818627603

A unified framework is given for the specification of external consistency constraints, integrity constraints, and temporal consistency constraints of a real-time distributed database system. The formalism is event based and facilitates both relative and quantitative reasoning about time. The functional model of V.S. Alagar and G. Ramanathan (1991) is extended with constructs needed to specify the requirements of real-time databases. To illustrate the use of these constructs, the specification and proof of correctness of a real-time concurrency control protocol are presented. © 1992 IEEE.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Research on simulation model of Petri net about maintaining process with fuzzy duration

Research on simulation model of Petri net about maintaining ...

引用

International Conference on Future computer and Communication

作者： Yang, Yuan Li, Fang Hou, Chongyuan Dept. of Management Sci. Naval Univ. of Engineering Wuhan China Col. of Elc. and Inf. Engineering Naval Univ. of Engineering Wuhan China

ISBN: (纸本)9781424458226

In view of the time uncertainty of maintaining activities and fuzzy mathematical rules with complexity and difference in traditional fuzzy Petri net, the simulation model is proposed based on fuzzy simulation and Coloured Petri net. On the basis of fuzzy maintaining time, logical relationship of maintaining tasks and the synthesis of maintaining duration, the problem of fuzzy duration is turned into the problem of certain duration linked membership with fuzzy simulation. The possibility of maintaining completion is also discussed in the time restriction with credibility theory. The simulation conclusion is drawn that the model can not only be used to express the maintaining process properly and clearly, but also analyzes maintaining schedule simply and practically. ©2010 IEEE.

关键词： Petri nets

来源：评论

学校读者我要写书评

暂无评论

A Perfect Recovery for Fragile Watermarking by Hamming Code on Distributed Pixels 18

A Perfect Recovery for Fragile Watermarking by Hamming Code ...

引用

18th International ISC Conference on inf.rmation Security and Cryptology, Isci.C 2021

作者： Rasouli, Faeze Taheri, Mohammad School of Elec. Comp. Eng. Shiraz University Computer Sci. Eng. Inf. Tech. Dept. Shiraz Iran

ISBN: (纸本)9781665413299

Fragile watermarking is the task of embedding a watermark in an image such that even small changes, called tamper, in the image can be detected or even recovered to preserve unauthorized alteration. A well-known type of spatial fragile watermarking embeds the watermark in the least significant bits of the image to measure correctness of the most significant bits. In addition, Hamming code is a coding algorithm in communication that transmits the data-bits by augmenting some check-bits to exactly detect and recover single-bit modifications. This property is used, in this paper, to detect and perfectly recover the images modified by a tamper with diameter less than a half of the diameter of the image. Based on our knowledge, this is the first time that perfect reconstruction is guaranteed in a high probable condition. To achieve this goal, the Hamming code is applied on a distributed pixel of which bits are extracted from far sufficient pixels in the image. According to the experimental results, the proposed method achieves better performance, in terms of recovering the tampered areas, in comparison to state-of-the-art. © 2021 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

The design and evaluation of GPU based memory database

The design and evaluation of GPU based memory database

引用

5th International Conference on Genetic and Evolutionary Computing, ICGEC2011

作者： Lin, Chia-Feng Yuan, Shyan-Ming Dept. of Computer Science National Chiao Tung University Hsinchu City Taiwan Dept. of Comp. Sci. and Inf. Eng. Providence University Taichung City Taiwan

ISBN: (纸本)9780769544496

In recent years, NVIDIA proposed a developing platform for GPGPU. They also extended C language to parallel computing language, CUDA. In the meanwhile, the growth of memory capacity inside a computer enhances the feasibility of memory based database. In this paper, a memory database was proposed based on GPU memory. This study focus on how GPU can improve common operations for rational databases. Some comparison between proposed database and SQLite were also mentioned. The experiment result shows that GPU based database has better performance than SQLite. This research suggests a better solution to improve the performance of memory database using GPU. © 2011 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

CardS4: Modal theorem proving on java smartcards

引用

International Conference on Research in Smart Cards, E-smart 2001

作者： Goré, Rajeev Prabhakar Nguyên, Phuong Thê Automated Reasoning Group Computer Sciences Laboratory Res. Sch. of Inf. Sci. and Eng Institute of Advanced Studies Australian National University Australia Formal Methods Group Dept. of Computer Science Inf. Tech Australian National University Australia

ISBN: (纸本)3540426108

We describe a successful implementation of a theorem prover for modal logic S4 that runs on a Java smart card with only 512 KBytes of RAM and 32KBytes of EEPROM. Since proof search in S4 can lead to inf.nite branches, this is "proof of principle" that non-trivial modal deduction is feasible even on current Java cards. We hope to use this prover as the basis of an on-board security manager for restricting the flow of "secrets" between multiple applets residing on the same card, although much work needs to be done to design the appropriate modal logics of "permission" and "obligations". Such security concerns are the major impediments to the commercial deployment of multi-application smart cards. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Smart cards

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：