Log in

Relevant bibliographies by topics / Optimal Sequence / Journal articles

To see the other types of publications on this topic, follow the link: Optimal Sequence.

Journal articles on the topic 'Optimal Sequence'

Author: Grafiati

Published: 6 September 2023

Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Optimal Sequence.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Shea, Koon-lam, Tai-man Tang, and Ping-shu Tso. "Optimal investment sequence." Economic Theory 15, no. 1 (2000): 215–19. http://dx.doi.org/10.1007/s001990050008.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Lakshmi, Naga Jayaprada.Gavarraju, and Karteeka Pavan K. "Pairwise Sequence Alignment by Differential Evolutionary Algorithm with New Mutation Strategy." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 2 (2019): 445–53. https://doi.org/10.35940/ijeat.B3136.129219.

Full text

Abstract:

Sequence alignment is a significant facet in the bio-informatics research field for the molecular sequence analysis. Arrangement of two biological sequences by maximizing the similarities between the sequences by incorporating and adjusting gaps is Pairwise Sequence Alignment (PSA). Arrangement of multiple sequences is Multiple Sequence Alignment (MSA). Though Dynamic programming can produce optimal sequence alignment for PSA it suffers from a problem when multiple optimal paths are present and trace back is required. Back tracking becomes complex and it is also not suitable for MSA. So many m

APA, Harvard, Vancouver, ISO, and other styles

3

Ural, H., and K. Zhu. "Optimal length test sequence generation using distinguishing sequences." IEEE/ACM Transactions on Networking 1, no. 3 (1993): 358–71. http://dx.doi.org/10.1109/90.234857.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Bahubalendruni, MVA Raju, and Bibhuti Bhusan Biswal. "An intelligent approach towards optimal assembly sequence generation." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 232, no. 4 (2016): 531–41. http://dx.doi.org/10.1177/0954406216684159.

Full text

Abstract:

In this paper, a novel and efficient method is developed and proposed to obtain all valid assembly sequences and optimized assembly sequence for a given assembled product. The working principle of methodology is clearly illustrated with different example products. Four basic predicates namely “liaison predicate, geometrical feasibility, mechanical feasibility, and stability” are considered to validate each sequence. The proposed method is effective and proven efficient in the resulting all set of feasible assembly sequences described. Tool/gripper changes, assembly orientation changes, and par

APA, Harvard, Vancouver, ISO, and other styles

5

Wang, Lian, and Min Liu. "An Optimal Frequency Hopping Sequence Set Based on the Polynomial Theory." Applied Mechanics and Materials 490-491 (January 2014): 872–78. http://dx.doi.org/10.4028/www.scientific.net/amm.490-491.872.

Full text

Abstract:

A new class of cubic frequency hopping (FH) sequence set is proposed in this paper. The new cubic FH sequence set is proved to be optimal with respect to the average Hamming correlation bound. Furthermore an optimal FH sequence set based on polynomial theory that is optimal with respect to the Singleton bound on FH sequences is also constructed. In addition, the average Hamming correlation of the optimal polynomial frequency hopping sequence set is discussed in this paper. The analysis result shows that the new polynomial FH sequence set is also optimal with respect to the average Hamming corr

APA, Harvard, Vancouver, ISO, and other styles

6

Torii, Hideyuki, Takahiro Matsumoto, and Makoto Nakamura. "Optimal Polyphase Asymmetric ZCZ Sequence Sets Including Uncorrelated Sequences." Journal of Signal Processing 16, no. 6 (2012): 487–94. http://dx.doi.org/10.2299/jsp.16.487.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Saitou, Kazuhiro, and Mark J. Jakiela. "Subassembly Generation via Mechanical Conformational Switches." Artificial Life 2, no. 4 (1995): 377–416. http://dx.doi.org/10.1162/artl.1995.2.4.377.

Full text

Abstract:

