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

13th International Conference on Intelligent Data Engineering and Automated Learning, IDEAL 2012

作者： Fuangkhon, Piyabute Tanprasert, Thitipong Distributed and Parallel Computing Research Laboratory Faculty of Science and Technology Assumption University Bangkok Thailand

ISBN: (纸本)9783642326387

The original contour preserving classification technique was proposed to improve the robustness and weight fault tolerance of a neural network applied with a two-class linearly separable problem. It was recently found to be improving the level of accuracy of two-class classification. This paper presents an augmentation of the original technique to improve the level of accuracy of multi-class classification by better preservation of the shape or distribution model of a multi-class problem. The test results on six real world multi-class datasets from UCI machine learning repository present that the proposed technique supports multi-class data and can improve the level of accuracy of multi-class classification more effectively. © 2012 Springer-Verlag.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Natural and Simulated Annealing

引用

computing in Science and Engineering 2001年第6期3.0卷 97-99页

作者： Zomaya, Albert Y. Parallel Computing Research Laboratory Dept. of Electrical and Electronic Eng. University of Western Australia Nedlands WA Australia

Not Available

关键词： Simulated annealing Cost function Temperature Random number generation Optimization methods Data structures Space exploration Processor scheduling Scheduling algorithm Mirrors

来源：评论

学校读者我要写书评

暂无评论

Artificial life techniques for reporting cell planning in mobile computing 16

Artificial life techniques for reporting cell planning in mo...

引用

16th International parallel and Distributed Processing Symposium, IPDPS 2002

作者： Subrata, R. Zomaya, A.Y. Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia PerthWA6907 Australia

ISBN: (纸本)0769515738

This paper discusses the use of genetic algorithm (GA), tabu search (TS), and ant colony algorithm (ACA) to solve the reporting cells planning problem. In the reporting cell location management scheme, some cells in the network are designated as reporting cells;mobile terminals update their positions (location update) upon entering one of these reporting cells. To create such a planner, a GA, TS, as well as several different AC algorithms are implemented. The effectiveness of each algorithm is shown for a number of test problems. © 2002 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Kinematics and Dynamics Analysis of a Quadruped Walking Robot with parallel Leg Mechanism

引用

Chinese Journal of Mechanical Engineering 2013年第5期26卷 881-891页

作者： WANG Hongbo SANG Lingfeng HU Xing ZHANG Dianfan YU Hongnian Parallel Robot and Mechatronic System Laboratory of Hebei Province Yanshan University Key Laboratory of Advanced Forging & Stamping Technology and Science of Ministry of Education Yanshan University Xi’an University of Architecture and Technology Science and Technology Research Institute Yanshan University School of Design Engineering and ComputingBournemouth University

It is desired to require a walking robot for the elderly and the disabled to have large capacity,high stiffness,stability,***,the existing walking robots cannot achieve these requirements because of the weight-payload ratio and simple ***,Improvement of enhancing capacity and functions of the walking robot is an important research *** to walking requirements and combining modularization and reconfigurable ideas,a quadruped/biped reconfigurable walking robot with parallel leg mechanism is *** proposed robot can be used for both a biped and a quadruped walking *** kinematics and performance analysis of a 3-UPU parallel mechanism which is the basic leg mechanism of a quadruped walking robot are conducted and the structural parameters are *** results show that performance of the walking robot is optimal when the circumradius R,r of the upper and lower platform of leg mechanism are 161.7 mm,57.7 mm,*** on the optimal results,the kinematics and dynamics of the quadruped walking robot in the static walking mode are derived with the application of parallel mechanism and influence coefficient theory,and the optimal coordination distribution of the dynamic load for the quadruped walking robot with over-determinate inputs is analyzed,which solves dynamic load coupling caused by the branches’ constraint of the robot in the walk *** laying a theoretical foundation for development of the prototype,the kinematics and dynamics studies on the quadruped walking robot also boost the theoretical research of the quadruped walking and the practical applications of parallel mechanism.

关键词： walking robot parallel leg mechanism kinematics dynamics over-determinate inputs

来源：评论

学校读者我要写书评

暂无评论

PDRL-CM: An efficient cooperative caching management method for vehicular networks based on deep reinforcement learning

引用

Ad Hoc Networks 2025年 176卷

作者： Ou, Pingjie Chen, Ningjiang Yang, Long School of Computer and Electronic Information Guangxi University Nanning Guangxi530004 China Key Laboratory of Parallel Distributed and Intelligent Computing Education Department of Guangxi Zhuang Autonomous Region Nanning Guangxi530004 China The Guangxi Intelligent Digital Services Research Center of Engineering Technology Nanning Guangxi530004 China

