Academic literature on the topic 'Super computers'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Super computers.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Super computers"

1

Hodson, Hal. "Super-literate computers." New Scientist 228, no. 3051 (December 2015): 22. http://dx.doi.org/10.1016/s0262-4079(15)31751-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

RABER, LINDA. "Academics get to use really super computers." Chemical & Engineering News 75, no. 32 (August 11, 1997): 11. http://dx.doi.org/10.1021/cen-v075n032.p011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Guan, Shi Jie, and Xin Na Zheng. "The Development Trends of the Computer-Nanocomputer Based on Nanotechnology and Properties of Nanomaterials." Advanced Materials Research 788 (September 2013): 77–80. http://dx.doi.org/10.4028/www.scientific.net/amr.788.77.

Full text
Abstract:
This paper is aim to introduce the research background and the significance of the computer . then forecast the computer development tends to super rapid, subminiature, parallel processing and intellectualization. Finally , the conclusion is reached that these new-type computers will produce deep impact on human societys development.
APA, Harvard, Vancouver, ISO, and other styles
4

Delgado, Ana, Silvio Funtowicz, and Dorothy Dankel. "Super-Computers, Evolution and the Fabrication of Life." International Journal of Social Ecology and Sustainable Development 3, no. 2 (April 2012): 11–24. http://dx.doi.org/10.4018/jsesd.2012040102.

Full text
Abstract:
As biology moves into the digital realm, new ways of representing, manipulating, and appropriating life are emerging. In this paper, the authors examine systems and synthetic biology and map imaginaries of the making of life. The authors present how they have worked with scientists in three different laboratories in Europe and the U.S. by exploring those imaginaries with them. Focusing on scientific images, methods, and scientific traditions through a number of dialogic sessions, three imaginaries became apparent: living systems as networks, life as building blocks, and living systems as circuits. By working in this way, the authors could explore how scientists imagine their relations with nature (i.e., in terms of ownership) and their role as scientist. Exploring imaginaries of the making of life can open plural and broadly oriented and normative debates on nature, society, technology, and their relations. This kind of dynamic, interactive, and reflexive societal talk is, from the authors’ point of view, a central condition for possible sustainable futures.
APA, Harvard, Vancouver, ISO, and other styles
5

Ruban, Igor, Vitalii Martovytskyi, and Nataliia Lukova-Chuiko. "Designing a monitoring model for cluster super–computers." Eastern-European Journal of Enterprise Technologies 6, no. 2 (84) (December 14, 2016): 32–37. http://dx.doi.org/10.15587/1729-4061.2016.85433.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Johnstone, Bill. "Parallel computers: GE aims at super-array contract." Nature 318, no. 6045 (December 1985): 403. http://dx.doi.org/10.1038/318403b0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Pinto, Carla M. A., and J. A. Tenreiro Machado. "Fractional Dynamics of Computer Virus Propagation." Mathematical Problems in Engineering 2014 (2014): 1–7. http://dx.doi.org/10.1155/2014/476502.

Full text
Abstract:
We propose a fractional model for computer virus propagation. The model includes the interaction between computers and removable devices. We simulate numerically the model for distinct values of the order of the fractional derivative and for two sets of initial conditions adopted in the literature. We conclude that fractional order systems reveal richer dynamics than the classical integer order counterpart. Therefore, fractional dynamics leads to time responses with super-fast transients and super-slow evolutions towards the steady-state, effects not easily captured by the integer order models.
APA, Harvard, Vancouver, ISO, and other styles
8

Ingber, Lester. "Hybrid classical-quantum computing: Applications to statistical mechanics of financial markets." E3S Web of Conferences 307 (2021): 04001. http://dx.doi.org/10.1051/e3sconf/202130704001.

Full text
Abstract:
Hybrid Classical-Quantum computing is now offered by several commercial quantum computers. In this project, a model of financial options, Statistical Mechanics of Financial Markets (SMFM), uses this approach. However, only Classical (super-)computers are used to include the quantum features of these models. Since 1989, Adaptive Simulated Annealing (ASA), an optimization code using importance-sampling, has fit parameters in such models. Since 2015, PATHINT, a path-integral numerical agorithm, has been used to describe several systems in several disciplines. PATHINT has been generalized from 1 dimension to N dimensions, and from classical to quantum systems into qPATHINT. Published papers have described the use of qPATHINT to neocortical interactions and financial options. The classical space modeled by SMFM fits parameters in conditional short-time probability distributions of nonlinear nonequilibrium multivariate statistical mechanics, while the quantum space modeled by qPATHINT describes quantum money. This project demonstrates how some hybrid classical-quantum systems may be calculated using only classical (super-)computers.
APA, Harvard, Vancouver, ISO, and other styles
9

ROSENBERG, ARNOLD L., and RON C. CHIANG. "HETEROGENEITY IN COMPUTING: INSIGHTS FROM A WORKSHARING SCHEDULING PROBLEM." International Journal of Foundations of Computer Science 22, no. 06 (September 2011): 1471–93. http://dx.doi.org/10.1142/s0129054111008829.

Full text
Abstract:
Heterogeneity complicates the use of multicomputer platforms. Can it also enhance their performance? How can one measure the power of a heterogeneous assemblage of computers ("cluster"), in absolute terms (how powerful is this cluster) and relative terms (which cluster is more powerful)? Is a cluster that has one super-fast computer and the rest of "average" speed more/less powerful than one all of whose computers are "moderately" fast? If you can replace just one computer in a cluster with a faster one, should you replace the fastest? the slowest? A result concerning "worksharing" in heterogeneous clusters provides a highly idealized, yet algorithmically meaningful, framework for studying such questions in a way that admits rigorous analysis and formal proof. We encounter some surprises as we answer the preceding questions (perforce, within the idealized framework). Highlights: (1) If one can replace only one computer in a cluster by a faster one, it is (almost) always most advantageous to replace the fastest one. (2) If the computers in two clusters have the same mean speed, then the cluster with the larger variance in speed is (almost) always more productive (verified analytically for small clusters and empirically for large ones.) (3) Heterogeneity can actually enhance a cluster's computing power.
APA, Harvard, Vancouver, ISO, and other styles
10

FRENKEL, D. "Fast Algorithms for Slow Processes in Lattice-Gas Cellular Automata." International Journal of Modern Physics C 02, no. 01 (March 1991): 66–74. http://dx.doi.org/10.1142/s0129183191000081.

Full text
Abstract:
The accurate numerical study of long-time tails in time-correlation functions requires large amounts of computer time. In some cases, the necessary calculations are too time-consuming to be carried out even on present-day (super)computers. However, if we consider ‘lattice-gas’ versions of the same problems, then it turns out that for certain problems, a speed-up of 6–10 orders of magnitude can be achieved using a very simple algorithm. As a result, we can now test theoretical (mode-coupling) predictions for long-time tails with unprecedented accuracy.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Super computers"

1

Majeed, Taban Fouad. "Segmentation, super-resolution and fusion for digital mammogram classification." Thesis, University of Buckingham, 2016. http://bear.buckingham.ac.uk/162/.

Full text
Abstract:
Mammography is one of the most common and effective techniques used by radiologists for the early detection of breast cancer. Recently, computer-aided detection/diagnosis (CAD) has become a major research topic in medical imaging and has been widely applied in clinical situations. According to statics, early detection of cancer can reduce the mortality rates by 30% to 70%, therefore detection and diagnosis in the early stage are very important. CAD systems are designed primarily to assist radiologists in detecting and classifying abnormalities in medical scan images, but the main challenges hindering their wider deployment is the difficulty in achieving accuracy rates that help improve radiologists’ performance. The detection and diagnosis of breast cancer face two main issues: the accuracy of the CAD system, and the radiologists’ performance in reading and diagnosing mammograms. This thesis focused on the accuracy of CAD systems. In particular, we investigated two main steps of CAD systems; pre-processing (enhancement and segmentation), feature extraction and classification. Through this investigation, we make five main contributions to the field of automatic mammogram analysis. In automated mammogram analysis, image segmentation techniques are employed in breast boundary or region-of-interest (ROI) extraction. In most Medio-Lateral Oblique (MLO) views of mammograms, the pectoral muscle represents a predominant density region and it is important to detect and segment out this muscle region during pre-processing because it could be bias to the detection of breast cancer. An important reason for the breast border extraction is that it will limit the search-zone for abnormalities in the region of the breast without undue influence from the background of the mammogram. Therefore, we propose a new scheme for breast border extraction, artifact removal and removal of annotations, which are found in the background of mammograms. This was achieved using an local adaptive threshold that creates a binary mask for the images, followed by the use of morphological operations. Furthermore, an adaptive algorithm is proposed to detect and remove the pectoral muscle automatically. Feature extraction is another important step of any image-based pattern classification system. The performance of the corresponding classification depends very much on how well the extracted features represent the object of interest. We investigated a range of different texture feature sets such as Local Binary Pattern Histogram (LBPH), Histogram of Oriented Gradients (HOG) descriptor, and Gray Level Co-occurrence Matrix (GLCM). We propose the use of multi-scale features based on wavelet and local binary patterns for mammogram classification. We extract histograms of LBP codes from the original image as well as the wavelet sub-bands. Extracted features are combined into a single feature set. Experimental results show that our proposed method of combining LBPH features obtained from the original image and with LBPH features obtained from the wavelet domain increase the classification accuracy (sensitivity and specificity) when compared with LBPH extracted from the original image. The feature vector size could be large for some types of feature extraction schemes and they may contain redundant features that could have a negative effect on the performance of classification accuracy. Therefore, feature vector size reduction is needed to achieve higher accuracy as well as efficiency (processing and storage). We reduced the size of the features by applying principle component analysis (PCA) on the feature set and only chose a small number of eigen components to represent the features. Experimental results showed enhancement in the mammogram classification accuracy with a small set of features when compared with using original feature vector. Then we investigated and propose the use of the feature and decision fusion in mammogram classification. In feature-level fusion, two or more extracted feature sets of the same mammogram are concatenated into a single larger fused feature vector to represent the mammogram. Whereas in decision-level fusion, the results of individual classifiers based on distinct features extracted from the same mammogram are combined into a single decision. In this case the final decision is made by majority voting among the results of individual classifiers. Finally, we investigated the use of super resolution as a pre-processing step to enhance the mammograms prior to extracting features. From the preliminary experimental results we conclude that using enhanced mammograms have a positive effect on the performance of the system. Overall, our combination of proposals outperforms several existing schemes published in the literature.
APA, Harvard, Vancouver, ISO, and other styles
2

Al-Hassan, Nadia. "Mathematically inspired approaches to face recognition in uncontrolled conditions : super resolution and compressive sensing." Thesis, University of Buckingham, 2014. http://bear.buckingham.ac.uk/6/.

Full text
Abstract:
Face recognition systems under uncontrolled conditions using surveillance cameras is becoming essential for establishing the identity of a person at a distance from the camera and providing safety and security against terrorist, attack, robbery and crime. Therefore, the performance of face recognition in low-resolution degraded images with low quality against images with high quality/and of good resolution/size is considered the most challenging tasks and constitutes focus of this thesis. The work in this thesis is designed to further investigate these issues and the following being our main aim: “To investigate face identification from a distance and under uncontrolled conditions by primarily addressing the problem of low-resolution images using existing/modified mathematically inspired super resolution schemes that are based on the emerging new paradigm of compressive sensing and non-adaptive dictionaries based super resolution.” We shall firstly investigate and develop the compressive sensing (CS) based sparse representation of a sample image to reconstruct a high-resolution image for face recognition, by taking different approaches to constructing CS-compliant dictionaries such as Gaussian Random Matrix and Toeplitz Circular Random Matrix. In particular, our focus is on constructing CS non-adaptive dictionaries (independent of face image information), which contrasts with existing image-learnt dictionaries, but satisfies some form of the Restricted Isometry Property (RIP) which is sufficient to comply with the CS theorem regarding the recovery of sparsely represented images. We shall demonstrate that the CS dictionary techniques for resolution enhancement tasks are able to develop scalable face recognition schemes under uncontrolled conditions and at a distance. Secondly, we shall clarify the comparisons of the strength of sufficient CS property for the various types of dictionaries and demonstrate that the image-learnt dictionary far from satisfies the RIP for compressive sensing. Thirdly, we propose dictionaries based on the high frequency coefficients of the training set and investigate the impact of using dictionaries on the space of feature vectors of the low-resolution image for face recognition when applied to the wavelet domain. Finally, we test the performance of the developed schemes on CCTV images with unknown model of degradation, and show that these schemes significantly outperform existing techniques developed for such a challenging task. However, the performance is still not comparable to what could be achieved in controlled environment, and hence we shall identify remaining challenges to be investigated in the future.
APA, Harvard, Vancouver, ISO, and other styles
3

Luengo, Imanol. "Hierarchical super-regions and their applications to biological volume segmentation." Thesis, University of Nottingham, 2018. http://eprints.nottingham.ac.uk/48719/.

Full text
Abstract:
Advances in Biological Imaging technology have made possible imaging of sub-cellular samples with an unprecedented resolution. By using Tomographic Reconstruction biological researchers can now obtain volumetric reconstructions for whole cells in near-native state using cryo-Soft X-ray Tomography or even smaller sub-cellular regions with cryo-Electron Tomography. These technologies allow for visualisation, exploration and analysis of very exciting biological samples, however, it doesn’t come without its challenges. Poor signal-to-noise ratio, low contrast and other sample preparation and re-construction artefacts make these 3D datasets to be a great challenge for the image processing and computer vision community. Without previous available annotations due to the biological relevance of the datasets (which makes them not being publicly available) and the scarce previous research in the field, (semi-)automatic segmentation of these datasets tends to fail. In order to bring state-of-the-art in computer vision closer to the biological community and overcome the difficulties previously mentioned, we are going to build towards a semi-automatic segmentation framework. To do so, we will first introduce superpixels, a group of adjacent pixels that share similar characteristics that reduce whole images to a few superpixels that still preserve important information of the image. Superpixels have been used in the recent literature to speed up object detection, tracking and scene parsing systems. The reduced representation of the image with a few regions allows for faster processing on the subsequent algorithms applied over them. Two novel superpixel algorithms will be presented, introducing with them what we call a Super-Region Hierarchy. A Super-Region Hierarchy is composed of similar regions agglomerated hierarchically. We will show that exploiting this hierarchy in both directions (bottom-up and top-down) helps improving the quality of the superpixels and generalizing them toimages of large dimensionality. Then, superpixels are going to be extended to 3D (named supervoxels), resulting in a variation of two new algorithms ready to be applied to large biological volumes. We will show that representing biological volumes with supervoxels helps not only to dramatically reduce the computational complexity of the analysis (as billions of voxels can be accurately represented with few thousand supervoxels), but also improve the accuracy of the analysis itself by reducing the local noisy neighbourhood of these datasets when grouping voxel features within supervoxels. These regions are only as powerful as the features that represent them, and thus, an in-depth discussion about biological features and grouping methods will lead the way to our first interactive segmentation model, by gathering contextual information from super-regions and hierarchical segmentation layers to allow for segmentation of large regions of the volume with few user input (in the form of annotations or scribbles). Moving forward to improve the interactive segmentation model, a novel algorithm will be presented to extract the most representative (or relevant) sub-volumes from a 3D dataset, since the lack of training data is one of the deciding factors for automatic approaches to fail. We will show that by serving small sub-volumes to the user to be segmented and applying Active Learning to select the next best sub-volume, the number of user interactions needed to completely segment a 3D volume is dramatically reduced. A novel classifier based on Random Forests will be presented to better benefit from these regions of known shape. To finish, SuRVoS will be introduced. A novel fully functional and publicly available workbench based on the work presented here. It is a software tool that comprises most of the ideas, problem formulations and algorithms into a single user interface. It allows a user to interactively segment arbitrary volumetric datasets in a very intuitive and easy to use manner. We have then covered all the topics from data representation to segmentation of biological volumes, and provide with a software tool that hopefully will help closing the gap between biological imaging and computer vision, allowing to generate annotations (or ground truth as it is known in computer vision) much quicker with the aim of gathering a large biological segmentation database to be used in future large-scale completely automatic projects.
APA, Harvard, Vancouver, ISO, and other styles
4

Robinson, Matthew Brandon Cleaver Gerald B. "Towards a systematic investigation of weakly coupled free fermionic heterotic string gauge group statistics." Waco, Tex. : Baylor University, 2009. http://hdl.handle.net/2104/5358.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ragagnin, Antonio [Verfasser], and Klaus [Akademischer Betreuer] Dolag. "From the mass-concentration relation of haloes to GPUs and into the web : a guide on fully utilizing super computers for the largest, cosmological hydrodynamic simulations / Antonio Ragagnin ; Betreuer: Klaus Dolag." München : Universitätsbibliothek der Ludwig-Maximilians-Universität, 2018. http://d-nb.info/1176971727/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Achurra, Jeannette M. Arosemena. "Multi-image animation : "Super Hero" /." Online version of thesis, 1989. http://hdl.handle.net/1850/11484.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Azar, Pablo Daniel. "Super-efficient rational proofs." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/93052.

Full text
Abstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
Cataloged from PDF version of thesis.
Includes bibliographical references (pages 47-49).
Information asymmetry is a central problem in both computer science and economics. In many fundamental problems, an uninformed principal wants to obtain some knowledge from an untrusted expert. This models several real-world situations, such as a manager's relation with her employees, or the delegation of computational tasks to workers over the internet. Because the expert is untrusted, the principal needs some guarantee that the provided knowledge is correct. In computer science, this guarantee is usually provided via a proof, which the principal can verify. Thus, a dishonest expert will always get caught and penalized. In many economic settings, the guarantee that the knowledge is correct is usually provided via incentives. That is, a game is played between expert and principal such that the expert maximizes her utility by being honest. A rational proof is an interactive proof where the prover, Merlin, is neither honest nor malicious, but rational. That is, Merlin acts in order to maximize his own utility. I previously introduced and studied Rational Proofs when the verifier, Arthur, is a probabilistic polynomial-time machine [3]. In this thesis, I characterize super-efficient rational proofs, that is, rational proofs where Arthur runs in logarithmic time. These new rational proofs are very practical. Not only are they much faster than their classical analogues, but they also provide very tangible incentives for the expert to be honest. Arthur only needs a polynomial-size budget, yet he can penalize Merlin by a large quantity if he deviates from the truth.
by Pablo Daniel Azar.
Ph. D.
APA, Harvard, Vancouver, ISO, and other styles
8

Jain, Vinit. "Deep Learning based Video Super- Resolution in Computer Generated Graphics." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-292687.

Full text
Abstract:
Super-Resolution is a widely studied problem in the field of computer vision, where the purpose is to increase the resolution of, or super-resolve, image data. In Video Super-Resolution, maintaining temporal coherence for consecutive video frames requires fusing information from multiple frames to super-resolve one frame. Current deep learning methods perform video super-resolution, yet most of them focus on working with natural datasets. In this thesis, we use a recurrent back-projection network for working with a dataset of computer-generated graphics, with example applications including upsampling low-resolution cinematics for the gaming industry. The dataset comes from a variety of gaming content, rendered in (3840 x 2160) resolution. The objective of the network is to produce the upscaled version of the low-resolution frame by learning an input combination of a low-resolution frame, a sequence of neighboring frames, and the optical flow between each neighboring frame and the reference frame. Under the baseline setup, we train the model to perform 2x upsampling from (1920 x 1080) to (3840 x 2160) resolution. In comparison against the bicubic interpolation method, our model achieved better results by a margin of 2dB for Peak Signal-to-Noise Ratio (PSNR), 0.015 for Structural Similarity Index Measure (SSIM), and 9.3 for the Video Multi-method Assessment Fusion (VMAF) metric. In addition, we further demonstrate the susceptibility in the performance of neural networks to changes in image compression quality, and the inefficiency of distortion metrics to capture the perceptual details accurately.
Superupplösning är ett allmänt studerat problem inom datorsyn, där syftet är att öka upplösningen på eller superupplösningsbilddata. I Video Super- Resolution kräver upprätthållande av tidsmässig koherens för på varandra följande videobilder sammanslagning av information från flera bilder för att superlösa en bildruta. Nuvarande djupinlärningsmetoder utför superupplösning i video, men de flesta av dem fokuserar på att arbeta med naturliga datamängder. I denna avhandling använder vi ett återkommande bakprojektionsnätverk för att arbeta med en datamängd av datorgenererad grafik, med exempelvis applikationer inklusive upsampling av film med låg upplösning för spelindustrin. Datauppsättningen kommer från en mängd olika spelinnehåll, återgivna i (3840 x 2160) upplösning. Målet med nätverket är att producera en uppskalad version av en ram med låg upplösning genom att lära sig en ingångskombination av en lågupplösningsram, en sekvens av intilliggande ramar och det optiska flödet mellan varje intilliggande ram och referensramen. Under grundinställningen tränar vi modellen för att utföra 2x uppsampling från (1920 x 1080) till (3840 x 2160) upplösning. Jämfört med den bicubiska interpoleringsmetoden uppnådde vår modell bättre resultat med en marginal på 2 dB för Peak Signal-to-Noise Ratio (PSNR), 0,015 för Structural Similarity Index Measure (SSIM) och 9.3 för Video Multimethod Assessment Fusion (VMAF) mätvärde. Dessutom demonstrerar vi vidare känsligheten i neuronal nätverk för förändringar i bildkomprimeringskvaliteten och ineffektiviteten hos distorsionsmätvärden för att fånga de perceptuella detaljerna exakt.
APA, Harvard, Vancouver, ISO, and other styles
9

Laws, Dannielle Kaye. "Gaming in Conversation: The Impact of Video Games in Second Language Communication." University of Toledo / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1461800075.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Walsh, David Oliver 1966. "New methods for super-resolution." Thesis, The University of Arizona, 1993. http://hdl.handle.net/10150/291988.

Full text
Abstract:
This thesis presents a new, non-iterative method for super-resolution which we call the direct method. By exploiting the inherent structure of the discrete signal processing environment, the direct method reduces the discrete super-resolution problem to solving a linear set of equations. The direct method is shown to be closely related to the Gerchberg algorithm for super-resolution. A mathematical justification for early termination of the Gerchberg algorithm is presented and the design of optimal termination schemes is discussed. Another new super-resolution method, which we call the SVD method, is presented. The SVD method is based on the direct method and employs SVD techniques to minimize errors in the solution due to noise and aliasing errors on the known frequency samples. The new SVD method is shown to provide results nearly identical to the optimal solution given by the Gerchberg algorithm, with huge savings in time and computational work.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Super computers"

1

Knightmare. Secrets of a super hacker. Port Townsend, Wash: Loompanics Unlimited, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Awesome Super Nintendo Secrets 3. Lahaina, HI: Sandwich Islands Publishing, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Al-Rabadi, Anas N. Parallel computing using reversible quantum systolic networks and their super-fast array entanglement. Hauppauge, N.Y: Nova Science Publishers, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hsiao, David K. Super database computers: Hardware and software solutions for efficient processing of very large databases. Monterey, California: Naval Postgraduate School, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

João Josué da Silva Filho. Computadores: Super-heróis ou vilões? : um estudo das possibilidades do uso pedagógico da informática na educação infantil. Florianópolis, SC: UFSC, Centro de Ciências da Educação, Núcleo de Publicações, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Page, Loraine. Super searcher, author, scribe: Successful writers share their Internet research secrets. Medford, N.J: CyberAge Books/Information Today, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Structures, Congress '86 (1986 New Orleans La ). Super and parallel computers and their impact on civil engineering: Proceedings of a session at Structures Congress '86, Hyatt Regency Hotel, New Orleans, Louisiana, September 15-18, 1986. New York, N.Y: The Society, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Compute's conquering Super NES games. Greensboro, N.C: Compute Books, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Schwartz, Steven A. Compute's Guide to Super NES Games. Greensboro, N.C: Compute Books, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Excel 5 super book. Indianapolis, IN: Sams, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Super computers"

1

Hibbard, Bill. "Computers as Tools." In Super-Intelligent Machines, 15–25. Boston, MA: Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-0759-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aupy, Guillaume, Ana Gainaru, and Valentin Le Fèvre. "Periodic I/O Scheduling for Super-Computers." In Lecture Notes in Computer Science, 44–66. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-72971-8_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Rollason, Jeff. "SUPER-SOMA — Solving Tactical Exchanges in Shogi without Tree Searching." In Computers and Games, 277–96. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45579-5_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Evensen, Geir. "Ocean and Climate Prediction on Parallel Super Computers." In Applied Parallel Computing. New Paradigms for HPC in Industry and Academia, 37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-70734-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Vogels, M. E. S., H. van der Ven, and G. J. Hameetman. "The need for super computers in aerospace research and industry." In High-Performance Computing and Networking, 448–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/bfb0046666.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lu, Kai, Wanqing Chi, Yongpeng Liu, and Hongwei Tang. "HPVZ: A High Performance Virtual Computing Environment for Super Computers." In Lecture Notes in Computer Science, 205–19. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03644-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gadeschi, Gonzalo Brito, Christoph Siewert, Andreas Lintermann, Matthias Meinke, and Wolfgang Schröder. "Towards Large Multi-scale Particle Simulations with Conjugate Heat Transfer on Heterogeneous Super Computers." In High Performance Computing in Science and Engineering ‘14, 307–19. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-10810-0_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Clementi, E., S. Chin, G. Corongiu, J. H. Detrich, M. Dupuis, D. Folsom, G. C. Lie, D. Logan, and V. Sonnad. "Supercomputing and Super Computers: for Science and Engineering in General and for Chemistry and Biosciences in Particular." In Spectroscopy of Inorganic Bioactivators, 1–112. Dordrecht: Springer Netherlands, 1989. http://dx.doi.org/10.1007/978-94-009-2409-3_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Clementi, E., S. Chin, G. Corongiu, J. H. Detrich, M. Dupuis, D. Folsom, G. C. Lie, D. Logan, and V. Sonnad. "Supercomputing and Super Computers: for Science and Engineering in General and for Chemistry and Biosciences in Particular." In Biological and Artificial Intelligence Systems, 319–424. Dordrecht: Springer Netherlands, 1988. http://dx.doi.org/10.1007/978-94-009-3117-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Malashevich, B. M., and D. B. Malashevich. "Modular: The Super Computer." In IFIP Advances in Information and Communication Technology, 164–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-22816-2_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Super computers"

1

Etemaadi, Ramin, and Michel R. V. Chaudron. "Distributed optimization on super computers." In GECCO '14: Genetic and Evolutionary Computation Conference. New York, NY, USA: ACM, 2014. http://dx.doi.org/10.1145/2598394.2605686.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sweet, Roland A. "Mathematical software development for super computers (abstract only)." In the 1985 ACM annual conference. New York, New York, USA: ACM Press, 1985. http://dx.doi.org/10.1145/320435.320561.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Da Costa, Maxime Ferreira, and Yuejie Chi. "Self-Calibrated Super Resolution." In 2019 53rd Asilomar Conference on Signals, Systems, and Computers. IEEE, 2019. http://dx.doi.org/10.1109/ieeeconf44664.2019.9048972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Macagnano, Davide, and Giuseppe Abreu. "Super MDS with heterogeneous information." In 2011 45th Asilomar Conference on Signals, Systems and Computers. IEEE, 2011. http://dx.doi.org/10.1109/acssc.2011.6190272.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sen, Pradeep, and Soheil Darabi. "Compressive image super-resolution." In 2009 Conference Record of the Forty-Third Asilomar Conference on Signals, Systems and Computers. IEEE, 2009. http://dx.doi.org/10.1109/acssc.2009.5469968.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fannjiang, Albert, and Wenjing Liao. "Super-resolution by compressive sensing algorithms." In 2012 46th Asilomar Conference on Signals, Systems and Computers. IEEE, 2012. http://dx.doi.org/10.1109/acssc.2012.6489036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Adar, Nihat, Erol Seke, C. Murat Kandemir, and Kemal Ozkan. "Iterative Super Resolution Reconstruction from Multiple Images Using Cluster Computers." In 2007 IEEE 15th Signal Processing and Communications Applications. IEEE, 2007. http://dx.doi.org/10.1109/siu.2007.4298775.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Koide, Takao, Koji Tsubokura, Satoshi Oda, and Chiaki Namba. "Load Bearing Capacity of Super-Carburized Gears." In ASME 2003 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2003. http://dx.doi.org/10.1115/detc2003/ptg-48016.

Full text
Abstract:
This paper describes a study on the load bearing capacity of super-carburized gears. Test gears and rollers of MAC14 and SCM415 steels were super or eutectoid-carburized under different carburizing conditions. The impact and bending fatigue tests for test gears and the contact fatigue test for test rollers were carried out. The effects of case depths on the impact and bending fatigue strengths of gears and the surface durability of rollers were determined. The impact breaking limit energy of super-carburized gears was found to be larger by about 15% than that of eutectoid-carburized gears irrespective of case depth. The bending fatigue strength of the super-carburized gear was found to be almost equal to that of the eutectoid-carburized gear. The surface durability of the super-carburized roller becomes larger with an increase of case depth and is larger than that of eutectoid-carburized rollers in the case of larger case depth. The surface failure modes for super and eutectoid-carburized rollers were spalling. The load bearing capacity of super and eutectoid-carburized gears was found to become larger by shot-peening.
APA, Harvard, Vancouver, ISO, and other styles
9

Chen, Chen, and James E. Fowler. "Single-image super-resolution using multihypothesis prediction." In 2012 46th Asilomar Conference on Signals, Systems and Computers. IEEE, 2012. http://dx.doi.org/10.1109/acssc.2012.6489079.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Barzigar, Nafise, Aminmohammad Roozgard, Samuel Cheng, and Pramode Verma. "A robust super resolution method for video." In 2012 46th Asilomar Conference on Signals, Systems and Computers. IEEE, 2012. http://dx.doi.org/10.1109/acssc.2012.6489318.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Super computers"

1

Tolmie, D. E., W. St. John, and D. H. DuBois. Super-speed computer interfaces and networks. Office of Scientific and Technical Information (OSTI), October 1997. http://dx.doi.org/10.2172/534509.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Seitter, Keith L., Frank P. Colby, and Jr. Super-Micro Computer Weather Prediction Model. Fort Belvoir, VA: Defense Technical Information Center, August 1989. http://dx.doi.org/10.21236/ada216329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Hunter, S. Computer protection plan for the Superconducing Super Collider Laboratory. Office of Scientific and Technical Information (OSTI), April 1992. http://dx.doi.org/10.2172/65027.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sick, M. Computer-aided mapping of stream channels beneath the Lawrence Livermore National Laboratory Super Fund Site. Office of Scientific and Technical Information (OSTI), December 1994. http://dx.doi.org/10.2172/96646.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McDonald, John F. F-RISC- A 1.0 GOPS Fast Reduced Instruction Set Computer for Super Workstation and Teraops Parallel Processor Applications. Fort Belvoir, VA: Defense Technical Information Center, April 2001. http://dx.doi.org/10.21236/ada394207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Piwinski, A. Computer simulation of satellite resonances caused by the beam-beam interaction at a crossing angle in the SSC (Superconducting Super Collider). Office of Scientific and Technical Information (OSTI), January 1986. http://dx.doi.org/10.2172/6813267.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography