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

International Technology and Innovation Conference 2006, ITIC 2006

作者： Zhang, Tao Zhang, Yuejie Sch. of Inf. Manage. and Eng. Shanghai Univ. of Finance and Econ. Shanghai 200433 China Department of Computer Science and Engineering Fudan University Shanghai 200433 China

ISBN: (纸本)0863416969

Analyzing the common grounds and the different aspects between the iron-steel industry and the mechanical manufacture industry, this paper constructs the architecture of MTO planning management system for the iron-steel factory, combining the market's demand with the specialties of the iron-steel industry. Supported by this architecture, this paper analyzes the technologic characters of the steel manufacture and presents the mathematics models and solution strategy for order planning. Regarding the five-day as the least time unit and minimizing the earliness-tardiness penalties as the goal, an integer programming models for the order planning is created. The genetic algorithm based on the repeatable natural number coding and 3-mutation operator is used as the solution strategy. The search methods include the interior-point method (IPM) and the outer-point method (OPM). This hybrid search method ensures the global property of searching. At last, the order planning of a famous factory is used as the instance in the experimentation and the model parameters are analyzed. The numerical analysis shows that the model comes up to the production process, the solutions obtained by this algorithm are superior to those obtain by the human-machine system. So, the model and algorithm are valid.

关键词： Iron and steel industry

来源：评论

学校读者我要写书评

暂无评论

Notice of Violation of IEEE Publication Principles: Multi-paradigm and Multi-grain Parallel Execution Model Based on SMP-Cluster

Notice of Violation of IEEE Publication Principles: Multi-pa...

引用

IEEE John Vincent Atanasoff International Symposium on Modern Computing, JVA

作者： Jue Wang Changjun Hu Jianxin Lai Yudi Zhao Suqin Zhang Computer Science and Technology Department Tsinghua University Beijing China Inf. Eng. Sch. Univ. of Sci. & Technol. Beijing Information Engineering School University of Science and Technology Beijing China Information Engineering School University of Science and Technology Beijing Information Engineering School University of Science and Technology Beijing China

