Jyhjeng Deng

Prof. Jyhjeng Deng

Information Management Department, Dayeh University, Dacun, Taiwan
+1
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 August 2002 in The International Journal of Advanced Manufacturing Technology
Verified
Journal Article
Closed access
PDF file
Jyhjeng DengJyhjeng Deng
Jyhjeng Deng
SDS. Deng
S. Deng

1 January 2004 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
Jyhjeng DengJyhjeng Deng
Jyhjeng Deng
HCHsinshih Chen
Hsinshih Chen
CCChunlan Chang
Chunlan Chang
ZYZhongxiah Yang
Zhongxiah Yang
Tsallis's generalized simulated annealing (GSA), which has been widely used in many fields as a global optimization tool, is composed of three parts: visiting distribution, accepting rule, and cooling schedule. The most complicated of these is visiting distribution. Although Tsallis and Stariolo did provide a heuristic algorithm to generate a random number for the visiting distribution, empirical simulations have shown that it is inappropriate. In this study a more appropriate algorithm, provided by the inspiration of Mantegna, is composed of two steps. The first is the calculation v = x/|y|1/α, where x and y are two independent normal variates with zero means and standard deviation σ x and σ y respectively. The second is a nonlinear transformation w = {[K(q) − 1]exp(−|v/C(q)|) + 1}v. Theoretical arguments are provided for the choice of α, σ x , σ y , and K(q); whereas for C(q), an empirical approximation is used instead. The range of q is in the open interval of (1.0, 3.0). It is shown that both old and new algorithms behave like a normal and Cauchy variates, respectively, when q is in the right limit of 1 or equals 2.0, values which match their corresponding visiting distributions exactly. The criteria for comparison are Kolmogorov's statistic and hypothesis testing. Based on the criteria, extensive simulations confirm that the new algorithm is superior to the old when q ∈ (1.0, 2.5]. As for q ∈ (2.5, 3.0), the values are about the same.

7 May 2023 in Applied Sciences
Verified
Journal Article
Open access
PDF file
Jyhjeng DengJyhjeng Deng
Jyhjeng Deng
The use of resources is an excellent concept for solving the contradiction problem in the Theory of Inventive Problem Solving (TRIZ; Russian acronym) methodology. However, it is always assumed that a proposed solution that uses external resources is elegant and perfect. This paper presents an example of simulation 3D modelling using FlexSim, which shows that the use of external resources can give rise to inaccurate waiting times in a queue. This paper provides an alternative process flow model in FlexSim to remove this drawback and show that, when solving the contradiction problem in TRIZ using external resources, one needs to consider the function replacement of an object and consideration should also be given to the measurement of the performance of other objects. To the best of our recalled knowledge, this paper is probably the first attempt to apply the resource concept to the simulation model. Three levels of resource are developed through the contradiction matrix of a technical contradiction in the default usage of resources in the simulation model. These resources can progressively reduce the measurement errors in waiting time and are easily ignored by simulation programmers.

16 November 2022 in Materials
Verified
Journal Article
Open access
PDF file
TLTeng-Hsuan Lin
Teng-Hsuan Lin
Jyhjeng DengJyhjeng Deng
Jyhjeng Deng
YCYi-Ching Chen
Yi-Ching Chen
A car muffler is a device to improve car noise emission. Some conventional mufflers use layers of glass fiber as a material to absorb noise. However, filling glass fiber is an environmentally unfriendly work, mainly manually filling with chop strand fiber. This research selected a composite material of glass fiber and foam concrete to replace chop strand fiber to avoid this hazard and maintain the muffler’s good noise reduction performance. A response surface methodology with a two-way factorial experimental design repeated the center point twice is performed. The density of the foamed concrete and the weight of the glass fiber is being considered in order to determine the nearly optimal combination of the values in two factors. The response variable is the loudness sensation in Sone of the noise generated from the muffler. At present, the lowest loudness sensation from the two-way factorial design is 16.6494 Sones, which occurred for a muffler with a formula combination of a density of 0.2 g/cm3 and 40 g of glass fiber. The significance of this paper is the presentation of a new application of foam concrete to the green muffler design. To the best of our knowledge, this unique area has never been tackled in the material application of concrete. We have discovered that foam concrete indeed does an excellent job in terms of noise reduction as compared with that of a market muffler.

1 May 2003 in International Journal of Computer Mathematics
Verified
Journal Article
Closed access
Jyhjeng DengJyhjeng Deng
Jyhjeng Deng
This paper extends the work of a previous paper of the author. A theoretical argument is provided to justify the heuristic algorithm used in the former paper. On the basis of the theory one derives, the previous algorithm can be further simplified. In the simplified basis function algorithm, the regular basis function (where $N_i^1(t)$ is 1 for $t_i le t lt t_{i + 1}$ and zero elsewhere) can be used for all cases except the case of the last point of a clamped B-spline where the basis function is modified to $N_{i,1} (t)$ where is 1 for $t_i le t le t_{i + 1}$ and zero elsewhere. Under this simplified algorithm, the knots ( i.e. , $t_{0}$ , $t_{1}, ldots, t_{n+k}$ ) are a k -extended partition in the interior of the knot vector with a possibility that two ends of the knot vector could be a $(k + 1)$ -extended partition (case of clamped B-spline). It is shown that given a set of $(n + 1)$ control points, $V_{0}$ , $V_{1}, ldots, V_{n}$ , the order of k , and the knots $(t_{0}, t_{1}, ldots, t_{n+k})$ , the B-spline $P(t) = sum_{i = 0}^{n} N_{i}^{k}(t)V_{i}$ is a continuous function for $t in [t_{k - 1}, t_{n + 1}]$ and maintains the partition of unity. This algorithm circumvents the problem of generating a spike at the last point of a clamped B-spline. The constraint of having k -extended partition interior knots overcomes the problem of disconnecting the B-spline at the k repeated knot.

1 November 2002 in Magnetic Resonance Imaging
Verified
Journal Article
Closed access
JFJ.C. Fu
J.C. Fu
JCJ.W. Chai
J.W. Chai
SWS.T.C. Wong
S.T.C. Wong
Jyhjeng DengJyhjeng Deng
Jyhjeng Deng
JYJ.Y. Yeh
J.Y. Yeh