The applied computer science of economic analyses: Internet prioritization and Internet pricing, and software engineering and software pricing for the mass market

This research examines evolving issues in applied computer science and applies economic and business analyses as well. There are two main areas. The first is internetwork communications as embodied by the Internet. The goal of the research is to devise an efficient pricing, prioritization, and incentivization plan that could be realistically implemented on the existing infrastructure. Criteria include practical and economic efficiency, and proper incentives for both users and providers. Background information on the evolution and functional operation of the Internet is given, and relevant literature is surveyed and analyzed. Economic analysis is performed on the incentive implications of the current pricing structure and organization. The problems are identified, and minimally disruptive solutions are proposed for all levels of implementation to the lowest level protocol. Practical issues are considered and performance analyses are done. The second area of research is mass market software engineering, and how this differs from classical software engineering. Software life-cycle revenues are analyzed and software pricing and timing implications are derived. A profit maximizing methodology is developed to select or defer the development of software features for inclusion in a given release. An iterative model of the stages of the software development process is developed, taking into account new communications capabilities as well as profitability. ^

A quantitative approach to the organizational design problem

The span of control is the most discussed single concept in classical and modern management theory. In specifying conditions for organizational effectiveness, the span of control has generally been regarded as a critical factor. Existing research work has focused mainly on qualitative methods to analyze this concept, for example heuristic rules based on experiences and/or intuition. This research takes a quantitative approach to this problem and formulates it as a binary integer model, which is used as a tool to study the organizational design issue. This model considers a range of requirements affecting management and supervision of a given set of jobs in a company. These decision variables include allocation of jobs to workers, considering complexity and compatibility of each job with respect to workers, and the requirement of management for planning, execution, training, and control activities in a hierarchical organization. The objective of the model is minimal operations cost, which is the sum of supervision costs at each level of the hierarchy, and the costs of workers assigned to jobs. The model is intended for application in the make-to-order industries as a design tool. It could also be applied to make-to-stock companies as an evaluation tool, to assess the optimality of their current organizational structure. Extensive experiments were conducted to validate the model, to study its behavior, and to evaluate the impact of changing parameters with practical problems. This research proposes a meta-heuristic approach to solving large-size problems, based on the concept of greedy algorithms and the Meta-RaPS algorithm. The proposed heuristic was evaluated with two measures of performance: solution quality and computational speed. The quality is assessed by comparing the obtained objective function value to the one achieved by the optimal solution. The computational efficiency is assessed by comparing the computer time used by the proposed heuristic to the time taken by a commercial software system. Test results show the proposed heuristic procedure generates good solutions in a time-efficient manner.

An indexing structure and application model for vehicles moving on road networks

Moving objects database systems are the most challenging sub-category among Spatio-Temporal database systems. A database system that updates in real-time the location information of GPS-equipped moving vehicles has to meet even stricter requirements. Currently existing data storage models and indexing mechanisms work well only when the number of moving objects in the system is relatively small. This dissertation research aimed at the real-time tracking and history retrieval of massive numbers of vehicles moving on road networks. A total solution has been provided for the real-time update of the vehicles' location and motion information, range queries on current and history data, and prediction of vehicles' movement in the near future. ^ To achieve these goals, a new approach called Segmented Time Associated to Partitioned Space (STAPS) was first proposed in this dissertation for building and manipulating the indexing structures for moving objects databases. ^ Applying the STAPS approach, an indexing structure of associating a time interval tree to each road segment was developed for real-time database systems of vehicles moving on road networks. The indexing structure uses affordable storage to support real-time data updates and efficient query processing. The data update and query processing performance it provides is consistent without restrictions such as a time window or assuming linear moving trajectories. ^ An application system design based on distributed system architecture with centralized organization was developed to maximally support the proposed data and indexing structures. The suggested system architecture is highly scalable and flexible. Finally, based on a real-world application model of vehicles moving in region-wide, main issues on the implementation of such a system were addressed. ^

The structure of games

Computer Game Playing has been an active area of research since Samuel’s first Checkers player (Samuel 1959). Recently interest beyond the classic games of Chess and Checkers has led to competitions such as the General Game Playing competition, in which players have no beforehand knowledge of the games they are to play, and the Computer Poker Competition which force players to reason about imperfect information under conditions of uncertainty. The purpose of this dissertation is to explore the area of General Game Playing both specifically and generally. On the specific side, we describe the design and implementation of our General Game Playing system OGRE. This system includes an innovative method for feature extraction that helped it to achieve second and fourth place in two international General Game Playing competitions. On the more general side, we also introduce the Regular Game Language, which goes beyond current works to provide support for both stochastic and imperfect information games as well as the more traditional games.

A generalized multidimensional index structure for multimedia data to support content-based similarity searches in a collaborative search environment

