Due to the increasing number of conferences, researchers need to spend more and more time browsing through the respective calls for papers (CFPs) to identify those conferences which might be of interest to them. In th...
详细信息
We present a new scheduling algorithm Odd-Even4, which not only guarantees the hard deadlines of all periodic tasks with fewer context switches but also minimizes the average response time of bounded predictable tasks...
详细信息
We extend the concept of the polygon visible from a source point S in a simple polygon by considering visibility with two types of reflection, specular and diffuse. In specular reflection a light ray reflects from an ...
详细信息
Fuzzy Extension Matrix induction is an extraction technique of fuzzy rules, which can be used in handling ambiguous classification problems related to human's thought and sense. The entire process of building heur...
详细信息
ISBN:
(纸本)0780384032
Fuzzy Extension Matrix induction is an extraction technique of fuzzy rules, which can be used in handling ambiguous classification problems related to human's thought and sense. The entire process of building heuristic algorithm based on Fuzzy Extension Matrix is dependent of three specified parameters that seriously affect the computational effort and the rule extraction accuracy. Since the value of three parameters is usually given in terms of human experience or real requirements, it is very difficult to determine its optimal value. This paper makes an initial attempt to give some guidelines of how to automatically choose these parameters by analyzing the relationship between the values of parameters and the number of rules generated.
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean shortest paths among sets of "stack...
详细信息
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean shortest paths among sets of "stacked" axis-aligned rectangles is NP-complete, and that computing L 1-shortest paths among disjoint balls is NP-complete. On the positive side, we present an efficient algorithm for computing an L 1shortest path between two given points that lies on or above a given polyhedral terrain. We also give polynomial-time algorithms for some versions of stacked polygonal obstacles that are "terrain-like" and analyze the complexity of shortest path maps in the presence of parallel halfplane "walls".
Decision trees and extension matrixes are two methodologies for (fuzzy) rule generation. This paper gives an initial study on the comparison between the two methodologies. Their computational complexity and the qualit...
详细信息
ISBN:
(纸本)0780384032
Decision trees and extension matrixes are two methodologies for (fuzzy) rule generation. This paper gives an initial study on the comparison between the two methodologies. Their computational complexity and the quality of rule generation are analyzed. The experimental results show that the number of generated rules of the heuristic algorithm based on extension matrix is fewer than the decision tree algorithm. Moreover, regarding the testing accuracy (i.e., the generalization capability for unknown cases), experiments also show that the extension matrix method is better than the other.
The discovery of chaos in the sixties of last century was a breakthrough in concept,revealing the truth that some disorder behavior,called chaos,could happen even in a deterministic nonlinear system under barely deter...
详细信息
The discovery of chaos in the sixties of last century was a breakthrough in concept,revealing the truth that some disorder behavior,called chaos,could happen even in a deterministic nonlinear system under barely deterministic *** a series of serious studies,people begin to acknowledge that chaos is a specific type of steady state motion other than the conventional periodic and quasi-periodic ones,featuring a sensitive dependence on initial conditions,resulting from the intrinsic randomness of a nonlinear system *** fact,chaos is a collective phenomenon consisting of massive individual chaotic responses,corresponding to different initial conditions in phase *** two adjacent individual chaotic responses repel each other,thus causing not only the sensitive dependence on initial conditions but also the existence of at least one positive top Lyapunov exponent(TLE) for ***,all the sample responses share one common invariant set on the Poincaré map,called chaotic attractor,which every sample response visits from time to time *** far,the existence of at least one positive TLE is a commonly acknowledged remarkable feature of *** know that there are various forms of uncertainties in the real *** theoretical studies,people often use stochastic models to describe these uncertainties,such as random variables or random *** with random variables as their parameters or with random processes as their excitations are often called stochastic *** doubt,chaotic phenomena also exist in stochastic systems,which we call stochastic chaos to distinguish it from deterministic chaos in the deterministic *** chaos reflects not only the intrinsic randomness of the nonlinear system but also the external random effects of the random parameter or the random ***,stochastic chaos is also a collective massive phenomenon,corresponding not only to different initial conditions but also to different
In this paper we propose the Sisyphus database retrieval software performance antipattern. The antipattern occurs in application designs that process large, frequently accessed lists stored in a relational database, b...
详细信息
ISBN:
(纸本)1581135637
In this paper we propose the Sisyphus database retrieval software performance antipattern. The antipattern occurs in application designs that process large, frequently accessed lists stored in a relational database, but display only a small subset to the user. Software Performance Engineering (SPE) techniques are used to analyze the antipattern. Four solutions are evaluated: rownum and index, upper/lower bound, sequence numbering, and caching. We discuss the real world challenges of correcting this antipattern early in the application life cycle.
Fuzzy variable is a function from a possibility space to the real line. In this paper, two classes of fuzzy programming problems with fuzzy variable coefficients are presented. The first one is called primal fuzzy pro...
详细信息
Fuzzy variable is a function from a possibility space to the real line. In this paper, two classes of fuzzy programming problems with fuzzy variable coefficients are presented. The first one is called primal fuzzy programming problem whose objective is a chance function defined by possibility measure, while the second one is called inverse fuzzy programming problem whose objective is a critical value function. Generally, the difficulties of solving the two fuzzy programming problems are different. Thus, to solve the problems effectively, we prove two main results which show solving one of the problems is equivalent to solving its counterpart.
For a process language with action refinement and synchronization both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system specification involvin...
详细信息
For a process language with action refinement and synchronization both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system specification involving syntactical refinement sequences. The denotational semantics is an interleaving model which uses semantical refinement 'environments'. It identifies those statements which are equal under all refinements. The denotational model is shown to be fully abstract with respect to the operational one. The underlying metric machinery is exploited to obtain this full abstractness result. Usually, action refinement is treated either in a model with some form of true concurrency, or, when an interleaving model is applied, by assuming that the refining statements are atomized. We argue that an interleaving model without such atomization is attractive as well.
暂无评论