The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new Request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results
Reads/writes text as a character stream, buffering characters so as to provide for the efficient reading/writing of characters, arrays, and lines.
The buffer size may be specified, or the default size may be used. The default is large enough for most purposes.
In general, each read Request made of a Reader causes a corresponding read Request to be made of the underlying character or byte stream. It is therefore advisable to wrap a BufferedReader around any Reader whose read() operations may be costly, such as FileReaders and InputStreamReaders.
This taglib contains tags used to create struts input forms, as well as other tags generally useful in the creation of HTML-based user interfaces.
Many of the tags in this tag library will throw a JspException at runtime when they are utilized incorrectly (such as when you specify an invalid combination of tag attributes). JSP allows you to declare an "error page" in the <％@ page ％> directive. If you wish to process the actual exception that caused the problem, it is passed to the error page as a Request attribute under key org.apache.struts.action.EXCEPTION.
SCSI Multimedia Commands 鈥?3 (MMC-3)
T10/1363-D
5.16 READ CAPACITY Command
The READ CAPACITY command (Table 144) provides a means for the Initiator to Request information
regarding the capacity of the Logical Unit. This command shall not report the correct capacity of the
recorded data for CD-R, CD-RW and DVD-R/-RW media that does not have a Lead-out in the last
Session or last Border-out. For CD-ROM, the returned logical block address is modified to allow returning
a possibly inexact value (but one with a known error bound) based on the Table of Contents data
This project developed in java leads us to realize a flight reservation system in order to emulate databases containing the structures for the flight and for the booking. These bases extend the List interface and implements additional search鈥檚 methods.
Two interfaces provide an access to this system. The first one reads and handles reservation Request message from a terminal. The arguments are then processed throw a middleware interface that call the flight system methods. The second one, a Graphical User Interfaces (GUI) application using Swing Java Foundation Classes (JFC), offers a simpler access to the systems.
Imagine that you are a web developer (which is probably not a stretch if you are reading
this book) and you are being encouraged to add some Ajax features to a site you’re
working on. Maybe the originator of this Request is your boss or your boss’s boss, who is
not even sure what Ajax is, let alone what kinds of features might be useful.And maybe
you’re not sure yourself. Imagine that your prior experience has mostly been on the
server-side, developing in Java or some other server-side technology, and your experience
with HTML and JavaScript has been fairly limited.This is the scenario we will explore
over the next several chapters as you are introduced to the Dojo Toolkit.
A certification path is an ordered list of certificates starting with a certificate issued by the relying
party s trust root, and ending with the target certificate that needs to be validated. Certification
path validation procedures are based on the algorithm supplied in ITU-T Recommendation X.509
and further defined in Internet Engineering Task Force (IETF) Request for Comments (RFC)
3280. Certification path processing verifies the binding between the subject distinguished name
and/or subject alternative name and the subject public key defined in the target certificate. The
binding is limited by constraints, which are specified in the certificates that comprise the path,
and inputs that are specified by the relying party. To ensure secure interoperation of PKI-enabled
applications, the path validation must be done in accordance with the X.509 and RFC 3280
specifications. This document provides the test assertions and the test cases for testing path
validation software against these specifications.
本書是英文版，但內容非常不錯，本書目錄如下：
Table of Contents
SIP—Understanding the Session Initiation Protocol, Second Edition
Foreword to the First Edition
Preface to - the Second Edition
Preface to - the First Edition
Chapter 1 - SIP and the Internet
Chapter 2 - Introduction to SIP
Chapter 3 - SIP Clients and Servers
Chapter 4 - SIP Request Messages
Chapter 5 - SIP Response Messages
Chapter 6 - SIP Header Fields
Chapter 7 - Related Protocols
Chapter 8 - Comparison to H.323
Chapter 9 - Wireless and 3GPP
Chapter 10 - Call Flow Examples
Chapter 11 - Future Directions
Appendix A - Changes in the SIP Specification from RFC 2543 to RFC 3261
