1,359 Result(s)
within
English
Computer Science
Computer Communication Networks
**u Tao
Chapter
-
Chapter and Conference Paper
Checking hybrid automata for linear duration invariants
In this paper, we consider the problem of checking hybrid systems modelled by hybrid automata for a class of real-time properties represented by linear duration invariants, which are constructed from linear inequ...
-
Chapter
The Design of Information System in Thin-Client Environment over Intranet
This paper focuses on discussing the design principles and choices of IS in new model. With the architecture of IS has transit to multi-tier Client/Server and Thin-Client environment from 2-tier Client/Server ...
-
Chapter
X.500 — Information Infrastructure of Distributed Systems in Heterogeneous Environments
Develo** distributed systems in heterogeneous environments often needs to solve the problem of how to access many different kinds of network resources, and that is a rather difficult task. In this paper, we ...
-
Chapter and Conference Paper
New Applications of the Incompressibility Method (Extended Abstract)
The incompressibility method is an elementary yet powerful proof technique based on Kolmogorov complexity [13]. We show that it is particularly suited to obtain average-case computational complexity lower bounds....
-
Chapter and Conference Paper
Average-Case Complexity of Shellsort (Preliminary Version)
We prove a general lower bound on the average-case complexity of Shellsort: the average number of data-movements (and comparisons) made by a p-pass Shellsort for any incremental sequence is Ω(pn1+1/p) for every p
-
Chapter and Conference Paper
Using the SMiLE Monitoring Infrastructure to Detect and Lower the Inefficiency of Parallel Applications
High computational demands are one of the main reasons for the use of parallel architectures like clusters of PCs. Many parallel programs, however, suffer from severe inefficiencies when executed on such a loo...
-
Chapter and Conference Paper
The Synthesis of Realistic Human Face
In this paper, we present new techniques for creating a realistic specific human face based on a general 3D face model and several photos of a human. The morphing technique allows interactive alignment of feat...
-
Chapter and Conference Paper
Phylogenetic k-Root and Steiner k-Root
Given a graph G = (V,E) and a positive integer k, the Phylogenetic k-Root Problem asks for a (unrooted) tree T without degree-2 nodes such that its leaves are labeled by V and (u, v)∈ E if and only if d ...
-
Chapter
The Virtual Bandwidth Based ER Marking Algorithms for Flow Control in ATM Networks
ABR service is designed for a wide range of applications that do not require bounded delay and loss ratio, but rather prefer low loss ratio and high throughput with only a minimum cell rate guaranteed. In this...
-
Chapter and Conference Paper
Detecting Facial Features on Images with Multiple Faces
This paper presents an approach to detect facial features of multiple faces on complex background and with variable poses, illumination conditions, expressions, ages, image sizes, etc. First, the skin parts of...
-
Chapter and Conference Paper
The Incompressibility Method
Kolmogorov complexity is a modern notion of randomness dealing with the quantity of information in individual objects; that is, pointwise randomness rather than average randomness as produced by a random sourc...
-
Chapter and Conference Paper
The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The LONGEST ARC- PRESERVING COMMON SUBSEQUENCE (LAPCS) Problem has been introduced in [11] as a framewor...
-
Chapter and Conference Paper
Soft Mobile Ad-Hoc Networking
Today’s mobile ad-hoc networking approaches require nodes to maintain network topology and routing tables, which limits network scalability. This paper proposes soft mobile ad-hoc networks in which nodes do not m...
-
Chapter and Conference Paper
Enterprise Alliance and Virtue Enterprise: A Systematic Analysis and Theoretical Explanation
Internet enterprise organization (“EO”) with representation of enterprise alliance (“EA”) and virtue enterprise (VE) is now a prevailing form of organization in developed countries. This paper attempts to put ...
-
Chapter and Conference Paper
Validating an Access Cost Model for Wide Area Applications
In this paper, we describe a case study in develo** an access cost model for WebSources in the context of a wrapper mediator architecture. We document our experiences in validating this model, and note succe...
-
Chapter and Conference Paper
Estimating Joint Probabilities from Marginal Ones*
Estimating joint probabilities plays an important role in many data mining and machine learning tasks. In this paper we introduce two methods, minAB and prodAB, to estimate joint probabilities. Both methods are b...
-
Chapter and Conference Paper
CoFD: An Algorithm for Non-distance Based Clustering in High Dimensional Spaces*
The clustering problem, which aims at identifying the distribution of patterns and intrinsic correlations in large data sets by partitioning the data points into similarity clusters, has been widely studied. T...
-
Chapter and Conference Paper
A Group Signature Scheme Committing the Group
In this paper, a group signature scheme committing the group itself is proposed. In normal group signature schemes, a group member can anonymously sign a message on behalf of a group, and the anonymity of the ...
-
Chapter and Conference Paper
Improving Data Locality Using Dynamic Page Migration Based on Memory Access Histograms
This Paper presents an approach which dynamically and transparently improves the data locality of memory references in Non-Uniform Memory Access (NUMA) characterized systems. The approach is based on run-time ...
-
Chapter and Conference Paper
Adjusted Probabilistic Packet Marking for IP Traceback
Distributed denial-of-service attack is one of the greatest threats to the Internet today. One of the biggest difficulties in defending against this attack is that attackers always use incorrect, or “spoofed” ...
