Статті в журналах: "Digital sequence"

1

Yamamoto, Hidehiko, Etsuo Marui, and Kenichi Oota. "Development of Network System For Sequence Circuit By Database(Digital design and digital manufacturing)." Proceedings of International Conference on Leading Edge Manufacturing in 21st century : LEM21 2005.1 (2005): 29–34. http://dx.doi.org/10.1299/jsmelem.2005.1.29.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Ahmed, Abdalla G. M., Mikhail Skopenkov, Markus Hadwiger, and Peter Wonka. "Analysis and Synthesis of Digital Dyadic Sequences." ACM Transactions on Graphics 42, no. 6 (December 5, 2023): 1–17. http://dx.doi.org/10.1145/3618308.

Повний текст джерела

Анотація:

We explore the space of matrix-generated (0, m , 2)-nets and (0, 2)-sequences in base 2, also known as digital dyadic nets and sequences. In computer graphics, they are arguably leading the competition for use in rendering. We provide a complete characterization of the design space and count the possible number of constructions with and without considering possible reorderings of the point set. Based on this analysis, we then show that every digital dyadic net can be reordered into a sequence, together with a corresponding algorithm. Finally, we present a novel family of self-similar digital dyadic sequences, to be named ξ -sequences, that spans a subspace with fewer degrees of freedom. Those ξ -sequences are extremely efficient to sample and compute, and we demonstrate their advantages over the classic Sobol (0, 2)-sequence.

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Romanov, О. М., and V. Yu Kotiubin. "PERIODICITY SEARCH ALGORITHMS IN DIGITAL SEQUENCES WITH BLOCK CODING BY THEIR CORRELATION PROPERTIES." Radio Electronics, Computer Science, Control, no. 2 (June 24, 2021): 7–18. http://dx.doi.org/10.15588/1607-3274-2021-2-1.

Повний текст джерела

Анотація:

Context. To improve the noise immunity of communication and data transmission systems, error-correcting coding is widely used. The most common because of their effectiveness are block coding methods. Under conditions of partial a priori uncertainty of the type and parameters of encoding, before decoding the digital sequence, a preliminary analysis is carried out to determine them. In block coding, to determine the period of a digital sequence caused by the addition of a sync sequence to it, and which can determine the type and parameters of coding, a common approach is to use their correlation properties. Objective. The object of the research is the presentation of periodicity search algorithms in digital sequences with block errorcorrecting coding under conditions of partial a priori uncertainty of the type and parameters of the error-correcting code. Method. The article presents two periodicity search algorithms in digital sequences with block coding and describes the principle of their operation. The basis of one algorithm is the calculation of the autocorrelation function, the basis of the other is calculation of the cross-correlation function. It is shown that the length of the digital sequence should be twice as long as the maximum possible period. The operation of both algorithms is illustrated by examples. Results. Based on the proposed algorithms, special software has been developed. The results of determining the period of digital sequences with block error-correcting coding at different values of the period confirmed the efficiency of the proposed algorithms. Both proposed algorithms give approximately the same result. Experimental dependences of the calculation time of auto- and crosscorrelation functions from the length of the digital sequence and the maximum possible period are established. The period search algorithm in a digital sequence, that use the cross-correlation function of its components, is more efficient due to fewer calculations. Conclusions. For the first time, two periodicity search algorithms in digital sequences with block error-correcting based on the determination of their correlation functions are obtained. The application of the developed algorithms in practice allows, under partial a priori uncertainty of the type and parameters of the error-correcting code, to determine the period of digital sequences in real time even at large values of the period, and based on it, to identify the type and parameters of block error-correcting codes.

Стилі APA, Harvard, Vancouver, ISO та ін.

4

SOMIA, N., G. S. RASH, M. WACHOWIAK, and A. GUPTA. "The Initiation and Sequence of Digital Joint Motion." Journal of Hand Surgery 23, no. 6 (December 1998): 792–95. http://dx.doi.org/10.1016/s0266-7681(98)80099-5.

Повний текст джерела

Анотація:

We studied the initiation and sequence of digital joint motion during unrestricted flexion and extension using a 3-D motion analysis of all fingers moving simultaneously. Our results showed that motion started in a single joint in 83% of flexion and 80% of extension cycles. The DIP joint initiated flexion and extension in the index, middle, and ring fingers, but in the little finger, flexion started in the PIP joint, and extension in the MP joint. The two most frequent sequences of joint movement during flexion of the three radial fingers were DIP-PIP-MP and PIP-DIP-MP. The two most frequent sequences during extension of the three radial fingers were DIP-MP-PIP followed by DIP-MP/PIP. In the little finger, however, the most frequent sequences during flexion were PIP-DIP-MP followed by DIP-PIP-MP and during extension, DIP-MP/PIP followed by PIP/DIP-MP

Стилі APA, Harvard, Vancouver, ISO та ін.

5

TELKSNYS, TADAS, ZENONAS NAVICKAS, MARTYNAS VAIDELYS, and MINVYDAS RAGULSKIS. "THE ORDER OF A 2-SEQUENCE AND THE COMPLEXITY OF DIGITAL IMAGES." Advances in Complex Systems 19, no. 04n05 (June 2016): 1650010. http://dx.doi.org/10.1142/s0219525916500107.

Повний текст джерела

Анотація:

The concept of the order of a 2-sequence is introduced in this paper. The order of a 2-sequence is a natural but not trivial extension of the order of one-dimensional (1D) linear recurrent sequences. Necessary and sufficient conditions for the generation of 2-sequences with finite order from the minimal information subset are derived. It is demonstrated that the order of 2-sequences can be used to estimate the complexity of self-organizing patterns with respect to each spatial coordinate.

Стилі APA, Harvard, Vancouver, ISO та ін.

6

He, Xuejun, Feng Lin, Wenkang Huang, Chenxia Li, and Xufeng Jing. "Far-field scattering control of wave based on all-dielectric blazed encoding metagrating." Laser Physics 32, no. 11 (October 13, 2022): 116204. http://dx.doi.org/10.1088/1555-6611/ac9680.

Повний текст джерела

