2006

2008-04-01

Pirates@Home tested BOINC's forum software for possible use by Interactions in Understanding the Universe
Primates@Home tested the reaction of Pirates@Home users to a disturbance in their accustomed environment

Maile Neel and Joanna Grand are using Marxan to quantify the effects of poor and incomplete data on the ability to capture biological diversity in nature reserves.

The Laboratory of David Fushman is running protein:protein docking algorithms on Lattice. When driven by experimentally derived constraints, these will help in modeling the structures of large multi-subunit proteins, and the interactions of such proteins with various ligands. CNS is the featured Grid service in this project.

Floyd Reed and Holly Mortensen from the Laboratory of Sarah Tishkoff have run a number of MDIV and IM simulations through The Lattice Project. These are studies in molecular population genetics that seek to use DNA sequence polymorphism to estimate the times of divergence and migration rates among ethnically diverse human populations in Africa.

2009

Enhance the usefulness of digitized materials by creating a Web repository of scanned literature, keywords, and online resources with tools for searching and analysis.
Create an educational tool for learning about plant life.
Provide a model for adopting public-resource computing applications within the library community.

Networking phase (Phase One)

During this non-cpu intensive phase the DepSpid spider will scan a set of web pages and store the results in a temporary database for later processing during Phase Two.

A DepSpid task consists of multiple jobs. The exact number of jobs per task may vary but usually will be between 10 and 50. A job normally is a domain, subdomain or a directory under a domain. During Phase One the DepSpid spider cycles through the jobs of a task to limit the load it makes on the visited servers.

Every job will start downloading the main page of the domain/subdomain and the corresponding robots.txt (if available). The downloaded page will then be scanned for links (and some other parts). Each of this links will be validated with a HTTP HEAD request. The dependency between the page and its links will be stored into a temporary database. The spider will follow each link that belongs to the domain where it started and will these pages like the main page if they are not excluded by the robots.txt. Links that would leave the original domain will be marked as external links and will not be processed further by this job.

A job will end when there is no more link to visit or when one of the predefined limits is reached. Current limits are the level (deepness), the number of visited links and the amount of bytes transferred.

Phase One is non-cpuintensive but will use more or less of your network bandwidth. If the internet connection is closed the network phase will be suspended until the internet connection is available again. Normally, Phase One will take only a few seconds or minutes for each job but may run over a few hours or days depending on the speed of your internet connection and the response times of the visited server.

Computational phase (Phase Two)

This phase doesn't require an internet connection but will use more cpu time. As BOINC doesn't allow switching between non-cpuintensive phases and normal processing phases, this phase will be processed as it would be non-cpuintensive. This means that it will run permanently and not toggle as normal BOINC projects would do. However, DepSpid will respect your ressource share settings. It calculates the relation between the cpu time and the wall clock time and will fall into sleep if the value is higher than the preferred ressource share.

Please note: Respecting your ressource share only works this way with BOINC version 5.5.6 and higher. Older clients will be able to participate until one of the new client versions leaves the development state but will use a fixed resource share which may be far away from your true settings.

Phase Two uses the data collected during Phase One and calculates the dependencies between all pages..

After all dependencies have been calculated, the dependencies to external links that meet a predefined threshold will be reported to the project server and merged into its main database.

BCL@Home

2008

Research in our laboratory seeks to fuse computational and experimental efforts to investigate proteins, the fundamental molecules of biology, and their interactions with small molecule substrates, therapeutics, or probes.

We provide uptime and response time reports and warn you through email and text messages when there is a problem with your website.
Our checks are done utilizing the power and infrastructure of the BOINC distributed computing network. This means that your website can be checked from any geographical location of the world. We're not limited to a few datacenter locations!

The other model type is reverse complement, which doesn't assume the model to be palindromic, but looks for either the forward version of the model or the reverse version of the model (so in fact it's really looking for two models), for example:
AAAATTTCCG
CGGAAATTTT
are the reverse complement of each other.

An updated list for the best point sets known so far can be found at http://www.ist.tugraz.at/staff/aichholzer/crossings.html.

• Prof. Raimondas Čiegis, VGTU Department of Mathematical Modelling,


• Dr. Vadimas Starikovičius (vs@vgtu.lt), VGTU Laboratory of Parallel Computing.

Our goal is to persuade scientists to use this kind of computations in their research and to assist them in preparing BOINC applications. We hope that scientific applications from various fields will be attractive to many current and future BOINC community volunteers and this will allow us to accumulate enough computing resources to achieve significant (unachievable otherwise) results.

Currently the project is used to tune the parameters of a learner used for the prediction of the three-dimensional structure of a protein from its sequence of amino acid residues.

- Melissa Resnick, 2008

The objectives are to:

• Encourage the use of cutting edge computational techniques in engineering research.


• Develop expertise and facilities for developing HPC-based solutions to engineering problems that could not otherwise be resolved.


• Work together with UTP's Mission-Oriented Research (MOR) in acquiring fund to ensure a continual upgrade of HPC-related facilities.

UTP Desktop Grid (UTPDG) is a research project that uses Internet-connected computers to do research in various areas of parallel computational problems.

The aim of the project is to deploy a large infrastructure to support thousands of probes monitoring the Internet.
Each probe repeatedly performs a pre-defined set of web transactions on web-sites, accessing each site about 4 times per hour.
The proposed approach allows us to obtain important results on end-user visible failures and performance statics, from several thousands view points spread throughout the Internet.

Furthermore, we are also improving the rainbow table technology, making them even smaller and faster than rainbow tables found elsewhere, and the best thing is, those tables are freely available to download here

2014

Our research group is interested in calculating the long time dynamics of systems.

The theory simulations that have been running as Test4Theory since 2011, were the first of a series of physics applications running on the LHC@home platform. Soon the theory simulations will be followed by more simulations from the LHC experiment collaborations. These applications exploit virtual machine technology, enabling volunteers to contribute to the huge computational task of searching for new fundamental particles and physics at CERN's LHC.

And for that we want use our brains for creative tasks and for tediously works great creature - distributed supercomputer which consists from our and your different devices like phones, computers, servers, x-boxes, playstations connected by BOINC platform through the internet.

This supercomputer can reduce time of solving task in thousands times because together devices can generate huge calculating power. And today we try solve simple mathematical task, but it need much CPU time. With current algorithm it need about 12.000 years of one core at 4Ghz. While we search answers we learn some languages like English, C++, CUDA and OpenCL. Also pumping our brains (looking for NZT), optimize algorithms in our programs and preparing to solve important tasks for humanity.

Billionaire banker Andrew Beal formulated this conjecture in 1993 while investigating generalizations of Fermat's last theorem. It has been claimed that the same conjecture was independently formulated by Robert Tijdeman and Don Zagier, and it has also been referred to as the Tijdeman-Zagier conjecture.
For a proof or counterexample published in a refereed journal, Beal initially offered a prize of US $5,000 in 1997, raising it to $50,000 over ten years, but has since raised it to US $1,000,000

The second conjecture (Popovych's conjecture) adds a further condition to Agrawals conjecture and therefore logically strengthens the conjecture. If this hypothesis would be correct, the time of a deterministic prime test could be reduced from O(log N)⁶ (currently most efficient version of the AKS algorithm) to O(log N)³

• DNA@Home


• SubsetSum@Home


• Climate Tweets


• Wildlife@Home

2024-01-18