Computing
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Rational Runge-Kutta methods for solving systems of ordinary differential equations
Computing - Tập 20 - Trang 333-342 - 1978
Some nonlinear methods for solving single ordinary differiential equations are generalized to solve systems of equations. To perform this, a new vector product, compatible with the Samelson inverse of a vector, is defined. Conditions for a given order are derived.
Exponential spline interpolation
Computing - Tập 4 - Trang 225-233 - 1969
Piecewise cubic polynomial spline interpolation [3] or smoothing [4] often gives undesirable inflexion points. We describe a spline interpolation method that allows to avoid these inflexion points and contains cubic splines as special case. The method is a generalization of the work in [2]. The proof of the theorem motivating the use of exponential splines is simplified. An ALGOL procedure is pres...... hiện toàn bộ
The Efficient Computation of Certain Determinants Arising in the Treatment of Schrödinger's Equations
Computing - Tập 67 - Trang 35-56 - 2001
The solution of Schrödinger's equation leads to a high number N of independent variables. Furthermore, the restriction to (anti)symmetric functions implies some complications. We propose a sparse-grid approximation which leads to a set of non-orthogonal basis. Due to the antisymmetry, scalar products are expressed by sums of N×N-determinants. Because of the sparsity of the sparse-grid approximati...... hiện toàn bộ
Critical situation management utilizing IoT-based data resources through dynamic contextual role modeling and activation
Computing - Tập 101 - Trang 743-772 - 2018
New opportunities have been created for the management of critical situations utilizing the Internet of Things (IoT). However, one of the difficulties in providing services for critical situation management using IoT is that access will often be needed by users at the critical events, where access to data and resources is usually restricted by means of their normal roles. In Role-Based Access Cont...... hiện toàn bộ
Charakterisierung des quasilinearen Raumes I(R) und Klassifizierung der quasilinearen Räume der Dimension 1 und 2
Computing - Tập 10 - Trang 111-120 - 1972
In dieser Arbeit werden die quasilinearen RäumeQ mit dimQ≤2 charakterisiert und dadurch eine Sonderstellung, des quasilinearen Raumes I(R), des Raumes der kompakten Intervalle überR, aufgezeigt.
An energy-adaptive clustering method based on Taguchi-based-GWO optimizer for wireless sensor networks with a mobile sink
Computing - Tập 105 - Trang 1769-1793 - 2023
In wireless sensor networks (WSNs), balancing energy consumption is always a critical problem. Multi-hop data transmission may cause the nodes around the static sink to exhaust energy prematurely. It can be avoided by introducing the mobile sink (MS) in WSNs. The MS only needs to visit some specific nodes, such as cluster heads (CHs) in the clustering network, to collect data. In this paper, we pr...... hiện toàn bộ
Project scheduling by special GERT networks
Computing - Tập 23 - Trang 299-308 - 1979
This paper presents methods for the time-oriented evaluation of special GERT networks. If every node of a GERT network has an exclusive-or entrance and a stochastic exit (so-called STEOR node), then a Markov renewal process can be assigned to this activity network. In this case, the quantities of interest in project scheduling may be determined from the renewal functions of the process. In additio...... hiện toàn bộ
Extended backward differentiation formulae in the numerical solution of general Volterra integro-differential equations
Computing - Tập 51 Số 1 - Trang 61-77 - 1993
Spectral portrait for non-hermitian large sparse matrices
Computing - - 1994
The spectral portrait of a matrix is the picture of its ɛ-spectra forε ∈[ε
1,ε
2], where an ɛ-spectrum ofA is the union of all the eigenvalues of all the matricesA+Δ with ∥Δ∥2≤ε∥A∥2. The spectral portrait is, for example, useful to study the stability of various problems, or, as we illustrate in this paper, to visualize the condition number of an eigenvalue. Some methods to estimate the spectral p...... hiện toàn bộ
A cooperative particle swarm optimization with constriction factor based on simulated annealing
Computing - Tập 100 - Trang 861-880 - 2018
As many engineering optimization problems are rather complicated, it is usually necessary to search the optimal solution in a complex and huge search space. When faced with these large-scale problems, conventional optimization algorithms need to traverse the entire search space and it is impossible for them to finish the search within polynomial time. Moreover, it can’t meet requirements in terms ...... hiện toàn bộ
Tổng số: 2,425
- 1
- 2
- 3
- 4
- 5
- 6
- 10