The Feasible Algorithm Based on a Class of Multiple Affine Bi-Frames with Arbitrary Real Translation Number

2012 ◽  
pp. 405-414
Author(s):  
Yongcai Hu
Keyword(s):  
Feasible Algorithm

An Algorithm for Fluid–Solid Coupling Based on SPH Method and Its Preliminary Verification

2018 ◽  
Vol 16 (02) ◽  
pp. 1846008
Author(s):  
X. J. Ma ◽  
M. Geni ◽  
A. F. Jin
Keyword(s):  
Elastic Solid ◽  
Free Surface Flow ◽  
Surface Flow ◽  
Sph Method ◽  
Particle Hydrodynamics ◽  
Sph Model ◽  
Smoothed Particle ◽  
Feasible Algorithm ◽  
Coupling Algorithm ◽  
Good Agreement

Based on the fundamental theory of smoothed-particle hydrodynamics (SPH), a feasible algorithm for fluid–solid coupling on interface is applied to describe the dynamic behavior of fluid and solid by utilizing continuum mechanics governing equations. Numerical simulation is conducted based on the proposed SPH model and the fluid–solid interface coupling algorithm, and good agreement is observed with the experiment results. It is shown in the results that the present SPH model is able to effectively and accurately simulate the free-surface flow of fluid, deformation of the elastic solid and the fluid–solid impacting.

A Feasible Algorithm for Designing Biorthogonal Binary Finitely Supported Multiwavelet Functions

2011 ◽  
Vol 225-226 ◽  
pp. 1092-1095
Author(s):  
Bao Min Yu
Keyword(s):  
Wavelet Analysis ◽  
Multiresolution Analysis ◽  
Natural Science ◽  
Matrix Theory ◽  
Scaling Functions ◽  
Science And Engineering ◽  
Engineering Computation ◽  
Feasible Algorithm ◽  
Definition Of ◽  
Vector Valued

Wavelet analysis has been a powerful tool for exploring and solving many complicated problems in natural science and engineering computation. In this paper, the notion of vector-valued multiresolution analysis is introduced and the definition of the biorthogonal vector-valued bivariate wavelet functions is given. The existence of biorthogonal vector-valued binary wavelet functions associated with a pair of biorthogonal vector-valued finitely supported binary scaling functions is investigated. An algorithm for constructing a class of biorthogonal vector-valued finitely supported binary wavelet functions is presented by virtue of multiresolution analysis and matrix theory.

scholarly journals A Feasible Algorithm for Locating Concave and Convex Zones of Interval Data and Its Use in Statistics-Based Clustering

2004 ◽  
Vol 37 (1-4) ◽  
pp. 225-232 ◽  
Author(s):  
Vladik Kreinovich ◽  
Eric J. Pauwels ◽  
Scott A. Ferson ◽  
Lev Ginzburg
Keyword(s):  
Interval Data ◽  
Feasible Algorithm

Parameters' Correlation Analysis Based on Gaussian Process for Injection Molding

2010 ◽  
Vol 154-155 ◽  
pp. 130-136
Author(s):  
Wei Xia ◽  
Sheng Hua Zhang ◽  
Xiao Ping Liao ◽  
Xue Lian Yan
Keyword(s):  
Correlation Analysis ◽  
Injection Molding ◽  
Gaussian Process ◽  
Canonical Correlation ◽  
Data Sets ◽  
Injection Process ◽  
Cross Member ◽  
Correlation Analysis Method ◽  
Feasible Algorithm ◽  
Design Idea

Based on Gaussian process (GP), a new parameters’ correlation analysis method for injection molding is proposed. Referred to the design idea of canonical correlation analysis (CCA), GP is used to extract accurate canonical correlation variables simultaneously from two data sets. And then the canonical correlation variables are used to analyze the correlation between parameters and design objectives. The cross member under windshield of a van is taken for a case. For the weld lines defects produced in injection process, the correlation of process parameters is analyzed to identify which parameters are more related to weld lines. The validity of this method is proved by the optimal result. And this provides strong theory and feasible algorithm for adaptive intelligent optimization and controlling of the parameters in injection process.

A Community Detection Algorithm Based on Node Degree Difference and Node Similarity

2013 ◽  
Vol 462-463 ◽  
pp. 458-461
Author(s):  
Jian Jun Cheng ◽  
Peng Fei Wang ◽  
Qi Bin Zhang ◽  
Zheng Quan Zhang ◽  
Ming Wei Leng ◽  
...  
Keyword(s):  
Community Structure ◽  
Community Detection ◽  
Detection Algorithm ◽  
Coarse Grained ◽  
Node Degree ◽  
Detection Algorithms ◽  
Starting Point ◽  
Node Similarity ◽  
Feasible Algorithm ◽  
Community Detection Algorithm

This paper proposes an algorithm called DDSCDA, which is based on the concepts of the node degree difference and the node similarity. In the algorithm, we iteratively extract the node from the network with larger degree and certified the node as a kernel node, then take the kernel node as the founder or initiator of a community to attract its neighbors to join in that community; by doing so, we obtain a partition corresponding to a coarse-grained community structure of the network. Finally taken the coarse-grained community as a starting point, we use the strategy of LPA to propagate labels through the network further. At the end of the algorithm, we obtain the final community structure. We compared the performance with classical community detection algorithms such as LPA, LPAm, FastQ, etc., the experimental results have manifested that our proposal is a feasible algorithm, can extract higher quality communities from the network, and outperforms the previous algorithms significantly.

Introduction

1995 ◽  
Author(s):  
Raymond Greenlaw ◽  
H. James Hoover ◽  
Walter L. Ruzzo
Keyword(s):  
Exhaustive Search ◽  
Design Algorithm ◽  
Theoretical Computer ◽  
Modern Computer ◽  
Building Process ◽  
Computer Scientists ◽  
The Subject ◽  
Feasible Algorithm ◽  
Intractable Problem ◽  
Design Construction

The subject of this book is best illustrated by the following scenario. Suppose that you are employed in the halls of industry. More than a decade ago your company entered the highly competitive "bandersnatch" market. While other companies thought that bandersnatch design was an intractable problem, and spent millions on supercomputers to search for possible designs, your company had the foresight to employ a few theoretical computer scientists. They discovered that there was a feasible algorithm for designing a bandersnatch directly from its specification. Your company can take an n-word specification of a bandersnatch and, in about n3 steps, can test if the specification is reasonable and design an optimal bandersnatch that meets it. With your algorithm, a typical 15,000 word bandersnatch specification takes about one month to design. Construction only takes a week, so design dominates the bandersnatch building process. Your competitors, on the other hand, do not have a fast algorithm for producing optimal bandersnatch designs. The best that they can do is an exhaustive search through the approximately 2n/150 possible different designs that meet the specification looking for the best one. Since this exhaustive search for the typical size of specification would take a while (say, 1016 years, assuming one design per microsecond) your competitors must be content with the suboptimal designs that they can produce in about the same time as you. At least that was until yesterday. Seeing the value of research, your competition formed a consortium and also invested in computer science. They too have discovered the feasible optimal bandersnatch design algorithm. Since design dominates the production process, your bosses decide that the way to regain your company's competitive advantage is to reduce the design time. They give you the task of dramatically speeding up the design process. Like most modern computer scientists you begin working on the problem by reading the news on the Net. One day an ad catches your eye. Sensing its corporate salvation, your company orders one of the machines. When it arrives you unpack it and discover that its architecture is very simple.

Sign in / Sign up

Export Citation Format

Share Document