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

General Rumor Blocking: An efficient random algorithm with martingale approach

THEORETICAL COMPUTER SCIENCE 2020年 803卷 82-93页

作者： Fang, Qizhi Chen, Xin Nong, Qingqin Zhang, Zongchao Cao, Yongchang Feng, Yan Sun, Tao Gong, Suning Du, Dingzhu Ocean Univ China Sch Math Sci Qingdao 266100 Peoples R China Guangzhou VIP Informat Technol Co Ltd Guangzhou Peoples R China Univ Texas Dallas Dept Comp Sci Dallas TX 75083 USA

Rumor Blocking, an important optimization problem in social network, has been extensively studied in the literature. Given social network G = (V, E) and rumor seed set A, the goal is asking for k protector seeds that protect the largest expected number of social individuals by truth. However, the source of rumor is always uncertain, rather than being predicted or being known in advance in the real situations, while rumor spreads like wildfire on the Internet. This paper presents General Rumor Blocking with unpredicted rumor seed set (randomized A) and various personal profits while being protected (weights of nodes in V). We first show that the objective function of this problem is non-decreasing and submodular, and thus a (1 - 1/e) approximate solution can be returned by greedy approach. We then propose an efficient random algorithm R-GRB which returns a (1 - 1 /e - epsilon) approximate solution with at least 1 - n(-l) probability. We show that it runs in O (m(n - r)(k log(n - r) l logn)/epsilon(2)) expected time, where m = vertical bar E vertical bar, n = vertical bar V vertical bar, r = vertical bar A vertical bar and k is the number of protector seeds. Finally, we conduct extensive experiments to evaluate the R-GRB and show that it is superior in both theory and experiment. (C) 2019 Elsevier B.V. All rights reserved.

关键词： Rumor blocking random algorithm Greedy approach Martingale

来源：评论

学校读者我要写书评

暂无评论

Design of structure parameters for gasoline engine common rail system based on random algorithm 34

Design of structure parameters for gasoline engine common ra...

引用

34th Chinese Control Conference (CCC)

作者： Wang, Changyong Yang, Rongbin Hu, Yunfeng Xie, Xiaohua State Key Lab Automot Simulat & Control Changchun 130022 Peoples R China Dept Control Sci & Engn Changchun 130022 Peoples R China

ISBN: (纸本)9789881563897

The stable operation of common rail system is significant for GDI engine and the rail pressure fluctuation affects the engine performance directly. The common rail volume and the cylinder diameter are the key structure parameters of common rail system to affect the rail pressure fluctuation. To design the structure parameters of high common rail system for decreasing the rail pressure fluctuation, the high common rail system model of GDI engine is established and the random algorithm is used to obtain the optimal controller parameters. Then, through the simulation experiments, the effects of structure parameters on the stability of common rail pressure are analyzed. Finally a basis is provide for optimally designing the parameters of the cylinder diameter and common rail volume.

关键词： Cylinder diameter Common rail volume random algorithm Rail pressure fluctuation

来源：评论

学校读者我要写书评

暂无评论

Research on random algorithm of English Test Paper Composition 4

Research on Random Algorithm of English Test Paper Compositi...

引用

4th International Conference on Intelligent System and Applied Material (GSAM)

作者： Qu, Weiwei Bohai Univ Res & Teaching Inst Foreign Languages Jinzhou Peoples R China

ISBN: (纸本)9783038353140

English, as one of the most important information carriers, has become the most widely used language worldwide, and its importance is increasingly prominent in each field of our society. Examinations are an important means of evaluating the level of English language learning and teaching outcomes. For the problems existed in traditional English exam, this paper research English online examination system intelligent test paper based on random algorithm. First, the design test paper constraints, including the question amount constraint, questions type constraints, knowledge point constraints, difficulty constraints, answer time constraints and so on;Then, using the linear congruence generator study of a random number generation, list recursive formula and describe parameters;Finally, using flow diagram to study random test paper process, for each step describing in detail. Advantages of random algorithm are easy to use, the disadvantage is not retrospective, applies to the number of exam papers and extraction requirements are relatively few cases.

关键词： English intelligent test paper composition random algorithm random number generation

来源：评论

学校读者我要写书评

暂无评论

Community detection in complex network based on an improved random algorithm using local and global network information

引用

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2022年 206卷

作者： Dabaghi-Zarandi, Fahimeh KamaliPour, Parsa Vali e Asr Univ Rafsanjan Comp Engn Dept Rafsanjan Iran

