• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • 1
  • Tagged with
  • 5
  • 5
  • 5
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 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.
1

An Adaptive Approach to Data Broadcasting in Mobile Information Systems

Chiu, Shih-Ying 18 July 2001 (has links)
With the big improvement of wireless technology, people can get their desired information at any time and any place. Due to communication asymmetry - physical asymmetry and/or information ow asymmetry, broadcast data deliv- ery is rapidly becoming the method of choice for disseminating information from server to clients. The main advantage of broadcast delivery is its scalability: it is independent of the number of users the system is serving. Acharya et al. have proposed the use of a periodic dissemination architecture in the context of mobile systems, called Broadcast Disks. Broadcast Disks can construct a mem- ory hierarchy in which the highest level contains a few items and broadcasts them with high frequency while subsequent levels contain more and more items and broadcast them with less and less frequency. However, based on Acharya et al.'s approach, some broadcast slots may be unused, which resulting in the waste of bandwidth and the increase of access time. Yang has presented a com- plementary approach to solve the empty slots problem, which also reduces the mean access time. However, based on the complementary approach, the dis- tances between slots containing the same page may not be a constant, resulting in an increase of the mean access time. Therefore, in this thesis, we propose two eÆcient broadcast programs to mitigate the above phenomenon and also to solve the empty slots problem. The rst one is a revised version of the com- plementary approach, and the second one is an adaptive approach. Most of the previous approaches assume that each mobile client needs only one data page. However, in many situations, a mobile client might need data of more than one page. Ke has proposed the SNV strategy for query set broadcast scheduling in multiple channels. In the SNV strategy, the data pages of the same query set are put as together as possible and it tries to avoid scheduling two or more pages of one query set at the same time slot of di erent channels. However, there are two disadvantages in the SNV strategy: (1) a data page with high access frequency may be scheduled at a time slot near the end of the broad- cast cycle, which results in the longer access time for requiring the whole query sets; (2) it may extend the number of slots in a certain chain, which results in the wasteness of bandwidth of the other channels. Therefore, we propose an eÆcient broadcast scheduling strategy, the Hybrid Version of the Set-based strategy ( HVS ) to improve these two disadvantages. From our performance analysis and simulation, we show that both our revised version of the com- plementary approach and adaptive approach create smaller number of slots in one broadcast cycle than Acharya et al.'s algorithm and require shorter mean access time than Acharya et al.'s algorithm and the complementary approach. Moreover,from our performance analysis and simulation, we also show that our HVS strategy requires shorter total expected delay access time, and creates smaller number of slots and smaller number of empty slots in one broadcast cycle than the SNV strategy.
2

Design and Analysis of Efficient Static Broadcast Scheduling Strategies in Mobile Information Systems

Yang, Che-Nan 28 July 2000 (has links)
With the increasing acceptance of wireless technology, mechanisms to efficiently transmit information to wireless clients are of interest. The environment under consideration is asymmetric in that the information server has much more bandwidth available, as compared to the clients. It has been proposed that in such systems, the server should broadcast the information periodically. Acharya et al. have proposed the use of a periodic dissemination architecture in the context of mobile systems, called Broadcast Disks. Using Broadcast Disks can construct a memory hierarchy in which the highest level contains a few items and broadcasts them with high frequency while subsequent levels contain more and more items and broadcast them with less and less frequency. In this way, one can establish a trade-off between access time for high-priority data and that of the low-priority items, where access time means that the time elapsed from the moment a client submits a query to the receipt of data of his (her) interest on the broadcast channel. A broadcast schedule specifies when and where each data page is to be transmitted. (Note that the smallest logical unit of the broadcast data is called a data page which is made up by data items. The time required to broadcast a data page is referred to as a time slot.) However, based on Acharya et al.'s algorithm, some broadcast slots may be unused, which resulting in the waste of bandwidth and the increase of access time, if it is not possible to evenly divide the number of broadcast pages assigned on a disk into the required number of chunks. (Note that each disk is split into a sequence of smaller units called chunks.) Therefore, in this thesis, we propose two efficient broadcast programs in which no empty slots is wasted. The first one is the binary-number-based approach and the second one is the complementary approach. In the binary-number-based approach, the broadcast frequency must be restricted to a value of 2^n , n¡Ù0, i.e. 1, 2, 4, 8..., etc; while in the complementary approach, there is no restriction on the broadcast frequency. From our performance analysis and simulation, we show that both of our proposed two approaches generate a small number of slots in one broadcast cycle (i.e., a shorter broadcast cycle) and shorter mean access time than Acharya et al. algorithm. Moreover, our first approach (the binary-number-based approach) requires a smaller number of slots in one broadcast cycle and shorter mean access time than the second approach (the complementary approach); however, there is some restriction on the chosen frequency in the first approach. Therefore, each of our proposed approaches has its own advantages and applicable domains, and both of them can avoid the wasteness of bandwidth and reduce the waiting time of clients.
3

