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

algorithmic research on surface roughness in laser-melted claddings: A review

SURFACE ENGINEERING 2024年第9-10期40卷 933-944页

作者： Zhao, Changlong Zhang, Zihao Yu, Zice Du, Weilong Changchun Univ Coll Mech & Vehicle Engn Changchun 130022 Jilin Peoples R China

As a breakthrough of the additive manufacturing technology being achieved, many fields have broadly applied laser cladding due to its unique advantages. But the surface characteristics of the cladding layer are not frequently aligned with the standards necessary for industrial use. Consequently, with a particular focus on refining its surface roughness, it has emerged as a significant area of interest among numerous investigators. This paper reviews a variety of methods for optimizing the surface roughness of laser cladding, covering from deterministic algorithms such as Taguchi's method, orthogonal experimental method, gradient descent method, to stochastic algorithms including neural network, genetic algorithm, Gray Wolf algorithm, and even hybrid algorithms combining multiple algorithms like neural network genetic algorithm, adaptive neural fuzzy reasoning algorithm, and improved genetic algorithms for response surface analysis, and so on. Through comparative analysis, it is found that the hybrid algorithms can quickly generate the optimal optimization parameters for the sake of achieving the optimal surface quality since they may combine the accuracy of deterministic algorithms and the robustness of stochastic algorithms. In addition, this paper also looks forward to the future development direction of surface quality optimization methods for laser cladding, aiming at laying a foundation for the research work of high-quality coating preparation.

关键词： laser cladding technology surface roughness deterministic algorithm stochastic algorithm hybrid algorithm

来源：评论

学校读者我要写书评

暂无评论

HOW TO MEET ASYNCHRONOUSLY AT POLYNOMIAL COST

引用

SIAM JOURNAL ON COMPUTING 2015年第3期44卷 844-867页

作者： Dieudonne, Yoann Pelc, Andrzej Villain, Vincent Univ Picardie Jules Verne MIS F-80000 Amiens France Univ Quebec Outaouais Dept Informat & Ingn Gatineau PQ J8X 3X7 Canada

Two mobile agents starting at different nodes of an unknown network have to meet. This task is known in the literature as rendezvous. Each agent has a different label which is a positive integer known to it but unknown to the other agent. Agents move in an asynchronous way: the speed of agents may vary and is controlled by an adversary. The cost of a rendezvous algorithm is the total number of edge traversals by both agents until their meeting. The only previous deterministic algorithm solving this problem has cost exponential in the size of the graph and in the larger label. In this paper we present a deterministic rendezvous algorithm with cost polynomial in the size of the graph and in the length of the smaller label. Hence, we decrease the cost exponentially in the size of the graph and doubly exponentially in the labels of agents. As an application of our rendezvous algorithm we solve several fundamental problems involving teams of unknown size larger than 1 of labeled agents moving asynchronously in unknown networks. Among them are the following problems: team size, in which every agent has to find the total number of agents;leader election, in which all agents have to output the label of a single agent;perfect renaming, in which all agents have to adopt new and different labels from the set {1, ... , k}, where k is the number of agents;and gossiping, in which each agent has initially a piece of information (value) and all agents have to output all the values. Using our rendezvous algorithm, we solve all of these problems at cost polynomial in the size of the graph and in the smallest length of all labels of participating agents.

关键词： asynchronous mobile agents network rendezvous deterministic algorithm leader election renaming gossiping

来源：评论

学校读者我要写书评

暂无评论

Nested Multiplicative Random Number Generator An efficient tool for increasing security in social networking 2

Nested Multiplicative Random Number Generator An efficient t...

引用

2nd International Conference on Computer, Communication, and Signal Processing (ICCCSP) - Special Focus on Technology and Innovation for Smart Environment

作者： Thomas, Antu Annam Paul, Varghese Mar Thoma Coll Dept Comp Applicat Thiruvalla Kerala India Cochin Univ Sci & Technol Dept Informat Technol Cochi Kerala India

ISBN: (纸本)9781538611418

Randomness plays an important role in cryptography algorithms. Increasing randomness of the seed value increases the security offered by any algorithms in cryptography. In this work a novel random number generator was experimented. True random sources were used for seed value generation. Concept of nesting introduced in the series generation section further increased the efficiency of the generated series. Refining step was also done to ensure uniformity of the generated series. Both statistical and graphical tests were done on the generated series and the system was found to be effective.

关键词： Cryptography Data Security Random Number Generators deterministic algorithm Entropy Multiplicative Congruential Generator Prime number Scatter Diagram Analysis Runs Test

