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

Information Optics and Photonics Technology

作者： Okamoto, Atsushi Funakoshi, Hisatoshi Bunsen, Masatoshi Nishio, Akinori Research Group of Advanced Electronics Graduate School of Information Science and Technology Hokkaido University Kita14-Nishi9 Sapporo 060-8628 Japan Core Technology Center NITTO DENKO Corporation 1-1-2 Shimohozumi Ibaraki Osaka 567-8680 Japan Research Group of Computer and Communication System Graduate School of Engineering Hokkaido University Kita13-Nishi8 Kita-ku Sapporo 060-8628 Japan

By irradiating alternative external light into the system with four-wave mixing in photorefractive polymers, the restriction on the generation of a phase conjugate beam or diffracted light will be demonstrated in this experiment. In addition, in order to verify the use of a two-dimensional array for simultaneous switching, the elimination of only part of diffraction grating recorded will be experimentally conducted.

关键词： Optical switches

来源：评论

学校读者我要写书评

暂无评论

Collaborative Filtering by Mining Association Rules from User Access Sequences

Collaborative Filtering by Mining Association Rules from Use...

引用

International Workshop on Challenges in Web Information Retrieval and Integration (WIRI)

作者： Mei-Ling Shyu C. Haruechaiyasak Shu-Ching Chen Na Zhao Department of Electrical and Computer Engineering University of Miami Coral Gables FL USA Information Research and Development Division National Electronics and Computer Technology Center Pathum Thani Thailand Distributed Multimedia Information System Laboratory School of Computer Science Florida International University Miami FL USA

Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by following the hyperlinks. In this paper, we propose a new method for mining user access patterns that allows the prediction of multiple non-consecutive Web pages, i.e., any pages within the Web site. Our approach consists of two major steps. First, the shortest path algorithm in graph theory is applied to find the distances between Web pages. In order to capture user access behavior on the Web, the distances are derived from user access sequences, as opposed to static structural hyperlinks. We refer to these distances as minimum reaching distance (MRD) information. The association rule mining (ARM) technique is then applied to form a set of predictive rules which are further refined and pruned by using the MRD information. The proposed approach is applied as a collaborative filtering technique to recommend Web pages within a Web site. Experimental results demonstrate that our approach improves performance over the existing Markov model approach in terms of precision and recall, and also has a better potential of reducing the user access time on the Web

关键词： Collaboration Data mining Association rules Web pages Predictive models Information filtering Information filters Web server Research and development Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Handling missing values via decomposition of the conditioned set

Handling missing values via decomposition of the conditioned...

引用

IEEE International Conference on Information Reuse and Integration (IRI)

作者： M.-L. Shyu I.P. Kuruppu-Appuhamilage S.-C. Chen L. Chang Department of Electrical and Computer Engineering University of Miami Coral Gables FL USA Distributed Multimedia Information System Laboratory School of Computer Science Florida International University Miami FL USA Naval Research Laboratory Center for High Assurance Computer Systems Washington D.C. DC USA

In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly improve the performance of any data mining algorithm in various applications. Our proposed framework adopts the basic concepts from conditional probability theories and further develops an algorithm to facilitate the capability of handling both nominal and numerical values, which addresses the problem of the inability of handling both nominal and numerical values with a high degree of accuracy in the existing algorithms. Several experiments are conducted and the experimental results demonstrate that our framework provides a high accuracy when compared with most of the commonly used algorithms such as using the average value, using the maximum value, and using the minimum value to replace missing values.

关键词： Cleaning Data mining Multimedia databases Laboratories Distributed databases Data preprocessing Multimedia systems Information systems computer science Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Mining data from simulation of beer production

Mining data from simulation of beer production

引用

IEEE International Conference on Natural Language Processing and Knowledge engineering (NLP-KE)

作者： Yanbing Ju Aihua Wang Fengchun Zhu Chuanliang Xia School of Management and Economics Beijing Institute of Technology Haidian China Graduate School of Education Peking University Haidian China School of Information and Electrical Engineering Shandong University of Science and Technology Shandong China School of Information Linyi Normal University Shandong China Department of Computer Science Academy of Mathematics and System Sciences Chinese Academy and Sciences Beijing China