These days, there are many types of complex networks that understanding the topology and functions of them allows us to derive valuable information from these networks. In this regards, community detection is an im-portant research area that divides network graph into several subsets of network nodes called communities. The nodes included in each community are densely communicated to each other and are sparsely communicated to those nodes outside of this community. In this paper, we propose a novel community detection method that uses local and global network information resulting in low complexity and high accuracy. The our proposal is performed based on our identified architecture composed of four components including Pre-Processing, Primary Communities Composing, Communities Merging and Best Community Structure Selecting components. In the first component, we identify and store similarity measures and assign appropriate weights to network nodes and links based on local network information. Then, the second component considers similarity measures to compose a primary community structure based on a random algorithm improved by nodes' weights. In the third component, we merge primary communities to achieve different community structures. Finally, the fourth component selects the best community structure considering evaluation functions calculated based on local and global network information. We evaluate our proposal based on different cases of real and artificial networks. Results show that our proposal can detect communities similar to real communities and has acceptable and efficient evaluation functions in all networks with any size and type compared with other proposals.

关键词： Community detection Communities combination random algorithm Complex networks Structural similarity Local and global network information

来源：评论

学校读者我要写书评

暂无评论

Planar-shape prototype generation using a tree-based random greedy algorithm

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS 2006年第3期36卷 649-659页

作者： Chen, Wen-Yao Hwang, Wen-Liang Lin, Tien-Ching Acad Sinica Inst Informat Sci Taipei 115 Taiwan Natl Tsing Hua Univ Hsinchu Taiwan Natl Taiwan Univ Taipei 10764 Taiwan

A prototype is representative of a set of similar objects. This paper proposes an approach that formulates the problem of prototype generation as finding the mean from a given set of objects, where the prototype solution must satisfy certain constraints. These constraints describe the important perceptual features of the sample shapes that the proposed prototype must retain. The contour prototype generated from a set of planar objects was used as an example of the approach, and the corners were used as the perceptual features to be preserved in the proposed prototype shape. However, finding a prototype solution for more than two contours is computationally intractable. A tree-based approach is therefore proposed in which an efficient greedy random algorithm is used to obtain a good approximation of the proposed prototype and analyze the expected complexity of the algorithm. The proposed prototype-generation process for hand-drawn patterns is described and discussed in this paper.

关键词： pattern recognition prototype generation random algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Buffer Management in Massively Parallel Systems: The Power of randomness

引用

ACM TRANSACTIONS ON PARALLEL COMPUTING 2025年第1期12卷 1-33页

作者： Pham, Minh Yuan, Yongke Li, Hao Mou, Chengcheng Tu, Yicheng Xu, Zichen Meng, Jinghan Univ S Florida Comp Sci & Engn Tampa FL 33620 USA Beijing Univ Technol Beijing Peoples R China Univ S Florida Tampa FL USA Nanchang Univ Nanchang Jiangxi Peoples R China

Massively parallel systems, such as Graphics Processing Units (GPUs), play an increasingly crucial role in today's data-intensive computing. The unique challenges associated with developing system software for massively parallel hardware to support numerous parallel threads efficiently are of paramount importance. One such challenge is the design of a dynamic memory allocator to allocate memory at runtime. Traditionally, memory allocators have relied on maintaining a global data structure, such as a queue of free pages. However, in the context of massively parallel systems, accessing such global data structures can quickly become a bottleneck even with multiple queues in place. This paper presents a novel approach to dynamic memory allocation that eliminates the need for a centralized data structure. Our proposed approach revolves around letting threads employ random search procedures to locate free pages. Through mathematical proofs and extensive experiments, we demonstrate that the basic random search design achieves lower latency than the bestknown existing solution, Ouroboros, in most situations. Furthermore, we develop more advanced techniques and algorithms to tackle the challenge of warp divergence and further enhance performance when free memory is limited. Building upon these advancements, our mathematical proofs and experimental results affirm that these advanced designs can yield an order of magnitude improvement over the basic design and consistently outperform the state-of-the-art by up to two orders of magnitude. To illustrate the practical implications of our work, we integrate our memory management techniques into two GPU algorithms: a hash join and a group-by. Both case studies provide compelling evidence of our approach's pronounced performance gains.

关键词： GPU parallel computing memory allocation random algorithm buffer management

来源：评论

学校读者我要写书评

暂无评论

Concept design from random algorithms for design sketching

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2015年第1期6卷 3-11页