来源：评论

学校读者我要写书评

暂无评论

Maximization of k-Submodular Function with a Matroid Constraint 17th

Maximization of k-Submodular Function with a Matroid Constra...

引用

17th Annual Conference on Theory and Applications of Models of Computation (TAMC)

作者： Sun, Yunjing Liu, Yuezhu Li, Min Shandong Normal Univ Sch Math & Stat Jinan 250014 Peoples R China

ISBN: (纸本)9783031203497;9783031203503

A k-submodular function is a promotion of a submodular function, whose domain is composed of k disjoint subsets rather than a single subset. In this paper, we give a deterministic algorithm for the non-monotone k-submodular function maximization problem subject to a matroid constraint with approximation factor 1/3. Based on this result, we give a randomized 1/3-approximation algorithm for the problem with faster running time, but the probability of success is (1- e). And we obtain that the complexity of deterministic algorithm and random algorithm is O(N vertical bar D vertical bar(p+ kq)) and O(vertical bar D vertical bar(p log N/epsilon(1) + kq log N/epsilon(2)) logN) respectively, where D is the ground set of the matroid constraint with rank N, p is times of oracle to calculate whether a set is an independent set in this matroid, q is the times of oracle to calculate a value of the k-submodular function, and epsilon, epsilon(1), epsilon(2) are positive parameters with e = max{epsilon(1), epsilon(2)}.

关键词： k-submodular function Matroid constraint deterministic algorithm Randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Fault-Tolerant Rendezvous in Networks

Fault-Tolerant Rendezvous in Networks

引用

41st International Colloquium on Automata, Languages and Programming (ICALP)

作者： Chalopin, Jeremie Dieudonne, Yoann Labourel, Arnaud Pelc, Andrzej CNRS LIF Marseille France Aix Marseille Univ Marseille France Univ Picardie Jules Verne MIS Amiens France Univ Quebec Outaouais Dept Informat Gatineau PQ Canada

ISBN: (纸本)9783662439517

Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent has a different label, which it can use in the execution of the algorithm, but it does not know the label of the other agent. Agents do not know any bound on the size of the network. In each round an agent decides if it remains idle or if it wants to move to one of the adjacent nodes. Agents are subject to delay faults: if an agent incurs a fault in a given round, it remains in the current node, regardless of its decision. If it planned to move and the fault happened, the agent is aware of it. We consider three scenarios of fault distribution: random (independently in each round and for each agent with constant probability 0 < p < 1), unbounded adversarial (the adversary can delay an agent for an arbitrary finite number of consecutive rounds) and bounded adversarial (the adversary can delay an agent for at most c consecutive rounds, where c is unknown to the agents). The quality measure of a rendezvous algorithm is its cost, which is the total number of edge traversals. For random faults, we show an algorithm with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks. By contrast, for unbounded adversarial faults we show that rendezvous is not feasible, even in the class of rings. Under this scenario we give a rendezvous algorithm with cost O(nl), where l is the smaller label, working in arbitrary trees, and we show that Omega(l) is the lower bound on rendezvous cost, even for the two-node tree. For bounded adversarial faults, we give a rendezvous algorithm working for arbitrary networks, with cost polynomial in n, and logarithmic in the bound c and in the larger label L.

关键词： rendezvous deterministic algorithm mobile agent delay fault

来源：评论

学校读者我要写书评

暂无评论

Testing primality deterministically

Testing primality deterministically

引用

International Meeting on Quantum Information Science

作者： Toffalori, C Univ Camerino Dept Math & Comp Sci I-62032 Camerino Italy

We introduce and discuss the recent Agrawal-Kayal-Saxena deterministic algorithm solving primality in polynomial time.

关键词： deterministic algorithm probabilistic algorithm primality

来源：评论

学校读者我要写书评

暂无评论

An Investigation on Tree-Based Tags Anti-Collision algorithms in RFID

An Investigation on Tree-Based Tags Anti-Collision Algorithm...

引用

International Conference on Computer Network, Electronic and Automation (ICCNEA)

作者： Su Xiaohao Liu Baolong Xian Technol Univ Sch Comp Sci & Engn Xian 710021 Shaanxi Peoples R China

ISBN: (纸本)9781538639818

The tree-based tags anti-collision algorithm is an important method in the anti-collision algorithms. In this paper, several typical tree algorithms are evaluated. The comparison of algorithms is summarized including time complexity, communication complexity and recognition, and the characteristics and disadvantages of each algorithm are pointed out. Finally, the improvement strategies of tree anticollision algorithm are proposed, and the future research directions are also prospected.