Understanding Sociotechnical Factors Impacting Cybersecurity Controls on Mobile Devices and Smartphones at the Individual Level

Gadi, Abdullah Mohamed Y. 05 1900 (has links)
Technological advances such as mobile technology, big data, and machine learning allow businesses to associate advertisements with consumer behaviors to maximize sales. Thus, information about consumer behavior became the central resource of businesses. Recent discussions and concerns about the emerging economic order centered around capturing consumers' data suggest that more research efforts be allocated to address new challenges in different domains, such as health, education, smart cities, and communication. Research on individual cybersecurity behavior is relatively new and requires more attention in academic research. This study has proposed and validated a cybersecurity behavioral model to enrich our understanding of users' behavioral intention (BI) to use cybersecurity controls. An online survey was used to collect information from University of North Texas (UNT) students to explore various technology usage determinants and specific computer security practices. The instrument measured the actual cybersecurity controls behaviors (ACB) by incorporating technical and social factors. Accordingly, the construct of ACB was created and validated to test how it relates to the participants' behavioral intentions. The findings confirm a large number of the proposed relationships. Additionally, the results show that the model explained a significant amount of variance in the proposed dependent variables BI and ACB. Within the context of information control behavior, the relationships between the study's constructs suggest adequate generalizability and robustness of the study's theoretical framework.
4

Service-Support Systems Engineering - Ein fallstudienbasierter Ansatz zur Gestaltung dienstleistungsunterstützender Informationssysteme

Özcan, Deniz 20 July 2016 (has links)
Das Wachstum wissensintensiver Branchen hat zur Folge, dass eine auf die Bedürfnisse abgestimmte Unterstützung der Geschäftsprozesse unerlässlich ist, um im Wettbewerb bestehen zu können. Der technologische Fortschritt und die zunehmende Digitalisierung eröffnen gegenwärtig Wachstumspotenziale, die es mittels entsprechender informationstechnologischer Unterstützung zu realisieren gilt. So haben mobile Technologien in der betrieblichen Systemlandschaft Einzug gehalten, wo sie u.a. verstärkt in der Dienstleistungsbranche eingesetzt werden, um als dienstleistungsunterstützendes Informationssystem (Service-Support System) eine optimierte Bereitstellung von Services an variablen Standorten zu ermöglichen. Zuzuordnen im Forschungsfeld der hybriden Wertschöpfung liegt die Zielsetzung der Dissertation in der systematischen Untersuchung von mobilen dienstleistungsunterstützenden Informationssystemen und den damit verbundenen Gestaltungsanforderungen und -methoden, die das Design und die Implementierung eines Service-Support Systems unterstützen. Im Ergebnis umfasst diese Dissertation acht wissenschaftliche Erst- und Koautorenschaften der Verfasserin, die den Forschungsparadigmen der Wirtschaftsinformatik folgen. Es wurde Gestaltungswissen erarbeitet, welches für die Systementwicklung handlungsrelevant ist. Dabei liegt die fallstudienbasierte Forschungsarbeit der anwendungsorientierten Wissenschaft zugrunde und behandelt die Problemstellung am Beispiel des Maschinen- und Anlagenbaus.
5

Mobile Apps and the ultimate addiction to the Smartphone : A comprehensive study on the consequences of society’s mobile needs

Beckhusen, Benedict January 2016 (has links)
The smartphone is omnipresent and is cherished and held close by people. It allows for constant connection within a digitally connected society, as well as for many other purposes such as leisure activity or informational purpose. Within the Information Systems studies deeper investigation is required as to what impact this “taken – for – granted” mobile access to information and mobile apps has for individuals and society and if a “technological addiction”can be developed when using the smartphone for everything during the day on such a constant basis. The aim of this study was to understand the role of the smartphone in society and to shed light on this unclear relationship between the constant use of a smartphone and its development towards an addictive quality. To reach a conclusion, in depth – interviews were conducted with participants about their relationship to the smartphone and their smartphone use based on questions derived from literature on mobile communication technologies and the types of digital addictions existing. The results are that the smartphone is a device that seamlessly integrates into our daily lives in that we unconsciously use it as a tool to make our daily tasks more manageable, and enjoyable. It also supports us in getting better organized, to be in constant touch with family and friends remotely, and to be more mobile which is a useful ability in today’s mobility driven society. Smartphones have been found to inhabit a relatively low potential to addiction. Traits of voluntary behaviour, habitual behaviour, and mandatory behaviour of smartphone use have been found. All of these behaviours are not considered a true addiction. In the end, it seems that the increase of smartphone use is mainly due to the way we communicate nowadays digitally,and the shift in how we relate to our social peers using digital means.

Page generated in 0.1571 seconds