Since multimedia data, such as images and videos, are way more expressive and informative than ordinary text-based data, people find it more attractive to communicate and express with them. Additionally, with the rising popularity of social networking tools such as Facebook and Twitter, multimedia information retrieval can no longer be considered a solitary task. Rather, people constantly collaborate with one another while searching and retrieving information. But the very cause of the popularity of multimedia data, the huge and different types of information a single data object can carry, makes their management a challenging task. Multimedia data is commonly represented as multidimensional feature vectors and carry high-level semantic information. These two characteristics make them very different from traditional alpha-numeric data. Thus, to try to manage them with frameworks and rationales designed for primitive alpha-numeric data, will be inefficient. An index structure is the backbone of any database management system. It has been seen that index structures present in existing relational database management frameworks cannot handle multimedia data effectively. Thus, in this dissertation, a generalized multidimensional index structure is proposed which accommodates the atypical multidimensional representation and the semantic information carried by different multimedia data seamlessly from within one single framework. Additionally, the dissertation investigates the evolving relationships among multimedia data in a collaborative environment and how such information can help to customize the design of the proposed index structure, when it is used to manage multimedia data in a shared environment. Extensive experiments were conducted to present the usability and better performance of the proposed framework over current state-of-art approaches.

Structure of international cooperation in trade, investment and environment

This dissertation analyzes the obstacles against further cooperation in international economic relations. The first essay explains the gradual nature of trade liberalization. I show that existence of asymmetric information between governments provides a sufficient reason for gradualism to exist. Governments prefer starting small to reduce the cost of partner’s betrayal when there is sufficient degree of information asymmetry regarding the partner’s type. Learning about partner’s incentive structure enhances expectations, encouraging governments to increase their current level of cooperation. Specifically, the uninformed government’s subjective belief for the trading partner being good is improved as the partner acts cooperatively. This updated belief, in turn, lowers the subjective probability of future betrayal, enabling further progress in cooperation. The second essay analyzes the relationship between two countries facing two policy dilemmas in an environment with two way goods and capital flows. When issues are independent and countries are symmetric, signing separate agreements for tariffs (Free Trade Agreements-FTA) and for taxes (Tax Treaties-TT) provides the identical level of enforcement as signing a linked agreement. However, linkage can still improve the joint welfare by transferring the slack enforcement power in a case of asymmetric issues or countries. I report non-results in two cases where the policy issues are interconnected due to technological spillover effect of FDI. Moreover, I show that linking the agreements actually reduces enforcement when agreements are linked under a limited punishment rule and policy variables are strategic substitutes. The third essay investigates the welfare/enforcement consequences of linking trade and environmental agreements. In the standard literature, linking the agreements generate non-trivial results only when there is structural relation between the issues. I focus on institutional design of the linkage and show that even if environmental aspects of international trade are negligible linking the agreements might still have some interesting welfare implications under current GATT Rules. Specifically, when traded goods are substitutes in consumption, linking the environmental agreement with trade agreement under the Withdrawal of Equivalent Concession Rule (Article XXVIII) will reduce the enforcement. However, enforcement in environmental issue increases when the same rule is implemented in the absence of linkage.

Incorporating variable peak -to -daily ratios in the equilibrium traffic assignment procedure of the Florida Standard Urban Transportation Modeling Structure (FSUTMS)

The standard highway assignment model in the Florida Standard Urban Transportation Modeling Structure (FSUTMS) is based on the equilibrium traffic assignment method. This method involves running several iterations of all-or-nothing capacity-restraint assignment with an adjustment of travel time to reflect delays encountered in the associated iteration. The iterative link time adjustment process is accomplished through the Bureau of Public Roads (BPR) volume-delay equation. Since FSUTMS' traffic assignment procedure outputs daily volumes, and the input capacities are given in hourly volumes, it is necessary to convert the hourly capacities to their daily equivalents when computing the volume-to-capacity ratios used in the BPR function. The conversion is accomplished by dividing the hourly capacity by a factor called the peak-to-daily ratio, or referred to as CONFAC in FSUTMS. The ratio is computed as the highest hourly volume of a day divided by the corresponding total daily volume. ^ While several studies have indicated that CONFAC is a decreasing function of the level of congestion, a constant value is used for each facility type in the current version of FSUTMS. This ignores the different congestion level associated with each roadway and is believed to be one of the culprits of traffic assignment errors. Traffic counts data from across the state of Florida were used to calibrate CONFACs as a function of a congestion measure using the weighted least squares method. The calibrated functions were then implemented in FSUTMS through a procedure that takes advantage of the iterative nature of FSUTMS' equilibrium assignment method. ^ The assignment results based on constant and variable CONFACs were then compared against the ground counts for three selected networks. It was found that the accuracy from the two assignments was not significantly different, that the hypothesized improvement in assignment results from the variable CONFAC model was not empirically evident. It was recognized that many other factors beyond the scope and control of this study could contribute to this finding. It was recommended that further studies focus on the use of the variable CONFAC model with recalibrated parameters for the BPR function and/or with other forms of volume-delay functions. ^

Tree Islands in Everglades Landscapes: Current Status, Historical Changes, and Hydrologic Impacts on Population Dynamics and Moisture Relations, First Annual Report

