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

Steiner triple systems of order 15 and their codes

JOURNAL OF STATISTICAL PLANNING AND INFERENCE 1997年第1期58卷 207-216页

作者： Tonchev, VD Weishaar, RS MICHIGAN TECHNOL UNIV DEPT MATH SCIHOUGHTONMI 49931 OHIO STATE UNIV DEPT MATHCOLUMBUSOH 43210

The binary linear codes generated by incidence matrices of the 80 Steiner triple systems on 15 points (STS(15)) are studied. The 80 codes of length 35 spanned by incidence vectors of the points are all non-isomorphic. In contrast, a pair of codes of length 15 generated by blocks are isomorphic if and only if the corresponding incidence matrices have the same rank over GF(2). The weight distribution, the automorphism groups of the codes, and the distribution of the Steiner triple systems within the codes are computed. There are 54 codes of length 35 that contain several non-isomorphic STS(15)'s, and any such code is generated by an STS(15) of largest 2-rank.

关键词： Steiner triple system 2-rank binary code automorphism group finite geometry

来源：评论

学校读者我要写书评

暂无评论

A High Frequency Resolution Successive-Band Shifted Filters Architecture for a 15-bit IFM Receiver

引用

IEEE TRANSACTIONS ON MICROWAVE THEORY AND TECHNIQUES 2019年第5期67卷 2028-2035页

作者： Rahimpour, Hamid Masoumi, Nasser Keshani, Shamim Safavi-Naeini, Safieddin Univ Tehran Coll Engn Sch ECE CST LABDept Elect Tehran *** Iran Univ Waterloo Dept ECE CIARS Waterloo ON N2L 3G1 Canada

A novel structure of microstrip-based instantaneous frequency measurement (IFM) receiver is presented in this paper. The proposed structure employs open-ended resonators as the core part of the receiver. Compact frequency-shifted filters are designed to achieve high-frequency resolution, instead of conventional binary division. To overcome the reliability issues that conventional binary division has in high-bit IFMs, we introduce a novel complementary filter design, which leads to a highly reliable and robust system design for IFMs. The proposed structure is simulated by Advanced Design System (ADS) and fabricated on Rogers Ro4003 substrate with 8-mil thickness. There is a good agreement between simulation and measurement results. According to the measurement results, the measured root mean square of frequency error is less than 15 MHz in the S-band. Sensitivity and dynamic range of the proposed receiver are better than -65 dBm and 70 dB, respectively.

关键词： Bandstop filter binary code frequency resolution instantaneous frequency measurement (IFM) receiver microstrip filter open-ended resonator

来源：评论

学校读者我要写书评

暂无评论

On the minimum weights of binary linear complementary dual codes

引用

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES 2020年第2期12卷 285-300页

作者： Araya, Makoto Harada, Masaaki Shizuoka Univ Dept Comp Sci Hamamatsu Shizuoka 4328011 Japan Tohoku Univ Grad Sch Informat Sci Res Ctr Pure & Appl Math Sendai Miyagi 9808579 Japan

Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study the largest minimum weights d(n,k) among all binary linear complementary dual [n,k] codes. We determine d(n,4) for n equivalent to 2,3,4,5,6,9,10,13 (mod 15), and d(n,5) for n equivalent to 3,4,5,7,11,19,20, 22,26 (mod 31). Combined with known results, d(n,k) are also determined for n <= 24.

关键词： binary code Linear complementary dual code Griesmer bound

来源：评论

学校读者我要写书评

暂无评论

binary encoding method to encrypt Fourier-transformed information of digital images

引用

OPTICS COMMUNICATIONS 2009年第4期282卷 527-534页

作者： Lin, Kuang Tsan [a]Department of Mechanical and Computer Aided Engineering St. John’s University Taipei County 25132 Taiwan

An encoding method is used to encrypt the Fourier-transformed information of a hidden (covert) digital image in an overt image, while the Fourier-transformed information must be encoded with binary codes. All of the pixels in an overt image are classified into five groups that are called identification, type, tracing, dimension, and information codes. Identification codes are used to judge if the overt image contains codes that belong to the proposed encoding method or not: type codes are used to judge the encoding type;tracing codes are used to judge the encoding trace;dimension codes are used to judge the size of the hidden information;and information codes are used to decode the hidden information. Applying the proposed encoding method is rather easy, and host images corresponding to overt images are not needed for decoding work. The experiment has demonstrated four types of encoding for the proposed encoding method to reconstruct covert images Without any distortion or only with a little distortion. (C) 2008 Elsevier B.V. All rights reserved.

关键词： Fourier-transform Encrypt Hide Covert image Overt image binary code

来源：评论

学校读者我要写书评

暂无评论

Secure codes With List Decoding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2024年第4期70卷 2430-2442页

作者： Gu, Yujie Vorobyev, Ilya Miao, Ying Kyushu Univ Fac Informat Sci & Elect Engn Fukuoka 8190395 Japan Tech Univ Munich Inst Commun Engn D-80333 Munich Germany Univ Tsukuba Fac Engn Informat & Syst Tsukuba Ibaraki 3058573 Japan

In this paper we consider combinatorial secure codes in traitor tracing for protecting copyright of multimedia content. First, we introduce a new notion of secure codes with list decoding (SCLDs) for collusion-resistant multimedia fingerprinting, which includes many existing types of fingerprinting codes as special cases. Next, we build efficient identifying algorithms for SCLDs with complete traceability and establish bounds on its largest possible code rate. In comparison with the existing fingerprinting codes, it is shown that SCLDs have not only much more efficient traceability than separable codes but also a much larger code rate than frameproof codes. As a byproduct, new bounds on the largest code rate of binary separable codes are established as well. Furthermore, a two-stage dynamic traitor tracing framework is proposed for multimedia fingerprinting in the dynamic scenario, which could not only efficiently achieve the complete traceability but also provide a much larger capacity than the static scenario.

关键词： codes Fingerprint recognition Decoding Data security Modulation Heuristic algorithms Streaming media Secure code list decoding dynamic traitor tracing copyright protection binary code code rate

来源：评论

学校读者我要写书评

暂无评论

Scalable Supervised Asymmetric Hashing With Semantic and Latent Factor Embedding

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2019年第10期28卷 4803-4818页

作者： Zhang, Zheng Lai, Zhihui Huang, Zi Wong, Wai Keung Xie, Guo-Sen Liu, Li Shao, Ling Harbin Inst Technol Biocomp Res Ctr Shenzhen Peoples R China Univ Queensland Brisbane Qld 4072 Australia Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Peoples R China Hong Kong Polytech Univ Hong Kong Peoples R China Univ Queensland Sch Informat Technol & Elect Engn Brisbane Qld 4072 Australia Inception Inst Artificial Intelligence Abu Dhabi U Arab Emirates

Compact hash code learning has been widely applied to fast similarity search owing to its significantly reduced storage and highly efficient query speed. However, it is still a challenging task to learn discriminative binary codes for perfectly preserving the full pairwise similarities embedded in the high-dimensional real-valued features, such that the promising performance can be guaranteed. To overcome this difficulty, in this paper, we propose a novel scalable supervised asymmetric hashing (SSAH) method, which can skillfully approximate the full-pairwise similarity matrix based on maximum asymmetric inner product of two different non-binary embeddings. In particular, to comprehensively explore the semantic information of data, the supervised label information and the refined latent feature embedding are simultaneously considered to construct the high-quality hashing function and boost the discriminant of the learned binary codes. Specifically, SSAH learns two distinctive hashing functions in conjunction of minimizing the regression loss on the semantic label alignment and the encoding loss on the refined latent features. More importantly, instead of using only part of similarity correlations of data, the full-pairwise similarity matrix is directly utilized to avoid information loss and performance degeneration, and its cumbersome computation complexity on n x n matrix can be dexterously manipulated during the optimization phase. Furthermore, an efficient alternating optimization scheme with guaranteed convergence is designed to address the resulting discrete optimization problem. The encouraging experimental results on diverse benchmark datasets demonstrate the superiority of the proposed SSAH method in comparison with many recently proposed hashing algorithms.

关键词： binary code supervised hashing asymmetric hashing image retrieval

来源：评论

学校读者我要写书评

暂无评论

Path Sensitive Fuzzing for Native Applications

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2022年第3期19卷 1544-1561页

作者： Gan, Shuitao Zhang, Chao Qin, Xiaojun Tu, Xuwen Li, Kang Pei, Zhongyu Chen, Zuoning State Key Lab Math Engn & Adv Comp Wuxi Jiangsu Peoples R China Tsinghua Univ Inst Network Sci & Cyberspace Beijing 100084 Peoples R China Beijing Natl Res Ctr Informat Sci & Technol Beijing 100084 Peoples R China Anonymous Univ Beijing Peoples R China

Coverage-guided fuzzing is a widely used and effective solution to find software vulnerabilities. Tracking code coverage and utilizing it to guide fuzzing are crucial to coverage-guided fuzzers. However, tracking full and accurate path coverage is infeasible in practice due to the high instrumentation overhead. Popular fuzzers (e.g., AFL) often use coarse coverage information, e.g., edge hit counts stored in a compact bitmap, to achieve highly efficient greybox testing. Such inaccuracy and incompleteness in coverage introduce serious limitations to fuzzers. First, it causes path collisions, which prevent fuzzers from discovering potential paths that lead to new crashes. More importantly, it prevents fuzzers from making wise decisions on fuzzing strategies. In this article, we propose a coverage sensitive fuzzing solution CollAFL. It mitigates path collisions by providing more accurate coverage information, while still preserving low instrumentation overhead. It also utilizes the coverage information to apply three new fuzzing strategies, promoting the speed of discovering new paths and vulnerabilities. We implemented two variants of this solution, namely CollAFL (based on AFL) and CollAFL-bin (based on AFL-dyninst), to test applications with and without source code respectively, and evaluated them on 24 popular applications. The results showed that path collisions are common, i.e., up to 75 percent of edges could collide with others in some applications. But our solutions CollAFL and CollAFL-bin could reduce the edge collision ratio to nearly zero. Moreover, armed with the three fuzzing strategies, they outperform their counterparts (i.e., AFL and AFL-dyninst) in terms of both code coverage and vulnerability discovery. On average, CollAFL covered 20 percent more program paths, and found 320 percent more unique crashes and 260 percent more bugs than AFL in 200 hours. Moreover, CollAFL-bin covered 15 percent more paths, and found 200 percent more unique crashes and 15

关键词： Fuzzing Computer bugs Instruments Security Grammar Cyberspace Coverage-guided fuzzing path collision bitmap seed selection policy source code binary code

来源：评论

学校读者我要写书评

暂无评论

Optimal sensor placement for spatial lattice structure based on genetic algorithms

引用

JOURNAL OF SOUND AND VIBRATION 2008年第1-2期317卷 175-189页

作者： Liu, Wei Gao, Wei-cheng Sun, Yi Xu, Min-jian Harbin Inst Technol Dept Astronaut Sci & Mech Harbin 150001 Peoples R China

Optimal sensor placement technique plays a key role in structural health monitoring of spatial lattice structures. This paper considers the problem of locating sensors oil a spatial lattice structure with the aim of maximizing the d ata information so that structural dynamic behavior can be fully characterized. Based on the criterion of optimal sensor placement for modal test, an improved genetic algorithm is introduced to find the optimal placement of sensors. The modal strain energy (MSE) and the modal assurance criterion (MAC) have been taken as the fitness function, respectively, so that three placement designs were produced. The decimal two-dimension array coding method instead of binary coding method is proposed to code the solution. Forced mutation operator is introduced when the identical genes appear via the crossover procedure. A computational simulation of a 12-bay plain truss model has been implemented to demonstrate the feasibility of the three optimal algorithms above. The obtained optimal sensor placements using the improved genetic algorithm are compared with those gained by exiting genetic algorithm using the binary coding method. Further the comparison criterion based oil the mean square error between the finite element method (FEM) mode shapes and the Guyan expansion mode shapes identified by data-driven stochastic subspace identification (SSI-DATA) method are employed to demonstrate the advantage of the different fitness function. The results showed that some innovations in genetic algorithm proposed ill this paper can enlarge the genes storage and improve the convergence of the algorithm. More importantly, the three optimal sensor placement methods can all provide the reliable results and identify the vibration characteristics of the 12-bay plain truss model accurately. (c) 2008 Elsevier Ltd. All rights reserved.

关键词： IDENTIFICATION Genetic Algorithm (GA) modal response vibration characteristic health structural monitoring Mean square error Finite element method crossover procedure sensor placement binary code

来源：评论

学校读者我要写书评

暂无评论

On a Traveling Salesman Problem for Points in the Unit Cube

引用

ALGORITHMICA 2024年第9期86卷 3054-3078页

作者： Balogh, Jozsef Clemen, Felix Christian Dumitrescu, Adrian Univ Illinois Dept Math Urbana IL 61801 USA Karlsruhe Inst Technol Dept Math D-76131 Karlsruhe Germany Algoresearch LLC Milwaukee WI 53217 USA

Let X be an n-element point set in the k-dimensional unit cube [0,1]k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$[0,1]<^>k$$\end{document} where k >= 2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k \ge 2$$\end{document}. According to an old result of Bollob & aacute;s and Meir (Oper Res Lett 11:19-21, 1992) , there exists a cycle (tour) x1,x2,& mldr;,xn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$x_1, x_2, \ldots , x_n$$\end{document} through the n points, such that & sum;i=1n|xi-xi+1|k1/k <= ck\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\left( \sum _{i=1}<^>n |x_i - x_{i+1}|<^>k \right) <^>{1/k} \le c_k$$\end{document}, where |x-y|\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$|x-y|$$\end{document} is the Euclidean distance between x and y, and ck\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$c_k$$\end{document} is an absolute constant that depends only on k, where xn+1 equivale

关键词： Traveling salesman problem Minimum spanning tree binary code Relaxed triangle inequality

来源：评论

学校读者我要写书评

暂无评论

A class of binary cyclic codes with optimal parameters

引用

CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES 2022年第3期14卷 663-675页

作者： Liu, Kaiqiang Wang, Qi Yan, Haode Southwest Jiaotong Univ Sch Math Chengdu 610031 Peoples R China State Key Lab Cryptol POB 5159 Beijing 100878 Peoples R China Southern Univ Sci & Technol Natl Ctr Appl Math Shenzhen Dept Comp Sci & Engn Shenzhen 518055 Peoples R China

For positive integers k >= 2 and t, let m = 2kt and alpha be a primitive element of the finite field F-2m. In this paper, we study the parameters of a class of cyclic codes C-(1,C-v) which has two zeros alpha and alpha(v) with v = 2(m)-1/2(t)+1 It is shown that C-(1,C-v) is optimal or almost optimal with respect to the sphere packing bound. Based on some results of Kloosterman sums and Gaussian periods, the weight distribution of the dual code of C-(1,C-v) is completely determined when t = 5.

关键词： Cyclic code binary code Kloosterman sum Gaussian period Weight distribution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：