In vehicular networks, onboard devices face the challenge of limited storage, and computational resources constrain their processing and storage capabilities. This limitation is particularly significant for applications that require complex computations and real-time responses. Additionally, limited storage capacity reduces the range of cacheable data, which can impact the immediate availability of data and the continuity of services. Therefore, improving cache utilization and meeting vehicles’ real-time data demands pose significant challenges. Deep reinforcement learning can optimize the issues arising from agents’ continuously changing state and action spaces due to increasing request demands. However, training the network may encounter instability and convergence difficulties in dynamic and complex environments or situations with sparse rewards. In response to these issues, this paper proposes a Priority-based Deep Reinforcement Learning Collaborative Cache Management method (PDRL-CM). PDRL-CM first designs a lightweight cache admission strategy that leverages data's inherent and combined attributes. It then makes cache admission decisions Using Monte Carlo sampling and a max-value search strategy combined with a feedforward neural network. Secondly, the method considers minimizing system latency and reducing vehicle energy consumption as joint optimization problems. An improved deep reinforcement learning algorithm solves this problem and makes cache-sharding decisions. A prioritized experience replay mechanism is incorporated to adjust the network prediction model quickly and accelerate the convergence process. Experimental results indicate that, compared to existing DRL-based caching methods, PDRL-CM offers faster data processing efficiency and higher cache hit rates under varying vehicle density, storage capacity, and content volume conditions. © 2025

关键词： Cache memory

来源：评论

学校读者我要写书评

暂无评论

Agent middleware for heterogeneous scientific simulations

Agent middleware for heterogeneous scientific simulations

引用

1998 ACM/IEEE Conference on Supercomputing, SC 1998

作者： Ho, Shirun Itoh, Satoshi Ihara, Sigeo Schlichting, Richard D. Parallel Application Hitachi Laboratory Real World Computing Partnership Japan Central Research Laboratory Hitachi Ltd Japan Department of Computer Science University of Arizona United States

ISBN: (纸本)081868707X

The current technology of parallel and distributed systems allows users to exploit a variety of resources across networks. However, the support provided is often insufficient for computational scientists to simulate complicated real-world scenarios in which different kinds of scientific applications need to be combined to perform high fidelity simulations. As a result, users waste a large amount of time and effort developing custom techniques for performing semantic-level communication between heterogeneous scientific simulations. This paper describes a new middleware system that provides high-level transparency in the form of agents that automatically transfer and transform data between simulations that use different mathematical and physical modeling approaches. Based on a specification that correlates different discrete points in finite difference method (FDM), finite element method (FEM) or particle simulations, the agents provide a variety of techniques for semantically transforming the values associated with correlated points and automatically determine to which processes the values must be transferred. To facilitate use and minimize impact on user programs, the agent system includes three types of library calls that manage task identification, register different kinds of discrete points and construct a correlation table according to the specification, and transfer messages that incorporate extraction and transformation of the values on the correlated points. Another library specially optimized for parallel simulations that use a SPMD (Single Program Multiple Data stream) structure is also offered to control communication through the agents. A prototype system has been developed on the Hitachi SR2201 parallel machine as well as workstation clusters, and applied to several example applications. These include an advanced device simulation that combines quantum transport simulation with electric potential simulation, and a simulation of thermal flow resulting fro

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Invariant patterns in crystal lattices: Implications for protein folding algorithms 7th

Invariant patterns in crystal lattices: Implications for pro...

引用

7th Annual Symposium on Combinatorial Pattern Matching, CPM 1996

作者： Hart, William E. Istrail, Sorin Sandia National Laboratories Massively Parallel Computing Research Laboratory P. O. Box 5800 AlbuquerqueNM87185-1110 United States

ISBN: (纸本)3540612580

Crystal lattices are infinite periodic graphs that occur naturally in a variety of geometries and which are of fundamental importance in polymer science. Discrete models of protein folding use crystal lattices to define the space of protein conformations. Because various crystal lattices provide discretizations of the same physical phenomenon, it is reasonable to expect that there will exist "invariants" across lattices that define fundamental properties of the protein folding process;an invariant defines a property that transcends particular lattice formulations. This paper identifies two classes of invariants, defined in terms of sublattices that are related to the design of algorithms for the structure prediction problem. The first class of invariants is used to define a master approximation algorithm for which provable performance guarantees exist. This algorithm can be applied to generalizations of the hydrophobic-hydrophilic model that have lattices other than the cubic lattice, including most of the crystal lattices commonly used in protein folding lattice models. The second class of invariants applies to a related lattice model. Using these invariants, we show that for this model the structure prediction problem is intractable across a variety of threedimensional lattices. It turns out that these two classes of invariants are respectively sublattices of the two-and three-dimensional square lattice. As the square lattices are the standard lattices used in empirical protein folding studies, our results provide a rigorous confirmation of the ability of these lattices to provide insight into biological phenomenon. Our results are the first in the literature that identify algorithmic paradigms for the protein structure prediction problem that transcend particular lattice formulations. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Crystal lattices