关键词： Radio Frequency Identification Anti-collision algorithm Electronic tags deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

Towards derandomising Markov chain Monte Carlo 64

Towards derandomising Markov chain Monte Carlo

引用

64th Annual IEEE Symposium on the Foundations of Computer Science (FOCS)

作者： Feng, Weiming Guo, Heng Wang, Chunyang Wang, Jiaheng Yin, Yitong Univ Calif Berkeley Simons Inst Berkeley CA 94720 USA Univ Edinburgh Sch Informat Edinburgh Scotland Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China

ISBN: (纸本)9798350318944

We present a new framework to derandomise certain Markov chain Monte Carlo (MCMC) algorithms. As in MCMC, we first reduce counting problems to sampling from a sequence of marginal distributions. For the latter task, we introduce a method called coupling towards the past that can, in logarithmic time, evaluate one or a constant number of variables from a stationary Markov chain state. Since there are at most logarithmic random choices, this leads to very simple derandomisation. We provide two applications of this framework, namely efficient deterministic approximate counting algorithms for hypergraph independent sets and hypergraph colourings, under local lemma type conditions matching, up to lower order factors, their state-of-the-art randomised counterparts.

关键词： approximate counting Markov chain Monte Carlo deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

Distributed algorithms for Maximum Clique in Wireless Networks 11

Distributed Algorithms for Maximum Clique in Wireless Networ...

引用

11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN)

作者： Luo, Chuanwen Yu, Jiguo Yu, Dongxiao Cheng, Xiuzhen Qufu Normal Univ Sch Informat Sci & Engn Rizhao 276826 Shandong Peoples R China Univ Hong Kong Dept Comp Sci Pokfulam Hong Kong Peoples R China George Washington Univ Dept Comp Sci Washington DC USA

ISBN: (纸本)9781509003297

In communication networks such as social networks, wireless networks and biology networks, it is of importance to find all cliques which can help understand the network topology. The clique structures can also be utilized in facilitating message forwarding in wireless networks. For instance, using a set of cliques of maximal and disjoint, one of the nodes in each clique can be elected to forward messages, by which the duplicate message transmissions can be efficiently reduced. Further, it is well known that the maximum clique problem (MCP) is closely related to the maximum independent set and the vertex cover problems. In recent years, the fundamental problem of finding maximal cliques or maximum cliques has attracted lots of attentions. However, few of these works focus on distributed solutions in wireless networks. In this paper, we pay our attention to this missing corner of research. Specifically, we first give a distributed algorithm which can compute all maximal cliques in a wireless network represented by a graph. The algorithm takes O(n) time and uses O(mn) messages, where n is the number of nodes and m the number of edges. Then, with the proposed algorithms MCP (maximum clique problem) and UMCP (unique MCP), we show that a unique maximum clique can be selected from all maximal cliques in O(n) rounds and using O(mn) messages. To the best of our knowledge, our algorithms are the first deterministic distributed solutions for MCP in wireless networks.

关键词： deterministic algorithm distributed algorithm maximum clique

来源：评论

学校读者我要写书评

暂无评论

Area and Power Efficient Network on Chip Router Architecture

Area and Power Efficient Network on Chip Router Architecture

引用

IEEE Conference on Information and Communication Technologies (ICT)

作者： Sahu, Sweta Kittur, Harish M. VIT Univ VLSI Div Sch Elect Engn Vellore Tamil Nadu India

ISBN: (纸本)9781467357586;9781467357593

In System on Chip, buses and point to point links are used as a communication infrastructure between one IP to another, but these cannot provide efficient interconnect from performance point of view. So NoC architecture was proposed to provide communication in multiprocessor SoC and overcome the limitations. This paper has implemented a 5-port 32-bit and 64-bit router architecture using wormhole routing technique for 2D-mesh network by using simple deterministic algorithm, flow control and decoding mechanism. In this router, 2 types of crossbar are used named as multiplexer and tri-state buffer matrix for efficient design. Comparisons of area and power are done for these router designs using ASIC tool flow in Cadence using TSMC 90nm and 180nm process technologies. Simulation results are performed in Cadence NC simulator. It is demonstrated that multiplexer router design is more efficient than a matrix router design as area and power increases for matrix design while using same port-width.

关键词： deterministic algorithm Network on chip (NoC) mesh network System on Chip (SoC) wormhole routing.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：