Data mining is a methodology for the extraction of knowledge from data, especially, knowledge relating to a problem that we want to solve. Data mining from simulation outputs is performed in this paper, it focuses on techniques for extracting knowledge from simulation outputs for beer production and optimizing devices and labors with certain target. We first set up one simulation model for beer production process and construct optimization objective. Then we set up one data mining model based on witness miner. The mining results show that the model is able to fund important information affecting target, make manager diagnose the bottlenecks of the beer production process, and help manager to make decisions rapidly under uncertainty.

关键词： Data mining Manufacturing systems Delta modulation Testing Technology management Educational technology Clustering algorithms Machine learning algorithms Production systems Analytical models

来源：评论

学校读者我要写书评

暂无评论

Guarding art galleries by guarding witnesses

引用

15th International Symposium on Algorithms and Computation, ISAAC 2004

作者： Chwa, Kyung-Yong Jo, Byung-Cheol Knauer, Christian Moet, Esther van Oostrum, René Shin, Chan-Su Department of Computer Science KAIST Daejon Korea Republic of Taff System Co. Ltd Seoul Korea Republic of Freie Universität Berlin Takustraße 9 BerlinD-14195 Germany Institute of Information & Computing Sciences Utrecht University P.O. Box 80.089 Utrecht3508 TB Netherlands School of Electronics and Information Engineering Hankuk University of Foreign Studies Yongin Korea Republic of

ISBN: (纸本)9783540241317

Let P be a simple polygon. We define a witness set W to be a set of points such that if any (prospective) guard set G guards W, then it is guaranteed that G guards P. Not all polygons admit a finite witness set. If a finite minimal witness set exists, then it cannot contain any witness in the interior of P;all witnesses must lie on the boundary of P, and there can be at most one witness in the interior of every edge. We give an algorithm to compute a minimum witness set for P in O(n2 log n) time, if such a set exists, or to report the non-existence within the same time bounds. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Off-line handwritten Chinese character recognition based on fusion features and LS-SVM

Beijing Keji Daxue Xuebao/Journal of University of Science a...

引用

Beijing Keji Daxue Xuebao/Journal of University of science and Technology Beijing 2005年第4期27卷 509-512页

作者： Gao, Yanyu Yang, Yang Chen, Fei Information Engineering School University of Science and Technology Beijing Beijing 100083 China JF Computer System Co. Ltd. Beijing 100083 China

The proposed off-line handwritten Chinese character recognition system composed of a feature extraction module and a recognition module. In the feature extraction module, the orthogonal Zernike moments and the elastic mesh technique were combined to get fusion features, which present the global and local features of handwritten Chinese characters and have great discriminative capability. As for the classification module, one approach that is very similar to the neural network classification strategy was used with the least square vector machine (LS-SVM), which not only has the excellent performance of generalization and recognition accuracy, but also can solve the multi-classification issue effectively. Experimental results indicated that the proposed method could get good recognition results.

关键词： Character recognition

来源：评论

学校读者我要写书评

暂无评论

Two-mass system with wide bandwidth for SiOG (silicon on glass) vibratory gyroscopes

