Artykuły w czasopismach: „Optimal Sequence”

1

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Bahubalendruni, MVA Raju, i 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, nr 4 (20.12.2016): 531–41. http://dx.doi.org/10.1177/0954406216684159.

Pełny tekst źródła

Streszczenie:

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 part trajectory distances are considered to state the optimality of a valid assembly sequence. Achieving optimized assembly sequence through the proposed method for user-defined objective function is briefly illustrated. The computational performance of the method in achieving all valid assembly sequences is illustrated for various dissimilar products.

Style APA, Harvard, Vancouver, ISO itp.

6

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Streszczenie:

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 correlation bound.

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Streszczenie:

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 encodes the optimal subassembly sequence so that the desired assemblies are put together only in the optimal sequence. The results of genetic search and rate equation analyses reveal that the optimal subassembly sequence depends on the initial concentration of parts and the defect probabilities during randomized assembly. The results indicate that abundant parts and parts with high defect probabilities should be assembled earlier rather than later.

Style APA, Harvard, Vancouver, ISO itp.

9

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

Pełny tekst źródła

Streszczenie:

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-marrow model determines the possible assembly sequences to ease the intricacy of the problem formulation. Further evaluation has been carried out through negative-selection censoring and monitoring models. These developed models reduce the overall computational time to determine the optimal feasible assembly sequence. Originality/value In this paper, the novel and efficient strategies based on artificial immune system have been developed and proposed to obtain all valid assembly sequences and optimized assembly sequence for a given assembled product using assembly attributes. The introduced methodology has proven its effectiveness in achieving optimal assembly sequence with less computational time.

Style APA, Harvard, Vancouver, ISO itp.

10

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

11

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

Pełny tekst źródła

Streszczenie:

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 the correlation problem as manifested in two-dimensional projections. This paper proposes a modified Halton sequence (MHalton), created using a linear digital scrambling method, which finds the optimal multiplier for the Halton sequence in the linear scrambling space. In order to generate better uniformity of distributed sequences, we have chosen strong MHalton multipliers up to 360 dimensions. The proposed multipliers have been tested and proved to be stronger than several sets of multipliers used in other known scrambling methods. To compare the quality of our proposed scrambled MHalton sequences with others, we have performed several extensive computational tests that use {L_{2}} -discrepancy and high-dimensional integration tests. Moreover, we have tested MHalton sequences on Mortgage-backed security (MBS), which is one of the most widely used applications in finance. We have tested our proposed MHalton sequence numerically and empirically, and they show optimal results in QMC applications. These confirm the efficiency and safety of our proposed MHalton over scrambling sequences previously used in QMC applications.

Style APA, Harvard, Vancouver, ISO itp.

12

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

Pełny tekst źródła

Streszczenie:

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 should ideally be only one Design Parameter - and this design parameter should satisfy only one functional requirement. Two case studies were used to illustrate the AD procedure.

Style APA, Harvard, Vancouver, ISO itp.

13

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

14

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

15

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

16

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

17

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

18

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

Pełny tekst źródła

Streszczenie:

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 the near optimal solutions for semi global alignment compared to other existing approaches.

Style APA, Harvard, Vancouver, ISO itp.

19

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, nr 7-8 (15.02.2021): 1849–59. http://dx.doi.org/10.1007/s00170-020-06256-z.

Pełny tekst źródła

Streszczenie:

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 (744 mm in length, 172 mm in width, and 100 in thickness ) with 9 pockets was used to demonstrate the optimal sequences. One of the optimal sequence with minimum floor height error was used in pocketing (roughing), and the maximum distortion was 0.693 mm in the middle and the maximum floor height error appeared on both sides rather than the middle, which were 0.477 mm and 0.388 mm, and part growth produced maximum wall position error was 0.719 mm. On the same part, further demonstrated the optimal sequence with minimum wall position error in finishing (with 1 mm dimension in stock for all surfaces) and the wall position errors were fully removed. The pocketed beam machining is a typical and representative case and the results and conclusion can be extended to pocketed plate/board machining and even surfacing.

Style APA, Harvard, Vancouver, ISO itp.

20

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

Pełny tekst źródła

Streszczenie:

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 the start or the end sequence to find the best sequencing with some conditions. Also, there is no possibility to add relations to point a variable as wanted or prevented from the sequence. In this paper, we solve the From-To matrix by binary linear programming (BLP). The proposed BLP approach has been applied in Ur company to solve the From-To matrix. This company has a production line that can manufacture four products: A, B, C, and D, the setup time matrix is considered as From-To matrix and the goal of this company is to get an optimum sequence of products with minimum time. The solution of state transition of the From-To matrix using BLP can be formulated in the following five model cases according to transition requirement condition and desired: the first case gives all possible sequence items, the second case lists the sequence items when the first sequence is known, the third case lists the sequence items when the last sequence is known, the fourth case gives all possible sequence items with a condition that prevents occurring of an undesired sequence, and the fifth case gives all possible sequence items with the condition of a wanted occurring of the desired sequence. Furthermore, we found the optimum sequences for states by determining the start or end sequences, and also add the wanted relations or prevented. The mathematical formulas for the number of all sequences under some conditions are derived and proved

Style APA, Harvard, Vancouver, ISO itp.

21

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

Pełny tekst źródła

Streszczenie:

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 phylogenetic tree for the 19 pieces of homologous sequences were analyzed, with the highest homology reaching 99%.

Style APA, Harvard, Vancouver, ISO itp.

22

Hordijk, Wim, Arie Hordijk i 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, nr 03 (czerwiec 2015): 1550015. http://dx.doi.org/10.1142/s0217595915500153.

Pełny tekst źródła

Streszczenie:

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, not only is the performance under a billiard sequence better than that of the corresponding randomized policy, the optimal billiard sequence even outperforms the billiard implementation of the optimal randomized policy. The framework we introduce in this paper is suitable for general optimization problems over (periodic) deterministic decision sequences. Given the significant performance improvement that a switch from randomized policies to billiard sequences yields, this framework is of importance in practical applications. Finally, we show that constrained or multi-objective optimization can be dealt with in our framework as well.

Style APA, Harvard, Vancouver, ISO itp.

23

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

Pełny tekst źródła

Streszczenie:

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 candidate grasps of each object. The proposed planner finds the optimal solution by automatically permuting, evaluating and searching the possible assembly sequences considering stability, graspability and assemblability qualities. Findings The proposed planner could plan an optimal sequence to guide robots to do assembly using translational motion. The sequence provides initial and goal configurations to motion planning algorithms and is ready to be used by robots. The usefulness of the proposed method is verified by both simulation and real-world executions. Originality/value The paper proposes an assembly planner which can find an optimal assembly sequence automatically without teaching of the assembly orders and directions by skilled human technicians. The planner is highly expected to improve teachingless robotic manufacturing.

Style APA, Harvard, Vancouver, ISO itp.

24

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

25

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

26

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

27

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

Pełny tekst źródła

Streszczenie:

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 each representative vector of the term of the target subsequence to the entire source subsequence. In this way, we construct the cross-attention weights and use them to calculate the pairwise ground distances. With the ground distances, we derive the OT distance between the two sequences and train the attention parameters and ground distance metric parameters together. The training process is conducted with training triplets of sequences, where each triplet is composed of an anchor sequence, a must-link sequence, and a cannot-link sequence. The corresponding hinge loss function of each triplet is minimized, and we develop an iterative algorithm to solve the optimal transport problem and the attention/ground distance metric parameters in an alternate way. The experiments over sequence similarity search benchmark datasets, including text, video, and rice smut protein sequence data, are conducted. The experimental results show the algorithm is effective.

Style APA, Harvard, Vancouver, ISO itp.

28

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

29

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

30

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

31

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

32

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

33

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

34

Xiaozhong, Wang, i Roger M. Cooke. "Optimal inspection sequence in fault diagnosis". Reliability Engineering & System Safety 37, nr 3 (styczeń 1992): 207–10. http://dx.doi.org/10.1016/0951-8320(92)90124-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

