In this paper we present an approximate method of decomposing a tumor into a minimum number of spherical objects. The spherical objects must cover the entire tumor space and we assume that they may overlap one another...
详细信息
ISBN:
(纸本)089791502X
In this paper we present an approximate method of decomposing a tumor into a minimum number of spherical objects. The spherical objects must cover the entire tumor space and we assume that they may overlap one another within the three dimensional object space. also, the space occupied by these spherical objects outside the tumor must be minimized. This algorithm can be applied to find the positions of radiation beams necessary to destroy a tumor.
This paper focuses on the technology that has been transferred form National Aeronautics and Space Administration's (NASA) Space Station Freedom program to Brown and Root Braun's Process Computer Aided Enginee...
详细信息
ISBN:
(纸本)089791502X
This paper focuses on the technology that has been transferred form National Aeronautics and Space Administration's (NASA) Space Station Freedom program to Brown and Root Braun's Process Computer Aided Engineering System (P-CAES), and explores several techniques used in P-CAES. The project utilized technology transfer in a number of technical and non-technical areas: system architecture;graphical user interfaces;object-oriented methodologies;project management;project structure;and prototype development. The methods used in achieving technology transfer and the amount of transfer differed from area to area. A critical factor that led to the successful transfer of technology was the quick and efficient location of a project that included technology to transfer to the P-CAES problem domain.
This volume of the proceedings contains 83 articles devoted to computer science and computer systems. Specific subject areas include: learning systems, networking, neural networks, object oriented systems, multiproces...
详细信息
ISBN:
(纸本)089791502X
This volume of the proceedings contains 83 articles devoted to computer science and computer systems. Specific subject areas include: learning systems, networking, neural networks, object oriented systems, multiprocessing operating systems, parallel processing systems, distributed systems, algorithm performance programming languages, matrix methods, simulated annealing, genetic algorithms, software reusability, and visual programming.
The Conference materials contain 86 papers. Architecture, communications, computational linguistics, computer assisted instruction, data structures, databases, expert systems, fuzzy systems, graphics, GUI, and image p...
详细信息
ISBN:
(纸本)089791502X
The Conference materials contain 86 papers. Architecture, communications, computational linguistics, computer assisted instruction, data structures, databases, expert systems, fuzzy systems, graphics, GUI, and image processing, information theory, intelligent systems, logic programming, machine learning and decision trees, and networking are the main topics covered.
Let Qn be the random number of comparisons made by quicksort in sorting n distinct keys, when we assume that all n! possible orderings are equally likely. Known results concerning moments for Qn do not show how rare i...
ISBN:
(纸本)089791466X
Let Qn be the random number of comparisons made by quicksort in sorting n distinct keys, when we assume that all n! possible orderings are equally likely. Known results concerning moments for Qn do not show how rare it is for Qn to make large deviations from its mean. Here we give a good approximation to the probability of such a large deviation, and find that this probability is quite small. As well as the basic quicksort we consider the variant in which the partitioning key is chosen as the median of (2t + 1) keys.
The programming language in which to describe mathematical objects and algorithms is a fundamental issue in the design of a symbolic computation system. XFun is a strongly typed functional programming language. Althou...
详细信息
In this paper the shortages of using the standard Fourier Transform to analyze the Phonocardiogram (PCG) signals is first pointed out, and the need for time-varying digital signal processing techniques to correctly an...
详细信息
ISBN:
(纸本)089791502X
In this paper the shortages of using the standard Fourier Transform to analyze the Phonocardiogram (PCG) signals is first pointed out, and the need for time-varying digital signal processing techniques to correctly analyze PCG signals is discussed. Two time-frequency analysis techniques are presented in this paper, namely, the Spectrogram and the Wavelet Transform. Furthermore, a comparison study between these two techniques has shown the resolution differences between them. The Wavelet Transform is shown to be capable to detect the two components, aortic valve component A2 and pulmonary valve component P2, of the second sound S2 of a normal PCG signal which are not detectable neither using the standard Fourier Transfer nor the Spectrogram. In addition to that, the Wavelet Transform enables Physicians to obtain qualitative and quantitative measurements of time-frequency characteristics of phonocardiogram (PCG) signals.
Computer architecture designs are usually based on historical data, and the development of computers has been influenced by three factors: market (users), software and hardware methods, and technology. Of the three fa...
详细信息
ISBN:
(纸本)089791502X
Computer architecture designs are usually based on historical data, and the development of computers has been influenced by three factors: market (users), software and hardware methods, and technology. Of the three factors, technology is the most dominant. The reduced instruction set computer (RISC) has emerged as a formidable competitor to the conventional, complex instruction set computer (CISC), systems. The emergence of RISC was a direct result of advances in technology and historical data collected on how instruction sets are used by compilers. Advances in very large scale integration and compilers are enabling RISC architecture to exploit parallelism in systems that are conventional sequential in their mode of operation. The second generation of RISC processors are utilizing superpipelining or superscalar to achieve execution speed that was once attainable only on mainframes and supercomputers. Future RISC processors will use both superscalar and superpipelining techniques to achieve speed beyond the 50 MIPS that is attainable on some of today's processors.
Let H be an n × n mesh-connected array of processors. Each processor is assumed to fail (independently) with probability p. Raghavan [5] gave an algorithm that with high probability routes packets in this mesh wi...
详细信息
ISBN:
(纸本)089791466X
Let H be an n × n mesh-connected array of processors. Each processor is assumed to fail (independently) with probability p. Raghavan [5] gave an algorithm that with high probability routes packets in this mesh with 0(log n) dilation and O(log2 n) load so long as p ≤ 0.29. KKLMRRTT [3] improve the load to O(1) for "small" p while keeping the O(log n) bound for dilation and showing an O(1) bound for congestion. In this paper we show these bounds hold for p as high as ≈ 0.4. We also consider the problem where links rather than processors fail and shows these same bounds hold for q < 1/2. In both cases these bounds are tight: for greater probabilities of failure the above embedding bounds cannot be achieved. This sharp cutoff follows from a zero-one result of percolation theory.
String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has a rather sparse set of techniques. This paper presents a new algorithmic technique for two-dimensional matching, ...
详细信息
ISBN:
(纸本)089791466X
String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has a rather sparse set of techniques. This paper presents a new algorithmic technique for two-dimensional matching, that of periodicity analysis. Periodicity in strings has been used to solve string matching problems. The success of these algorithms suggests that periodicity can be as important a tool in multidimensional matching. However, multidimensional periodicity is not as simple as it is in strings and was not formally studied or used in pattern matching. This paper's main contribution is defining and analysing two-dimensional periodicity in rectangular arrays. In addition, we introduce a new pattern matching paradigm - Compressed Matching. A text array T and a pattern array P are given in compressed forms c(T) and c(P). We seek all appearances of P in T, without decompressing T. By using periodicity analysis, we show that for the two-dimensional run-length compression there is a O(|c(T)| log |P| + |P|), or almost optimal algorithm that can achieve a search time that is sublinear in the size of the text |T|.
暂无评论