Song liao shan ren shi chu ji : 10 juan /

Double leaves, oriental style, in case.

Ling fen guan shi chu ji : 4 juan, er ji : 10 juan, san ji : 4 juan.

Double leaves, oriental style, in case.

Qin ding bing bu chu fen ze li : San shi jiu juan.

Double leaves, oriental style, in case.

Guo chao quan Min shi lu chu ji : er shi yi juan, chu ji xu : shi yi juan /

Nei feng you shang: Jiaqing geng shen nian juan, zuo xia: Zhu Han ju cang ban.

Yi su tang cong shu chu bian : shi qi zhong /

Nei feng you shang juan: Jiaqing wu yin kai diao, zuo xia juan: Wu jun Gu shi cang ban.

Shi gu yan zhai shi chu ji : qi juan ; Shi gu yan zhai ji Su shi : er juan /

Nei feng zuo xia juan: Daoguang ren chen ke yu Hangzhou shi yuan.

Chou hai chu ji : 4 juan /

Block print.

Jing cha ke ben ; Chu ji /

Cover title.

Ku chai chan chat chu Chatri.

Mode of access: Internet.

Differential Priors for Elastic Nets

The elastic net and related algorithms, such as generative topographic mapping, are key methods for discretized dimension-reduction problems. At their heart are priors that specify the expected topological and geometric properties of the maps. However, up to now, only a very small subset of possible priors has been considered. Here we study a much more general family originating from discrete, high-order derivative operators. We show theoretically that the form of the discrete approximation to the derivative used has a crucial influence on the resulting map. Using a new and more powerful iterative elastic net algorithm, we confirm these results empirically, and illustrate how different priors affect the form of simulated ocular dominance columns.

Belief nets for mental health

DUE TO COPYRIGHT RESTRICTIONS ONLY AVAILABLE FOR CONSULTATION AT ASTON UNIVERSITY LIBRARY AND INFORMATION SERVICES WITH PRIOR ARRANGEMENT

Generalized Nets Model of an E-Learning System Software Architecture

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshko ff and Lubomir Tschakaloff , Sofi a, July, 2006.

Compositions, Generated by Special Nets in Affinely Connected Spaces

Special nets which characterize Cartesian, geodesic, Chebyshevian, geodesic- Chebyshevian and Chebyshevian-geodesic compositions are introduced. Con- ditions for the coefficients of the connectedness in the parameters of these special nets are found.

Generalizing of Neural Nets: Functional Nets of Special Type

Special generalizing for the artificial neural nets: so called RFT – FN – is under discussion in the report. Such refinement touch upon the constituent elements for the conception of artificial neural network, namely, the choice of main primary functional elements in the net, the way to connect them(topology) and the structure of the net as a whole. As to the last, the structure of the functional net proposed is determined dynamically just in the constructing the net by itself by the special recurrent procedure. The number of newly joining primary functional elements, the topology of its connecting and tuning of the primary elements is the content of the each recurrent step. The procedure is terminated under fulfilling “natural” criteria relating residuals for example. The functional proposed can be used in solving the approximation problem for the functions, represented by its observations, for classifying and clustering, pattern recognition, etc. Recurrent procedure provide for the versatile optimizing possibilities: as on the each step of the procedure and wholly: by the choice of the newly joining elements, topology, by the affine transformations if input and intermediate coordinate as well as by its nonlinear coordinate wise transformations. All considerations are essentially based, constructively and evidently represented by the means of the Generalized Inverse.

Automatic Translation of MSC Diagrams into Petri Nets

Development-engineers use in their work languages intended for software or hardware systems design, and test engineers utilize languages effective in verification, analysis of the systems properties and testing. Automatic interfaces between languages of these kinds are necessary in order to avoid ambiguous understanding of specification of models of the systems and inconsistencies in the initial requirements for the systems development. Algorithm of automatic translation of MSC (Message Sequence Chart) diagrams compliant with MSC’2000 standard into Petri Nets is suggested in this paper. Each input MSC diagram is translated into Petri Net (PN), obtained PNs are sequentially composed in order to synthesize a whole system in one final combined PN. The principle of such composition is defined through the basic element of MSC language — conditions. While translating reference table is developed for maintenance of consistent coordination between the input system’s descriptions in MSC language and in PN format. This table is necessary to present the results of analysis and verification on PN in suitable for the development-engineer format of MSC diagrams. The proof of algorithm correctness is based on the use of process algebra ACP. The most significant feature of the given algorithm is the way of handling of conditions. The direction for future work is the development of integral, partially or completely automated technological process, which will allow designing system, testing and verifying its various properties in the one frame.