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

Characterization of anomaly detection in hyperspectral imagery

Sensor Review 2006年第2期26卷 137-146页

作者： Chang, Chein-I Hsueh, Mingkai Remote Sensing Signal and Image Processing Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore MD United States

Purpose - The paper aims to characterize anomaly detection in hyperspectral imagery. Design/methodology/approach - This paper develops an adaptive causal anomaly detector (ACAD) to investigate several issues encountered in hyperspectral image analysis which have not been addressed in the past. It also designs extensive synthetic image-based computer simulations and real image experiments to substantiate the work proposed in this paper. Findings - This paper developed an ACAD and custom-designed computer simulations and real image experiments to successfully address several issues in characterizing anomalies for detection, which are - first, how large size for a target to be considered as an anomaly? Second, how an anomaly responds to its proximity? Third, how sensitive for an anomaly to noise? Finally, how different anomalies to be detected? Additionally, it also demonstrated that the proposed ACAD can be implemented in real time processing and implementation. Originality/value - This paper is the first work on investigation of several issues related to anomaly detection in hyperspectral imagery via extensive synthetic image-based computer simulations and real image experiments. In addition, it also develops a new developed an ACAD to address these issues and substantiate its performance.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

Protocol for the fabrication of self-standing (nano)cellulose-based 3D scaffolds for tissue engineering

引用

STAR Protocols 2025年第1期6卷 103583页

作者： Mohan, Tamilselvan Bračič, Matej Bračič, Doris Lackner, Florian Nagaraj, Chandran Štiglic, Andreja Dobaj Kargl, Rupert Kleinschek, Karin Stana Graz University of Technology Institute for Chemistry and Technology of Biobased System (IBioSys) Stremayrgasse 9 Graz 8010 Austria University of Maribor Faculty of Mechanical Engineering Laboratory for Characterization and Processing of Polymers Smetanova Ulica 17 Maribor 2000 Slovenia Department of Internal Medicine Division of Pulmonology Medical University of Graz Graz Austria Institute of Automation Faculty of Electrical Engineering and Computer Science University of Maribor Maribor Slovenia Members of the European Polysaccharide Network of Excellence (EPNOE) Austria

Three-dimensional (3D) and porous scaffolds made from nanocellulosic materials hold significant potential in tissue engineering (TE). Here, we present a protocol for fabricating self-standing (nano)cellulose-based 3D scaffolds designed for in vitro testing of cells from skin and cartilage tissues. We describe steps for preparation of nanocellulose ink, scaffold formation using 3D printing, and freeze-drying. We then detail post-processing procedures to enhance mechanical properties, stability, and biocompatibility. This protocol offers researchers a framework for developing versatile and sustainable biomaterials for regenerative medicine. For complete details on the use and execution of this protocol, please refer to Mohan et al.¹ and Štiglic et al.² © 2025 The Authors

关键词： Biotechnology and bioengineering Chemistry Material sciences Tissue engineering

来源：评论

学校读者我要写书评

暂无评论

Modelling of charging effects in plasma immersion ion implantation

引用

Nuclear Instruments & Methods in Physics Research, Section B: Beam Interactions with Materials and Atoms 1995年第1-2期96卷 435-435页

作者： En, W. Cheung, N.W. Plasma Assisted Materials Processing Laboratory Department of Electrical Engineering and Computer Sciences University of California Berkeley CA 94720 USA

The charging effects of plasma immersion ion implantation on several device structures is simulated. The simulations use an analytical model which couples the interaction of the plasma and IC devices during plasma implantation. The plasma model is implemented within the circuit simulator SPICE, which allows the model to uses all of the IC device models existing within SPICE. The model of the Fowler-Nordheim tunneling current through thin gate oxides of MOS devices is demonstrated, and shown how it can be used to quantify the damage induced. Charging damage is shown to be strongly affected by the device structure.

关键词：

来源：评论

学校读者我要写书评

暂无评论

IMAGE SEQUENCE CODING BY SPLIT AND MERGE

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1991年第12期39卷 1845-1855页

作者： WILLEMIN, P REED, TR KUNT, M Signal and Image Processing Laboratory Swiss Federal Institute of Technology Lausanne Switzerland Department of Electrical Engineering and Computer Science University of California Davis CA USA