作者： Wang, Ming-Tang Yang, Chih-Chieh Natl Kaohsiung Normal Univ Dept Ind Design Yanchao Township 824 Kaohsiung Count Taiwan Southern Taiwan Univ Sci & Technol Dept Multimedia & Entertainment Sci Tainan 71005 Taiwan

To determine an understandable algorithm method that could be used by designers to create novel concept designs, we selected the popular motor scooter as a sample product, and used the most distinctive front handle cover as a design target. Our method included three phases: preparation, construction of conceptual creativity, and semantic analysis. We compared random idea sketches with designs available on the market, and observed that certain concept designs obtained using this method were exceptionally innovative, and could be easily redesigned for an actual product. This method can immediately provide many ideas that could be used to develop feasible designs. This method can not only be applied unlimited times to generate innovative ideas, but can also be adjusted to fit a new project. Finally, we observed innovative image that the created designs of the front handle cover were more than the designs available on the market, according to a questionnaire survey. This proved that the proposed method could be used to produce original concept designs.

关键词： Concept design Motor scooter random algorithm

来源：评论

学校读者我要写书评

暂无评论

Modeling method and experimental study on the random distribution of abrasive particles in the jet cutting process

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2022年第5-6期121卷 3173-3191页

作者： Feng, Long Zhang, Qiang Du, Mingchao Fan, Chunyong Zhang, Kun Shandong Univ Sci & Technol Coll Mech & Elect Engn Qingdao 266590 Peoples R China

The distribution of abrasive particles in fluids is an important research topic in the study of abrasive waterjet cutting processes. However, it is impossible to obtain the accurate distribution law and influencing factors by performing only experiments;therefore, it is necessary to study abrasive waterjet cutting processes with the help of numerical models. The existing numerical models usually adopt the form of artificial settings for the distribution of abrasive particles in fluid. This method cannot accurately simulate the random distribution of particles. In this paper, the random algorithm method is used to simulate the impact azimuth and the random distribution of abrasive particles in water. The smoothed particle hydrodynamics (SPH) method is used to simulate the distribution of abrasive particles and the process of jet impingement. The influence of the particle distribution on the simulation results is studied. Comparisons show that the dent formed by the jet impinging on the target with random abrasive particles is similar to the dent from the actual cut, and the contour distribution of the dent is more uniform than that of the cut. The simulation results obtained by the SPH method are accurate.

关键词： Abrasive waterjet cutting random algorithm SPH algorithm Cutting profile

来源：评论

学校读者我要写书评

暂无评论

random completely generalized set-valued implicit quasi-variational inequalities

引用

POSITIVITY 1999年第3期3卷 201-213页

作者： Huang, NJ Cho, YJ Sichuan Univ Dept Math Chengdu 610064 Peoples R China Gyeongsang Natl Univ Dept Math Chinju 660701 South Korea

The purpose of this paper is to introduce a class of new random completely generalized set-valued implicit quasi-variational inequalities, to construct new random iterative algorithms, and to give some existence theorems of random solutions for this class of random completely generalized set-valued implicit quasi-variational inequalities. We also prove the convergence of random iterative sequences generated by the algorithms. Our results extend and improve the earlier and recent results.

关键词： random completely generalized set-valued implicit quasi-variational inequality random representation theorem random algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient random saliency map detection

引用

Science China(Information Sciences) 2011年第6期54卷 1207-1217页

作者： HUANG ZhiYong, HE FaZhi , CAI XianTao, ZOU ZhengQin, LIU Jing, LIANG MingMing & CHEN XiaoComputer School, Wuhan University, Wuhan 430074, China 1. Computer School Wuhan University Wuhan 430074 China

Most image retargeting algorithms rely heavily on valid saliency map detection to proceed. However, the inefficiency of high quality saliency map detection severely restricts the application of these image retargeting methods. In this paper, we propose a random algorithm for efficient context-aware saliency map detection. Our method is a multiple level saliency map detection algorithm that integrates multiple level coarse saliency maps into the resulting saliency map and selectively updates unreliable regions of the saliency map to refine detection results. Because of the randomized search, our method requires very little additional memory beyond that for the input image and result map, and does not need to build auxiliary data structures to accelerate the saliency map detection. We have implemented our algorithm on a GPU and demonstrated the performance for a variety of images and video sequences, compared with state-of-the-art image processing.

关键词： saliency map detection image retargeting random algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：