We introduce notions of ordinary and standard products of a-finite measures and prove their existence. This approach allows us to construct invariant extensions of ordinary and standard products of Haar measures. In p...
详细信息
We introduce notions of ordinary and standard products of a-finite measures and prove their existence. This approach allows us to construct invariant extensions of ordinary and standard products of Haar measures. In particular, we construct translation-invariant extensions of ordinary and standard Lebesgue measures on R∞ and Rogers-Fremlin measures on l∞, respectively, such that topological weights of quasi-metric spaces associated with these measures are maximal （i.e., 2c）. We also solve some Fremlin problems concerned with an existence of uniform measures in Banach spaces.
In an interval graph G = (V,E) the distance between two vertices u, v is de£ned as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all ot...
详细信息
In an interval graph G = (V,E) the distance between two vertices u, v is de£ned as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other vertices of V. The diameter (δ) and radius (ρ) of the graph G is respectively the maximum and minimum among all the eccentricities of G. The center of the graph G is the set C(G) of vertices with eccentricity ρ. In this context our aim is to establish the relation ρ = ⌈δ/2⌉ for an interval graph and to determine the center of it.
In an interval graph G = (V,E) the distance between two vertices u, v is defined as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other ...
详细信息
In an interval graph G = (V,E) the distance between two vertices u, v is defined as the smallest number of edges in a path joining u and v. The eccentricity of a vertex v is the maximum among distances from all other vertices of V. The diameter (δ) and radius (ρ) of the graph G is respectively the maximum and minimum among all the eccentricities of G. The center of the graph G is the set C(G) of vertices with eccentricity ρ. In this context our aim is to establish the relation ρ = [δ/2] for an interval graph and to determine the center of it.
The k -tuple domination problem, for a fixed positive integer k , is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k = 2 is cal...
The k -tuple domination problem, for a fixed positive integer k , is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k = 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes O ( n 2 ) time, n is the total number of vertices of the interval graph.
Let G = ( V , E ) be a simple connected undirected graph. Each vertex v ∈ V has a cost c ( v ) and provides a positive coverage radius R ( v ). A distance d uv is associated with each edge { u , v } ∈ E, and d ( u ,...
Let G = ( V , E ) be a simple connected undirected graph. Each vertex v ∈ V has a cost c ( v ) and provides a positive coverage radius R ( v ). A distance d uv is associated with each edge { u , v } ∈ E, and d ( u , v ) is the shortest distance between every pair of vertices u , v ∈ V . A vertex v can cover all vertices that lie within the distance R ( v ), except the vertex itself. The conditional covering problem is to minimize the sum of the costs required to cover all the vertices in G . This problem is NP-complete for general graphs, even it remains NP-complete for chordal graphs. In this paper, an O ( n 2 ) time algorithm to solve a special case of the problem in a trapezoid graph is proposed, where n is the number of vertices of the graph. In this special
case, d uv = 1 for every edge { u , v } ∈ E , c ( v ) = c for every v ∈ V ( G ), and R ( v ) = R , an integer >1, for every v ∈ V ( G ). A new data structure on trapezoid graphs is used to solve the problem.
A manufacturing inventory model with shortages with carrying cost, shortage cost, setup cost and demand quantity as imprecise numbers, instead of real numbers, namely interval number is considered here. First, a brief...
详细信息
A manufacturing inventory model with shortages with carrying cost, shortage cost, setup cost and demand quantity as imprecise numbers, instead of real numbers, namely interval number is considered here. First, a brief survey of the existing works on comparing and ranking any two interval numbers on the real line is presented. A common algorithm for the optimum production quantity (Economic lot-size) per cycle of a single product (so as to minimize the total average cost) is developed which works well on interval number optimization under consideration. Finally, the designed algorithm is illustrated with numerical example.
Network Intrusion Detection Systems (NIDS) require the ability to generalize from previously observed attacks to detect even new or slight variation records of known attacks. As an intrusion detection system can be re...
详细信息
ISBN:
(纸本)1601320752
Network Intrusion Detection Systems (NIDS) require the ability to generalize from previously observed attacks to detect even new or slight variation records of known attacks. As an intrusion detection system can be regarded as classification problem, we use Artificial Neural networks for detection. Using a benchmark study and set from the KDD (Knowledge Data Discovery and Data Mining) competition designed by DARPA and Multi-layered perceptron neural network, this Paper will aim to solve a multi class problem using MLP in to distinguish the attack records from normal ones, and also identify the attack type. In addition, it shows how to use Tikhonov regularization parameter to optimize the optimal network architecture in order to increase the system performance. The results show that the designed system is capable of classifying records with 98.34% accuracy with two hidden layers of neuron. Finally, the performance of the benchmark study is compared with our results.
This paper describes a new solution method applied to the problem initializing DAEs using the Modelica language. Modelica is primarily an object- oriented equ-tion-based modeling language that allows specification of ...
详细信息
This paper describes a new solution method applied to the problem initializing DAEs using the Modelica language. Modelica is primarily an object- oriented equ-tion-based modeling language that allows specification of mathematical models of complex natural or man-made systems. Major features of Modelica are the multidomain modeling capability and the reusability of model components corresponding to physical objects, which allow to build and simulate highly complex systems. However, initializing such models has been quite cumbersome, since initial equations have to be pro-vided at the system level, where the user needs to know details on the underlying transformation and index-reduction algorithms, that in general are applied to simulate a Modelica model.
作者：
Y. WakasaY. YamamotoDept. of Applied Analysis and Complex Dynamical Systems
Graduate School of Informatics Kyoto University Kyoto Japan. Yuji Wakasa was born in Okayama
Japan in 1968. He received the B.S. and M.S. degrees in engineering from Kyoto university Japan in 1992 and 1994 respectively. From 1994 to 1998 he was a Research Associate in the Department of Information Technology Okayama University. Since April 1998 he has been a Research Associate in the Graduate School of Informatics Kyoto University. His current research interests include robust control and control system design via mathematical programming. Yutaka Yamamoto received his B.S. and M.S. degrees in engineering from Kyoto University
Kyoto Japan in 1972 and 1974 respectively and the M.S. and Ph.D. degree in mathematics from the University of Florida in 1976 and 1978 respectively. From 1978 to 1987 he was with Department of Applied Mathematics and Physics Kyoto University and from 1987 to 1997 with Department of Applied System Science. Since 1998 he is a professor at the current position. His current research interests include realization and robust control of distributed parameter systems learning control sampled-data systems and digital signal processing. Dr. Yamamoto is a receipient of the Sawaragi memorial paper award (1985) the Outstanding Paper Award of SICE (1987) Best Author Award of SICE (1990) the George Axelby Outstanding Paper Award of IEEE CSS in 1996 Takeda Paper Prize of SICE in 1997. He is a Fellow of IEEE. He was an associate editor of Automatica. He is currently an associate editor of IEEE Transactions on Automatic Control Systems and Control Letters and Mathematics of Control Signals and Systems. He is a member of the IEEE the Society of Instrument and Control Engineers (SICE) and the Institute of Systems Control and Information Engineers.
This paper presents a design method of control systems such that a designer can flexibly take account of tradeoffs between evaluated uncertainty ranges and the level of control performance. The problem is reduced to a...
详细信息
This paper presents a design method of control systems such that a designer can flexibly take account of tradeoffs between evaluated uncertainty ranges and the level of control performance. The problem is reduced to a BMI problem and approximately solved by LMIs. The convergence of the proposed approximation is proved in a modified sense. A numerical example shows the effectiveness of the proposed method in comparison with the standard robust control.
This paper presents an algorithm for the shortest path problem when the connected arcs in a transportation network are represented as interval numbers. The methodology proposed in this paper considers fuzzy preference...
详细信息
暂无评论