This paper proposes a nonparametric mixed test for normality of linear autoregressive time series. The test is based on the best one-step forecast in mean square with time reverse. The test statistic is the mixture of...
详细信息
This paper proposes a nonparametric mixed test for normality of linear autoregressive time series. The test is based on the best one-step forecast in mean square with time reverse. The test statistic is the mixture of a goodness of fit statistic and Cramer-Von Mises statistic. Some asymptotic properties are developed for the *** results have shown that the test is easy to use and has good powers. Three examples of applying the test to real data are also included.
The aim of this article is to give explicit representations for solutions of the Robin boundary value problem for the Cauchy-Riemann operator [image omitted]. In the homogeneous cases we investigate the Robin bo...
详细信息
The aim of this article is to give explicit representations for solutions of the Robin boundary value problem for the Cauchy-Riemann operator [image omitted]. In the homogeneous cases we investigate the Robin boundary condition in a more general form. Finally, we give solutions of the corresponding higher-order operators.
作者：
S. MoazeniApplied Math
Department of Mathematics and Computer Science Tehran Polytechnic Amirkabir University of Technology슠 Tehran Iran
We discuss the problem of finding the shortest paths from a fixed origin to all nodes on a network not necessarily acyclic, with each arc length represented as positive fuzzy quantity with finite support. At first, we...
详细信息
We discuss the problem of finding the shortest paths from a fixed origin to all nodes on a network not necessarily acyclic, with each arc length represented as positive fuzzy quantity with finite support. At first, we show that the only existing paper on this problem, Klein's algorithm, in some cases lead to a dominated path in the sense of extension principle and then we introduce a new algorithm for the problem. The proposed algorithm is on the basis of the multiple labeling methods of Hansen and Dijkstra's shortest path algorithm.
CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in which physical design tool is an essent...
详细信息
CAD tools have become more and more important for integrated circuit (IC) design since a complicated system can be designed into a single chip, called system-on-a-chip (SOC), in which physical design tool is an essential and critical part. We try to consider the via minimization problem as early as possible in physical design. We propose a routing method focusing on minimizing vias while considering mutability and wire-length constraint. That is, in the global routing phase, we minimize the number of bends, which is closely related to the number of vias. Previous work only dealt with very small nets, but our algorithm is general for the nets with any size. Experimental results show that our algorithm can greatly reduce the count of bends for various sizes of nets while meeting the constraints of congestion and wire-length.
We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. ...
详细信息
We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar;2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible;and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.
This paper describes ideas in the field of cooperative underwater robotics, which can considerably enhance the exploration capabilities of underwater robots. Three heterogeneous planned or existing underwater robots a...
详细信息
This paper describes ideas in the field of cooperative underwater robotics, which can considerably enhance the exploration capabilities of underwater robots. Three heterogeneous planned or existing underwater robots are presented and possible approaches for cooperative behavior are discussed. Possible application scenarios for future deployment are presented.
Constructing new, complex models is often done by reusing parts of existing models, typically by applying a sequence of segmentation, alignment and composition operations. Segmentation, either manual or automatic, is ...
详细信息
Constructing new, complex models is often done by reusing parts of existing models, typically by applying a sequence of segmentation, alignment and composition operations. Segmentation, either manual or automatic, is rarely adequate for this task, since it is applied to each model independently, leaving it to the user to trim the models and determine where to connect them. In this paper we propose a new composition tool. Our tool obtains as input two models, aligned either manually or automatically, and a small set of constraints indicating which portions of the two models should be preserved in the final output. It then automatically negotiates the best location to connect the models, trimming and stitching them as required to produce a seamless result. We offer a method based on the graph theoretic minimal cut as a means of implementing this new tool. We describe a system intended for both expert and novice users, allowing easy and flexible control over the composition result. In addition, we show our method to be well suited for a variety of model processing applications such as model repair, hole filling, and piecewise rigid deformations.
Activating students is found to be the most influential factor for learning effectiveness in innovative pedagogical concepts like action-orientation and in models based on constructivist theories. E-Learning implement...
详细信息
ISBN:
(纸本)0889864306
Activating students is found to be the most influential factor for learning effectiveness in innovative pedagogical concepts like action-orientation and in models based on constructivist theories. E-Learning implementations of these educational concepts pose many problems. Special authoring systems supporting teachers in implementing action-oriented scenarios are required. In this article, criteria for systems which assist teachers in realizing those educational concepts are described. The focus is laid on students solving tasks and observing and critiquing this solution process, instead of merely assessing the end-product of learning processes. CleverPHL, a tool which allows to record, store and replay user behavior is presented and discussed in detail against these criteria for action-oriented distributed E-Learning systems.
We provide a characterization of the cases when the greedy algorithm may produce the unique worst possible solution for the problem of finding a minimum weight base in an independence system when the weights are taken...
详细信息
暂无评论