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

14th Pacific-Rim Conference on Multimedia, PCM 2013

作者： Zhang, Hong Zhang, Yanpeng College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China State Key Laboratory of Software Engineering Wuhan University Wuhan 430072 China

ISBN: (纸本)9783319037301

Subspace learning is most traditional and important in multimedia analysis. Numerous researches have focused on how to introduce machine learning and statistical methods to multimedia subspace learning for semantic understanding and denoising, and have gained remarkable achievement in different multimedia applications, such as content-based retrieval, data clustering, face recognition, etc. However, most of these researches are based on multimedia data of single modality. Nowadays, with the rapid development of multimedia and information technology, multimedia data of different modalities often coexist, and the presence of one has a complementary effect on the other to some extent. Because different multimedia data are usually represented with heterogeneous low-level features and there exists the wellknown semantic gap, it is interesting and challenging to learn multimedia semantics by multi-feature subspace learning of different modalities. In this paper, we analyze sparse canonical correlation between feature matrices of different multimedia data, construct an isomorphic sparse multi-feature subspace;moreover, we propose subspace optimization strategy with correlation fusion, which explores both geometrical-based content correlation and graph-based semantic correlation. Our algorithm has been applied to content-based multimodal retrieval and data classification. Comprehensive experiments have demonstrated the superiority of our method over several existing algorithms. © Springer International Publishing Switzerland 2013.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

A new feature evaluation method for visual tracking

引用

ICIC Express Letters, Part B: Applications 2013年第5期4卷 1303-1310页

作者： Jiang, Longkui Wang, Yuru School of Information Engineering Jilin Business and Technology College No. 1606 Haoyue Road Changchun 130062 China School of Computer Science and Information Technology Northeast Normal University No. 2555 Jingyue Street Changchun 130117 China Key Laboratory of Intelligent Information Processing of Jilin Province Northeast Normal University No. 2555 Jingyue Street Changchun 130117 China

Target modeling plays an important role in visual tracking, and it determines the precision of the tracking system. This paper proposed a statistical analysis based feature's discriminative ability evaluation method, which helps choosing the best feature for target modeling in a specific video. A number of randomly distributed sample points are generated around the target, and the sampling region covers both the target and its backgrounds. When different features are employed to observe these sample points, some statistical values of their similarities' distribution are used to evaluate their significance. Specially, a statistical evaluation model is constructed based on the observed samples' distribution analysis. Experiments are implemented employing different features, and their tracking results are in accordance with the evaluation results, which demonstrate the effectiveness of the proposed evaluation method in selecting salient features in varied conditions. © 2013 ISSN 2185-2766.

关键词： Statistical methods

来源：评论

学校读者我要写书评

暂无评论

A heterogeneous-aware cooperative MIMO transmission scheme in WSN

Journal of Software

引用

Journal of Software 2013年第3期8卷 639-644页

作者： Pei, Tingrui Xie, Da Li, Zhetao Tu, Dengbiao Choi, Youngjune College of Information Engineering Xiangtan University Xiangtan 411105 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan 411105 China School of Computer National University of Defense Technology Changsha 410073 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China Department of Information and Computer Engineering Ajou University Suwon 443749 Korea Republic of

A heterogeneous-aware cooperative MIMO transmission scheme (HAMS) is proposed to optimize the network lifetime and save energy for energy heterogeneous wireless sensor networks (WSN). This scheme extends the traditional low-energy adaptive clustering hierarchy (LEACH) protocol to enable the cooperative MIMO transmission between the sink and clusters. Through the adaptive selection of cooperative nodes and the cooperative MIMO transmission, HAMS can gain effective performance improvement in terms of taking advantage of the presence of node heterogeneity. Based on the energy consumption model developed in this paper, the optimal parameter to minimize the overall energy consumption is found. Simulation results exhibit that HAMS can effectively save energy and prolong the network time. Furthermore, HAMS displays more resilient in different degree of heterogeneous wireless sensor networks. © 2013 ACADEMY PUBLISHER.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

ZZ→ℓ+ℓ−ℓ′+ℓ′− cross-section measurements and search for anomalous triple gauge couplings in 13 TeV pp collisions with the ATLAS detector

引用

Physical Review D 2018年第3期97卷 032005-032005页

作者： M. Aaboud G. Aad B. Abbott O. Abdinov B. Abeloos S. H. Abidi O. S. AbouZeid N. L. Abraham H. Abramowicz H. Abreu R. Abreu Y. Abulaiti B. S. Acharya S. Adachi L. Adamczyk J. Adelman M. Adersberger T. Adye A. A. Affolder Y. Afik T. Agatonovic-Jovin C. Agheorghiesei J. A. Aguilar-Saavedra S. P. Ahlen F. Ahmadov G. Aielli S. Akatsuka H. Akerstedt T. P. A. Åkesson E. Akilli A. V. Akimov G. L. Alberghi J. Albert P. Albicocco M. J. Alconada Verzini S. C. Alderweireldt M. Aleksa I. N. Aleksandrov C. Alexa G. Alexander T. Alexopoulos M. Alhroob B. Ali M. Aliev G. Alimonti J. Alison S. P. Alkire B. M. M. Allbrooke B. W. Allen P. P. Allport A. Aloisio A. Alonso F. Alonso C. Alpigiani A. A. Alshehri M. I. Alstaty B. Alvarez Gonzalez D. Álvarez Piqueras M. G. Alviggi B. T. Amadio Y. Amaral Coutinho C. Amelung D. Amidei S. P. Amor Dos Santos S. Amoroso G. Amundsen C. Anastopoulos L. S. Ancu N. Andari T. Andeen C. F. Anders J. K. Anders K. J. Anderson A. Andreazza V. Andrei S. Angelidakis I. Angelozzi A. Angerami A. V. Anisenkov N. Anjos A. Annovi C. Antel M. Antonelli A. Antonov D. J. Antrim F. Anulli M. Aoki L. Aperio Bella G. Arabidze Y. Arai J. P. Araque V. Araujo Ferraz A. T. H. Arce R. E. Ardell F. A. Arduh J-F. Arguin S. Argyropoulos M. Arik A. J. Armbruster L. J. Armitage O. Arnaez H. Arnold M. Arratia O. Arslan A. Artamonov G. Artoni S. Artz S. Asai N. Asbah A. Ashkenazi L. Asquith K. Assamagan R. Astalos M. Atkinson N. B. Atlay K. Augsten G. Avolio B. Axen M. K. Ayoub G. Azuelos A. E. Baas M. J. Baca H. Bachacou K. Bachas M. Backes P. Bagnaia M. Bahmani H. Bahrasemani J. T. Baines M. Bajic O. K. Baker E. M. Baldin P. Balek F. Balli W. K. Balunas E. Banas A. Bandyopadhyay Sw. Banerjee A. A. E. Bannoura L. Barak E. L. Barberio D. Barberis M. Barbero T. Barillari M-S Barisits J. T. Barkeloo T. Barklow N. Barlow S. L. Barnes B. M. Barnett R. M. Barnett Z. Barnovska-Blenessy A. Baroncelli G. Barone A. J. Barr L. Barranco Navarro F. Barreiro J. Barreiro Guimarães da Costa R. Bartoldus A. E. Barton P. Bartos A. Basalaev A. B Faculté des Sciences Université Mohamed Premier and LPTPM Oujda Morocco CPPM Aix-Marseille Université and CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman Oklahoma USA Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan LAL Univ. Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France Department of Physics University of Toronto Toronto Ontario Canada Santa Cruz Institute for Particle Physics University of California Santa Cruz Santa Cruz California USA Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion: Israel Institute of Technology Haifa Israel Center for High Energy Physics University of Oregon Eugene Oregon USA Department of Physics Stockholm University Sweden The Oskar Klein Centre Stockholm Sweden INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy International Center for Elementary Particle Physics and Department of Physics The University of Tokyo Tokyo Japan AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb Illinois USA Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Institute of Physics University of Belgrade Belgrade Serbia Department of Physics Alexandru Ioan Cuza University of Iasi Iasi Romania Laboratório de Instrumentação e Física Experimental de Partículas - LIP Lisboa Portugal Departamento de Fisica Teorica y del Cosmos Universidad de Granada Granada Portugal Department of Physics Boston University Boston Massachusetts USA Joint Institute for Nuclear Research JINR Dubna Dubna Russia INFN Sezione di Roma Tor Vergata Italy Dipartimento di Fisica Un