This paper describes a method for reducing the information contained in an image sequence, while retaining the information necessary for the interpretation of the sequence by a human observer. The method consists of first locating the redundant information, reducing the degree of redundancy, and coding the result. The sequence is treated as a single 3-D data volume, the voxels of which are grouped into several regions, obtained by a 3-D split and merge algorithm. To find these regions, we first obtain an initial region space by splitting the image sequence until the gray-level variation over each region can be approximated by a 3-D polynomial, to a specified accuracy. This results in a set of parallelepipedic regions of various sizes. To represent the gray-level variation over these regions, the coefficients of the approximating polynomial are used as features. The most similar regions are then merged, using a region adjacency graph. The information is coded by representing the borders of the regions using a pyramidal structure in the x, y, t space. The coefficients of the approximating polynomials are coded in a straightforward manner. For 256 x 256 pixel, 25 frames/s image sequences, compressions allowing transmission rates near 64 kbit/s are obtained.

关键词： Image sequences Image coding Pixel Bandwidth Layout Polynomials Image segmentation Humans Helium ISDN

来源：评论

学校读者我要写书评

暂无评论

NEARLY ISOTROPIC ETCHING OF 6H-SIC IN NF3 AND O2 USING A REMOTE PLASMA

引用

APPLIED PHYSICS LETTERS 1993年第2期63卷 171-173页

作者： LUTHER, BP RUZYLLO, J MILLER, DL Electronic Materials and Processing Research Laboratory Department of Electrical and Computer Engineering Pennsylvania State University University Park Pennsylvania 16802

Nearly isotropic etching of the 6H-SiC carbon face has been achieved in a remote plasma at 330-degrees-C using a mixture of O2 and NF3 in argon. Using evaporated aluminum as a mask, undercutting has been observed to a distance equal to the etch depth. The etch rate is a function of the ratio Of O2 to NF3 flow rates and of temperature, peaking strongly to 220 nm/min at 82% oxygen for 330-degrees-C. Smooth surfaces were obtained for gas ratios leading to the maximum etch rate, and also for a NF3-argon mixture, with significant roughening observed for other O2-NF3-argon mixtures. In the absence of a practical wet etch for SiC, this procedure is promising for isotropic etching in SiC device processing.

关键词： SILICON CARBIDES ETCHING PLASMA SURFACE REACTIONS ISOTROPY REACTION RATES GAS FLOW SURFACE STRUCTURE

来源：评论

学校读者我要写书评

暂无评论

Improving vertex-frontier based GPU breadth-first search

引用

Journal of Central South University 2014年第10期21卷 3828-3836页

作者：杨博卢凯高颖慧徐凯王小平程志权 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology College of Computer National University of Defense Technology Department of Electronic Science and Engineering National University of Defense Technology Avatar Science Company

Breadth-first search(BFS) is an important kernel for graph traversal and has been used by many graph processing applications. Extensive studies have been devoted in boosting the performance of BFS. As the most effective solution, GPU-acceleration achieves the state-of-the-art result of 3.3×109 traversed edges per second on a NVIDIA Tesla C2050 GPU. A novel vertex frontier based GPU BFS algorithm is proposed, and its main features are three-fold. Firstly, to obtain a better workload balance for irregular graphs, a virtual-queue task decomposition and mapping strategy is introduced for vertex frontier expanding. Secondly, a global deduplicate detection scheme is proposed to remove reduplicative vertices from vertex frontier effectively. Finally, a GPU-based bottom-up BFS approach is employed to process large frontier. The experimental results demonstrate that the algorithm can achieve 10% improvement over the state-of-the-art method on diverse graphs. Especially, it exhibits 2-3 times speedup on low-diameter and scale-free graphs over the state-of-the-art on a NVIDIA Tesla K20 c GPU, reaching a peak traversal rate of 11.2×109 edges/s.

关键词： breadth-first search GPU graph traversal vertex frontier

来源：评论

学校读者我要写书评

暂无评论

An Efficient and Flexible Deterministic Framework for Multithreaded Programs

引用

Journal of computer Science & Technology 2015年第1期30卷 42-56页

作者：卢凯周旭王小平 Tom Bergan 陈沉 Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China Department of Computer Science and Engineering University of Washington Seattle WA 98195-2350 U.S.A.

Determinism is very useful to multithreaded programs in debugging, testing, etc. Many deterministic ap- proaches have been proposed, such as deterministic multithreading （DMT） and deterministic replay. However, these sys- tems either are inefficient or target a single purpose, which is not flexible. In this paper, we propose an efficient and flexible deterministic framework for multithreaded programs. Our framework implements determinism in two steps： relaxed determinism and strong determinism. Relaxed determinism solves data races eificiently by using a proper weak memory consistency model. After that, we implement strong determinism by solving lock contentions deterministically. Since we can apply different approaches for these two steps independently, our framework provides a spectrum of deterministic choices, including nondeterministic system （fast）, weak deterministic system （fast and conditionally deterministic）, DMT system, and deternfinistic replay system. Our evaluation shows that the DMT configuration of this framework could even outperform a state-of-the-art DMT system.

