Skip to main content

Research Repository

Advanced Search

Outputs (12)

Generic composition (2002)
Journal Article
Chen, Y. (2002). Generic composition. Formal aspects of computing (Internet), 14(2), 108-122. https://doi.org/10.1007/s001650200031

This paper presents a technique called {\em generic composition} to provide a uniform basis for modal operators, sequential composition, different kinds of parallel compositions and various healthiness conditions appearing in a variety of semantic th... Read More about Generic composition.

The refinability of the 4-point scheme. (2002)
Journal Article
Ivrissimtzis, I., Dodgson, N., Hassan, M., & Sabin, M. (2002). The refinability of the 4-point scheme. Computer Aided Geometric Design, 19(4), 235-238

Modal liquid crystal wavefront corrector (2002)
Journal Article
Kotova, S., Kvashnin, M., Rakhmatulin, M., Zayakin, O., Guralnik, I., Klimov, N., …Toporkova, L. (2002). Modal liquid crystal wavefront corrector. Optics Express, 10(22), 1258-1272. https://doi.org/10.1364/oe.10.001258

Results are presented of the properties of a liquid crystal wavefront corrector for adaptive optics. The device is controlled using modal addressing in which case the device behaves more like a continuous facesheet deformable mirror than a segmented... Read More about Modal liquid crystal wavefront corrector.

Pre-fetching web pages through data mining based prediction (2002)
Journal Article
Zhang, W., Xu, B., Song, W., & Yang, H. (2002). Pre-fetching web pages through data mining based prediction. Journal of applied systems studies, 3(2), 384-398

The speed of fetching web pages to users is getting lower because the rapid expansion of Internet use, the inherited character of delay in the network and the Request/Response working mode of WWW, and this is becoming a serious concern for web surfer... Read More about Pre-fetching web pages through data mining based prediction.

Improved sorting-based procedure for integer programming (2002)
Journal Article
Dantchev, S. (2002). Improved sorting-based procedure for integer programming. Mathematical Programming, 92(2), 297-300. https://doi.org/10.1007/s101070100245

Recently, Cornuéjols and Dawande have considered a special class of 0-1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the r... Read More about Improved sorting-based procedure for integer programming.

Program schemes, arrays, Lindström quantifiers and zero-one laws (2002)
Journal Article
Stewart, I. (2002). Program schemes, arrays, Lindström quantifiers and zero-one laws. Theoretical Computer Science, 275(1-2), 283-310. https://doi.org/10.1016/s0304-3975%2801%2900183-9

We characterize the class of problems accepted by a class of program schemes with arrays, NPSA, as the class of problems defined by the sentences of a logic formed by extending first-order logic with a particular uniform (or vectorized) sequence of L... Read More about Program schemes, arrays, Lindström quantifiers and zero-one laws.

Laser beacon wave-front sensing without focal anisoplanatism (2002)
Journal Article
Buscher, D., Love, G., & Myers, R. (2002). Laser beacon wave-front sensing without focal anisoplanatism. Optics Letters, 27(3), 149-151. https://doi.org/10.1364/ol.27.000149

Wave-front sensing from artificial beacons is normally performed by formation of a focused spot in the atmosphere and sensing of the wave-front distortions produced during the beam's return passage. We propose an alternative method that senses the di... Read More about Laser beacon wave-front sensing without focal anisoplanatism.

Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes (2002)
Journal Article
Ashir, Y., & Stewart, I. (2002). Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes. SIAM Journal on Discrete Mathematics, 15(3), 317-328. https://doi.org/10.1137/s0895480196311183

We consider the fault-tolerant capabilities of networks of processors whose underlying topology is that of the k-ary n-cube $Q_n^k$, where k > 2 and n > 1. In particular, given a copy of $Q_n^k$ where some of the inter-processor links may be faulty b... Read More about Fault-tolerant embeddings of Hamiltonian circuits in k-ary n-cubes.