As abstractions of Terwilliger algebras, generalized Terwilliger algebras and varietal Terwilliger algebras have been studied in 5,6,17. In general, it is difficult to determine the structure of a ...varietal Terwilliger algebra. As proposed in the concluding remarks in 4, in this paper we study the structures of those varietal Terwilliger algebras arising from the wreath products of rank two association schemes. In particular, we give the explicit formulas for their central primitive idempotents. Applications to Terwilliger algebras of association schemes are also discussed, and an affirmative answer to the Terwilliger conjecture mention in 4 is given.
The main purpοse οf imprοving and varying cοst calculatiοn methοds in the machine building industry is tο make them mοre οperatiοnal and efficient in supplying the infοrmatiοn necessary tο the ...management in taking its decisiοns. The present cοst calculatiοn methοds used in the machine building plants – glοbal methοd and the methοd per οrders – by which a histοrical cοst is determined a pοsteriοri used in deducting and pοst factum justificatiοn οf manufacturing expenses dοes nοt οffer the management the pοssibility tο fully satisfy its need fοr infοrmatiοn. We are talking abοut a change οf cοnceptiοn in applying certain systems, methοds and wοrk techniques, accοrding tο the needs οf efficient administratiοn οf prοductiοn and the plant seen as a whοle. The standard-cοst methοd best answers tο the needs οf the effective management οf the value side οf the manufacturing prοcess and raising ecοnοmic efficiency. We cοnsider that, in the machine building industry, these οbjectives can be achieved by using the standard - sοle cοst alternative οf the standard-cοst methοd.
A Monte Carlo model of steady-state light transport in multi-layered tissues (MCML) has been coded in ANSI Standard C; therefore, the program can be used on various computers. Dynamic data allocation ...is used for MCML, hence the number of tissue layers and grid elements of the grid system can be varied by users at run time. The coordinates of the simulated data for each grid element in the radial and angular directions are optimized. Some of the MCML computational results have been verified with those of other theories or other investigators. The program, including the source code, has been in the public domain since 1992.
In this study, the authors investigate the linear minimum-mean-square-error beamforming design for relay-assisted cloud radio access network (C-RAN). A standard C-RAN architecture separates baseband ...processing units and wireless radio units in order to save energy cost. To further enhance network coverage, several relay nodes (RNs) are also deployed. Regrading the per-antenna power constraints at both of the remote radio heads (RRHs) and the RNs in the author's work the beamforming matrices at the RRHs and RNs are ‘jointly’ optimised for the considered relay assisted C-RAN. The considered optimisation problem is a non-convex and multiple variable optimisation problem which is in general very hard to solve. In order to make the design suitable for large scale networks exploiting to the problem structure a novel two stage decomposition algorithms are proposed. Finally, a detailed mean-square-error performance comparison is given by the simulations.
A convolution program (CONV) solving responses to a collimated finite diameter photon beam perpendicularly incident on a multi-layered tissue has been coded in ANSI Standard C, hence, the program can ...be executed on various computers. The program, employing an extended trapezoidal rule for integration, convolves the responses to an infinitely narrow photon beam computed by a companion program (MCML). Dynamic data allocation is used for CONV as well as MCML, therefore, the number of tissue layers and grid elements of the grid system can be varied at run time. The potential error due to not scoring the first photon-tissue interactions separately is illustrated. The program, including the source code, has been in the public domain since 1992 and can be downloaded from the web site at http://biomed.tamu.edu/~lw.
This paper presents theory and algorithms for the synthesis of standard C-implementations of speed-independent circuits. These implementations are block-level circuits which may consist of atomic ...gates to perform complex functions in order to ensure hazard freedom. First, we present Boolean covering conditions that guarantee that the standard C-implementations operate correctly. Then, we present two algorithms that produce optimal solutions to the covering problem. The first algorithm is always applicable, but does not complete on large circuits. The second algorithm, motivated by our observation that our covering problem can often be solved with a single cube, finds the optimal single-cube solution when such a solution exists. When applicable, the second algorithm is dramatically more efficient than the first, more general algorithm. We present results for benchmark specifications which indicate that our single-cube algorithm is applicable on most benchmark circuits and reduces run times by over an order of magnitude. The block-level circuits generated by our algorithms are a good starting point for tools that perform technology mapping to obtain gate-level speed-independent circuits.
PDF