关键词： determinism multithreading framework flexible

来源：评论

学校读者我要写书评

暂无评论

Efficient detection of restricted classes of global predicates 9th

Efficient detection of restricted classes of global predicat...

引用

9th International Workshop on Distributed Algoriths, WDAG 1995

作者： Chase, Craig M. Garg, Vijay K. Parallel and Distributed Systems Laboratory Electrical and Computer Engineering Department The University of Texas at Austin United States

ISBN: (纸本)3540602747

We show that the problem of predicate detection in distributed systems is NP-complete. We introduce a class of predicates, linear predicates, such that for any linear predicate B there exists an efficient detection of the least cut satisfying B. The dual of linearity is post-linearity. These properties generalize several known properties of distributed systems, such as the set of consistent cuts forms a lattice, and the WCP and GCP predicate detection results given in earlier work. We define a more general class of predicates, semi-linear predicates, for which efficient algorithms are known to detect whether a predicate has occurred during an execution of a distributed program. However, these methods may not identify the least such cut. Any stable predicate is an example of a semi-linear predicate. In addition, we show that certain unstable predicates can also be semi-linear, such as mutual exclusion violation. Finally, we show application of max-flow to the predicate detection problem. This result solves a previously open problem in predicate detection, establishing the existence of an efficient algorithm to detect predicates of the form X1 + x2… +xn i are variables on different processes, k is some constant, and n is larger than 2. © Springer-Verlag Berlin Heidelberg 1995.

关键词： computers

来源：评论

学校读者我要写书评

暂无评论

Bandwidth Allocation with Minimum Rate Constraints in Cluster-based Femtocell Networks

引用

International Journal of Automation and computing 2015年第1期12卷 77-82页

作者： Kai Ma Liang Li Jie Yang Zhi-Xin Liu Xin-Bin Li Xin-Ping Guan School of Electrical Engineering Key Laboratory of Industrial Computer Control Engineering of Hebei Province Yanshan University Department of Automation Shanghai Jiao Tong University Key Laboratory of System Control and Information ProcessingMinistry of Education

Inter-femtocell interference becomes serious when femtocells are densely deployed. To mitigate the inter-femtocell interference, this paper proposes a cluster-based bandwidth allocation algorithm. We create femtocell clusters by constructing a weighted interference graph and allocate bandwidth to each cluster based on a Nash bargaining solution(NBS). Simulation results show that the cluster-based bandwidth allocation algorithm can reduce the inter-femtocell interference and meet the minimum rate constraint of each cluster.

关键词： Femtocell cluster inter-femtocell interference bandwidth allocation Nash bargaining solution(NBS)

来源：评论

学校读者我要写书评

暂无评论

Compact Model Build Upon Dynamic Weighting Artificial Neural Network Approach for Complementary Field Effect Transistors

引用

IEEE Transactions on Electron Devices 2024年第1期71卷 246-253页

作者： Butola, Rajat Li, Yiming Kola, Sekhar Reddy National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program Hsinchu300093 Taiwan Institute of Pioneer Semiconductor Innovation The Institute of Artificial Intelligence Innovation National Yang Ming Chiao Tung University Parallel and Scientific Computing Laboratory Electrical Engineering and Computer Science International Graduate Program The Institute of Communications Engineering the Institute of Biomedical Engineering Department of Electronics and Electrical Engineering Hsinchu300093 Taiwan

In this work, a dynamic weighting-artificial neural network (DW-ANN) methodology is presented for quick and automated compact model (CM) generation. It takes advantage of both TCAD simulations for high accuracy and SPICE simulations for cost-effectiveness. This methodology is developed for gate-all-around (GAA) silicon (Si) nanosheet (NS) complementary field effect transistor (CFET), a potential candidate for future CMOS technology due to its innate properties. The critical process variation (PV) sources that severely degrade the CFET performance are estimated using DW-ANN. It reduces the computation cost and predicts the effects of PV sources with less than 1% error. Furthermore, a compact DW-ANN-based Verilog-A model has been developed that captures the dc as well as transient behavior accurately for circuit-level analysis. CFET-based circuits such as inverter, 6T-static random access memory (SRAM), and ring oscillator (RO) are characterized and implemented using DW-ANN-based CM. The overall average error of the model is reported as less than 2%. Therefore, the proposed device and circuit modeling approach provides a feasible solution for the rapid compact modeling of new emerging devices with good convergence and high accuracy. © 1963-2012 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：