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

Primal least squares twin support vector regression

Journal of Zhejiang University-Science C(Computers and Electronics) 2013年第9期14卷 722-732页

作者： Hua-juan HUANG Shi-fei DING Zhong-zhi SHI School of Computer Science and Technology China University of Mining and Technology Key Lab of Intelligent Information Processing Institute of Computing TechnologyChinese Academy of Sciences

The training algorithm of classical twin support vector regression (TSVR) can be attributed to the solution of a pair of quadratic programming problems (QPPs) with inequality constraints in the dual ***,this solution is affected by time and memory constraints when dealing with large *** this paper,we present a least squares version for TSVR in the primal space,termed primal least squares TSVR (PLSTSVR).By introducing the least squares method,the inequality constraints of TSVR are transformed into equality ***,we attempt to directly solve the two QPPs with equality constraints in the primal space instead of the dual space;thus,we need only to solve two systems of linear equations instead of two *** results on artificial and benchmark datasets show that PLSTSVR has comparable accuracy to TSVR but with considerably less computational *** further investigate its validity in predicting the opening price of stock.

关键词： Twin support vector regression Least squares method Primal space Stock prediction

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fast and scalable lock methods for video coding on many-core architecture” [J. Vis. Commun. Image R. 25(7) (2014) 1758–1762]

引用

Journal of Visual Communication and Image Representation 2015年 27卷 57-57页

作者： Weizhi Xu Hui Yu Dianjie Lu Fenglong Song Da Wang Xiaochun Ye Songwei Pei Dongrui Fan Hongtao Xie Institute of Microelectronics Tsinghua University Beijing China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China Key Lab. of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Information Science and Engineering Shandong Normal University Jinan China Department of Computer Science and Technology Beijing University of Chemical Technology Beijing China Institute of Information Engineering Chinese Academy of Sciences National Engineering Laboratory for Information Security Technologies Beijing China

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Fast and scalable lock methods for video coding on many-core architecture” [J. Vis. Commun. 25 (7) (2014) 1758–1762]

引用

Journal of Visual Communication and Image Representation 2015年 26卷 350-350页

来源：评论

学校读者我要写书评

暂无评论

EPiK-a Workflow for Electron Tomography in Kepler

引用

Procedia computer science 2014年 20卷 2295-2305页

作者： Ruijuan Chen Xiaohua Wan Ilkay Altintas Jianwu Wang Daniel Crawl Sébastien Phan Albert Lawrence Mark Ellisman National Center for Microscopy and Imaging Research University of California San Diego La Jolla CA USA. Key Lab of Intelligent Information Processing and Advanced Computing Research Lab Institute of Computing Technology Chinese Academy of Sciences Beijing China. San Diego Supercomputer Center University of California San Diego La Jolla CA USA.

Scientific workflows integrate data and computing interfaces as configurable, semi-automatic graphs to solve a scientific problem. Kepler is such a software system for designing, executing, reusing, evolving, archiving and sharing scientific workflows. Electron tomography (ET) enables high-resolution views of complex cellular structures, such as cytoskeletons, organelles, viruses and chromosomes. Imaging investigations produce large datasets. For instance, in Electron Tomography, the size of a 16 fold image tilt series is about 65 Gigabytes with each projection image including 4096 by 4096 pixels. When we use serial sections or montage technique for large field ET, the dataset will be even larger. For higher resolution images with multiple tilt series, the data size may be in terabyte range. Demands of mass data processing and complex algorithms require the integration of diverse codes into flexible software structures. This paper describes a workflow for Electron Tomography Programs in Kepler (EPiK). This EPiK workflow embeds the tracking process of IMOD, and realizes the main algorithms including filtered backprojection (FBP) from TxBR and iterative reconstruction methods. We have tested the three dimensional (3D) reconstruction process using EPiK on ET data. EPiK can be a potential toolkit for biology researchers with the advantage of logical viewing, easy handling, convenient sharing and future extensibility.

关键词： EPiK Electron Tomography Kepler Scientific workflows TxBR

来源：评论

学校读者我要写书评

暂无评论

Efficiently Finding Top-K Items from Evolving Distributed Data Streams

Efficiently Finding Top-K Items from Evolving Distributed Da...

引用

International Conference on Semantics, Knowledge and Grid (SKG)

作者： Baoyuan Qi Gang Ma Zhongzhi Shi Wei Wang University of Chinese Academy of Sciences Beijing China Key Lab of Intelligent Information Processing Institute of Computing Technology Cas Beijing China Key Lab. of Intell. Inf. Process. Institute of Computing Technology Chinese Academy of Sciences Beijing CN Beijing Lexo Technologies Co. Ltd. Beijing China

ISBN: (纸本)9781479967162

The problem of efficiently finding top-k frequent items has attracted much attention in recent years. Storage constraints in the processing node and intrinsic evolving feature of the data streams are two main challenges. In this paper, we propose a method to tackle these two challenges based on space-saving and gossip-based algorithms respectively. Our method is implemented on SAMOA, a scalable advanced massive online analysis machine learning framework. The experimental results show its effectiveness and scalability.

关键词： Peer-to-peer computing Data mining Distributed databases Protocols Machine learning algorithms Monitoring Radiation detectors

来源：评论

学校读者我要写书评

暂无评论

Social sensing enhanced time estimation for bus service

引用

Concurrency and Computation: Practice and Experience 2015年第15期27卷

作者： Jin Liu Juan Li Xiaohui Cui Xiaoguang Niu Xiaoping Sun Jing Zhou State Key Lab. of Software Engineering Computer School Wuhan University Wuhan China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China International School of Software Wuhan University Wuhan China Computer School Wuhan University Wuhan China Key Lab of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science Communication University of China China

The precise prediction of bus routes or the arrival time of buses for a traveler can enhance the quality of bus service. However, many social factors influence people's preferences for taking buses. These social factors may include heavy traffic cost, traffic congestion, poor air quality and so forth. Existing prediction techniques rarely consider social sensing when predicting the bus arrival time. Accordingly, this paper proposes a social sensing enhanced service for predicting bus routes, which integrates sensing ability and social networks to understand and measure the influence between social events and vehicle velocity. We focus on the analysis of two different attributions: PT service quality attributions PEA s and road condition attributions PRCA s. Both of them synthesize the social sensing in their evaluation of bus routes. PEA represents individual preferences and PRCA represents physical factors that significantly influence vehicle velocity. Bus relevant social events were further categorized into PEA events or PRCA events. PEA s of buses were scored according to the tendency of bus conditions reflected in social events. Furthermore, an artificial neural network prediction model is established to estimate the bus travel time. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： social sensing in-time bus service bus route arrival time estimation

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks

Energy-Efficient Flow Scheduling and Routing with Hard Deadl...

引用

International Conference on Distributed computing Systems

作者： Lin Wang Fa Zhang Kai Zheng Athanasios V. Vasilakos Shaolei Ren Zhiyong Liu University of Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Chinese Academy of Sciences IBM China Research Lab University of Western Macedonia Greece Florida International University USA Institute of Computing Technology Chinese Academy of Sciences

The power consumption of enormous network devices in data centers has emerged as a big concern to data center operators. Despite many traffic-engineering-based solutions, very little attention has been paid on performance-guaranteed energy saving schemes. In this paper, we propose a novel energy-saving model for data center networks by scheduling and routing "deadline-constrained flows" where the transmission of every flow has to be accomplished before a rigorous deadline, being the most critical requirement in production data center networks. Based on speed scaling and power-down energy saving strategies for network devices, we aim to explore the most energy efficient way of scheduling and routing flows on the network, as well as determining the transmission speed for every flow. We consider two general versions of the problem. For the version of only flow scheduling where routes of flows are pre-given, we show that it can be solved polynomially and we develop an optimal combinatorial algorithm for it. For the version of joint flow scheduling and routing, we prove that it is strongly NP-hard and cannot have a Fully Polynomial-Time Approximation Scheme (FPTAS) unless P=NP. Based on a relaxation and randomized rounding technique, we provide an efficient approximation algorithm which can guarantee a provable performance ratio with respect to a polynomial of the total number of flows.

关键词： Schedules Routing Power demand Switches Optimal scheduling Data models Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Failure Handling of E-Business Services in an Extensible Constraint Service Model

Failure Handling of E-Business Services in an Extensible Con...

引用

2013 IEEE 4th International Conference on Software Engineering and Service Science

作者： Ruoyu Chen Lejian Liao Zhi Fang Beijing Engineering Research Centre of High Volume Language Information Processing & Cloud Computing Applications Beijing Key Laboratory of Intelligent Information TechnologySchool of Computer ScienceBeijing Institute of Technology

ISBN: (纸本)9781467349994

Failure handling of business transactions is essential in E-Business *** paper extends the service process specification proposed in a contract-centered constraint-based service modelling framework with failure handling *** failure in process model,generalized failure such as QoS violation can be modelled in *** semantics for failure handling in E-Business services as well as policies are discussed via a state transition system.A virtual machine is built for contracting and executing of services under this framework.

关键词： Services service Failure Handling of E-Business Services in an Extensible Constraint Service Model

来源：评论

学校读者我要写书评

暂无评论

Mining approximate keys based on reasoning from XML data

Mining approximate keys based on reasoning from XML data

引用

17th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2013

作者： Yijun, Liu Feiyue, Ye Sheng, He School of Computer Engineering Jiangsu University of Technology Changzhou Jiangsu 213001 China Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Changzhou Jiangsu 213001 China

ISBN: (纸本)9783642403187

keys are very important for data management. Due to the hierarchical and flexible structure of XML, mining keys from XML data is a more complex and difficult task than from relational databases. In this paper, we study mining approximate keys from XML data, and define the support and confidence of a key expression based on the number of null values on key paths. In the mining process, inference rules are used to derive new keys. Through the two-phase reasoning, a target set of approximate keys and its reduced set are obtained. Our research conducted experiments over ten benchmark XML datasets from XMark and four files in the UW XML Repository. The results show that the approach is feasible and efficient, with which effective keys in various XML data can be discovered. © Springer-Verlag 2013.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Incorporating social actions into recommender systems

Incorporating social actions into recommender systems

引用

14th International Conference on Web-Age information Management, WAIM 2013

作者： Ma, Di Song, Dandan Liao, Lejian Beijing Eng. Res. Ctr. of High Vol. Language Information Processing and Cloud Computing Application Beijing Lab of Intelligent Information Technology School of Computer Science Beijing China

ISBN: (纸本)9783642385612

With the rapidly growing amount of information available on the internet, recommender systems become popular tools to promote relevant online information to a given user. Although collaborative filtering is the most popular approach to build recommender systems and has been widely deployed in many applications, it still pay little attention to social actions, which are widely common in social networks and we believe could make a significant improvement in recommender systems. In this paper, we incorporate users' social actions into a model-based approach for recommendation using probabilistic matrix factorization. Compared with previous work, users' social actions are taken as a new relation to optimize previous trust-based recommender systems. To achieve this, we propose a social recommendation graphical model employing users' relations based on their social actions. We make use of users' commenting action in our approach and conduct experiments on a real life dataset, extracted from the Douban movie ratings and comments system. Our experiments demonstrate that incorporating users' social action information leads to a significant improvement in recommender systems. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：