A question is posed on how a particular subassembly sequence is generated in randomized assembly. An extended design of mechanical conformational switches [16] is proposed that can encode several subassembly sequences. A particular subassembly sequence is generated due to conformational changes of parts during one-dimensional randomized assembly. The optimal subassembly sequence that maximizes the yield of a desired assembly can be found via genetic search over a space of parameterized conformational switch designs, rather than a space of subassembly sequences. The resulting switch design enco

APA, Harvard, Vancouver, ISO, and other styles

8

Bahubalendruni, M. V. A. Raju, B. B. V. L. Deepak, and Bibhuti Bhusan Biswal. "An advanced immune based strategy to obtain an optimal feasible assembly sequence." Assembly Automation 36, no. 2 (2016): 127–37. http://dx.doi.org/10.1108/aa-10-2015-086.

Full text

Abstract:

Purpose The purpose of this study is to develop an intelligent methodology to find out an optimal feasible assembly sequence while considering the assembly predicates. Design/methodology/approach This proposed study is carried out by using two artificial immune system-based models, namely, Bone Marrow Model and Negative Selection Algorithms, to achieve the following objectives: to obtain the possible number of assembly sequences; to obtain the feasible assembly sequences while considering different assembly predicates; and to obtain an optimal feasible assembly sequence. Findings Proposed bone

APA, Harvard, Vancouver, ISO, and other styles

9

Navarro, Gonzalo, and Yakov Nekrich. "Optimal Dynamic Sequence Representations." SIAM Journal on Computing 43, no. 5 (2014): 1781–806. http://dx.doi.org/10.1137/130908245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Vingron, Martin. "Near-optimal sequence alignment." Current Opinion in Structural Biology 6, no. 3 (1996): 346–52. http://dx.doi.org/10.1016/s0959-440x(96)80054-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Bayousef, Manal, and Michael Mascagni. "A computational investigation of the optimal Halton sequence in QMC applications." Monte Carlo Methods and Applications 25, no. 3 (2019): 187–207. http://dx.doi.org/10.1515/mcma-2019-2041.

Full text

Abstract:

Abstract We propose the use of randomized (scrambled) quasirandom sequences for the purpose of providing practical error estimates for quasi-Monte Carlo (QMC) applications. One popular quasirandom sequence among practitioners is the Halton sequence. However, Halton subsequences have correlation problems in their highest dimensions, and so using this sequence for high-dimensional integrals dramatically affects the accuracy of QMC. Consequently, QMC studies have previously proposed several scrambling methods; however, to varying degrees, scrambled versions of Halton sequences still suffer from t

APA, Harvard, Vancouver, ISO, and other styles

12

Cerny, Anton. "Optimal Description of Automatic Paperfolding Sequences." JUCS - Journal of Universal Computer Science 3, no. (10) (1997): 1085–99. https://doi.org/10.3217/jucs-003-10-1085.

Full text

Abstract:

The class of 2-automatic paperfolding sequences corresponds to the class of ultimately periodic sequences of unfolding instructions. We first show that a paper-folding sequence is automatic iff it is 2-automatic. Then we provide families of minimal finite-state automata, minimal uniform tag sequences and minimal substitutions describing automatic paperfolding sequences, as well as a family of algebraic equations satisfied by automatic paperfolding sequences understood as formal power series.

APA, Harvard, Vancouver, ISO, and other styles

13

Pujari, Jeevana Jyothi, and Karteeka Pavan Kanadam. "Semi Global Pairwise Sequence Alignment Using New Chromosome Structure Genetic Algorithm." Ingénierie des systèmes d information 27, no. 1 (2022): 67–74. http://dx.doi.org/10.18280/isi.270108.

Full text

Abstract:

Biological sequence alignment is a prominent and eminent task in the analysis of biological data. This paper proposes a pair wise semi global sequence alignment technique using New Chromosome Structure based Genetic algorithm (NCSGA) for aligning sequences by automatically detecting optimal number of gaps and their positions to explore the optimal score for DNA or protein sequences. The experimental results are conducted using simulated real datasets from NCBI. The proposed method can be tested on real data sets of nucleotide sequence pairs. The computational results show that NCSGA produces t

