Table Look Research Articles

Low-density and high-density asymmetric CT-burst correcting integer codes

<p style='text-indent:20px;'>Two classes of integer codes correcting low-density and high-density asymmetric CT-bursts within a <inline-formula><tex-math id="M1">\begin{document}$ b $\end{document}</tex-math></inline-formula>-bit byte have been presented here. Unlike the previously studied integer codes correcting burst errors, here we study such codes with weight constraint on the burst. The proposed codes are compared with similar integer codes in terms of various properties, viz. memory consumption and number of table look ups. This article winds up with an idea of determining the probability of erroneous decoding and an approach for undetected error probability.</p>

Rapid computation of single PET scan rest-stress myocardial blood flow parametric images by table look up.

We have recently reported a method for measuring rest-stress myocardial blood flow (MBF) using a single, relatively short, PET scan session. The method requires two IV tracer injections, one to initiate rest imaging and one at peak stress. We previously validated absolute flow quantitation in ml/min/cc for standard bull's eye, segmental analysis. In this work, we extend the method for fast computation of rest-stress MBF parametric images. We provide an analytic solution to the single-scan rest-stress flow model which is then solved using a two-dimensional table lookup method (LM). Simulations were performed to compare the accuracy and precision of the lookup method with the original nonlinear method (NLM). Then the method was applied to 16 single scan rest/stress measurements made in 12 pigs: seven studied after infarction of the left anterior descending artery (LAD) territory, and nine imaged in the native state. Parametric maps of rest and stress MBF as well as maps of left (fLV ) and right (fRV ) ventricular spill-over fractions were generated. Regions of interest (ROIs) for 17 myocardial segments were defined in bull's eye fashion on the parametric maps. The mean of each ROI was then compared to the rest (K1r ) and stress (K1s ) MBF estimates obtained from fitting the 17 regional TACs with the NLM. In simulation, the LM performed as well as the NLM in terms of precision and accuracy. The simulation did not show that bias was introduced by the use of a predefined two-dimensional lookup table. In experimental data, parametric maps demonstrated good statistical quality and the LM was computationally much more efficient than the original NLM. Very good agreement was obtained between the mean MBF calculated on the parametric maps for each of the 17 ROIs and the regional MBF values estimated by the NLM (K1mapLM =1.019×K1ROINLM +0.019, R2 =0.986; mean difference=0.034±0.036mL/min/cc). We developed a table lookup method for fast computation of parametric imaging of rest and stress MBF. Our results show the feasibility of obtaining good quality MBF maps using modest computational resources, thus demonstrating that the method can be applied in a clinical environment to obtain full quantitative MBF information.

AES Based Text Encryption Using 12 Rounds with Dynamic Key Selection

Data security has a major role in the development of communication system, where more randomization in the secret keys increases the security as well as the complexity of the cryptography algorithms. In the recent years network security has become an important concern. Cryptography plays a vital role in the information security system against various attacks. Efficient and newer versions of cryptography techniques can help to reduce this security threat. The Advanced Encryption Standard is a strong symmetric key cryptographic algorithm which uses a number of table look ups to increase its performance. The Cache Timing Attack correlates the timing details for encryption under a known key with an unknown key to infer the unknown key. This paper proposes an extension of a public-key cryptosystem to support a private key cryptosystem which is a combination of Advanced Encryption Standard and ECC. The past results have been computed on the basis of AES key length as 128 bit and no. of iterations as 10.To increase competency and to minimize drawbacks this paper proposes a hybrid encryption scheme. The parameters to be studied will primarily focus on the key length, no. of iterations and the type of side channel attack to be implemented. The key length for this work has been increased to 192 bit and the no. of iterations taken will be 12.

A Quick Tables Look-up Optimization Algorithm for CAVLC Decoding

In this paper, a quick table look-up optimization algorithm is presented to solve the problems of long table look-up time for CAVLC decoding in H.264/AVC. The achievement of the new algorithm rests that we make full use of the hash table query and index technology to improve the table look-up speed for CAVLC decoding. The basic idea of the new algorithm is that we take the number of zero in code prefix calculated from input bit-stream as index key of the first level, the value of codeword suffix as index key of the second level, then through index key of the one and second index key above, we can quickly get the decoded codeword located in the third level in a hash table built, which can reduce a lot of table look-up time for CAVLC decoding in H.264/AVC. The simulation results show that our proposed schemes based on hash-index method can reduce about 40% table look up time for CAVLC decoding compared with TLSS method, without degrading video quality.

Davies on Easy Knowledge

Stewart Cohen considers a case where his son wants a red table for his room. Cohen and his son go to the furniture store. Cohen’s son is concerned that the table his father is considering purchasing, which appears red, may in fact be white with red lights shining on it. Cohen responds with the following reasoning: (WARRANT FOR 1) The table looks red. (EK) (1) The table is red. (2) If the table is red, then it is not white with red lights shining on it. (3) The table is not white with red lights shining on it. If one reasons thus, say one’s engaged in (EK)-reasoning. Cohen finds such a response unsatisfactory. It is not a way of coming to know (3)—it is too easy. And structurally similar reasoning delivers (knowledge of) the falsity of sceptical hypotheses concerning the external world, testimony, other minds etc. So the unsatisfactoriness threatens to generalise. I consider Martin Davies’s attempt to diagnose this unsatisfactoriness and find it incomplete. I then attempt to remedy the incompleteness in Davies’s attempt.

Dynamic MPLS With Feedback

Multiprotocol Label Switching (MPLS) fasten the speed of packet forwarding by forwarding the packets based on labels and reduces the use of routing table look up from all routers to label edge routers(LER) , where as the label switch routers (LSRs) uses Label Distribution Protocol (LDP) or RSVP (Resource reservation Protocol) for label allocation and Label table for packet forwarding . Dynamic protocol is implemented which carries a Updates packets for the details of Label Switch Paths, along with this feedback mechanism is also introduced which find the shortest path among MPLS network and also feedback is provided which also help to overcome congestion, this feedback mechanism is on a hop by hop basis rather than end to end thus providing a more reliable and much faster and congestion free path for the packets .

Penerapan Logika Fuzzy Dalam Pemodelan Perkiraan Tingkat Inflasi Di Indonesia

Modeling for inflation rate in Indonesia was done by some researcher with conventional model. The conventional model can not be applied if the data are linguistic variables. Fuzzy system can be used to overcome the weak of this method. The goal of this research is to establish the model for forecasting inflation rate in Indonesia based on fuzzy time series data. In this research, forecasting inflation rate use table look up scheme method based on multivariate fuzzy time series data. This research is done by the following steps: 1) determine input-output data; 2) determine fuzzification for input-output data; 3) determine fuzzy rules base by table lookup scheme method; 4) construct fuzzy inference engine; 5) construct defuzzification; 6) construct fuzzy system for modeling inflation rate in Indonesia; 7) determine validation for model used MSE criteria. The results of this research are 1) we develop 8 fuzzy models; 2) The model with Gaussian membership function, minimum inference engine, 25 fuzzy rules has minimum MSE value, 5.5671. Therefore this model can be used to predict inflation rate in Indonesia based on inflation previously , credit interest rate, money supply, gross national product and exchange rate of Rupiah.

What Does a Random Contingency Table Look Like?

LetR= (r1, . . .,rm) andC= (c1, . . .,cn) be positive integer vectors such thatr1+ ⋯ +rm=c1+ ⋯ +cn. We consider the set Σ(R,C) of non-negativem×ninteger matrices (contingency tables) with row sumsRand column sumsCas a finite probability space with the uniform measure. We prove that a random tableD∈ Σ(R,C) is close with high probability to a particular matrix (‘typical table’)Zdefined as follows. We letg(x) = (x+ 1)ln(x+ 1) −xlnxforx≥ 0 and letg(X) = ∑i,jg(xij) for a non-negative matrixX= (xij). Theng(X) is strictly concave and attains its maximum on the polytope of non-negativem×nmatricesXwith row sumsRand column sumsCat a unique point, which we call the typical tableZ.

FE-Based Modeling of Single-Phase Distribution Transformers With Winding Short Circuit Faults

This paper presents a fast and accurate phase variable model of single-phase distribution transformers with internal winding short circuit faults. The flux linkages of windings (including the winding formed with the shorted winding turns) are used as the phase variables. Their variation with the winding currents is used to represent the nonlinear magnetization of the iron core. The flux linkage variation is obtained from the solutions of a series of FE computation, covering the full operation range of the transformer with short circuit faults. It is described using tables and utilized by table look up in the developed model. An equivalent magnetizing current is defined to reduce the number of the FE computations for building the flux linkage tables. The implementation of the proposed FE-based model is studied and the verification is performed. Also, the application examples are presented

Stabilizing periodic orbits of chaotic systems using fuzzy control of Poincaré map

In this paper a fuzzy control algorithm is used to stabilize the fixed points of a chaotic system. No knowledge of the dynamic equations of the system is needed in this approach and the whole system is considered as a black box. Two main approaches have been investigated: fuzzy clustering and table look up methods. As illustrative examples these methods have been applied to Bonhoeffer van der Pol oscillator and the Henon chaotic system and the convergence toward fixed points is observed.

Provide Structure for Children With Learning and Behavior Problems

Establish clear physical and visual boundaries: Children with learning and behavior problems are better able to understand what is expected of them when there is a specific context to a room or table (i.e., physical education takes place in the gym, snack activities are always eaten at the round table, centers are used for reading, etc.). If an area is used for more than one activity, change the way the area or table looks (e.g., cover the table with a table cloth for snack and uncover it for math).

Constitutional Court Statistics for the 2003 Term

This note provides some descriptive statistics on the work of the Constitutional Court in the past year, organised in eight tables. A ninth table looks at the expected terms of the judges of the Court. The method of constructing each table is given in the text following the table. The objectives and methods of this annual set of statistics are more fully laid out in the 1995 edition and subsequent editions of this journal.

Defamation Cases against Historians

Defamation is the act of damaging another’s reputation. According to recent legal research, defamation laws may be improperly used in many ways. Some of these uses profoundly affect the historian’s work: first, when defamation laws protect reputations of states or nations as such; second, when they prevent legitimate criticism of officials; and, third, when they protect the reputations of deceased persons. The present essay offers two tests of these three abuses in legal cases where historians were defendants. The first test, a short worldwide survey, confirms the occurrence of all three abuses; the second test (an empirical analysis of twenty–one cases (1965–2000) from nine western European countries) the occurrence of the third abuse. Both tests touch on problems central to the historical profession: living versus deceased persons; facts versus opinions; legal versus historical truth; the relationship between human dignity, reputation, and privacy; the role of politicians, veterans, and Holocaust deniers as complainants; the problem of amnestied crimes. The second test—the results of which are based on verdicts, commentaries, and press articles, and presented in a synoptic table—looks closely into the complainants’ and defendants’ profiles, the allegedly defamatory statements themselves, and the verdicts. All statements deemed defamatory were about such contemporary events as World War II (particularly war crimes, collaboration, and resistance) and colonial wars. Both tests amount to two conclusions. The first one is about historians’ professional rights and obligations: historians should make true, but privacy–sensitive or potentially offending, statements only when the public interest is served; otherwise, they should have a right to silence. The second conclusion concerns defamation itself: defamation cases and threats to sue in defamation have a chilling effect on the historical debate; they are often but barely veiled attempts at censorship.

Inversion methods for physically‐based models

Physically‐based models of vegetation reflectance serve as a basis for extracting vegetation variables using directional and spectral data from modern‐borne sensors (e.g., MODIS, MISR, POLDER, SeaWiFS). Although many models have been inverted, only recently have significant efforts been made to provide operational algorithms. These efforts have exposed a need to significantly improve efficient and accurate methods for inverting these physically‐based models. The characteristics of the traditional inversion, table look‐up, neural network and other methods are discussed as well as the major achievements, advantages/disadvantages, and research issues for each method. The traditional inversion methods using repeated model runs are computationally intensive and are not appropriate for operational application on a per pixel basis for regional and global data. Thus, for larger data sets, simplified (reduced number of variables and/or physical processes) physically‐based models are generally used. The table look‐...

Active memory

This paper describes the active memory abstraction for memory-system simulation. In this abstraction---designed specifically for on-the-fly simulation, memory references logically invoke a user-specified function depending upon the reference's type and accessed memory block state. Active memory allows simulator writers to specify the appropriate on each reference, including no action for the common case of cache hits. Because the abstraction hides implementation details, implementations can be carefully tuned for particular platforms, permitting much more efficient on-the-fly simulation than the traditional trace-driven abstraction.Our SPARC implementation, Fast-Cache, executes simple data cache simulations two or three times faster than a highly-tuned trace-driven simulator and only 2 to 7 times slower than the original program. Fast-Cache implements active memory by performing a fast table look up of the memory block state, taking as few as 3 cycles on a SuperSPARC for the no-action case. Modeling the effects of Fast-Cache's additional lookup instructions qualitatively shows that Fast-Cache is likely to be the most efficient simulator for miss ratios between 3% and 40%.

Active memory

This paper describes the active memory abstraction for memory-system simulation. In this abstraction---designed specifically for on-the-fly simulation, memory references logically invoke a user-specified function depending upon the reference's type and accessed memory block state. Active memory allows simulator writers to specify the appropriate action on each reference, including "no action" for the common case of cache hits. Because the abstraction hides implementation details, implementations can be carefully tuned for particular platforms, permitting much more efficient on-the-fly simulation than the traditional trace-driven abstraction.Our SPARC implementation, Fast-Cache, executes simple data cache simulations two or three times faster than a highly-tuned trace-driven simulator and only 2 to 7 times slower than the original program. Fast-Cache implements active memory by performing a fast table look up of the memory block state, taking as few as 3 cycles on a SuperSPARC for the no-action case. Modeling the effects of Fast-Cache's additional lookup instructions qualitatively shows that Fast-Cache is likely to be the most efficient simulator for miss ratios between 3% and 40%.

Test of in situ measurements of atmospheric aerosols and trace gases by long path transmission spectroscopy

Transmission measurements were performed using lamp and receiver of a commercial DOAS instrument at a path length of 729 m, which allows to measure aerosol parameters and trace gas concentrations simultaneously over the same air volume. Inversion of the spectral data were performed by the “table look up” method developed by Box and Lo (Box et al., 1976). Measurements for hazy weather situations were compared with results obtained using a Differential Mobility Particle Sizer and a 8 stage Low Pressure Impactor and showed reasonable agreement. As a preliminary result simultaneous measurements of the CH 2O concentration and the total volume of wet aerosols are presented.

Language performance in computing table look- up auxiliaries on microcomputers

Microcomputers are increasingly employed in modelling and, with their growth in usage, new versions of well-known simulation languages have been developed for small computers. However, the use of third-generation programming languages in simulation abides. A pivotal area in terms of machine performance in modelling continous, nonlinear systems is efficiency in auxiliary functions for table look-up. Here, benchmark models written in five languages are discussed representing translation/runtime performance using contrasting algorithmic styles described earlier.

Hyper active.

You know what they say about too many cooks! Well, here all the students appear to be having a go - but at what is left to the imagination as the operating table looks far too small for a patient.

A physical parametric transistor model for CMOS circuit simulation

A transistor model for use in simulation of analog and digital CMOS circuits is described. This model treats inversion devices and normally off accumulation devices individually. The analysis, based on surface potential, is carried out in voltage space. Single expressions for drain current and terminal charges are obtained that conserve charge and give accurate DC, AC, and transient solutions. Derivatives of current and charges are continuous, thus removing a major source of nonconvergence in circuit simulation. The model precalculates and stores charge densities, requiring significantly less computer memory than table look up methods while still describing devices with arbitrary channel width-to-length ratios. The need for measuring device capacitance is eliminated because terminal charge and capacitance are computed from the same parameters that are used to compute drain current. Because the parameters are physical, the model can be used to monitor and predict the effect of process changes. The model has been implemented in the SPICE circuit simulation program and a variety of typical devices and circuits have been simulated successfully. CPU time requirements are comparable to the existing SPICE model. >