Two-mass system with wide bandwidth for SiOG (silicon on gla...

引用

International Conference on Solid State Sensors and Actuators (TRANSDUCERS)

作者： Seung-Hoon Jeon June-Young Lee Hyoung-Kyoon Jung Hyun-Kee Chang Yong-Kweon Kim Electronic System Development Team Automotive Electronics Research & Development Center Research & Development Division Kia Motors Corporation Hyundai Motor Company South Korea School of Electrical Engineering and Computer Science Seoul National University South Korea Intellimicrons Company Limited South Korea

The paper describes a two-mass system for SiOG (silicon on glass) vibratory gyroscope so as to increase the stability of the device with wide bandwidth. A two-mass mass system has more than two masses and separates the resonant peaks of each mass. The variation of bandwidth and driving displacement according to the mass ratio of the two-mass system was analyzed, using MATLAB. This result was compared with that of a conventional single mass system gyroscope. In the 7 kHz resonant frequency design, the two-mass system has 395.3 Hz bandwidth, which is six times larger than a single mass system bandwidth, 58.5 Hz. The fabricated spring width is 3.4-3.6 /spl mu/m, which is 4 /spl mu/m in the design. Since the resonant frequency is influenced by the spring width, the measured frequency is 5.2 kHz, which is 7 kHz in the design. But, the measured bandwidth is 450 Hz, similar to the designed bandwidth (500 Hz). Also, the frequency difference between the driving and sensing part (210 Hz) is smaller than the wide bandwidth.

关键词： Bandwidth Silicon Glass Gyroscopes Resonant frequency Springs Stability Resonance MATLAB Frequency measurement

来源：评论

学校读者我要写书评

暂无评论

Improved vicinal SV algorithm

引用

Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology 2005年第11期25卷 967-970页

作者： Bi, Le-Peng Zheng, Zhi-Yun Song, Han-Tao Lu, Yu-Chang Department of Computer Science and Engineering School of Information Science and Technology Beijing Institute of Technology Beijing 100081 China State Key Laboratory of Intelligent Technology and System Tsinghua University Beijing 100084 China

Two improvements are introduced into vicinal-risk-minimization based support vector (SV) algorithm. Since the misclassified samples must be support vectors, a scheme for pruning hard-to-learn samples from the training set based on support vectors is presented. The parameter's determination of Gaussian vicinal function is proposed to be modified, based on the maximum likelihood criterion. Preliminary experimental results show that the pruning scheme and improvement of the parameter's determination of vicinal function much improved vicinal SV algorithm's generality, and can outperform support vector machine (SVM) by about 0.5% in test accuracy.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

The self-organization of dynamic manufacturing network

The self-organization of dynamic manufacturing network

引用

ICMA 2004 - International Conference on Manufacturing Automation: Advanced Design and Manufacturing in Global Competition

作者： Li, G. Sun, L.-Y. Li, H.-Q. School of Management State Key Laboratory of Mechanical Manufacturing System Engineering Xi'an Jiaotong University China School of Computer Science Xi'an Shiyou University China

ISBN: (纸本)1860584683

A variety modeling approaches assume a relatively static manufacturing network structure and focus on optimizing the flow in the DMN (dynamic manufacturing network). These techniques are unable to model structural and behavioral dynamics of a DMN and little is known about how different manufacturing networks evolve and adapt. In this paper, it proposed a new paradigm for modeling and analysis of the DMN based on the self-organization paradigm. The diverse time-varying structures of a DMN emerge with the interaction of the enterprises with various goal directed behavior to fulfill the stochastic global demand. The DMN co-evolves over time and the environment. There is a co-symbiosis relationship among the various enterprises of the DMN. A simulation model based on multiagent approach indicates the emergence, co-evolution and co-symbiosis of the DMN. © Professional engineering Publishing 2004.

关键词： Factory automation

来源：评论

学校读者我要写书评

暂无评论

The need for adaptive dynamic thread scheduling in Simultaneous Multithreading

引用

Parallel Processing Letters 2004年第3-4期14卷 327-335页

作者： Shin, Chulho Lee, Seong-Won Gaudiot, Jean-Luc CAE Center System LSI Division Samsung Electronics Co. Gyeonggi-Do Korea Republic of Department of Image Engineering Graduate School of Advanced Imaging Science Chung-Ang University Seoul Korea Republic of Department of Electrical Engineering and Computer Science University of California Irvine CA United States

Earlier studies on Simultaneous Multithreaded (SMT) architectures showed that performance of a realistic SMT architecture saturates early. This paper addresses our contention that a fixed hardware thread scheduling strategy cannot provide optimal results for various thread combinations. We propose an approach that partially schedules threads in the form of a detector thread at a nominal hardware and software cost. It offers the capability to adaptively switch thread scheduling policies depending on varioius situations. This article shows that there is much room for performance improvement for our adaptive dynamic thread scheduling approach. The results we have obtained by simulating a realistic SMT architecture show that no single fetch policy may outperform the rest more than 50% of the total time. We show that 27% is approximately the upper-bound of the performance improvement for SMT with eight contexts. This demonstrates that our approach may significantly improve performance with good low-throughput detection and fetch policy selection heuristics. © World Scientific Publishing Company.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：