APA, Harvard, Vancouver, ISO, and other styles

14

Aguilera, Francisco, Daniel Cárdenas-Morales та Pedro Garrancho. "Optimal Simultaneous Approximation via𝒜-Summability". Abstract and Applied Analysis 2013 (2013): 1–5. http://dx.doi.org/10.1155/2013/824058.

Full text

Abstract:

We present optimal convergence results for themth derivative of a function by sequences of linear operators. The usual convergence is replaced by𝒜-summability, with𝒜being a sequence of infinite matrices with nonnegative real entries, and the operators are assumed to bem-convex. Saturation results for nonconvergent but almost convergent sequences of operators are stated as corollaries.

APA, Harvard, Vancouver, ISO, and other styles

15

Yao, Shaoming. "Error modelling–based machining sequence optimization of a pocketed beam milling: part A, end supported beam." International Journal of Advanced Manufacturing Technology 113, no. 7-8 (2021): 1849–59. http://dx.doi.org/10.1007/s00170-020-06256-z.

Full text

Abstract:

AbstractThis paper, on the basis of error modelling, proved the optimal pocket machining sequences of a simply end supported pocketed beam using mathematic induction method. The optimal pocket machining sequence with the minimum pocket floor height error is the machining from both ends to the middle and the optimal sequence is not unique because of the symmetric supports about the central plane; meanwhile, the optimal pocket machining sequence with the minimum wall position error is the machining from the fixed end to the free end and the optimal machining sequence is unique. A beam of Al7075

APA, Harvard, Vancouver, ISO, and other styles

16

Laith, Watheq, and Rasheed Al-Salih. "Devising an efficient approach to determine the optimal sequence of from-to matrix." Eastern-European Journal of Enterprise Technologies 4, no. 3(112) (2021): 6–12. http://dx.doi.org/10.15587/1729-4061.2021.237944.

Full text

Abstract:

Sequencing is the most impact factor in many production areas, such as assembly lines, batch production, Travelling Salesman Problem (TSP), product sequences, process sequences, etc. The flow and analysis from one item to another can be presented by the square matrix in which the number of rows or columns is equal to the number of manipulated items, this special matrix form is called “From-To matrix”. The matrix suffers from many drawbacks when it is applied to determine the optimal sequences, such as the number of variables must be as small as possible, there is no flexibility to determine th

APA, Harvard, Vancouver, ISO, and other styles

17

Watheq, Laith, and Al-Salih Rasheed. "Devising an efficient approach to determine the optimal sequence of from-to matrix." Eastern-European Journal of Enterprise Technologies 4, no. 3 (112) (2021): 6–12. https://doi.org/10.15587/1729-4061.2021.237944.

Full text

Abstract:

Sequencing is the most impact factor in many production areas, such as assembly lines, batch production, Travelling Salesman Problem (TSP), product sequences, process sequences, etc. The flow and analysis from one item to another can be presented by the square matrix in which the number of rows or columns is equal to the number of manipulated items, this special matrix form is called “From-To matrix”. The matrix suffers from many drawbacks when it is applied to determine the optimal sequences, such as the number of variables must be as small as possible, there is no flexibility to

APA, Harvard, Vancouver, ISO, and other styles

18

Hordijk, Wim, Arie Hordijk, and Bernd Heidergott. "A Genetic Algorithm for Finding Good Balanced Sequences in a Customer Assignment Problem with no State Information." Asia-Pacific Journal of Operational Research 32, no. 03 (2015): 1550015. http://dx.doi.org/10.1142/s0217595915500153.

Full text

Abstract:

