作者：
CHENG, YCAssistant Professor
Department of Mathematics and Computer Science University of Maryland Baltimore County Catonsville Maryland
The Levitin-Poljak gradient-projection method is applied to solve the linear complementarity problem with a nonsymmetric matrixM, which is either a positive-semidefinite matrix or aP-matrix. Further-more, if the quadr...
详细信息
The Levitin-Poljak gradient-projection method is applied to solve the linear complementarity problem with a nonsymmetric matrixM, which is either a positive-semidefinite matrix or aP-matrix. Further-more, if the quadratic functionxT(Mx + q) is pseudoconvex on the feasible region {x ∈Rn |Mx + q ≥ 0,x≥0}, then the gradient-projection method generates a sequence converging to a solution, provided that the problem has a solution. For the case when the matrixM is aP-matrix and the solution is nondegenerate, the gradient-projection method is finite.
This work introduces a new abstraction technique for reducing the state space of large, discrete-time labelled Markov chains. The abstraction leverages the semantics of interval Markov decision processes and the exist...
详细信息
作者：
NANIEWICZ, ZUniversity of Warsaw
Faculty of Mathematics Computer Science and Mechanics Institute of Applied Mathematics and Mechanics Banacha 2 02-097 Warsaw Poland
This paper describes an exact analysis of the M(X)/G/1-PS process respone time assuming multiple process classes. In the analysis we assume an egalitarian processor-sharing discipline with each process class rn compos...
详细信息
This paper describes an exact analysis of the M(X)/G/1-PS process respone time assuming multiple process classes. In the analysis we assume an egalitarian processor-sharing discipline with each process class rn composed of m tasks. The task service time distributions are assumed to be general. Finally, the results given are significant since they represent a novel method for the analysis of parallel programs on processor-sharing systems.
We present a strategy for obtaining extensional (partial) combinatory algebras by slightly modifying the well-known construction of graph models for the untyped lambda calculus. Using the notion of weak cartesian clos...
详细信息
The problem of minimizing the total characteristic velocity of a spacecraft having linear equations of motion and finitely many instantaneous impulses that result in jump discontinuities in velocity is considered. Fix...
详细信息
The problem of minimizing the total characteristic velocity of a spacecraft having linear equations of motion and finitely many instantaneous impulses that result in jump discontinuities in velocity is considered. Fixed time and fixed end conditions are assumed. This formulation is flexible enough to allow some of the impulses to be specified a priori by the mission planner. Necessary and sufficient conditions for solution of this problem are found without using specialized results from control theory or optimization theory. Solution of the two-point boundary-value problem is reduced to a problem of solving a specific set of equations. If the times of the impulses are specified, these equations are at most quadratic. Although this work is restricted to linear equations, there are situations where it has potential application. Some examples are the computation of the velocity increments of a spacecraft near a real or fictitious satellite or space station in a circular or more general Keplerian orbit. Another example is the computation of maneuvers of a spacecraft near a libration point in the restricted three-body problem.
Trustworthiness and product traceability are essential factors in the apparel industry 4.0 for establishing successful business relationships among stakeholders such as customers,manufacturers,suppliers,and *** stakeh...
详细信息
Trustworthiness and product traceability are essential factors in the apparel industry 4.0 for establishing successful business relationships among stakeholders such as customers,manufacturers,suppliers,and *** stakeholder has implemented different technology-based systems to record and track product ***,these systems work in silos,and there is no intra-system communication,leading to a lack of complete supply chain traceability for all apparel ***,apparel stakeholders are reluctant to share their business information with business competitors;thus,they involve third-party auditors to ensure the quality of the final ***,the apparel manufacturing industry faces challenges with counterfeit products,making it difficult for consumers to determine the authenticity of the ***,in this paper,a trustworthy apparel product traceability framework called ChainApparel is developed using the Internet of Things(IoT)and blockchain to address these challenges of authenticity and traceability of apparel ***,multiple smart contracts are designed and developed for registration,process execution,audit,fault,and product traceability to authorize,validate,and trace every business transaction among the apparel ***,the real-time performance analysis of ChainApparel is carried out regarding transaction throughput and latency by deploying the compute nodes at different geographical locations using Hyperledger *** results conclude that ChainApparel accomplished significant performance under diverse workloads while ensuring complete traceability along the complex supply chain of the apparel ***,the ChainApparel framework helps make the apparel product more trustworthy and transparent in the market while safeguarding trust among the industry stakeholders.
This paper presents a track-by-track routing algorithm based on the greedy heuristic on density structure presented in [6]-[8]. By applying a dynamic programming technique using an accurate criterion on density struct...
详细信息
This paper presents a track-by-track routing algorithm based on the greedy heuristic on density structure presented in [6]-[8]. By applying a dynamic programming technique using an accurate criterion on density structure, the new algorithm guarantees finding a set of wire segments for a track whose routing can decrease the channel density by one, if it exists. It is our understanding that none of the existing track-by-track routers [6], [9], [10], [31], [32] can achieve this even by resorting to exhaustive search. With its accurate calculation in selecting wire segments in each track, the new two-layer router solves Deutsch's difficult example in 19 tracks in the two-layer restricted-Manhattan model by a simple density-related function;and the extended three-, four-, and five-layer routers also outperform other routers without backtracking, rerouting, or routing transformation. The experimental results are presented for performance comparison.
This paper describes the efficient and accurate solution of the two-dimensional anelastic equations by a Fourier-Chebyshev spectral method. A fourth-order Runge-Kutta method is used for the time integration, with the ...
详细信息
This paper describes the efficient and accurate solution of the two-dimensional anelastic equations by a Fourier-Chebyshev spectral method. A fourth-order Runge-Kutta method is used for the time integration, with the diffusion terms treated implicitly and all other terms (including the pressure gradient) treated explicitly. The model is free from aliasing and converges quickly once the solution is resolved. Numerical results are given for nonlinear flow generated by an atmospheric density current.
Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the pr...
详细信息
Given a set ofn vertices in the plane together with a set of noncrossing, straight-line edges, theconstrained Delaunay triangulation (CDT) is the triangulation of the vertices with the following properties: (1) the prespecified edges are included in the triangulation, and (2) it is as close as possible to the Delaunay triangulation. We show that the CDT can be built in optimalO(n logn) time using a divide-and-conquer technique. This matches the time required to build an arbitrary (unconstrained) Delaunay triangulation and the time required to build an arbitrary constrained (non-Delaunay) triagulation. CDTs, because of their relationship with Delaunay triangulations, have a number of properties that make them useful for the finite-element method. Applications also include motion planning in the presence of polygonal obstacles and constrained Euclidean minimum spanning trees, spanning trees subject to the restriction that some edges are prespecified.
暂无评论