Downloads & Free Reading Options - Results

Algorithm by Hilke Schellmann

Read "Algorithm" by Hilke Schellmann through these free online access and download options.

Search for Downloads

Search by Title or Author

Books Results

Source: The Internet Archive

The internet Archive Search Results

Available books for downloads and borrow from The internet Archive

1(Bonus) A Human Algorithm With Flynn Coleman

By

I've been trying to read books about AI lately to get a firmer grasp on this important topic, and the best book I've read for both a basic grounding of the history and the state of play of AI, but also looking at potential frameworks for the technology, both ethically and socially is A Human Algorithm: How Artificial Intelligence is Redefining Who We Are by Flynn Coleman.Sponsors:PixelUnionMealime

“(Bonus) A Human Algorithm With Flynn Coleman” Metadata:

  • Title: ➤  (Bonus) A Human Algorithm With Flynn Coleman
  • Author:

Edition Identifiers:

Downloads Information:

The book is available for download in "audio" format, the size of the file-s is: 24.84 Mbs, the file-s for this book were downloaded 7 times, the file-s went public at Sat Mar 06 2021.

Available formats:
Archive BitTorrent - Columbia Peaks - Item Tile - Metadata - PNG - Spectrogram - VBR MP3 -

Related Links:

Online Marketplaces

Find (Bonus) A Human Algorithm With Flynn Coleman at online marketplaces:


2Ben's Story Of The Day - Protestors Take A Nip To Facebook's Anti-Nipple Algorithm, Celebratory Shotgun Blasts Nearby School Into Lockdown & Pesky Porn Proves Problematic For Parents

By

Today's edition of Ben's Story of the Day features:1) People were protesting outside of Facebook's offices in London in the hopes of changing the way they moderate pictures of nipples vs tattoos of nipples on breast cancer survivors. Though some protestors dressed up as giant breasts, hopefully no one acted like one.2) Gender reveals have caused much damage and devastation around the world. An expectant father from Tennessee got the good news and simply had to fire off a few celebratory rounds from his shotgun into the air prompting 3 nearby schools to go into lockdown.3) Some collectors have extremely detailed and expensive collections of just about everything you can think of. One such collection was tragically thrown out by a man's parents after he moved out. A lawsuit was filed and won by the 43-year-old man whose parents now have to pay him $30,0441 to cover for the collection of pornography and sex toys.Which one will be crowned Ben's Story of the Day? Which one is your story of the day?

“Ben's Story Of The Day - Protestors Take A Nip To Facebook's Anti-Nipple Algorithm, Celebratory Shotgun Blasts Nearby School Into Lockdown & Pesky Porn Proves Problematic For Parents” Metadata:

  • Title: ➤  Ben's Story Of The Day - Protestors Take A Nip To Facebook's Anti-Nipple Algorithm, Celebratory Shotgun Blasts Nearby School Into Lockdown & Pesky Porn Proves Problematic For Parents
  • Author:

Edition Identifiers:

Downloads Information:

The book is available for download in "audio" format, the size of the file-s is: 7.72 Mbs, the file-s for this book were downloaded 1 times, the file-s went public at Mon Jan 22 2024.

Available formats:
Columbia Peaks - Item Tile - Metadata - PNG - Spectrogram - VBR MP3 -

Related Links:

Online Marketplaces

Find Ben's Story Of The Day - Protestors Take A Nip To Facebook's Anti-Nipple Algorithm, Celebratory Shotgun Blasts Nearby School Into Lockdown & Pesky Porn Proves Problematic For Parents at online marketplaces:


3Efficient Parsing For Natural Language : A Fast Algorithm For Practical Systems

By

Today's edition of Ben's Story of the Day features:1) People were protesting outside of Facebook's offices in London in the hopes of changing the way they moderate pictures of nipples vs tattoos of nipples on breast cancer survivors. Though some protestors dressed up as giant breasts, hopefully no one acted like one.2) Gender reveals have caused much damage and devastation around the world. An expectant father from Tennessee got the good news and simply had to fire off a few celebratory rounds from his shotgun into the air prompting 3 nearby schools to go into lockdown.3) Some collectors have extremely detailed and expensive collections of just about everything you can think of. One such collection was tragically thrown out by a man's parents after he moved out. A lawsuit was filed and won by the 43-year-old man whose parents now have to pay him $30,0441 to cover for the collection of pornography and sex toys.Which one will be crowned Ben's Story of the Day? Which one is your story of the day?

“Efficient Parsing For Natural Language : A Fast Algorithm For Practical Systems” Metadata:

  • Title: ➤  Efficient Parsing For Natural Language : A Fast Algorithm For Practical Systems
  • Author:
  • Language: English

“Efficient Parsing For Natural Language : A Fast Algorithm For Practical Systems” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 225.89 Mbs, the file-s for this book were downloaded 84 times, the file-s went public at Mon May 21 2012.

Available formats:
ACS Encrypted PDF - Abbyy GZ - Animated GIF - Cloth Cover Detection Log - DjVuTXT - Djvu XML - Dublin Core - Item Tile - JSON - LCP Encrypted EPUB - LCP Encrypted PDF - MARC - MARC Binary - MARC Source - Metadata - Metadata Log - OCLC xISBN JSON - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Original JP2 Tar - Single Page Processed JP2 ZIP - Text PDF - WARC CDX Index - Web ARChive GZ - chOCR - hOCR -

Related Links:

Online Marketplaces

Find Efficient Parsing For Natural Language : A Fast Algorithm For Practical Systems at online marketplaces:


4Twitter's Algorithm

By

Twitter's Algorithm, the oldest uploaded version: taken from https://github.com/twitter/the-algorithm

“Twitter's Algorithm” Metadata:

  • Title: Twitter's Algorithm
  • Author:
  • Language: English

“Twitter's Algorithm” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "software" format, the size of the file-s is: 8.09 Mbs, the file-s for this book were downloaded 14 times, the file-s went public at Fri Mar 31 2023.

Available formats:
Archive BitTorrent - Metadata - ZIP -

Related Links:

Online Marketplaces

Find Twitter's Algorithm at online marketplaces:


5Encrypted Algorithm Detector In Cryptography

By

With the increasing reliance on digital communication and data storage, the need for secure cryptographic algorithms has become paramount. However, the rise of encrypted malware and unauthorized encrypted communications poses a significant challenge to cybersecurity. This paper presents an Encrypted Algorithm Detector using Cryptography, a system designed to verifying and identify encryption algorithms embedded within data transmissions or software applications. The proposed system leverages cryptographic fingerprinting techniques, statistical analysis, and machine learning models to detect and classify encryption methods such as AES, RSA, DES, and other cryptographic schemes. The detector functions by analyzing entropy levels, byte distribution, and frequency patterns to distinguish between encrypted and non-encrypted data. This approach can be applied in cybersecurity for malware detection, forensic investigations, and preventing unauthorized encrypted data transmission in secure environments. The implementation of this system contributes to strengthening cybersecurity measures by enabling early detection of encrypted threats and ensuring compliance with security protocols.

“Encrypted Algorithm Detector In Cryptography” Metadata:

  • Title: ➤  Encrypted Algorithm Detector In Cryptography
  • Author: ➤  
  • Language: English

“Encrypted Algorithm Detector In Cryptography” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 7.97 Mbs, the file-s for this book were downloaded 6 times, the file-s went public at Mon May 26 2025.

Available formats:
Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Processed JP2 ZIP - Text PDF - chOCR - hOCR -

Related Links:

Online Marketplaces

Find Encrypted Algorithm Detector In Cryptography at online marketplaces:


6CP-NR Distributed Range Free Localization Algorithm In WSN

By

Advancements in wireless communication technology have empowered the researchers to develop large scale wireless networks with huge number of sensor nodes. In these networks localization is very active field of research. Localization is a way to determine the physical position of sensor nodes which is useful in many aspects such as to find the origin of events, routing and network coverage. Locating nodes with GPS systems is expensive, power consuming and not applicable to indoor environments. Localization in three dimensional space and accuracy of the estimated location are two factors of major concern. In this paper, a new three dimensional Distributed range-free algorithm which is known as CP-NR is proposed. This algorithm has high localization accuracy and resolved the problem of existing NR algorithm. CP-NR (Coplanar and Projected Node Reproduction) algorithm makes use of co-planarity and projection of point on plane concepts to reduce the localization error. Results have shown that CP-NR algorithm is superior to NR algorithm and comparison is done for the localization accuracy with respect to variations in range, anchor density and node density.

“CP-NR Distributed Range Free Localization Algorithm In WSN” Metadata:

  • Title: ➤  CP-NR Distributed Range Free Localization Algorithm In WSN
  • Author: ➤  

“CP-NR Distributed Range Free Localization Algorithm In WSN” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 13.74 Mbs, the file-s for this book were downloaded 46 times, the file-s went public at Thu Feb 10 2022.

Available formats:
Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Processed JP2 ZIP - Text PDF - chOCR - hOCR -

Related Links:

Online Marketplaces

Find CP-NR Distributed Range Free Localization Algorithm In WSN at online marketplaces:


7ERIC ED639517: Edu-Social Algorithm: A Methodological Model For Using Smartphones And Instagram In Generation Alpha's Education Through A Community Of Virtual Practices

By

