{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/69516"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/69516","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Ss/tdma Time Slot Assignment With Generalized Switching Modes","abstract":"A number of problems which arise from the time slot assignment problem for satellite communications using the satellite-switched time division multiple access (SS/TDMA) method are studied. Given an m x n real matrix T, and a set of (0, 1)-matrices {Z(,1), Z(,2), (.)(.)(.) , Z(,(nu))}, the optimization problem we wish to solve is to find non-negative real constants (gamma)(,1), (gamma)(,2), ... , (gamma)(,(nu)) so that","abstract_html":"A number of problems which arise from the time slot assignment problem for satellite communications using the satellite-switched time division multiple access (SS/TDMA) method are studied. Given an m x n real matrix T, and a set of (0, 1)-matrices {Z(,1), Z(,2), (.)(.)(.) , Z(,(nu))}, the optimization problem we wish to solve is to find non-negative real constants (gamma)(,1), (gamma)(,2), ... , (gamma)(,(nu)) so that","abstract_has_math":false,"creators":["Lewandowski, James Louis"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-15T19:25:21Z","date_published":"2014-12-15T19:25:21Z","updated_at":"2026-07-22T22:26:01Z","subjects":["Computer Science"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8324594"],"render_values":[{"text":"(UMI)AAI8324594","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/69516","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Lewandowski, James Louis"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-15T19:25:21Z","10000-01-01","1983"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/69516","(UMI)AAI8324594"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A number of problems which arise from the time slot assignment problem for satellite communications using the satellite-switched time division multiple access (SS/TDMA) method are studied. Given an m x n real matrix T, and a set of (0, 1)-matrices {Z(,1), Z(,2), (.)(.)(.) , Z(,(nu))}, the optimization problem we wish to solve is to find non-negative real constants (gamma)(,1), (gamma)(,2), ... , (gamma)(,(nu)) so that","(DIAGRAM, TABLE OR GRAPHIC OMITTED...PLEASE SEE DAI)","is minimized, and where the inequality is implied for each corresponding entry. Although this problem can be posed as a linear program, more efficient algorithms are presented here for several special cases. We first consider the case where each Z(,i) has a specified number of ones in each row and column. For two vectors (rho) = {(rho)(,1), (rho)(,2), (.)(.)(.) , (rho)(,m)} and (lamda) = {(lamda)(,1), (lamda)(,2), (.)(.)(.) , (lamda)(,n)} of positive integers where","we define the set U((rho), (lamda)) to be the set of all (0, 1)-matrices which have exactly (rho)(,i) ones in the i('th) row for all i, and exactly (lamda)(,j) ones in the j('th) column for all j. A complete characterization of the class of real matrices which can be written as a positive sum of matrices in U((rho), (lamda)) is given. This result provides a generalization of the Birkhoff-Von Neumann Theorem. Also for a given T, an algorithm is presented which will solve, if possible, the above optimization problem for this set of (0, 1)-matrices. The optimization problem does not always have a feasible solution, and a complete characterization of the conditions needed for the existence of one is given. In the above expression, using these (0, 1)-matrices, (nu) can be as large as O(n('2)). In SS/TDMA applications, it is desirable to have a small value for (nu). As a second problem we consider a fixed set Z = {Z(,1), Z(,2), (.)(.)(.) , Z(,l)} for (0, 1)-matrices, where l is proportional to O(n). Given such a set of matrices, which satisfy certain constraints, we have an efficient algorithm which solves the above optimization problem for these matrices.","Made available in DSpace on 2014-12-15T19:25:21Z (GMT). No. of bitstreams: 1 8324594.pdf: 2959418 bytes, checksum: 1938d8d0e65f3e3343a1a1a71e35b8ea (MD5) Previous issue date: 1983","Embargo set by: Seth Robbins for item 69682 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","120 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983."]},{"key":"dc:title","label":"Title","values":["Ss/tdma Time Slot Assignment With Generalized Switching Modes"]}]}],"canonical_facts":{"dc:creator":["Lewandowski, James Louis"],"dc:date":["2014-12-15T19:25:21Z","10000-01-01","1983"],"dc:description":["A number of problems which arise from the time slot assignment problem for satellite communications using the satellite-switched time division multiple access (SS/TDMA) method are studied. Given an m x n real matrix T, and a set of (0, 1)-matrices {Z(,1), Z(,2), (.)(.)(.) , Z(,(nu))}, the optimization problem we wish to solve is to find non-negative real constants (gamma)(,1), (gamma)(,2), ... , (gamma)(,(nu)) so that","(DIAGRAM, TABLE OR GRAPHIC OMITTED...PLEASE SEE DAI)","is minimized, and where the inequality is implied for each corresponding entry. Although this problem can be posed as a linear program, more efficient algorithms are presented here for several special cases. We first consider the case where each Z(,i) has a specified number of ones in each row and column. For two vectors (rho) = {(rho)(,1), (rho)(,2), (.)(.)(.) , (rho)(,m)} and (lamda) = {(lamda)(,1), (lamda)(,2), (.)(.)(.) , (lamda)(,n)} of positive integers where","we define the set U((rho), (lamda)) to be the set of all (0, 1)-matrices which have exactly (rho)(,i) ones in the i('th) row for all i, and exactly (lamda)(,j) ones in the j('th) column for all j. A complete characterization of the class of real matrices which can be written as a positive sum of matrices in U((rho), (lamda)) is given. This result provides a generalization of the Birkhoff-Von Neumann Theorem. Also for a given T, an algorithm is presented which will solve, if possible, the above optimization problem for this set of (0, 1)-matrices. The optimization problem does not always have a feasible solution, and a complete characterization of the conditions needed for the existence of one is given. In the above expression, using these (0, 1)-matrices, (nu) can be as large as O(n('2)). In SS/TDMA applications, it is desirable to have a small value for (nu). As a second problem we consider a fixed set Z = {Z(,1), Z(,2), (.)(.)(.) , Z(,l)} for (0, 1)-matrices, where l is proportional to O(n). Given such a set of matrices, which satisfy certain constraints, we have an efficient algorithm which solves the above optimization problem for these matrices.","Made available in DSpace on 2014-12-15T19:25:21Z (GMT). No. of bitstreams: 1 8324594.pdf: 2959418 bytes, checksum: 1938d8d0e65f3e3343a1a1a71e35b8ea (MD5) Previous issue date: 1983","Embargo set by: Seth Robbins for item 69682 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","120 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1983."],"dc:identifier":["http://hdl.handle.net/2142/69516","(UMI)AAI8324594"],"dc:subject":["Computer Science"],"dc:title":["Ss/tdma Time Slot Assignment With Generalized Switching Modes"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:26:01Z"}