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

作者： Heisswolf, Jan Zaib, Aurang Weichslgartner, Andreas Konig, Ralf Wild, Thomas Teich, Jurgen Herkersdorf, Andreas Becker, Jurgen Institute for Information Processing Technologies Karlsruhe Institute of Technology Germany Institute for Integrated Systems Technical University Munich Germany Department of Computer Science 12 University of Erlangen- Nuremberg Germany

Networks-on-Chip (NoC) enable scalability for future manycore architectures, facilitating parallel communication between multiple cores. Applications running in parallel on a NoC-based architecture can affect each other due to overlapping communication. Quality-of-Service (QoS) must be supported by the communication infrastructure to execute communication-, real-time- and safety-critical applications on such an architecture. Different strategies have been proposed to provide QoS for point-to-point connections. These strategies allow each node to set up a limited number of connections to other nodes. In this work Virtual Networks (VN) are proposed to enable QoS for regions of a NoC-based architecture. Virtual Networks overcome the limitation of point-to-point connections. A VN behaves like an exclusive physical network. Virtual Networks can be defined and configured during runtime. The size of the VN region and the assigned bandwidth can be adjusted depending on the application requirements. Virtual Networks enable the decoupling of local from global communication. Therefore, the communication of the application mapped into the region is assigned to a Virtual Network established in that specific region. This concept targets packet-switched networks with virtual channels and is realized by an intelligent hardware unit that manages the virtual channel reservation process at system runtime. Virtual Networks can be established and administrated independent of each other, enabling distributed communication resource management. The proposed concept is implemented as a cycle-accurate SystemC simulation model. The simulation results of executing communicating graphs obtained from real application highlight the usefulness of Virtual Networks by showing improved throughput and reduced delay in the respective scenarios. A hardware implementation demonstrates a low impact on area utilization and power consumption. © 2013 ACM.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

A novel moving cast shadow detection of vehicles in traffic scene 1

引用

3rd Sino-Foreign-Interchange Workshop on Intelligent science and Intelligent Data Engineering, IScIDE 2012

作者： Jia, Yuhong Yu, Xiaoxi Dai, Jiangyan Hu, Wanjun Kong, Jun Qi, Miao Department of Information Engineering Jilin Business and Technology College Changchun 130062 China School of Computer Science and Information Technology Northeast Normal University Key Laboratory of Intelligent Information Processing of Jilin Universities Changchun 130117 China

ISBN: (数字)9783642366697

ISBN: (纸本)9783642366680

In the traffic video scene, the existence of shadows might generate negative effect on pattern analysis. This paper proposes a novel approach which adequately considers color space information to detect moving cast shadows of vehicles in traffic videos. Firstly, RGB component ratios between frame and background as well as blue and red colors ratio (B/R ratio) are taken into account to detect shadows respectively. Then we combine the two results for a refined shadow candidate. Finally, to improve the accuracy of shadow detection, post processing is adopted to correct the false detected pixels. Experimental results on several databases indicate that our approach not only achieves both high shadow detection and discrimination rates but takes on better performance than some state-of-the-art methods. © Springer-Verlag 2013.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Uncertain subgraph query processing over uncertain graphs

Uncertain subgraph query processing over uncertain graphs

引用

15th Asia-Pacific Web Conference on Web Technologies and Applications, APWeb 2013

作者： Ruan, Wenjing Wang, Chaokun Han, Lu Peng, Zhuo Bai, Yiyuan School of Software Tsinghua University Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Tsinghua University China Department of Computer Science and Technology Tsinghua University China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9783642374005

In some real-world applications, data cannot be measured accurately. Uncertain graphs emerge when this kind of data is modeled by graph data structures. When the graph database is uncertain, our query is highly possibly uncertain too. All of the prior works do not consider the uncertainty of the query. In this paper, we propose a new algorithm called Mutual-Match to solve the problem of uncertain subgraph query under the situation where both the graph dataset and the query are uncertain. Considering that the subgraph isomorphism verification is an NP-hard problem, and it will be more complex on uncertain graph data, the Mutual-Match algorithm uses MapReduce processes to find out all the subgraph matches and can adapt to dynamic graphs well. Experimental results on both real-world and synthetic datasets show the correctness and effectiveness of our proposed methods. © 2013 Springer-Verlag.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

ANALYSIS OF ACOUSTIC-SEMANTIC RELATIONSHIP FOR DIVERSELY ANNOTATED REAL-WORLD AUDIO DATA

ANALYSIS OF ACOUSTIC-SEMANTIC RELATIONSHIP FOR DIVERSELY ANN...

引用

IEEE International Conference on Acoustics, Speech and Signal processing

作者： Annamaria Mesaros Toni Heittola Kalle Palomaki Department of Information and Computer Science Aalto University Department of Signal Processing Tampere University of Technology

ISBN: (纸本)9781479903573

A common problem of freely annotated or user contributed audio databases is the high variability of the labels, related to homonyms, synonyms, plurals, etc. Automatically re-labeling audio data based on audio similarity could offer a solution to this problem. This paper studies the relationship between audio and labels in a sound event database, by evaluating semantic similarity of labels of acoustically similar sound event instances. The assumption behind the study is that acoustically similar events are annotated with semantically similar labels. Indeed, for 43% of the tested data, there was at least one in ten acoustically nearest neighbors having a synonym as label, while the closest related term is on average one level higher or lower in the semantic hierarchy.

关键词： audio data audio databases Audio Acoustics Nearest neighbor Synonyms AUTOMATIC related terms observational data

来源：评论

学校读者我要写书评

暂无评论

Global optimal web service selection model for multiple service requests

引用

Jisuanji Yanjiu yu Fazhan/computer Research and Development 2013年第7期50卷 1524-1533页

作者： Kang, Guosheng Liu, Jianxun Tang, Mingdong Liu, Xiaoqing Key Laboratory of Knowledge Processing and Networked Manufacture Hunan University of Science and Technology Xiangtan Hunan 411201 China Department of Computer Science Missouri University of Science and Technology Rolla Missouri MO 65401 United States School of Computer Science Fudan University Shanghai 201203 China

Web service selection based on quality of service (QoS) has been one of research focuses in service computing field. Current methods of service selection usually focus on a single service request or multiple service requests for co-selecting a shared service at a time, not considering the competitiveness among multiple independent service requests for the same functional Web services. A global optimal service selection model for multiple service requests, according to the matching degree (between service requests and Web services) and 0-1 integral programming, is proposed to solve the conflicts among service requests. A universal and feasible optimal service selection algorithm, named global optimal service selection for multiple requests (GOSSMR), is proposed to solve the model. Under the condition of meeting QoS requirements of service requests, too many requests selecting the same Web service at the same time can be avoided, thereby optimizing the service resources, avoiding the overload, and improving the performance of the system. The feasibility and effectiveness of the model and algorithm are verified by simulations in our work.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Bivariate symmetry associated continued fractions blending rational interpolation

Bivariate symmetry associated continued fractions blending r...

引用

2013 5th International Conference on Computational and Information sciences, ICCIS 2013

作者： Zou, Le Li, Changwen Xie, Jin Li, Chuanlin Key Lab of Network and Intelligent Information Processing Hefei University Hefei China Department of Mathematics Huaibei Normal University Huaibei China Department of Mathematics and Physics Hefei University Hefei China Department of Computer Science and Technology Hefei University Hefei China

ISBN: (纸本)9780769550046

By introducing partial divided differences and partial inverse differences, bivariate symmetry associated continued fractions blending rational interpolation is constructed. We discuss the recursive algorithm, interpolation theorem and error estimation. We extend the conclusion to vector valued, matrix valued cases and the triangular net case. © 2013 IEEE.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

PPDB: The Paraphrase Database 2

PPDB: The Paraphrase Database

引用

2nd Workshop on Computational Linguistics for Literature, CLfL 2013 at the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT 2013

作者： Ganitkevitch, Juri van Durme, Benjamin Callison-Burch, Chris Center for Language and Speech Processing Johns Hopkins University United States Human Language Technology Center of Excellence Johns Hopkins University United States Computer and Information Science Department University of Pennsylvania United States