In this paper, we study the control problem of optimal assignment of tasks to servers in a multi-server queue with inhomogeneous servers. In order to improve the performance of the system, we use a periodic deterministic sequence of job assignments to servers called a billiard sequence. We then use a genetic algorithm (GA) for computing a near-optimal billiard sequence. By means of a recent result obtained in the area of ordinal optimization, we show that the solution found by the GA belongs to the top 1% of possible choices for such a billiard sequence. As illustrated by numerical examples, n

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Zhan Bin, Hong Yun Xu, De Hai Li, and Jing Jie Wang. "The Biological Characteristics and its Sequence Analysis of Pholiota adiposa." Advanced Materials Research 518-523 (May 2012): 5371–75. http://dx.doi.org/10.4028/www.scientific.net/amr.518-523.5371.

Full text

Abstract:

In this paper, the biological characteristics of Pholiota adiposa were systematically studied. The results showed that the ideal temperature range for growth is from 20 °C to 25°C, with optimal temperature at 25°C; the optimal light condition is full darkness; the ideal pH range for growth is from 5 to 9, with optimal pH at 6; the preferred carbon source is sucrose, followed by glucose; the preferred nitrogen source is potassium nitrate, glutamic acid. The internal transcribed spacer region (ITS) was sequenced to determine whether the DNA sequence data supported the experimental result. The ph

APA, Harvard, Vancouver, ISO, and other styles

20

Wang, Changyuan, Yi Zhang, Wanan Yang, and Chunhua Ren. "Optimal Constructions of Low-Hit Zone Frequency-Hopping Sequence Set Based on m-Sequence." Mathematics 13, no. 14 (2025): 2228. https://doi.org/10.3390/math13142228.

Full text

Abstract:

Quasi-Synchronous Frequency hopping (FH) Multiple Access (QS-FHMA) systems feature high communication efficiency, strong flexibility, and low operational costs, and they have been widely used in various FH communication scenarios such as satellite communication, military communication, and radio measurement. The low-hit zone (LHZ) FH sequences set (LHZ FHS set) plays a critical role in QS-FHMA systems, enabling user access with permissible time-delay offsets while maintaining superior performance. In this paper, three new methods to construct LHZ FHS sets based on m-sequences are proposed. The

APA, Harvard, Vancouver, ISO, and other styles

21

Helander, Martin G., and Li Lin. "Optimal Sequence in Product Design." Proceedings of the Human Factors and Ergonomics Society Annual Meeting 42, no. 6 (1998): 569–73. http://dx.doi.org/10.1177/154193129804200610.

Full text

Abstract:

This paper introduces Axiomatic Design (AD) for top-down design of ergonomics systems. The Independence Axiom was used to demonstrate how design activity can be structured to simplify the design process. Functional Requirements (FR) are first specified at a high level of abstraction and corresponding high level Design Parameters (DP) are generated. Then lower level Functional requirements are generated, and corresponding lower level Design Parameters. To avoid iterative improvements of design, one should strive for a decoupled design. This means that for each Functional Requirement there shoul

APA, Harvard, Vancouver, ISO, and other styles

22

DeRonne, Kevin W., and George Karypis. "Pareto Optimal Pairwise Sequence Alignment." IEEE/ACM Transactions on Computational Biology and Bioinformatics 10, no. 2 (2013): 481–93. http://dx.doi.org/10.1109/tcbb.2013.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Chi, H., M. Mascagni, and T. Warnock. "On the optimal Halton sequence." Mathematics and Computers in Simulation 70, no. 1 (2005): 9–21. http://dx.doi.org/10.1016/j.matcom.2005.03.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Gotoh, Osamu. "Consistency of optimal sequence alignments." Bulletin of Mathematical Biology 52, no. 4 (1990): 509–25. http://dx.doi.org/10.1007/bf02462264.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

