Please wait, while we are loading the content...
Please wait, while we are loading the content...
| Content Provider | IEEE Xplore Digital Library |
|---|---|
| Author | Castro, M. Straub, J. |
| Copyright Year | 2015 |
| Description | Author affiliation: Dept. of Comput. Sci., Univ. of North Dakota, Grand Forks, ND, USA (Castro, M.; Straub, J.) |
| Abstract | Schedulers for small spacecraft must satisfy the dual requirement of generating very efficient schedules while concurrently minimizing the resources required to create the schedule. This paper proposes a technique for searching for tasks that can be utilized to fill particular schedule locations. This approach is based on a modular system for storing important variables. This modular system has three important variables: $t_{0},$ $x_{0}$ and $y_{0}.$ The variable y is latitude and x is longitude. Time variable t is an integer and each unit represents a time quantum. They are related to each other by three functions $F_{t},$ $F_{x},$ and $F_{y}.$ These functions are derived from a space time function where $x_{0}$ and $y_{0}$ are the normalized ground trace. These three variables can define a prospective instance of any task on an Earth-orbiting spacecraft. Similarly, this same approach could be used for planetary missions by making the ground trace references in relation to the local body. This approach is based on a 'useful trick' that can be performed with integers that facilitates the encoding of conditional statements using these three variables. This trick helps define the life cycle of a task. This approach can also, if needed, be expanded to allow the incorporation of other variables. This paper considers the limits of using integers in this way. It presents and considers several example problems and demonstrates the efficacy of using this algorithm to generate a solution. |
| Starting Page | 1 |
| Ending Page | 7 |
| File Size | 244297 |
| Page Count | 7 |
| File Format | |
| ISBN | 9781479953790 |
| e-ISBN | 9781479953806 |
| DOI | 10.1109/AERO.2015.7119266 |
| Language | English |
| Publisher | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher Date | 2015-03-07 |
| Publisher Place | USA |
| Access Restriction | Subscribed |
| Rights Holder | Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subject Keyword | Arrays Problem-solving Biographies Telescopes Maintenance engineering Graph theory Satellites |
| Content Type | Text |
| Resource Type | Article |
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
Learn more about this project from here.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
| Sl. | Authority | Responsibilities | Communication Details |
|---|---|---|---|
| 1 | Ministry of Education (GoI), Department of Higher Education |
Sanctioning Authority | https://www.education.gov.in/ict-initiatives |
| 2 | Indian Institute of Technology Kharagpur | Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project | https://www.iitkgp.ac.in |
| 3 | National Digital Library of India Office, Indian Institute of Technology Kharagpur | The administrative and infrastructural headquarters of the project | Dr. B. Sutradhar bsutra@ndl.gov.in |
| 4 | Project PI / Joint PI | Principal Investigator and Joint Principal Investigators of the project |
Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon |
| 5 | Website/Portal (Helpdesk) | Queries regarding NDLI and its services | support@ndl.gov.in |
| 6 | Contents and Copyright Issues | Queries related to content curation and copyright issues | content@ndl.gov.in |
| 7 | National Digital Library of India Club (NDLI Club) | Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach | clubsupport@ndl.gov.in |
| 8 | Digital Preservation Centre (DPC) | Assistance with digitizing and archiving copyright-free printed books | dpc@ndl.gov.in |
| 9 | IDR Setup or Support | Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops | idr@ndl.gov.in |
|
Loading...
|