ISBN: (纸本)9781937284473

We present the 1.0 release of our paraphrase database, PPDB. Its English portion, PPDB:Eng, contains over 220 million paraphrase pairs, consisting of 73 million phrasal and 8 million lexical paraphrases, as well as 140 million paraphrase patterns, which capture many meaning-preserving syntactic transformations. The paraphrases are extracted from bilingual parallel corpora totaling over 100 million sentence pairs and over 2 billion English words. We also release PPDB:Spa, a collection of 196 million Spanish paraphrases. Each paraphrase pair in PPDB contains a set of associated scores, including paraphrase probabilities derived from the bitext data and a variety of monolingual distributional similarity scores computed from the Google n-grams and the Annotated Gigaword corpus. Our release includes pruning tools that allow users to determine their own precision/recall tradeoff. © 2013 Association for Computational Linguistics

关键词：

来源：评论

学校读者我要写书评

暂无评论

PPDB: The paraphrase database

PPDB: The paraphrase database

引用

2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL HLT 2013

作者： Ganitkevitch, Juri Van Durme, Benjamin Callison-Burch, Chris Center for Language and Speech Processing Johns Hopkins University United States Human Language Technology Center of Excellence Johns Hopkins University United States Computer and Information Science Department University of Pennsylvania United States

ISBN: (纸本)9781937284473

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust median reversion strategy for on-line portfolio selection

Robust median reversion strategy for on-line portfolio selec...

引用

23rd International Joint Conference on Artificial Intelligence, IJCAI 2013

作者： Huang, Dingjiang Zhou, Junlong Li, Bin Hoi, Steven C.H. Zhou, Shuigeng Department of Mathematics East China University of Science and Technology Shanghai 200237 China School of Computer Science Fudan University Shanghai 200433 China Shanghai Key Lab of Intelligent Information Processing Fudan University Shanghai 200433 China School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore

ISBN: (纸本)9781577356332

On-line portfolio selection has been attracting increasing interests from artificial intelligence community in recent decades. Mean reversion, as one most frequent pattern in financial markets, plays an important role in some state-of-the-art strategies. Though successful in certain datasets, existing mean reversion strategies do not fully consider noises and outliers in the data, leading to estimation error and thus non-optimal portfolios, which results in poor performance in practice. To overcome the limitation, we propose to exploit the reversion phenomenon by robust L1-median estimator, and design a novel on-line portfolio selection strategy named "Robust Median Reversion" (RMR), which makes optimal portfolios based on the improved reversion estimation. Empirical results on various real markets show that RMR can overcome the drawbacks of existing mean reversion algorithms and achieve significantly better results. Finally, RMR runs in linear time, and thus is suitable for large-scale trading applications.

关键词： Estimation

来源：评论

学校读者我要写书评

暂无评论

Kinetics and Modeling of Chemical Leaching of Sphalerite Concentrate Using Ferric Iron in a Redox-controlled Reactor

引用

Chinese Journal of Chemical Engineering 2013年第8期21卷 933-936页

作者：宋健高玲林建群吴洪斌林建强 State Key Lab of Microbial Technology Shandong University Department of Pharmacy and Biotechnology Zibo Vocational Institute Shandong Provincial Key Lab for Distributed Computer Software Novel Technology School of Information Science and EngineeringShandong Normal University Institute of Agro-products Processing Science and Technology Xinjiang Academy of Agricultural and Reclamation Science

This work presents a study for chemical leaching of sphalerite concentrate under various constant Fe3+ concentrations and redox potential conditions. The effects of Fe3+ concentration and redox potential on chemical leaching of sphalerite were investigated. The shrinking core model was applied to analyze the experimental results. It was found that both the Fe3+ concentration and the redox potential controlled the chemical leaching rate of sphalerite. A new kinetic model was developed, in which the chemical leaching rate of sphalerite was proportional to Fe3+ concentration and Fe3+ /Fe2+ ratio. All the model parameters were evaluated from the experimental data. The model predictions fit well with the experimental observed values.

关键词： sphalerite leaching kinetic model Fe3＋ concentration redox potential LabVIEW

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：