35

von Brasch, Thomas, Johan Byström i Lars Petter Lystad. "Optimal Control and the Fibonacci Sequence". Journal of Optimization Theory and Applications 154, nr 3 (26.04.2012): 857–78. http://dx.doi.org/10.1007/s10957-012-0061-2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

36

Sharma, K. D., i Rekha Jain. "Choosing an optimal sequence of discriminators". Information Systems 11, nr 4 (styczeń 1986): 337–42. http://dx.doi.org/10.1016/0306-4379(86)90013-x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

37

Duffuaa, S. O., i A. Raouf. "An optimal sequence in multicharacteristics inspection". Journal of Optimization Theory and Applications 67, nr 1 (październik 1990): 79–86. http://dx.doi.org/10.1007/bf00939736.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

38

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

Pełny tekst źródła

Streszczenie:

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 in vitro from a large pool of partially randomized substrates. Integrated substrates are enriched by PCR amplification and then regenerated and subjected to subsequent cycles of selection and enrichment. Using this approach, we obtained the optimal substrate sequence of 5′-ACGACAACA-3′ for avian sarcoma-leukosis virus (ASLV) and 5′-AACA(A/C)AGCA-3′ for human immunodeficiency virus type 1, which differed from those found at both ends of the viral DNA. Clonal analysis of the integration products showed that ASLV integrase can use a wide variety of substrate sequences in vitro, although the consensus sequence was identical to the selected sequence. By a competition assay, the selected nucleotide at position 4 improved the in vitro integration efficiency over that of the wild-type sequence. Viral mutants bearing the optimal sequence replicated at wild-type levels, with the exception of some mutations disrupting the U5 RNA secondary structure important for reverse transcription, which were significantly impaired. Thus, maximizing the efficiency of integration may not be of major importance for efficient retrovirus replication.

Style APA, Harvard, Vancouver, ISO itp.

39

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

Pełny tekst źródła

Streszczenie:

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 ant colony algorithm. The simulation result of the sequence optimization proves to be the same with manual calculation considering comprehensive cost of the change of disassembly tools and disassembly directions. The set of approaches can be reference for disassembly sequence planning of large-scale mechanical products.

Style APA, Harvard, Vancouver, ISO itp.

40

Luz, Maksym, i 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, nr 2 (23.03.2022): 295–338. http://dx.doi.org/10.19139/soic-2310-5070-1408.

Pełny tekst źródła

Streszczenie:

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 proposed in the case where spectral densities of the sequence are not exactly known while some sets of admissible spectral densities are given.

Style APA, Harvard, Vancouver, ISO itp.

41

MOLLINEDA, R. A., E. VIDAL i F. CASACUBERTA. "CYCLIC SEQUENCE ALIGNMENTS: APPROXIMATE VERSUS OPTIMAL TECHNIQUES". International Journal of Pattern Recognition and Artificial Intelligence 16, nr 03 (maj 2002): 291–99. http://dx.doi.org/10.1142/s0218001402001678.

Pełny tekst źródła

Streszczenie:

The problem of cyclic sequence alignment is considered. Most existing optimal methods for comparing cyclic sequences are very time consuming. For applications where these alignments are intensively used, optimal methods are seldom a feasible choice. The alternative to an exact and costly solution is to use a close-to-optimal but cheaper approach. In previous works, we have presented three suboptimal techniques inspired on the quadratic-time suboptimal algorithm proposed by Bunke and Bühler. Do these approximate approaches come sufficiently close to the optimal solution, with a considerable reduction in computing time? Is it thus worthwhile investigating these approximate methods? This paper shows that approximate techniques are good alternatives to optimal methods.

Style APA, Harvard, Vancouver, ISO itp.

42

Han Cai, Yang Yang, Zhengchun Zhou i Xiaohu Tang. "Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes". IEEE Transactions on Information Theory 62, nr 2 (luty 2016): 1087–93. http://dx.doi.org/10.1109/tit.2015.2512859.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

43

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

Pełny tekst źródła