Анотація:

Abstract Coding metagrating metasurfaces can realize flexible and effective control of polarization, amplitude, and phase of electromagnetic waves. The coded metagrating builds a bridge between the physical unit structure and the digital coding, and can realize the digital coding calculation processing of the physical device. We propose several all dielectric encoded metagrating sequences, and the detailed analysis of their far-field scattering properties is given. Based on the principle of digital coding addition, we add two coding metagrating sequences to obtain a new coding sequence. This new coding sequence results in an additive integration of the functions of the original two coding sequences. This method provides an idea for the realization of multifunctional devices.

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Song, Bing Bing, Jing Pan, and Qun Ding. "Digital Henon Sequences Generation and its Analysis." Advanced Materials Research 981 (July 2014): 793–96. http://dx.doi.org/10.4028/www.scientific.net/amr.981.793.

Повний текст джерела

Анотація:

In this paper, the typical two-dimensional Henon map is studied. Firstly, the model of Henon map is proposed based on DSP Builder platform in Simulink library, so it can generate digital output sequence of Henon map. Then, its statistical properties are analyzed for such output sequences, including balance test, run test and autocorrelation test. Finally, the numerical results show that such digital Henon sequences have good pseudo-randomness.

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Wang, Chuanfu, Yi Di, Jianyu Tang, Jing Shuai, Yuchen Zhang, and Qi Lu. "The Dynamic Analysis of a Novel Reconfigurable Cubic Chaotic Map and Its Application in Finite Field." Symmetry 13, no. 8 (August 3, 2021): 1420. http://dx.doi.org/10.3390/sym13081420.

Повний текст джерела

Анотація:

Dynamic degradation occurs when chaotic systems are implemented on digital devices, which seriously threatens the security of chaos-based pseudorandom sequence generators. The chaotic degradation shows complex periodic behavior, which is often ignored by designers and seldom analyzed in theory. Not knowing the exact period of the output sequence is the key problem that affects the application of chaos-based pseudorandom sequence generators. In this paper, two cubic chaotic maps are combined, which have symmetry and reconfigurable form in the digital circuit. The dynamic behavior of the cubic chaotic map and the corresponding digital cubic chaotic map are analyzed respectively, and the reasons for the complex period and weak randomness of output sequences are studied. On this basis, the digital cubic chaotic map is optimized, and the complex periodic behavior is improved. In addition, a reconfigurable pseudorandom sequence generator based on the digital cubic chaotic map is constructed from the point of saving consumption of logical resources. Through theoretical and numerical analysis, the pseudorandom sequence generator solves the complex period and weak randomness of the cubic chaotic map after digitization and makes the output sequence have better performance and less resource consumption, which lays the foundation for applying it to the field of secure communication.

Стилі APA, Harvard, Vancouver, ISO та ін.

9

Zaurbek, A., and D. Z. Dzhuruntaev. "DIGITAL OSCILLATOR CIRCUIT WITH AN EXTENDED REPETITION PERIOD OF A PSEUDO-RANDOM PULSE SEQUENCE." BULLETIN Series of Physics & Mathematical Sciences 69, no. 1 (March 10, 2020): 210–14. http://dx.doi.org/10.51889/2020-1.1728-7901.36.

Повний текст джерела

Анотація:

In this paper, we consider the issue of upgrading the circuit of a digital generator of a pseudo-random pulse sequence, which can be used to create cryptographic encryption algorithms. The need to modernize the digital generator circuit is associated with an increase in the number of pseudorandom pulse train sequences generated at its output and with pseudorandom intervals between them. To achieve this, a small number of additional elements are included in the circuit of a digital pseudorandom sequence of pulses based on a five-digit shift register with linear feedback. Based on the modernized circuit of a digital generator of a pseudorandom sequence of pulses and an active secondorder Slenlen-Key RC low-pass filter, a digital acoustic noise generator is constructed, which, unlike the prototype, has a truly random output signal over a period of ~ 4 * (2N - 1), subject to circuit simplicity.

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Manikandan, G., and K. Srinivasa Rao. "DIGITAL TIME: A FINITE FIELD, TF." JOURNAL OF RAMANUJAN SOCIETY OF MATHEMATICS AND MATHEMATICAL SCIENCES 10, no. 01 (December 30, 2022): 167–72. http://dx.doi.org/10.56827/jrsmms.2022.1001.14.

Повний текст джерела

Анотація:

Digital time was defined KSR-PP [2] with three two-digit positions as h2h1 : m2m1 : s2s1. It was identified with appropriate restricted place values on the hours (H), minutes (M) and seconds (S) shown to be 86400-element cyclic Time Group, TG. Here it is shown to be a finite time field, TF. A palindromic sequence of 119-elements and its sub-sequences are shown to be consequences of TF .

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Qi, Zhaohui, Yingqiang Ning, and Yinmei Huang. "Protein Sequence Comparison Method Based on 3-ary Huffman Coding." Match Communications in Mathematical and in Computer Chemistry 90, no. 2 (April 2023): 357–80. http://dx.doi.org/10.46793/match.90-2.357q.

Повний текст джерела

Анотація:

Based on 3-ary Huffman coding algorithm, we propose a digital mapping method of protein sequence. Firstly, a 3-ary Huffman tree is defined by the frequency characteristic of 20 amino acids in given protein sequences. The 0-2 codes of 20 amino acids constructed by the 3-ary Huffman tree can convert long protein sequences into one-to-one 0-2 digital sequences. According to the frequency characteristic and the distribution information of 0-2 codes of 20 amino acids in the 0-2 digital sequences, we design the 40-dimensional vectors to characterize the protein sequences. Next, the proposed digital mapping method is used to perform three separate applications, similarity comparison of nine ND6 proteins, evolutionary trend analysis of the 2009 pandemic Human influenza A (H1N1) viruses from January 2020 to June 2022, and the evolution analysis of 95 coronavirus genes. The results illustrate the utility of the proposed method.

Стилі APA, Harvard, Vancouver, ISO та ін.

12

Müllner, Clemens. "The Rudin–Shapiro Sequence and Similar Sequences Are Normal Along Squares." Canadian Journal of Mathematics 70, no. 5 (October 1, 2018): 1096–129. http://dx.doi.org/10.4153/cjm-2017-053-1.

Повний текст джерела

Анотація:

AbstractWe prove that digital sequences modulomalong squares are normal, which covers some prominent sequences, such as the sum of digits in baseqmodulom, the Rudin–Shapiro sequence, and some generalizations. This gives, for any base, a class of explicit normal numbers that can be efficiently generated.

Стилі APA, Harvard, Vancouver, ISO та ін.

13

Kozlov, Alexander Nikolaevich. "REVERSE MEASURING CONVERTER SEQUENCE FOR DIGITAL PROTECTION." Messenger AmSU, no. 89 (2020): 87–90. http://dx.doi.org/10.22250/jasu.22.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

14

Weinstein, Brielle, Mahmoud Hassouba, Roberto L. Flores, David A. Staffenberg, Christopher B. Gordon, and Christopher M. Runyan. "Digital-Facial Translocation in Amniotic Band Sequence." Journal of Craniofacial Surgery 29, no. 7 (October 2018): 1890–92. http://dx.doi.org/10.1097/scs.0000000000004817.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

15

Enami, Kazumasa, and Hideki Sumiyoshi. "Digital Image Sequence Storage and Display System." Journal of the Institute of Television Engineers of Japan 45, no. 8 (1991): 951–58. http://dx.doi.org/10.3169/itej1978.45.951.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

16

Sadeghi Tabar, Roham, Hanchen Zheng, Frank Litwa, Kristin Paetzold-Byhain, Lars Lindkvist, Kristina Wärmefjord, and Rikard Söderberg. "Digital Twin-Based Clamping Sequence Analysis and Optimization for Improved Geometric Quality." Applied Sciences 14, no. 2 (January 6, 2024): 510. http://dx.doi.org/10.3390/app14020510.

Повний текст джерела

Анотація:

Geometric deviation associated with the assembly of sheet metal is a general concern for manufacturers. The typical assembly step involves a sequence of events that exert forces on the parts to enforce them to the nominal condition and to connect the parts together. The simulation and optimization of the assembly steps often neglect the sequence of operations due to the problem and computation complexity. This paper investigates the influence of the clamping sequence in the body-in-white (BIW) manufacturing process on the geometrical quality of the assembly. An approach for modeling clamping sequences for non-rigid variation simulation is introduced in a digital twin context, taking the part deviation into consideration. An optimization method is proposed to achieve minimum geometric deviation after clamping the parts and welding them together. The method is successfully applied on two reference assemblies, and the results show that the sequence of clamping can impact the total geometric deviation up to 31%. Combining clamping and welding sequence optimization can enhance the quality improvement to 77% after releasing the assembly from the fixture and springback.

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Kamel, R. E., and Y. Bar-Ness. "Reduced-state sequence estimation of digital sequences in dispersive channels using state partitioning." Electronics Letters 30, no. 1 (January 6, 1994): 14–16. http://dx.doi.org/10.1049/el:19940068.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

18

Kamel, R. E., and Y. Bar-Ness. "Blind maximum likelihood sequence estimation of digital sequences in presence of intersymbol interference." Electronics Letters 30, no. 7 (March 31, 1994): 537–39. http://dx.doi.org/10.1049/el:19940384.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

19

Duplakova, Darina, Jan Duplak, and Rastislav Kascak. "Ergonomic Rationalization Sequence of Digital Lighting Design in the Working Environment." International Journal of Environmental Research and Public Health 19, no. 12 (June 14, 2022): 7275. http://dx.doi.org/10.3390/ijerph19127275.

Повний текст джерела

Анотація:

This paper describes the creation of a rationalization sequence for working with simulation models, and its subsequent verification in the redesigning of lighting in cooperation with digital enterprise tools. The rationalization sequence consists of 11 sequences, whose accuracy is subsequently verified on a practical example of the redesign of an assembly room of a production hall in the simulation tool Dialux Evo. In conjunction with the proposed procedure, a redesign of the assembly workplace located in the production hall for daylighting, artificial, and mixed lighting was created. The conclusion of the paper provides an overview of the benefits gained from the application of the work environment rationalization procedure.

Стилі APA, Harvard, Vancouver, ISO та ін.

20

Liu, Rui. "A New Chaotic Image Scrambling Scheme Based on Spatial Bit-Level Map." Applied Mechanics and Materials 220-223 (November 2012): 2589–94. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.2589.

Повний текст джерела

Анотація:

Image scrambling is an important technique in digital image encryption and digital image watermarking. This paper proposes a new image scrambling algorithm based on chaotic sequence and spatial bit-level map. First, I used Logistic chaotic sequences to rearrange digital image pixels into one-dimensional (1-D) sequence, then the value of each pixel in the sequence was decomposed into k-bits which constituted a two-dimensional (2-D) bit matrix. Second, the spatial bit-level map was performed in the 2-D bit matrix to generate pixels with new values. Finally, the scrambling image was generated according to these pixels. This algorithm can scramble image based on the pixel’s position and the value and their corresponding probability. The experimental results show that this scrambling algorithm possesses perfect confusion properties and it can resist various attacks. Also it can apply to non-square image.

Стилі APA, Harvard, Vancouver, ISO та ін.

21

Dai, Hongjun. "Shape measurement by digital speckle temporal sequence correlation with digital light projector." Optical Engineering 40, no. 5 (May 1, 2001): 793. http://dx.doi.org/10.1117/1.1360708.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

22

Wang, Chuanfu, Chunlei Fan, Kai Feng, Xin Huang, and Qun Ding. "Analysis of the Time Series Generated by a New High-Dimensional Discrete Chaotic System." Complexity 2018 (August 27, 2018): 1–11. http://dx.doi.org/10.1155/2018/9818520.

Повний текст джерела

Анотація:

The chaotic behavior of low-dimensional digital chaotic systems is seriously degraded, and the output sequence has a short period. In this study, a digital sequence generator based on a high-dimensional chaotic system is proposed to ensure performance and security. The proposed generator has low resource consumption, and the digital pseudo-random output sequence has a large period. To avoid the nonchaotic state, the multistability in the high-dimensional discrete chaotic system is analyzed. The statistical performance of the output sequence of the proposed digital high-dimensional chaotic system is evaluated, and the results demonstrate that it is a suitable candidate for a long-period pseudo-random sequence generator.

Стилі APA, Harvard, Vancouver, ISO та ін.

23

Alfonso-Gil, Jose Carlos, Jose Joaquin Vague-Cardona, Salvador Orts-Grau, Francisco J. Gimeno-Sales, and Salvador Segui-Chilet. "Enhanced Grid Fundamental Positive-Sequence Digital Synchronization Structure." IEEE Transactions on Power Delivery 28, no. 1 (January 2013): 226–34. http://dx.doi.org/10.1109/tpwrd.2012.2219559.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

24

Ohura, Y., T. Matsuda, M. Suzuki, F. Andow, Y. Kurosawa, and A. Takeuchi. "A digital distance relay using negative sequence current." IEEE Transactions on Power Delivery 5, no. 1 (1990): 79–84. http://dx.doi.org/10.1109/61.107259.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

25

Hosseini, K., and M. P. Kennedy. "Maximum Sequence Length MASH Digital Delta–Sigma Modulators." IEEE Transactions on Circuits and Systems I: Regular Papers 54, no. 12 (December 2007): 2628–38. http://dx.doi.org/10.1109/tcsi.2007.905653.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

26

Fan, P. Z., and M. Darnell. "Construction and comparison of periodic digital sequence sets." IEE Proceedings - Communications 144, no. 6 (1997): 361. http://dx.doi.org/10.1049/ip-com:19971524.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

27

Schuckel, Julia, and Andrew S. French. "A digital sequence method of dynamic olfactory characterization." Journal of Neuroscience Methods 171, no. 1 (June 2008): 98–103. http://dx.doi.org/10.1016/j.jneumeth.2008.02.013.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

28

Miranda, Pablo. "Computer utterances: Sequence and event in digital architecture." International Journal of Architectural Computing 15, no. 4 (October 13, 2017): 268–84. http://dx.doi.org/10.1177/1478077117734661.

Повний текст джерела

Анотація:

Barely a month before the end of World War II, a technical report begun circulating among allied scientists: the ‘First Draft of a Report on the EDVAC’, attributed to John von Neumann, described for the first time the design and implementation of the earliest stored-program computer. The ‘First Draft’ became the template followed by subsequent British and American computers, establishing the standard characteristics of most computing machines to date. This article looks at how the material and design choices described in this report influenced architecture, as it set up the technological matrix onto which a discipline relying on a tradition of drawn geometry would be eventually completely remediated. It consists of two parts: first, a theoretical section, analysing the repercussions for architecture of the type of computer laid out in the ‘First Draft’. Second, a description of a design experiment, a sort of information furniture, that tests and exemplifies some of the observations from the first section. This experiment examines the possibilities of an architecture that, moving beyond geometric representations, uses instead the programming of events as its rationale. The structure of this article reflects a methodology in which theoretical formulation and design experiments proceed in parallel. The theoretical investigation proposes concepts that can be tested and refined through design and conversely design work determines and encourages technical, critical and historical research. This relation is dialogical: theoretical investigation is not simply a rationalisation and explanation of earlier design work; inversely, the role of design is not just to illustrate previously formulated concepts. Both design and theorisation are interdependent but autonomous in their parallel development.

Стилі APA, Harvard, Vancouver, ISO та ін.

29

Zhengwei, Zhang, Fan Yangyu, and Zeng Li. "New chaos-based encryption scheme for digital sequence." Journal of Systems Engineering and Electronics 18, no. 4 (December 2007): 698–703. http://dx.doi.org/10.1016/s1004-4132(08)60006-7.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Halewood, Michael, Margo A. Bagley, Markus Wyss, and Amber Hartman Scholz. "New benefit-sharing principles for digital sequence information." Science 382, no. 6670 (November 3, 2023): 520–22. http://dx.doi.org/10.1126/science.adj1331.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Conklin, Darrell, Martin Gasser, and Stefan Oertl. "Creative Chord Sequence Generation for Electronic Dance Music." Applied Sciences 8, no. 9 (September 19, 2018): 1704. http://dx.doi.org/10.3390/app8091704.

Повний текст джерела

Анотація:

This paper describes the theory and implementation of a digital audio workstation plug-in for chord sequence generation. The plug-in is intended to encourage and inspire a composer of electronic dance music to explore loops through chord sequence pattern definition, position locking and generation into unlocked positions. A basic cyclic first-order statistical model is extended with latent diatonicity variables which permits sequences to depart from a specified key. Degrees of diatonicity of generated sequences can be explored and parameters for voicing the sequences can be manipulated. Feedback on the concepts, interface, and usability was given by a small focus group of musicians and music producers.

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Yang, Juan. "Digital Mining Algorithm of English Translation Course Information Based on Digital Twin Technology." Wireless Communications and Mobile Computing 2021 (December 24, 2021): 1–7. http://dx.doi.org/10.1155/2021/9741948.

Повний текст джерела

Анотація:

Cross-language communication puts forward higher requirements for information mining in English translation course. Aiming at the problem that the frequent patterns in the current digital mining algorithms produce a large number of patterns and rules, with a long execution time, this paper proposes a digital mining algorithm for English translation course information based on digital twin technology. According to the results of word segmentation and tagging, the feature words of English translation text are extracted, and the cross-language mapping of text is established by using digital twin technology. The estimated probability of text translation is maximized by corresponding relationship. The text information is transformed into text vector, the semantic similarity of text is calculated, and the degree of translation matching is judged. Based on this data dimension, the frequent sequence is constructed by transforming suffix sequence into prefix sequence, and the digital mining algorithm is designed. The results of example analysis show that the execution time of digital mining algorithm based on digital twin technology is significantly shorter than that based on Apriori and Map Reduce, and the mining accuracy rate reached more than 80%, which has good performance in processing massive data.

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Fontaine, Cadet, and Vetrivel. "Novel Descriptors and Digital Signal Processing- Based Method for Protein Sequence Activity Relationship Study." International Journal of Molecular Sciences 20, no. 22 (November 11, 2019): 5640. http://dx.doi.org/10.3390/ijms20225640.

