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.
This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas ex...
This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas exist. However, when it comes to designing a generalised predictive controller (GPC) four parameters have to be specified. To choose those parameters is not a trivial task since they are not directly related to control or regulation performance. The presented tuning method exploits model-parameters to select suitable controller parameters. Additionally, a Rhinehart filter is incorporated in the design to decrease the impact of noise, therefore, a fifth parameter has to be optimised. The proposed method has been tested in simulation and on a real system.
The scientific computing manages massive amounts of very large data sets. The development of description of the format, structure and semantic content of data is essential for the automatic manipulation of data. The a...
详细信息
ISBN:
(纸本)9781424467280;9780769540221
The scientific computing manages massive amounts of very large data sets. The development of description of the format, structure and semantic content of data is essential for the automatic manipulation of data. The aim of this paper is to define an XML-based language for describing the structure, semantic and annotation of scientific data. The XML Schema and the Document Type Definitions (DTDs) that implement the abstract format are provided. The proposed language describes the structure, semantic and annotation of the scientific data from experiments and simulations.
ModelicaML is a UML profile for the creation of executable models. ModelicaML supports the Model-Based Systems Engineering (MBSE) paradigm and combines the power of the OMG UML standardized graphical notation for syst...
详细信息
ModelicaML is a UML profile for the creation of executable models. ModelicaML supports the Model-Based Systems Engineering (MBSE) paradigm and combines the power of the OMG UML standardized graphical notation for systems and software modeling, and the simulation power of Modelica. This addresses the increasing need for precise integrated modeling of products containing both software and hardware. This paper focuses on the implementation of executable UML state machines in ModelicaML and demonstrates that using Modelica as an action language enables the integrated modeling and simulation of continuous-time and reactive or event-based system dynamics. More specifically, this paper highlights issues that are identified in the UML specification and that are experienced with typical executable implementations of UML state machines. The issues identified are resolved and rationales for design decisions taken are discussed.
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.
In a seated posture into an autovehicle, humans are most sensitive to whole-body vibrations under low-frequency excitation. This research is focused only on the effect of the backrest angle on the biodynamic response ...
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.
All freshman engineering students at York College participate in a spring semester design challenge as part of a year-long, two-course introduction to engineering. This paper describes the course organization, the pro...
详细信息
All freshman engineering students at York College participate in a spring semester design challenge as part of a year-long, two-course introduction to engineering. This paper describes the course organization, the project goals, and project itself and how it supports the broader engineering curriculum goals of engaging freshman engineering students in a design project, exposing them in an interesting way to the breath of engineering, and motivating them in their engineering studies. The students work in small teams and have roughly 12 weeks to design an automated electromechanical system that first transports three empty Snapple bottles, three tennis balls, and 36 oz. of water to a 2/x3/ operational zone. The machine must fill each bottle with 12 oz. of water, cap each bottle by covering the top with a tennis ball, and then deliver the capped and filled bottles to an area outside of the operational zone. The bottle-filling project serves as the second of two interdisciplinary engineering design experiences during the freshman year. It introduces aspects of computer, electrical, and mechanical engineering, including the following five primary knowledge areas: (i) machining and fabrication;(ii) electronic circuit prototyping and programming;(iii) sensor and actuator applications;(iv) mechanical design;(v) project planning;and (vi) presentation skills. A project demonstration at the end of the semester determines the relative effectiveness of each machine based upon a number of quantitative factors, including the total time required to complete the overall process, the volume of water in each bottle, the number of bottles successfully capped, the amount of water spilled, and approximate manufacturing cost. Some qualitative factors considered are simplicity, creativity, and aesthetics. Student interest in this substantial hands-on experience, as measured by surveys and exhibited by attendance, enthusiasm, productivity, and success, appears to be high through the three y
Event traces are helpful in understanding the performance behavior of parallel applications since they allow the indepth analysis of communication and synchronization patterns. However, the absence of synchronized clo...
详细信息
暂无评论