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

IEEE Asia-Pacific Conference on Circuits and systems

作者： Soo-Hyun Park Sang-Hoon Park Doo-Kwon Baik Central Research Center LG Information and Communications Limited Seoul South Korea Software System Laboratory Department of Computer Science & Engineering Korea University Seoul South Korea

ISBN: (纸本)0780351460

The Farmer model is a basic model of the farming methodology that loads the component defined in the aspect-object from the PICR into the distributed object after analyzing the real world entity in various aspects and defining the aspect elements as the Aspect-Object. This model is a model that formalizes the concept of downloading the componentware from the PICR to the distributed entity node type that describes the abstract object, the aspect node type that describes this object, the link type that shows the relativity between the entity and the aspect, and the attribute type that shows the characteristics of the entity. In this paper, the platform independent TMN agents are designed by the diagram of the Farmer model.

关键词： Object oriented modeling Knowledge representation computer network management engineering management Software systems computer science Information analysis

来源：评论

学校读者我要写书评

暂无评论

Load adjustment and filtering based on process criticality

Load adjustment and filtering based on process criticality

引用

IEEE International Conference on Embedded and Real-Time Computing systems and Applications (RTCSA)

作者： Tei-Wei Kuo Shie-Kai Ni Giun-Haur Huang Real Time Systems Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Chiayi Taiwan Department of New Technology Development Platform Software Division Acer Incorporated Taipei Taiwan System Software Laboratory Institute for Information Industry Taipei Taiwan

ISBN: (纸本)081869209X

This paper generalizes the load scaling techniques proposed in (Kuo and Mok, 1991) for fixed-priority real-time applications. A framework is proposed to adjust the system workload by relating the criticality and flexibility of a process to the resource allocation problem. A load adjustment procedure based on the approximation algorithm (Ni et al., 1997) is proposed to maximize the system profit in an on-line fashion. When the list of allowable configurations is implicitly given by scalable periodic processes, the corresponding load filtering problem is shown to be NP-complete. We also prove the upper bound of the system profit and provide a mechanism to balance the schedulability and the maximum profit of the system.

关键词： Filtering Resource management Job shop scheduling Timing Real time systems Approximation algorithms Upper bound Laboratories Frequency computer science

来源：评论

学校读者我要写书评

暂无评论

Primary structures of sperm-specific basic nuclear proteins and gene expression in Japanese newt, Cynops pyrrhogaster

引用

Molecular Reproduction and Development 1998年第3期46卷

作者： Kumiko Yoshinobu Toshihiro Kondo Masayuki Takai Chiaki Katagiri Hiroyuki Tou Shin-Ichi Abe Kazufumi Takamune Gene Technology Center Kumamoto University Kumamoto Japan Department of Biological Science Faculty of Science Kumamoto University Kumamoto Japan Central Laboratory for Medical Study and Research Equipment Saga Medical School Saga Japan Biological Laboratory Saga Medical School Saga Japan Division of Biological Science Graduate School of Science Hokkaido University Sapporo Japan Department of Biochemical Engineering and Science Faculty of Computer Science and System Engineering Kyusyu Institute of Technology Iizuka Japan

Electrophoretic analyses of acid extracts from mature sperm of newt, Cynops pyrrhogaster, on acid/urea/Triton X-100 polyacrylamide gel showed the exclusive occurrence of sperm-specific nuclear basic proteins (SBPs), which moved faster than somatic histones on the gel. These SBPs were eluted separately by reversed phase-high-performance liquid chromatography as two large peaks and a few small peaks. Of these, only the small peaks disappeared with treatment of the acid extracts with alkaline phosphatase before they were injected into the column, so that there were only two distinct components: NP1 and NP2. Determination of amino acid sequences by the Edman method as well as by sequencing of cDNA for both components indicated that each protein consisted of 43 (NP1) or 48 (NP2) amino acid residues, rich in arginine residues (53.5% in NP1; 47.9% in NP2), forming the clusters. They had molecular masses of 5,386 Da (NP1) and 5,748 Da (NP2), respectively. Northern blot analysis using cDNAs as probes indicated that mRNAs for both NP1 and NP2 occurred not in primary spermatocytes but in round spermatids. In situ hybridization analyses using antisense RNA for NP1 as a probe clearly showed the first appearance of NP1 mRNA at the late stage of round spermatid. Mol. Reprod. Dev. 46:243–251, 1997. © 1997 Wiley-Liss, Inc.

关键词： protamine spermatogenesis testis amphibian

来源：评论

学校读者我要写书评

暂无评论

QoS allocation of multicast connections in ATM

QoS allocation of multicast connections in ATM

引用

IEEE International Conference on Embedded and Real-Time Computing systems and Applications (RTCSA)

作者： June-Wei Chen Ren-Hung Hwang Sing-Ling Lee Advanced System Integration Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Taiwan

ISBN: (纸本)0818680733

We study the resource allocation problem and call admission problem for multicast applications in ATM networks. Two approaches are proposed for dividing the end-to-end QoS requirement into the local QoS constraint on each link of the multicast tree. The first approach is to apply the greedy method to divide the end-to-end QoS based on the residual capacity on the links. In the second approach we show how to use a genetic algorithm to solve the QoS allocation problem. The effective bandwidth concept is used for estimating the amount of bandwidth required to guarantee a certain level of QoS on each link. If the end-to-end QoS cannot be guaranteed due to insufficient network resources, the multicast request is rejected (as a result of call admission). A new performance metric, fractional reward loss, is adopted for evaluating the solutions generated by the proposed two approaches. Our experiment results show that our approaches yield lower fractional reward loss and utilize the network resources more efficiently.

