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

22nd international conference on Compound Semiconductor Manufacturing Technology, CS MANTECH 2007

作者： Chen, Nelson Lin, Scotie Lin, C.K. Chu, Wen Yeh, Paul Chou, H.C. Liu, Joe Wu, C.S. WIN Semiconductors Corporation Hwaya Technology Park No.69 Technology 7th Rd Kuei Shan Hsiang Tao Yuan Shien Taiwan

ISBN: (纸本)1893580091

WIN's 0.15um power pHEMT technology has been popularly used by customers to design and produce Kato V-band power amplifier MMICs. It is a robust production technology that produces high performance and high yield PA products. the functional yield is usually high;average Ion/off and breakdown voltage yield are over 75% even for the output power of 4-6W at Ka-band with total gate periphery over 10mm. However, in one particular case, one of the milli-meter-wave high power PA circuits was characterized by relatively low circuit yield. this was attributed to a requirement of more stringent circuit specification of DC/RF characteristics for this special circuit. To improve the circuit yield, both epitaxial structure and wafer process require a more precise and better control. At WIN, we have statistically analyzed and correlated the data among circuits, epitaxial material and process. With very concise and elaborate statistical data analysis and physical understanding on all parameters, including circuits, epitaxial material and process, we have made a significant improvement of circuit yield. In this paper, we will present our statistical analytical approach and data analysis that leads to a significant improvement of a 0.15um high power pHEMT circuit yield.

关键词： Power amplifiers

来源：评论

学校读者我要写书评

暂无评论

Comparative Study of Clustering Techniques for the Organization of Software Repositories

Comparative Study of Clustering Techniques for the Organizat...

引用

international conference on Hybrid Intelligent Systems (HIS)

作者： Ronaldo C. Veras Silvio R. L. Meira Adriano L. I. Oliveira Bruno J. M. Melo Center of Informatics Federal University of Pernambuco (UFPE) Brazil Department of Computing Systems Polytechnic School University of Pernambuco (UPE) Brazil

Software reuse is essential for improving the productivity and quality of software projects. One of the key issues to promote the adoption of software reuse in companies is the development of effective repositories of software components. It is also very important to have good methods for searching and retrieval of the components. Clustering techniques can help by providing a visualization of the repository of software components as well as in helping to refine the searches by grouping together similar components. In this paper we quantitatively compare two clustering techniques, namely, self-organizing maps (SOM) and growing hierarquical SOM (GHSOM) for clustering a repository of classes from a Java API for building mobile systems. the performance measure was the quantization error. the simulations have shown that GHSOM outperforms SOM in these tasks. GHSOM is more suitable for this task because it is a constructive technique, which is an advantage in tackling the growth of the repository of software components.

关键词： Software quality Java Application software programming Productivity Visualization Self organizing feature maps Quantization Software reusability Machine learning

来源：评论

学校读者我要写书评

暂无评论

IEEE 7th BIBE Research Tutorial Lecture: Decoding Novel Genomes: From Microbiomes to the Eukaryota

IEEE 7th BIBE Research Tutorial Lecture: Decoding Novel Geno...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Mark Borodovsky Department of Biomedical Engineering and Division of Computational Science Georgia Institute of Technology Atlanta GA USA

One of the main goals of computational genomics is fast and accurate biological interpretation of newly sequenced genomic DNA. the complexity of the task varies among genomes but is never simple. Currently, for a new genome a custom built annotation pipeline is constructed by integration of ab initio and comparative genomic methods. Still, a consistent solution of the jigsaw puzzle of genome annotation frequently requires additional experimental efforts (such as EST/cDNA sequencing, etc.) Current ab initio gene finding algorithms use statistical analysis and optimization to solve the gene identification problem restated as search for the optimal parse of the genomic sequence into fragments with distinct statistical characteristics. this problem setting leads to a classic task for dynamic programming: search for an optimal path through a network with weights/scores assigned to nodes and vertices. Obviously, assignment of weights/scores plays a critical role and may present a significant challenge. this task is equivalent to estimation of parameters of statistical models (hidden Markov models) representing a mosaic of functional sequences and sites in a given genome. the task is rather easy when large sets of validated training sequences are available. However, it is not the case for hundreds of currently unfolding genome sequencing and annotation projects. In the lecture we will consider the general schemes of ab initio gene prediction. We will discuss estimation of model parameters without a training set. We will show that this unsupervised approach is possible and is becoming very important for two rapidly developing branches of genomics: i/ for prokaryotic metagenomes that are becoming a rich source of information about non-cultivated microbial species and ii/ for "compact" eukaryotic genomes, such as fungi, which relatively short genome size (less than 50 MB) allows to obtain complete genome sequence in a relatively short time.

关键词： Genomics Bioinformatics Sequences Parameter estimation Hidden Markov models Biology computing DNA computing Pipelines Statistical analysis Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Rewriting haskell strings 07

引用

Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

作者： Duncan Coutts Don Stewart Roman Leshchinskiy Programming Tools Group Oxford University Computing Laboratory Computer Science & Engineering University of New South Wales

ISBN: (纸本)9783540696087

the Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict arrays with lazy evaluation. Equational transformations based on term rewriting are used to deforest intermediate ByteStrings automatically. We describe novel fusion combinators with improved expressiveness and performance over previous functional array fusion strategies. A library for ByteStrings is implemented, providing a purely functional interface, which approaches the speed of low-level mutable arrays in C.

关键词： deforestation functional programming program fusion

来源：评论

学校读者我要写书评

暂无评论

Data Discretization Unification

Data Discretization Unification

引用

7th IEEE international conference on Data Mining (ICDM 2007)

作者： Ruoming Jin Yuri Breitbart Chibuike Muoh Department of Computer Science Kent University Kent OH USA

Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove that discretization methods based on informational theoretical complexity and the methods based on statistical measures of data dependency are asymptotically equivalent. Furthermore, we define a notion of generalized entropy and prove that discretization methods based on MDLP, Gini Index, AIC, BIC, and Pearson's X~2 and G~2 statistics are all derivable from the generalized entropy function. We design a dynamic programming algorithm that guarantees the best discretization based on the generalized entropy notion. Furthermore, we conducted an extensive performance evaluation of our method for several publicly available data sets. Our results show that our method delivers on the average 31 percent less classification errors than many previously known discretization methods.

关键词： Entropy Data mining Statistics Dynamic programming Computer science Algorithm design and analysis Heuristic algorithms Error analysis Bayesian methods Association rules

来源：评论

学校读者我要写书评

暂无评论

Design and Optimization of Highly Linear CMOS Low Noise Amplifiers via Geometric programming

Design and Optimization of Highly Linear CMOS Low Noise Ampl...

引用

2007 7th international conference on ASIC Electronic Version(ASICON 2007)

作者： Wai-Kit So Wing-Tai Cheung Hing-Kit Kwan Ngai Wong Department of Electrical and Electronic Engineering The University of Hong Kong Pokfulam Road Hong Kong

Linearity is an important measurement for the performance of a CMOS low noise amplifier(LNA).the high computational cost required in the linearity simulation,however,constitutes a major bottleneck in the design verification *** this paper,we develop a novel and systematic Geometric programming(GP)-based approach for the optimized design of a highly linear CMOS LNA,subject to the minimization of the noise *** confirm the remarkable efficacy and accuracy of the proposed design flow against traditional simulators.

关键词： LNA Design and Optimization of Highly Linear CMOS Low Noise Amplifiers via Geometric programming

来源：评论

学校读者我要写书评

暂无评论

Real-time cooperative behavior acquisition by a humanoid apprentice

Real-time cooperative behavior acquisition by a humanoid app...

引用

IEEE-RAS international conference on Humanoid Robots

作者： Peter Ford Dominey Anthony Mallet Eiichi Yoshida EMC-NCRM CNRS University of Lyon 2 Bron France LAAS CNRS Toulouse France Advanced Industrial Science and Technology (AIST) CNRS Joint Japanese-French Robotics Laboratory (JRL) National Institute Tsukuba Ibaraki Japan

An apprentice is an able-bodied individual that should interactively assist an expert, and through this interaction, they should acquire knowledge and skill in the given task domain. In this context the robot should have a useful repertoire of sensory-motor acts that the human can command with spoken language. In order to address the additional requirements for learning new behaviors, the robot should additionally have a real-time behavioral sequence acquisition capability. the learned sequences should function as executable procedures that can operate in a flexible manner that are not rigidly sensitive to initial conditions. the current research develops these capabilities in a real-time control system for the HRP-2 humanoid. the task domain involves a human and the HRP-2 working together to assemble a piece of furniture. We previously defined a system for Spoken Language programming (SLP) that allowed the user to guide the robot through an arbitrary, task relevant, motor sequence via spoken commands, and to store this sequence as re-usable macro. the current research significantly extends the SPL system: It integrates vision and motion planning into the SLP framework, providing a new level of flexibility in the behviora that can be created. Most important it allows the user to create ldquogenericrdquo functions with arguments (e.g. Give me X), and it allows multiple functions to be created. We thus demonstrate - for the first time - a humanoid robot equipped with vision based grasping, and the ability to acquire multiple sensory motor behavioral procedures in real-time through SLP in the context of a cooperative task. the humanoid robot thus acquires new sensory motor skills that significantly facilitate the cooperative human-robot interaction.

关键词： Robot sensing systems Humans Natural languages Humanoid robots Real time systems Control systems Robotic assembly Robot programming Machine vision Motion planning

来源：评论

学校读者我要写书评

暂无评论

Design of NOR flash memory cells with high speed programming by utilizing an asymmetric Silicide（TiSi2） Drain

Design of NOR flash memory cells with high speed programming...

引用

2007 7th international conference on ASIC Electronic Version(ASICON 2007)

作者： Kyeong-Rok Kim Jung-Woo Lee Sang-Su Park Kae-Dal Kwack Division of Electronics and Computer Engineering Hanyang University17 Haendang-dongSeongdong-guSeoul 133-791Korea

An unique not-OR(NOR) flash memory cell using an asymmetric Schottky barrier(SB) was designed to increase programming speed and driving *** asymmetric SB NOR flash memory cell was proposed on the basis of the fundamental structure of the conventional NOR flash memory cells with a length of 90 *** programming speed and the driving current of the SB NOR flash memory cell with an asymmetric SB were simulated by using T-SUPREM4 and *** simulation results showed that the heavily doped carriers existing in the titanium-disilicide Schottky drain can be used to increase programming speed of the SB NOR flash memory cell and that a decrease in the source/drain series resistance utilizing the silicide in the SB NOR flash memory cell help to increase driving current density.

关键词： NOR Design of NOR flash memory cells with high speed programming by utilizing an asymmetric Silicide Drain TiSi2

来源：评论

学校读者我要写书评

暂无评论

Applications, implementation and performance evaluation of bit stream programming in erlang 07

引用

Proceedings of the 9th international conference on Practical Aspects of Declarative Languages

作者： Per Gustafsson Konstantinos Sagonas Uppsala University and Ericsson AB Sweden National Technical University of Athens Greece

ISBN: (纸本)9783540696087

Writing code that manipulates bit streams is a painful and error-prone programming task, often performed via bit twiddling techniques such as explicit bit shifts and bit masks in programmer-allocated buffers. Still, this kind of programming is necessary in many application areas ranging from decoding streaming media files to implementing network protocols. In this paper we employ high-level constructs from declarative programming, such as pattern matching at the bit level and bit stream comprehensions, and show how a variety of bit stream programming applications can be written in a succinct, less error-prone, and totally memory-safe manner. We also describe how these constructs can be implemented efficiently. the resulting performance is superior to that of other (purely) functional languages and competitive to that of low-level languages such as C.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Explicit consideration of multiple objectives in cellular manufacturing

引用

ENGINEERING OPTIMIZATION 2007年第5期39卷 551-565页

作者： Dimopoulos, C. Cyprus Coll Sch Engn & Comp Sci CY-1516 Nicosia Cyprus

Although many methodologies have been proposed for solving the cell-formation problem, few of them explicitly consider the existence of multiple objectives in the design process. In this article, the development of multi-objective genetic programming single-linkage cluster analysis (GP-SLCA), an evolutionary methodology for the solution of the multi-objective cell-formation problem, is described. the proposed methodology combines an existing algorithm for the solution of single-objective cell-formation problems with NSGA-II, an elitist evolutionary multi-objective optimization technique. Multi-objective GP-SLCA is able to generate automatically a set of non-dominated solutions for a given multi-objective cell-formation problem. the benefits of the proposed approach are illustrated using an example test problem taken from the literature and an industrial case study.

关键词： cellular manufacturing multi-objective optimization cell-formation problem evolutionary algorithms genetic programming NSGA

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：