The Edu-social Algorithm research project aims to construct a micro-pedagogical, experimental, digital research action to create a methodological model using the functions and algorithms found in social media used by Generation Alpha (specifically Instagram). The project is the manifestation of an explorative research path seeking to alter the algorithms that form the basis of all the major platforms in current cyberspace, and in "Big Tech". This alteration is possible through the development of a community of virtual practice, consisting of students and faculty working within Instagram through an interactive approach, to take pedagogical advantage of their mobile phones and apps. The qualitative results show a series of media-educational content evidencing the pedagogical potential of the social media platform Instagram, and the possibility of reproducing the developed methodological model. The relationships between digital education, social media, and active learning are the prevalent components of this work. Along with these main aspects, this research will also treat the relationship between educational reciprocity and the ownership of knowledge, though the goal of the research action is not only to create a digital methodological model, but a community of virtual practices founded on the approach derived by the didactic strategies intrinsic to the Edu-social Algorithm. The practical aspect of this research involves a target group of classes in the final year of middle schools, reaching a total of 98 students and 57 teaching faculty, participating in the Edu-social Algorithm across seven classrooms in three different schools in Palermo (Italy). The students in the experimental classrooms showed, compared with the control classrooms which followed a traditional model, the possibility of learning through social media and improving one's own scholastic performance, intentionally leaving smartphones on in the classroom, when used in conjunction with educational strategies designed for healthy smartphone use in teaching and learning. [For the full proceedings, see ED639391.]

“ERIC ED639517: Edu-Social Algorithm: A Methodological Model For Using Smartphones And Instagram In Generation Alpha's Education Through A Community Of Virtual Practices” Metadata:

  • Title: ➤  ERIC ED639517: Edu-Social Algorithm: A Methodological Model For Using Smartphones And Instagram In Generation Alpha's Education Through A Community Of Virtual Practices
  • Author:
  • Language: English

“ERIC ED639517: Edu-Social Algorithm: A Methodological Model For Using Smartphones And Instagram In Generation Alpha's Education Through A Community Of Virtual Practices” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 10.26 Mbs, the file-s for this book were downloaded 4 times, the file-s went public at Thu Jan 23 2025.

Available formats:
Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Processed JP2 ZIP - Text PDF - chOCR - hOCR -

Related Links:

Online Marketplaces

Find ERIC ED639517: Edu-Social Algorithm: A Methodological Model For Using Smartphones And Instagram In Generation Alpha's Education Through A Community Of Virtual Practices at online marketplaces:


8The Forcelab Edition (Composure Mixed By Algorithm)

By

Tracklist: 1. Untitled 2. Untitled 3. Untitled 4. Untitled 5. Untitled 6. Untitled 7. Untitled 8. Untitled 9. Untitled 10. Untitled 11. Untitled 12. Untitled 13. Untitled 14. Untitled 15. Untitled 16. Untitled

“The Forcelab Edition (Composure Mixed By Algorithm)” Metadata:

  • Title: ➤  The Forcelab Edition (Composure Mixed By Algorithm)
  • Author:
  • Language: English

“The Forcelab Edition (Composure Mixed By Algorithm)” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "audio" format, the size of the file-s is: 553.74 Mbs, the file-s for this book were downloaded 16 times, the file-s went public at Mon Feb 03 2025.

Available formats:
Columbia Peaks - Cue Sheet - DjVuTXT - Djvu XML - Flac - Generic Raw Book Zip - Item Image - Item Tile - Log - M3U - MP3 Sample - Metadata - OCR Page Index - OCR Search Text - PNG - Page Numbers JSON - Scandata - Scandata JSON - Single Page Processed JP2 ZIP - Spectrogram - Text PDF - VBR MP3 - chOCR - hOCR -

Related Links:

Online Marketplaces

Find The Forcelab Edition (Composure Mixed By Algorithm) at online marketplaces:


9ERIC EJ844400: Teachers' Use Of A Verbally Governed Algorithm And Student Learning

By

The effects of instructing teachers in the use of a verbally governed algorithm to solve students' learning problems were measured. The teachers were taught to analyze students' responses to instruction using a strategic protocol, which included a series of verbally governed questions. The study was designed to determine whether the instructional method would affect the number of verbally governed decisions which the teachers made as well as the number of academic objectives achieved by the teachers' students. A multiple baseline design across three teachers and six students was used to measure the effectiveness of the instructional procedures. The results indicated that the teachers' students achieved significantly more learning objectives when they used a verbally governed algorithm to solve instructional problems. (Contains 4 tables and 5 figures.)

“ERIC EJ844400: Teachers' Use Of A Verbally Governed Algorithm And Student Learning” Metadata:

  • Title: ➤  ERIC EJ844400: Teachers' Use Of A Verbally Governed Algorithm And Student Learning
  • Author:
  • Language: English

“ERIC EJ844400: Teachers' Use Of A Verbally Governed Algorithm And Student Learning” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 12.20 Mbs, the file-s for this book were downloaded 74 times, the file-s went public at Thu May 26 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find ERIC EJ844400: Teachers' Use Of A Verbally Governed Algorithm And Student Learning at online marketplaces:


10DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm To Improve The Computational Performance Of Monte Carlo Codes

By

DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm to Improve the Computational Performance of Monte Carlo Codes 作者: WU, Dr. Jiajun Zhang, Dr. Hui 1 HU, Dr. Ankang PU, Mr. Yanheng 1 Wu, Dr. Zhen 1 QIU, Dr. RUI 邱睿 LI, Prof. JUNLI 作者单位: 1. Tsinghua University 通讯作者: Wu, Dr. Zhen Email:[email protected] 提交时间: 2024-12-16 13:39:34 摘要: This paper introduces a novel algorithm aimed at enhancing the computational performance of Monte Carlo codes: A Dynamic Adaptive Load Balancing Algorithm for Monte Carlo Codes (DALB-MC algorithm). With the widespread use of multicore processors, some Monte Carlo codes have been adapted to leverage both local thread parallelism and global parallelism through message passing between nodes, enabling concurrent execution of independent tasks and efficient merging of results. However, as shielding engineering problems increase in complexity and computational environments become more heterogeneous, traditional parallel computing algorithms face limitations in handling Monte Carlo simulations, particularly in ensuring adapting to diverse hardware resources. The proposed DALB-MC algorithm addresses these challenges by dynamically partitioning tasks into multiple sub-tasks and allocating them in real-time based on the computational capacity of each node, thereby optimizing resource utilization and reducing overall simulation time. In this study, we implement DALB-MC algorithm on MCShield and demonstrate the correctness and effectiveness of the algorithm in improving the performance of the Monte Carlo code through self-defined arithmetic examples. The experimental results show that compared with original algorithm, DALB-MC algorithm achieves about 20% computation time acceleration in massively parallel computation and significantly improves the overall efficiency of the program. In addition, a Linux supercomputing platform is used to test a complex benchmark case to further verify the optimization effect of DALB-MC algorithm under the computational scale of real engineering applications. Monte Carlo simulation Parallel computing efficiency Load balancing algorithm MCShield Multicore processors 来自: WU, Dr. Jiajun 分类: 物理学 >> 核物理学 备注: 已向《Nuclear Science and Techniques》投稿 引用: ChinaXiv:202412.00184 (或此版本 ChinaXiv:202412.00184V1 ) DOI:10.12074/202412.00184 CSTR:32003.36.ChinaXiv.202412.00184 推荐引用方式: WU, Dr. Jiajun,Zhang, Dr. Hui,HU, Dr. Ankang,PU, Mr. Yanheng,Wu, Dr. Zhen,QIU, Dr. RUI 邱睿,LI, Prof. JUNLI.DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm to Improve the Computational Performance of Monte Carlo Codes.中国科学院科技论文预发布平台.[DOI:10.12074/202412.00184] 版本历史 [V1] 2024-12-16 13:39:34 ChinaXiv:202412.00184V1 下载全文

“DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm To Improve The Computational Performance Of Monte Carlo Codes” Metadata:

  • Title: ➤  DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm To Improve The Computational Performance Of Monte Carlo Codes
  • Authors: ➤  

“DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm To Improve The Computational Performance Of Monte Carlo Codes” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 10.64 Mbs, the file-s for this book were downloaded 3 times, the file-s went public at Mon Apr 07 2025.

Available formats:
Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Processed JP2 ZIP - Text PDF - chOCR - hOCR -

Related Links:

Online Marketplaces

Find DALB-MC: A Novel Dynamic Adaptive Loading Balance Algorithm To Improve The Computational Performance Of Monte Carlo Codes at online marketplaces:


11Digital Watermarking Using Hybrid Grasshopper Optimization Algorithm And Genetic Algorithm ( HGOAGA)

By

The advancement of computer technology has raised significant issues with digital content piracy and copyright law. A popular method of protecting copyright and related uses is digital watermarking. Various algorithms have been developed to address the need for invisible performance and robustness in digital watermarking schemes. Here, we proposed a novel evolutionary algorithm, the hybrid Grass Hopper Optimization algorithm, and the Genetic algorithm (HGOAGA) for optimizing multiple scaling factors in the digital watermarking scheme in the frequency domain of hybrid Discrete Wavelet Transformation (DWT) and Singular Value Decomposition (SVD) method (hybrid DWT-SVD). The subcomponents of the image are determined by calculating the DWT of the cover image. The problem is determining the best scaling factor for watermarking after converting the subcomponent to the frequency domain using SVD. In HGOAGA, an optimal solution of multiple scaling factors is found after several iterations, starting with a set of randomly generated solutions. The advantages of GOA and GA are combined in the HGOAGA to balance exploration and exploitation functionalities. Furthermore, HGOAGA can converge quickly and escape local optima well. Some standard images were used in the MATLAB environment to test the proposed algorithm. The evaluation of the experiment was carried out using various metrics such as the Structural Similarity Index (SSIM), the Normalized Cross-Correlation (NCC), and the Peak Signal-to-Noise Ratio (PSNR). The experimental results of the tests showed a PSNR value of 51db for the proposed method compared to existing methods, and they are best suited to solving conflict problems between robustness and quality.

“Digital Watermarking Using Hybrid Grasshopper Optimization Algorithm And Genetic Algorithm ( HGOAGA)” Metadata:

  • Title: ➤  Digital Watermarking Using Hybrid Grasshopper Optimization Algorithm And Genetic Algorithm ( HGOAGA)
  • Author: ➤  
  • Language: English

“Digital Watermarking Using Hybrid Grasshopper Optimization Algorithm And Genetic Algorithm ( HGOAGA)” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 12.49 Mbs, the file-s for this book were downloaded 10 times, the file-s went public at Tue Sep 03 2024.

Available formats:
Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Processed JP2 ZIP - Text PDF - chOCR - hOCR -

Related Links:

Online Marketplaces

Find Digital Watermarking Using Hybrid Grasshopper Optimization Algorithm And Genetic Algorithm ( HGOAGA) at online marketplaces:


12An Heuristic Scheduling Algorithm For Resource-constrained Project Networks.

By

The advancement of computer technology has raised significant issues with digital content piracy and copyright law. A popular method of protecting copyright and related uses is digital watermarking. Various algorithms have been developed to address the need for invisible performance and robustness in digital watermarking schemes. Here, we proposed a novel evolutionary algorithm, the hybrid Grass Hopper Optimization algorithm, and the Genetic algorithm (HGOAGA) for optimizing multiple scaling factors in the digital watermarking scheme in the frequency domain of hybrid Discrete Wavelet Transformation (DWT) and Singular Value Decomposition (SVD) method (hybrid DWT-SVD). The subcomponents of the image are determined by calculating the DWT of the cover image. The problem is determining the best scaling factor for watermarking after converting the subcomponent to the frequency domain using SVD. In HGOAGA, an optimal solution of multiple scaling factors is found after several iterations, starting with a set of randomly generated solutions. The advantages of GOA and GA are combined in the HGOAGA to balance exploration and exploitation functionalities. Furthermore, HGOAGA can converge quickly and escape local optima well. Some standard images were used in the MATLAB environment to test the proposed algorithm. The evaluation of the experiment was carried out using various metrics such as the Structural Similarity Index (SSIM), the Normalized Cross-Correlation (NCC), and the Peak Signal-to-Noise Ratio (PSNR). The experimental results of the tests showed a PSNR value of 51db for the proposed method compared to existing methods, and they are best suited to solving conflict problems between robustness and quality.

“An Heuristic Scheduling Algorithm For Resource-constrained Project Networks.” Metadata:

  • Title: ➤  An Heuristic Scheduling Algorithm For Resource-constrained Project Networks.
  • Author:
  • Language: en_US

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 107.33 Mbs, the file-s for this book were downloaded 233 times, the file-s went public at Fri Jun 08 2012.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - Cloth Cover Detection Log - Contents - DjVu - DjVuTXT - Djvu XML - Dublin Core - Item Tile - MARC - MARC Binary - MARC Source - Metadata - OCR Page Index - OCR Search Text - Page Numbers JSON - Scandata - Single Page Original JP2 Tar - Single Page Processed JP2 ZIP - Text PDF - chOCR - hOCR -

Related Links:

Online Marketplaces

Find An Heuristic Scheduling Algorithm For Resource-constrained Project Networks. at online marketplaces:


13Narcissa - Thank You @GlaceGwyneth For Algorithm Help

By

thank you @GlaceGwyneth for algorithm help https://t.co/1So0BlS594 Source: https://twitter.com/narcissawright/status/1252788704265060354 Uploader: Narcissa

“Narcissa - Thank You @GlaceGwyneth For Algorithm Help” Metadata:

  • Title: ➤  Narcissa - Thank You @GlaceGwyneth For Algorithm Help
  • Author:

“Narcissa - Thank You @GlaceGwyneth For Algorithm Help” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "movies" format, the size of the file-s is: 0.56 Mbs, the file-s for this book were downloaded 7 times, the file-s went public at Sun Dec 20 2020.

Available formats:
Item Tile - JPEG - JPEG Thumb - JSON - MPEG4 - Metadata - Thumbnail - Unknown - h.264 IA -

Related Links:

Online Marketplaces

Find Narcissa - Thank You @GlaceGwyneth For Algorithm Help at online marketplaces:


14NASA Technical Reports Server (NTRS) 19960036988: Clouds And The Earth's Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume 3; Cloud Analyses And Determination Of Improved Top Of Atmosphere Fluxes (Subsystem 4)

By

The theoretical bases for the Release 1 algorithms that will be used to process satellite data for investigation of the Clouds and Earth's Radiant Energy System (CERES) are described. The architecture for software implementation of the methodologies is outlined. Volume 3 details the advanced CERES methods for performing scene identification and inverting each CERES scanner radiance to a top-of-the-atmosphere (TOA) flux. CERES determines cloud fraction, height, phase, effective particle size, layering, and thickness from high-resolution, multispectral imager data. CERES derives cloud properties for each pixel of the Tropical Rainfall Measuring Mission (TRMM) visible and infrared scanner and the Earth Observing System (EOS) moderate-resolution imaging spectroradiometer. Cloud properties for each imager pixel are convolved with the CERES footprint point spread function to produce average cloud properties for each CERES scanner radiance. The mean cloud properties are used to determine an angular distribution model (ADM) to convert each CERES radiance to a TOA flux. The TOA fluxes are used in simple parameterization to derive surface radiative fluxes. This state-of-the-art cloud-radiation product will be used to substantially improve our understanding of the complex relationship between clouds and the radiation budget of the Earth-atmosphere system.

“NASA Technical Reports Server (NTRS) 19960036988: Clouds And The Earth's Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume 3; Cloud Analyses And Determination Of Improved Top Of Atmosphere Fluxes (Subsystem 4)” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19960036988: Clouds And The Earth's Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume 3; Cloud Analyses And Determination Of Improved Top Of Atmosphere Fluxes (Subsystem 4)
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 19960036988: Clouds And The Earth's Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume 3; Cloud Analyses And Determination Of Improved Top Of Atmosphere Fluxes (Subsystem 4)” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 278.83 Mbs, the file-s for this book were downloaded 306 times, the file-s went public at Mon Oct 10 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19960036988: Clouds And The Earth's Radiant Energy System (CERES) Algorithm Theoretical Basis Document. Volume 3; Cloud Analyses And Determination Of Improved Top Of Atmosphere Fluxes (Subsystem 4) at online marketplaces:


15MASS – Modified Assignment Algorithm In Facilities Layout Planning

By

In this paper we have proposed a semi-heuristic optimization algorithm for designing optimal plant layouts in process-focused manufacturing/service facilities. Our proposed algorithm marries the well-known CRAFT (Computerized Relative Allocation of Facilities Technique) with the Hungarian assignment algorithm. Being a semi-heuristic search, our algorithm is likely to be more efficient in terms of computer CPU engagement time as it tends to converge on the global optimum faster than the traditional CRAFT algorithm - a pure heuristic. We also present a numerical illustration of our algorithm.

“MASS – Modified Assignment Algorithm In Facilities Layout Planning” Metadata:

  • Title: ➤  MASS – Modified Assignment Algorithm In Facilities Layout Planning
  • Author: ➤  
  • Language: English

“MASS – Modified Assignment Algorithm In Facilities Layout Planning” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 4.96 Mbs, the file-s for this book were downloaded 96 times, the file-s went public at Thu Nov 19 2015.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find MASS – Modified Assignment Algorithm In Facilities Layout Planning at online marketplaces:


16Wiki - Chair 11: ALGORITHM ENGINEERING — Lehrstuhl 11 Algorithm Engineering

DokuWiki: Chair 11: ALGORITHM ENGINEERING — Lehrstuhl 11 Algorithm Engineering Dumped with DokuWiki-Dumper v0.1.44, and uploaded with dokuWikiUploader v0.1.44.

“Wiki - Chair 11: ALGORITHM ENGINEERING — Lehrstuhl 11 Algorithm Engineering” Metadata:

  • Title: ➤  Wiki - Chair 11: ALGORITHM ENGINEERING — Lehrstuhl 11 Algorithm Engineering
  • Language: English

“Wiki - Chair 11: ALGORITHM ENGINEERING — Lehrstuhl 11 Algorithm Engineering” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "web" format, the size of the file-s is: 2288.02 Mbs, the file-s for this book were downloaded 2 times, the file-s went public at Thu Oct 03 2024.

Available formats:
7z - Archive BitTorrent - HTML - JSON - Metadata - Text - Unknown -

Related Links:

Online Marketplaces

Find Wiki - Chair 11: ALGORITHM ENGINEERING — Lehrstuhl 11 Algorithm Engineering at online marketplaces:


17OhjyA & Its Algorithm Arabic

By

OhjyA is an ASCII-text file encryption program. OhjyA carries a unique encryption algrithm. This e-booklet explains OhjyA and its algorithm. This is the Arabic version. Ghasan Al-Sakkaf

“OhjyA & Its Algorithm Arabic” Metadata:

  • Title: OhjyA & Its Algorithm Arabic
  • Author:
  • Language: Arabic - العربية

“OhjyA & Its Algorithm Arabic” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "data" format, the size of the file-s is: 0.40 Mbs, the file-s for this book were downloaded 71 times, the file-s went public at Wed Nov 17 2010.

Available formats:
Archive BitTorrent - Metadata - Unknown -

Related Links:

Online Marketplaces

Find OhjyA & Its Algorithm Arabic at online marketplaces:


18NASA Technical Reports Server (NTRS) 19690026850: A Computational Algorithm For Sequential Estimation

By

Algorithm for computing sequential least squares estimates with process noise

“NASA Technical Reports Server (NTRS) 19690026850: A Computational Algorithm For Sequential Estimation” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19690026850: A Computational Algorithm For Sequential Estimation
  • Author: ➤  
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 17.54 Mbs, the file-s for this book were downloaded 65 times, the file-s went public at Sun Jul 03 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19690026850: A Computational Algorithm For Sequential Estimation at online marketplaces:


19NASA Technical Reports Server (NTRS) 19740019222: An Algorithm For A General Class Of Routing Problems Derived From Huygens' Principle

By

If a set of N points or nodes with a nonnegative cost associated with each ordered pair is known, it is desired to find a path from one given node to another given node which minimizes the cost sum. An algorithm is presented which yields a global minimum solution after at most N - 1 iterations or on a typical large third-generation computer, after 1 hour of computation time for a 10,000-node problem. The rapid-access data storage capacity demanded by the algorithm is approximately 3N words for costs read in from slow-access storage or 2N words for calculable costs. The time-storage requirements of the algorithm known to the authors. When the problem is viewed as a discretized optimal control problem, after N-1 iterations, an optimal control or node transition is established for each of the N nodes or states; thus, the algorithm can be applied to situations were there may be errors in the control that necessitate a closed loop control that necessitate a closed loop control philosophy.

“NASA Technical Reports Server (NTRS) 19740019222: An Algorithm For A General Class Of Routing Problems Derived From Huygens' Principle” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19740019222: An Algorithm For A General Class Of Routing Problems Derived From Huygens' Principle
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 19740019222: An Algorithm For A General Class Of Routing Problems Derived From Huygens' Principle” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 10.08 Mbs, the file-s for this book were downloaded 58 times, the file-s went public at Thu Jul 14 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19740019222: An Algorithm For A General Class Of Routing Problems Derived From Huygens' Principle at online marketplaces:


20NASA Technical Reports Server (NTRS) 19780018852: On Improving The Iterative Convergence Properties Of An Implicit Approximate-factorization Finite Difference Algorithm. [considering Transonic Flow

By

The iterative convergence properties of an approximate-factorization implicit finite-difference algorithm are analyzed both theoretically and numerically. Modifications to the base algorithm were made to remove the inconsistency in the original implementation of artificial dissipation. In this way, the steady-state solution became independent of the time-step, and much larger time-steps can be used stably. To accelerate the iterative convergence, large time-steps and a cyclic sequence of time-steps were used. For a model transonic flow problem governed by the Euler equations, convergence was achieved with 10 times fewer time-steps using the modified differencing scheme. A particular form of instability due to variable coefficients is also analyzed.

“NASA Technical Reports Server (NTRS) 19780018852: On Improving The Iterative Convergence Properties Of An Implicit Approximate-factorization Finite Difference Algorithm. [considering Transonic Flow” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19780018852: On Improving The Iterative Convergence Properties Of An Implicit Approximate-factorization Finite Difference Algorithm. [considering Transonic Flow
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 19780018852: On Improving The Iterative Convergence Properties Of An Implicit Approximate-factorization Finite Difference Algorithm. [considering Transonic Flow” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 72.66 Mbs, the file-s for this book were downloaded 94 times, the file-s went public at Sat Jul 30 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19780018852: On Improving The Iterative Convergence Properties Of An Implicit Approximate-factorization Finite Difference Algorithm. [considering Transonic Flow at online marketplaces:


21NASA Technical Reports Server (NTRS) 19760019334: A Block Iterative Finite Element Algorithm For Numerical Solution Of The Steady-state, Compressible Navier-Stokes Equations

By

An iterative method for numerically solving the time independent Navier-Stokes equations for viscous compressible flows is presented. The method is based upon partial application of the Gauss-Seidel principle in block form to the systems of nonlinear algebraic equations which arise in construction of finite element (Galerkin) models approximating solutions of fluid dynamic problems. The C deg-cubic element on triangles is employed for function approximation. Computational results for a free shear flow at Re = 1,000 indicate significant achievement of economy in iterative convergence rate over finite element and finite difference models which employ the customary time dependent equations and asymptotic time marching procedure to steady solution. Numerical results are in excellent agreement with those obtained for the same test problem employing time marching finite element and finite difference solution techniques.

“NASA Technical Reports Server (NTRS) 19760019334: A Block Iterative Finite Element Algorithm For Numerical Solution Of The Steady-state, Compressible Navier-Stokes Equations” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19760019334: A Block Iterative Finite Element Algorithm For Numerical Solution Of The Steady-state, Compressible Navier-Stokes Equations
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 19760019334: A Block Iterative Finite Element Algorithm For Numerical Solution Of The Steady-state, Compressible Navier-Stokes Equations” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 19.94 Mbs, the file-s for this book were downloaded 71 times, the file-s went public at Wed Jul 20 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19760019334: A Block Iterative Finite Element Algorithm For Numerical Solution Of The Steady-state, Compressible Navier-Stokes Equations at online marketplaces:


22NASA Technical Reports Server (NTRS) 19700030548: An Algorithm For Computing Spherical Partials

By

Algorithm for computing acceleration and partial derivatives in satellite equations of motion, using recurrences in spherical coordinates

“NASA Technical Reports Server (NTRS) 19700030548: An Algorithm For Computing Spherical Partials” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19700030548: An Algorithm For Computing Spherical Partials
  • Author: ➤  
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 25.85 Mbs, the file-s for this book were downloaded 77 times, the file-s went public at Tue Jul 05 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - JPEG Thumb - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19700030548: An Algorithm For Computing Spherical Partials at online marketplaces:


23A Simple Algorithm For Extending The Identities For Quantum Minors To The Multiparametric Case

By

For any homogeneous identity between $q$-minors, we provide an identity between $P,Q$-minors.

“A Simple Algorithm For Extending The Identities For Quantum Minors To The Multiparametric Case” Metadata:

  • Title: ➤  A Simple Algorithm For Extending The Identities For Quantum Minors To The Multiparametric Case
  • Author:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 3.26 Mbs, the file-s for this book were downloaded 74 times, the file-s went public at Mon Sep 23 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find A Simple Algorithm For Extending The Identities For Quantum Minors To The Multiparametric Case at online marketplaces:


24The Algorithm For Simulating Of Phase Transition In Ising Magnetic

By

Simple algorithm of dynamics of Ising magnetic is described. The algorithm can be implemented on conventional digital computer and can be used for construction of specialized processor for simulation of ferromagnetic systems. The algorithm gives a simple way to calculate 1D correlation functions for 1D Ising magnetic.

“The Algorithm For Simulating Of Phase Transition In Ising Magnetic” Metadata:

  • Title: ➤  The Algorithm For Simulating Of Phase Transition In Ising Magnetic
  • Author:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 3.21 Mbs, the file-s for this book were downloaded 52 times, the file-s went public at Fri Sep 20 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find The Algorithm For Simulating Of Phase Transition In Ising Magnetic at online marketplaces:


25A Fast Algorithm And Datalog Inexpressibility For Temporal Reasoning

By

We introduce a new tractable temporal constraint language, which strictly contains the Ord-Horn language of Buerkert and Nebel and the class of AND/OR precedence constraints. The algorithm we present for this language decides whether a given set of constraints is consistent in time that is quadratic in the input size. We also prove that (unlike Ord-Horn) this language cannot be solved by Datalog or by establishing local consistency.

“A Fast Algorithm And Datalog Inexpressibility For Temporal Reasoning” Metadata:

  • Title: ➤  A Fast Algorithm And Datalog Inexpressibility For Temporal Reasoning
  • Authors:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 12.00 Mbs, the file-s for this book were downloaded 96 times, the file-s went public at Sun Sep 22 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find A Fast Algorithm And Datalog Inexpressibility For Temporal Reasoning at online marketplaces:


26A Prolongation-projection Algorithm For Computing The Finite Real Variety Of An Ideal

By

We provide a real algebraic symbolic-numeric algorithm for computing the real variety $V_R(I)$ of an ideal $I$, assuming it is finite while $V_C(I)$ may not be. Our approach uses sets of linear functionals on $R[X]$, vanishing on a given set of polynomials generating $I$ and their prolongations up to a given degree, as well as on polynomials of the real radical ideal of $I$, obtained from the kernel of a suitably defined moment matrix assumed to be positive semidefinite and of maximum rank. We formulate a condition on the dimensions of projections of these sets of linear functionals, which serves as stopping criterion for our algorithm. This algorithm, based on standard numerical linear algebra routines and semidefinite optimization, combines techniques from previous work of the authors together with an existing algorithm for the complex variety. This results in a unified methodology for the real and complex cases.

“A Prolongation-projection Algorithm For Computing The Finite Real Variety Of An Ideal” Metadata:

  • Title: ➤  A Prolongation-projection Algorithm For Computing The Finite Real Variety Of An Ideal
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 10.66 Mbs, the file-s for this book were downloaded 69 times, the file-s went public at Wed Sep 18 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find A Prolongation-projection Algorithm For Computing The Finite Real Variety Of An Ideal at online marketplaces:


27An Analytical Application Of Niedermayer's Algorithm To The Edwards-Anderson Model: Analytical Results For The Multicritical Point On The Nishimori Line

By

We apply analytically Niedermayer's algorithm to the Edwards-Anderson model on random graphs with arbitary degree distributions. The results for the multicritical point on the Nishimori line are shown. The results are shown by applying a criterion for spin models on the random graphs with arbitary degree distributions. The application of Niedermayer's algorithm makes the size of the Fortuin-Kasteleyn cluster small and shifts the percolation threshold. The results for the $\pm J$ model and the Gaussian model are respectively shown. In the present article, it is respectively shown for the $\pm J$ model and the Gaussian model that, by adjusting an introduced parameter for Niedermayer's algorithm, the percolation threshold obtained in the present article agrees with the location of the multicritical point. We naively estimate the locations of the multicritical points for the $\pm J$ model and the Gaussian model on the randam graphs with arbitary degree distributions.

“An Analytical Application Of Niedermayer's Algorithm To The Edwards-Anderson Model: Analytical Results For The Multicritical Point On The Nishimori Line” Metadata:

  • Title: ➤  An Analytical Application Of Niedermayer's Algorithm To The Edwards-Anderson Model: Analytical Results For The Multicritical Point On The Nishimori Line
  • Author:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 4.46 Mbs, the file-s for this book were downloaded 94 times, the file-s went public at Mon Sep 23 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - JPEG Thumb - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find An Analytical Application Of Niedermayer's Algorithm To The Edwards-Anderson Model: Analytical Results For The Multicritical Point On The Nishimori Line at online marketplaces:


28An Approximation Algorithm For Approximation Rank

By

One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix--the minimum rank of a matrix which is entrywise close to the communication matrix. This technique has two main drawbacks: it is difficult to compute, and it is not known to lower bound quantum communication complexity with entanglement. Linial and Shraibman recently introduced a norm, called gamma_2^{alpha}, to quantum communication complexity, showing that it can be used to lower bound communication with entanglement. Here the parameter alpha is a measure of approximation which is related to the allowable error probability of the protocol. This bound can be written as a semidefinite program and gives bounds at least as large as many techniques in the literature, although it is smaller than the corresponding alpha-approximation rank, rk_alpha. We show that in fact log gamma_2^{alpha}(A)$ and log rk_{alpha}(A)$ agree up to small factors. As corollaries we obtain a constant factor polynomial time approximation algorithm to the logarithm of approximate rank, and that the logarithm of approximation rank is a lower bound for quantum communication complexity with entanglement.

“An Approximation Algorithm For Approximation Rank” Metadata:

  • Title: ➤  An Approximation Algorithm For Approximation Rank
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 4.74 Mbs, the file-s for this book were downloaded 90 times, the file-s went public at Wed Sep 18 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find An Approximation Algorithm For Approximation Rank at online marketplaces:


29Thresholded Basis Pursuit: An LP Algorithm For Achieving Optimal Support Recovery For Sparse And Approximately Sparse Signals From Noisy Random Measurements

By

In this paper we present a linear programming solution for sign pattern recovery of a sparse signal from noisy random projections of the signal. We consider two types of noise models, input noise, where noise enters before the random projection; and output noise, where noise enters after the random projection. Sign pattern recovery involves the estimation of sign pattern of a sparse signal. Our idea is to pretend that no noise exists and solve the noiseless $\ell_1$ problem, namely, $\min \|\beta\|_1 ~ s.t. ~ y=G \beta$ and quantizing the resulting solution. We show that the quantized solution perfectly reconstructs the sign pattern of a sufficiently sparse signal. Specifically, we show that the sign pattern of an arbitrary k-sparse, n-dimensional signal $x$ can be recovered with $SNR=\Omega(\log n)$ and measurements scaling as $m= \Omega(k \log{n/k})$ for all sparsity levels $k$ satisfying $0 < k \leq \alpha n$, where $\alpha$ is a sufficiently small positive constant. Surprisingly, this bound matches the optimal \emph{Max-Likelihood} performance bounds in terms of $SNR$, required number of measurements, and admissible sparsity level in an order-wise sense. In contrast to our results, previous results based on LASSO and Max-Correlation techniques either assume significantly larger $SNR$, sublinear sparsity levels or restrictive assumptions on signal sets. Our proof technique is based on noisy perturbation of the noiseless $\ell_1$ problem, in that, we estimate the maximum admissible noise level before sign pattern recovery fails.

“Thresholded Basis Pursuit: An LP Algorithm For Achieving Optimal Support Recovery For Sparse And Approximately Sparse Signals From Noisy Random Measurements” Metadata:

  • Title: ➤  Thresholded Basis Pursuit: An LP Algorithm For Achieving Optimal Support Recovery For Sparse And Approximately Sparse Signals From Noisy Random Measurements
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 17.05 Mbs, the file-s for this book were downloaded 88 times, the file-s went public at Wed Sep 18 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Thresholded Basis Pursuit: An LP Algorithm For Achieving Optimal Support Recovery For Sparse And Approximately Sparse Signals From Noisy Random Measurements at online marketplaces:


30Operational Optimal Ship Routing Using A Hybrid Parallel Genetic Algorithm

By

Optimization of ship routing depends on several parameters, like ship and cargo characteristics, environmental factors, topography, international navigation rules, crew comfort etc. The complex nature of the problem leads to oversimplifications in analytical techniques, while stochastic methods like simulated annealing can be both time consuming and sensitive to local minima. In this work, a hybrid parallel genetic algorithm - estimation of distribution algorithm is developed in the island model, to operationally calculate the optimal ship routing. The technique, which is applicable not only to clusters but to grids as well, is very fast and has been applied to very difficult environments, like the Greek seas with thousands of islands and extreme micro-climate conditions.

“Operational Optimal Ship Routing Using A Hybrid Parallel Genetic Algorithm” Metadata:

  • Title: ➤  Operational Optimal Ship Routing Using A Hybrid Parallel Genetic Algorithm
  • Authors:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 7.57 Mbs, the file-s for this book were downloaded 96 times, the file-s went public at Sun Sep 22 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Operational Optimal Ship Routing Using A Hybrid Parallel Genetic Algorithm at online marketplaces:


31On The Nearest Neighbor Algorithm For Mean Field Traveling Salesman Problem

Optimization of ship routing depends on several parameters, like ship and cargo characteristics, environmental factors, topography, international navigation rules, crew comfort etc. The complex nature of the problem leads to oversimplifications in analytical techniques, while stochastic methods like simulated annealing can be both time consuming and sensitive to local minima. In this work, a hybrid parallel genetic algorithm - estimation of distribution algorithm is developed in the island model, to operationally calculate the optimal ship routing. The technique, which is applicable not only to clusters but to grids as well, is very fast and has been applied to very difficult environments, like the Greek seas with thousands of islands and extreme micro-climate conditions.

“On The Nearest Neighbor Algorithm For Mean Field Traveling Salesman Problem” Metadata:

  • Title: ➤  On The Nearest Neighbor Algorithm For Mean Field Traveling Salesman Problem

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 5.10 Mbs, the file-s for this book were downloaded 55 times, the file-s went public at Fri Sep 20 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find On The Nearest Neighbor Algorithm For Mean Field Traveling Salesman Problem at online marketplaces:


32A Randomized Parallel Algorithm With Run Time $O(n^2)$ For Solving An $n \times N$ System Of Linear Equations

By

In this note, following suggestions by Tao, we extend the randomized algorithm for linear equations over prime fields by Raghavendra to a randomized algorithm for linear equations over the reals. We also show that the algorithm can be parallelized to solve a system of linear equations $A x = b$ with a regular $n \times n$ matrix $A$ in time $O(n^2)$, with probability one. Note that we do not assume that $A$ is symmetric.

“A Randomized Parallel Algorithm With Run Time $O(n^2)$ For Solving An $n \times N$ System Of Linear Equations” Metadata:

  • Title: ➤  A Randomized Parallel Algorithm With Run Time $O(n^2)$ For Solving An $n \times N$ System Of Linear Equations
  • Author:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 2.84 Mbs, the file-s for this book were downloaded 99 times, the file-s went public at Wed Sep 18 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find A Randomized Parallel Algorithm With Run Time $O(n^2)$ For Solving An $n \times N$ System Of Linear Equations at online marketplaces:


33Average Case Analysis Of The Classical Algorithm For Markov Decision Processes With Büchi Objectives

By

We consider Markov decision processes (MDPs) with $\omega$-regular specifications given as parity objectives. We consider the problem of computing the set of almost-sure winning vertices from where the objective can be ensured with probability 1. The algorithms for the computation of the almost-sure winning set for parity objectives iteratively use the solutions for the almost-sure winning set for B\"uchi objectives (a special case of parity objectives). We study for the first time the average case complexity of the classical algorithm for computing almost-sure winning vertices for MDPs with B\"uchi objectives. Our contributions are as follows: First, we show that for MDPs with constant out-degree the expected number of iterations is at most logarithmic and the average case running time is linear (as compared to the worst case linear number of iterations and quadratic time complexity). Second, we show that for general MDPs the expected number of iterations is constant and the average case running time is linear (again as compared to the worst case linear number of iterations and quadratic time complexity). Finally we also show that given all graphs are equally likely, the probability that the classical algorithm requires more than constant number of iterations is exponentially small.

“Average Case Analysis Of The Classical Algorithm For Markov Decision Processes With Büchi Objectives” Metadata:

  • Title: ➤  Average Case Analysis Of The Classical Algorithm For Markov Decision Processes With Büchi Objectives
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 10.59 Mbs, the file-s for this book were downloaded 59 times, the file-s went public at Mon Sep 23 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Average Case Analysis Of The Classical Algorithm For Markov Decision Processes With Büchi Objectives at online marketplaces:


34A Quantum Algorithm For The Quantum Schur-Weyl Transform

By

We construct an efficient quantum algorithm to compute the quantum Schur-Weyl transform for any value of the quantum parameter $q \in [0,\infty]$. Our algorithm is a $q$-deformation of the Bacon-Chuang-Harrow algorithm, in the sense that it has the same structure and is identically equal when $q=1$. When $q=0$, our algorithm is the unitary realization of the Robinson-Schensted-Knuth (or RSK) algorithm, while when $q=\infty$ it is the dual RSK algorithm together with phase signs. Thus, we interpret a well-motivated quantum algorithm as a generalization of a well-known classical algorithm.

“A Quantum Algorithm For The Quantum Schur-Weyl Transform” Metadata:

  • Title: ➤  A Quantum Algorithm For The Quantum Schur-Weyl Transform
  • Author:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 18.52 Mbs, the file-s for this book were downloaded 137 times, the file-s went public at Fri Sep 20 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find A Quantum Algorithm For The Quantum Schur-Weyl Transform at online marketplaces:


35An Approximation Algorithm For The Link Building Problem

By

In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding $k$ new links. We consider the case that the new links must point to the given target node (backlinks). Previous work shows that this problem has no fully polynomial time approximation schemes unless $P=NP$. We present a polynomial time algorithm yielding a PageRank value within a constant factor from the optimal. We also consider the naive algorithm where we choose backlinks from nodes with high PageRank values compared to the outdegree and show that the naive algorithm performs much worse on certain graphs compared to the constant factor approximation scheme.

“An Approximation Algorithm For The Link Building Problem” Metadata:

  • Title: ➤  An Approximation Algorithm For The Link Building Problem
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 5.70 Mbs, the file-s for this book were downloaded 67 times, the file-s went public at Sat Sep 21 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find An Approximation Algorithm For The Link Building Problem at online marketplaces:


36NASA Technical Reports Server (NTRS) 19980039332: Fuzzy Classification Of Ocean Color Satellite Data For Bio-optical Algorithm Constituent Retrievals

By

The ocean has been traditionally viewed as a 2 class system. Morel and Prieur (1977) classified ocean water according to the dominant absorbent particle suspended in the water column. Case 1 is described as having a high concentration of phytoplankton (and detritus) relative to other particles. Conversely, case 2 is described as having inorganic particles such as suspended sediments in high concentrations. Little work has gone into the problem of mixing bio-optical models for these different water types. An approach is put forth here to blend bio-optical algorithms based on a fuzzy classification scheme. This scheme involves two procedures. First, a clustering procedure identifies classes and builds class statistics from in-situ optical measurements. Next, a classification procedure assigns satellite pixels partial memberships to these classes based on their ocean color reflectance signature. These membership assignments can be used as the basis for a weighting retrievals from class-specific bio-optical algorithms. This technique is demonstrated with in-situ optical measurements and an image from the SeaWiFS ocean color satellite.

“NASA Technical Reports Server (NTRS) 19980039332: Fuzzy Classification Of Ocean Color Satellite Data For Bio-optical Algorithm Constituent Retrievals” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19980039332: Fuzzy Classification Of Ocean Color Satellite Data For Bio-optical Algorithm Constituent Retrievals
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 19980039332: Fuzzy Classification Of Ocean Color Satellite Data For Bio-optical Algorithm Constituent Retrievals” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 22.04 Mbs, the file-s for this book were downloaded 61 times, the file-s went public at Sat Oct 15 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19980039332: Fuzzy Classification Of Ocean Color Satellite Data For Bio-optical Algorithm Constituent Retrievals at online marketplaces:


37NASA Technical Reports Server (NTRS) 19990047905: HALOE Algorithm Improvements For Upper Tropospheric Sounding

By

This report details the ongoing efforts by GATS, Inc., in conjunction with Hampton University and University of Wyoming, in NASA's Mission to Planet Earth UARS Science Investigator Program entitled "HALOE Algorithm Improvements for Upper Tropospheric Soundings." The goal of this effort is to develop and implement major inversion and processing improvements that will extend HALOE measurements further into the troposphere. In particular, O3, H2O, and CH4 retrievals may be extended into the middle troposphere, and NO, HCl and possibly HF into the upper troposphere. Key areas of research being carried out to accomplish this include: pointing/tracking analysis; cloud identification and modeling; simultaneous multichannel retrieval capability; forward model improvements; high vertical-resolution gas filter channel retrievals; a refined temperature retrieval; robust error analyses; long-term trend reliability studies; and data validation. The current (first-year) effort concentrates on the pointer/tracker correction algorithms, cloud filtering and validation, and multi-channel retrieval development. However, these areas are all highly coupled, so progress in one area benefits from and sometimes depends on work in others.

“NASA Technical Reports Server (NTRS) 19990047905: HALOE Algorithm Improvements For Upper Tropospheric Sounding” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 19990047905: HALOE Algorithm Improvements For Upper Tropospheric Sounding
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 19990047905: HALOE Algorithm Improvements For Upper Tropospheric Sounding” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 25.52 Mbs, the file-s for this book were downloaded 69 times, the file-s went public at Sun Oct 16 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 19990047905: HALOE Algorithm Improvements For Upper Tropospheric Sounding at online marketplaces:


38NASA Technical Reports Server (NTRS) 20000031890: An Improved Neutron Transport Algorithm For Space Radiation

By

A low-energy neutron transport algorithm for use in space radiation protection is developed. The algorithm is based upon a multigroup analysis of the straight-ahead Boltzmann equation by using a mean value theorem for integrals. This analysis is accomplished by solving a realistic but simplified neutron transport test problem. The test problem is analyzed by using numerical and analytical procedures to obtain an accurate solution within specified error bounds. Results from the test problem are then used for determining mean values associated with rescattering terms that are associated with a multigroup solution of the straight-ahead Boltzmann equation. The algorithm is then coupled to the Langley HZETRN code through the evaporation source term. Evaluation of the neutron fluence generated by the solar particle event of February 23, 1956, for a water and an aluminum-water shield-target configuration is then compared with LAHET and MCNPX Monte Carlo code calculations for the same shield-target configuration. The algorithm developed showed a great improvement in results over the unmodified HZETRN solution. In addition, a two-directional solution of the evaporation source showed even further improvement of the fluence near the front of the water target where diffusion from the front surface is important.

“NASA Technical Reports Server (NTRS) 20000031890: An Improved Neutron Transport Algorithm For Space Radiation” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 20000031890: An Improved Neutron Transport Algorithm For Space Radiation
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 20000031890: An Improved Neutron Transport Algorithm For Space Radiation” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 30.37 Mbs, the file-s for this book were downloaded 64 times, the file-s went public at Mon Oct 17 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 20000031890: An Improved Neutron Transport Algorithm For Space Radiation at online marketplaces:


39NASA Technical Reports Server (NTRS) 20040067983: Variability In Ocean Color Associated With Phytoplankton And Terrigenous Matter: Time Series Measurements And Algorithm Development At The FRONT Site On The New England Continental Shelf. Chapter 12

By

Fronts in the coastal ocean describe areas of strong horizontal gradients in both physical and biological properties associated with tidal mixing and freshwater estuarine output (e.g. Simpson, 1981 and O Donnell, 1993). Related gradients in optically important constituents mean that fronts can be observed from space as changes in ocean color as well as sea surface temperature (e.g., Dupouy et al., 1986). This research program is designed to determine which processes and optically important constituents must be considered to explain ocean color variations associated with coastal fronts on the New England continental shelf, in particular the National Ocean Partnership Program (NOPP) Front Resolving Observational Network with Telemetry (FRONT) site. This site is located at the mouth of Long Island sound and was selected after the analysis of 12 years of AVHRR data showed the region to be an area of strong frontal activity (Ullman and Cornillon, 1999). FRONT consists of a network of modem nodes that link bottom mounted Acoustic Doppler Current Profilers (ADCPs) and profiling arrays. At the center of the network is the Autonomous Vertically Profiling Plankton Observatory (AVPPO) (Thwaites et al. 1998). The AVPPO consists of buoyant sampling vehicle and a trawl-resistant bottom-mounted enclosure, which holds a winch, the vehicle (when not sampling), batteries, and controller. Three sampling systems are present on the vehicle, a video plankton recorder, a CTD with accessory sensors, and a suite of bio-optical sensors including Satlantic OCI-200 and OCR-200 spectral radiometers and a WetLabs ac-9 dual path absorption and attenuation meter. At preprogrammed times the vehicle is released, floats to the surface, and is then winched back into the enclosure with power and data connection maintained through the winch cable. Communication to shore is possible through a bottom cable and nearby surface telemetry buoy, equipped with a mobile modem, giving the capability for near-real time data transmission and interactive sampling control.

“NASA Technical Reports Server (NTRS) 20040067983: Variability In Ocean Color Associated With Phytoplankton And Terrigenous Matter: Time Series Measurements And Algorithm Development At The FRONT Site On The New England Continental Shelf. Chapter 12” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 20040067983: Variability In Ocean Color Associated With Phytoplankton And Terrigenous Matter: Time Series Measurements And Algorithm Development At The FRONT Site On The New England Continental Shelf. Chapter 12
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 20040067983: Variability In Ocean Color Associated With Phytoplankton And Terrigenous Matter: Time Series Measurements And Algorithm Development At The FRONT Site On The New England Continental Shelf. Chapter 12” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 9.41 Mbs, the file-s for this book were downloaded 59 times, the file-s went public at Fri Oct 21 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 20040067983: Variability In Ocean Color Associated With Phytoplankton And Terrigenous Matter: Time Series Measurements And Algorithm Development At The FRONT Site On The New England Continental Shelf. Chapter 12 at online marketplaces:


40NASA Technical Reports Server (NTRS) 20080040693: Multidisciplinary Design, Analysis, And Optimization Tool Development Using A Genetic Algorithm

By

Multidisciplinary design, analysis, and optimization using a genetic algorithm is being developed at the National Aeronautics and Space A dministration Dryden Flight Research Center to automate analysis and design process by leveraging existing tools such as NASTRAN, ZAERO a nd CFD codes to enable true multidisciplinary optimization in the pr eliminary design stage of subsonic, transonic, supersonic, and hypers onic aircraft. This is a promising technology, but faces many challe nges in large-scale, real-world application. This paper describes cur rent approaches, recent results, and challenges for MDAO as demonstr ated by our experience with the Ikhana fire pod design.

“NASA Technical Reports Server (NTRS) 20080040693: Multidisciplinary Design, Analysis, And Optimization Tool Development Using A Genetic Algorithm” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 20080040693: Multidisciplinary Design, Analysis, And Optimization Tool Development Using A Genetic Algorithm
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 20080040693: Multidisciplinary Design, Analysis, And Optimization Tool Development Using A Genetic Algorithm” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 37.40 Mbs, the file-s for this book were downloaded 72 times, the file-s went public at Wed Nov 02 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 20080040693: Multidisciplinary Design, Analysis, And Optimization Tool Development Using A Genetic Algorithm at online marketplaces:


41NASA Technical Reports Server (NTRS) 20090028640: Using The Chandra Source-Finding Algorithm To Automatically Identify Solar X-ray Bright Points

By

This poster details a technique of bright point identification that is used to find sources in Chandra X-ray data. The algorithm, part of a program called LEXTRCT, searches for regions of a given size that are above a minimum signal to noise ratio. The algorithm allows selected pixels to be excluded from the source-finding, thus allowing exclusion of saturated pixels (from flares and/or active regions). For Chandra data the noise is determined by photon counting statistics, whereas solar telescopes typically integrate a flux. Thus the calculated signal-to-noise ratio is incorrect, but we find we can scale the number to get reasonable results. For example, Nakakubo and Hara (1998) find 297 bright points in a September 11, 1996 Yohkoh image; with judicious selection of signal-to-noise ratio, our algorithm finds 300 sources. To further assess the efficacy of the algorithm, we analyze a SOHO/EIT image (195 Angstroms) and compare results with those published in the literature (McIntosh and Gurman, 2005). Finally, we analyze three sets of data from Hinode, representing different parts of the decline to minimum of the solar cycle.

“NASA Technical Reports Server (NTRS) 20090028640: Using The Chandra Source-Finding Algorithm To Automatically Identify Solar X-ray Bright Points” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 20090028640: Using The Chandra Source-Finding Algorithm To Automatically Identify Solar X-ray Bright Points
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 20090028640: Using The Chandra Source-Finding Algorithm To Automatically Identify Solar X-ray Bright Points” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 1.92 Mbs, the file-s for this book were downloaded 59 times, the file-s went public at Thu Nov 03 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 20090028640: Using The Chandra Source-Finding Algorithm To Automatically Identify Solar X-ray Bright Points at online marketplaces:


42A Hierarchically Blocked Jacobi SVD Algorithm For Single And Multiple Graphics Processing Units

By

We present a hierarchically blocked one-sided Jacobi algorithm for the singular value decomposition (SVD), targeting both single and multiple graphics processing units (GPUs). The blocking structure reflects the levels of GPU's memory hierarchy. The algorithm may outperform MAGMA's dgesvd, while retaining high relative accuracy. To this end, we developed a family of parallel pivot strategies on GPU's shared address space, but applicable also to inter-GPU communication. Unlike common hybrid approaches, our algorithm in a single GPU setting needs a CPU for the controlling purposes only, while utilizing GPU's resources to the fullest extent permitted by the hardware. When required by the problem size, the algorithm, in principle, scales to an arbitrary number of GPU nodes. The scalability is demonstrated by more than twofold speedup for sufficiently large matrices on a Tesla S2050 system with four GPUs vs. a single Fermi card.

“A Hierarchically Blocked Jacobi SVD Algorithm For Single And Multiple Graphics Processing Units” Metadata:

  • Title: ➤  A Hierarchically Blocked Jacobi SVD Algorithm For Single And Multiple Graphics Processing Units
  • Author:

“A Hierarchically Blocked Jacobi SVD Algorithm For Single And Multiple Graphics Processing Units” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 0.59 Mbs, the file-s for this book were downloaded 20 times, the file-s went public at Sat Jun 30 2018.

Available formats:
Archive BitTorrent - Metadata - Text PDF -

Related Links:

Online Marketplaces

Find A Hierarchically Blocked Jacobi SVD Algorithm For Single And Multiple Graphics Processing Units at online marketplaces:


43Solving Bivariate Systems: Efficient Worst-case Algorithm For Computing Rational Univariate Representations And Applications

By

We address the problem of solving systems of two bivariate polynomials of total degree at most $d$ with integer coefficients of maximum bitsize $\tau$. It is known that a linear separating form, that is a linear combination of the variables that takes different values at distinct solutions of the system, can be computed in $\sOB(d^{8}+d^7\tau)$ bit operations (where $O_B$ refers to bit complexities and $\sO$ to complexities where polylogarithmic factors are omitted) and we focus here on the computation of a Rational Univariate Representation (RUR) given a linear separating form. We present an algorithm for computing a RUR with worst-case bit complexity in $\sOB(d^7+d^6\tau)$ and bound the bitsize of its coefficients by $\sO(d^2+d\tau)$. We show in addition that isolating boxes of the solutions of the system can be computed from the RUR with $\sOB(d^{8}+d^7\tau)$ bit operations. Finally, we show how a RUR can be used to evaluate the sign of a bivariate polynomial (of degree at most $d$ and bitsize at most $\tau$) at one real solution of the system in $\sOB(d^{8}+d^7\tau)$ bit operations and at all the $\Theta(d^2)$ {real} solutions in only $O(d)$ times that for one solution.

“Solving Bivariate Systems: Efficient Worst-case Algorithm For Computing Rational Univariate Representations And Applications” Metadata:

  • Title: ➤  Solving Bivariate Systems: Efficient Worst-case Algorithm For Computing Rational Univariate Representations And Applications
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 19.00 Mbs, the file-s for this book were downloaded 83 times, the file-s went public at Mon Sep 23 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Solving Bivariate Systems: Efficient Worst-case Algorithm For Computing Rational Univariate Representations And Applications at online marketplaces:


44Algorithm For Factoring Some RSA And Rabin Moduli

By

In this paper we present a new efficient algorithm for factoring the RSA and the Rabin moduli in the particular case when the difference between their two prime factors is bounded. As an extension, we also give some theoretical results on factoring integers.

“Algorithm For Factoring Some RSA And Rabin Moduli” Metadata:

  • Title: ➤  Algorithm For Factoring Some RSA And Rabin Moduli
  • Author:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 3.64 Mbs, the file-s for this book were downloaded 83 times, the file-s went public at Mon Sep 23 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Algorithm For Factoring Some RSA And Rabin Moduli at online marketplaces:


45Development Of Non-parametric Evolutionary Algorithm For Predicting Soil Moisture Dynamics

By

Prediction of soil moisture is critical for water resources management. With Global Precipitation Measurement (GPM) and Soil Moisture Active Passive (SMAP) satellites by NASA, spatio-temporal interrelation between rainfall and soil moisture fields (at different extents) will be of great value for satellite product calibration/validation and other hydrologic science investigations. In this study, we explored a non-parametric evolutionary algorithm for prediction of soil moisture from a time series of spatially-distributed rainfall across multiple weather locations under two different hydro-climatic regions. A new genetic algorithm-based hidden Markov model (HMMGA) was developed to estimate long-term soil moisture dynamics at different soil depths using precipitation data as a proxy. Also, we tested transposability of our approach across time under different climatic conditions. To test the new approach, we selected two different soil moisture fields, Oklahoma (130 km × 130 km) and Illinois (300 km × 500 km), during 1995–2009 and 1994–2010, respectively. We found that the newly developed framework performed well in predicting soil moisture dynamics at different spatial extents. Although our approach has limitations in predicting daily values, it estimates well the weekly soil moisture across the spatial and temporal domains with predictable uncertainties. Furthermore, this approach could provide advantages for good transposability under different weather conditions compared to those of physically-based hydrological models. Overall, our suggested approach could predict weekly soil moisture estimates with precipitation and soil moisture histories and showed the potential of transposability under different weather and land surface conditions. Since the proposed algorithm requires only precipitation (and historical soil moisture data) from existing, established weather stations, it can serve an attractive alternative that can forecast soil moisture using climate change scenarios.

“Development Of Non-parametric Evolutionary Algorithm For Predicting Soil Moisture Dynamics” Metadata:

  • Title: ➤  Development Of Non-parametric Evolutionary Algorithm For Predicting Soil Moisture Dynamics
  • Authors:
  • Language: English

“Development Of Non-parametric Evolutionary Algorithm For Predicting Soil Moisture Dynamics” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 29.57 Mbs, the file-s for this book were downloaded 84 times, the file-s went public at Sat Jul 06 2019.

Available formats:
Abbyy GZ - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF - Unknown -

Related Links:

Online Marketplaces

Find Development Of Non-parametric Evolutionary Algorithm For Predicting Soil Moisture Dynamics at online marketplaces:


46Improving Lower Bounds For The Quadratic Assignment Problem By Applying A Distributed Dual Ascent Algorithm

By

The application of the Reformulation Linearization Technique (RLT) to the Quadratic Assignment Problem (QAP) leads to a tight linear relaxation with huge dimensions that is hard to solve. Previous works found in the literature show that these relaxations combined with branch-and-bound algorithms belong to the state-of-the-art of exact methods for the QAP. For the level 3 RLT (RLT3), using this relaxation is prohibitive in conventional machines for instances with more than 22 locations due to memory limitations. This paper presents a distributed version of a dual ascent algorithm for the RLT3 QAP relaxation that approximately solves it for instances with up to 30 locations for the first time. Although, basically, the distributed algorithm has been implemented on top of its sequential conterpart, some changes, which improved not only the parallel performance but also the quality of solutions, were proposed here. When compared to other lower bounding methods found in the literature, our algorithm generates the best known lower bounds for 26 out of the 28 tested instances, reaching the optimal solution in 18 of them.

“Improving Lower Bounds For The Quadratic Assignment Problem By Applying A Distributed Dual Ascent Algorithm” Metadata:

  • Title: ➤  Improving Lower Bounds For The Quadratic Assignment Problem By Applying A Distributed Dual Ascent Algorithm
  • Authors:
  • Language: English

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 6.08 Mbs, the file-s for this book were downloaded 102 times, the file-s went public at Sat Jul 20 2013.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVu - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find Improving Lower Bounds For The Quadratic Assignment Problem By Applying A Distributed Dual Ascent Algorithm at online marketplaces:


47An Improved Model Of Charge Transfer Inefficiency And Correction Algorithm For The Hubble Space Telescope

By

Charge-Coupled Device (CCD) detectors, widely used to obtain digital imaging, can be damaged by high energy radiation. Degraded images appear blurred, because of an effect known as Charge Transfer Inefficiency (CTI), which trails bright objects as the image is read out. It is often possible to correct most of the trailing during post-processing, by moving flux back to where it belongs. We compare several popular algorithms for this: quantifying the effect of their physical assumptions and tradeoffs between speed and accuracy. We combine their best elements to construct a more accurate model of damaged CCDs in the Hubble Space Telescope's Advanced Camera for Surveys/Wide Field Channel, and update it using data up to early 2013. Our algorithm now corrects 98% of CTI trailing in science exposures, a substantial improvement over previous work. Further progress will be fundamentally limited by the presence of read noise. Read noise is added after charge transfer so does not get trailed - but it is incorrectly untrailed during post-processing.

“An Improved Model Of Charge Transfer Inefficiency And Correction Algorithm For The Hubble Space Telescope” Metadata:

  • Title: ➤  An Improved Model Of Charge Transfer Inefficiency And Correction Algorithm For The Hubble Space Telescope
  • Authors: ➤  

“An Improved Model Of Charge Transfer Inefficiency And Correction Algorithm For The Hubble Space Telescope” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 2.47 Mbs, the file-s for this book were downloaded 26 times, the file-s went public at Sat Jun 30 2018.

Available formats:
Archive BitTorrent - Metadata - Text PDF -

Related Links:

Online Marketplaces

Find An Improved Model Of Charge Transfer Inefficiency And Correction Algorithm For The Hubble Space Telescope at online marketplaces:


48NASA Technical Reports Server (NTRS) 20020094323: Geolocation Assessment Algorithm For CALIPSO Using Coastline Detection

By

Cloud-Aerosol Lidar Infrared Pathfinder Satellite Observations (CALIPSO) is a joint satellite mission between NASA and the French space agency CNES. The investigation will gather long-term, global cloud and aerosol optical and physical properties to improve climate models. The CALIPSO spacecraft is scheduled to launch in 2004 into a 98.2 inclination, 705 km circular orbit approximately 3 minutes behind the Aqua spacecraft. The payload consists of a two-wavelength polarization-sensitive lidar, and two passive imagers operating in the visible (0.645 mm) and infrared (8.7 - 12.0 mm) spectral regions. The imagers are nadir viewing and co-aligned with the lidar. Earth viewing measurements are geolocated to the Earth fixed coordinate system using satellite ephemeris, Earth rotation and geoid, and instrument pointing data. The coastline detection algorithm will assess the accuracy of the CALIPSO geolocation process by analyzing Wide Field Camera (WFC) visible ocean land boundaries. Processing space-time coincident MODIS and WFC scenes with the coastline algorithm will help verify the co-registration requirement with Moderate Resolution Imaging Spectrometer (MODIS) data. This paper quantifies the accuracy of the coastline geolocation assessment algorithm.

“NASA Technical Reports Server (NTRS) 20020094323: Geolocation Assessment Algorithm For CALIPSO Using Coastline Detection” Metadata:

  • Title: ➤  NASA Technical Reports Server (NTRS) 20020094323: Geolocation Assessment Algorithm For CALIPSO Using Coastline Detection
  • Author: ➤  
  • Language: English

“NASA Technical Reports Server (NTRS) 20020094323: Geolocation Assessment Algorithm For CALIPSO Using Coastline Detection” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 26.79 Mbs, the file-s for this book were downloaded 83 times, the file-s went public at Thu Oct 20 2016.

Available formats:
Abbyy GZ - Animated GIF - Archive BitTorrent - DjVuTXT - Djvu XML - Item Tile - Metadata - Scandata - Single Page Processed JP2 ZIP - Text PDF -

Related Links:

Online Marketplaces

Find NASA Technical Reports Server (NTRS) 20020094323: Geolocation Assessment Algorithm For CALIPSO Using Coastline Detection at online marketplaces:


49A Continuation Multilevel Monte Carlo Algorithm

By

We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolerance is satisfied. CMLMC assumes discretization hierarchies that are defined a priori for each level and are geometrically refined across levels. The actual choice of computational work across levels is based on parametric models for the average cost per sample and the corresponding weak and strong errors. These parameters are calibrated using Bayesian estimation, taking particular notice of the deepest levels of the discretization hierarchy, where only few realizations are available to produce the estimates. The resulting CMLMC estimator exhibits a non-trivial splitting between bias and statistical contributions. We also show the asymptotic normality of the statistical error in the MLMC estimator and justify in this way our error estimate that allows prescribing both required accuracy and confidence in the final result. Numerical results substantiate the above results and illustrate the corresponding computational savings in examples that are described in terms of differential equations either driven by random measures or with random coefficients.

“A Continuation Multilevel Monte Carlo Algorithm” Metadata:

  • Title: ➤  A Continuation Multilevel Monte Carlo Algorithm
  • Authors:

“A Continuation Multilevel Monte Carlo Algorithm” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 1.35 Mbs, the file-s for this book were downloaded 42 times, the file-s went public at Sat Jun 30 2018.

Available formats:
Archive BitTorrent - Metadata - Text PDF -

Related Links:

Online Marketplaces

Find A Continuation Multilevel Monte Carlo Algorithm at online marketplaces:


50Precise Algorithm To Generate Random Sequential Addition Of Hard Hyperspheres At Saturation

By

Random sequential addition (RSA) time-dependent packing process, in which congruent hard hyperspheres are randomly and sequentially placed into a system without interparticle overlap, is a useful packing model to study disorder in high dimensions. Of particular interest is the infinite-time {\it saturation} limit in which the available space for another sphere tends to zero. However, the associated saturation density has been determined in all previous investigations by extrapolating the density results for near-saturation configurations to the saturation limit, which necessarily introduces numerical uncertainties. We have refined an algorithm devised by us [S. Torquato, O. Uche, and F.~H. Stillinger, Phys. Rev. E {\bf 74}, 061308 (2006)] to generate RSA packings of identical hyperspheres. The improved algorithm produce such packings that are guaranteed to contain no available space using finite computational time with heretofore unattained precision and across the widest range of dimensions ($2 \le d \le 8$). We have also calculated the packing and covering densities, pair correlation function $g_2(r)$ and structure factor $S(k)$ of the saturated RSA configurations. As the space dimension increases, we find that pair correlations markedly diminish, consistent with a recently proposed "decorrelation" principle, and the degree of "hyperuniformity" (suppression of infinite-wavelength density fluctuations) increases. We have also calculated the void exclusion probability in order to compute the so-called quantizer error of the RSA packings, which is related to the second moment of inertia of the average Voronoi cell. Our algorithm is easily generalizable to generate saturated RSA packings of nonspherical particles.

“Precise Algorithm To Generate Random Sequential Addition Of Hard Hyperspheres At Saturation” Metadata:

  • Title: ➤  Precise Algorithm To Generate Random Sequential Addition Of Hard Hyperspheres At Saturation
  • Authors:

“Precise Algorithm To Generate Random Sequential Addition Of Hard Hyperspheres At Saturation” Subjects and Themes:

Edition Identifiers:

Downloads Information:

The book is available for download in "texts" format, the size of the file-s is: 0.66 Mbs, the file-s for this book were downloaded 25 times, the file-s went public at Sat Jun 30 2018.

Available formats:
Archive BitTorrent - Metadata - Text PDF -

Related Links:

Online Marketplaces

Find Precise Algorithm To Generate Random Sequential Addition Of Hard Hyperspheres At Saturation at online marketplaces:


Buy “Algorithm” online:

Shop for “Algorithm” on popular online marketplaces.