Current Search: Computational complexity (x)
View All Items
- Title
- A complex system characterization of modern telecommunication systems: Application to ATM services.
- Creator
- Deecharoenkul, Wichai., Florida Atlantic University, Neelakanta, Perambur S., College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
The research addressed and reported in this dissertation primarily refers to the scope of characterizing modern telecommunication services as complex systems. The qualifying attributes, which allow such a characterization are three-folded: (i) Size of the network supporting massive traffics; (ii) heterogeneous characteristics of the traffics constituted by a mix of data, voice and video transmissions; and (iii) quality of service (QOS) considerations as met by a variety resources....
Show moreThe research addressed and reported in this dissertation primarily refers to the scope of characterizing modern telecommunication services as complex systems. The qualifying attributes, which allow such a characterization are three-folded: (i) Size of the network supporting massive traffics; (ii) heterogeneous characteristics of the traffics constituted by a mix of data, voice and video transmissions; and (iii) quality of service (QOS) considerations as met by a variety resources. Commensurate with the scope of the research indicated above, the underlying principles of information-theoretics are adopted as the background concept of the studies performed and a complexity-metric is defined via entropy considerations. Hence, the following aspects of modern telecommunications are studied: The first one refers to using entropy as a metric to assess the traffic characteristics in ATM telecommunications. Relevant heterogeneous traffic is modeled and analyzed in terms of the complexity-metric. Impairment considerations (such as cell-losses) due to queueing and/or finite-buffer sizes are estimated via information-loss specifications. The results are compared with those of conventional queueing-theoretics based analysis. The second consideration uses the complexity-metric to implement the so-called call admission control (CAC) in ATM transmissions. The complexity-metric is considered as a decision-theoretic parameter and a fuzzy inference engine is constructed to facilitate a real-time CAC. The third contribution of this research is pertinent to the development of an artificial neural network (ANN) implemented to perform CAC using the complexity-metric as the training parameter characterizing the input calls, which compete to get admission into the network. The real-time performance of the ANN in such CAC implementations is demonstrated. The fourth effort of this research is directed to portray the cybernetic perspectives of a complex system. Again, the interacting structure of the technology and economics of telecommunication systems is considered and the associated complexity is elucidated in terms of the entropy profile of the subsystems. Hence, optimized (or suboptimal) alternative designs of a network based on technoeconomical considerations are obtained. This dissertation also includes relevant literature survey and background details. It concludes with a discussion on the results and inferences on the research carried out. Further, the scope for future study is identified and open-questions are enumerated.
Show less - Date Issued
- 2000
- PURL
- http://purl.flvc.org/fcla/dt/12642
- Subject Headings
- Telecommunication systems, Asynchronous transfer mode, Computational complexity
- Format
- Document (PDF)
- Title
- Graph labeling and non-separating trees.
- Creator
- Gottipati, Chenchu B., Locke, Stephen C., Florida Atlantic University, Charles E. Schmidt College of Science, Department of Mathematical Sciences
- Abstract/Description
-
This dissertation studies two independent problems, one is about graph labeling and the other problem is related to connectivity condition in a simple graph. Graph labeling is a rapidly developing area of research in graph theory, having connections with a variety of application-oriented areas such as VLSI optimization, data structures and data representation. Furthermore, the connectivity conditions in a simple graphs may help us to study the new aspects of ad hoc networks, social networks...
Show moreThis dissertation studies two independent problems, one is about graph labeling and the other problem is related to connectivity condition in a simple graph. Graph labeling is a rapidly developing area of research in graph theory, having connections with a variety of application-oriented areas such as VLSI optimization, data structures and data representation. Furthermore, the connectivity conditions in a simple graphs may help us to study the new aspects of ad hoc networks, social networks and web graphs. In chapter 2, we study path systems, reduced path systems and how to construct a super edge-graceful tree with any number of edges using path systems. First, we give an algorithm to reduce a labeled path system to a smaller labeled path system of a different type. First, we investigate the cases (m, k) = (3; 5) and (m, k) = (4; 7), where m is the number of paths and 2k is the length of each path, and then we give a generalization for any k, m = 3 and m = 4. We also describe a procedure to construct a super-edge-graceful tree with any number of edges.
Show less - Date Issued
- 2014
- PURL
- http://purl.flvc.org/fau/fd/FA00004289, http://purl.flvc.org/fau/fd/FA00004289
- Subject Headings
- Computational complexity, Computer graphics, Graph theory, Integrated circuits -- Very large scale integration, Mathematical optimization
- Format
- Document (PDF)
- Title
- Universal physical access control system (UPACS).
- Creator
- Carryl, Clyde, Alhalabi, Bassem A., Florida Atlantic University, College of Engineering and Computer Science, Department of Computer and Electrical Engineering and Computer Science
- Abstract/Description
-
This research addresses the need for increased interoperability between the varied access control systems in use today, and for a secure means of providing access to remote physical devices over untrusted networks. The Universal Physical Access Control System (UPACS) is an encryption-enabled security protocol that provides a standard customizable device control mechanism that can be used to control the behavior of a wide variety of physical devices, and provide users the ability to securely...
Show moreThis research addresses the need for increased interoperability between the varied access control systems in use today, and for a secure means of providing access to remote physical devices over untrusted networks. The Universal Physical Access Control System (UPACS) is an encryption-enabled security protocol that provides a standard customizable device control mechanism that can be used to control the behavior of a wide variety of physical devices, and provide users the ability to securely access those physical devices over untrusted networks.
Show less - Date Issued
- 2015
- PURL
- http://purl.flvc.org/fau/fd/FA00004354, http://purl.flvc.org/fau/fd/FA00004354
- Subject Headings
- Body area networks (Electronics), Computational complexity, Computer network protocols, Computer security, Cryptography, Data encryption (Computer science), Data structures (Computer science), Telecommunication -- Security measures
- Format
- Document (PDF)
- Title
- Influence of bilingualism on simple arithmetic.
- Creator
- Nishat, Towhid, Rosselli, Monica, Florida Atlantic University, Charles E. Schmidt College of Science, Department of Psychology
- Abstract/Description
-
It has been widely hypothesized that while doing arithmetic, individuals use two distinct routes for phonological output. A direct route is used for exact arithmetic which is language dependent, while an indirect route is used during arithmetic approximation and thought to be language independent. The arithmetic double route has been incorporated on the triple- code model that consists of visual arabic code for identifying strings of digits, magnitude code for knowledge in numeral quantities,...
Show moreIt has been widely hypothesized that while doing arithmetic, individuals use two distinct routes for phonological output. A direct route is used for exact arithmetic which is language dependent, while an indirect route is used during arithmetic approximation and thought to be language independent. The arithmetic double route has been incorporated on the triple- code model that consists of visual arabic code for identifying strings of digits, magnitude code for knowledge in numeral quantities, and verbal code for rote arithmetic fact. Our goal is to investigate whether language experience has an effect on the processing of exact/approximation math using bilingual participants who have access to two languages, using a theoretical arithmetic processing model, which has been validated across many studies. We have measured the two groups (monolinguals/bilinguals) processing speed for completing the two tasks (Exact/Approximation) in two codes (Arabic digit/Verbal). We hypothesized a faster reaction time in exact arithmetic task in compared to approximation in accordance with the triple-code model. We alsoexpected a main effect for the task (Exact vs.Approximation) independent of the input code when the stimulus was presented in either Arabic digit and/or verbal codes. Our results show exact arithmetic is faster than approximation of arithmetic facts in all codes supporting earlier theories. Also, there was no significant difference in processing speed between monolinguals and bilinguals when performing the arithmetic task in either Arabic and/or verbal codes. In addition, our investigation suggests a modification to the triple-code model when interpreting arithmetic facts in verbal code due to interference of two languages with bilingual participants. Additions to the model can be suggested when the stimulus is expressed in verbal code for visual identification, which may cause interference in bilinguals leading to a first language advantage due to language experience.
Show less - Date Issued
- 2015
- PURL
- http://purl.flvc.org/fau/fd/FA00004394
- Subject Headings
- Bilingualism, Computational complexity, Mathematical analysis, Mathematics -- Study and teaching (Elementary), Switching theory
- Format
- Document (PDF)