Notice of Violation of IEEE Publication Principles "Multi-paradigm and Multi-grain Parallel Execution Model Based on SMP-Cluster," by Jue Wang, Changjun Hu, Jianxin Lai, Yudi Zhao, and Suqin Zhang, in the Proceedings of the IEEE John Vincent Atanasoff 2006 International Symposium on Modern Computing, 2006 (JVA '06) pp.266-272 After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles. This paper contains portions of original text from the papers cited below. The original text was copied without appropriate attribution. "Comparing the OpenMP, MPI, and Hybrid Programming Paradigm on an SMP Cluster," by Gabriele Jost, Haoqiang Jin, Dieter an Mey, and Ferhat F. Hatay, in IEEE Transactions on Parallel and Distributed Systems, 10(2), February 1999 In this paper, we propose a multi-paradigm and multi-grain parallel execution model based on SMP-Cluster, which integrates coarse grain, mid grain and fine grain parallelism. Multiple paradigms supported by our model include task parallel, data parallel, sequential execution, data pipeline and task-farming paradigm. It can be achieved by extending the OpenMP specification, and the extensions include directives for computing resource partition, data distribution and alignment, sequential execution and data pipeline, and functions for Master/Slave model in Macro-Task group. We also compare the performance of different implementations of three benchmark applications, using the same numerical algorithm but employing different programming approaches

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning Generalized Weighted Relevance Aggregation Operators Using Levenberg-Marquardt Method

Learning Generalized Weighted Relevance Aggregation Operator...

引用

International Conference on Hybrid Intelligent Systems (HIS)

作者： B.S.U. Mendis T.D. Gedeon L.T. Koczy Department of Computer Science Australian National University Canberra Australia Institute of Inf. Technology and Elec. Engineering Széchenyi István University Gyor Hungary Department of Telec. & Media Budapest University of Technology and Economics Budapest Hungary

We previously introduced the generalized Weighted Relevance Aggregation Operators (WRAO) for hierarchical fuzzy signatures. WRAO enhances the ability of the fuzzy signature model to adapt to different applications and simplifies the learning of fuzzy signature models from data. In this paper we overcome the practical issues which occur when learning WRAO from data. This paper discuss an algorithm for learning WRAO using the Levenberg- Marquardt (LM) method, which is one of the most sophisticated and widely used gradient based optimization method. Also, this paper shows the successful results of applying the proposed algorithm to extract WRAO for two real world problems namely High Salary Selection and SARS Patient Classification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A multilayer topic-group based P2P network

A multilayer topic-group based P2P network

引用

International Conference on Advanced inf.rmation Networking and Applications (AINA)

作者： SyuYang Chen Wen-Hsien Tseng Hsing Mei Department of Computer Science and Information Engineering Fu Jen Catholic University Taiwan Fu Jen Catholic University College of Medicine New Taipei City New Taipei City TW Dept. of Comput. Sci. & Inf. Eng. Fu Jen Catholic Univ. Taiwan

Considering that large and various contents are shared over thousands of peers across a P2P network, one challenging problem is to locate the target content in such a large and unorganized environment. Hence, a P2P system designed with the content classification and managed distribution is more efficient and reliable than the mass and unclassified ones. We propose a MLTG (multilayer topic-group) based P2P network. Two core concepts are integrated into the system structure: topic-group and hierarchic layer. Peers act as local peers, delegate peers and super-peers. These peers spread on different hierarchic layers and the system distributes the correlative resources among the same groups. Compared with the traditional P2P schemes, the MLTG is out-performed significantly. From the experiments, it saves up to 90% of query cost for the case of a single keyword query. When the query consists of topic and keywords, it saves up to 93% of cost. MLTG guarantees the enhancement of successful search and lower consumption of bandwidth. It also makes the system more available, reliable and efficient.

关键词： Nonhomogeneous media Costs Bandwidth Peer to peer computing Switches computer science Content management Filters Distributed computing Filtering

来源：评论

学校读者我要写书评

暂无评论

A new image-based real-time flame detection method using color analysis

A new image-based real-time flame detection method using col...

引用

IEEE International Conference on Networking, Sensing and Control

作者： Wen-Bing Horng Jian-Wen Peng Chih-Yuan Chen Dept. of Comput. Sci. & Inf. Eng. Tamkang Univ. Taipei Taiwan Department of Computer Science and Information Engineering Tamkang University Taipei Taiwan ROC

ISBN: (纸本)0780388127

A new image-based real-time flame detection method is proposed in this paper. First, fire flame features based on the HSI color model are extracted by analyzing 70 flame images. Then, based on these flame features, regions with fire-like colors are roughly separated from an image. Besides segmenting fire flame regions, background objects with similar fire colors or caused by color shift resulted from the reflection of fire flames are also separated from the image. In order to get rid of these spurious fire-like regions, the image difference method and the invented color masking technique are applied. Finally, a simple method is devised to estimate the burning degree of fire flames so that users could be inf.rmed with a proper warning alarm. The proposed method is tested with seven diverse fire flame video clips on a Pentium II 350 processor with 128 MB RAM at the process speed of thirty frames per second. The experimental results are quite encouraging. The proposed method can achieve more than 96.97% detection rate on average. In addition, the system can correctly recognize fire flames within one second on the initial combustion from the test video clips, which seems very promising.

关键词： Image color analysis Fires Image analysis inf.ared detectors Combustion Image segmentation Testing Sampling methods Gray-scale Cameras

来源：评论

学校读者我要写书评

暂无评论

Density-based routing mechanism for sensor networks

Density-based routing mechanism for sensor networks

引用

IEEE Symposium on computers and Communications (ISCC)

作者： Ren-Song Chih-Chung Lai Dept. of Comput. Sci. & Inf. Eng. Nat. Chung Cheng Univ. Taiwan Department of Computer Science and Information Engineering National Chung Cheng University Chia-Yi Taiwan

The main concern of sensor networks is to maintain full coverage of the monitoring areas, not to keep each node alive as long as possible. That is, it is not necessary to keep nodes alive if they are replaceable by their surrounding nodes and the full coverage is still maintained. Thus, we argue that the objective of designing an energy-aware route selection protocol is to prolong the monitoring lifetime of sensor networks, or the duration that sensor networks may maintain full coverage of the monitoring areas, not the power lifetime of individual nodes. In this paper, we propose a density-based route selection protocol, DBR, and introduce a new metric, potential energy, to be used to select the routes that pass through the highly replaceable nodes. We also conduct a simulation to compare DBR with two existing route selection protocols, MTPR and MMBCR, and the result is satisfactory. DBR outperforms MTPR significantly in almost every case, and is better than MMBCR in most cases while slightly worse in some cases.

关键词： Distributed Bragg reflectors Condition monitoring Routing protocols computerized monitoring Spread spectrum communication Batteries computer science Maintenance engineering Electronic mail Potential energy

来源：评论

学校读者我要写书评

暂无评论

Scenario based threat detection and attack analysis

Scenario based threat detection and attack analysis

引用

International Carnahan Conference on Security Technology

作者： Pi-Cheng Hsiu Chin-Fu Kuo Tei-Wei Kuo E.Y.T. Juan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan National Taiwan University Taipei TW Dept. of Comput. Sci. & Inf. Eng. National Taiwan Univ. Taipei Taiwan Department of Computer Science National Taiwan Ocean University Keelung Taiwan

This paper targets two essential issues in intrusion detection system designs: the optimization of rule selection and the attack discovery in attack analysis. A scenario-based approach is proposed to correlate malicious packets and to intelligently select intrusion detection rules to fire. We propose algorithms for rule selection and attack scenario identification. Potential threats and their relationship for a gateway and Web-server applications are explored as an example in the study. The proposed algorithms are implemented over Snort, a signature-based intrusion detection system, for which we have some encouraging performance evaluation results.

关键词： Intrusion detection Databases Web server Fires Intelligent sensors computer science Design optimization inf.rmation security Acceleration Testing

来源：评论

学校读者我要写书评

暂无评论

Approximation algorithms for the optimization problems of SNPs and haplotypes

Approximation algorithms for the optimization problems of SN...

引用

Emerging inf.rmation Technology Conference, EITC

作者： Yao-Ting Huang Kun-Mao Chao Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan National Taiwan University Taipei TW Dept. of Comput. Sci. & Inf. Eng. Nat. Taiwan Univ. Taipei Taiwan

This paper studies two optimization problems in the SNP and haplotype research. The first problem asks for a minimum set of SNPs that can tolerate a certain number of missing data. The second problem asks for a minimum set of haplotypes that can explain a given set of genotypes. We show that both problems are NP-hard and design several approximation algorithms to solve them efficiently. These algorithms have been implemented and tested on both simulated and biological data. Our theoretical analysis and experimental results indicate that these algorithms are able to find solutions close to the optimal solutions.

关键词： Approximation algorithms Iterative algorithms Humans Genetics Robustness Algorithm design and analysis Genomics Bioinf.rmatics Testing Biological system modeling

来源：评论

学校读者我要写书评

暂无评论

Global connectivity for mobile IPv6-based ad hoc networks

Global connectivity for mobile IPv6-based ad hoc networks

引用

International Conference on Advanced inf.rmation Networking and Applications (AINA)

作者： Chiung-Ying Wan Cheng-Ying Li Ren-Hung Hwang Yuh-Shyan Chen Dept. of Comput. Sci. & Inf. Eng. National Chung-Cheng Univ. Chia-Yi Taiwan Department of Communications Engineering National Chung Engineering University Chiayi Taiwan Dept. of Communications Engineering National Chung-Cheng University Chia-Yi Taiwan Department of Computer Science & Information Engineering National Chung Engineering University Chiayi Taiwan Dept. of Computer Science & Information Engineering National Chung-Cheng University Chia-Yi Taiwan

ISBN: (纸本)0769522491

The IPv6-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting MANETs to global IPv6 networks while supporting IPv6 mobility. Specifically, we propose a self-organizing, self-addressing, self-routing IPv6-enabled MANET inf.astructure, referred to as IPv6-based MANET. The proposed self-organization addressing protocol automatically organizes nodes into tree architecture and configures their global IPv6 addresses. Novel unicast and multicast routing protocols, based on longest prefix matching and soft state routing cache, are specially designed for the IPv6-based MANET. Mobile IPv6 is also supported such that a mobile node can move from one MANET to another. Moreover, a P2P inf.rmation sharing system is also designed over the proposed IPv6-based MANET. We have implemented a prototyping system to demonstrate the feasibility and efficiently of the IPv6-based MANET and the P2P inf.rmation sharing system. Simulations are also conducted to show the efficiency of the proposed routing protocol and the P2P file sharing system.

关键词： Ad hoc networks Mobile ad hoc networks Routing protocols Internet Access protocols Mobile communication IP networks computer science computer architecture Joining processes

来源：评论

学校读者我要写书评

暂无评论

Coordinating peer databases using ECA rules

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinf.rmatics) 2004年 2944卷 108-122页

作者： Kantere, Vasiliki Kiringa, Iluju Mylopoulos, John Kementsietsidis, Anastasios Arenas, Marcelo Dept. of Computer Science University of Toronto Canada School of Inf. Technology and Engineering University of Ottawa Canada

ISBN: (纸本)3540209689

Peer databases are stand-alone, independently developed databases that are linked to each other through acquaintances. They each contain local data, a set of mapping tables and expressions, and a set of ECA rules that are used to exchange data among them. The set of acquaintances and peers constitutes a dynamic peer-to-peer network in which acquaintances are continuously established and abolished. We present techniques for specifying data exchange policies on-the-fly based on constraints imposed on the way in which peers exchange and share data. We realize the on-the-fly specification of data exchange policies by building coordination ECA rules at acquaintance time. Finally, we describe mechanisms related to establishing and abolishing acquaintances by means of examples. Specifically, we consider syntactical constructs and executional semantics of establishing and abolishing acquaintances. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：