来源：评论

学校读者我要写书评

暂无评论

KC-GenRe: A Knowledge-constrained Generative Re-ranking Method Based on Large Language Models for Knowledge Graph Completion 30

KC-GenRe: A Knowledge-constrained Generative Re-ranking Meth...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wang, Yilin Hu, Minghao Huang, Zhen Li, Dongsheng Yang, Dong Lu, Xicheng Defense Innovation Institute Academy of Military Sciences China Information Research Center of Military Science China National Key Laboratory of Parallel and Distributed Computing China

ISBN: (纸本)9782493814104

The goal of knowledge graph completion (KGC) is to predict missing facts among entities. Previous methods for KGC re-ranking are mostly built on non-generative language models to obtain the probability of each candidate. Recently, generative large language models (LLMs) have shown outstanding performance on several tasks such as information extraction and dialog systems. Leveraging them for KGC re-ranking is beneficial for leveraging the extensive pre-trained knowledge and powerful generative capabilities. However, it may encounter new problems when accomplishing the task, namely mismatch, misordering and omission. To this end, we introduce KC-GenRe, a knowledge-constrained generative re-ranking method based on LLMs for KGC. To overcome the mismatch issue, we formulate the KGC re-ranking task as a candidate identifier sorting generation problem implemented by generative LLMs. To tackle the misordering issue, we develop a knowledge-guided interactive training method that enhances the identification and ranking of candidates. To address the omission issue, we design a knowledge-augmented constrained inference method that enables contextual prompting and controlled generation, so as to obtain valid rankings. Experimental results show that KG-GenRe achieves state-of-the-art performance on four datasets, with gains of up to 6.7% and 7.7% in the MRR and Hits@1 metric compared to previous methods, and 9.0% and 11.1% compared to that without re-ranking. Extensive analysis demonstrates the effectiveness of components in KG-GenRe. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Scalable distributed directory implementation on Orange File System

Scalable distributed directory implementation on Orange File...

引用

2011 IEEE 7th International Workshop on Storage Network Architecture and parallel I/Os, SNAPI 2011

作者： Yang, Shuangyang Ligon III, Walter B. Quarles, Elaine C. Parallel Architecture Research Laboratory Clemson University Clemson SC 29634 United States Clemson Computing and Information Technology Clemson University Clemson SC 29634 United States

ISBN: (纸本)9781457704284

In Orange File System, large data files are striped across multiple servers to provide highly concurrent access, however, contents of large directories are only stored in a single server, which is becoming a bottleneck in handling a large number of requests accessing the same directory concurrently. In this paper, a scalable distributed directory for Orange File System is implemented and evaluated in a largescale system. The throughput performance is measured by a modified version of UCAR metarates benchmark. The result shows great scalability in concurrently creating and removing large numbers of files under one directory by multiple clients. On a 64-servers setup and 128 clients accessing the same directory concurrently, the scalable distributed directory can achieve more than 8,000 file creations per second and over 11,000 file removals per second on average.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT SPECTRAL METHODS FOR EIGENVALUE PROBLEMS OF THE INTEGRAL FRACTIONAL LAPLACIAN ONABALLOFANYDIMENSION

引用

Journal of Computational Mathematics 2024年第4期42卷 1032-1062页

作者： Suna Ma Huiyuan Li Zhimin Zhang Hu Chen Lizhen Chen College of Science Nanjing University of Posts and TelecommunicationsNanjingChina State Key Laboratory of Computer Science/Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijingChina Department of Mathematics Wayne State UniversityDetroitUSA School of Mathematical Sciences Ocean University of ChinaQingdaoChina Beijing Computational Science Research Center BeijingChina

An efficient spectral-Galerkin method for eigenvalue problems of the integral fractional Laplacian on a unit ball of any dimension is proposed in this *** symmetric positive definite linear system is retained explicitly which plays an important role in the numerical *** a sharp estimate on the algebraic system's condition number is established which behaves as N4s with respect to the polynomial degree N,where 2s is the fractional derivative *** regularity estimate of solutions to source problems of the fractional Laplacian in arbitrary dimensions is firstly investigated in weighted Sobolev *** the regularity of eigenfunctions of the fractional Laplacian eigenvalue problem is readily ***,rigorous error estimates of the eigenvalues and eigenvectors are *** experiments are presented to demonstrate the accuracy and efficiency and to validate the theoretical results.

关键词： Integral fractional Laplacian Spectral method Eigenvalue problem Regularity analysis Error estimate

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：