Streszczenie:

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 filtering of the functionals. Formulas that determine the least favourable spectral densities and the minimax (robust) spectral characteristics of the optimal linear filtering of the functionals are proposed in the case where spectral densities of the sequence are not exactly known while some sets of admissible spectral densities are given.

Style APA, Harvard, Vancouver, ISO itp.

44

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

45

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

Pełny tekst źródła

Streszczenie:

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 computational time to achieve valid assembly sequence. Often, the ignoring an assembly predicate leads to inappropriate assembly sequence, which may not be physically possible, sometimes predicate assumption drastic ally raises the search space with high computational time. Design/methodology/approach – The influence of assuming and considering different assembly predicates on optimal assembly sequence generation have been clearly illustrated with examples using part concatenation method. Findings – The presence of physical attachments and type of assembly liaisons decide the consideration of assembly predicate to reduce the complexity of the problem formulation and overall computational time. Originality/value – Most of the times, assembly predicates are ignored to reduce the computational time without considering their impact on the assembly sequence problem irrespective of assembly attributes. The current research proposes direction towards predicate considerations based on the assembly configurations for effective and efficient ASG.

Style APA, Harvard, Vancouver, ISO itp.

46

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

Pełny tekst źródła

Streszczenie:

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.

Style APA, Harvard, Vancouver, ISO itp.

47

Murali, G. Bala, BBVL Deepak, MVA Raju i 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, nr 15 (18.04.2019): 5410–30. http://dx.doi.org/10.1177/0954406219842908.

Pełny tekst źródła

Streszczenie:

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 search space and many more. To overcome these difficulties, the current research work aims to use stability graph to generate stable assembly subsets for obtaining the optimum assembly sequences. In the proposed methodology, to reduce the search space and to obtain the quality assembly sequences, stability graph is considered. Moreover, the fitness of assembly subsets is evaluated according to the user weights at each level before proceeding to the higher levels. Due to this, the higher fitness value subsets are eliminated at each stage by which time of execution will reduce enormously. The proposed methodology has implemented on various industrial products and compared the results with the various well-known algorithms.

Style APA, Harvard, Vancouver, ISO itp.

48

Kanglin Chen i D. A. Lorenz. "Image Sequence Interpolation Based on Optical Flow, Segmentation, and Optimal Control". IEEE Transactions on Image Processing 21, nr 3 (marzec 2012): 1020–30. http://dx.doi.org/10.1109/tip.2011.2179305.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

49

Rehman, Hafiz Asadul, Kashif Zafar, Ayesha Khan i Abdullah Imtiaz. "Multiple sequence alignment using enhanced bird swarm align algorithm". Journal of Intelligent & Fuzzy Systems 41, nr 1 (11.08.2021): 1097–114. http://dx.doi.org/10.3233/jifs-210055.

Pełny tekst źródła

Streszczenie:

Discovering structural, functional and evolutionary information in biological sequences have been considered as a core research area in Bioinformatics. Multiple Sequence Alignment (MSA) tries to align all sequences in a given query set to provide us ease in annotation of new sequences. Traditional methods to find the optimal alignment are computationally expensive in real time. This research presents an enhanced version of Bird Swarm Algorithm (BSA), based on bio inspired optimization. Enhanced Bird Swarm Align Algorithm (EBSAA) is proposed for multiple sequence alignment problem to determine the optimal alignment among different sequences. Twenty-one different datasets have been used in order to compare performance of EBSAA with Genetic Algorithm (GA) and Particle Swarm Align Algorithm (PSAA). The proposed technique results in better alignment as compared to GA and PSAA in most of the cases.

Style APA, Harvard, Vancouver, ISO itp.

50

Sierk, Michael L., Michael E. Smoot, Ellen J. Bass i William R. Pearson. "Improving pairwise sequence alignment accuracy using near-optimal protein sequence alignments". BMC Bioinformatics 11, nr 1 (2010): 146. http://dx.doi.org/10.1186/1471-2105-11-146.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Artykuły w czasopismach na temat „Optimal Sequence”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych