Decimal Positions Research Articles

A Novel Whale Optimization Algorithm for the Design of Tuned Mass Dampers under Earthquake Excitations

This paper introduces a novel methodology for the optimum design of linear tuned mass dampers (TMDs) to improve the seismic safety of structures through a novel Whale Optimization Algorithm (WOA). The algorithm is aimed to reduce the maximum horizontal peak displacement of the structure, and the root mean square (RMS) response of displacements as well. Furthermore, four additional objective functions, derived from multiple weighted linear combinations of the two previously mentioned parameters, are also studied in order to obtain the most efficient TMD design configuration. The differential evolution method (DEM), whose effectiveness has been previously demonstrated for TMD applications, and an exhaustive search (ES) process, with precision to two decimal positions, are used to compare and validate the results computed through WOA. Then, the proposed methodology is applied to a 32-story case-study derived from an actual building, and multiple ground acceleration time histories are considered to assess its seismic performance in the linear-elastic range. The numerical results show that the proposed methodology based on WOA is effective in finding the optimal TMD design configuration under earthquake loads. Finally, practical design recommendations are provided for TMDs, and the robustness of the optimization is demonstrated.

Optimal design of tuned mass dampers through differential evolution method for reducing the dynamic response of structures subjected to earthquake loads

This paper introduces a methodology for the optimal design of passive Tuned Mass Dampers (TMDs) to control the dynamic response of buildings subjected to earthquake loads. The selection process of the optimal design parameters is carried out through a metaheuristic approach based on differential evolution (DE) which is a fast, efficient, and precise technique that does not require high computational efforts. The algorithm is aimed to reduce the maximum horizontal peak displacement of the structure and the root mean square (RMS) response of displacements as well. Furthermore, four more objective functions derived from multiple weighted linear combinations of the two previously mentioned parameters are also studied to obtain the most efficient TMD design configuration. A parallel process based on an exhaustive search (ES) with precision to 2 decimal positions is used to validate the optimization methodology based on DE. The proposed methodology is then applied to a 32-story case-study derived from an actual building structure and subjected to different ground acceleration registers. The best dynamic performance of the building is observed when the greatest weight is given to the RMS response of displacement in the optimization process. Finally, the numerical results reveal that the proposed methodology based on DE is effective in finding the optimal TMD design configuration by reducing the maximum floor displacement up to 4% and RMS values of displacement of up to 52% in the case-study building.

A cognitive model for multidigit number reading: Inferences from individuals with selective impairments

We propose a detailed cognitive model of multi-digit number reading. The model postulates separate processes for visual analysis of the digit string and for oral production of the verbal number. Within visual analysis, separate sub-processes encode the digit identities and the digit order, and additional sub-processes encode the number's decimal structure: its length, the positions of 0, and the way it is parsed into triplets (e.g., 314987 → 314,987). Verbal production consists of a process that generates the verbal structure of the number, and another process that retrieves the phonological forms of each number word. The verbal number structure is first encoded in a tree-like structure, similarly to syntactic trees of sentences, and then linearized to a sequence of number-word specifiers. This model is based on an investigation of the number processing abilities of seven individuals with different selective deficits in number reading. We report participants with impairment in specific sub-processes of the visual analysis of digit strings – in encoding the digit order, in encoding the number length, or in parsing the digit string to triplets. Other participants were impaired in verbal production, making errors in the number structure (shifts of digits to another decimal position, e.g., 3,040 → 30,004). Their selective deficits yielded several dissociations: first, we found a double dissociation between visual analysis deficits and verbal production deficits. Second, several dissociations were found within visual analysis: a double dissociation between errors in digit order and errors in the number length; a dissociation between order/length errors and errors in parsing the digit string into triplets; and a dissociation between the processing of different digits – impaired order encoding of the digits 2–9, without errors in the 0 position. Third, within verbal production, a dissociation was found between digit shifts and substitutions of number words. A selective deficit in any of the processes described by the model would cause difficulties in number reading, which we propose to term “dysnumeria”.

Character Analysis Scheme for Compressing Text Files

achieved by taking each of these characters that makes up the text one at a time and then search first, for the position of the last occurrence of a particular character being considered for compression together with the length of its digits, and then, starting from the beginning of the text file, note all the positions where this character has occurred. The positions of occurrence of this character while the search is on, is made equal to the length of the digit of the last occurrence of the character by padding it with zeroes to the left of the most significant bit, if need be. Concatenate the values representing the positions of the occurrence of a character and covert the concatenated string into a decimal value. Divide this value successively by 2 until the result lies between one and less than two. Store the quotient obtained from these divisions and the sum of the number of times the division was carried out as an index k. Decompression is the reverse of the steps just described, and this is achieved by taking each character; obtained their corresponding quotient (q), index k and length li. To recover the decimal positions of the concatenated values, we multiply the quotient (q) by 2 k . We then use the length of this

Brouwer's Conception of Truth

In this paper it is argued that the understanding of Brouwer as replacing truth conditions with assertability or proof conditions, in particular as codified in the so-called Brouwer-Heyting-Kolmogorov Interpretation, is misleading and conflates a weak and a strong notion of truth that have to be kept apart to understand Brouwer properly: truth-as-anticipation and truth-in-content. These notions are explained, exegetical documentation provided and semi-formal recursive definitions are given. Consider the sequence γ = {cn}, where cn is defined to be equal to (−1/2)k1 if k1 is smaller than n and the sequence 0123456789 appears for the first time in the decimal expansion of π with the 0 at the kth 1 decimal position, and equal to (−1/2)n if there is no such k1. Then define r to be limn→∞ cn. Brouwer [1924a] claims that the proposition that r equals 0, is neither true nor false. It would only be true if we had a proof that there are no 0123456789-sequences in the decimal expansion of π, and it would only be false if we knew of such a sequence.1 Assuming that it is true or false in the absence of such knowledge amounts to assuming that the decimal expansion of π has extra-mental existence. When making such a claim, which notion of truth does Brouwer apply as his alternative to the rejected Platonic notion? The answer to this (purely exegetical) question is the goal of this paper. (Or perhaps more accurately: it is an attempt at a rational reconstruction.) Before I present what I think is the correct interpretation of Brouwer, I will discuss and reject three other interpretations that have been made or could be made of his writings. I do not do this with a merely negative aim, but because my interpretation combines elements from those three and is, therefore, best understood and motivated by comparison with them. The first interpretation is that what is true can only be so because of what has actually been constructed. The second is that not only actual but also all potential constructions can serve as truth makers. (These first two options are quite naive and are not serious contenders but they serve the purpose of stage setting.) And the third is that truth is equated with proof. This third We actually do today: there is a 0123456789-sequence beginning at decimal number 17,387,594,880 as well as at several other, later positions [Wells, 1986]. But as Brouwer [1951b] points out there will probably always be an ample supply of other examples that can be used instead. Hence, this is not really relevant, so we will just stick to Brouwer’s example.

WEIGHTED ALIGNMENT FREE DISSIMILARITY METRIC FOR PROMOTER SEQUENCE COMPARISON

Comparative sequence analysis has been a powerful tool in bioinformatics which interprets knowledge about the functionality of a sequence, making use of its structural information. Among the non coding regions of DNA, the comparison of promoter sequences has received a great deal of attention in medical science as promoter regions play a crucial role in gene regulation. In this work we propose an alignment free sequence comparison metric for comparison of promoter sequences. We use the binary and decimal position specific motif matrices (PSMM) of the promoters which were created for our experiments using the TFSEARCH tool. Simple weighted algorithm is used to compute the dissimilarity between the PSMMs of promoter sequences, thereby analyzing its underlying homology and functionality. The NCBI database was used to obtain the promoter sequences of 500 nucleotides upstream the transcription start site (TSS) of enzyme pyruvate kinase (PKLR) from the glycolysis pathway of different organisms for one experiment and all the enzymes from the glycolysis pathway of organism human for the other. The proposed dissimilarity metric is successful in bringing out differences on both the datasets and the results regarding similarities and differences in promoter sequences could be essential to have a clear knowledge of transcription regulation process in different organisms.The results reveal some useful findings which can be extended for a broader investigation.

Low area/power decimal addition with carry-select correction and carry-select sum-digits

We improve a carry-select technique for decimal adders, where pairs of corrective carry-out bits for all decimal positions are computed in parallel. Selection is based on the corresponding positional carry-in bits, which are produced by a quaternary parallel prefix carry network. Carry-out bits select pairs of corrected or intact sum-digits to be later selected by actual carry-in bits at the end of addition process. Analytical evaluation and synthesis results for various hardware sharing architectures on binary, decimal, adders, and subtractors show lower area consumption and less power dissipation of the proposed designs at no additional latency, compared to previous works.

Memorization and recall of very long lists accounted for within the Long-Term Working Memory framework

In a recent paper, Hu, Ericsson, Yang, and Lu (2009) found that an ability to memorize very long lists of digits is not mediated by the same mechanisms as exceptional memory for rapidly presented lists, which has been the traditional focus of laboratory research. Chao Lu is the holder of the Guinness World Record for reciting the most decimal positions of pi, yet he lacks an exceptional memory span for digits. In the first part of this paper we analyzed the reliability and structure of his reported encodings for lists of 300 digits and his application of the story mnemonic. Next, his study and recall times for lists of digits were analyzed to test hypotheses about his detailed encoding processes, and cued-recall performance was used to assess the structure of his encodings. Three experiments were then designed to interfere with the uniqueness of Chao Lu’s story encodings, and evidence was found for his remarkable ability to adapt his encoding processes to reduce the interference. Finally, we show how his skills for encoding and recalling long lists can be accounted for within the theoretical framework of Ericsson and Kintsch’s (1995) Long-Term Working Memory.

Suitable Density Determination for Heavy Hydrocarbons by Solution Pycnometry: Virgin and Thermal Cracked Athabasca Vacuum Residue Fractions

Density is an important parameter for understanding molecular packing, stability, and reactivity of petroleum fractions. The determination of density for extremely viscous residual fractions measured at high temperature (reduced viscosity) is difficult and prone to error if results are extrapolated to lower temperature ranges. This problem is addressed in the present study with fractions derived from virgin and visbroken Athabasca vacuum residua. Solution pycnometry (toluene solvent) was studied and demonstrated a feasible, fast, simple, and reliable technique, applicable to a wide variety of petroleum materials, including asphaltenes and vacuum residua. Reported densities were affected to the third decimal position [American Petroleum Institute (API) gravities found reliable to ±0.15° API]. The density for mixtures of residual oil fractions was determined to be an additive property. Athabasca vacuum residue solvent deasphalting and thermal cracked fractions are studied. Thermal cracking was observed to i...

Bacterial Foraging Algorithm for Null Synthesizing of Linear Antenna Arrays by Controlling Only the Element Positions

A method based on the bacterial foraging algorithm (BFA) for the pattern synthesis of linear antenna arrays with the prescribed nulls is presented. Nulling of the pattern is achieved by controlling only the element positions. The BFA is a new evolutionary computing technique, based on the foraging behavior of Escherichia (E) coli bacteria in a human intestine. Simulation results for Chebyshev patterns with the imposed single, multiple and broad nulls are given to show the effectiveness of the proposed method. For practical consideration, due to small variations of the element positions, the sensitivity of the produced patterns is also examined by rounding the element position values to the second decimal position.

Intranasal Mometasone Furoate Alleviates the Ocular Symptoms Associated with Seasonal Allergic Rhinitis: Results of a Post Hoc Analysis

Background: Burdensome symptoms of allergic rhinitis (AR) include nasal and ocular symptoms such as itching, tearing and redness. Intranasal corticosteroids are efficacious in the treatment of nasal symptoms of AR. Objective: It was the aim of this study to determine the efficacy of the intranasal corticosteroid mometasone furoate nasal spray (MFNS) in relieving ocular symptoms associated with seasonal AR (SAR). Methods: Ocular symptom data were analyzed for subjects ≧12 years of age, randomized to MFNS 200 µg q.d. (n = 176) or placebo (n = 177) in a placebo-controlled, double-blind clinical trial. Post hoc efficacy analysis assessed the mean change from baseline in subject-reported total ocular symptom scores (TOSS) averaged over the treatment period. Results: Mean baseline TOSS was 4.91 for the MFNS group and comparable (5.05) for the placebo group – combined average for individual symptoms such as itching, tearing and redness ranged from 0 (no symptoms) to 9 (all symptoms, severe). Mean change from baseline in TOSS averaged over days 1–15 was –1.42 for the MFNS group and –0.94 for the placebo group (p = 0.02), for an observed treatment difference of 0.49 (statistical data rounded to 2 decimal positions). Improvement in individual symptoms (eye itching, tearing and redness) contributed to this treatment effect; the greatest improvement occurred with tearing, which decreased –0.52 from the baseline score 1.59 in the MFNS group and –0.31 from 1.67 in those receiving placebo (p < 0.01), for an observed treatment difference of 0.21. Treatment with MFNS was safe and well tolerated. Conclusion: MFNS is effective in reducing ocular symptoms of SAR, in addition to its established efficacy in reducing nasal symptoms of SAR.

Method for automatically rounding data on the Wang 2200 in basic computer language

The method described permits any set of numbers within an allowable range to be rounded to any number of significant figures. This is accomplished by generation of an array (rounding position) data bank, which is unique for each combination of the following variables: (1) Chosen decimal position; (2) number range of the number to be rounded; and (3) number of significant figures to which this number is to be rounded. It is especially useful as a subroutine in programs that generate large quantities of figures (such as reserve or resource tonnages) that require rounding.

Microcomputer interface for computer-assisted enzyme kinetic studies with uv-vis spectrophotometers

A simple microcomputer interface, consisting of only three integrated chips, for the input of digitized data from a uv-vis spectrophotometer is described. The interface multiplexes four binary-coded decimal digits, four possible decimal point positions, and an algebraic sign into a single eight-bit parallel input port of the microcomputer. The interface design is also adaptable in a general fashion to any analytical instrument which can present digitized data, with the expansion capability of accommodating more than the number of digits and decimal positions noted in this specific example. Software developed specifically to drive the interface and several general applications to computer-assisted kinetic studies are discussed.

Matrix Inversion with the Square Root Method

A modification of the square root method of matrix inversion has been recently advocated. The present paper shows the conditions under which the original method, or the proposed modification, is preferred by comparing the round off error of the two methods when calculations are to be made to a fixed number of decimals with a desk calculator. The paper recommends the discontinuance of the use of incomplete numbers in reporting results where calculations on approximate numbers are made to a fixed decimal position.

The Remington Rand Type 409-2 Electronic Computer

The Remington Rand Electronic Computer, Type 409-2, does computations by arithmetic steps in sequence with a unique self-proving feature. Parallel inputs to ten vacuum-tube decades are added or directly subtracted into a 22-column Accumulator. The Accumulator is connected in a ring so that a number or pair of numbers can be shifted to any position. Decimal positions are automatically handled by a Decimal Computer. Signs are handled algebraically. The total electron tube complement includes 1476 vacuum tubes and 1128 cold-cathode gas diodes. Most of these are designed and manufactured especially for computer use. Inputs are brought to the Accumulator, using a Call Line for each complete number, from three types of storage: 1. Variables from a tabulating card reading block of Sensing Switches; 2. Constants from manually settable Constant Switches; and 3. Intermediate results from Storage Relays. Outputs are delivered to Punching Storage from Intermediate Storage, in one or two blocks. Results are punched into the same tabulating card or following cards, as may be desired. Programming is directed by interchangeable Plug Boards. There are 40 Calculating Steps and 6 special steps: Clear, Set I, Set II, Sort I, Sort II and Trip. Each Calculating Step has 5 addresses and a process designation: 1st Operand; Process (+, -,×,÷); 2nd Operand; Result; Next Step if Result is plus; and next step if Result is minus.