In 2005 we initiated a project designed to better understand tree island structure and function in the Everglades and the wetlands bordering it. Focus was on the raised portions at the upstream end of the islands, where tropical hardwood species adapted to well-drained conditions usually are the most prominent component of the vegetation. The study design is hierarchical, with four levels; in general, a large number of sites is to be surveyed once for a limited set of parameters, and increasingly small sets of islands are to be sampled more intensively, more frequently, and for more aspects of ecosystem function. During the first year of the 3-year study, we completed surveys of 41 Level 1 (i.e., the least intensive level) islands, and established permanent plots in two and three islands of Levels 2 and 4 intensity, respectively. Tree species richness and structural complexity was highest in Shark Slough “hammocks”, while islands in Northeast Shark Slough and Water Conservation Area 3B, which receive heavy human use, were simpler, more park-like communities. Initial monitoring of soil moisture in Level 4 hammocks indicated considerable local variation, presumably associated with antecedent rainfall and current water levels in the adjacent marsh. Tree islands throughout the study area were impacted significantly by Hurricanes Katrina and Wilma in 2005, but appear to be recovering rapidly. As the project continues to include more islands and repeated measurements, we expect to develop a better grasp of tree island dynamics across the Everglades ecosystem, especially with respect to moisture relations and water levels in the adjacent marsh. The detailed progress report which follows is also available online at http://www.fiu.edu/~serp1/projects/treeislands/tree_islands_2005_annual_report.pd

The Structure of Games

Computer Game Playing has been an active area of research since Samuel’s first Checkers player (Samuel 1959). Recently interest beyond the classic games of Chess and Checkers has led to competitions such as the General Game Playing competition, in which players have no beforehand knowledge of the games they are to play, and the Computer Poker Competition which force players to reason about imperfect information under conditions of uncertainty. The purpose of this dissertation is to explore the area of General Game Playing both specifically and generally. On the specific side, we describe the design and implementation of our General Game Playing system OGRE. This system includes an innovative method for feature extraction that helped it to achieve second and fourth place in two international General Game Playing competitions. On the more general side, we also introduce the Regular Game Language, which goes beyond current works to provide support for both stochastic and imperfect information games as well as the more traditional games.

An Indexing Structure and Application Model for Vehicles Moving on Road Networks

Moving objects database systems are the most challenging sub-category among Spatio-Temporal database systems. A database system that updates in real-time the location information of GPS-equipped moving vehicles has to meet even stricter requirements. Currently existing data storage models and indexing mechanisms work well only when the number of moving objects in the system is relatively small. This dissertation research aimed at the real-time tracking and history retrieval of massive numbers of vehicles moving on road networks. A total solution has been provided for the real-time update of the vehicles’ location and motion information, range queries on current and history data, and prediction of vehicles’ movement in the near future. To achieve these goals, a new approach called Segmented Time Associated to Partitioned Space (STAPS) was first proposed in this dissertation for building and manipulating the indexing structures for moving objects databases. Applying the STAPS approach, an indexing structure of associating a time interval tree to each road segment was developed for real-time database systems of vehicles moving on road networks. The indexing structure uses affordable storage to support real-time data updates and efficient query processing. The data update and query processing performance it provides is consistent without restrictions such as a time window or assuming linear moving trajectories. An application system design based on distributed system architecture with centralized organization was developed to maximally support the proposed data and indexing structures. The suggested system architecture is highly scalable and flexible. Finally, based on a real-world application model of vehicles moving in region-wide, main issues on the implementation of such a system were addressed.

Enhancement of field emission from multistage structure of carbon nanotube arrays

The field emission measurements for the multistage structured nanotubes (i.e., thin-multiwall and single wall carbon nanotubes grown on multiwall carbon nanotubes) were carried out and a low turn-on field of ~0.45 V/ μm, high emission current of 450 μA at a field of IV/μm and a large field enhancement factor of ~26200 were obtained. The thin multiwall carbon nanotubes (thin-MWNTs) and single wall carbon nanotubes (SWNTs) were grown on the regular arrays of vertically aligned multi wall carbon nanotubes (MWNTs) on porous silicon substrate by Chemical Vapor Deposition (CVD) method. The thin-MWNTs and SWNTs grown on MWNTs in this way have a multistage structure which gives higher enhancement of the electric field and hence the electron field emission.

Genetic Structure of the Florida Key Tree Cactus, Pilosocereus robinii, using Restriction Site associated DNA (RAD) markers

Rare plant conservation efforts must utilize current genetic methods to ensure the evolutionary potential of populations is preserved. One such effort involves the Key Tree Cactus, Pilosocereus robinii, which is an endangered columnar cactus native to the Florida Keys. The populations have precipitously declined over the past decade because of habitat loss and increasing soil salinity from rising sea levels and storm surge. Next-generation DNA sequencing was used to assess the genetic structure of the populations. Twenty individuals representative of both wild and extirpated cacti were chosen for Restriction Site Associated DNA (RAD) analysis. Samples processed using the HindIII and NotIII restriction enzymes produced 82,382,440 high quality reads used for genetic mapping, from which 5,265 Single Nucleotide Polymorphisms (SNPs) were discovered. The analysis revealed that the Keys’ populations are closely related with little population differentiation. In addition, the populations display evidence of inbreeding and low genetic diversity.