Повний текст джерела

Анотація:

The work aiming to unravel the correlation between protein sequence and function in the absence of structural information can be highly rewarding. We present a new way of considering descriptors from the amino acids index database for modeling and predicting the fitness value of a polypeptide chain. This approach includes the following steps: (i) Calculating Q elementary numerical sequences (Ele_SEQ) depending on the encoding of the amino acid residues, (ii) determining an extended numerical sequence (Ext_SEQ) by concatenating the Q elementary numerical sequences, wherein at least one elementary numerical sequence is a protein spectrum obtained by applying fast Fourier transformation (FFT), and (iii) predicting a value of fitness for polypeptide variants (train and/or validation set). These new descriptors were tested on four sets of proteins of different lengths (GLP-2, TNF alpha, cytochrome P450, and epoxide hydrolase) and activities (cAMP activation, binding affinity, thermostability and enantioselectivity). We show that the use of multiple physicochemical descriptors coupled with the implementation of the FFT, taking into account the interactions between residues of amino amides within the protein sequence, could lead to very significant improvement in the quality of models and predictions. The choice of the descriptor or of the combination of descriptors and/or FFT is dependent on the couple protein/fitness. This approach can provide potential users with value added to existing mutant libraries where screening efforts have so far been unsuccessful in finding improved polypeptide mutants for useful applications.

Стилі APA, Harvard, Vancouver, ISO та ін.

34

Orthuber, Wolfgang. "We Can Define the Domain of Information Online and Thus Globally Uniformly." Information 13, no. 5 (May 16, 2022): 256. http://dx.doi.org/10.3390/info13050256.

Повний текст джерела

Анотація:

Any information is (transported as) a selection from an ordered set, which is the “domain” of the information. For example, any piece of digital information is a number sequence that represents such a selection. Its senders and receivers (with software) should know the format and domain of the number sequence in a uniform way worldwide. So far, this is not guaranteed. However, it can be guaranteed after the introduction of the new “Domain Vector” (DV) data structure: “UL plus number sequence”. Thereby “UL” is a “Uniform Locator”, which is an efficient global pointer to the machine-readable online definition of the number sequence. The online definition can be adapted to the application so that the DV represents the application-specific, reproducible features in a precise (one-to-one), comparable, and globally searchable manner. The systematic, nestable online definition of domains of digital information (number sequences) and the globally defined DV data structure have great technical potential and are recommended as a central focus of future computer science.

Стилі APA, Harvard, Vancouver, ISO та ін.

35

Patel, Ashish C., and C. G. Joshi. "Deoxyribonucleic Acid as a Tool for Digital Information Storage: An Overview." INDIAN JOURNAL OF VETERINARY SCIENCES AND BIOTECHNOLOGY 15, no. 01 (July 25, 2019): 1–8. http://dx.doi.org/10.21887/ijvsbt.15.1.1.

Повний текст джерела

Анотація:

Current data storage technologies cannot keep pace longer with exponentially growing amounts of data through the extensive use of social networking photos and media, etc. The "digital world” with 4.4 zettabytes in 2013 has predicted it to reach 44 zettabytes by 2020. From the past 30 years, scientists and researchers have been trying to develop a robust way of storing data on a medium which is dense and ever-lasting and found DNA as the most promising storage medium. Unlike existing storage devices, DNA requires no maintenance, except the need to store at a cool and dark place. DNA has a small size with high density; just 1 gram of dry DNA can store about 455 exabytes of data. DNA stores the informations using four bases, viz., A, T, G, and C, while CDs, hard disks and other devices stores the information using 0’s and 1’s on the spiral tracks. In the DNA based storage, after binarization of digital file into the binary codes, encoding and decoding are important steps in DNA based storage system. Once the digital file is encoded, the next step is to synthesize arbitrary single-strand DNA sequences and that can be stored in the deep freeze until use.When there is a need for information to be recovered, it can be done using DNA sequencing. New generation sequencing (NGS) capable of producing sequences with very high throughput at a much lower cost about less than 0.1 USD for one MB of data than the first sequencing technologies. Post-sequencing processing includes alignment of all reads using multiple sequence alignment (MSA) algorithms to obtain different consensus sequences. The consensus sequence is decoded as the reversal of the encoding process. Most prior DNA data storage efforts sequenced and decoded the entire amount of stored digital information with no random access, but nowadays it has become possible to extract selective files (e.g., retrieving only required image from a collection) from a DNA pool using PCR-based random access. Various scientists successfully stored up to 110 zettabytes data in one gram of DNA. In the future, with an efficient encoding, error corrections, cheaper DNA synthesis,and sequencing, DNA based storage will become a practical solution for storage of exponentially growing digital data.

Стилі APA, Harvard, Vancouver, ISO та ін.

36

O’Sullivan, James. "What makes digital humanities, digital?" Boolean: Snapshots of Doctoral Research at University College Cork, no. 2012 (January 1, 2012): 84–88. http://dx.doi.org/10.33178/boolean.2012.19.

Повний текст джерела

Анотація:

While not quite a neologism at this point, the term “digital humanities” for some still bears a significant measure of ambiguity. What separates digital humanities from the humanities? Throughout this article, I will attempt to offer some clarity on this separation, outlining what it is that makes digital humanities, digital. The field of scholarship now recognised as the digital humanities has not always held this particular mantle. Initially, this emerging discipline was referred to as “humanities computing”, a term that gathered momentum as early as the late ‘70s, the evidence for which can be found in a quick n-gram of Google Books. N-grams offer an approach to probabilistic language modelling that can be used for a variety of purposes, in this case, to identify the frequency of a sequence of words in a set of texts. Google Ngram Viewer is not a scholarly tool appropriate for research, but it is ...

Стилі APA, Harvard, Vancouver, ISO та ін.

37

Pan, Yu-Xi, Da-Wei Li, Yun Duan, Zhi-Zhou Zhang, Ming-Qing Xu, Guo-Yin Feng, and Lin He. "Predicting Protein Subcellular Location Using Digital Signal Processing." Acta Biochimica et Biophysica Sinica 37, no. 2 (February 1, 2005): 88–96. http://dx.doi.org/10.1093/abbs/37.2.88.

Повний текст джерела

Анотація:

Abstract The biological functions of a protein are closely related to its attributes in a cell. With the rapid accumulation of newly found protein sequence data in databanks, it is highly desirable to develop an automated method for predicting the subcellular location of proteins. The establishment of such a predictor will expedite the functional determination of newly found proteins and the process of prioritizing genes and proteins identified by genomic efforts as potential molecular targets for drug design. The traditional algorithms for predicting these attributes were based solely on amino acid composition in which no sequence order effect was taken into account. To improve the prediction quality, it is necessary to incorporate such an effect. However, the number of possible patterns in protein sequences is extremely large, posing a formidable difficulty for realizing this goal. To deal with such difficulty, a well-developed tool in digital signal processing named digital Fourier transform (DFT) [1] was introduced. After being translated to a digital signal according to the hydrophobicity of each amino acid, a protein was analyzed by DFT within the frequency domain. A set of frequency spectrum parameters, thus obtained, were regarded as the factors to represent the sequence order effect. A significant improvement in prediction quality was observed by incorporating the frequency spectrum parameters with the conventional amino acid composition. One of the crucial merits of this approach is that many existing tools in mathematics and engineering can be easily applied in the predicting process. It is anticipated that digital signal processing may serve as a useful vehicle for many other protein science areas.

Стилі APA, Harvard, Vancouver, ISO та ін.

38

Kulkarni, Sourabh, Priyanka Verma, and R. Mukundan. "Performance landscape modeling in digital manufacturing firm." Business Process Management Journal 25, no. 3 (June 27, 2019): 533–52. http://dx.doi.org/10.1108/bpmj-11-2017-0333.

Повний текст джерела

Анотація:

PurposeThe purpose of this paper is to update existing Kauffmann’s NK model to evaluate the manufacturing fitness of strategic business capabilities. The updated model is tested in a digital manufacturing (DM) setting to investigate the sequence for developing cumulative capabilities that can yield the maximum payoff.Design/methodology/approachThe authors develop a grey–DEMATEL–NK fitness model and show its application, through a case study, to a DM firm in India.FindingsThe grey–DEMATEL–NK model helps evaluate multiple manufacturing capabilities and indicates that quality–flexibility–cost–delivery is the sequence that yields the maximum manufacturing fitness (competitive payoff) for a DM firm. This sequence helps the firm reorganise its internal business processes and is different from that used to develop cumulative capabilities in a traditional manufacturing setting (quality–delivery–flexibility–cost).Originality/valueThis study presents a pilot model for computing the cumulative capabilities payoff and prescribes a sequence for developing cumulative capabilities within a DM context.

Стилі APA, Harvard, Vancouver, ISO та ін.

39

Sarumi, J. A. "An Android-Based Image Steganography System for Concealing Data and Information Transmission Using Adaptive Image Steganography." Advances in Multidisciplinary and scientific Research Journal Publication 9, no. 2 (June 30, 2021): 19–38. http://dx.doi.org/10.22624/aims/digital/v9n2p6.

Повний текст джерела

Анотація:

The growth in the volume of information transmission and transaction over the internet has necessitated the development and enhancement of measures and techniques required to ensure the safety of critical information during transmission. with developments in mobile technologies and the adoption and diffusion of android mobile devices, research must therefore continue to explore more secured media in which information can be hidden. One of such medium is the use of image carriers referred to as steganography. In tis paper, we provide insughts into the development of an android-based Image Steganography System for concealing data and information using adaptive image steganography. The Least Significant Bit (LSB) algorithm was employed as the algorithmic sequence for the development. Preliminary results from implementation and testing showed promising results Keywords: Android, image steganography, data, information, transmission, images, security

Стилі APA, Harvard, Vancouver, ISO та ін.

40

Gao, Yuan, Zhiqiang Wang, and Jin Wen. "A Method for Generating Geometric Image Sequences for Non-Isomorphic 3D-Mesh Sequence Compression." Electronics 12, no. 16 (August 16, 2023): 3473. http://dx.doi.org/10.3390/electronics12163473.

Повний текст джерела

Анотація:

As virtual reality and 3D-modeling technology continue to advance, the amount of digital geometric media data is growing at an explosive rate. For example, 3D meshes, an important type of digital geometric media, can precisely record geometric information on a model’s surface. However, as the complexity and precision of 3D meshes increase, it becomes more challenging to store and transmit them. The traditional method of compressing non-isomorphic 3D-mesh sequences through frame-by-frame compression is inefficient and destroys the inter-frame correlations of the sequences. To tackle these issues, this study investigates the generation of time-dependent geometric image sequences for compressing non-isomorphic 3D-mesh sequences. Two methods are proposed for generating such sequences: one through image registration and the other through parametrization-geometry cooperative registration. Based on the experimental compression results of the video-coding algorithms, it was observed that the proposed geometric image-sequence-generation method offers superior objective and subjective qualities, as compared to the traditional method.

Стилі APA, Harvard, Vancouver, ISO та ін.

41

Ren, Honge, Walid Atwa, Haosu Zhang, Shafiq Muhammad, and Mahmoud Emam. "Frame Duplication Forgery Detection and Localization Algorithm Based on the Improved Levenshtein Distance." Scientific Programming 2021 (March 31, 2021): 1–10. http://dx.doi.org/10.1155/2021/5595850.

Повний текст джерела

Анотація:

In this digital era of technology and software development tools, low-cost digital cameras and powerful video editing software (such as Adobe Premiere, Microsoft Movie Maker, and Magix Vegas) have become available for any common user. Through these softwares, editing the contents of digital videos became very easy. Frame duplication is a common video forgery attack which can be done by copying and pasting a sequence of frames within the same video in order to hide or replicate some events from the video. Many algorithms have been proposed in the literature to detect such forgeries from the video sequences through analyzing the spatial and temporal correlations. However, most of them are suffering from low efficiency and accuracy rates and high computational complexity. In this paper, we are proposing an efficient and robust frame duplication detection algorithm to detect duplicated frames from the video sequence based on the improved Levenshtein distance. Extensive experiments were performed on some selected video sequences captured by stationary and moving cameras. In the experimental results, the proposed algorithm showed efficacy compared with the state-of-the-art techniques.

Стилі APA, Harvard, Vancouver, ISO та ін.

42

Feng, Gui, and Yi Min Yang. "Adaptive DCT Based Digital Watermarking Scheme." Applied Mechanics and Materials 20-23 (January 2010): 1136–42. http://dx.doi.org/10.4028/www.scientific.net/amm.20-23.1136.

Повний текст джерела

Анотація:

The paper proposes an adaptive digital watermarking scheme based on chaos sequence and DCT transform. The scheme can choose the location for watermark inserting adaptively, and properly assign the embedding intensity in different inserting locations according to the characteristic of human visual system (HVS). On the other hand, this scheme combines chaos sequence and scrambling technique to improve the ability to withstand various attacks. The experimental results show that, the method can basically satisfy transparency and robustness requirement.

Стилі APA, Harvard, Vancouver, ISO та ін.

43

Isakov, O. V., and S. S. Voitusik. "Comparative analysis of digital noise generated by additive Fibonacci generators." Ukrainian Journal of Information Technology 5, no. 1 (2023): 67–76. http://dx.doi.org/10.23939/ujit2023.01.067.

Повний текст джерела

Анотація:

Noise generators and pseudorandom number generators (PRNGs) are widely used in the field of information technology, including cybersecurity, for modeling, authorization key generation, and technical protection of information. It has been found that the characteristics of digital noise directly depend on the chosen PRNG algorithm. To determine the quality of the generated noise, special tests are performed, which are primarily applied to the sequence generated by the PRNG. The results of digital noise generated by an PRNG based on four different algorithms of additive Fibonacci generators (AFG) are investigated. The choice of generators of the same type allowed us to analyze the effect of different modifications on the final result of the generated sequences to determine their advantages and disadvantages. Digital signal processing techniques such as frequency, autocorrelation and visual analysis, signal-to-noise ratio, and statistical tests of the NIST package were used to test the noise and generated sequences. Functions for interpreting the obtained data were developed using the MATLAB (DSP System Toolbox) application package and the C programming language for automating NIST tests. It has been found that for effective testing, specific stages and their sequence should be determined: determination of the PRNG period, statistical tests of the NIST package, calculation of the autocorrelation function, and other methods of digital signal processing. It was found that modification of one AFG by using a carry bit (MAFG2) does not improve the results of the generated sequence, unlike the PIKE algorithm, which consists of three AFGs. The MAFG algorithm showed better results during the period testing and at the same time passed NIST tests, unlike the unmodified version. The dependence between the order of the generated sequences and the results of their autocorrelation function was revealed. It is proposed that, in addition to general statistical tests, applied tests should be carried out when choosing or developing a new generator, its effectiveness should be checked under the conditions required by existing standards and requirements. The compliance of the generated digital noise with the requirements for devices for technical protection of information, namely the protection of speech information, has been established.

Стилі APA, Harvard, Vancouver, ISO та ін.

44

Smeresky, Brendon, Alexa Rizzo, and Timothy Sands. "Kinematics in the Information Age." Mathematics 6, no. 9 (August 27, 2018): 148. http://dx.doi.org/10.3390/math6090148.

Повний текст джерела

Анотація:

Modern kinematics derives directly from developments in the 1700s, and in their current instantiation, have been adopted as standard realizations…or templates that seem unquestionable. For example, so-called aerospace sequences of rotations are ubiquitously accepted as the norm for aerospace applications, owing from a recent heritage in the space age of the late twentieth century. With the waning of the space-age as a driver for technology development, the information age has risen with the advent of digital computers, and this begs for re-evaluation of assumptions made in the former era. The new context of the digital computer defines the use of the term “information age” in the manuscript title and further highlights the novelty and originality of the research. The effects of selecting different Direction Cosine Matrices (DCM)-to-Euler Angle rotations on accuracy, step size, and computational time in modern digital computers will be simulated and analyzed. The experimental setup will include all twelve DCM rotations and also includes critical analysis of necessary computational step size. The results show that the rotations are classified into symmetric and non-symmetric rotations and that no one DCM rotation outperforms the others in all metrics used, yielding the potential for trade space analysis to select the best DCM for a specific instance. Novel illustrations include the fact that one of the ubiquitous sequences (the “313 sequence”) has degraded relative accuracy measured by mean and standard deviations of errors, but may be calculated faster than the other ubiquitous sequence (the “321 sequence”), while a lesser known “231 sequence” has comparable accuracy and calculation-time. Evaluation of the 231 sequence also illustrates the originality of the research. These novelties are applied to spacecraft attitude control in this manuscript, but equally apply to robotics, aircraft, and surface and subsurface vehicles.

Стилі APA, Harvard, Vancouver, ISO та ін.

45

Dou, Sha Sha. "Research on KBE System of Intelligent Digital Prototyping Assembly Sequence Planning Based on NX." Applied Mechanics and Materials 220-223 (November 2012): 30–34. http://dx.doi.org/10.4028/www.scientific.net/amm.220-223.30.

Повний текст джерела

Анотація:

The purposed research joins back-propagation neural network (BPNN) algorithm, using NX/KF second development module to create feasible assembly sequences KBE system access the volume, weight, feature, relationship number and total penalty value, and predict the feasible assembly sequence via a robust BPNN engine.

Стилі APA, Harvard, Vancouver, ISO та ін.

46

Pargellis, A. N. "Digital Life Behavior in the Amoeba World." Artificial Life 7, no. 1 (January 2001): 63–75. http://dx.doi.org/10.1162/106454601300328025.

Повний текст джерела