Measurements of ZZ production in the ℓ+ℓ−ℓ′+ℓ′− channel in proton–proton collisions at 13 TeV center-of-mass energy at the Large Hadron Collider are presented. The data correspond to 36.1 fb−1 of collisions collected by the ATLAS experiment in 2015 and 2016. Here ℓ and ℓ′ stand for electrons or muons. Integrated and differential ZZ→ℓ+ℓ−ℓ′+ℓ′− cross sections with Z→ℓ+ℓ− candidate masses in the range of 66 GeV to 116 GeV are measured in a fiducial phase space corresponding to the detector acceptance and corrected for detector effects. The differential cross sections are presented in bins of twenty observables, including several that describe the jet activity. The integrated cross section is also extrapolated to a total phase space and to all standard model decays of Z bosons with mass between 66 GeV and 116 GeV, resulting in a value of 17.3±0.9[±0.6(stat)±0.5(syst)±0.6(lumi)] pb. The measurements are found to be in good agreement with the standard model. A search for neutral triple gauge couplings is performed using the transverse momentum distribution of the leading Z boson candidate. No evidence for such couplings is found and exclusion limits are set on their parameters.

关键词： Electroweak interaction W & Z bosons Particle data analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Enhancing ability of fault detection for component systems based on object interactions graph

Enhancing ability of fault detection for component systems b...

引用

2012 International Conference on Emerging Technologies for information Systems, Computing, and Management, ICM 2012

作者： Sun, Fuzhen Liao, Lejian Du, Jianguang Li, Guoqiang Beijing Eng. Res. Ctr. of High Vol. Language Information Processing and Cloud Computing Applications Beijing Key Laboratory of Intelligent Information Technology School of Computer Science Beijing China School of Computer Science and Technology Shandong University of Technology Zibo China

ISBN: (纸本)9781461470090

Test case prioritization is a technique to schedule the test case in order to maximize some objective function. Early fault detection can provide a faster feedback generating a scope for debuggers to carry out their task at an early stage. In this paper, a method is proposed to prioritize the test cases for testing component dependency in a Component Based Software Development (CBSD) environment using Greedy Approach. The OIG (Object Interaction Graph) is traversed to calculate the total number of inter component object interactions and intra component object interactions. Depending upon the number of interactions, the objective function is calculated and the test cases are ordered accordingly. This technique is applied to the components developed in Java for a software system and found to be very effective in early fault detection as compared with non-prioritize approach. © 2013 Springer Science+Business Media New York.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Improvement on Ahn et al.'s RSA P-homomorphic signature scheme

Improvement on Ahn et al.'s RSA P-homomorphic signature sche...

引用

8th International ICST Conference on Security and Privacy in Communication Networks, SecureComm 2012

作者： Wang, Zhiwei College of Computer Nanjing University of Posts and Telecommunications Nanjing Jiangsu 210003 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100190 China Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Nanjing Jiangsu 210003 China Key Lab. of Broadband Wireless Communication and Sensor Network Technology Nanjing University of Posts and Telecommunications Ministry of Education Jiangsu Province Nanjing Jiangsu 210003 China

ISBN: (纸本)9783642368820

P-homomorphic signature is a general framework for computing on authenticated data, which is recently proposed by Ahn et al. With P-homomorphic signature, any third party can derive a signature on the object message m′ from a signature of m, if m′ and m satisfy P(m,m′) = 1 for some predicate P which denotes the authenticatable relationship between m′ and m. Ahn et al. proposed a RSA P-homomorphic signature scheme by using a RSA accumulator, which is very efficient in space. However, the computational cost of verification and derivation is very heavy. We present an improved P-homomorphic signature scheme based on factoring problem. In our construction, the time efficiency of both verification and derivation are much better than Ahn's scheme. © 2013 ICST Institute for computer Science, Social Informatics and Telecommunications Engineering.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