GOTOH, O. "Consistency of optimal sequence alignments." Bulletin of Mathematical Biology 52, no. 4 (1990): 509–25. http://dx.doi.org/10.1016/s0092-8240(05)80359-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Brezinski, Claude, and Stefan Paszkowski. "Optimal linear contractive sequence transformations." Journal of Computational and Applied Mathematics 38, no. 1-3 (1991): 45–59. http://dx.doi.org/10.1016/0377-0427(91)90160-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Wan, Weiwei, Kensuke Harada, and Kazuyuki Nagata. "Assembly sequence planning for motion planning." Assembly Automation 38, no. 2 (2018): 195–206. http://dx.doi.org/10.1108/aa-01-2017-009.

Full text

Abstract:

Purpose The purpose of this paper is to develop a planner for finding an optimal assembly sequence for robots to assemble objects. Each manipulated object in the optimal sequence is stable during assembly. They are easy to grasp and robust to motion uncertainty. Design/methodology/approach The input to the planner is the mesh models of the objects, the relative poses between the objects in the assembly and the final pose of the assembly. The output is an optimal assembly sequence, namely, in which order should one assemble the objects, from which directions should the objects be dropped and ca

APA, Harvard, Vancouver, ISO, and other styles

28

Yu, Yanmin, Yongcai Lai, Ping Yan, and Haiying Liu. "The Novel Sequence Distance Measuring Algorithm Based on Optimal Transport and Cross-Attention Mechanism." Shock and Vibration 2021 (August 31, 2021): 1–10. http://dx.doi.org/10.1155/2021/3272119.

Full text

Abstract:

In this paper, we propose a novel sequence distance measuring algorithm based on optimal transport (OT) and cross-attention mechanism. Given a source sequence and a target sequence, we first calculate the ground distance between each pair of source and target terms of the two sequences. The ground distance is calculated over the subsequences around the two terms. We firstly pay attention from each the source terms to each target terms with attention weights, so that we have a representative source subsequence vector regarding each term in the target subsequence. Then, we pay attention from eac

APA, Harvard, Vancouver, ISO, and other styles

29

Wen, Bin. "Construction of Optimal Sets of Frequency Hopping Sequences." ISRN Combinatorics 2013 (January 30, 2013): 1–4. http://dx.doi.org/10.1155/2013/479408.

Full text

Abstract:

Frequency hopping spread spectrum and direct sequence spread spectrum are two main spread coding technologies. Frequency hopping sequences are needed in FH-CDMA systems. In this paper, a construction of optimal sets of frequency hopping sequences is presented. The construction is based on the set-theoretic characterization of an optimal set of FH sequences.

APA, Harvard, Vancouver, ISO, and other styles

30

Zhu, Hai Tao, and Liang Cong. "Disassembly Sequence Planning of Steam Turbines for Virtual Maintenance." Key Engineering Materials 572 (September 2013): 335–39. http://dx.doi.org/10.4028/www.scientific.net/kem.572.335.

Full text

Abstract:

Disassembly Sequence planning is the important module of virtual maintenance. Its foundational task is to test the disassemblability of parts, find out all the feasible disassembly sequences of targeted parts and search for the near-optimal disassembly sequence. In the paper, the spherical algorithm is used to test the disassemblability of parts. And then the disassembly direction of parts is determined by rules which are the simplified version of Gaussian map approach. Thus the near-optimal disassembly sequence is found out by optimizing all feasible disassembly sequences of targeted parts by

APA, Harvard, Vancouver, ISO, and other styles

31

Su, Qiang. "A hierarchical approach on assembly sequence planning and optimal sequences analyzing." Robotics and Computer-Integrated Manufacturing 25, no. 1 (2009): 224–34. http://dx.doi.org/10.1016/j.rcim.2007.11.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Luz, Maksym, and Mikhail Moklyachuk. "Robust Forecasting of Sequences with Periodically Stationary Long Memory Multiplicative Seasonal Increments Observed with Noise and Cointegrated Sequences." Statistics, Optimization & Information Computing 10, no. 2 (2022): 295–338. http://dx.doi.org/10.19139/soic-2310-5070-1408.

Full text

Abstract:

The problem of optimal estimation of linear functionals constructed from unobserved values of stochastic sequence with periodically stationary increments based on observations of the sequence with a periodically stationary noise is considered. For sequences with known spectral densities, we obtain formulas for calculating values of the mean square errors and the spectral characteristics of the optimal estimates of the functionals. Formulas that determine the least favorable spectral densities and minimax (robust) spectral characteristics of the optimal linear estimates of functionals are propo

APA, Harvard, Vancouver, ISO, and other styles

33

Luz, Maksym, and Mikhail Moklyachuk. "Robust Filtering of Sequences with Periodically Stationary Multiplicative Seasonal Increments." Statistics, Optimization & Information Computing 9, no. 4 (2021): 1010–30. http://dx.doi.org/10.19139/soic-2310-5070-1197.

Full text

Abstract:

We consider stochastic sequences with periodically stationary generalized multiple increments of fractional order which combines cyclostationary, multi-seasonal, integrated and fractionally integrated patterns. We solve the filtering problem for linear functionals constructed from unobserved values of a stochastic sequence of this type based on observations of the sequence with a periodically stationary noise sequence. For sequences with known matrices of spectral densities, we obtain formulas for calculating values of the mean square errors and the spectral characteristics of the optimal filt

APA, Harvard, Vancouver, ISO, and other styles

34

Zhou, Haobo, G. Jonah Rainey, Swee-Kee Wong, and John M. Coffin. "Substrate Sequence Selection by Retroviral Integrase." Journal of Virology 75, no. 3 (2001): 1359–70. http://dx.doi.org/10.1128/jvi.75.3.1359-1370.2001.

Full text

Abstract:

ABSTRACT Integration of retrovirus DNA is a specific process catalyzed by the integrase protein acting to join the viral substrate DNA (att) sequences of about 10 bases at the ends of the long terminal repeat (LTR) to various sites in the host target cell DNA. Although the interaction is sequence specific, the att sequences of different retroviruses are largely unrelated to one another and usually differ between the two ends of the viral DNA. To define substrate sequence specificity, we designed an “in vitro evolution” scheme to select an optimal substrate sequence by competitive integration i

APA, Harvard, Vancouver, ISO, and other styles

35

WU, ZUO-BING. "SELF-SIMILARITY LIMITS OF GENOMIC SIGNATURES." Fractals 11, no. 01 (2003): 19–25. http://dx.doi.org/10.1142/s0218348x03001574.

Full text

Abstract:

It is shown that metric representation of DNA sequences is one-to-one. By using the metric representation method, suppression of nucleotide strings in the DNA sequences is determined. For a DNA sequence, an optimal string length to display genomic signature in chaos game representation is obtained by eliminating effects of the finite sequence. The optimal string length is further shown as a self-similarity limit in computing information dimension. By using the method, self-similarity limits of bacteria complete genomic signatures are further determined.

APA, Harvard, Vancouver, ISO, and other styles

36

LI, Yubo, Liying TIAN, and Shengyi LIU. "Optimal ZCZ Complementary Sequence Sets with Low Column Sequence PMEPR." IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E101.A, no. 3 (2018): 612–16. http://dx.doi.org/10.1587/transfun.e101.a.612.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Murali, G. Bala, BBVL Deepak, MVA Raju, and BB Biswal. "Optimal robotic assembly sequence planning using stability graph through stable assembly subset identification." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 233, no. 15 (2019): 5410–30. http://dx.doi.org/10.1177/0954406219842908.

Full text

Abstract:

Assembly sequence planning is one of the multi-model optimization problems, in which more than one objective function has to be optimized at a time to obtain the quality assembly sequence. Moreover obtaining the feasible sequences from the possible finite set of sequences is a difficult task as the assembly sequence planning problem is N-P hard combinatorial problem. To solve the assembly sequence planning problem, researchers have developed various techniques to obtain the optimum solution. The developed methodologies have many drawbacks like struck at local optima, poor performance, huge sea

APA, Harvard, Vancouver, ISO, and other styles

38

Bahubalendruni, M. V. A. Raju, Bibhuti Bhusan Biswal, Manish Kumar, and Radharani Nayak. "Influence of assembly predicate consideration on optimal assembly sequence generation." Assembly Automation 35, no. 4 (2015): 309–16. http://dx.doi.org/10.1108/aa-03-2015-022.

Full text

Abstract:

Purpose – The purpose of this paper is to find out the significant influence of assembly predicate consideration on optimal assembly sequence generation (ASG) in terms of search space, computational time and possibility of resulting practically not feasible assembly sequences. An appropriate assembly sequence results in minimal lead time and low cost of assembly. ASG is a complex combinatorial optimisation problem which deals with several assembly predicates to result an optimal assembly sequence. The consideration of each assembly predicate highly influences the search space and thereby compu

APA, Harvard, Vancouver, ISO, and other styles

39

Luz, M. M., and M. P. Moklyachuk. "Robust interpolation of sequences with periodically stationary multiplicative seasonal increments." Carpathian Mathematical Publications 14, no. 1 (2022): 105–26. http://dx.doi.org/10.15330/cmp.14.1.105-126.

Full text

Abstract:

We consider stochastic sequences with periodically stationary generalized multiple increments of fractional order which combines cyclostationary, multi-seasonal, integrated and fractionally integrated patterns. We solve the interpolation problem for linear functionals constructed from unobserved values of a stochastic sequence of this type based on observations of the sequence with a periodically stationary noise sequence. For sequences with known matrices of spectral densities, we obtain formulas for calculating values of the mean square errors and the spectral characteristics of the optimal

APA, Harvard, Vancouver, ISO, and other styles

40

Eric, Pamela Vinitha, Gopakumar Gopalakrishnan, and Muralikrishnan Karunakaran. "An Optimal Seed Based Compression Algorithm for DNA Sequences." Advances in Bioinformatics 2016 (July 31, 2016): 1–7. http://dx.doi.org/10.1155/2016/3528406.

Full text

Abstract:

This paper proposes a seed based lossless compression algorithm to compress a DNA sequence which uses a substitution method that is similar to the LempelZiv compression scheme. The proposed method exploits the repetition structures that are inherent in DNA sequences by creating an offline dictionary which contains all such repeats along with the details of mismatches. By ensuring that only promising mismatches are allowed, the method achieves a compression ratio that is at par or better than the existing lossless DNA sequence compression algorithms.

APA, Harvard, Vancouver, ISO, and other styles

41

LIN, CHO-CHIN. "A FRAMEWORK FOR SOLVING SEQUENCE PROBLEM OF MULTIPLE INPUT STREAMS." International Journal of Foundations of Computer Science 18, no. 05 (2007): 1043–64. http://dx.doi.org/10.1142/s0129054107005121.

Full text

Abstract:

In this research, a framework is proposed for answering the question: whether a dominant sequence exists for the multiple self-contained input streams destined for a computation provider running the requested applications concurrently. The framework is extended to find an optimal semidominant sequence for multiple input streams. This paper also shows that an existent universal dominant sequence can be formed by permuting a set of dominant input streams. In this paper, the neighbor-connected graph is first proposed to model the sequence problem of multiple input streams. Then, an algorithm with

APA, Harvard, Vancouver, ISO, and other styles

42

Pinedo, Michael, Dequan Shaw, and Xiuli Chao. "On Optimal Permutation Scheduling in Stochastic Proportionate Flowshops." Probability in the Engineering and Informational Sciences 6, no. 4 (1992): 513–23. http://dx.doi.org/10.1017/s0269964800002709.

Full text

Abstract:

Consider m machines in series with unlimited intermediate buffers and n jobs available at time zero. The processing times of job j on all m machines are equal to a random variable Xj with distribution Fj. Various cost functions are analyzed using stochastic order relationships. First, we focus on minimizing where cj is the weight (holding cost) and Tj the completion time of job j. We establish that if are in a class of distributions we define as SIFR, and and are increasing sequences of likelihood ratio-ordered and stochastic-ordered random variables, respectively, the job sequence [1, 2, … n

APA, Harvard, Vancouver, ISO, and other styles

43

Ren, Yixin, Chenyu Hou, and Huaning Liu. "Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences." Electronic Research Archive 31, no. 8 (2023): 4549–56. http://dx.doi.org/10.3934/era.2023232.

Full text

Abstract:

<abstract><p>Sequences with optimal autocorrelation properties play an important role in wireless communication, radar and cryptography. Interleaving is a very important method in constructing the optimal autocorrelation sequence. Tang and Gong gave three different constructions of interleaved sequences (generalized GMW sequences, twin prime sequences and Legendre sequences). Su et al. constructed a series of sequences with optimal autocorrelation magnitude via interleaving Ding-Helleseth-Lam sequences. In this paper we further study the correlation properties of interleaved Legend

APA, Harvard, Vancouver, ISO, and other styles

44

Bahubalendruni, MVA Raju, and Bibhuti Bhusan Biswal. "A novel concatenation method for generating optimal robotic assembly sequences." Proceedings of the Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science 231, no. 10 (2015): 1966–77. http://dx.doi.org/10.1177/0954406215623813.

Full text

Abstract:

Selection of optimized assembly sequence is significantly essential to achieve cost-effective manufacturing process. This paper presents a novel efficient methodology to generate cost-effective feasible robotic assembly sequences though concatenation of parts. Part concatenation process will be followed with liaison predicate test and feasibility predicate test. A unique method called bounding box method is described to test the feasibility predicate efficiently in the computer-aided design environment. Assembly indexing technique is proposed to filter the redundant assembly subsets with high

APA, Harvard, Vancouver, ISO, and other styles

45

Chen, Wen Lei, and Xian Jia Wang. "Optimal Sequence of Multiple Jeeps Problems." Advanced Materials Research 403-408 (November 2011): 5142–45. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.5142.

Full text

Abstract:

In this paper the focus is on the logistics for a caravan of jeeps which travel in the desert. Based on the dynamic program principle, the maximum distances for the caravan when only a part of the jeeps should return and when all drivers should return is obtained. The optimal sequence for the expedition problem as well as the optimal time for the maximum distance is also carefully studied and presented.

APA, Harvard, Vancouver, ISO, and other styles

46

Lee, Cha Kun, and Paul I. Barton. "Determining the Optimal Mode Sequence 1." IFAC Proceedings Volumes 36, no. 6 (2003): 123–28. http://dx.doi.org/10.1016/s1474-6670(17)36418-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Chen, Kanglin, and Dirk A. Lorenz. "Image Sequence Interpolation Using Optimal Control." Journal of Mathematical Imaging and Vision 41, no. 3 (2011): 222–38. http://dx.doi.org/10.1007/s10851-011-0274-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Sandes, Edans Flavius De Oliveira, Azzedine Boukerche, and Alba Cristina Magalhaes Alves De Melo. "Parallel Optimal Pairwise Biological Sequence Comparison." ACM Computing Surveys 48, no. 4 (2016): 1–36. http://dx.doi.org/10.1145/2893488.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Smoot, M. E., S. A. Guerlain, and W. R. Pearson. "Visualization of near-optimal sequence alignments." Bioinformatics 20, no. 6 (2004): 953–58. http://dx.doi.org/10.1093/bioinformatics/bth013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Vajargah, Behrouz Fathi, and Asghar Eskandari Chechaglou. "Optimal Halton Sequence via Inversive Scrambling." Communications in Statistics - Simulation and Computation 42, no. 2 (2012): 476–84. http://dx.doi.org/10.1080/03610918.2011.650255.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!