Анотація:

Amoeba is a computer model designed to facilitate the study of the origin and evolution of digital life. Specifically, an initially disordered system, consisting of random sequences of machine instructions, self-organizes into an ordered system containing self-replicating programs. The current version of Amoeba broadens the original system's capability by using a basis set of 32 machine instructions that is computationally universal. In addition, Amoeba uses a set of 64 address labels, each of which is randomly assigned to a machine instruction each time a sequence is randomly created. This eliminates the constraint that occurs when the complements of predefined codons are used for addressing. A more open-ended system results because programs can now form subroutines that are arranged in an arbitrary manner.

Стилі APA, Harvard, Vancouver, ISO та ін.

47

Hlavičková, Irena. "An application of Markov chains in digital communication." Tatra Mountains Mathematical Publications 63, no. 1 (June 1, 2015): 129–37. http://dx.doi.org/10.1515/tmmp-2015-0025.

Повний текст джерела

Анотація:

Abstract This contribution shows an application of Markov chains in digital communication. A random sequence of the symbols 0 and 1 is analyzed by a state machine. The state machine switches to state “0” after detecting an unbroken sequence of w zero symbols (w being a fixed integer), and to state “1” after detecting an unbroken sequence of w ones. The task to find the probabilities of each of these two states after n time steps leads to a Markov chain. We show the construction of the transition matrix and determine the steady-state probabilities for the time-homogeneous case.

Стилі APA, Harvard, Vancouver, ISO та ін.

48

Wang, Yilin, and Baokuan Chang. "Extraction of Human Motion Information from Digital Video Based on 3D Poisson Equation." Advances in Mathematical Physics 2021 (December 28, 2021): 1–11. http://dx.doi.org/10.1155/2021/1268747.

Повний текст джерела

Анотація:

Based on the 3D Poisson equation, this paper extracts the features of the digital video human body action sequence. By solving the Poisson equation on the silhouette sequence, the time and space features, time and space structure features, shape features, and orientation features can be obtained. First, we use the silhouette structure features in three-dimensional space-time and the orientation features of the silhouette in three-dimensional space-time to represent the local features of the silhouette sequence and use the 3D Zernike moment feature to represent the overall features of the silhouette sequence. Secondly, we combine the Bayesian classifier and AdaBoost classifier to learn and classify the features of human action sequences, conduct experiments on the Weizmann video database, and conduct multiple experiments using the method of classifying samples and selecting partial combinations for training. Then, using the recognition algorithm of motion capture, after the above process, the three-dimensional model is obtained and matched with the model in the three-dimensional model database, the sequence with the smallest distance is calculated, and the corresponding skeleton is outputted as the results of action capture. During the experiment, the human motion tracking method based on the university matching kernel (EMK) image kernel descriptor was used; that is, the scale invariant operator was used to count the characteristics of multiple training images, and finally, the high-dimensional feature space was mapped into the low-dimensional to obtain the feature space approximating the Gaussian kernel. Based on the above analysis, the main user has prior knowledge of the network environment. The experimental results show that the method in this paper can effectively extract the characteristics of human body movements and has a good classification effect for bending, one-foot jumping, vertical jumping, waving, and other movements. Due to the linear separability of the data in the kernel space, fast linear interpolation regression is performed on the features in the feature space, which significantly improves the robustness and accuracy of the estimation of the human motion pose in the image sequence.

Стилі APA, Harvard, Vancouver, ISO та ін.

49

Goslen, Alex, Dan Carpenter, Jonathan Rowe, Roger Azevedo, and James Lester. "Robust Player Plan Recognition in Digital Games with Multi-Task Multi-Label Learning." Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment 18, no. 1 (October 11, 2022): 105–12. http://dx.doi.org/10.1609/aiide.v18i1.21953.

Повний текст джерела

Анотація:

Plan recognition is a key component of player modeling. Player plan recognition focuses on modeling how and when players select goals and formulate action sequences to achieve their goals during gameplay. By occasionally asking players to describe their plans, it is possible to devise robust plan recognition models that jointly reason about player goals and action sequences in coordination with player input. In this work, we present a player plan recognition framework that leverages data from player interactions with a planning support tool embedded in an educational game for middle school science education, CRYSTAL ISLAND. Players are prompted to use the planning tool to describe their goals and planned actions in CRYSTAL ISLAND. We use this data to devise data-driven player plan recognition models using multi-label multi-task learning. Specifically, we compare single-task and multi-task learning approaches for both goal prediction and action sequence prediction. Results indicate that multi-task learning yields significant benefits for action sequence prediction. Additionally, we find that incorporating automated detectors of plan completion in plan recognition models improves predictive performance in both tasks.

Стилі APA, Harvard, Vancouver, ISO та ін.

50

Luthfiasari, Annisa, and Citra Fadillah. "Comparative analysis of kinetic typography elements in movie title sequence." Serat Rupa Journal of Design 7, no. 1 (January 31, 2023): 43–60. http://dx.doi.org/10.28932/srjd.v7i1.5636.

Повний текст джерела

Анотація:

Typography, usually closely related to printed media, has now been explored in digital media. These changes make typography, which is usually static, more dynamic. One example of digital typography is kinetic typography. Typography's position as a medium of visual and textual communication becomes more interesting because the element of motion in kinetic typography adds another meaning value. This study examines how typography reveals meaning in time-based media formats. In this study, three movie title sequences with different genres will be analyzed: Monsters Inc., Se7en, and Mission: Impossible — Ghost Protocol. The film was chosen because it has a dominant kinetic typography structure and has a good reputation in terms of visuals. The method of analysis is carried out by comparing the structure of the three title sequences based on the kinetic typography theory by Bellantoni and Woolman. Furthermore, an analysis of the semantic value of each title sequence was also carried out. This research is aimed to figure out the elements used in the visual creation of a title sequence and how these elements can construct meaning. From the analysis process it is known that each genre of the title sequence has different element variations which of course have their own meaning. The results of this study are expected to provide recommendations for the title sequence design method based on the genre like comedy animation, thriller, and action.

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Digital sequence"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями