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

Efficient Extraction of Target Users for Package Promotion in Big Social Networks

IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS 2020年第5期7卷 1111-1122页

作者： Yeh, Lo-Yao Wu, Hsien-Chu Natl Ctr High Performance Comp Hsinchu 30076 Taiwan Natl Chi Nan Univ Dept Informat Management Nantou 54561 Taiwan Natl Chin Yi Univ Technol Dept Comp Sci & Informat Engn Taichung 41170 Taiwan

Package promotion (or product bundling and bundle promotion) is widely adopted as an effective marketing strategy to increase sales, but the social tightness of the users significantly influences their willingness to purchase certain products. However, addressing these two factors simultaneously is not a trivial task because it is critical to properly choose a set of socially tight target users to encourage them to buy the products together (social tightness factor), and the selected users should have high preference for the package of products (preference factor). To address the aforementioned challenges, in this article, we study the research problem of promoting a package of products to a set of closely related friends. We formulate a new research problem, named package-oriented group identification (PGI), which can obtain a set of t socially tight users (i.e., inducing more than k edges) who have the maximum preference for a package of items. We prove that the proposed PGI problem is NP-hard, and we develop a polynomial-time algorithm named incremental solution construction with redundancy and infeasibility avoidance for PGI (ISCP) that can effectively and efficiently obtain a good solution to the PGI problem. We compare the performance of ISCP with four other baselines on a large-scale product copurchasing data set with more than 500 k products and 1.7 M copurchasing relationships. The results show that our proposed ISCP algorithm outperforms the other baselines in terms of solution quality and efficiency.

关键词： algorithm design package promotion social networks target group identification

来源：评论

学校读者我要写书评

暂无评论

Towards efficient and scalable implementation for coding-based on-demand data broadcast

引用

COMPUTER NETWORKS 2019年 154卷 88-104页

作者： Ali, G. G. Md. Nawaz Liu, Kai Lee, Victor C. S. Chong, Peter H. J. Guan, Yong Liang Chen, Jun Clemson Univ Dept Automot Engn Clemson SC 29631 USA Nanyang Technol Univ Sch Elect & Elect Engn Singapore Singapore Chongqing Univ Coll Comp Sci Chongqing Peoples R China City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China Auckland Univ Technol Dept Elect & Elect Engn Auckland New Zealand Wuhan Univ Sch Informat Management Wuhan Hubei Peoples R China

Network coding has been demonstrated as a promising solution to further enhancing the bandwidth efficiency for on-demand broadcast. In this work, first, we show the performance improvement of a straightforward implementation of coding based on-demand data broadcast algorithms over the traditional on-demand broadcast approaches. Second, as the straightforward implementation of the optimal approach has overwhelming computational overhead, we propose an efficient generalized implementation scheme, which can be applied to all the existing on-demand scheduling algorithms. The proposed scheme reduces the computational overhead while achieves the same performance as the straightforward implementation. Third, to further enhance system scalability, we propose an approximate implementation method with even lower computational overhead while maintaining near optimal performance. Finally, we conduct an extensive simulation study and the results demonstrate that the proposed efficient implementation schemes can improve the system performance over 40% compared with the traditional broadcast approach, and the computational overhead can be reduced by 75% compared with the straightforward implementation. In addition, we show that the proposed approximate implementation can further reduce the computational overhead significantly and it is able to strike a balance between the service performance and system scalability. (C) 2019 Published by Elsevier B.V.

关键词： On-demand broadcast Data scheduling Network coding algorithm design Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

Energy- and time-efficient matrix multiplication on FPGAs

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2005年第11期13卷 1305-1319页

作者： Jang, JW Choi, SB Prasanna, VK Sogang Univ Dept Elect Engn Seoul South Korea Intel Corp Chandler AZ 85248 USA Univ So Calif Dept Elect Engn Syst Los Angeles CA 90089 USA

We develop new algorithms and architectures for matrix multiplication on configurable devices. These have reduced energy dissipation and latency compared with the state-of-the-art field-programmable gate array (FPGA)-based designs. By profiling well-known designs, we identify "energy hot spots," which are responsible for most of the energy dissipation. Based on this, we develop algorithms and architectures that offer tradeoffs among the number of I/O ports, the number of registers, and the number of PEs. To avoid time-consuming low-level simulations for energy profiling and performance prediction of many alternate designs, we derive functions to represent the impact of algorithm design choices on the system-wide energy dissipation, area, and latency. These functions are used to either optimize the energy performance or provide tradeoffs for a family of candidate algorithms and architectures. For selected designs, we perform extensive low-level simulations using state-of-the-art tools and target FPGA devices. We show a design space for matrix multiplication on FPGAs that results in tradeoffs;among energy, area, and latency. For example, our designs improve the energy performance of state-of-the-art FPGA-based designs by 29%-51% without any increase in the area-latency product. The latency of our designs is reduced one-third to one-fifteenth while area is increased 1.9-9.4 times. In terms of comprehensive metrics such as Energy-Area-Time, our designs exhibit superior performance compared with the state-of-the-art by 50%-79%.

关键词： algorithm design configurable hardware energy-delay tradeoff field-programmable gate array (FPGA) linear array matrix multiplication performance estimation

来源：评论

学校读者我要写书评

暂无评论

GENERATION OF BINARY-TREES FROM (0-1) CODES

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1992年第3-4期42卷 157-162页

作者： GUPTA, DK Department of Mathematics Indian Institute of Technology West Bengal Kharagpur-721 302 India

A Binary tree can be represented by a code reflecting the traversal of the corresponding regular binary tree in a given monotonic order. A different coding scheme based on the branches of a regular binary tree with n-nodes is proposed. It differs from the coding scheme generally used and makes no distinction between internal nodes and terminal nodes. A code of a regular binary tree with n-nodes is formed by labeling the left branches by 0's and the right branches by 1's and then traversing these branches in pre-order. Root is always assumed to be on a left branch. Different order of traversals yield different codes. An efficient nonrecursive Pascal program of 0(n log2 n) time complexity using the backtracking approach is given to generate these codes in colexicographic order

关键词： CODE TRAVERSALS MONOTONIC ORDER BINARY TREES RECURSON BACKTRACK APPROACH algorithm design

来源：评论

学校读者我要写书评

暂无评论

Scalable Verification of Networks With Packet Transformers Using Atomic Predicates

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2017年第5期25卷 2900-2915页

作者： Yang, Hongkun Lam, Simon S. Google Mountain View CA 94043 USA Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

Packet transformers are widely used in ISPs, datacenter infrastructures, and layer-2 networks. Existing network verification tools do not scale to large networks with transformers (e.g., MPLS, IP-in-IP, and NAT). Toward scalable verification, we conceived a novel packet equivalence relation. For networks with packet transformers, we first present a formal definition of the packet equivalence relation. Our transformer model is general, including most transformers used in real networks. We also present a new definition of atomic predicates that specify the coarsest equivalence classes of packets in the packet space. We designed an algorithm for computing these atomic predicates. We built a verifier, named Atomic Predicates for Transformers, and evaluated its performance using four network data sets with MPLS tunnels, IP-in-IP tunnels, and NATs. For a provider cone data set with 11.6 million forwarding rules, 92 routers, 1920 duplex ports, and 40 MPLS tunnels which use 170 transformers, APT used only 0.065 s, on average, to compute the reachability tree from a source port to all other ports for all packets and perform loop detection as well. For the Stanford and Internet2 data sets with NATs, APT is faster than HSA (Hassel in C implementation) by two to three orders of magnitude. By working with atomic predicates instead of individual packets, APT achieves verification performance gains by orders of magnitude.

关键词： Network verification reachability analysis packet transformers formal methods algorithm design

来源：评论

学校读者我要写书评

暂无评论

A comparison of collaborative-filtering recommendation algorithms for e-commerce

引用

IEEE INTELLIGENT SYSTEMS 2007年第5期22卷 68-78页

作者： Huang, Zan Zeng, Daniel Chen, Hsinchen Penn State Univ Smeal Coll Business Dept Supply Chain & Informat Syst University Pk PA 16802 USA Univ Arizona Dept Management Informat Syst Tucson AZ 85721 USA

Collaborative filtering is one of the most widely adopted and successful recommendation approaches. Unlike approaches based on intrinsic consumer and product characteristics, CF characterizes consumers and products implicitly by their previous interactions. The simplest example is to recommend the most popular products to all consumers. Researchers are advancing CF technologies in such areas as algorithm design, human- computer interaction design, consumer incentive analysis, and privacy protection.

关键词： Aggregates algorithm design and analysis Collaboration Feedback Filtering algorithms Guidelines Optical wavelength conversion Prediction algorithms Privacy Protection algorithm design algorithm design and evaluation collaborative filtering collaborative-filtering recommendation algorithms e-commerce consumer incentive analysis e-commerce electronic commerce groupware human- computer interaction design information filtering information filters intrinsic consumer privacy protection product characteristics recommendation approaches recommender systems

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms for the inverse sort transform

引用

IEEE TRANSACTIONS ON COMPUTERS 2007年第11期56卷 1564-1574页

作者： Nong, Ge Zhang, Sen Sun Yat Sen Univ Dept Comp Sci Guangzhou 510275 Peoples R China SUNY Coll Oneonta Dept Math Comp Sci & Stat Oneonta NY 13820 USA

As an important variant of the Burrows-Wheeler Transform (BWT), the Sort Transform (ST) can speed up the transformation by sorting only a portion of the matrix. However, because the currently known inverse ST algorithms need to retrieve the complete k-order contexts and use hash tables, they are less efficient than the inverse BWT. In this paper, we propose three fast and memory-efficient inverse ST algorithms. The first algorithm uses two auxiliary vectors to replace the hash tables. The algorithm achieves O(kN) time and space complexities for a text of N characters under the context order k. The second uses two additional compact "alternate vectors" to further eliminate the need to restore all of the k-order contexts and achieve O(N) space complexity. Moreover, the third uses a "doubling technique" to further reduce the time complexity to O(N log2 k). The hallmark of these three algorithms is that they can invert the ST in a manner similar to inverting BWT in that they all make use of precalculated auxiliary mapping vectors and require no hash tables. These unifying algorithms can also better explain the connection between the BWT and the ST: Not only can their forward components be performed by the same algorithm framework, but their respective inverse components can also be efficiently conducted by the unifying algorithm framework proposed in the present work.

关键词： Burrows-Wheeler transform inverse sort transform limit-order contexts algorithm design data compression

来源：评论

学校读者我要写书评

暂无评论

Finding the sweet spot: Exploring the optimal communication delay for AI feedback tools

引用

INFORMATION PROCESSING & MANAGEMENT 2024年第2期61卷

作者： Shi, Yingnan Deng, Bingjie Australian Natl Univ 26c Kingsley St Canberra ACT 2600 Australia Xian Jiaotong Liverpool Univ Suzhou 215123 Jiangsu Peoples R China CSIRO Data61 Bldg 101Clunies Ross St Canberra ACT 2600 Australia

AI writing assistants that are capable of offering rapid, automatic, and corrective feedback are becoming increasingly powerful, providing accurate and automatic feedback to knowledge contributors while they write. This helps people stay engaged and focused on their writing tasks. However, even with improved algorithms, AI still requires communication delays to perform sophisticated language processing and generate accurate responses. Prior research suggests that if the delay is too long, users may lose interest and become frustrated, perceiving the AI agent as ineffective. Conversely, if the AI-generated feedback is too quick, users may push back and perceive the AI as not fully comprehending their input, leading to low levels of trust. The impact of feedback timing on knowledge contribution behavior remains largely unknown. To address this gap, this research employs two sequential studies to explore the effects of feedback timing. The first study is a conjoint analysis, and the second study is a random-assignment-based experiment. Our results show that an optimal range of timing for communication delay is approximately one to three seconds, leading to improved performance. Presentation styles of the AI agent may affect these results but only slightly. Our study is the first to systematically investigate the optimality of communication delay on AI feedback mechanisms. Our findings will contribute to the literature on knowledge management, algorithm design, and anthropomorphism, and also inspire the software designers on the optimal timing of the communication feedback.

关键词： Communication delay AI performance Knowledge management algorithm design Anthropomorphism

来源：评论

学校读者我要写书评

暂无评论

An irrigation scheduling algorithm for sustainable energy consumption in pressurised irrigation networks supplied by photovoltaic modules

引用

CLEAN TECHNOLOGIES AND ENVIRONMENTAL POLICY 2023年第6期25卷 2009-2024页

作者： Navarro-Gonzalez, F. J. Pardo, M. A. Chabour, H. E. Alskaif, T. Univ Alicante Dept Appl Math Alicante 03690 Spain Univ Alicante Dept Civil Engn Alicante 03690 Spain Wageningen Univ & Res Informat Technol Grp Wageningen Netherlands

To meet water demands, pressurised irrigation networks often need pumping devices, whose power demand varies with the pump head, the flow rate delivered and the pump efficiency. To satisfy the energy demand of pumps, solar photovoltaic panels can be used as a renewable energy source. Since the electricity supply of a solar photovoltaics plant depends on irradiance, the energy that powers the pump varies with the time of the day. This study presents a strategy for scheduling water delivery by irrigation pumps, synchronising energy production in solar photovoltaic modules and minimising the installation size. An optimisation algorithm is proposed, which changes the energy required by pumping devices and adjusts them to the available solar energy supply, minimising the number of panels required. This problem applies to a pressurised irrigation network, where the utility manager may irrigate crops at all hours of the day. By adopting the proposed algorithm, irrigation will follow a rigid rotation schedule to follow the new irrigation plan. This approach improves earlier studies by employing a least-square scheduling algorithm with little computing time. This results in a tool for managers and decision-makers when evaluating the possibility of converting their irrigation network into a stand-alone system supplied by photovoltaic panels. A case study handling this issue in the University of Alicante's pressurised irrigation network in Spain is proposed to find potential energy savings by connecting the recommended scheduling irrigating plan to the present operation. [GRAPHICS]

关键词： Irrigation management strategy algorithm design Energy consumption Solar photovoltaics energy

来源：评论

学校读者我要写书评

暂无评论

ASYMPTOTIC CONSENSUS OF DYNAMICAL POINTS IN A STRICT MAX-CONVEX SPACE AND ITS APPLICATIONS

引用

SIAM JOURNAL ON CONTROL AND OPTIMIZATION 2020年第4期58卷 1984-2005页

作者： Chen, Sheng Lim, Cheng-Chew Shi, Peng Lu, Zhenyu Nanjing Univ Informat Sci & Technol CICAEET B DAT Sch Automat Nanjing 210044 Peoples R China Univ Adelaide Sch Elect & Elect Engn Adelaide SA 5005 Australia Nanjing Univ Informat Sci & Technol Sch Artificial Intelligence Nanjing 210044 Peoples R China

This paper explores the design problem of consensus algorithms in a class of convex geometric metric spaces. Using the techniques of convex analysis and possibility analysis, a simple assumption for designing consensus algorithms in a strict max-convex space is proposed, under which all dynamical points in a system achieve consensus asymptotically if and only if their associated interaction graph uniformly contains at least one directed spanning tree. Three efficient consensus algorithms under the assumption are presented, and their applications are demonstrated together with efficiency studies.

关键词： consensus algorithms algorithm design geometric spaces convex analysis possibility analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：