中国科学院机构知识库网格系统: 检索

SCE: A Manifold Regularized Set-Covering Method for Data Partitioning 期刊论文 OAI收割
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2018, 卷号: 29, 期号: 5, 页码: 1760-1773
作者: Li, Xuelong; Lu, Quanmao; Dong, Yongsheng; Tao, Dacheng; Dong, YS (reprint author), Chinese Acad Sci, Xian Inst Opt & Precis Mech, OPT IMagery Anal & Learning OPTIMAL, State Key Lab Transient Opt & Photon, Xian 710119, Shaanxi, Peoples R China.

|

收藏 | 浏览/下载：23/0 | 提交时间：2018/05/14

Cluster Ensemble Discriminative Constraint Manifold Structure Set Covering

WANDERING CONTINU A FORRATIONAL MAPS 期刊论文 OAI收割
DISCRETE AND CONTINUOUS DYNAMICAL SYSTEMS, 2016, 卷号: 36, 期号: 3, 页码: 1321-1329
作者: Cui, Guizhen; Gao, Yan

|

收藏 | 浏览/下载：17/0 | 提交时间：2018/07/30

Lattes map wandering continuum rational map Julia set torus covering

Multi-sphere approximation of real particles for DEM simulation based on a modified greedy heuristic algorithm 期刊论文 OAI收割
POWDER TECHNOLOGY, 2015, 卷号: 286, 页码: 478-487
作者: Li, Cheng-Qing; Xu, Wen-Jie; Meng, Qing-Shan

|

收藏 | 浏览/下载：20/0 | 提交时间：2018/06/05

Discrete element method (DEM) Particle shape Multiple overlapping spheres (MOS) Set-covering problem (SCP) Modified greedy heuristic (MGH)

Conditions for coverings to induce matroids 期刊论文 OAI收割
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2014, 卷号: 5, 期号: 6, 页码: 947-954
作者: Wang, Jingqian; Zhu, William; Wang, Fei-Yue; Liu, Guilong

收藏 | 浏览/下载：38/0 | 提交时间：2015/08/12

Covering Rough set Neighborhood Matroid Eulerian matroid

The fourth type of covering-based rough sets 期刊论文 OAI收割
INFORMATION SCIENCES, 2012, 卷号: 201, 期号: 0, 页码: 80-92
作者: Zhu, William; Wang, Fei-Yue

收藏 | 浏览/下载：19/0 | 提交时间：2015/08/12

Rough set Covering Granular computing Fuzzy set Computing with words

Attribute Reduction Using Extension of Covering Approximation Space 期刊论文 OAI收割
FUNDAMENTA INFORMATICAE, 2012, 卷号: 115, 期号: 2-3, 页码: 219-232
作者: Wang, GuoYin; Hu, Jun

|

收藏 | 浏览/下载：10/0 | 提交时间：2018/03/15

covering rough set covering decision system attribute reduction

Level 0 and level 1 data processing for a type of hyper-spectral imager (EI CONFERENCE) 会议论文 OAI收割
2009 International Conference on Optical Instruments and Technology, OIT 2009, October 19, 2009 - October 21, 2009, Shanghai, China
Li X.; Yan C.

收藏 | 浏览/下载：71/0 | 提交时间：2013/03/25

Hyper-spectral imaging (HSI) is a kind of optical remote sensor that can simultaneously obtain spatial and spectral information of ground targets. We are now designing a data processing system for a type of space-borne push-broom HSI then it performs radiometric and spectral calibration based on the ground calibration results and onboard calibration collection. The detailed algorithms for bad pixel replacement which has 128 spectral channels covering the spectral range from 400nm to 2500nm. With its large amount of spectral channels radiometric and spectral calibration were presented. After processing the HSI collects large volume of spectral imaging data need to be efficiently and accurately processed and calibrated. In this paper the digital numbers downlinked from the spacecraft can be converted into at-sensor absolute spectral radiance of ground targets the detailed Level 0 and Level 1 data processing steps for the HSI were presented. The Level 0 processing refers to a set of tasks performed on the data downlinked from the spacecraft thus providing accurate quantified spectral imaging data for various applications. 2009 SPIE. including decoding to extract science data separating the science data into files corresponding to different tasks (e.g. ground imaging dark imaging and onboard calibration) checking data integrity and instrument settings data format conversion and Level 0 files creation. The Level 1 processing performs several steps on Level 0 data. Firstly it corrects the image artifacts (mostly the SWIR smear effect) subtracts the dark background and performs the bad pixel replacement according to the prelaunch measurement

a backtracking search tool for constructing combinatorial test suites 期刊论文 OAI收割
Journal of Systems and Software, 2008, 卷号: 81, 期号: 10, 页码: 1681-1693
Jun Yan; Zhang Jian

|

收藏 | 浏览/下载：16/0 | 提交时间：2010/08/11

Software testing Combinatorial testing Optimal test set Covering array Orthogonal array

A min-max theorem on tournaments 期刊论文 OAI收割
SIAM JOURNAL ON COMPUTING, 2007, 卷号: 37, 期号: 3, 页码: 923-937
作者: Chen, Xujin; Hu, Xiaodong; Zang, Wenan

|

收藏 | 浏览/下载：19/0 | 提交时间：2018/07/30

min-max relation feedback vertex set tournament packing covering

A min-max relation on packing feedback vertex sets 期刊论文 OAI收割
MATHEMATICS OF OPERATIONS RESEARCH, 2006, 卷号: 31, 期号: 4, 页码: 777-788
作者: Chen, Xujin; Ding, Guoli; Hu, Xiaodong; Zang, Wenan

|

收藏 | 浏览/下载：15/0 | 提交时间：2018/07/30

min-max relation feedback vertex set clutter packing covering