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

International Conference on Data Storage and Data engineering (DSDE)

作者： Mohd. Sadiq Jawed Ahmed Mohammad Asim Aslam Qureshi R. Suman Section of Computer Engineering Department Faculty of Engineering and Technology University Polytechnic Jamia Millia Islamia New Delhi India Department of Computer Science Faculty of Management and Information Technology Hamdard University New Delhi India Department of Computer Science and Engineering AL-Falah School of Engineering and Technology MDU Rohtak Haryana India Department of Computer Science and Engineering World College of Technology and Management MDU Rohtak Haryana India

ISBN: (纸本)9781424456789;9780769539584

The first method developed to translate customer requirements into software specification was the Quality Function deployment (QFD) and the second approach to the identification of software specification comes from the software engineering. Requirements may be defined as a demand or need. In software engineering, a requirement is a description of what a system should do. System may have dozen to thousands of requirements. Software requirements stipulate what must be accomplished, transformed, produced or provided. It is well documented that requirement engineering saves money. There are several techniques to elicit the software requirements like JAD, misuse, RAD, Web Surveys etc. In this paper we have used the Web Surveys approach to elicit the software requirements for a railway projects. The main objective of this paper is to improve the effectiveness and the efficiency of the freight transportation between source and destination using optimization algorithm.

关键词： Quality function deployment computer science Software engineering Manufacturing Costs technology management Software quality Reliability engineering Memory Data engineering

来源：评论

学校读者我要写书评

暂无评论

Multimedia ICT in vocational training

Multimedia ICT in vocational training

引用

International Symposium on Electronics in Marine (ELMAR)

作者： Pavol Podhradský Peter Trúchly Tomáš Zeman Jaromír Hrad Faculty of Electrical Engineering and Information Technology of the Slovak University of Technology Department of Telecommunications Bratislava Slovak Republic Faculty of Informatics and Information Technologies of the Slovak University of Technology Institute of Computer Systems and Networks Bratislava Slovak Republic Faculty of Electrical Engineering of the Czech Technical University Department of Telecommunications Prague Czech Republic

The paper presents the main ideas of two Leonardo da Vinci (LdV) projects focused on the vocational training. The selected outputs of these projects are presented in more details. The conception of the multilingual terminological dictionary and proposed graphical user interface is also presented in the paper. An example of practical exercises in the area of NGN protocols based on remote access to NGN Lab is described and illustrated.

关键词： Next generation networking Training Multimedia communication Protocols Servers Dictionaries Least squares approximation

来源：评论

学校读者我要写书评

暂无评论

Grid and P2P Middleware for Scientific Computing systems

Grid and P2P Middleware for Scientific Computing Systems

引用

International Conference on Complex, Intelligent and Software Intensive systems, CISIS

作者： Fatos Xhafa Sabri Pllana Leonard Barolli Department of Computer Science and Information Systems Birkbeck University of London London UK Department of Scientific Computing Faculty of Computer Science University of Technology Vienna Vienna Austria Department of Information and Communication Engineering Fukuoka Institute of Technology Fukuoka Japan

ISBN: (纸本)9781424459179;9780769539676

Grid and P2P systems have achieved a notable success in the domain of scientific and engineering applications, which commonly demand considerable amounts of computational resources. However, Grid and P2P systems remain still difficult to be used by the domain scientists and engineers due to the inherent complexity of the corresponding middleware and the lack of adequate documentation. In this paper we survey recent developments of Grid and P2P middleware in the context of scientific computing systems. The differences on the approaches taken for Grid and P2P middleware as well as the common points of both paradigms are highlighted. In addition, we discuss the corresponding programming models, languages, and applications.

关键词： Middleware Scientific computing Grid computing Power engineering computing Distributed computing Application software computer science Documentation computer applications Parallel processing

来源：评论

学校读者我要写书评

暂无评论

Burst switching in ultra-high speed all-optical IP over DWDM network with and without buffers under linear and nonlinear effects

Burst switching in ultra-high speed all-optical IP over DWDM...

引用

International Conference on Communication systems

作者： Le Nguyen Binh Nhan Duc Nguyen Le Huu Binh Department of Electrical and Computer Systems Engineering Monash University Clayton VIC Australia Faculty of Information Technology Hue College of Advanced Education in Industry Hue Vietnam

Dispersion due to linear chromatic and nonlinear effects of the single mode optical fibers are critical in ultra-high speed global optical Ethernet operating at 10Gb/s to 100Gb/s. This paper investigates the use of optical burst switching (OBS) to overcome the problem of blocking and contention under optical circuit switching, especially when the traffic load is heavy. The traffic transport characteristics of multi-wavelength-channels are studied with the channel bit rate of 2.5 Gb/s to 40 Gb/s in burst mode. OBS is demonstrated to minimize the blocking probability due to its statistical advantage to improve the throughput rate. Further a new core node architecture consisting of dynamic optical buffers and wavelength conversion is proposed for incorporating with an optical switching matrix for ultra-fast switching and routing of OBS packets. Blocking probabilities of the networking traffics are obtained for different bit rates under the effects of dispersion and with or without optical buffers for OBS.

关键词： Optical buffering Optical switches IP networks Routing Wavelength division multiplexing Optical amplifiers Fiber optics

来源：评论

学校读者我要写书评

暂无评论

Monte-Carlo Tree Search for a reentrant scheduling problem

Monte-Carlo Tree Search for a reentrant scheduling problem

引用

International Conference on computers & Industrial engineering (CIE)

作者： Shimpei Matsumoto Noriaki Hirosue Kyohei Itonaga Nobuyuki Ueno Hiroaki Ishii Faculty of Applied Information Science Hiroshima Institute of Technology Hiroshima Japan Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Iizuka Japan Division of Electrical Electronic and Information Engineering Oita National College of Technology Oita Japan Department ofmanagement and Information Systems Prefuctural University of Hiroshima Hiroshima Japan Department of Mathematical Sciences School of Science and Technology Kwansei Gakuin University Japan

This paper reports application results of Monte-Carlo Tree Search (MCTS) for a practical problem. In this paper, a reentrant scheduling problem is considered as a practical problem which has been addressed by our previous works. MCTS introduced by Coulom is a best-first search where the pseudorandom simulations guide the solution of problem. Recent improvements on MCTS have produced strong computer Go program, which has a large search space, and the success is a hot topic for selecting the best move. So far, most of reports about MCTS have been on two-player game, and MCTS has been applied rarely in one-player perfect-information games. MCTS does not need an admissible heuristic, so the application of MCTS for one-player games might be an interesting alternative. Additionally, one-player games like puzzles are determinately operated only by one player's decision, so sequences of changes in state are describable as a network diagram of interdependence of operations. Therefore if MCTS for one-player games is considered as a meta-heuristic algorithm, we can use this algorithm for not only many practical problems, but also combinatorial optimization problems. Especially as MCTS does not fully depend on evaluation function, so the solutions based on MCTS remain effective if objective function of problem is modified. This paper firstly investigated on the application of Single Player MCTS (SP-MCTS) introduced by Schadd et al. Next this paper showed the effectiveness of new simulation strategies on SP-MCTS by numerical experiments. Based on the results, this paper discussed the application potentiality of SP-MCTS for a practical reentrant scheduling problem.

关键词： Proposals

来源：评论

学校读者我要写书评

暂无评论

Tensor rank of the tripartite state |W〉⊗n

引用

Physical Review A 2010年第1期81卷 014301-014301页

作者： Nengkun Yu Eric Chitambar Cheng Guo Runyao Duan State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 China and Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia Physics Department University of Michigan 450 Church Street Ann Arbor Michigan 48109-1040 USA

Tensor rank refers to the number of product states needed to express a given multipartite quantum state. Its nonadditivity as an entanglement measure has recently been observed. In this Brief Report, we estimate the tensor rank of multiple copies of the tripartite state |W〉=13(|100〉+|010〉+|001〉). Both an upper bound and a lower bound of this rank are derived. In particular, it is proven that the rank of |W〉⊗2 is 7, thus resolving a previously open problem. Some implications of this result are discussed in terms of transformation rates between |W〉⊗n and multiple copies of the state |GHZ〉=12(|000〉+|111〉).

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Forecasting stock exchange using soft computing techniques

Forecasting stock exchange using soft computing techniques

引用

ACS/IEEE International Conference on computer systems and Applications

作者： Zainab Rahamneh Mohamed Reyalat Alaa Sheta Sultan Aljahdali Information Technology Department Prince Abdullah Bin Ghazi Faculty of Science and Information Technology AI-Balqa Applied University Salt Jordan Computer Science and Engineering College of Computers and Information Systems Taif University Taif Saudi Arabia College of Computers and Information Systems Taif University Taif Saudi Arabia

The financial industry is becoming more and more dependent on advanced computer technologies in order to maintain competitiveness in a global economy. Fuzzy logic represents an exciting technology with a wide scope for potential applications. There is a growing interest both in the field of fuzzy logic computing and in the financial world in explaining the use of fuzzy logic to forecast the future changes in prices of stocks, exchange rates, commodities, and other financial time series. Fuzzy algorithms are intensively used for the identification of dynamic models, combining both numerical and heuristic knowledge. Fuzzy logic provides a remarkably simple way to draw definite conclusions from vague, ambiguous or imprecise information. In this paper, we are investigating the ability of Fuzzy logic (FL) to tackle the financial time series forecasting problems. Experimental results on set of applications indicated that fuzzy logic can effectively solve these types of problems. In order to examine the effectiveness of fuzzy logic applied to forecasting, the comparison with Artificial Neural Networks (ANNs) is performed.

