• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2437
  • 1093
  • 247
  • 242
  • 234
  • 219
  • 126
  • 94
  • 63
  • 51
  • 39
  • 38
  • 29
  • 28
  • 27
  • Tagged with
  • 5865
  • 1393
  • 927
  • 818
  • 744
  • 618
  • 567
  • 558
  • 547
  • 528
  • 506
  • 485
  • 455
  • 432
  • 425
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
101

Secure remote network administration and power management

Sullivan, Mark P. 06 1900 (has links)
Approved for public release; distribution is unlimited / Remote Network Administration allows network administrators to manage their networks while being physically separated from the network equipment. Having the capability to manage wired and wireless networks securely, from remote locations, can substantially reduce operating expenses across the entire Department of Defense A variety of methods for remotely managing networks is explored for both wired and wireless networks. Requirements for remote network administration are identified. Chief among them is security and the ability to remotely manage power. Several widely-used remote management utilities are examined. All fail to meet these two requirements. A new power control device is presented that can be managed securely and remotely. / Captain, United States Air Force
102

Recreational access to land in Scotland and British Columbia

Penn, Briony Heather Elisabeth January 1988 (has links)
No description available.
103

Modelling generic access network components

Miklos, Zoltan 13 March 2006 (has links)
There are 1 files which have been withheld at the author's request. Master of Science in Engineering - Engineering / Modelling of telecommunications access networks which concentrate traffic is essential for architectural studies, design and operational efficiency. This work develops the concept of an Intermediate Services Access Network (ISAN) that represents an enhanced narrowband synchronous transfer mode access network which provides an evolutionary step from the existing POTS and N-ISDN access networks to the Fibre to the x (FTTx) networks. Models of the ISAN are developed to support architectural and traffic studies. Generic components are identified from a study of several typical ISAN network architectures. The components include intelligent nodes, transmission links and exchange interfaces. The modelling methodology used seeks firstly to identify resources in the access network and then model them as object classes. Entity-Relationship diagram techniques, defined by the International Telecommunications Union, are used in this work to identify, decompose and represent components in an access network. Recurring components in this work are termed generic components and have attributes that make them reusable. The classes developed consist of generic classes, and technology or application specific classes. Software classes are developed to represent traffic sources with selectable parameters including Poisson arrivals, negative exponential or lognormal holding times and asymmetric originating and terminating models. The identified object classes are implemented using the object-oriented simulation language MODSIM III. An existing unidirectional ring network is simulated to quantify the traffic performance of this type of network under telephone traffic conditions. The ring network is further developed to enhance traffic capacity and performance under link failure conditions. As an economic consideration, this hypothetical ring network uses a single backup link in the event of link failure. The network is simulated with different types of types of traffic (telephone, payphone and Internet dial-up traffic) and under link failure conditions to establish the grade of service.
104

An algorithm for multi-objective assignment problem.

January 2005 (has links)
Tse Hok Man. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2005. / Includes bibliographical references (leaves 68-69). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 2 --- Background Study --- p.4 / Chapter 2.1 --- Channel Assignment in Multicarrier CDMA Systems --- p.4 / Chapter 2.1.1 --- Channel Throughput --- p.5 / Chapter 2.1.2 --- Greedy Approach to Channel Assignment --- p.6 / Chapter 2.2 --- Generalised Assignment Problem --- p.7 / Chapter 2.2.1 --- Branch and Bound Approach for GAP --- p.8 / Chapter 2.2.2 --- Genetic Algorithm for GAP --- p.10 / Chapter 2.3 --- Negative Cycle Detection --- p.11 / Chapter 2.3.1 --- Labeling Method --- p.11 / Chapter 2.3.2 --- Bellman-Ford-Moore algorithm --- p.13 / Chapter 2.3.3 --- Amortized Search --- p.14 / Chapter 3 --- Multi-objective Assignment Problem --- p.15 / Chapter 3.1 --- Multi-objective Assignment Problem --- p.16 / Chapter 3.2 --- NP-Hardness --- p.18 / Chapter 3.3 --- Transformation of the Multi-objective Assignment Problem --- p.19 / Chapter 3.4 --- Algorithm --- p.23 / Chapter 3.5 --- Example --- p.25 / Chapter 3.6 --- A Special Case - Linear Objective Function --- p.32 / Chapter 3.7 --- Performance on the assignment problem --- p.33 / Chapter 4 --- Goal Programming Model for Channel Assignment Problem --- p.35 / Chapter 4.1 --- Motivation --- p.35 / Chapter 4.2 --- System Model --- p.36 / Chapter 4.3 --- Goal Programming Model for Channel Assignment Problem --- p.38 / Chapter 4.4 --- Simulation --- p.39 / Chapter 4.4.1 --- Throughput Optimization --- p.40 / Chapter 4.4.2 --- Best-First-Assign Algorithm --- p.41 / Chapter 4.4.3 --- Channel Swapping Algorithm --- p.41 / Chapter 4.4.4 --- Lower Bound --- p.43 / Chapter 4.4.5 --- Result --- p.43 / Chapter 4.5 --- Future Works --- p.50 / Chapter 5 --- Extended Application on the General Problem --- p.51 / Chapter 5.1 --- Latency Minimization --- p.52 / Chapter 5.2 --- Generalised Assignment Problem --- p.53 / Chapter 5.3 --- Quadratic Assignment Problem --- p.60 / Chapter 6 --- Conclusion --- p.65 / Bibliography --- p.67
105

Challenges faced by female teenagers in accessing contraceptives at Bylodrift Clinic, Malatane Village, Capricorn District of Limpopo Province

Mothogoane, Kagiso Andronicca January 2018 (has links)
Thesis (M. A.) -- University of Limpopo, 2018 / The study sought to provide deeper understanding on access to contraceptives by female teenagers. The aim of this study was to explore the challenges faced by female teenagers in accessing contraceptives at Byldrift Clinic, Malatane Village, Capricorn District of Limpopo Province. Qualitative research method was applied in the study. The study utilised case study research design. Purposive sampling was used to select participants. Face to face interviews were conducted with ten (10) female teenagers. The age of participants ranges from 15 years to 19 years. Thematic Analysis was used to analyse data. The negative attitude of healthcare providers was cited as a challenge for teenagers accessing contraceptives, however other participants cited positive attitude of healthcare providers. The experience of side effects, parents and partners were cited as major challenges experienced while using contraceptives. The problem of inaccessibility remains a challenge in public health facilities; participants reported long waiting times, long distance to get to the clinic, shortage of staff, lack of confidentiality and lack of proper infrastructure. Most participants indicated that they discuss contraception with their peers, therefore peer influence remains an influential factor in accessing contraceptives. The study recommended that healthcare providers should give the effectiveness rate of the contraceptive method and ways to manage side effects, health facilities need to be more user friendly and that operating hours should be convenient to teenagers who are still schooling. This is evident that young women face challenges in accessing contraceptives. Keywords: Access, challenge, contraceptives, teenagers
106

Exploring the scholarly communications landscape at the University of Saskatchewan

Dawson, Diane January 2013 (has links)
This poster presents the results of an exploratory survey to understand the current publishing behaviours, and open access awareness and attitudes, of faculty at the University of Saskatchewan. The research was conducted in an effort to establish a basis for the potential development of a scholarly communications program at the University Library. / Poster presented at the 2013 Canadian Library Association (CLA) conference in Winnipeg.
107

Investigating the scholarly communications needs of faculty at the University of Saskatchewan: Is there a role for the University Library?

Dawson, Diane January 2013 (has links)
This study seeks to understand the current publishing behaviours and attitudes of faculty, across all disciplines, at the U of S in response to the growing significance of OA publishing and archiving. The broad objective of this research is to discover what the current and emerging needs of U of S researchers are in order to determine if scholarly communications services are in demand here. And, if so, to provide an evidence-based foundation for the potential future development of such a program of services at the University Library. / Slides from a presentation given at EBLIP7, Saskatoon, July 2013.
108

Query Evaluation in the Presence of Fine-grained Access Control

Zhang, Huaxin January 2008 (has links)
Access controls are mechanisms to enhance security by protecting data from unauthorized accesses. In contrast to traditional access controls that grant access rights at the granularity of the whole tables or views, fine-grained access controls specify access controls at finer granularity, e.g., individual nodes in XML databases and individual tuples in relational databases. While there is a voluminous literature on specifying and modeling fine-grained access controls, less work has been done to address the performance issues of database systems with fine-grained access controls. This thesis addresses the performance issues of fine-grained access controls and proposes corresponding solutions. In particular, the following issues are addressed: effective storage of massive access controls, efficient query planning for secure query evaluation, and accurate cardinality estimation for access controlled data. Because fine-grained access controls specify access rights from each user to each piece of data in the system, they are effectively a massive matrix of the size as the product of the number of users and the size of data. Therefore, fine-grained access controls require a very compact encoding to be feasible. The proposed storage system in this thesis achieves an unprecedented level of compactness by leveraging the high correlation of access controls found in real system data. This correlation comes from two sides: the structural similarity of access rights between data, and the similarity of access patterns from different users. This encoding can be embedded into a linearized representation of XML data such that a query evaluation framework is able to compute the answer to the access controlled query with minimal disk I/O to the access controls. Query optimization is a crucial component for database systems. This thesis proposes an intelligent query plan caching mechanism that has lower amortized cost for query planning in the presence of fine-grained access controls. The rationale behind this query plan caching mechanism is that the queries, customized by different access controls from different users, may share common upper-level join trees in their optimal query plans. Since join plan generation is an expensive step in query optimization, reusing the upper-level join trees will reduce query optimization significantly. The proposed caching mechanism is able to match efficient query plans to access controlled query plans with minimal runtime cost. In case of a query plan cache miss, the optimizer needs to optimize an access controlled query from scratch. This depends on accurate cardinality estimation on the size of the intermediate query results. This thesis proposes a novel sampling scheme that has better accuracy than traditional cardinality estimation techniques.
109

Query Evaluation in the Presence of Fine-grained Access Control

Zhang, Huaxin January 2008 (has links)
Access controls are mechanisms to enhance security by protecting data from unauthorized accesses. In contrast to traditional access controls that grant access rights at the granularity of the whole tables or views, fine-grained access controls specify access controls at finer granularity, e.g., individual nodes in XML databases and individual tuples in relational databases. While there is a voluminous literature on specifying and modeling fine-grained access controls, less work has been done to address the performance issues of database systems with fine-grained access controls. This thesis addresses the performance issues of fine-grained access controls and proposes corresponding solutions. In particular, the following issues are addressed: effective storage of massive access controls, efficient query planning for secure query evaluation, and accurate cardinality estimation for access controlled data. Because fine-grained access controls specify access rights from each user to each piece of data in the system, they are effectively a massive matrix of the size as the product of the number of users and the size of data. Therefore, fine-grained access controls require a very compact encoding to be feasible. The proposed storage system in this thesis achieves an unprecedented level of compactness by leveraging the high correlation of access controls found in real system data. This correlation comes from two sides: the structural similarity of access rights between data, and the similarity of access patterns from different users. This encoding can be embedded into a linearized representation of XML data such that a query evaluation framework is able to compute the answer to the access controlled query with minimal disk I/O to the access controls. Query optimization is a crucial component for database systems. This thesis proposes an intelligent query plan caching mechanism that has lower amortized cost for query planning in the presence of fine-grained access controls. The rationale behind this query plan caching mechanism is that the queries, customized by different access controls from different users, may share common upper-level join trees in their optimal query plans. Since join plan generation is an expensive step in query optimization, reusing the upper-level join trees will reduce query optimization significantly. The proposed caching mechanism is able to match efficient query plans to access controlled query plans with minimal runtime cost. In case of a query plan cache miss, the optimizer needs to optimize an access controlled query from scratch. This depends on accurate cardinality estimation on the size of the intermediate query results. This thesis proposes a novel sampling scheme that has better accuracy than traditional cardinality estimation techniques.
110

Empirical analysis of the reasons cause the Digital Divide of residential internet access in Taiwan

Wang, Wei-Bin 27 July 2006 (has links)
Digital Divide in the nowadays society already are an extremely universal noun. It signified the disparity between the different communities to obtain the information equipment, thus created the variance of the ability to obtain information origin. From early telephone, computer, nowadays network and broadband to the future higher order Digital Communication Technology all might include among the information equipment. This article is studying the Digital Divide of Residential Internet Access and of the High-Speed Internet Access in Taiwan, and discusses its causing reason according to empirical analysis. Then think the correlation countermeasure to reduce the Digital Divide.

Page generated in 0.0318 seconds