关键词： Quality of service Resource management Measurement Genetic algorithms Routing Biological cells Laboratories computer science Application software Bandwidth

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution 3

An efficient local address generation for the block-cyclic d...

引用

3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997

作者： Kwon, Oh-Young Kim, Tae-Geun Han, Tack-Don Yang, Sung-Bong Kim, Shin-Dug Distributed Computing Lab. Systems Engineering Research Institute 1 Ueun-dong Yusong-gu Taejon305-333 Korea Republic of Parallel Processing System Laboratory Dept. of Computer Science Yonsei University Seoul120-749 Korea Republic of

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time ΔM table generation method is faster than other algorithms in ΔM table generation time and access time for 10,000 array elements. © 1997 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

Hybrid checkpointing protocol based on selective-sender-based message logging

Hybrid checkpointing protocol based on selective-sender-base...

引用

International Conference on Parallel and Distributed systems (ICPADS)

作者： Kwang-Sik Chung Ki-Bom Kim Chong-Sun Hwang Jin Gon Shon Heon-Chang Yu Department of Computer Science and Engineering Distributed System Laboratory Korea University South Korea Department of Computer Science Korea National Open University South Korea Department of Computer Engineering Seo Kyeong University South Korea

ISBN: (纸本)0818682272

This paper presents a hybrid checkpointing protocol-an asynchronous checkpointing protocol using a message sending/receiving state change for reducing the overhead of failure-free operation combined with a selective sender-based message logging protocol for reducing the cascade rollback of asynchronous checkpointing protocol. The selective sender-based message logging protocol records only potential orphan messages when taking a checkpoint. And this paper presents a message dependency tree recording the inter-process message sending/receiving information on a volatile storage for reducing the search time of inter-process information during the failure recovery.

关键词： Checkpointing Protocols Fault tolerant systems Message passing Counting circuits

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution

An efficient local address generation for the block-cyclic d...

引用

IEEE International Conference on Algorithms and Architectures for Parallel Processing (ICAP)

作者： Oh-Young Kwon Tae-Geun Kim Tack-Don Han Sung-Bong Yang Shin-Dug Kim Distributed Computing Laboratory Systems Engineering Research Institute Taejon South Korea Parallel Processing System Laboratory Department of Computer Science Yonsei University Seoul South Korea

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time /spl Delta/M table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a /spl Delta/M table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time /spl Delta/M table generation method is faster than other algorithms in /spl Delta/M table generation time and access time for 10,000 array elements.

关键词： Runtime Equations Distributed computing systems engineering and theory Parallel processing Laboratories computer science Parallel languages Upper bound Automata

来源：评论

学校读者我要写书评

暂无评论

Recurrent canonical piecewise linear network for blind equalization

Recurrent canonical piecewise linear network for blind equal...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Xiao Liu T. Adali Information Technology Laboratory Department of Computer Science and Electrical Engineering University of Maryland Baltimore County Baltimore MD USA University System of Maryland Adelphi MD US

The recurrent canonical piecewise linear (RCPL) network is applied to nonlinear blind equalization by generalizing Donoho's minimum entropy deconvolution approach. We first study the approximation ability of the canonical piecewise linear (CPL) network and the CPL based distribution learning for blind equalization. We then generalize these conclusions to the RCPL network. We show that nonlinear blind equalization can be achieved by matching the distribution of the channel input with that of the RCPL equalizer output. A new blind equalizer structure is constructed by using RCPL network and decision feedback. We discuss application of various cost functions to RCPL based equalization and present experimental results that demonstrate the successful application of RCPL network to blind equalization.

关键词： Piecewise linear techniques Piecewise linear approximation Blind equalizers Random processes Delay effects

来源：评论

学校读者我要写书评

暂无评论

Time Optimal Seek Control For A Coupled Dual Stage Disk Drive Actuator

Time Optimal Seek Control For A Coupled Dual Stage Disk Driv...

引用

International Conference on Magnetics (INTERMAG)

作者： Jian-Dong Yang Long-Fa Pan Xian-Deng Pei Chang-Sheng Xie Xiang-Ying Cao Duan-Yi Xu Optical Memory National Engineering Research Center Tsinghua University Beijing China National Laboratory of Storage System Department of Computer Sci. & Engineering Huazhong University of Science and Technology Wuhan China

来源：评论

学校读者我要写书评

暂无评论

A rough set approach for planner evaluation

A rough set approach for planner evaluation

引用

IEEE International Conference on systems, Man and Cybernetics

作者： B.K. Sy Wang Jiaxin Pattern Analysis and Machine Intelligence Group System Design Engineering Department University of Waterloo Waterloo ONT Canada Department of Computer Science CUNY Flushing NY USA The State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing China

This paper discusses a rough set approach for evaluating solutions of scheduling problems. Algorithms for solving scheduling problems are planners and the scheduling problems are modelled as constraint satisfaction problems. Conventional approach for the analysis of algorithms often focuses on the time and representational complexities, and assumes an identical cost on all operations. The proposed rough set approach augments conventional approaches for the analysis of algorithms in two ways: 1) it permits the consideration of different costs arising from different operations; and 2) it allows one to define a new utility for a complexity analysis.

关键词： Algorithm design and analysis Processor scheduling Set theory Machine intelligence computer science Costs Search problems Educational institutions Pattern analysis system analysis and design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：