Outputs (3144)

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.

Width-Size Trade-offs for the Pigeon-Hole Principle. (2002)
Presentation / Conference Contribution
Dantchev, S. (2002, May). Width-Size Trade-offs for the Pigeon-Hole Principle. Presented at The 17th Annual Conference on Computational Complexity, Montreal, Canada

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.

RAAR: A TCP-friendly Congestion Control Mechanism of Transporting Multimedia Traffic in Internet. (2002)
Presentation / Conference Contribution
Hu, Y., Zhang, G., & Tu, W. (2002, March). RAAR: A TCP-friendly Congestion Control Mechanism of Transporting Multimedia Traffic in Internet. Presented at The ICS Program of Workshop on Computer Networks, Taiwan

This paper proposes a unicast mechanism of Rate Adaption At Receivers called RAAR. It can be used to transport multimedia traffic. UDP and TCP dominate in current Internet. Neither TCP nor UDP can be used by multimedia traffic, because the TCP reduce... Read More about RAAR: A TCP-friendly Congestion Control Mechanism of Transporting Multimedia Traffic in Internet..

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.

An interpolating 4-point C2 ternary stationary subdivision scheme (2002)
Journal Article
Hassan, M., Ivrissimtzis, I., Dodgson, N., & Sabin, M. (2002). An interpolating 4-point C2 ternary stationary subdivision scheme. Computer Aided Geometric Design, 19(1), 1-18. https://doi.org/10.1016/s0167-8396%2801%2900084-x

A novel 4-point ternary interpolatory subdivision scheme with a tension parameter is analyzed. It is shown that for a certain range of the tension parameter the resulting curve is C2. The role of the tension parameter is demonstrated by a few example... Read More about An interpolating 4-point C2 ternary stationary subdivision scheme.

Weakest precondition for general recursive programs formalized in coq (2002)
Presentation / Conference Contribution
Zhang, X., Munro, M., Harman, M., & Hu, L. (2002, January). Weakest precondition for general recursive programs formalized in coq. Presented at 15th International Conference on Theorem Proving in Higher Order Logics : TPHOLs., Hampton, VA

This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is a deep embedding using the computational power intrinsic to type theory. Since C... Read More about Weakest precondition for general recursive programs formalized in coq.

A monoidal interval of isotone clones on a finite chain (2002)
Journal Article
Krokhin, A., & Larose, B. (2002). A monoidal interval of isotone clones on a finite chain. Acta scientiarum mathematicarum, 68(1-2), 37-62

Let k denote a k-element chain, k3. Let M denote the clone generated by all unary isotone operations on k and let Pol denote the clone of all isotone operations on k. We investigate the interval of clones [MPol]. Among other results, we describe comp... Read More about A monoidal interval of isotone clones on a finite chain.