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

International Conference on Advances in Computer Science and Engineering

作者： Yang Lu-gang Naval Univ Engn Coll Elect Engn Wuhan Peoples R China

ISBN: (纸本)9780878492510

In the application of Genetic Algorithm (GA) to solve the function optimization problem, different encoding methods have different effect on performance of GA. Aiming at the global optimization problem of a class of nonlinear multi-peak function, the paper utilized binary coding and floating coding methods for genetic optimization and analyzed their performance. The experimental result of four kinds of typical nonlinear multi-peak function showed that under the precondition of given genetic operator, the optimizing performance of floating coding method to optimize nonlinear multi-peak function with isolated extreme points is less that the binary coding. The tuning ability of floating coding is stronger. As to the ordinary multi-peak function, the search affect is better than binary coding.

关键词： genetic algorithm binary coding floating coding global search local search

来源：评论

学校读者我要写书评

暂无评论

Spectral feature probabilistic coding for hyperspectral signatures

Spectral feature probabilistic coding for hyperspectral sign...

引用

Conference on Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XII

作者： Chakravarty, Sumit Chang, Chein-, I Univ Maryland Baltimore Cty Dept Comp Sci & Elect Engn Remote Sensing Signal & Image Proc Lab Baltimore MD 21250 USA

ISBN: (纸本)0819462896

Spectral signature coding has been used to characterize spectral features where a binary code book is designed to encode an individual spectral signature and the Hamming distance is then used to perform signature discrimination. The effectiveness of such a binary signature coding largely relies on how well the Hamming distance can capture spectral variations that characterize a signature. Unfortunately, in most cases, such coding does not provide sufficient information for signature analysis, thus it has received little interest in the past. This paper reinvents the wheel by introducing a new concept, referred to as spectral feature probabilistic coding (SFPC) into signature coding. Since the Hamming distance does not take into account the band-to-band variation, it can be considered as a memoryless distance. Therefore, one approach is to extend the Hamming distance to a distance with memory. One such coding technique is the well-known arithmetic coding (AC) which encodes a signature in a probabilistic manner. The values resulting from the AC is then used to measure the distance between two signatures. This paper investigates AC-based signature coding for signature analysis and conducts a comparative analysis with spectral binary coding.

关键词： arithmetic coding (AC) binary coding SPectral Analysis Manager (SPAM) Spectral Feature-based coding (SFPC) Spectral Feature Probabilistic coding (SFPC)

来源：评论

学校读者我要写书评

暂无评论

Scalable Auto-weighted Discrete Multi-view Clustering 21

Scalable Auto-weighted Discrete Multi-view Clustering

引用

30th World Wide Web Conference (WWW)

作者： Yang, Longqi Zhang, Liangliang Tang, Yuhua Natl Univ Def Technol State Key Lab High Performance Comp Coll Comp Changsha Peoples R China Natl Innovat Inst Def Technol Artificial Intelligence Res Ctr Beijing Peoples R China AMS Inst Syst Engn Beijing Peoples R China

ISBN: (纸本)9781450383127

Multi-view clustering has been widely studied in machine learning, which uses complementary information to improve clustering performance. However, challenges remain when handling large-scale multi-view data due to the traditional approaches' high time complexity. Besides, the existing approaches suffer from parameter selection. Due to the lack of labeled data, parameter selection in practical clustering applications is difficult, especially in big data. In this paper, we propose a novel approach for large-scale multi-view clustering to overcome the above challenges. Our approach focuses on learning the low-dimensional binary embedding of multi-view data, preserving the samples' local structure during binary embedding, and optimizing the embedding and clustering in a unified framework. Furthermore, we proposed to learn the parameters using a combination of data-driven and heuristic approaches. Experiments on five large-scale multi-view datasets show that the proposed method is superior to the state-of-the-art in terms of clustering quality and running time.

关键词： multi-view clustering binary coding graph regularization parameter selection

来源：评论

学校读者我要写书评

暂无评论

Optimization Decision Algorithm for Water Resource Allocation and Scheduling in Large-scale Water Supply Networks 24

Optimization Decision Algorithm for Water Resource Allocatio...

引用

International Conference on Machine Intelligence and Digital Applications (MIDA)

作者： Su, Yang Guo, Songming Yan, Jun ShenZhen Water Grp Shenzhen 518001 Peoples R China

ISBN: (纸本)9798400718144

With the acceleration of urbanization and population growth, water resource management is facing increasingly severe challenges. Especially in large-scale water supply networks, how to efficiently, fairly, and sustainably allocate and dispatch water resources has become a key issue. Therefore, this article proposes an optimization decision algorithm for water resource allocation and scheduling in large-scale water supply networks. When delving into the problem of water resource allocation and scheduling, it is necessary to first comprehensively consider the key factors of social, economic, and environmental dimensions, and establish a scientific and reasonable objective function. Consider the water supply capacity, transmission capacity, and water demand capacity of each region as constraints. The binary genetic algorithm is used to transform the allocation and scheduling problem of water resources into a binary coding form. Through iterative optimization of the initial population, genetic, mutation, crossover and other mechanisms, the optimal solution is found in the search space. Through experimental verification, this method can reasonably allocate water resources, ensure water supply security in various regions, improve the balance of the water supply network, and reduce water resource waste and loss.

关键词： binary genetic algorithm Water allocation Water scheduling binary coding Optimal decision-making algorithm

来源：评论

学校读者我要写书评

暂无评论

Corporate governance and financial distress: Asian emerging market perspective

引用

CORPORATE GOVERNANCE-THE INTERNATIONAL JOURNAL OF BUSINESS IN SOCIETY 2021年第4期21卷 702-715页

作者： Younas, Noman UdDin, Shahab Awan, Tahira Khan, Muhammad Yar COMSATS Univ Islamabad Dept Management Sci Wah Campus Wah Cantt Pakistan Karakoram Int Univ Dept Business Management Sci Gilgit Pakistan Int Islamic Univ Fac Management Sci Kuala Lumpur Malaysia

Purpose The purpose of this paper is to examine the impact of corporate governance index (PAKCGI) on firm financial distress for a sample of 152 non-financial firms listed at Pakistan Stock Exchange (PSX) over the period from 2003 to 2017. Design/methodology/approach To examine the impact of PAKCGI on financial distress (Altman Z-Score), random effect model is applied. The PAKCGI is a self-constructed index based on the five important factors of corporate governance practices, i.e. board of directors, audit committees, right of shareholders, disclosures and risk management. The binary coding approach is adopted for the construction of PAKCGI. Altman Z-Score model is used as a proxy for financial distress indicator. The absolute value of Altman Z-score has been taken as financial distress indicator. Findings The outcomes of the study indicate a positive impact of PAKCGI on risk of firms' financial distress. The positive coefficient of PAKCGI implies that the good corporate practices work as catalyst to reduce risk of financial distress in Pakistan. A significant negative impact of block holders on financial distress suggests that the concentrated block ownership take monopolistic decision to protect their interests. It has also been observed that significant positive impact of institutional ownership on financial distress exists in the Pakistani listed firms. Furthermore, this study also reveals that significant negative association between board size, CEO duality and financial distress indicator. Research limitations/implications The findings may encourage the Pakistani listed companies to follow and implement good corporate governance practices, which would lead to increase the confidence of investors, regulators and stakeholders. Originality/value The current study extends the corporate governance literature by examining the relationship between the corporate governance attributes and the financial distress status of Pakistani listed companies. From the academic p

关键词： Emerging markets Corporate governance Corporate governance index Financial distress binary coding PAKCGI Z-score

来源：评论

学校读者我要写书评

暂无评论

TOWARDS COMPACT VISUAL DESCRIPTOR VIA DEEP FISHER NETWORK WITH binary EMBEDDING

TOWARDS COMPACT VISUAL DESCRIPTOR VIA DEEP FISHER NETWORK WI...

引用

IEEE International Conference on Multimedia and Expo (IEEE ICME)

作者： Qian, Jianqiang Lin, Xianming Liu, Hong Deng, Youming Ji, Rongrong Xiamen Univ Sch Informat Sci & Engn Fujian Key Lab Sensing & Comp Smart City Xiamen 361005 Peoples R China

ISBN: (纸本)9781538617373

Fisher Vector (FV) has been widely used to aggregate the local descriptors of an image into a global representation in large-scale image retrieval. However, FV has limited learning capability and its parameters are mostly fixed after constructing the codebook, which is inflexible and cannot be trained jointly with deep networks. Moreover, the high dimension of FV makes it difficult to be applied in scenarios compact descriptors are needed. In this paper, we propose a novel compact image description scheme based on Fisher network with binary embedding to solve the large-scale image retrieval problem, which consists of two components: a Fisher encoder component and a binary embedding component. Concretely, the Fisher encoder is a trainable neural network functions as the traditional FV, which aggregates the local descriptors into a global representation. And the binary encoder embeds the high-dimensional FV to a binary vector, which outputs the compact global binary descriptor. To learn such a descriptor, we further introduce a novel and effective loss function, in which maximum margin criterion is exploited to minimize the distances of positive pairs, as well as maximizing the distances of negative pairs. Extensive experiments performed on MPEG-7 CDVS benchmarks and ILSVR2010 demonstrate that the proposed framework can achieve very superior performance over the state-of-the-art methods.

关键词： Fisher network binary coding CDVS Large-scale image retrieval

来源：评论

学校读者我要写书评

暂无评论

Digital Noncoherent Demodulation of "Integrally" Coded Phase-Shift Keyed Signals

Digital Noncoherent Demodulation of "Integrally" Coded Phase...

引用

International Siberian Conference on Control and Communications (SIBCON)

作者： Glushkov, Alexey N. Litvinenko, Vladimir P. Matveev, Boris V. Chernoyarov, Oleg V. Voronezh State Tech Univ Dept Radio Engn Voronezh Russia Natl Res Univ MPEI Dept Radio Engn Devices & Antenna Syst Moscow Russia

ISBN: (纸本)9781467383837

We consider the advanced digital noncoherent demodulator of "integrally" coded binary phase-shift keyed signals. This demodulator requires carrying out the minimum simple arithmetic operations over the input signal period. We study its noise immunity, and we show that for relatively short codes " integrally" demodulation leads to considerable gain in comparison with step-by-step demodulation and subsequent decoding with error correction. We present demodulator engineering feasibilities by means of digital signal processors, or with the use of modern programmable logic devices.

关键词： phase-shift keying demodulation digital noncoherent processing binary coding

来源：评论

学校读者我要写书评

暂无评论

Digital Demodulation of the Signals Phase-Shift Keyed in Toto and Coded by Walsh Sequences

Digital Demodulation of the Signals Phase-Shift Keyed in Tot...

引用

IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (IEEE ICPCSI)

作者： Litvinenko, Vladimir P. Glushkov, Alexey N. Matveev, Boris, V Salnikova, Alexandra, V Chernoyarov, Oleg, V Voronezh State Tech Univ Dept Radio Engn Voronezh Russia Voronezh State Tech Univ Dept Informat Technol & Compaided Design Bldg Voronezh Russia Natl Res Tomsk State Univ Int Lab Stat Stochast Proc & Quantitat Finance Tomsk Russia Natl Res Univ MPEI Dept Elect & Nanoelect Moscow Russia

ISBN: (纸本)9781538608142

We consider the possible characteristics of the digital demodulator of the signals phase-shift keyed in toto and coded by Walsh sequences and the ways of hardware implementation of such a demodulator by means of programmable logic devices (PLDs). We introduce the fast digital algorithm for noncoherent demodulation of the phase-shift keyed signals coded in toto, requiring a minimum number of the simple arithmetic operations over the carrier period. The evaluation of the hardware resources needed is carried out for the various PLD families produced by Xilinx and accounting for the various parameters of a processed signal. The operational frequency range and the chip power consumption at high clock frequencies are determined. The expression for the calculation of the demodulation error probability is presented. The operability of the demodulator and its high-noise immunity are tested for various signal parameters with the help of statistical simulation methods.

关键词： phase-shift keying Walsh codes demodulation digital noncoherent processing binary coding hardware implementation

来源：评论

学校读者我要写书评

暂无评论

A SVM-Based System for Predicting Protein-Protein Interactions Using a Novel Representation of Protein Sequences

A SVM-Based System for Predicting Protein-Protein Interactio...

引用

9th International Conference on Intelligent Computing (ICIC)

作者： You, Zhuhong Ming, Zhong Niu, Ben Deng, Suping Zhu, Zexuan Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen 518060 Guangdong Peoples R China Tongji Univ Dept Comp Sci & Technol Shanghai 201804 Peoples R China

ISBN: (纸本)9783642394799;9783642394782

Protein-protein interactions (PPIs) are crucial for almost all cellular processes, including metabolic cycles, DNA transcription and replication, and signaling cascades. However, the experimental methods for identifying PPIs are both time-consuming and expensive. Therefore, it is important to develop computational approaches for predicting PPIs. In this article, a sequence-based method is developed by combining a novel feature representation using binary coding and Support Vector Machine (SVM). The binary-coding-based descriptors account for the interactions between residues a certain distance apart in the protein sequence, thus this method adequately takes the neighboring effect into account and mine interaction information from the continuous and discontinuous amino acids segments at the same time. When performed on the PPI data of Saccharomyces cerevisiae, the proposed method achieved 86.93% prediction accuracy with 86.99% sensitivity at the precision of 86.90%. Extensive experiments are performed to compare our method with the existing sequence-based method. Achieved results show that the proposed approach is very promising for predicting PPI, so it can be a useful supplementary tool for future proteomics studies.

关键词： protein-protein interaction binary coding support vector machine protein sequence local descriptor

来源：评论

学校读者我要写书评

暂无评论

POINT CLOUD COMPRESSION FRAMEWORK FOR THE WEB 6

POINT CLOUD COMPRESSION FRAMEWORK FOR THE WEB

引用

6th International Conference on 3D Imaging (IC3D)

作者： Renault, Sylvain Ebner, Thomas Feldmann, Ingo Schreer, Oliver Heinrich Hertz Inst Nachrichtentech Berlin GmbH Fraunhofer Inst Telecommun Dept Vis & Imaging Technol Einsteinufer 37 D-10587 Berlin Germany

ISBN: (纸本)9781509057436

This work is dedicated to the compression of 3D point clouds in order to allow an efficient and quick transmission of point cloud datasets (PCD) for visualization over the internet. Standard methods include quantization of vectors or cloud simplification via octree structures. While a quantization into a bit representation will transform vectors in discrete positions, we added octree structures for a fixed level for re-indexing the quantized points relative to the individual local position of the subdivisions. Each subdivision multiplies the resolution of one coordinate by two, by adding a "virtual" bit. This bit can be then removed from the quantization bytes. So the combination of quantization and fixed octree structures decreases the amount of needed quantization bits without losing resolution. On the contrary, it is possible to increase the resolution of a PCD by adding the "virtual" bit to the quantized data without significantly changing the size of the dataset. We demonstrated the feasibility of this technique for the web by developing a lightweight framework, running in a browser-based environment.

关键词： Point cloud compression vector quantization space partitioning octree coding binary coding point renderer WebGL JavaScript framework

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：