The maximal relation based on a given relation schema and its concept lattice

Journal of Software

引用

Journal of Software 2013年第6期8卷 1308-1315页

作者： Lei, Yuxia Sui, Yuefei Tian, Jingying School of Computer Science Qufu Normal University Yantai Street 80 Rizhao 276826 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Architectual Engineering Rizhao Politechnic Rizhao 276826 China

Formal concept analysis (FCA) is a valid tool for data mining and knowledge discovery, which identifies concept lattices from binary relations. Given a nonempty finite set A of binary attributes, one obtains a maximal binary relation Rmax based on a relation schema S(A). Firstly, we analyze concepts in Rmax and the concept lattice L(Rmax), and there are some important results as follows: for any two concepts in Rmax, the union of their intents is an intent of some concept in Rmax, and further the intent of their supremum is the union of their intents;for any two concepts in Rmax, if one of them is not a sub-concept or super-concept of the other one, then the union of their extents is not an extent of any concept in Rmax;L(Rmax) is a complemented distributive lattice. Secondly, we provide the structural connection between L(R) and L(Rmax): for any relation R based on S(A), there is a supremum-preserving order-embedding map from L(R) to L(Rmax), and conversely, there is an infimum-preserving order-preserving map from L(Rmax) to L(R), which is generally not a surjective homomorphism. Thirdly, we propose two algorithms to extract concepts in R from L(Rmax), which are respectively based on intents and extents of concepts, and prove their soundness. These results have already been used to analyze the data in architectual engineering and medical science. © 2013 ACADEMY PUBLISHER.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

A reputation-aware decision-making approach for improving the efficiency of crowdsourcing systems

A reputation-aware decision-making approach for improving th...

引用

12th International Conference on Autonomous Agents and Multiagent Systems 2013, AAMAS 2013

作者： Yu, Han Shen, Zhiqi Miao, Chunyan An, Bo School of Computer Engineering Nanyang Technological University Singapore 639798 Singapore Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9781627487665

A crowdsourcing system is a useful platform for utilizing the intelligence and skills of the mass. Nevertheless, like any open system that involves the exchange of things of value, selfish and malicious behaviors exist in crowdsourcing systems and need to be mitigated. Trust management has been proven to be a viable solution in many systems. However, a major difference between crowdsourcing systems and existing trust models designed for multi-agent systems is that human trustees have limited task processing capacity per unit time compared to an intelligent agent program. This paper recognizes a problem in current trust-aware decision-making methods for task assignment in crowdsourcing platforms. On the one hand, trust-based methods over-assign tasks to trusted workers, while on the other hand, workload-based solutions do not give sufficient guarantees on the quality of work. The proposed solution, the social welfare optimizing reputation-aware decision-making (SWORD) approach, strikes a balance between the two and is shown through extensive simulations to significantly improve social welfare of crowdsourcing platforms compared to related work. Copyright © 2013, International Foundation for Autonomous Agents and Multiagent Systems (***). All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Mining top-K Frequent and Flexible Pattern from sequences

Mining top-K Frequent and Flexible Pattern from sequences

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Junyan, Zhang Fan, Min Information Science and Technology College Chengdu University China University Key Laboratory of Pattern Recognition and Intelligent Information Processing Sichuan Province Chengdu China School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China

ISBN: (纸本)9781479916603

Pattern Mining is a popular issue in biological sequence analysis. With the introduction of wildcard gaps, more interesting patterns can be mined. In this paper, we propose a new definition related to pattern frequency, under which the Apriori property holds. We define a pattern mining problem called Ming top-K Frequent Patterns (MFP), where gaps are mined instead of specified. Compared with existing problems, MFP does not require any domain knowledge of the user. However, theoretical analysis and experimental results show that MFP favors inflexible patterns. We then define another problem where the flexibility threshold of each gap is specified by the user. The problem is called Mining top-K Frequent and Flexible Patterns (MF2P). We develop algorithm with polynomial complexities for both problems. Patterns can grow from both sides. Some interesting biological patterns mined by our algorithms are discussed. © 2013 IEEE.

关键词： Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：