We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. I...

in this paper a new guidance technique for ballistic missiles and launch vehicles is proposed. generally the lambert guidance is used to generate missile nominal (correlated) parameters through powered flight to put it in a ballistic flight path. because of uncertainties and undesired factors, the nominal position and velocity obtained by lambert technique need to be followed in actual flight. ...

Heuristics based on large neighborhood search have recently shown outstanding results in solving various transportation and scheduling problems. Large neighborhood search methods explore a complex neighborhood by use of heuristics. Using large neighborhoods makes it possible to find better candidate solutions in each iteration and hence traverse a more promising search path. Starting from the l...

The algebraic as well geometric topological constructions of manifold embeddings and homotopy offer interesting insights about spaces symmetry. This paper proposes the construction 2-quasinormed variants locally dense p-normed 2-spheres within a non-uniformly scalable quasinormed (C, R) space. fibered space is are equivalent to category 3-dimensional manifolds or three-manifolds with simply con...

In a two-photon femtosecond laser system of three-dimensional micro-fabrication, a model of micro-device is fabricated layer by layer along its contours of cross-sections. So it is necessary to generate cutting path. In this paper, we present an efficient algorithm to generate cutting path which is a series of ordered contour points on each cross-section of a model. Keyword. Micro-fabrication, ...

This derivation of (2) is not valid, because this duality applies to inferences and theorems only, not to definitions. In fact, (1) should be treated as an axiom. Accordingly, the duality of Lemma 3.3.1 would not be valid until the dual (2) of (1) is proved independently, as we do below. Our new proof will make use of Proposition 3.3.3, the original proof of which is based on duality. So, we mu...

Answering a recent question posed by Gregori, Morillas and Sapena (“On a class of completable fuzzy metric spaces”, Fuzzy Sets and Systems, 161 (2010), 2193–2205) we present two examples of non strong fuzzy metrics (in the sense of George and Veeramani).

The existence of many large transactions distributed databases with high data schemas, the centralized approach for mining association rules in such databases will not be feasible. Some distributed algorithms have been developed [FDM, CD], but none of them have considered the problem of data skews in distributed mining of association rules. The skewness of datasets reduces the workload balancin...

Authentication using a path of trusted intermediaries, each able to authenticate the next in the path, is a well-known technique for authenticating channels in a large distributed system. In this paper, we explore the use of multiple paths to redundantly authenticate a channel and focus on two notions of path independence—disjoint paths and connective paths—that seem to increase assurance in th...

Gene set enrichment analysis (GSA) methods have been widely adopted by biological labs to analyze data and generate hypotheses for validation. Most of the existing comparison studies focus on whether the existing GSA methods can produce accurate P-values; however, practitioners are often more concerned with the correct gene-set ranking generated by the methods. The ranking performance is closel...