关键词： Biological system modeling Artificial neural networks Mathematical model MATLAB

来源：评论

学校读者我要写书评

暂无评论

Evaluating Simulation Heuristics in Monte‐Carlo Tree Search and its Application to a Production Scheduling

引用

AIP Conference Proceedings 2010年第1期1285卷 109-123页

作者： Shimpei Matsumoto Kosuke Kato Noriaki Hirosue Hiroaki Ishii aDepartment of Information Systems and Management Faculty of Applied Information Science Hiroshima Institute of Technology 2‐1‐1 Miyake Saeki‐ku Hiroshima 731‐5193 Japan bDepartment of Computer Science Faculty of Applied Information Science Hiroshima Institute of Technology 2‐1‐1 Miyake Saeki‐ku Hiroshima 731‐5193 Japan cDepartment of Artificial Intelligence Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology Kawazu 680‐4 Iizuka 820‐8502 Japan dDepartment of Mathematical Sciences School of Science and Technology Kwansei Gakuin University 2‐1 Gakuen Sanda 669‐1337 Japan

This paper reports simulation heuristics of Monte‐Carlo Tree Search (MCTS) and shows an application example. MCTS introduced by Coulom is a best‐first search where pseudorandom simulations guide the solution of problem. Recent improvements on MCTS have produced strong computer Go program, which has a large search space, and the success is a hot topic for selecting the best move. So far, most of reports about MCTS have been on two‐player games, and MCTS has been used rarely for one‐player perfect‐information games. MCTS does not need admissible heuristic, so the application of MCTS for one‐player games might be an interesting alternative. Additionally, one‐player games like puzzles are determinately operated only by one player’s decision, so the sequences of changes in state are describable as a network diagram with interdependence between operations. If MCTS for one‐player games is available as a meta‐heuristic algorithm, we can use this algorithm for not only combinatorial optimization problems, but also many practical problems. Especially, as MCTS does not fully depend on evaluation function, so the solutions based on MCTS remain effective if objective function is modified. This paper firstly investigates on the application of Single Player MCTS (SP‐MCTS) introduced by Schadd et al. to a puzzle game called Bubble Breaker. Next this paper shows the effectiveness of new simulation strategies of SP‐MCTS, and considers the differences between each parameter. Based on the results, this paper discusses the application potentiality of SP‐MCTS for a scheduling problem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Locally indistinguishable subspaces spanned by three-qubit unextendible product bases

引用

Physical Review A 2010年第3期81卷 032329-032329页

作者： Runyao Duan Yu Xin Mingsheng Ying Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 People's Republic of China Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge Massachusetts 02139 USA Department of Physics Tsinghua University Beijing 100084 People's Republic of China

We study the local distinguishability of general multiqubit states and show that local projective measurements and classical communication are as powerful as the most general local measurements and classical communication. Remarkably, this indicates that the local distinguishability of multiqubit states can be decided efficiently. Another useful consequence is that a set of orthogonal n-qubit states is locally distinguishable only if the summation of their orthogonal Schmidt numbers is less than the total dimension 2n. Employing these results, we show that any orthonormal basis of a subspace spanned by arbitrary three-qubit orthogonal unextendible product bases (UPB) cannot be exactly distinguishable by local operations and classical communication. This not only reveals another intrinsic property of three-qubit orthogonal UPB but also provides a class of locally indistinguishable subspaces with dimension 4. We also explicitly construct locally indistinguishable subspaces with dimensions 3 and 5, respectively. Similar to the bipartite case, these results on multipartite locally indistinguishable subspaces can be used to estimate the one-shot environment-assisted classical capacity of a class of quantum broadcast channels.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Multipartite-to-bipartite entanglement transformations and polynomial identity testing

引用

Physical Review A 2010年第5期81卷 052310-052310页

作者： Eric Chitambar Runyao Duan Yaoyun Shi Physics Department University of Michigan 450 Church Street Ann Arbor Michigan 48109-1040 USA Centre for Quantum Computation and Intelligent Systems (QCIS) Faculty of Engineering and Information Technology University of Technology Sydney New South Wales 2007 Australia and State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University Beijing 100084 People’s Republic of China Department of Electrical Engineering and Computer Science University of Michigan 2260 Hayward Street Ann Arbor Michigan 48109-2121 USA

We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：